NeoGen
07-08-2006, 10:27 PM
There can never be too many BOINC projects, so here's one more for us to play with. :D
http://dist.ist.tugraz.at/cape5/
And now for an explanation on rectilinear crossing numbers (I don't know what they are either)
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).
Source: http://www.emba.uvm.edu/~archdeac/problems/rectcros.htm
So basically, this is a maths project, around graph theory and crossing numbers, whose purpose is to find the best rectilinear crossing numbers out there. :)
Here's a short Q&A for helping new people to participate on the project. :)
Q: How can I participate?
A: If you have boinc v5.2+, use the wizards to attach to a new project. If you don't like the wizards you can always use their webpage here: http://dist.ist.tugraz.at/cape5/create_account_form.php
Q: How do I join the Team?
A: After having created an account, go to our Team page and click the link to join our Team. It's as easy as that. :) Here's our Team page: http://dist.ist.tugraz.at/cape5/team_display.php?teamid=14
Q: Anything else I need to know about this project?
A: Well... here's a few things about it...
- Runs on Windows and Linux
- Has no graphics/screensaver
- Most workunits are extremely fast (less than 1 second), but you may catch one or another that take several hours to complete
- You get credited on the spot! No waiting for validation. (quorum = 1)
- The project uploads alot of tiny files for each workunit done. Don't be alarmed if you see pages and pages of files waiting to upload on your boinc.
- ATTENTION: Suspend/Resume feature is not supported yet. Don't stop the long running workunits or you'll lose your work done on them.
I think that sums it up pretty much! Come on over and try it guys! :D
http://dist.ist.tugraz.at/cape5/
And now for an explanation on rectilinear crossing numbers (I don't know what they are either)
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).
Source: http://www.emba.uvm.edu/~archdeac/problems/rectcros.htm
So basically, this is a maths project, around graph theory and crossing numbers, whose purpose is to find the best rectilinear crossing numbers out there. :)
Here's a short Q&A for helping new people to participate on the project. :)
Q: How can I participate?
A: If you have boinc v5.2+, use the wizards to attach to a new project. If you don't like the wizards you can always use their webpage here: http://dist.ist.tugraz.at/cape5/create_account_form.php
Q: How do I join the Team?
A: After having created an account, go to our Team page and click the link to join our Team. It's as easy as that. :) Here's our Team page: http://dist.ist.tugraz.at/cape5/team_display.php?teamid=14
Q: Anything else I need to know about this project?
A: Well... here's a few things about it...
- Runs on Windows and Linux
- Has no graphics/screensaver
- Most workunits are extremely fast (less than 1 second), but you may catch one or another that take several hours to complete
- You get credited on the spot! No waiting for validation. (quorum = 1)
- The project uploads alot of tiny files for each workunit done. Don't be alarmed if you see pages and pages of files waiting to upload on your boinc.
- ATTENTION: Suspend/Resume feature is not supported yet. Don't stop the long running workunits or you'll lose your work done on them.
I think that sums it up pretty much! Come on over and try it guys! :D