Algorithms / Advanced Math Forum

Hello, I have the following code ( generated by IDA ) void MakeKeyData(char *lpszKeyString) { md5 = EVP_md5(); EVP_Digest(lpszKeyString, strlen(lpszKeyString), pKeyData, 0, md5, 0); RC4_set_key(&RC4Key, 16, pKeyData); }

I have a system that generates a 24ch alpha-numeric string as a tracking number. An example looks like this - 1898240001631501AKL003HS. This is great for what it does (there is information embedded in that string that tells me stuff that I need to know). However, when a customer tries to use an IVR or web site to self service (a tracking...

I am an experimental research engineer working on a Laser experiment. The details do not matter but due to practical limitations my data is influenced by the following transformation during data acquisition, and I was wondering if there is a mathematical method or an algorithm to "undo" its effect on the captured signal, that is to get the...

Hi all, in advance I want to appreciate any answer and suggestion on this problem, I am am working on a GPS tracker module (Model: m528), It's poorly documented so I dont have any paper on the data format which it sends, I have my own server that listens to a special port and gets the data packets sent by the module, I know the position...

To reduce the waste materials. For example: There have materials list to buy materials from the market with different size in where they need to cut them according to their size in house. Such as: Material name is: 75 x 25 x 5 EA Materials standard size is available in the market is: 7 Meter, 9 meter, 12 meter, 16 meter. You need the...

Any pointers to algorithms to find "Fundamental Cutsets of a graph or a tree"

hi for all byte's member :D just want to ask, recently i've tried many of programming language. And as my test application, i want to create a little program that simulating train traffic. i,e. train go from station A then station B. After that, the train have moving reverse, from B to A train@station A B...

hi i am writing a program in C++ to evaluate some sorting algorithms and i need to measure the hoe much memory the algorithms take to perform the sorting but i don't know if C++ have any tools or codes do this task.

Hey, I'm trying to find an algorithm to approximately match different substrings within a master list, with some forgiveness on spelling. Say you are allowed 3 errors in the string match: Defining error: having to remove or add a character. If you have to replace a character, that counts as 2 errors. Also the search is case-insensitive for...

Hi, I have a problem, when an equation given to you, for instance, a*b+c/d*e-f, how do you find the operator precedance in the equation and parenthesize it accordingly? Is there any algorithm or such thing, which can help me do that Please help me Thanks in advance

i'm learning algorithm analysis, about the different notations, and in class we wrote an example: f(n) = 1/2*n^2 + 3n, and wrote it using O-notation, Ω-notation and Θ-notation: T(n) = Ω(n) T(n) = O(n^2) T(n) = Θ(n^2)

Hello everyone, I'm having some trouble with the code for merge sort. I get what is it but the code doesn't seem to work. Here is my code: ////.h #include <iostream> #include <string>

how to make te pseudocode for the newton raphson's method in matlab program

Hi, I try to understand galil-giancarlo algorythm but there is no any explanatory resources. I dont understand how to fill h and shift table. Filling tables is the preprocessing of the algorythm ifI understand the table filling I understand all algorythm, if you understand this algorithm please help. Best regards..

what is the next number in the given sequence 1,2,4,13,31?

Hello, I would like to know if someone can help me to do a bookshop for unpack a few files of textures or at least, that it(he,she) throws a bit of light and indicates me like to begin. Pardon for the translations of goolge, they are pernicious... 4 bytes - Magic ('RSC') 4 bytes - Type (version - textures has "7") 4 bytes - Flags From 'flags'...

i need the algorithm for file allocation methods..

hi guys,does anyone know any random sequence with finite alphabets.please show as many examples as possible with the(probably recursive) formulas.thanks for any replies.p.s for the replies to my last post,josah and the rest of the guys,the replies were quite illuminating.

Greetings everyone, Does anyone know the best or most commonly used polynomial that approximates the log function (base 2 ,base10..) apart from taylor series.thanks.

Let x,y be finite real valued sequences defined on 0...N-1 and let g be a non negative integer . define z (formula is in this link): http://oi59.tinypic.com/16jn907.jpg also on 0..N-1. In addition, the DFT of y is known in a closed form. Is there a way to write z as some cyclic convolution, so that with the help of the convolution theorem...

Hi everyone! This is my first time posting a question here. I am working on automotive instrument clusters. I need help figuring out the formula they use in the examples below. I can read the codes they use in the Eprom and see the "answer" on the digital display on the instrument cluster. I just can't figure out the formula. ANY HELP WOULD BE...

I'm looking for an algorithm to find the smallest ellipse circumscribed around any polygon. It doesn't matter if the polygon is convex or concave, or how many corners it has. What counts is that it's a set of points (extremes) and its surface is continuous. Imagine a city of an irregular shape that we want to surround with the smallest ellipse...

I am trying to encrypt/decode this 54 58 13 03 51 10 06 57 44 54 57 4b 06 02 13 51 54 14 57 51 40 5b 00 43 50 51 13 06 56 42 50 54 The other things it says is that 0a 00 02 12 18 14 17 0f 14 17 0f means happyfunfun. Can anyone/decode/figure this out?

Hi I am trying to test to see if there is a link between the curve of a mouses movement and the length from the ball to the wrist (pivet point). I am recording a series of points as the mouse moves approxamatly every 20ms. From this I need to try calculate a circle of best fit from idealy 2 points or 3. I was thinking start, middle and end...

hey, can someone help me with this problem- if every time K pivots are chosen and every pivot gets a linked list attached to it, with the numbers that are between this pivot and the next, and we do this QS on those linked list again and again. how can I prove that this algorithm CAN'T be better than the usual QuickSort?