|
That's what I call common sense preventing over-engineering! Yes, I think you may be right. I am going to try this out. Thanks for you elaborate answer. I will let you know how it works out.
Roel
|
|
|
|
|
I've trying to read a .txt files in order to plot the data on a ZedGraph. The problem is I cannot convert the data to double. The compiler gives bunch of errors(Error 1 Cannot convert type 'string' to 'double'). The following is a piece of code that i'm having trouble with.
private void BRead(GraphPane myPane)
{
FileStream fleReader = new FileStream("kel.txt", FileMode.Open, FileAccess.Read);
StreamReader stmReader = new StreamReader(fleReader);
StringBuilder lstChars = new StringBuilder();
double x = 0, y;
int iChar = stmReader.Read();
lstChars.Append((char)iChar);
// double[] yx = new double[lstChars.Length];
PointPairList list = new PointPairList();
while (iChar > -1)
{
x = x + (double)0.0002;
iChar = stmReader.Read();
lstChars.Append((char)iChar);
y = (double)(lstChars.ToString()); //error
list.Add(x, y);
}
this.textBox1.Text = lstChars.ToString();
stmReader.Close();
CurveItem myCurve = myPane.AddCurve("My Curve",list, Color.Red, SymbolType.Diamond);
}
can anyone help me please!!
|
|
|
|
|
I've never used .net, but surely you want to convert the string to double, the ToString() function seems to convert to a String.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
Replace: y = (double)(lstChars.ToString()); //error
with: y = Convert.ToDouble(lstChars.ToString());
You are attempting to perform a cast that is not implicit. You need to use the ConvertTo function to handle this type of cast. Also, if the string does not represent a double or has characters in it that would not be used to represent a double the cast will fail.
|
|
|
|
|
y = Convert.ToDouble(lstChars.ToString()); gives the following error:
Input string was not in a correct format. what can I do about this?
Thanks for your reply.
|
|
|
|
|
This error tells me that the string that you are passing in to be converted contains something other than numbers and a decimal point. For example if you pass in "A32.41" the conversion to double will fail. If you pass in "36.42" the coversion will pass. Look to see what the actual string is when you call the convert function.
|
|
|
|
|
I'm just curious about something.
Say there is a parliamentary consituency with X number of voters. Candidates A, B, C and D are standing for election. There is also the possibility that a voter may abstane or they may spoil their paper. Thus when the results are announced it is stated how many votes each candidate received, how many abstaned, and how many spoiled ballot papers there were.
If X (the total number of eligible voters) is known. How many permutations of results will allow candidate A to win? (using a first-past-the-post system. i.e. the candidate with more votes than any other candidate. Spoiled papers and abstentions are ignored for a win)
|
|
|
|
|
Hi Colin,
that should be simple:
- abstaned/spoiled can be ignored completely, so you can remove them immediately
(rather than after doing the permutations)
- so there remain four candidates ABCD, of their permutations obviously one quarter
has A first, hence winning.
the one slight inaccuracy is the small chance that first and second place have equal
number of votes (and hence are undecided both in result and in permutation order),
but then a revote would be required, and it would again be 1 out of 4.
Going for president in Scotland ??
Regards,
|
|
|
|
|
Sorry, that's not quite what I wanted. I wanted to know how many permutations in total there would be. Also, permutations including absentee and spoiled votes do count since they are valid scenarios.
For example with an electorate of 2 the permutations are:
A B C D Absentee Spoiled
2 0 0 0 0 0 A wins
1 0 0 0 1 0 A wins
1 0 0 0 0 1 A wins
In the above, there are 3 permutations where A can win
If that chart were continued for an electorate of 45,000 voters, how many permuations would A win. Is there a formula that can calculate this?
Luc Pattyn wrote: Going for president in Scotland ??
Not quite, there are elections coming up in a little over a month and one of the "election communications" I got said that only C or D can win this seat. A or B cannot win. I just wanted to write back and claim false avertising on the grounds that mathematically there were so many permutations of results where A could indeed win the election.
|
|
|
|
|
I'm still not with you, you gave no clue as to any difference between A,B,C and D,
so they all have equal chances, and hence A/B/C/D will each win with 25% probability.
To put it differently, there are many permutations that make A win, but a similar
set of permutations makes B (or C or D) win.
Or still differently: with the given info, there is absolute symmetry.
|
|
|
|
|
So, what you are saying here is that (without spoiled or absentee ballots) there are 25% of possible permutations that allow a candidate to win. From your other post you possibly hinted that the total number of permutations was number of options (X) to the power of the number of electorate (Y): X^Y
So, discounting absentee and spoiled papers (which I don't want to do because they are valid options and do affect the balance) the number of permuations where A wins is (4^45000)/4
If that is right, then this gives me a start.
|
|
|
|
|
Right, with the exception of a tie, as I mentioned earlier (which gets more unlikely
as the number of voters increases).
Of course you realize 4^45000 is a big number.
|
|
|
|
|
also I am not convinced you should concentrate on the table of permutations, because
different lines have different probabilities, so counting the lines does not help.
As an example, assume two voters E and F; they each can vote A/B/C/D/absent/spoiled
(6 possibilities each), so there are in fact 36 different combinations (that you
would group in 30 lines):
A B C D ab sp count
2 0 0 0 0 0 1 requires E and F to both vote A
1 0 0 0 1 0 2 requires E to vote A and F to be absent, OR vice versa
1 0 0 0 0 1 2 requires E to vote A and F to spoil, OR vice versa
0 2 0 0 0 0 1 requires E and F to both vote B
0 1 0 0 1 0 2 requires E to vote B and F to be absent, OR vice versa
0 1 0 0 0 1 2 requires E to vote B and F to spoil, OR vice versa
0 0 2 0 0 0 1 requires E and F to both vote C
0 0 1 0 1 0 2 requires E to vote C and F to be absent, OR vice versa
0 0 1 0 0 1 2 requires E to vote C and F to spoil, OR vice versa
0 0 0 2 0 0 1 requires E and F to both vote D
0 0 0 1 1 0 2 requires E to vote D and F to be absent, OR vice versa
0 0 0 1 0 1 2 requires E to vote D and F to spoil, OR vice versa
1 1 0 0 0 0 2 requires E to vote A and F to vote B, OR vice versa
1 0 1 0 0 0 2 requires E to vote A and F to vote C, OR vice versa
1 0 0 1 0 0 2 requires E to vote A and F to vote D, OR vice versa
0 1 1 0 0 0 2 requires E to vote B and F to vote C, OR vice versa
0 1 0 1 0 0 2 requires E to vote B and F to vote D, OR vice versa
0 0 1 1 0 0 2 requires E to vote C and F to vote D, OR vice versa
0 0 0 0 2 0 1 requires E and F to both be absent
0 0 0 0 1 1 2 requires E absent and F spoil, OR vice versa
0 0 0 0 0 2 1 requires E and F to both spoil
Hope this helps.
|
|
|
|
|
Does this help at all?
"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15
"Judge not by the eye but by the heart." - Native American Proverb
|
|
|
|
|
I write a function called improd in m-file(bb.m).
% in bb.m file
function [ p, pmax, pmin ,pn ] = improd ( f, g )
% help22
fd=double (f);
gd=double (g);
p=fd.*gd;
pmax=max(p( );
pmin=min(p( );
pn = mat2gray(p);
But when I call improd function,it appears the error about Undefined
function improd.
>> f=[1 2 ; 3 4];
>> g=[1 2 ; 2 1];
>> improd(f,g);
??? Undefined command/function 'improd'.
How do I let matlan know that I have declare a fuction in m-file and I
want to use the function?
|
|
|
|
|
Did you save the file in your Matlab working directory?
If not you will need to add the location to your Matlab path.
|
|
|
|
|
Your function name must be the same name as your file name. Rename your file to improd.m .
-Sean
----
Shag a Lizard
|
|
|
|
|
I am writing an app that will download a 60MB file to update a DB on 20 remote users that all have 144K air cards. the internet connection that host the DB has a max upload speed of 250kbps and upload of 1MB.
I am trying to figure out at what KB will the upload speed kill the download speed.
I am also trying to figure out how to randomize the times they download the file in a controlled manner on the update flag is tripped.
Rob
|
|
|
|
|
It doesn't seem like a hard problem to solve... but I'm unsure:
"the internet connection that host the DB has a max upload speed of 250kbps and upload of 1MB" is the connection that is serving the 20 remote users? And is the upload 250k or 1M?
|
|
|
|
|
hi everyone
how can generate 100,000 unrepeated 16 digital serial numbers that dont be consecutive.
please give me your ideas
|
|
|
|
|
I've got a couple ideas, and I'd really like to help, but in order to do that, you need to explain what you mean by "not being consecutive".
If that really is what you mean, the numbers (1e16, 1e16 + 2, 1e16 + 4,...) will fit your criterion (all unique, not consecutive), but I suspect you mean something else (random perhaps?).
So what are these numbers, why do they all need to be distinct, and why do they need to not be consecutive? Answer that question and I promise I'll get back to you.
|
|
|
|
|
A simple approach would be to split your serial number into two sections. One section contains a sequential number the other is a random number. The first section will make your number unique while the second makes it non-consecutive.
If you want to have some kind of validation for the numbers add a third section containing a hash of the first two.
Hope this helps.
Tim
|
|
|
|
|
Actually, if I understand your algorithm correctly, I don't think it's the best thing to do. (Please correct me if I'm wrong though)
Basically, your set of numbers will be much less random than they should be (they will end up being much more evenly spread over the range than they would be if they were "really" random).
If you try to generate a list of a bunch of random and non-equal 4 digit numbers, the way I understand your algorithm works, it would do something like the following (got the random umbers on the right hand side from python).
10 . 47 = 1047
11 . 67 = 1167
12 . 77 = 1277
13 . 23 = 1323
14 . 01 = 1411
And you're saying that because of the numbers on the left, from 10 to 14, guarantee the numbers will be unique (which is true), and the ones on the right "randomize" the numbers. The problem is that your numbers aren't very random at all (not uniformly distributed in the range 1000-9999). If you generate 40 numbers this way, none of them will be over 5000. For a really random set of 40 different numbers, the chance would be somewhere around (but not equal to, because the numbers are all different) about (1/2)^40, which is no chance at all.
If you switch your algorithm around, by putting the random half first, you get something MUCH better. In this case, you would get the numbers 4710, 6711, 7712, 2313, 1114. Your numbers will be much, much, much more random. In this guys case, you'd generate 11 digit random numbers, and use the last 5 for the sequence. They still won't be as great as they could theoretically be. If, for example, you did statistical tests of these numbers, you would find that exactly 10% of the numbers end in 1, 10% in 2, and so on. Obviously that wouldn't be true of a "really" random set.
Basically the best way to do it is just generate random numbers in that range. There is about a one in 50 million chance you'll have overlaps if your random number generator is good.
|
|
|
|
|
Nathan A. wrote: ...
The problem is that your numbers aren't very random at all (not uniformly distributed in the range 1000-9999).
...
Of cause your are right - this is why I called my "algorithm" a simple approach.
Nathan A. wrote: ...
If you switch your algorithm around, by putting the random half first, you get something MUCH better.
...
When I suggested to use two (or three) "sections" I didn't meant to place them specifically in that sequence, just that the number can be compsed of two parts, each designed to fullfill one of the requirements.
Nathan A. wrote: ...
Basically the best way to do it is just generate random numbers in that range.
...
IMO the "best way" depends on your requirements. If the numbers must be uniformly distributed, a well known and tested pseudo random nuber generator will be the best solution. The "used" numbers can be stored and each newly generated number can be compared with this list to guarantee it is unique.
However, if you just want to generate some serial numbers for your application, which must be unique and should not be consecutive (for some reason), this approach seems to be overkill.
Regards,
Tim
|
|
|
|
|
The OP simply requested unrepeated, not random. Truly random numbers must be allowed to repeat (otherwise you are choosing from a smaller and smaller pool). For serial numbers Nathan's approach sounds fine, how you combine (or mangle) the two/three components depends on the user's requirements.
Another approach is to take the numbers 1,2 .. 100,000 and encrypt or hash them, but this is not as simple as Nathan's approach. If you encrypt them it is possible to find the original serial number if this is important.
Peter
"Until the invention of the computer, the machine gun was the device that enabled humans to make the most mistakes in the smallest amount of time."
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
