Abstract: The equations of motion of the Goryachev–Sretensky gyrostat are studied. All stationarysolutions are found on the invariant set of the zero level of the area integral, and their stability isanalyzed. For th...
详细信息
Though clustering is related to unsupervised machine learning and does not require any prior information on data items, in many real-life settings, there may be some expert knowledge on data labels or the properties o...
详细信息
The paper proposes a computational technology for constructing the boundary of the reachable set of the controlled dynamical systems. The monowave method underlying it relies on the use of a given sequence of controls...
详细信息
In this paper, we study systems of Fredholm integral equations with a singular matrix multiplying the leading part. We address the solvability issues of such systems with separable kernels and, similarly to differenti...
详细信息
In the context of the problem of checking the equivalence of Boolean circuits (LEC), we propose an approach that increases the efficiency of modern SAT solvers on this problem by generating additional constraints of a...
详细信息
Abstract: We study solvability questions for the problem on realization of operator functions foran invariant polylinear regulator of a higher-order differential system in an infinite-dimensionalseparable Hilbert spac...
详细信息
It is usual to classify the automated searching of a plan as an artificial intelligence problem. In planning, the environment is defined as a set of both states and transitions between them. Planning consists in searc...
详细信息
Quadratic programming problems (QP) arise in a vast variety of real-world applications in finance, engineering, operational research, and many other fields. A huge number of methods and their various modifications hav...
详细信息
In this paper, we propose a technique for increasing the accuracy of modeling nonlinear dynamics of input-output systems using finite segments (polynomials) of Volterra integral power series. We highlight a case when ...
详细信息
Based on the Boolean constraints method several problems of qualitative analysis of bipartite logical networks are solved. The dynamics of the trajectories behavior of these networks is studied over a finite time inte...
详细信息
ISBN:
(数字)9798350382501
ISBN:
(纸本)9798350382518
Based on the Boolean constraints method several problems of qualitative analysis of bipartite logical networks are solved. The dynamics of the trajectories behavior of these networks is studied over a finite time interval. A method is proposed for splitting a bipartite trajectory into two independent trajectories based on deterministic block-sequential updating of the state vectors of each part. Conditions for the existence, isolation and attraction of cyclic trajectories of a given length are obtained as Boolean constraints. The solvability of such equations reduces to the well-known Boolean satisfiability problem, effectual algorithms for solving which provide dynamic analysis for systems with high dimensionality of the state vector over large discrete time intervals. The program modules implementation for building Boolean constraints and checking their feasibility in the form of microservices ensures their reuse, simplification of deployment, updating, and high scalability in the cloud environment. Multi-agent computation management in an applied microservices package provides the non-procedural problem formulation on a distributed model of the subject area, forms and executes a scheme for solving it, and automates the additional resources provision. The practical significance of the obtained results consists in providing the opportunity for a more detailed study of dynamics of the molecular features of gene regulation networks.
暂无评论