|
I hope we get full marks!
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."
|
|
|
|
|
Here's my problem: I want to display a pie chart (using the awesome Zedgraph library available on CodeProject), but I don't know in advance how many slices it will have. It can be 5, it can be 25. Of course, I could define a hundred or so color constants, but that is not very elegant.
I've searched on Google for a color generation algorithm that would generate a random set of reasonably contrasting colors, but I can't find anything.
Anybody has seen anything like this? If you have or know of some source code, in any language, that would be great, C# preferred. For an example of how it should work, see Excel, no matter how many slices you add (within reason), it generates different colors for each slice.
Thanks,
Roel
|
|
|
|
|
I actually think your best way would be to create a cyclic ordered list of about 16 colors: c1->c2-> ..., c20 ->c1 ... where each color is nicely contrasted with the one in front of it (I think any real totally non color-constant based method could create high contrast colors, but would have a hard time making them be attractive).
Then you could either just keep cycling between the colors as you create boxes (and checking that the first bar color generated is high contrast with the last, which will be adjacent pie pieces), or you could tweak the r, g, and b values of each color by adding a plus or minus 3 or something to each value.
Basically, I just don't think that people can at all easily tell between more than about 20 colors the way you need them to for your app. (as an experiment if you reply to this, check out the list of emoticons you can choose from - almost all are in the orange/redish side of the spectrum. How many of those do you think you could really easily tell the difference between if you we looking for pieces in a pie? 4 maybe? So if you have 4 for each of red, yellow, green, blue, you need 16 constants).
So point is that after any hypothetical algorithm you're describing generates 16 or 20 colors or so, it'll be tough to start telling new colors apart from old. Therefore making a list of 20 color values, *hand-picked* to look particularly good together, is likely the best way to go.
If you want to add a little variety to the 20 colors, I would say take the rgb triplet of each color "generaed" and add a random number in the [-j, j] range, where j is some number you'll have to figure out empirically based on what works best. That'd be likely to be best of both worlds, I think.
|
|
|
|
|
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
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
