Российские распределенные вычисления на платформе BOINC
Berkeley Open Infrastructure for Network Computing

Welcome Guest
Create Account
Logon
http://gerasim.boinc.ru/sched/gsm.sched
Join
 Read our rules and policies
 Download BOINC
When prompted, enter
http://gerasim.boinc.ru/
 Applications
Community
 User search
 Team search
 Participant profiles
 Message boards
Project
 Top Users
 Top Teams
 Top Computers
 Top Countries
 Top Accelerators
About Gerasim@home
 Science
 FAQ
 Contacts
Misc
 Mersen Numbers

Thank you for your interest in Gerasim@home !

The project uses Internet-connected computers to do research in discrete mathematics and logic control.
The current goal: testing and comparison of heuristic methods for getting separations of parallel algorithms working in the CAD system for designing logic control systems.

You can participate by downloading and running a free program on your computer.


Project News
Monday, October 19, 2020 evatutin#97

2 new combinatorial structures from DLS of order 9 was found in the projects Gerasim@Home and RakeSearch:

* 19N52M19C — 012345678123480567681753420748561032504672813837206145270814356456037281365128704
* 25N58M25C — 012345678120487365308561742547632081674158230786023154851276403235704816463810527

Traversed 23.96% of the search space, 23947 ODLS CFs of order 9 found at this moment.

The post-processing has been changed in such a way that now the found ODLS CFs are laid out by lines and the xSODLS number is calculated (see screenshot). At the moment all 88 DSODLS CFs  have been found (it is interesting if the results obtained earlier are correct or not yet? :), 108 SODLS CFs of 470 known ones and 3713 ESODLS CFs found.


Monday, October 19, 2020 evatutin#96

Each partial loop is a loop in a diagonal Latin square by definition. Similarly, by definition, each intercalate is a partial loop of length 4. These simple statements allow us to establish a number of relationships between the values of the numerical series associated with loops and intercalates and calculated earlier:

1. For loops: 0 <= A307166(n) <= A307167(n).
2. For partial loops: 0 <= A307170(n) <= A307171(n).
3. For minimum values: 0 <= A307163(n) <= A307170(n) <= A307166(n).
4. For maximum values: A307164(n) <= A307171(n) <= A307167(n).

Add to OEIS, the first swallow (https://oeis.org/draft/A307163) went, or rather, flew :)


All news

News is available as an RSS feed
User of the day
ale4316
Project status
Updated 54 minutes ago
 State: Beta 
 Account creation: Enabled 
 Credits total: 2,541,847,008 
 Participants total: 5,726 
 Teams total: 352 
 Countries total: 94 
 Computers total: 16,983 
Tasks
 Ready to send: 2,321,068 
 In progress: 33,522 
 Send work: Enabled 
Go to server status page