khaled

If you want to implement a cycle detection, you need a graph search, using a Queue with a good heuristic, and a marking list, If you look up Wikipedia, you can find a complex but good algorithms, especially ones that run in Polynomial time and in open graphs (graph with infinite number of vertices) .. since cycle detection is a Decision Problem,

Q1: do you use Linux with GNOME or KDE ..? Q2: you installed Linux on a disk partition directly or you installed Linux inside windows ? note: first you have to check if your BIOS disabled your hardware, or limiting some of them, check BIOS for details and check the manual of your Cards, then when BIOS is validated, move to Linux (recovery mode) and check for settings and everything else ...

Are you good in Research and Teaching ?

This is my guess .. My assumption is 30 %

These are lists of PHP hosting providers: http://phpweby.com/hosting/php http://www.webhostingsearch.com/php-web-hosting.php Good luck ~khaled

Shouldn't the derivative of f(g(x)) = f'(g(x)) * g'(x) ..? [imath]f(x) = \sqrt{x}[/imath] [imath]g(x) = 29 \tan^{-1}{(x)}[/imath] [imath]\frac{dy}{dx} f(g(x)) = f^{'}(g(x)) \times g^{'}(x)[/imath] [imath]\frac{dy}{dx} \sqrt{29 \tan^{-1}{(x)}} = {(\sqrt{29 \tan^{-1}{(x)}})}^{'} \times {(29 \tan^{-1}{(x)})}^{'}[/imath] [latex] = \frac{1}{2 (\sqrt{29 \tan^{-1}{(x)}}) } \times \frac{29}{1 + x^2} [/latex] [latex] = \frac{29}{2 (\sqrt{29 \tan^{-1}{(x)}}) \times (1 + x^2) } [/latex]

Your answer is true, if we are not working according to given Algorithm or a method, Well, i study clocks and synchronization, calculations are needed to elect clocks ... his problem has many options: - choose two clocks that chime with minimal drift, 2 chimes hourly, - choose two clocks that chime perfectly at some point, the second clock is faster by some rate, they meet -- at some point, the faster clock should chime at (assuming that drift is measured by minutes) (60/drift)*60 O'clock -- the slower clock will chime at ((60/drift)*60) - 1, - choose two clocks with minimal drift from nominally perfect reference, to chime on a synchronization point -- synchronization point is where clocks are synchronized to interpolated value between readings,

? Just to let you know, this question is under Theoretical Computer Science - Distributed Systems - Synchronization & Clocks ... > you have 5 Clocks, denoted C1, C2, .., C5 .. with different consistent rates ... 1. you calculate Clock-per-Clock Drift (difference in rate), so you have 10 drift rates ... ---- Dij = rate difference between Clock Ci and Clock Cj 2. get minimal Dij among the 10 Drift Rates 3. by choosing Dij, you keep Clock Ci and Cj only, throwing other clocks :: you will get 2 ticks per hour, unless if Dij (minimal D) is Zero, but the error is minimized as possible ... ---------------------------------------------------------------------------------------------------- example: assume that every clocks, gives the skew (difference in reading) per second: -- C1 = -1.05, C2 = +0.8, C3 = +0.2, C4 = -1.0, C5 = +0.35 Dij: D12 = 1.85, D13 = 1.25, D14 = 0.05, D15 = 1.4, D23 = 0.6, D24 = 1.8, -- D25 = 0.45, D34 = 1.2, D35 = 0.15, D45 = 1.35 choosing minimum Dij: D14 = 0.05 solution: keep clocks C1 and C4, throw other clocks result: you will get two ticks with 0.05 difference every hour constraint: the clocks must be hourly synchronized

I haven't read any book but what i think is that teaching a child math concepts need to transform the concepts into games, I suggest the following: - Count Specific Cars in the other side of the street (group game in car) - Addition and Subtraction using logos at home - play monopoly, learn how to count money, and raise odds on bets - Ask your child about the change before getting the change in a shop - Multiplication using group theory (ex: if you have 5 dollars, and so 5 boys, how many dollars we have seen ?) - Multiplication by letting the child look at a matrix of glass windows of a building ...

This is not a homework, there is nothing called "love" in mathematics, It's just a personal question...

How would you represent Love mathematically ..?

I love my Casio Calc that have the Natural-View, it shows equations like if they're written in the Notebook, standard Calc shows: [imath]c = a/b[/imath] natural-view Calc shows: [imath]c = \frac{a}{b}[/imath]

This won't work, if you want to make a dough of your own, you have to know what a standard dough is made of ... Symmetric Cryptography is based on Rounds consisting: - XOR, AND, OR, SHIFT(s) - Key Generation - Pad Generation - Expansion - Reduction - Substitutions - Permutations - Matrix Operations ... Good luck on your work ...

If you wanna go for a computer forensics job, you need certifications in NETWORK, SECURITY, and LINUX

It's good to relax your definition to check things better in mathematics, So, what i think is as following ... [imath]a > 0[/imath] and [imath]b > 0[/imath] and [imath]c = \frac{b}{a} > 0[/imath] [imath]\frac{0}{a} = \frac{b - b}{a} = \frac{+b}{a} + \frac{-b}{a} = \frac{b}{a} - \frac{b}{a}[/imath] [imath]\frac{0}{a} = c - c = 0[/imath] I hope my induction is simple enought ...

So, it's Modular Arithmetic in [imath]\mathbb{Z}_2[/imath]

You don't understand, the loop and the statement are the same operation, in the loop you add x to a 16384, which is equal to adding x to a 16384 times, which is adding x * 16384 to a ... It's basic mathematics, I have read your javascript source code on the website too ... one more thing, my design is actually an Architecture for a Numerical Noise Generator, based on Noise Simulation ... The source code is abstract and needs to implement many PRNGs for it to start working ...

I didn't take the idea from anywhere, I thought it up, I was starting a numerical Analysis to figure out some certain constraints of some numbers ... Like, is there an odd perfect number ..? I'm working in my free time on that question ...

I have experience in Cryptography field, Time is used in Cryptography for Authentication, Authorization, One-time key, One-time Ticket, Time-Integrated message exchange ... But, if you use Time\Clock in a PRNG, then it's not Safe anymore, but it gives you a good robustness ...

assume E is any even number, and O is any odd number E = O + 1 O = E + 1 E + E = E E + O = E + E + 1 = O O + O = ( O + E ) + 1 = O + 1 = E E * E = E E * O = E O * O = O note: if a given (O = O * O) then that O can only be factored by odd numbers. what do you think ..? I also think that, given that A & B & O are odd, and C & D & E are even ... C * D = E (A+1) * (B+1) = E AB + A + B + 1 = E odd*odd + odd + odd + 1 = odd+1 = even C * A = D, and C = B+1 (B+1) * A = D AB + A = D odd*odd + odd = odd+odd = even A * B = O (C+1) * (D+1) = O CD + C + D + 1 = O even*even + even + even + 1 = odd

death has many meanings cutie, like sleep, brain stop, coma, ...

you mean base-4, QUADRATIC, { 0000, 0001, .. , 1111 } means [latex]2^4 = 16[/latex] possibilities .. can be represented in HEXADECIMAL { 0, .. , 9, A, .. , F } every digit (or two\three) is enough to encode a value, 1 base-4 digit = [latex]2^4 = 16[/latex] possible values 2 base-4 digits = [latex]2^4 \times 2^4 = 256[/latex] possible values 3 base-4 digits = [latex]2^4 \times 2^4 \times 2^4 = 4096[/latex] (4K) possible values amazingly, if we go for 4 base-4 digits = [latex]2^4 \times 2^4 \times 2^4 \times 2^4 = 65536[/latex] (64K) possible values ! and if you go little bit ahead, it will go galactical ... also about the safety of data, i don't think there is any safety, it's genetic-based, using population approximation and the possibility of mutations ...

The DNA is not a 4-bit-storage, it's alot more than that, and also (what I think) that the DNA is used to store a unique generic data that identifies the human, it's more like the perfect hash .. it is also the reference for every component of the body to get information about how to work, for example color of the skin is stored in the DNA all over the body ...

I don't really know but, it's said that when one sleeps his soul leaves the body,