Rakesearch: Difference between revisions

From BOINC Projects
Jump to navigation Jump to search
Al Piskun (talk | contribs)
move image
Al Piskun (talk | contribs)
Methods/ details
Line 3: Line 3:
[[File:{{#setmainimage:Squares.png}}|alt=logo image|center|frameless]]
[[File:{{#setmainimage:Squares.png}}|alt=logo image|center|frameless]]


[https://rake.boincfast.ru/rakesearch/ '''''RakeSearch'''''] is a '''''[[wikipedia:Volunteer computing|volunteer distributed computing]]''''' project that uses [https://boinc.berkeley.edu/ '''''BOINC'''''] and needs your help to ...[[File:Example of a GUI.png|alt=example mediawiki image|thumb|insert [[commons:Main_Page|'''''Wikimedia Commons''''']] image or Upload file]]
[https://rake.boincfast.ru/rakesearch/ '''''RakeSearch'''''] is a BOINC based '''''[[wikipedia:Volunteer computing|volunteer computing]]''''' project that needs your help to process diagonal Latin squares.[[File:Example of a GUI.png|alt=example mediawiki image|thumb|<small>(Optional) insert [[commons:Main_Page|'''''Wikimedia Commons''''']] image or Upload file</small>]]
== Why RakeSearch? ==
== Why RakeSearch? ==


Line 9: Line 9:


== Goal ==
== Goal ==
* summarize the objectives and challenges which the project addresses, before jumping into details
Investigate the diagonal Latin squares space.


== Methods ==
== Methods ==
* always including "why BOINC"?
The enormous size of the diagonal Latin squares space makes it unfeasible to enumerate all its objects in reasonable time. Sophisticated search methods and the BOINC platform are essential to meet the need.
*
 
* impactful final statement
RakeSearch implements an application that picks up separate pairs of mutually orthogonal DLS, which allows reconstruction of full graphs of their orthogonality.
 
'''Source code:'''
 
* [https://yadi.sk/d/BowN1CH4Lfg0qA diagonal Latin squares of Rank 9 (R9'')'']
* [https://yadi.sk/d/adWagBGhPfsPgA diagonal Latin squares of Rank 10 (R10)]


== Project team / Sponsors ==
== Project team / Sponsors ==
hoarfrost. The searchers team, Karelian Research Center of the Russian Academy of Sciences.


== Scientific results ==
== Scientific results ==
* external links
https://rake.boincfast.ru/rakesearch/publications.php
 
https://rake.boincfast.ru/rakesearch/graphs.html


== Scientific publications ==
== Scientific publications ==

Revision as of 10:56, 23 March 2024

BOINC project page template

[[File:{{#setmainimage:Squares.png}}|alt=logo image|center|frameless]]

RakeSearch is a BOINC based volunteer computing project that needs your help to process diagonal Latin squares.

example mediawiki image
(Optional) insert Wikimedia Commons image or Upload file

Why RakeSearch?

  • why this topic/object of study?

Goal

Investigate the diagonal Latin squares space.

Methods

The enormous size of the diagonal Latin squares space makes it unfeasible to enumerate all its objects in reasonable time. Sophisticated search methods and the BOINC platform are essential to meet the need.

RakeSearch implements an application that picks up separate pairs of mutually orthogonal DLS, which allows reconstruction of full graphs of their orthogonality.

Source code:

Project team / Sponsors

hoarfrost. The searchers team, Karelian Research Center of the Russian Academy of Sciences.

Scientific results

https://rake.boincfast.ru/rakesearch/publications.php

https://rake.boincfast.ru/rakesearch/graphs.html

Scientific publications

  1. Vatutin, Eduard, Oleg Zaikin, Maxim Manzyuk and Natalia Nikitina. Searching for Orthogonal Latin Squares via Cells Mapping and BOINC-Based Cube-and-Conquer. (2021). DOI: 10.1007/978-3-030-92864-3_38.
  2. Vatutin, Eduard and Alexey Belyshev. Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality. (2020). DOI: 10.1007/978-3-030-64616-5_50.
  3. Ivashko, Evgeny and Natalia Nikitina. Replication of “Tail” Computations in a Desktop Grid Project. (2020). DOI: 10.1007/978-3-030-64616-5_52.
  4. Manzyuk, Maxim, Natalia Nikitina and Eduard Vatutin. Start-up and the Results of the Volunteer Computing Project RakeSearch. (2019). DOI: 10.1007/978-3-030-36592-9_59.