The article proposes a method based on the use of logical dynamic systems in the classification problem for Boolean vectors (binary feature vectors). This method has practical application in various fields of science ...
The article proposes a method based on the use of logical dynamic systems in the classification problem for Boolean vectors (binary feature vectors). This method has practical application in various fields of science and industry, in particular, socionics, geology, mechanical engineering, and others. Binary synchronous autonomous linear and nonlinear dynamic models with an unknown characteristic matrix are considered. Matrix elements are chosen the way that these binary feature vectors are equilibrium states of the binary dynamic model. The areas of attraction of equilibrium states act as classes. One reference vector corresponds to each class. The classification process consists of constructing trajectories of a logical-dynamic system with a given initial state. It aims to verify the reachability of one of the equilibrium states. A meaningful example of the proposed method is considered.
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not inte...
详细信息
We address to the problem of an integration of heterogeneous computational clusters to the united environment applying the OpenStack platform for a cluster resource virtualization. However, this platform does not interact with the traditional resource management systems such as the PBS Torque or SLURM that are used in cluster resources. To this end, we developed an additional hypervisor shell to run virtual machines through queues of the aforementioned systems. Thus, we expand the OpenStack capabilities for an application job management and provide a computation scalability for virtualized resources of clusters. In order to show the benefits of our approach to the scalable application management in integrated cluster environments, we developed a parameter sweep application for simulation modeling of warehouse logistics and solved three optimization tasks for the real refrigerated warehouse. We compared the selected criteria of task solving processes with the hypervisor shell applying and without it by means of simulation modeling. Experiments show that the hypervisor shell can significantly improve computation speedup and task solving time through reallocating virtual machines to queues of the resource management systems.
The article is devoted to optimal covering and packing prob- lems for a bounded set in a two-dimensional metric space with a given amount of congruous circles. Such problems are of both theoretical interest and practi...
详细信息
The article is devoted to optimal covering and packing prob- lems for a bounded set in a two-dimensional metric space with a given amount of congruous circles. Such problems are of both theoretical interest and practical relevance. For instance, such statements appear in logistics when one needs to locate a given number of commercial or social facilities. A numerical algorithm based on fundamental physical principles due to Fermat and Huygens is suggested and implemented. It allows us to solve the problems for the cases of non-convex sets and non-Euclidean metrics. The results of numerical experiments are presented and discussed. Calculations show the applicability of the proposed approach its high efficiency for covering of a convex set in the Euclidean space by a sufficiently large amount of circles.
Nowadays, a provision of the computational process fault-tolerance in Grid is a relevant issue. In the paper, we address a fault-tolerance improvement in solving large-scale scientific and applied problems that are im...
详细信息
Nowadays, a provision of the computational process fault-tolerance in Grid is a relevant issue. In the paper, we address a fault-tolerance improvement in solving large-scale scientific and applied problems that are implemented through modular programming in heterogeneous distributed computing environments. We describe a computational process by an abstract program (problem-solving scheme) that correlates to a workflow. The problem-solving scheme specifies modules (applied software) and their relations with each other. This paper proposes a new multi-agent algorithm for re-allocating Grid-resources when the computational process fails. The algorithm execution involves forming a residual problem-solving scheme using methods of the abstract program specialization and reallocating its modules between agents that represent computational resources. In comparison to the known algorithms for the same purpose, the proposed algorithm implements an adaptive multi-scenario solving this issue and therefore increases a degree of computational process fault-tolerance. Extensive modeling and practical experiments demonstrate the practicability of the proposed algorithm.
The paper addresses a relevant problem of predicting the runtime of jobs for executing problem-solving schemes of large-scale applications in a heterogeneous distributed computing environment. Such an environment incl...
详细信息
The article describes combinatorial structures based on diagonal Latin squares (DLS) of order 10 and the orthogonality condition between pairs of such squares. These structures are novel and interesting in the context...
详细信息
The paper addresses the relevant issue of ensuring the reliability of solving large scientific and applied problems in computing environments that integrate Grid and cloud computing. The main reliability parameter is ...
详细信息
We consider an approach to synthesis a kernel of information system for a small enterprise. The approach could extend capabilities of present CASE-systems to support OMG's MDA architecture. The source code synthes...
详细信息
Staff scheduling is a key component of supporting and increasing competitiveness for many service enterprises. This is of especially urgent concern for organizations that provide service on a twenty-four hour basis an...
详细信息
Abstract Sufficient and necessary global optimality conditions for nonlinear impulsive dynamic optimization problems with endpoint constraints are obtained. Proofs of these results are based on Hamilton-Jacobi canonic...
Abstract Sufficient and necessary global optimality conditions for nonlinear impulsive dynamic optimization problems with endpoint constraints are obtained. Proofs of these results are based on Hamilton-Jacobi canonical optimality theory. As consequence, a Maximum Principle reverse into sufficient optimality conditions is proposed.
暂无评论