BOINC projects: Difference between revisions
No edit summary |
update project links |
||
| Line 2,392: | Line 2,392: | ||
|- | |- | ||
| | | | ||
| ILS-ESP-2014 | | [https://web.archive.org/http://boinc01.uoc.edu/ILS-ESP-2014/ ILS-ESP-2014] | ||
| | | | ||
| | | | ||
| Line 2,399: | Line 2,399: | ||
| | | | ||
| | | | ||
| | |Research for solving the permutation FLOW-SHOP problem | ||
|- | |- | ||
| | | | ||
| Russian Words Compatibility | | [https://web.archive.org/http://wordcompatibility.com/words_compatibility/ Russian Words Compatibility] | ||
| | | | ||
| | | | ||
| Line 2,409: | Line 2,409: | ||
| | | | ||
| | | | ||
| | |Research in russian computational linguistics | ||
|- | |- | ||
| | | | ||
| Line 2,419: | Line 2,419: | ||
| | | | ||
| | | | ||
| | |Simulating the behavior of a large assembly of cellular automata neurons connected in a complex network | ||
|- | |- | ||
| | | | ||
| OPTIMA@HOME | | [https://web.archive.org/http://boinc.isa.ru/dcsdg/ OPTIMA@HOME] | ||
| | | | ||
| | | | ||
| Line 2,429: | Line 2,429: | ||
| | | | ||
| | | | ||
| | |Solve challenging large-scale optimization problems | ||
|- | |- | ||
| | | | ||
| Correlizer | | [https://web.archive.org/web/20130525113734/http://svahesrv2.bioquant.uni-heidelberg.de/correlizer/ Correlizer] | ||
| | | | ||
| | | | ||
| Line 2,439: | Line 2,439: | ||
| | | | ||
| | | | ||
| | |Revealing the mysteries of genome organization | ||
|- | |- | ||
| | | | ||
| Taiwan Desktop Grid | | [https://web.archive.org/web/20120825055512/http://vbridge.twgrid.org/asgcdg/ Taiwan Desktop Grid] | ||
| | | | ||
| | | | ||
| Line 2,449: | Line 2,449: | ||
| | | | ||
| | | | ||
| | |Support the drug discovery, earthquake simulation and climate change applications developing on Asia and also to support the applications developed by IDGF | ||
|- | |- | ||
| | | | ||
| AndrOINC | | [https://web.archive.org/web/20110214000708/http://androinc.net:80/ AndrOINC] | ||
| | | | ||
| | | | ||
| Line 2,459: | Line 2,459: | ||
| | | | ||
| | | | ||
| | |To break a 1024 bit RSA key used by Motorola to sign the boot and recovery partitions on the Motorola Milestone. If this key could be broken, we would be able to sign our own boot/recovery images, which would enable us to run custom kernels and recovery images on the Milestone. | ||
|- | |- | ||
| | | | ||
| Line 2,472: | Line 2,472: | ||
|- | |- | ||
| | | | ||
|[http://www.primaboinca.com/ Primaboinca] | |[https://web.archive.org/web/20140514143657/http://www.primaboinca.com/ Primaboinca] | ||
| | | | ||
| | | | ||
| Line 2,479: | Line 2,479: | ||
| | | | ||
| | | | ||
| | |This project concerns itself with two hypotheses in number theory. Both are conjectures for the identification of prime numbers. The first conjecture (Agrawal's Conjecture) was the basis for the formulation of the first deterministic prime test algorithm in polynomial time (AKS algorithm). Hendrik Lenstras and Carl Pomerances heuristic for this conjecture suggests that there must be an infinite number of counterexamples. So far, however, no counterexamples are known. This hypothesis was tested for n < 10<sup>10</sup> without having found a counterexample. | ||
The second conjecture (Popovych's conjecture) adds a further condition to Agrawals conjecture and therefore logically strengthens the conjecture. If this hypothesis would be correct, the time of a deterministic prime test could be reduced from O(log N)<sup>6</sup> (currently most efficient version of the AKS algorithm) to O(log N)<sup>3</sup> | |||
|- | |- | ||
| | | | ||