|
GUESTS POSTS
|
 |
GUESTS - email address needed to post
**** Email address required to post here. To Register for the forum -- Use the "REGISTER" Button on the top Menu bar.*** A place for Guests to post in the Team Forum. Your email address must be entered or you will get an error and anything resembling spam will be deleted.
|
111 Posts in
13 Topics
|
Last post on 01 March 2008, 12:31:01
in Re: WCG-Bunny-Race by Mike Mitchell
|
|
General Category
|
|
Open Discussion
Feel free to talk about anything and everything in this board, within reason as children may read the board.
|
3309 Posts in
196 Topics
|
Last post on Yesterday at 22:16:35
in Re: Core 2 Quad by veebee
|
|
All things LINUX
The name says it all
|
1273 Posts in
89 Topics
|
Last post on 07 May 2008, 13:37:23
in Re: Adjusting system... by Mike Mitchell
|
|
All things overclocking
Anything to do with overclocking your computers goes...
|
28 Posts in
3 Topics
|
Last post on Today at 18:18:34
in Re: Q6600 by Mike Mitchell
|
|
GAMES
All Game related posts
|
203 Posts in
10 Topics
|
Last post on 09 April 2008, 08:21:39
in Re: Handshake Game by Wang Solutions
|
|
Milestones
A place where people can announce their achievements (or those of others if they spot them Grin
|
3949 Posts in
94 Topics
|
Last post on Today at 17:49:04
in Re: Personal Milesto... by Mike Mitchell
|
|
STATISTICS
Place all posts related to Statistics for the team or for individuals
|
206 Posts in
11 Topics
|
Last post on Yesterday at 20:18:26
in Re: BoincStats playi... by Allen
|
|
Swapmeet
Got some computer equipment to sell, trade or give away? Or are you looking for some parts? Offer it here/
*** THIS IS A TRIAL *** COMMERCIAL ADVERTISING IS FORBIDDEN ***
|
129 Posts in
25 Topics
|
Last post on 29 March 2008, 10:32:27
in E4300 CPU. mobo, RAM... by Webmaster Yoda
|
|
WEB CAMS
If you have a web cam that can be looked at by all ages of people. ie "G" Rated Put a link in this Board. This board is open to Guests but guests cannot post here.
|
5 Posts in
1 Topics
|
Last post on Yesterday at 04:36:03
in Re: Web Cam - by Neilius
|
|
WORD LINK
To keep the game fun and honest, please read the rules in the first post or here before posting to the word game.
Rules.
1) Single word posts only.
2) Hyphenated words count as one word
3) You can not respond to your self (We are all sane here, no talking to yourself Cheesy)
4) Try to keep it reasonably clean.
5) English only.
Its a simple game where you say a word which is somehow related to the last word. It can be literally related (cow - udder), or unliterally (udder - rudder).
An example would be cow -> udder -> rudder -> steering -> wheel. They are fun and quick. If you get a chance you just post a word.
|
8894 Posts in
12 Topics
|
Last post on Today at 18:20:39
in Re: Re: Word Link --... by Mike Mitchell
|
|
BOINC Projects
|
|
3x+1@HOME
3x+1@home is a distributed non-profit project trying to find 3x+1 conjecture stopping time records.
The 3x+1 conjecture is also known as Collatz conjecture, more information can be optained here (http://en.wikipedia.org/wiki/Collatz_conjecture).
You can participate by downloading and running a free program on your computer.
|
30 Posts in
2 Topics
|
Last post on 06 May 2008, 23:19:17
in Re: New Project by dingo
|
|
ABC@HOME
ABC@home is a distributed computing project enabling a great search for so called abc-triples. The project is comparable in a way to GIMPS, another mathematical project. These abc-triples are positive integers a,b,c such that a+b=c, a < b < c, a,b,c have no common divisors and c > rad(abc), the so-called radical of abc.
The ABC conjecture says that there are only finitely many a,b,c such that log(c)/log(rad(abc)) > h for any real h > 1. The ABC conjecture is currently one of the greatest open problems in mathematics. If it is proven to be true, a lot of other open problems can be answered directly from it.
|
342 Posts in
18 Topics
|
Last post on 14 April 2008, 02:57:14
in Re: Closing in on th... by Webmaster Yoda
|
|
ARTIFICIAL INTELLIGENCE SYSTEM
he neural network simulator is an application that simulates neurons. Each downloaded work unit generates 100,000 biophysical neurons. Because the simulator is in an initial phase and we have very few cellular models implemented, we can only use it to test for simulations capacity. To date the largest brain simulation has been done on a cluster of 27 machines, with 100 billion neurons simulated over a period of 50 days. While it was a very interesting experiment which pushed the frontier further on it was a partial simulation only, in the sense that many of the required components were not implemented due to hardware constraints.
The neurons were created, simulated and then destroyed in memory, without any data being stored. Based on their results the estimate for full brain simulations was calculates to be the year 2016; we would like to prove otherwise. From a practical point of view it didn't advance the knowledge further on and that's why we would like to continue along this line of thought and bridge these results with some practical data. The problem of storage and computing power is esential for large scale brain simulations because without them we can't plan and estimate these requirements. Without planning there is also no clear understanding as to what is needed in order to do that. As we advance with the simulation and more and more neurons get simulated, we should be able to make increasingly precise estimations on storage, number of computers required, duration, bandwidth and other factors. Regardless of the fact that at this stage our simulation is not precise and it lacks in many aspects, this is what we want to achieve with your help.
There is also the added benefit that once we will publish these results and the public at large would see that the capacity to simulate the entire brain is considerably higher than previously thought, a large stumbling block will be removed from the path of artificial intelligence.
|
9 Posts in
2 Topics
|
Last post on 21 April 2008, 20:42:10
in Update by dingo
|
|
BELGIAN BEER@HOME
Not Known
|
3 Posts in
1 Topics
|
Last post on 23 March 2007, 03:47:30
in Re: Beer bottles ava... by BF
|
|
BURP
BURP aims to develop a publicly distributed system for rendering 3D animations.
|
1 Posts in
1 Topics
|
Last post on 07 March 2007, 19:50:04
in BURP having troubles... by John Hunt
|
|
CELS@HOME
Cels@Home is a research project that uses Internet-connected computers to do research in cell adhesion. One of the many applications of this is in cancer research, as the point at which cancerous cells quit staying in place, and instead break free to move throughout the body, is a critical event that makes the disease much harder to treat. You can participate by downloading and running a free program on your computer. Cels@Home is based at the University of Texas in Austin.
|
10 Posts in
1 Topics
|
Last post on 20 April 2008, 14:18:34
in Re: New Project by veebee
|
|
CHESS960@HOME
In this project we try to combine Chess960 and the idea of distributed computing. With the BOINC software framework from the University of Berkeley exists a platform we want to use in this project to perform these computing intensive tasks. With it we want to give this chess variant some basics in theory of this game. We know the fascination of this chess variant is the incredible amount of variations. That will not change with this project but some guidelines seems to be useful in each starting position.
We hope to finish the own application in June 2006 and to start with the first tests this month.
In the meantime the first tests has been started. We still have some problems and unsolved task. But we hope to solve most of the problems in the next weeks or months. Of course we are at the very beginning of this project (still Alpha Phase) and we are sure to meet new problems and challanges in near future.
|
0 Posts in
0 Topics
|
|
|
CLIMATEPREDICTION
Climateprediction.net is the largest experiment to try and produce a forecast of the climate in the 21st century.
|
166 Posts in
14 Topics
|
Last post on 04 May 2008, 04:44:48
in Re: Trickle File by mgpower0
|
|
COSMOLOGY@HOME
The goal of Cosmology@Home is to search for the model that best describes our Universe and to find the range of models that agree with the available astronomical and particle physics data. In order to achieve this goal, participants in Cosmology@Home (i.e. you!) will compute the observable predictions of millions of theoretical models with different parameter combinations. We will use the results of your computations to compare all the available data with these models. In addition, the results from Cosmology@Home can help design future cosmological observations and experiments, and prepare for the analysis of future data sets, e.g. from the Planck spacecraft.
Each work package simulates a Universe with a particular geometry, particle content, and "physics of the beginning." It produces predictions of the observable properties of the Universe which we can then compare to:
1) the fluctuations in the cosmic microwave background (observed from space by the WMAP and soon the Planck spacecraft, as well as from ground based and balloon based experiments),
2) the large scale distribution of galaxies and clusters of galaxies,
3) measurements of the current expansion speed of the Universe by the Hubble space telescope,
4) the acceleration of the Universe as measured by observations of supernova explosions,
5) observations of primordial element abundances in distant gas clumps, and
6) gravitational lensing data, when it becomes available.
|
276 Posts in
18 Topics
|
Last post on 12 February 2008, 09:50:20
in Re: Waiting for Memo... by Vampus
|
|
DepSpid
Every DepSpid task is processed in two phases:
Networking phase (Phase One)
During this non-cpuintensive phase the DepSpid spider will scan a set of web pages and store the results in a temporary database for later processing during Phase Two.
A DepSpid task consists of multiple jobs. The exact number of jobs per task may vary but usually will be between 10 and 50. A job normally is a domain, subdomain or a directory under a domain. During Phase One the DepSpid spider cycles through the jobs of a task to limit the load it makes on the visited servers.
Every job will start downloading the main page of the domain/subdomain and the corresponding robots.txt (if available). The dowloaded page will then be scanned for links (and some other parts). Each of this links will be validated with a HTTP HEAD request. The dependency between the page and its links will be stored into a temporary database. The spider will follow each link that belongs to the domain where it started and will these pages like the main page if they are not excluded by the robots.txt. Links that would leave the original domain will be marked as external links and will not be processed futher by this job.
A job will end when there is no more link to visit or when one of the predefined limits is reached. Current limits are the level (deepness), the number of visited links and the amount of bytes transfered.
Phase One is non-cpuintensive but will use more or less of your network bandwidth. If the internet connection is closed the network phase will be suspended until the internet connection is available again. Normally, Phase One will take only a few seconds or minutes for each job but may run over a few hours or days depending on the speed of your internet connection and the response times of the visited server.
Computational phase (Phase Two)
This phase doesn't require an internet connection but will use more cpu time. As BOINC doesn't allow switching between non-cpuintensive phases and normal processing phases, this phase will be processed as it would be non-cpuintensive. This means that it will run permanently and not toggle as normal BOINC projects would do. However, DepSpid will respect your ressource share settings. It calculates the relation between the cpu time and the wall clock time and will fall into sleep if the value is higher than the prefered ressource share.
Please note: Respecting your ressource share only works this way with BOINC version 5.5.6 and higher. Older clients will be able to participate until one of the new client versions leaves the develoment state but will use a fixed ressource share which may be far away from your true settings.
Phase Two uses the data collected during Phase One and calculates the dependencies between all pages. An example how this works will be posted soon.....
After all dependencies have been calculated, the dependencies to external links that meet a predefined threshold will be reported to the project server and merged into its main database.
http://www.depspid.net/
|
7 Posts in
1 Topics
|
Last post on 15 June 2007, 10:24:25
in Re: New Topic! by zed
|
|
DOCKING@HOME
Docking@home is a collaborative project that aims to accomplish both bioscience and computer science goals. From the bioscience point of view, the project aims to further knowledge of the atomic details of protein-ligand interactions and, by doing so, will search for insights into the discovery of novel pharmaceuticals. From the computer science point of view, this project aims to extend volunteer computing to enable adaptive multi-scale modeling of the docking applications: different models that represent the same phenomena in nature with different level of accuracy and resource requirements will be chosen at run-time based on results collected so far and characteristics of the protein-ligand complex. Docking@home involves collaboration among the University of Texas - El Paso, The Scripps Research Institute (TSRI), and the University of California - Berkeley and is powered by BOINC. Docking@home is part of the DAPLDS project (or Dynamically Adaptive Protein-Ligand Docking System project) and is supported by the National Science Foundation (NSF).
|
19 Posts in
3 Topics
|
Last post on 24 February 2008, 20:59:44
in Re: Docking to resta... by John Hunt
|
|
EINSTEIN@HOME
Einstein@Home is a project developed to search data from the Laser Interferometer Gravitational wave Observatory (LIGO) in the US and from the GEO 600 gravitational wave observatory in Germany for signals coming from rapidly rotating neutron stars, known as pulsars.
|
71 Posts in
12 Topics
|
Last post on 21 March 2008, 17:19:55
in Re: Top Team Project by Mike Mitchell
|
|
ENIGMA@HOME
Enigma@Home is a wrapper between BOINC and Stefan Krah's M4 Project. 'The M4 Project is an effort to break 3 original Enigma messages with the help of distributed computing. The signals were intercepted in the North Atlantic in 1942 and are believed to be unbroken.' [read more] http://www.bytereef.org/m4_project.html
|
7 Posts in
2 Topics
|
Last post on 22 September 2007, 00:54:33
in Re: Linux Intel vers... by dingo
|
|
IBERCIVIS
Alpha
|
5 Posts in
2 Topics
|
Last post on 02 April 2008, 15:03:12
in Re: Zivis Re-Incarna... by Mike Mitchell
|
|
LEIDEN CLASSICAL
Desktop Computer Grid dedicated to general Classical Dynamics for any scientist or science student!
In physics, classical mechanics or Newtonian mechanics is one of the two major sub-fields of study in the science of mechanics, which is concerned with the set of physical laws governing and mathematically describing the motions of bodies and aggregates of bodies. The other sub-field is quantum mechanics. The term classical mechanics was coined in the early 20th century to describe the system of mathematical physics developed in the 400 years since the groundbreaking works of Brahe, Kepler, and Galileo, but before the development of quantum physics. Quantum physics (and more specifically quantum mechanics) refers to developments since approximately 1900, starting with similarly decisive discoveries by Planck, Einstein, and Bohr.
|
2 Posts in
1 Topics
|
Last post on 07 April 2007, 09:35:06
in Re: UOTD is.. by Heiner
|
|
LHC@HOME
The Large Hadron Collider (LHC) is the world's largest scientific instrument. It is currently being built at CERN on the outskirts of Geneva, Switzerland. When it is switched on in 2007, it will accelerate beams of protons to unprecedented energies in a 27km long circular tunnel. The two particle beams will travel in opposite directions around this loop and at four points on the ring, their paths will intersect, and particles will collide head-on with particles traveling in the opposite direction. At the intersection points, scientists are building four huge detectors, the size of cathedrals, to detect the results of the collisions.
|
68 Posts in
9 Topics
|
Last post on 04 April 2008, 10:07:36
in Re: Client locking u... by Wang Solutions
|
|
MALARIA CONTROL
The MalariaControl.net project is an application that makes use of network computing for stochastic modelling of the clinical epidemiology and natural history of Plasmodium falciparum malaria.
|
36 Posts in
4 Topics
|
Last post on Yesterday at 22:22:04
in Re: Call for Help by veebee
|
|
MILKYWAY@HOME
Milkyway@home is based at the Rensselaer Computer Science Department. This particular project is being developed to better understand the power of volunteer computer resources. http://www.cs.rpi.edu/
|
92 Posts in
11 Topics
|
Last post on 07 May 2008, 08:04:24
in Re: Optimised Applic... by Webmaster Yoda
|
|
MINDMODELING@HOME
MindModeling@Home (Beta) is a research project that uses volunteer computing for the advancement of cognitive science. The research focuses on utilizing computational cognitive process modeling to better understand the human mind. We need your help to improve on the scientific foundations that explain the mechanisms and processes that enable and moderate human performance and learning. Please join us in our efforts! MindModeling@home is not for profit.
MindModeling@Home (Beta) is based at the Cognitive Engineering Research Institute in Mesa, AZ. http://cerici.org/
|
4 Posts in
2 Topics
|
Last post on 21 February 2008, 11:41:14
in New Web Site by dingo
|
|
ORBIT@HOME
Orbit@home is a project based on BOINC and ORSA, monitoring the orbit of all the asteroids passing near the Earth. Every time a new asteroid is discovered or re-observed, the orbit of the asteroid is updated and propagated in future to check for possible impacts with the Earth.
|
82 Posts in
6 Topics
|
Last post on 20 April 2008, 02:16:21
in Re: New work? by Wang Solutions
|
|
PIRATES@HOME
Pirates@Home is an ongoing test of BOINC, the Berkeley Open Infrastructure for Network Computing. Pirates@Home is currently being used to test BOINC's forum software for possible use by another project, Interactions in Understanding the Universe. At present Pirates@Home is not doing any real scientific computation, we are just having fun with BOINC. You can read more about the current goals of Pirates@Home here.
Pirates@Home was previously used to develop both experience and software (including a nifty screensaver) for Einstein@Home. That project is now running quite succesfully, and you are encouraged to join and contribute your spare computing cycles to the search for gravitational waves.
|
103 Posts in
6 Topics
|
Last post on 02 April 2008, 12:59:36
in Re: Name change by veebee
|
|
POEM@HOME
Proteins are the nanoscale machinery of all the known cellular life. Amazingly, these large biomolecules with up to 100,000 atoms fold into unique three-dimensional shapes in which they function.
These functions include all cellular chemistry (metabolism), energy conversion (photosynthesis) and transport (oxygen transport), signal processing in the brain (neurons), immune response and many others, often with an efficiency unmatched by any man-made process. Protein malfunction is often related to diseases and thousands disease-related proteins have been identified to date, many with still unknown structure.
To understand, control or even design proteins we need to study protein structure, which is experimentally much harder to obtain than the information about the chemical composition (sequence) of a specific protein.
By joining this project you will contribute to a computational approach to
* predict the biologically active structure of proteins
* understandthe signal-processing mechanisms when the proteins interact with one another
* understand diseases related to protein malfunction or aggregation
* develop new drugs on the basis of the three-dimensions structure of biologically important proteins.
POEM@HOME implements a novel approach to understand these aspects of protein structure, which lends itself very well to worldwide distributed computing. The scientific approach behind POEM@HOME is a computational realization of the thermodynamic hypothesis that won C. B. Anfinsen the Nobel Prize in Chemistry in 1972.
|
134 Posts in
3 Topics
|
Last post on 01 April 2008, 08:45:28
in Re: Another Poem cha... by Hurricane
|
|
PREDICTOR@HOME
Predictor@home is world community experiment and effort to use distributed world-wide-web volunteer resources to assemble a supercomputer able to predict protein structure from protein sequence.
|
32 Posts in
6 Topics
|
Last post on 14 February 2008, 23:05:49
in Re: New Web Site by Webmaster Yoda
|
|
PRIMEGRID
Prime Numbers are of great interest to mathematicians for a variety of reasons. Primes also play a central role in the cryptographic systems which are used for computer security. Through the study of Prime Numbers it can be shown how much processing is required to crack an encryption code and thus to determine whether current security schemes are sufficiently secure.
PrimeGrid is currently running several sub-projects:
-Primegen: generating a public sequential prime number database (end phase).
-Twin Prime Search: searching for gigantic twin primes of the form k*2n + 1 and k*2n - 1.
-Cullen-Woodall Search: searching for mega primes of forms n*2n + 1 and n*2n - 1.
-3*2^n-1 Search: searching for mega primes of the form 3*2n - 1.
-Prime Sierpinski Project: helping Prime Sierpinski Project solve the Prime Sierpinski Problem.
You can choose the projects you would like to run by going to the project preferences page.
|
88 Posts in
10 Topics
|
Last post on 15 March 2008, 21:44:00
in Re: The Ides of Marc... by dingo
|
|
PROTEINS@HOME
The amino acid sequence of a protein determines its three-dimensional structure, or 'fold'. Conversely, the three-dimensional structure is compatible with a large, but limited set of amino acid sequences.
Enumerating the allowed sequences for a given fold is known as the 'inverse protein folding problem'. We are working to solve this problem for a large number of known protein folds (a representative subset: about 1500 folds). The most expensive step is to build a database of energy functions that describe all these structures. For each structure, we consider all possible sequences of amino acids. Surprisingly, this is computationally tractable, because our energy functions are sums over pairs of interactions. Once this is done, we can explore the space of amino acid sequences in a fast and efficient way, and retain the most favorable sequences.
This large-scale mapping of protein sequence space will have applications for predicting protein structure and function, for understanding protein evolution, and for designing new proteins. By joining the project, you will help to build the database of energy functions and advance an important area of biotechnology.
|
50 Posts in
5 Topics
|
Last post on 20 February 2008, 22:59:23
in Re: New Work! by vaio
|
|
PROJECT NEURON
This project aims to provide a trial BOINC environment in which a set of dummy applications will run. The purpose of this being to record, observe and understand BOINC activity and data with a view to developing metrics that will establish or otherwise the quality/reliability/dependability of particular BOINC projects. A central reference point will be developed and updated automatically to which users can refer. User feedback may also be permitted at this reference point. Results here http://security.podzone.net/neuron.htm
|
10 Posts in
1 Topics
|
Last post on 29 November 2007, 17:42:25
in Re: Now in Beta by dingo
|
|
QMC@HOME
Reactions between molecules are important for virtually all parts of our lives. The structure and reactivity of molecules can be predicted by Quantum Chemistry, but the solution of the vastly complex equations of Quantum Theory often requires huge amounts of computing power. In our project we want to raise the necessary computing time to further develop the very promising Quantum Monte Carlo (QMC) method for general use in Quantum Chemistry.
|
106 Posts in
11 Topics
|
Last post on 24 January 2008, 10:17:53
in QMC Research Publish... by Mahray
|
|
RALPH@HOME
RALPH@home is the official alpha test project for Rosetta@home. New application versions, work units, and updates in general will be tested here before being used for production. The goal for RALPH@home is to improve Rosetta@home.
|
2 Posts in
1 Topics
|
Last post on 18 October 2007, 17:34:00
in Re: News from Ralph@... by dingo
|
|
RECTILINEAR CROSSING NUMBERS
A drawing of a graph G in the plane allows edges to cross. The crossing number cr(G) is the fewest number of pairwise edge crossings taken over all drawings of G. In a rectilinear drawing the edges must all be line segments. The fewest number of crossings in such a drawing is the rectilinear crossing number, crbar(G). Clearly crbar(G) is at least cr(G). Strict inequality can hold. For example, Richard Guy has shown that crbar(K_8) > cr(K_8) = 18. A similar inequality holds for K_{10}, but not for K_{9} (crbar(K_{10}) = 62 as determined but by Brodsky et al). It is believed that crbar(K_n) > cr(K_n) for all n at least 10. SEE http://www.emba.uvm.edu/~archdeac/problems/rectcros.htm
|
2 Posts in
1 Topics
|
Last post on 24 March 2007, 22:18:36
in Re: New app out but.... by elftron
|
|
RENDERFARM@HOME
|
0 Posts in
0 Topics
|
|
|
RIESEL SIEVE
Riesel Sieve is a distributed effort to prove the Riesel conjecture by removing prime candidates for the remaining 101 72 K from over 11 million k/n pairs.
Individual sieving efforts per single K can take months to reach a sufficient level. This coordinated effort will allow us to sieve 100 times deeper and much quicker. No more sieving to 3T and then stopping in frustration as the hours per factor mount, now we can go to 300T and beyond.
|
64 Posts in
6 Topics
|
Last post on 22 September 2007, 21:35:36
in Re: PPC and Linux (i... by veebee
|
|
ROSETTA@HOME
Rosetta@home is a scientific research project that uses internet-connected computers to predict and design protein structures, and protein-protein and protein-ligand interactions. Our goal is to develop methods that accurately predict and design protein structures and complexes, an endeavor that may ultimately help researchers develop cures for human diseases such as cancer, HIV/AIDS, and malaria. Our project relies on individuals, like you, who donate time on their computers to collectively provide the computing power necessary to further develop, test, and improve our methods.
|
93 Posts in
6 Topics
|
Last post on 02 December 2007, 04:11:51
in Re: How much memory? by Mike Mitchell
|
|
SETI@HOME
SETI@home is a scientific experiment that uses Internet-connected computers in the Search for Extraterrestrial Intelligence (SETI). You can participate by running a free program that downloads and analyzes radio telescope data.
|
173 Posts in
18 Topics
|
Last post on Today at 18:01:57
in Re: Big Day For SETI by Mike Mitchell
|
|
SHA-1 COLLISION
The IAIK Krypto research group focuses on the security analysis of symmetric cryptographic primitives. For this purpose, we apply and adapt existing mathematical frameworks to practical designs and design methods. We conduct basic and applied research and offer consulting services. SEE http://www.iaik.tugraz.at/research/krypto/collision/SHA1CollisionBasics.php
|
11 Posts in
2 Topics
|
Last post on 21 October 2007, 15:37:53
in Re: In the RED by dingo
|
|
SIMAP
SIMAP is short for Similarity Matrix of Proteins. SIMAP is a database for the precomputed homologies of protein sequences and provides specialized retrieval tools for effective use of that data. The publicly available web based SIMAP presentation module provides variuos search tools.
|
15 Posts in
2 Topics
|
Last post on 16 February 2008, 10:31:26
in Re: Work available u... by Mike Mitchell
|
|
SPINHENGE@HOME
In the field of research "nano-technology", in the area "Molecular Magnets : Controlled Nanoscale Magnetism", from the American energy ministry (DOE) of promoted interdisciplinary big research project, physicists work on utilising chemist, mathematician and engineers in it, molecular magnetic materials technological. On this occasion, it is to be carried out inevitably mathematical calculations. Because these calculations are very time-consuming, it is obvious, this on several computers.
|
0 Posts in
0 Topics
|
|
|
SUDOKU
Sudoku is a research project that uses Internet-connected computers to search for the smallest possible start configuration of Sudoku.
|
10 Posts in
2 Topics
|
Last post on 24 September 2007, 09:15:44
in Re: Sudoku startup p... by -PJ-
|
|
SUPERLINK@TECHNION
Superlink@Technion helps geneticists all over the world find disease-provoking genes causing some types of diabetes, hypertension (high blood pressure), cancer, schizophrenia and many others.
Genetic linkage analysis is a statistical method that is used to associate functionality of genes with their location on chromosomes. It typically serves for detecting mutated disease-provoking genes. This analysis can be extremely computationally intensive and has been parallelized for simultaneous execution on many computers. Geneticists submit the data for the analysis via Superlink-online linkage analysis portal. The tasks are then automatically parallelized and scheduled for execution on many computers in the Technion, in the University of Wisconsin in Madison, and also on many computers all over the world.
|
18 Posts in
3 Topics
|
Last post on 25 December 2007, 21:56:20
in Up & running again by Rob
|
|
SZTAKI
The aim of the project is to find all the generalized binary number systems up to dimension 11.
|
19 Posts in
4 Topics
|
Last post on 21 August 2007, 06:30:58
in Re: Started Crunchin... by Webmaster Yoda
|
|
TANPAKU
"TANPAKU" is the project that is aiming at attacking "protein structure prediction" problem by using "distributed computing" method. This project is developed in collaboration with Yamato lab.(in the Department of Biological Science and Technology) and Takeda lab.(in the Department of Information Sciences) groups at Tokyo University of Science. Now, the project finished a preliminary test within our university and it is open for public volunteers.
|
2 Posts in
1 Topics
|
Last post on 16 February 2008, 10:48:27
in Re: Welcome to Tanpa... by Wang Solutions
|
|
THE LATTICE PROJECT
We are currently accepting alpha testers for the Lattice BOINC project. During this phase, there may not always be workunits available for processing on your platform. If you encounter difficulties, please make use of the Questions and problems forum.
Some things to be aware of:
* We require clients to be >= 4.30.
* Our applications do not update their fraction done, so the progress bar will not function. Workunit time estimates may also be wildly inaccurate.
* The "deadline" for reporting workunits can be safely ignored. We are accepting work returned after the deadline.
|
10 Posts in
2 Topics
|
Last post on 19 December 2007, 19:46:04
in New Keys. by dingo
|
|
TSP
The Traveling Salesman Problem (TSP) is not hard to explain. For a given set of cites, visit each city once (once and only once) and minimize the distance you travel. This deceptively simple problem is trivial given a small set of cities, however, as you add more cities the number of possible paths goes through the roof. It should come as no surprise that the TSP is classified as an NP-Hard problem, with the number of Hamiltonian paths being equal to n!/2 where n is equal to the number of cities in the problem.
An efficient general solution has not been found. Mathematicians have decided that the best case scenario is an algorithm that has a polynomial variation with respect to the number of cites. The best solutions to date vary exponentially with respect to the number of cites. This is where the BOINC project TSP comes in. The TSP project is undertaking the arduous task of using the brute force method to find an optimal solution to a 48 city TSP. Once the optimal path(s) is/are known evaluation of other algorithms can begin. Future algorithms include genetic algorithms, repetitive nearest neighbor, simulated annealing and ant colony optimization.
TSP is based at the American Samoa Hibiscus House.
|
2 Posts in
2 Topics
|
Last post on 08 January 2008, 22:43:36
in Update by dingo
|
|
μFluids@HOME
μFluids project is a massively distributed computer simulation of two-phase fluid behavior in microgravity and microfluidics problems. Our goal is to design better satellite propellant management devices and address two-phase flow in microchannel and MEMS devices. Voluntary collaboration of individual computer users, like you, can participate by donating idle computer time using the BOINC software.
|
15 Posts in
2 Topics
|
Last post on 23 December 2007, 06:10:16
in Re: New Work by yuckuo
|
|
WEP-M+2
The applications are headed "Random-base WEP Factorization". Seems to be another mathematical project as they mention Mersenne Primes.
Mersenneplustwo numbers are those integers that are two more than a Mersenne prime. Mersenne primes are of the form 2^p-1 (http://www.mersenne.org/). This makes Mersenneplustwo numbers of the form 2^p+1. This project aims to find the factors (ie integer divisors) of Mersenneplustwo numbers.
|
78 Posts in
7 Topics
|
Last post on 17 April 2008, 14:03:39
in Re: 3rd Position - N... by Robert
|
|
WORLD COMMUNITY GRID
World Community Grid's mission is to create the largest public computing grid benefiting humanity. Our work is built on the belief that technological innovation combined with visionary scientific research and large-scale volunteerism can change our world for the better. Our success depends on individuals - like you - collectively contributing their unused computer time to this not-for-profit endeavor.
|
215 Posts in
13 Topics
|
Last post on 24 April 2008, 02:14:08
in Re: Back to 36th pla... by Wang Solutions
|
|
XTREMLAB
XtremLab is a project running on the Boinc Desktop Grid platform. Contrary to other projects, we do not use grid for computations about physics, mathematics or biology: we study the grid technology itself. We study actual performances and try to combine various grid technologies in order to find how to improve performances of all others projects.
|
5 Posts in
3 Topics
|
Last post on 25 September 2007, 14:55:22
in Please attach your X... by Mike Mitchell
|
|
YOYO@HOME
yoyo@home is a wrapper of the distributed.net clienthttp://www.distributed.net/and runs OGR work units. http://en.wikipedia.org/wiki/Golomb_ruler
|
7 Posts in
1 Topics
|
Last post on 31 August 2007, 06:38:28
in Re: Team by veebee
|
|
INACTIVE/Pre ALFA BOINC Projects
|
|
APS@HOME
APS@home is a research project that uses Internet-connected computers to do research into the effects of atmospheric dispersion as it relates to the accuracy of measurements used in climate prediction. More details are in the Science message board, and we may be diversifying into other areas of atmospheric science soon. Watch this space! http://www.apsathome.org/
|
48 Posts in
6 Topics
|
Last post on 27 September 2007, 14:38:58
in Re: APS is back afte... by John Hunt
|
|
BBC CLIMATEPREDICTION
We need the computer power you're not using. Join in the largest climate prediction experiment ever, developed by climate scientists for the BBC using the Met Office climate model.
****
DO NOT INSTALL BBC BOINC ON THE SAME MACHINE IF BOINC IS ALREADY INSTALLED. It may disable or remove your existing BOINC installation. Instead, go to the Create account page or sign up via BOINC Manager, using the URL http://bbc.cpdn.org/
|
45 Posts in
10 Topics
|
Last post on 17 January 2008, 16:19:37
in More Good Fortune by Mike Mitchell
|
|
GERASIM@HOME
From the admins today:
"2 yoyo:
Currently Gerasim@home Has No goals.
Scientiests want to see full working system ant waiting, when develepment ends.
After all, they will testing Gerasim's capabilities, relability...
Estimated completion (develepment) - 15 May 2007y.
When Gerasim Officcialy Starts, science info will be placed
to the project main page.
We don't hate making untimely announcements.
----
2 all:
Note: Gerasim@home is not Boinc project & server.
It based on source code from http://boinc.ssl.berkeley.edu/
and has interface, compatible with boinc clients. (Boinc Manager).
It runs under Win2003Srv, IIS6.0 and MSSQL.
Gerasim@home will keep Boinc compatible credits and statistics
for http://www.boincstats.com/ , http://www.boincsynergy.com/ and other stat sites.
|
2 Posts in
1 Topics
|
Last post on 10 October 2007, 02:34:49
in Re: New Project by clownius
|
|
HASHCLASH
Using techniques from the attack from Wang et al., we are trying to find collisions which are more flexible. More concretely, we will allow the first blocks of two messages to be chosen at will. This attack is in ongoing research, however it is already clear that it requires large scale computational power. Therefore project HashClash was started. Currently you can join HashClash to help us in the first phase of this research, called 'MD5 Birthdaying'. It consists of finding a block with very specific properties, that will help us in later phases. Finding that block on a single Pentium4 3Ghz would take approx. 800 days of 24/7 continous running. We hope by combining the computational powers of many pc's to find this block much faster.
This project is intended as cryptographic research only. We intend to clarify the nature of the vulnerabilities in applications of MD5 that have been opened up by the collision finding methods of Wang et al. At a later stage we also intend to work on collision-finding for SHA-1.
|
3 Posts in
1 Topics
|
Last post on 15 April 2007, 23:00:13
in Re: Is this project ... by Vajras
|
|
NANO-HIVE@HOME
The goal of Nano-Hive@Home is to accurately simulate nanosystems too large to be calculated via normal means, and thereby enable further scientific study in the field of nanotechnology.
Here are some key points about Nano-Hive@Home with links to more detailed explanations:
* Completely open-source and free (as in beer)
* Not-for-profit, and with all results made available to the public domain, free and clear
* Benefits humanity by advancing our knowledge and understanding of nanotechnology
* Calculations are performed with state-of-the-art simulation software making the most use of your donated computing power
* Attention to security and safety so that you can run our software without worrying that it will damage your computer
* Interesting and interactive graphics and screensaver that shows more of the simulation results as they become available
* Uses the popular Berkeley Open Infrastructure for Network Computing (BOINC) platform so you can contribute via a familiar interface
|
6 Posts in
1 Topics
|
Last post on 08 November 2007, 04:44:52
in Re: last of work for... by yuckuo
|
|
PLANETQUEST
This is just a placeholder to keep all the related posts in.
|
5 Posts in
1 Topics
|
Last post on 10 June 2007, 05:42:12
in Re: NEW Project Comi... by zed
|
|
PS3GRID
PS3GRID is a volunteer computing project based on the PlayStation3 and BOINC for full-atom molecular dynamics simulations and other scientific applications specially optimized for the Cell processor. Your contribution is very important because our Cell MD molecular dynamics software runs over an order of magnitude faster on the PlayStation3 opening the way to innovative computational experiments.
|
2 Posts in
1 Topics
|
Last post on 19 November 2007, 11:56:47
in Re: Playstation 3 Gr... by brodie 1 kenobi
|
|
RND@HOME
Radio Network Design (RND) is a telecommunication problem which consists in covering a geographic area with radio signal using the fewer number of transmitters that cover the maximum area. Therefore, it is an important topic to solve nowadays, for example in the mobile wireless technology domain, mobile telephony,... Bio-inspired algorithms are a good choice to solve the RND problem, because this is an NP-hard optimization problem which fits bio-inspired algorithms very well. In this project it is used the PBIL (Population-Based Incremental Learning) algorithm. This is a modern algorithm, and we hope to get good results with it. PBIL is based on genetic algorithms and competitive learning (typical in neural networks).
|
22 Posts in
1 Topics
|
Last post on 11 November 2007, 08:30:59
in Re: New Project by zed
|
|
TMRL DRTG
The Distributed Rainbow Table Generator project of TheMinouche Research Laboratories - a community project dedicated to large scale distributed calculation of huge Rainbow Tables.
|
136 Posts in
12 Topics
|
Last post on 23 August 2007, 18:36:00
in Re: Anyone know what... by dingo
|
|
UCT : MALARIACONTROL.NET
The UCT : malariacontrol.net project is a test project in collaboration with MalariaControl.net in Switzerland that aims to test the correct operation of our server for future BOINC-based projects. MalariaControl.net is an application that makes use of network computing for stochastic modelling of the clinical epidemiology and natural history of Plasmodium falciparum malaria
|
1 Posts in
1 Topics
|
Last post on 22 April 2008, 18:23:05
in New Project by dingo
|
|
VTU@HOME
The project http://boinc.vtu.lt/vtuathome/ is a test project. It is developed to test the BOINC platform and to learn the BOINC API. The project is still incomplete and your notes, suggestions and comments are appreciated.
The aim of the project is to count the quantity of prime numbers in a large interval. The worst algorythm is used, as we need a lot of computing hours and many workunits. The client side application gets the beggining and the end numbers of the interval and divides every number from this interval by every number from 1 to it self. As we know there are better algorythms:
|
9 Posts in
2 Topics
|
Last post on 24 July 2007, 14:33:57
in Re: VTU Problems by Mike Mitchell
|
|
NON BOINC PROJECTS
|
|
COMMUNITY TSC
The Rothberg Institute For Childhood Diseases is a non-profit organization dedicated to finding a cure for children suffering from Tuberous Sclerosis Complex (TSC). We operate at the intersection of molecular biology, chemistry, computer science, and nanotechnology.
Our modern understanding of cancer comes from animal models of TSC, and the first description of autism comes from a TSC patient. Work done on TSC will have a direct impact on cancer research and can also form a basis for understanding and treating other childhood disorders. TSC is a genetic disorder that leads to benign tumors in multiple organs, including the brain, kidneys, heart, eyes, lungs and other organs. During the first few years, the severity of TSC can range from mild skin abnormalities to, in severe cases, seizures, mental retardation, renal failure, or the need for a lung transplant in young women with TSC.
|
1 Posts in
1 Topics
|
Last post on 17 April 2008, 00:13:21
in Link by dingo
|
|
DIMES
DIMES is a distributed scientific research project, aimed to study the structure and topology of the Internet, with the help of a volunteer community (similar in spirit to projects such as SETI@Home).
|
5 Posts in
1 Topics
|
Last post on 29 October 2007, 06:50:00
in Re: NetDIMES Signatu... by PeterHallgarten
|
|
D2OL
The Drug Design and Optimization Lab (D2OL)™ works to discover drug candidates against Anthrax, Smallpox, Ebola and SARS and other potentially devastating infectious diseases.
By simply downloading a no cost, non-intrusive software application, you can contribute the idle time available on your computer to emerging microbial diseases and other pathogens that significantly impact global health even when not connected to the Internet.
D2OL, was first to use computational methods to deploy targets against Anthrax, Smallpox and Ebola, and now is first to have a credible SARS target (A target conserved between pig and human coronovirus, the suspected virus behind SARS).
|
0 Posts in
0 Topics
|
|
|
EON
A common problem in theoretical chemistry, condensed matter physics and materials science is the calculation of the time evolution of an atomic scale system where, for example, chemical reactions and/or diffusion occur. Generally the events of interest are quite rare (many orders of magnitude slower than the vibrational movements of the atoms), and therefore direct simulations, tracking every movement of the atoms, would take thousands of years of computer calculations on the fastest present day computer before a single event of interest can be expected to occur, hence the name EON, which is an immeasurable period of time.
|
0 Posts in
0 Topics
|
|
|
FOLDING@HOME
Folding@Home 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.
|
47 Posts in
2 Topics
|
Last post on 12 November 2007, 13:16:40
in Re: Position and Lin... by clownius
|
|
MUON1
"This is a NON BOINC project"
The experiment is called the Neutrino Factory, scheduled for construction some time from 2015. Its primary aim is to fire beams of neutrinos (fundamental particles) through the Earth's interior to detector stations on different continents. They're doing this to measure whether they change type en route (there are 3 types of neutrino) and data from this in turn will allow them to determine the neutrino's mass more accurately.
|
66 Posts in
3 Topics
|
Last post on 09 March 2008, 15:58:45
in Re: Only one left cr... by John Hunt
|
| boincaustralia - Info Center |
| Recent Posts |
|
| |
boincaustralia