BOINC Projects

BOINC projects: Difference between revisions

← Older editNewer edit →
VisualWikitext
Al Piskun (talk | contribs)
1,447 edits
update project links
Al Piskun (talk | contribs)
1,447 edits
update project links
Line 400: Line 400:
|Independent
|Independent
|Mathematics
|Mathematics
| 1030 trying to solve Sierpinski / Riesel Bases up | trying to solve Sierpinski / Riesel Bases up to 1030
| 1030 trying to solve Sierpinski / Riesel Bases up | Trying to solve Sierpinski / Riesel Bases up to 1030
|-
|-
|
|
Line 827: Line 827:
|
|
|Software testing
|Software testing
|We're setting up a renderfarm to power the [https://web.archive.org/web/20080511223553/http://www.imp.org/ Internet Movie Project]. Note that this project will never export credit stats.
|Setting up a renderfarm to power the [https://web.archive.org/web/20080511223553/http://www.imp.org/ Internet Movie Project]. Note that this project will never export credit stats.
|-
|-
|
|
Line 1,171: Line 1,171:
|Independent
|Independent
|
|
|To determine who wins in [[Reversi]] game - first player, second player or if the game is tied
|Determine who wins in [[Reversi]] game - first player, second player or if the game is tied
|-
|-
|
|
Line 1,326: Line 1,326:
|
|
|
|
|This project was being used to test account creation. You can delete an account by logging in to it, then visiting http://isaac.ssl.berkeley.edu/cplan/delete_account.php
|Was being used to test account creation. You can delete an account by logging in to it, then visiting http://isaac.ssl.berkeley.edu/cplan/delete_account.php
|-
|-
|
|
Line 1,410: Line 1,410:
|
|
|
|
|The main goal of the current project is to use sophisticated mathematical methods (abstract extension of order types) to determine the rectilinear crossing number for small values of n. So far we have been successful for n <= 17. From very recent (not even published yet) mathematical considerations the rectilinear crossing numbers for n=19 and n=21 are also known. So the most tantalizing problem now is to determine the true value for n=18, which is the main focus of this project.
|Use sophisticated mathematical methods (abstract extension of order types) to determine the rectilinear crossing number for small values of n. So far we have been successful for n <= 17. From very recent (not even published yet) mathematical considerations the rectilinear crossing numbers for n=19 and n=21 are also known. So the most tantalizing problem now is to determine the true value for n=18, which is the main focus of this project.
An updated list for the best point sets known so far can be found at http://www.ist.tugraz.at/staff/aichholzer/crossings.html.
An updated list for the best point sets known so far can be found at http://www.ist.tugraz.at/staff/aichholzer/crossings.html.
|-
|-
Line 1,535: Line 1,535:
|Dr Anthony Chubb
|Dr Anthony Chubb
|
|
|A research project that uses donated CPU time to perform docking simulations on malaria proteins
|Perform docking simulations on malaria proteins
|-
|-
|
|
Line 1,628: Line 1,628:
|[[University of Coimbra]]
|[[University of Coimbra]]
|
|
|A research project that uses Internet-connected computers to conduct end-to-end fine-grained monitoring of web sites.
|Conduct end-to-end fine-grained monitoring of web sites.
The aim of the project is to deploy a large infrastructure to support thousands of probes monitoring the Internet.
The aim of the project is to deploy a large infrastructure to support thousands of probes monitoring the Internet.
Each probe repeatedly performs a pre-defined set of web transactions on web-sites, accessing each site about 4 times per hour.
Each probe repeatedly performs a pre-defined set of web transactions on web-sites, accessing each site about 4 times per hour.
Line 1,752: Line 1,752:
|Michal Stanislaw Wojcik
|Michal Stanislaw Wojcik
|
|
|The purpose of this project is to construct a chess wining position classifier (or score estimator) based on some simple features (e.g. the number of pieces of each kind, number of squares controlled by given side, numbers of checks that you can give in a position and so on) The first goal of the project is to establish how far we can get with relatively cheap methods of position evaluation and simple data mining methods (e.g. logistic regression, k-nearest neighbors, SVM, decision trees). The second goal is to use more advance machine learning techniques for recognition of winning position to emulate human behaviour of various levels of chess proficiency.  
|Construct a chess wining position classifier (or score estimator) based on some simple features (e.g. the number of pieces of each kind, number of squares controlled by given side, numbers of checks that you can give in a position and so on) The first goal of the project is to establish how far we can get with relatively cheap methods of position evaluation and simple data mining methods (e.g. logistic regression, k-nearest neighbors, SVM, decision trees). The second goal is to use more advance machine learning techniques for recognition of winning position to emulate human behaviour of various levels of chess proficiency.  
|-
|-
|
|
Line 1,834: Line 1,834:
|
|
|
|
|To study how people in a certain region evolve ideologically over time with respect to an idea
|Study how people in a certain region evolve ideologically over time with respect to an idea
|-
|-
|
|
Line 1,854: Line 1,854:
|
|
|
|
|The Quake Catcher Network (QCN) is a research project that uses Internet-connected computers to do research, education, and outreach in seismology
|Research, education, and outreach in seismology
|-
|-
|
|
Line 1,864: Line 1,864:
|
|
|
|
|The Quake Catcher Network (QCN) is a research project that uses Internet-connected computers to do research, education, and outreach in seismology
|Research, education, and outreach in seismology
|-
|-
|
|
Line 1,944: Line 1,944:
|Perdana University Centre for Bioinformatics (PU-CBi)
|Perdana University Centre for Bioinformatics (PU-CBi)
|
|
|To provide education and training to support the development and continuity of in-house programmes, in particular to advance the translational bioinformatics skills of the next generation doctors and clinician scientists being trained at the two medical schools of Perdana University
|Provide education and training to support the development and continuity of in-house programmes, in particular to advance the translational bioinformatics skills of the next generation doctors and clinician scientists being trained at the two medical schools of Perdana University
|-
|-
|
|
Line 2,004: Line 2,004:
|
|
|
|
|To help other factoring projects such as mersenneforum or XYYXf achieve their academic goals. Merged into NFS@Home.
|Help other factoring projects such as mersenneforum or XYYXf achieve their academic goals. Merged into NFS@Home.
|-
|-
|
|
Line 2,074: Line 2,074:
|University of Houston
|University of Houston
|
|
|To take into account plant vegetative reproduction e.g. the ability of each perennial grass to colonize space through cloning
|Take into account plant vegetative reproduction e.g. the ability of each perennial grass to colonize space through cloning
|-
|-
|
|
Line 2,145: Line 2,145:
|
|
|XXX is a research project that uses Internet-connected computers to do research in XXX
|XXX is a research project that uses Internet-connected computers to do research in XXX
|-
|
| [https://web.archive.org/http://www.ras.unam.mx/sensor/ Red Atrapa Sismos (QCN)]
|
|
| &nbsp;
|
|
|
|
|-
|-
|
|
Line 2,174: Line 2,184:
|Computer Science Department of the University of North Dakota
|Computer Science Department of the University of North Dakota
|
|
|To see how far we can extend the empirical evidence of the Subset Sum problem. Find better ways to apply volunteer computing to combinatorial problems.
|See how far we can extend the empirical evidence of the Subset Sum problem. Find better ways to apply volunteer computing to combinatorial problems.
|-
|-
|
|
Line 2,224: Line 2,234:
|
|
|
|
|To enhance clean energy technology by improving hydrogen production and storage
|Enhance clean energy technology by improving hydrogen production and storage
|-
|-
|
|
Line 2,389: Line 2,399:
|
|
|
|
|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.
|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,523: Line 2,533:
|-
|-
|
|
| DNA@Home  
| [https://web.archive.org/web/20140316201231/http://volunteer.cs.und.edu:80/dna/ DNA@Home]
|
|
|
|
Line 2,530: Line 2,540:
|
|
|
|
|
|Discover what regulates the genes in DNA
|-
|
| Red Atrapa Sismos (QCN)
|
|
| &nbsp;
|
|
|
|
|-
|-
|
|
Retrieved from "https://boincsynergy.ca/wiki/BOINC_projects"