| WIKI | FAQ | Tech FAQ | |
 http://csua.com/feed/ | |
| ||||||
| 5/24 |
| 2003/11/20-21 [Computer/SW/Languages/Java, Computer/SW/Languages, Computer/HW/CPU] UID:11153 Activity:nil |
11/19 My lab got a bunch of computers and it's idling most of the time.
I guess I could download that ET signal program, but what other
things can I use it for?
\_ http://www.mersenne.org/prime.htm
\_ cure cancer!
http://www.stanford.edu/group/pandegroup/folding
\_ I recommend omega@home! Join the worldwide effort to solve all
open mathematical problems! -- ilyas
\_ can't find it on google
\_ Sorry it's a bit of a geek joke. The program doesn't
exist yet, but the "all" is actually real. The idea
is that you want to find bounds on a certain
number called Chaitin's omega. If you know something
about that number you can solve lots of problems.
In fact, if you know that number precisely you can
solve any problem which can be precisely stated.
You get lower bounds by simulating programs until they
stop, and you get upper bounds by searching for programs
that print certain strings.
-- ilyas
\_ didn't you learn in high school to take "all" with a
grain of salt? i guess not, since you never learned
to format either.
\_ who learns to format the motd in high school....
\_ I had that in class.
\_ Duh. Game servers.
\_ Well, that consumes bandwidth too.
\_ So? If the lab is idle most of the time, it's idle.
\_ http://www.fightaidsathome.org
\_ I seem to remember there was a guy in your situation and his
university fired him and had him charged with unauthorized use
of their equipment and he got like 1 year of probation and a big
fine. Sorry, don't remember the exact details.
\_ IIRC it was the UofGeorgia. I didn't know Georgia even had a
university. I thought they stopped at 5th grade.
\_ Turn them off while not in use. Saves power. |
| 5/24 |
|
| www.mersenne.org/prime.htm On November 17, 2003 Michael Shafers computer found the 40th known Mersenne prime, 2 20,996,011 -1! This is also the largest known prime number, surpassing GIMPS last discovery by over 2 million digits. You can download the client for your chance at finding the next world record prime! A forum for newcomers is available to answer any questions you may have. Congratulations to Michael and every GIMPS contributor for their part in this amazing discovery. For more information, check out these links: This NewScientist article was one of the first to break the news. Eric Weissteins fabulous mathworld web site also published an article within an hour of the announcement. Chris Caldwell, who maintains the Internets premier web site on prime numbers, writes a unique article every time GIMPS finds a new prime. The BBC , Lansing State Journal , and Michigan papers also wrote stories. Scott Kurowski, who runs the server that controls GIMPS massive CPU power, wrote this press release . Crandalls company which developed the FFT algorithm used by GIMPS, makes a poster you can order containing the entire 6,320,430 digits. It is kind of pricey because accurately printing an over-sized poster in 1-point font is not easy! You could discover one of the most coveted finds in all of Mathematics - a new Mersenne prime number. In addition to the joy of making a mathematical discovery, you might win some cash. The Electronic Frontier Foundation is offering a $100,000 award to the first person or group to discover a ten million digit prime number! See how GIMPS will distribute this award if we are lucky enough to find a ten million digit prime. Prime numbers have long fascinated amateur and professional mathematicians. An integer greater than one is called a prime number if its only divisors are one and itself. For example, the number 10 is not prime because it is divisible by 2 and 5. GIMPS, the Great Internet Mersenne Prime Search, was formed in January 1996 to discover new world-record-size Mersenne primes. GIMPS harnesses the power of thousands of small computers like yours to search for these needles in a haystack. Most GIMPS members join the search for the thrill of possibly discovering a record-setting, rare, and historic new Mersenne prime. Site Map The How it Works page tells you what hardware you need and how the program runs. The benchmarks page compares the programs speed on many different CPU types. The Top Producers page ranks participants by CPU time contributed. The Source code page lets you download the source code and gives UNIX users a pointer to code they can use. The Mailing list page lets you subscribe to a mailing list that discusses Mersenne numbers. The Manual testing page lets you pick exponents to test if you cannot get the PrimeNet server to work. The Credits page lists many of the people that have helped GIMPS over the years. The Other projects page gives you pointers to other distributed computing projects. Last updated: February 28, 2004 You are visitor number since August 1, 1996 courtesy of WebCounter. Getting started: Main page How it works Download FAQ Benchmarks Prizes Learning more: History The math Source code Mailing list Project status: Status Top producers PrimeNet Miscellaneous: Manual testing Credits Links Feedback Other projects . |
| www.stanford.edu/group/pandegroup/folding -> www.stanford.edu/group/pandegroup/folding/ Our goal: to understand protein folding, protein aggregation, and related diseases What are proteins and why do they fold? Before proteins can carry out their biochemical function, they remarkably assemble themselves, or fold . The process of protein folding, while critical and fundamental to virtually all of biology, remains a mystery. Moreover, perhaps not surprisingly, when proteins do not fold correctly ie misfold, there can be serious effects, including many well known diseases , such as Alzheimers, Mad Cow BSE, CJD, ALS, and Parkinsons disease. FoldingHome is a distributed computing project which studies protein folding , misfolding, aggregation, and related diseases . We use novel computational methods and large scale distributed computing, to simulate timescales thousands to millions of times longer than previously achieved. This has allowed us to simulate folding for the first time, and to now direct our approach to examine folding related disease. |
| www.fightaidsathome.org -> fightaidsathome.scripps.edu/ The Resistance Part I: From Petri Dishes to Population Dynamics New! The Resistance Part II: Fighting HIV Resistance At Home and in the Laboratory So what is FightAIDSHome? FightAIDSHome is the first biomedical distributed computing project ever launched. It is run by the Olson Laboratory at The Scripps Research Institute , and uses your computer to assist fundamental research to discover new drugs, using our growing knowledge of the structural biology of AIDS. About 42 million people are living with HIV or AIDS around the world. If there is any bioterrorism in the world, it comes from Nature itself, in the form of HIV, and we need to fight this very real and long-standing problem now - more than any other threat to humanity. Your CPU helps to screen millions of candidate drug compounds computationally against detailed models of evolving AIDS virusesan accomplishment previously impossible without expensive supercomputers. FightAIDSHome accelerates AIDS research by connecting you to a global grid of distributed computing power. Your donation of spare computer cycles helps us in our entirely non-profit, scientific endeavours. Entropia helped to launch the FightAIDSHome project, and we are grateful for their help and donated efforts, but as of May 2003, FightAIDSHome is no longer associated with Entropia. About Us Professor Olson leads a large program project funded by the National Institutes of Health to develop new approaches to discover novel AIDS therapeutics based upon our ever-increasing knowledge of the structural biology of HIV. We are working together with other laboratories here at Scripps and elsewhere, to design, synthesize and test new HIV protease inhibitors that are better than existing drugs in defeating the viruss ability to develop drug resistance. |