Ol?I am looking for an algorithm that gives me groups of knots in a net-structure.Every knot is connected to others ... etc ...But I want the groups in a way, that the knots in a group have no direct connection to each other!In the end every knot sould be in one group and the number of groups ...
Hi,I need informations about some special path color Problems.One is called 'Mindestabstandsf鋜bungsproblem' (German)The other 'Minimale Spannweite' (German)The first could be translated to 'minimal difference' the second to 'minimal span'The graph should be colored in a way that there ...
hi experts,i need absolutely necessary an algorithm to skeletonize foreground objects in binary images.My algorithm does not function.Please help my.greets maty
463 byte By
len00xa at 2007-9-29 20:25:22
Hallo,I have a byte array where colors are stored: 1 field R, 2 field G, 3 field B, 4 field R, 5 field G, 6 field B and so on.The byte range goes from -128 to 127 (of course).Now I want to store RGB values (range from 0 to 255) into this byte array.I tried something like bytearray[0] = ...
1646 byte By
GizmoCa at 2007-9-29 20:25:23
HelloI am taking part in the Euler Project, one of the problems is as follows:"The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 317584931803?"Now, I wrote a program that can do this. However, the problem arises with the number 317584931803. I ...
581 byte By
usImagea at 2007-9-29 20:26:17
Hi I have an array containing 16 elements, but i need to rearrange them in the array.This is the current order of the elements:(ascending order)1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16but i need to rearrange the elements into this order:1 2 5 6 3 4 7 8 9 10 13 14 11 12 15 16The array is of type ...
232 byte By
hemal4a at 2007-9-29 20:28:10
hi,i am building an application which involves the segregation of music into various genres.i am in search of the algorithm which would help me in resolving this.can anyone help me in this context?regards
4549 byte By
irulet1a at 2007-9-29 20:30:28
hi folks,I've used a brute force implementation for 8-puzzle, it exhaustively search for all possibilities until it finds a match. I have two question:1.what is the complexity of such method? is it 9!?2.the code got a stackOverFlow Error at 2351 recursive calls. The following is the code. ...
Hello everyone,I'm wondering what kind of layout I should use to have some sort of media player that has an image at the top, and 5 buttons bellow it. The thing is when a movie clip is loaded the apple takes the size of the movie, and all you can see is the movie and the last button. I'm ...
Hello,How do I change the color of a button. I have a button that has a gif image on top of it, but I want to change the color of the button itself to match the picture.b1 = new JButton (new ImageIcon("play.gif"));The button shows up fine, with the picture in it, but the button's background ...
12243 byte By
xonadicka at 2007-9-29 20:34:11
Hello,I'm creating a media player in JMF. I have a borderlayout that has a menu bar at the top, the video file that is loaded in the center, and some buttons on the south. I can open the video and play it fine, but when I try to load a new video from the menu bar, the menu itens don't show ...
HiI m developing a messenger.Can anyone help me in deciding the format I should use to save my message logs, ie. txt files or databases, How does MSN and Yahoo save message logs at server end?
HiI m developing a messenger.Can anyone help me in deciding the format I should use to save my message logs, ie. txt files or databases, How does MSN and Yahoo save message logs at server end?
Can anybody tell me how does repaint work.
688 byte By
silk.ma at 2007-9-29 20:41:20
What i mean, is consider the number 48000.I would like to reduce it to 48 ...I can't really think of a nice / optimal way to do it (i.e. letspretend we don't know the number).i.e. is it possible to find the highest multiple-10 bits set ? (i'm notreally keen on something like:if(n | 10){} ...
228 byte By
JDSVPa at 2007-9-29 20:42:16
I am having problems trying to create dijkstra's shortest path algorithm using AdjMat(i,j) i have no clue about how to go about it or how about writing code for it, so does anyone have any idea's or examples to show me?
I have this map, built up from irregular polygones. Every polygone has different terrain and "movementcost" and some polygones are not possible to enter. I would now like to be able to find out the shortest path between two pixels on the map. I want to use the A-star algorithm, and this would ...
Hi.I'm studying computing at university, and my dissertation requires me to work with sound. Amongst other things, I need to find the frequency of some sound data coming into the computer via a microphone.I understand that I need to use a fast fourier transform on this data. I have chosen to ...
283 byte By
j3boXa at 2007-9-29 20:56:33
Hi all~It may be stupid to ask but I am totally new to this java programming...i will be thankful if any kind soul can help me out on this :How do i implement new algorithms in java, using MergeSort and SelectSort as examples?thank you very much!!!
416 byte By
j3boXa at 2007-9-29 20:56:44
Hi all~It may be stupid but I am totally new to this java programming...i will be thankful if any kind soul can help me out on this :i wish to come out with a procedures that takes an int input,n, and generates an int array of n random ints with values between 1 and n. It will be better if you ...
Hi All,We need some help with calculating the number of years contained by a date range.Now that sounds simple, but I'm not talking about whole (integer) years, what I need is the number of years as a decimal value (3 places), taking leap years into account.For example, the date range ...
Hello everyone,I have this string:String frase ="c:\\movies\\animals\\crazy cat.avi";What I want is to get as a final string, in this case, "crazy cat.avi". The problem is that the String Tokenizer counts the spaces as well...Please help me creating a cycle that looks for the the last "\" and ...
Hiya ....I am trying to implement, on Java, some DB basic operations such as JOIN, UNION and so on ... does any body know where I can find either samples or implementations of these kind of algorithms ...
397 byte By
nwronaa at 2007-9-29 21:08:10
Hi,I am doing a GA problem. I have done most of it, but am unsure how to code the roulette wheel selector. I have already figured out the fitness of each chromosome and the fitness ratios. I am unsure how to code my program so it randomly selects the parent chromosomes based on the fitness ...
Greetings... I'm in the process of converting an encryption algorithm from Java to VB. but first I'd like to better grasp the concepts behind the Java routines.from what I can see, the java routines take in a string such as#58#54#58#42#50#and returns the string~b#9#XZ?沘臱?br>JAVA:private void ...
207 byte By
si-rusa at 2007-9-29 21:09:55
How it is possible to make java.awt.Frame or javax.swing.JFrame transparent or figured?On similarity that as is made in Windows (for example winamp 5.0 and others)Beforehand is grateful.
How can i claculate Complexity Analysis of the recursion methods ?regards
996 byte By
DP_devAa at 2007-9-29 21:27:53
Hi,does anyone know the algorith to find the combinations of given elememnts .for example if A,B,C,D are the given elements. like this i may have a,b,c,d ,e. so given n number of elemnts i want an algorithm to find the possible comintaionsVariuos possible combinations are 1.A AND B AND C AND ...
652 byte By
wywiwyga at 2007-9-29 21:31:31
I'm working on creating a SVD class using complex numbers. I have an adaptation of the Jama ( http://math.nist.gov/javanumerics/jama/ ) implementation coded which works great with complex numbers with only a real part, but fails when the imaginary is present. I also coded up a port of ...
1182 byte By
rkippena at 2007-9-29 21:32:48
How would the following c code be translated into Java?DCTSIZE = 8;for (int ctr = DCTSIZE; ctr > 0; ctr--) {if (inptr[DCTSIZE*1] == 0 && inptr[DCTSIZE*2] == 0 &&inptr[DCTSIZE*3] == 0 && inptr[DCTSIZE*4] == 0 &&inptr[DCTSIZE*5] == 0 && inptr[DCTSIZE*6] ...
Had an idea this morning, regarding how to get a xslt stylesheet to handle multiple input documents. Just make a stylesheet that takes the first document and produces from it a second stylesheet, which is then used on the second document. Very LISP-y. One could probably build XSLT stylesheets ...
A question about 2D which I simply cannot solve.Everybody knows MS Paint (or Paintbrush)and its paintcan: when I hit a pixel(x,y) with the paintcan-tool, all its neighbouring pixels with the same color are painted with the color of the tool.BufferedImage bi = ...//the image I am working ...
Has anyone ever played Risk? or the full campaign mode from Shogun: Total War?What I'd really like to be able to do, it to be able to have a map drawn to a window, and for the program to be able to tell what the boundries of each country are, so if I click on England, it will know the ...
Dear Friends,It will be extremely helpful for me if any one can send source code for finding all the currently switched on machines in a network for a urgent project workIf anyone find details related to this please mail toarivanval@indiatimes.com
Hi everybody:I want to sort the following numbers [2,3,7,9,10,2,7,9,10,3,7,9,2,9,10] in to the folling:[2,2,2] [3,3] [7,7,7] [9,9,9,9] [10,10] by every unique numberThe algorithm must be very fast because i generate diffrent raports with this numbers.It must also be independed of spefic values ...
I have just started learning java and discrete maths and am attempting to write a programme to calculate the solutions of a quadratic equation. I have a problem in that I do not know how to programme the square root of a value. If anyone was able to help I would be most appreciative.
Hello all - Thanks for reading my question.Here's my problem: I am looking for a faster hashing algorithm to generate a unique hash based on two Integers (TestNumber and SubTestNumber). The current (funcitonal) algorithm I'm using is to take the hashcode of the String: "[TestNumber] ...
143 byte By
vedu1a at 2007-9-29 22:30:27
We r working on java cards, We r facing the problems in storing Digital Certificate On Java Card ? Can u help me?
Hi everyone,I was working with large and complex DAG's applying Sugiyama algorithm to see it in a hierarchy. I have a question about the second phase of the algorithm execution where you need to reverse the two vertices with equal barycenter values, and apply phase 1 so that the algorithm can ...
Hi there! I have this scenario: An applet where some shapes (Ellipses) are drawn. Each ellipse is an object, one of it's properties is relation to another ellipse. From each ellipse, an arrow should point to the one it's related to, could be more than one.What my applet does is, print the ...
I have a potential problem regarding various objects updating each other. Say I have 3 objects: A, B, and C. When I make a change to A's data, A tells B to check for an update. If B is updates, it tells C to check for an update. If C updates, it tells A to check for an update. Round and round ...
Help, Everyone!I am a high school freshman in serious need of some Java source code.Basically, I am creating a Java program to calculate sine wave regression equations, based on coordinate data (x,y from a data file or from user input). Using the input data, I want to analyze it and determine a ...
Hi,not being an math&algorithm expert I'm looking for an algorithm for generating r-combinations with repetitions from a given set. i.e.: set = {A, B ,C}. 3 picks will give the following possiblities:AAA-AAB-AAC-ABB-ABC-ACC-BBC-BCC-CCC.thanks!Tobias
I have a need to compare an array, say of 256 elements with many other arrays lets say 1200.I am wondering whether there is a way to reduce each array to a single value and then compare these values?Ultimately i wish to find the array out of all 1200 which is most similar to the selected array. ...
850 byte By
Mordana at 2007-9-29 23:08:45
Hello,On the hypothesis the keys are Strings of size varying from 1 to 100, the number of keys n can vary from 10 to 1000.However, we have one crucial information: we know before launching the value of n. I know the theory behind TreeMap and HashMap.TreeMap (red black tree in java.util.TreeMap) ...
Okay, I have a JTextField with wrap on. It's setEditable(false). The string in it is going to be changing constantly and the field has a fixed size. I'm trying to come up with a method that will determine the maximum sized font that will be able to fit in the TextField without requiring a ...
168 byte By
nille40a at 2007-9-29 23:18:28
Hi!Could someone explain QuickSort to me? I've looked on the internet, but can't seem to find a good explanation...Thanks in advance,Nille
I have a 2-D array that looks simliar to this:1 0 0 01 1 0 02 0 0 02 1 1 11 2 1 02 1 2 03 1 1 14 1 0 02 1 1 2. ....I am trying to come up with an algorithm that will sort this array by the first column, then the second, then the third, then the fourth. But I'm stumped. The array above should ...
I need some help on term frequency (how to store the data)I have severals document that will be parsed and tokenized for words (also apply stoword and stemmer).The word are then stored in the database (where the word is the primary key). given the equation let td = # of time the term t appear ...
I need to write this program for transmitting bits across a network and I need to use bit stuffing (has to be at the bit level). I understand how bit stuffing works - inserting zeros after 5 consecutive 1's and so on and so forth...My problem is, what happens if you want to send a bit sequence ...