Since fans are digging the shows allow them to tape and trade concerts. Furthur is a great program, disigned to distribute shows. If it worked for the DEAD, MMW, Phish, WORD, Tenacious D, Missippi All Stars, Radiohead, Weezer, Ween, Beasty Boys, etc. I am sure it will work for you!
From Webster's Revised Unabridged Dictionary (1913) [web1913]:
Zilla \Zil"la\, n. (Bot.)
A low, thorny, suffrutescent, crucifeous plant ({Zilla
myagroides}) found in the deserts of Egypt. Its leaves are
boiled in water, and eaten, by the Arabs.
Durring the summer I remember reading in Discovery magazine (the date is foggy but the issue was mainly about Prozac) that computer generated actors should be in full force by the following year. It was a good read and they even went as far as to say that we won't be able to tell who's the animated actor.
The channel can be attacked, and the message read; it just takes conventional means.
Quantum cryptography is great when it works! Imagine what happens when Eve just sits on the line, (i.e. Eve observes all of the transmitted photons). Eve is effectively making it impossible for a decypherable message to pass from Alice to Bob.
What then are Alice's choices? I will give you a hint: To send the message Alice has two practicle options.
If the hint didn't do it for you,
1) Alice sends the encrypted messages using a conventional, non-single photon quantum, method.
2) Alice decides that the cost involved in Bob recieving the message is an uneconomical choice, and thus Alice will not send it.
Either way message is not sent with a single photon quantum encrytion scheme.
P.s. The man in the middle attack works with quantum crypto if multiple photons are fired because one photon from each burst can be diverted to Eves listening device.
Thank you. I needed some feedback. I believe yo are correct about the formula being wrong. My first calculations showed that a circuit will be formed after ~70 minutes. I decieded to try it calculating the probable sucsess of randomly finding another node by using the "birthday problem" http://mathworld.wolfram.com/BirthdayProblem.html formula. In any case, its about two hours before any connections are made. I know this would be ultra inefficient, I just wanted to know if it is possible.
my post was just a screen dump from the a program that guesses, calculates, the time to make the first node.
Anyway, I am not going to write this program in any form other then what I have, a simulation. My compter is slower than I need to effectively simulate 1000 nodes attempting to find other nodes like themselves in parallel. In a universe of 255^4.
On a side note though, I have simulated this with 10 nodes and 1000 possible adresses. The results are bimodal. One node will find another in a little over 20 attempts or they will search for over a 1000.
This is what I have been looking for to improve my protocol,
Calculating time to create first circuit with 1000 Friendly nodes in
a universe of 4220000000 nodes
Each Fnode has a 0.99988164206659812557 probability of randomly guessing wrong and not colliding
All Fnodes have a 0.00011835793340187443 probability of colliding per attempt
After a minute the probability of ONE Fnode colliding with another is
0.00710147600411246580 = [1 - ( 4220000000!/[(4220000000-1000)! * (4220000000^1000)] ) ] * 60 attempts per node per minute.
After an hour it is 0.42608856024674794800
Tries until one hundred percent probability of a collision = 8448.94779131183308402993
After 8448 attempts by all Fnodes the probability of a collision is 0.99988782137903518464
Or 140.80000000000000000000 minutes until first circuit
Or 2.34666666666666666667 hours until first circuit
A thought experiment,
I will show how with 1000 clients, friendly nodes (Fn), each searching the _whole_ Internet for another Fn, The first circut (one Fn finds another) is approxamitly 70 minutes.
Axioms:
1) Their are a maximum of 255^4, ~(4.22)10^9, nodes (Mn) on the net. (i.e. XXX.XXX.XXX.XXX many nodes). We are using IPv4.
2) There are a total of 10000 friendly nodes (Fn), computers possessing the server software, in existence.
3) Every (Fn) has a listening port (Lp), say 6243. (Lp) only relays one type of message to the server, "Hello, if you're like me open up a TCP to my (Rp). Let's exchange adress books". NOTE: has a life cycle of, insert arbatrary number here, seconds if not replied to.
4)Each (Fn) retains an adress book of adresses to other known (Fn)s with a time stamp that says how long it has been since this adress entry was active relative to me. Each entry in this adress book is valid untill it has been over 120hrs of operation since last contact. This insures that the Friendly nodes will not cluster and become asocial to out-side (Fn)s they will always be on the look out for a new friend.
5) Only 10% of the servers are running at any moment.
6) all nodes begin with an empty adress book
-- Experiment begins --
1000 Fns initialize for the first time at the same instant.
When a (Fn) is activated it "searches" for other (Fn)s by randomly picking an IP adress and sending a UDP, ping, to (Lp) with a message of the only type (Lp) understands. When a (Fn) randomly picks a node that happens to be friendly that friendly node will reply just as the message told it to: it connects to
Since there are a maximum of ~(4.22)10^9 nodes on the net, and 1000 of those nodes, at any moment, are friendly. Every (Fn) has a one in [ (4.22)10^9(Mn) / 1000(Fn) ], or [1/(4.22)10^6], chance of randomly picking an active friendly node.
If every active (Fn) attempted one connection per second, or (1 minute / 60 attempts), the total amount of time to create the *first* circut in this network is ( [1/(4.22)10^6] * (1 minute/ 60 attempts) * (1 / 1000 Fn) ) = 70 minutes.
Once a F. node finds another they exchanges all the information they have, (i.e. they say to eachother "here is a list of nodes that have been active durring the past 120 hrs of opperation", [when Fns are inactive they don't count the time].
Every Fn continues to search until it has setup comminucation, is actively connected, with an arbetrary, 400, number of other (Fn)s. When the maximum number of sought connections is reached each node halts it's search and only waits/ listens for nodes wanting to enter a social network. In the case that a Fn at seek capacity is contacted it replys to the random port sent in the hello message in a typical way except they hold connection only long enough to exchange information, or they stay connected, either works.
On a side note: the listening port could be 80 or another commonly used port so that people who paranoingly (spelling?) monitor their firewall logs and freak out when they get random/ wierd, pings, wouldn't freak out.
--Matt
I have read a few posts and quickly came to a conclusion that has reverberated through my thoughts before:
If I were designing a file sharing program/ protocol I would,
1) make every client independent of any server. I would accomplish this by endowing each client with a capability to remeber the ip and port adresses of clients it has encountered through out it's life, similar to a personal DNS. Each client upon download would wave a *special gift*
The special gift would be an updatable list, (it exchanges information with every client it talks to), of domains to "randomly" search looking for other clients. once it has found one client it says "Hi, I'm here, you're there, let's exchange adress books and tell others who we know that each of us is around, just incase they havent reached their quota of friendly online machines."
So the programs share all info. They share info like "if we ping 24.19.XXX.XXX we are sure to find cable modems and hence people like us who can help us branch out and find new friends". Every one does this and they have an ever changing comunity. They follow the gnuetella idea of asking all clients they are in communication with if they have a file and those clients in- turn ask their buddies until either no-one has what you are looking for or some one initiated a transfer, and if multiple people have that file they follow the Packet Chain Protocol, http://www.pcpnetworks.com, format and every one sends it to everyone who is asking and it is extra efficient so the bandwidth cops don't come knocking.
The way I think of it is, if I look at a stary night and imagine each star as a node on the net, mathmematiclly speaking, and as long as there are about 365 different options [I'm tired and think of the birthday problem] I have a better then fifty percent chance of finding another node running my program who has they same odds of finding another program to buid it's community with.
-- a 4-d line is only a sphere.
If your a troll so be it, but in Oregon we just sit in our cars and had the petrolium dispensing technician our cash/card whatever. If we are paying with a card they normally take it up front since moderm petrol pumps have a card reader on them other wise we designate the dollar amount of gassoline we would like and see if our tank will hold our request. If so, or if not, we hand the attendent our money and they return our change.
May all your dreams come true,
-- Matt
Slashdot Mirror
THIS IS NOTHING NEW
We should never have stopped at Hiroshima.
Hiroshima was the begging, NAGASAKI is where we stopped.
Oh, and FP.
Wow. That's a lot of nuclear weapons simulations.
It's going to fold protiens.
I have to ask why?
The moderators went Trolling.
They can milk you dry.
But does it do what I want?
Presumably, the turbine will drive a generator whose electricity output will drive electric motors as in a conventional diesel locomotive.
I think you meant diesel-electric .
Despite the total area being smaller, I bet the combined area is large and will continue to grow.
Err... http://furthurnet.com/ is where you can download the Furthur.
Since fans are digging the shows allow them to tape and trade concerts. Furthur is a great program, disigned to distribute shows. If it worked for the DEAD, MMW, Phish, WORD, Tenacious D, Missippi All Stars, Radiohead, Weezer, Ween, Beasty Boys, etc. I am sure it will work for you!
From Webster's Revised Unabridged Dictionary (1913) [web1913]:
Zilla \Zil"la\, n. (Bot.)
A low, thorny, suffrutescent, crucifeous plant ({Zilla
myagroides}) found in the deserts of Egypt. Its leaves are
boiled in water, and eaten, by the Arabs.
With the present and future state(s) of wireless it shouldn't be long before we have a ubiquitos new
If I wasn't -2 I'd mod you +5
You might not be that far off...
According to the Rethink Paper prganization
Why? Because they have done the analysis and they have seen the numbers and so have we. Long-term strategic planning is a logical requirement for the projected amount of wood needed to support the 2010 demand for paper in the US.
Durring the summer I remember reading in Discovery magazine (the date is foggy but the issue was mainly about Prozac) that computer generated actors should be in full force by the following year. It was a good read and they even went as far as to say that we won't be able to tell who's the animated actor.
The channel can be attacked, and the message read; it just takes conventional means.
Quantum cryptography is great when it works! Imagine what happens when Eve just sits on the line, (i.e. Eve observes all of the transmitted photons). Eve is effectively making it impossible for a decypherable message to pass from Alice to Bob.
What then are Alice's choices? I will give you a hint: To send the message Alice has two practicle options.
If the hint didn't do it for you,
1) Alice sends the encrypted messages using a conventional, non-single photon quantum, method.
2) Alice decides that the cost involved in Bob recieving the message is an uneconomical choice, and thus Alice will not send it.
Either way message is not sent with a single photon quantum encrytion scheme.
P.s. The man in the middle attack works with quantum crypto if multiple photons are fired because one photon from each burst can be diverted to Eves listening device.
-- Matt
I'm an Eagle Scout, and YES I do have the rifle shooting merit badge. -- Matt
Applarently you're not the only one considering the use of PS2s for computationally intensive tasks. Our intlegence community is eye-balling Iraq...
Thank you.
I needed some feedback. I believe yo are correct about the formula being wrong. My first calculations showed that a circuit will be formed after ~70 minutes. I decieded to try it calculating the probable sucsess of randomly finding another node by using the "birthday problem" http://mathworld.wolfram.com/BirthdayProblem.html formula. In any case, its about two hours before any connections are made. I know this would be ultra inefficient, I just wanted to know if it is possible.
my post was just a screen dump from the a program that guesses, calculates, the time to make the first node.
Anyway, I am not going to write this program in any form other then what I have, a simulation. My compter is slower than I need to effectively simulate 1000 nodes attempting to find other nodes like themselves in parallel. In a universe of 255^4.
On a side note though, I have simulated this with 10 nodes and 1000 possible adresses. The results are bimodal. One node will find another in a little over 20 attempts or they will search for over a 1000.
This is what I have been looking for to improve my protocol, Calculating time to create first circuit with 1000 Friendly nodes in a universe of 4220000000 nodes Each Fnode has a 0.99988164206659812557 probability of randomly guessing wrong and not colliding All Fnodes have a 0.00011835793340187443 probability of colliding per attempt After a minute the probability of ONE Fnode colliding with another is 0.00710147600411246580 = [1 - ( 4220000000!/[(4220000000-1000)! * (4220000000^1000)] ) ] * 60 attempts per node per minute. After an hour it is 0.42608856024674794800 Tries until one hundred percent probability of a collision = 8448.94779131183308402993 After 8448 attempts by all Fnodes the probability of a collision is 0.99988782137903518464 Or 140.80000000000000000000 minutes until first circuit Or 2.34666666666666666667 hours until first circuit
A thought experiment, I will show how with 1000 clients, friendly nodes (Fn), each searching the _whole_ Internet for another Fn, The first circut (one Fn finds another) is approxamitly 70 minutes. Axioms: 1) Their are a maximum of 255^4, ~(4.22)10^9, nodes (Mn) on the net. (i.e. XXX.XXX.XXX.XXX many nodes). We are using IPv4. 2) There are a total of 10000 friendly nodes (Fn), computers possessing the server software, in existence. 3) Every (Fn) has a listening port (Lp), say 6243. (Lp) only relays one type of message to the server, "Hello, if you're like me open up a TCP to my (Rp). Let's exchange adress books". NOTE: has a life cycle of, insert arbatrary number here, seconds if not replied to. 4)Each (Fn) retains an adress book of adresses to other known (Fn)s with a time stamp that says how long it has been since this adress entry was active relative to me. Each entry in this adress book is valid untill it has been over 120hrs of operation since last contact. This insures that the Friendly nodes will not cluster and become asocial to out-side (Fn)s they will always be on the look out for a new friend. 5) Only 10% of the servers are running at any moment. 6) all nodes begin with an empty adress book -- Experiment begins -- 1000 Fns initialize for the first time at the same instant. When a (Fn) is activated it "searches" for other (Fn)s by randomly picking an IP adress and sending a UDP, ping, to (Lp) with a message of the only type (Lp) understands. When a (Fn) randomly picks a node that happens to be friendly that friendly node will reply just as the message told it to: it connects to Since there are a maximum of ~(4.22)10^9 nodes on the net, and 1000 of those nodes, at any moment, are friendly. Every (Fn) has a one in [ (4.22)10^9(Mn) / 1000(Fn) ], or [1/(4.22)10^6], chance of randomly picking an active friendly node. If every active (Fn) attempted one connection per second, or (1 minute / 60 attempts), the total amount of time to create the *first* circut in this network is ( [1/(4.22)10^6] * (1 minute/ 60 attempts) * (1 / 1000 Fn) ) = 70 minutes. Once a F. node finds another they exchanges all the information they have, (i.e. they say to eachother "here is a list of nodes that have been active durring the past 120 hrs of opperation", [when Fns are inactive they don't count the time]. Every Fn continues to search until it has setup comminucation, is actively connected, with an arbetrary, 400, number of other (Fn)s. When the maximum number of sought connections is reached each node halts it's search and only waits/ listens for nodes wanting to enter a social network. In the case that a Fn at seek capacity is contacted it replys to the random port sent in the hello message in a typical way except they hold connection only long enough to exchange information, or they stay connected, either works. On a side note: the listening port could be 80 or another commonly used port so that people who paranoingly (spelling?) monitor their firewall logs and freak out when they get random/ wierd, pings, wouldn't freak out. --Matt
I have read a few posts and quickly came to a conclusion that has reverberated through my thoughts before: If I were designing a file sharing program/ protocol I would, 1) make every client independent of any server. I would accomplish this by endowing each client with a capability to remeber the ip and port adresses of clients it has encountered through out it's life, similar to a personal DNS. Each client upon download would wave a *special gift* The special gift would be an updatable list, (it exchanges information with every client it talks to), of domains to "randomly" search looking for other clients. once it has found one client it says "Hi, I'm here, you're there, let's exchange adress books and tell others who we know that each of us is around, just incase they havent reached their quota of friendly online machines." So the programs share all info. They share info like "if we ping 24.19.XXX.XXX we are sure to find cable modems and hence people like us who can help us branch out and find new friends". Every one does this and they have an ever changing comunity. They follow the gnuetella idea of asking all clients they are in communication with if they have a file and those clients in- turn ask their buddies until either no-one has what you are looking for or some one initiated a transfer, and if multiple people have that file they follow the Packet Chain Protocol, http://www.pcpnetworks.com, format and every one sends it to everyone who is asking and it is extra efficient so the bandwidth cops don't come knocking. The way I think of it is, if I look at a stary night and imagine each star as a node on the net, mathmematiclly speaking, and as long as there are about 365 different options [I'm tired and think of the birthday problem] I have a better then fifty percent chance of finding another node running my program who has they same odds of finding another program to buid it's community with. -- a 4-d line is only a sphere.
If your a troll so be it, but in Oregon we just sit in our cars and had the petrolium dispensing technician our cash/card whatever. If we are paying with a card they normally take it up front since moderm petrol pumps have a card reader on them other wise we designate the dollar amount of gassoline we would like and see if our tank will hold our request. If so, or if not, we hand the attendent our money and they return our change. May all your dreams come true, -- Matt
SHN is the only format worth using. It is a losses compressed .wav