About OPTIMA@HOME
OPTIMA@HOME is a research project that uses Internetconnected
computers to solve challenging largescale optimization problems. The goal of optimization is to find a minimum (or maximum) for a given function. This topic is perfectly explained in the Internet.
See for example excellent explanation by Arnold Newumaier. Many practical problems are reduced to the global optimization problems. At the moment this project runs an application that is aimed at solving molecular conformation problem.
This is a very challenging global optimization problem consisting in finding the atomic cluster structure that has the minimal possible potential energy. Such structures plays an important role in understanding the nature of different materials, chemical reactions and other fields. The details about the problem can be found here.
You can participate by downloading and running a free program
on your computer.
OPTIMA@HOME is based at Institute for Systems Analysis of Russian Academy of Sciences, department of Distributed Computing  a founding member of the International Desktop Grid Federation.
 Project Status.
 The project is maintained by the Distributed Computing Department team. For communication please use the mposypkin :: at :: gmail {dot} com address.
Join OPTIMA@HOME
Returning participants
Community

User of the day
DanCamarena The author is known by the name of Omer. My house
is now in Vermont. Debt collecting is what he does in his working day
job. What me... 
News
Second experimental data set is submitted
October 03, 2014, 20:00 MSD
We submitted a new series of workunits (12289 wus). Each Wu runs local search for 32 times. So in total 131072 local
searches are expected. The precision was set to 0.00001. 10 free parameters for Tersoff potential are fitted.
First experimental data set is submitted
October 03, 2014, 20:00 MSD
We submitted a series of workunits (4096 wus). Each Wu runs local search for 32 times. So in total 131072 local
searches are expected. The precision was set to 0.00001. 10 free parameters for Tersoff potential are fitted.
New application is deployed!
October 03, 2014, 20:00 MSD
OPTIMA@home now hosts new application aimed at fitting parameters of the Tersoff potential. Molecular dynamics (MD) is often used for modeling various properties of crystals. The essence of this method consists in the numerical solution of the differential equations describing motion of atoms in the crystal lattice to determine the steady state. For moleculardynamic computations, you must know the potential  a function that determines the interaction energy of atoms in the lattice. Modern potentials used in the simulations contain several parameters. Specific parameter values determine what concrete material is modeled. For example, for silicon, this will be one set, for diamond another etc.
The project is aimed at fitting parameter values of the potential in order to achieve known material properties (energy of the lattice cell, the components of the elastic modulus etc.). Then this potential will be used for molecular dynamics simulation. To identify potential parameters we solve the problem of minimizing the variance of the values of the properties obtained by using the potential from known values. This task is to generate a large sequence of initial approximations, from which further methods local search is a (local) minimum. Next, from the obtained values we select tuples with objective values less than the specified precision.
New test set was launched!
July 08, 2014, 20:00 MSD
It is need for the optimization of the solver smallexpx.
About smallexp and smallexpx
July 18, 2013, 00:01 MSD
Since March, the project carried out calculations associated with the application smallexp.
The scientific problem of smallexp is the experimental calculation of the asymptotic growth of the maximum possible number of fragments in a sequence fixed length. It is important to get information on possible periodic structures. This is necessary for the
development of efficient algorithms search for fragments of small order in character sequences (the order  the ratio of the length of the words to the minimum period). It's important for discrete mathematics. Smallexpx application has more efficient algorithm
then smallexp application. Articles about scientific problem:
R. Kolpakov, G. Kucherov, On Maximal Repetitions in Words, J. Discrete Algorithms 1(1) (2000), 159–186.
R. Kolpakov, G. Kucherov, Periodic structures in words, chapter for the 3rd Lothaire volume Applied Combinatorics on Words, Cambridge University Press, 2005.
M. Crochemore, C. Iliopoulos, M. Kubica, J. Radoszewski, W. Rytter, T. Walen, Extracting powers and periods in a string from its runs structure, Lecture
Notes in Comput. Sci. 6393
(2010), 258–269.
...more
News is available as an
RSS feed .
