Результаты поиска по 'method':
Найдено статей: 714
  1. Smirnov S.A., Voloshinov V.V.
    Pre-decomposition of discrete optimization problems to speed up the branch and bound method in a distributed computing environment
    Computer Research and Modeling, 2015, v. 7, no. 3, pp. 719-725

    The paper presents an implementation of branch and bound algorithm employing coarse grained parallelism. The system is based on CBC (COIN-OR branch and cut) open-source MIP solver and inter-process communication capabilities of Erlang. Numerical results show noticeable speedup in comparison to single-threaded CBC instance.

    Keywords: branch and bound algorithm, coarse grained parallelism.
    Views (last year): 2. Citations: 2 (RSCI).
  2. Tkachenko I.A.
    Experience of puppet usage for managment of Tier-1 GRID cluster at NRC “Kurchatov Institute”
    Computer Research and Modeling, 2015, v. 7, no. 3, pp. 735-740

    This article is about the organization of the cluster management using puppet. It tells about: safety of usage, from the point of view of mass apply at a computing cluster wrong configuration (by reason of human factor); collaboration work and the creation of opportunities for each cluster administrator, regardless of others, writing and debugging your own scripts, before include them in the overall system of cluster managment; writing scripts, which allow to get as fully configured nodes, and updates the configuration of any system parts, without affecting the rest of the nodes components, regardless of the current state of the node of computing cluster.

    The article compares different methods of the creation of the hierarchy of puppet scenarios, describes problems associated with the use of “include” for the organization hierarchy, and tells about the transition to a system of sequential call classes through shell-script.

    Keywords: puppet, automation of configuration, joint cluster management, puppet use cases.
  3. Shefov K.S., Stepanova M.M.
    An implementation of a parallel global minimum search algorithm with an application to the ReaxFF molecular dynamic force field parameters optimization
    Computer Research and Modeling, 2015, v. 7, no. 3, pp. 745-752

    Molecular dynamic methods that use ReaxFF force field allow one to obtain sufficiently good results in simulating large multicomponent chemically reactive systems. Here is represented an algorithm of searching optimal parameters of molecular-dynamic force field ReaxFF for arbitrary chemical systems and its implementation. The method is based on the multidimensional technique of global minimum search suggested by R.G. Strongin. It has good scalability useful for running on distributed parallel computers.

    Keywords: numerical simulation, molecular dynamics, reactive force field, chemically reactive systems, parameter optimization, parallel algorithm, absolute extremum search.
    Views (last year): 1. Citations: 1 (RSCI).
  4. Bogdanov A.V., Mareev V.V., Stepanov E.A., Panchenko M.V.
    Modeling of behavior of the option. The formulation of the problem
    Computer Research and Modeling, 2015, v. 7, no. 3, pp. 759-766

    Object of research: The creation of algorithm for mass computations of options‘ price for formation of a riskless portfolio. The method is based on the generalization of the Black–Scholes method. The task is the modeling of behavior of all options and tools for their insurance. This task is characterized by large volume of realtime complex computations that should be executed concurrently The problem of the research: depending on conditions approaches to the solution should be various. There are three methods which can be used with different conditions: the finite difference method, the path-integral approach and methods which work in conditions of trade stop. Distributed computating in these three cases is organized differently and it is necessary to involve various approaches. In addition to complexity the mathematical formulation of the problem in literature is not quite correct. There is no complete description of boundary and initial conditions and also several hypotheses of the model do not correspond to real market. It is necessary to give mathematically correct formulation of the task, and to neutralize a difference between hypotheses of the model and their prototypes in the market. For this purpose it is necessary to expand standard formulation by additional methods and develop methods of realization for each of solution branches.

    Keywords: financial mathematics, options pricing, asian option, wellposedness formulation, boundary conditions.
    Views (last year): 2. Citations: 1 (RSCI).
Pages: « first previous

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Website Copyright © 2009–2026 Institute of Computer Science