   |
  |
||
|
|||
 |
|||
“Informatics and Applications” scientific journalVolume 16, Issue 1, 2022Content Abstract and Keywords About Authors ALGEBRAIC SPECIFICATION OF GRAPH COMPUTATIONAL STRUCTURES
Abstract: Problems of composing algebraic specifications for computational structures represented by data flow graphs are considered. The evolution of algebraic program specification tools is briefly outlined, from many-sorted algebra via coalgebra to a category-theoretical construction of dialgebra capable of describing interactive computing nodes. As a next step, a novel category-theoretical construction called graphalgebra is proposed which allows combining dialgebras into arbitrary directed multigraphs whose edges represent computational operations at nodes and whose vertices describe data exchanged between nodes. Examples of graphalgebraic specifications for neural networks and multiprocessor computational systems are given. The method of building categories of graphalgebras via universal constructions is described. For a computational structure of the system of systems kind consisting of graph structures, methods of hierarchical construction of an algebraic specification from the specifications of components are proposed. Keywords: algebraic specification; graph computational structure; system of systems; category theory; dialebra; graphalgebra; pullback ABOUT SEARCHING FOR THE OPTIMAL 3D PRINTING SCHEME OF STRUCTURES FROM COMPOSITE MATERIALS
Abstract: The article is devoted to finding optimal fiber laying trajectories in the manufacture of structures reinforced with continuous fibers by 3D printing. As the objective function of this optimization problem, one of the criteria for the destruction of the composite is selected. Fiber laying schemes during printing are modeled using analytical functions that are found from the Neumann problem for the Laplace equation. The boundary conditions for this problem are constructed on the basis of specifying the angles between the fibers and the boundary of the region. The Neumann problem is solved by a conformal transformation of the print area into a circle. Thus, the criterion for the destruction of the composite becomes a function of the angles that the fibers form with the boundary of the region. Minimization is carried out using a genetic algorithm for searching for the global minimum of a function of several variables. Keywords: composite materials; wavelets; 3D printing; analytical function CONTEXT QUERY ON PHOTONS WITH THE USE OF BELL TESTS
Abstract: The possibilities for physical realization of contextual query on photons in an optical processor using Bell tests are considered. To solve this problem, context coding of words in documents on quantum states of single photons using the well-known method of hyperspace analog language is proposed. Analytical expressions for determination of parameters of contextual query by a pair of words that can be bound or not bound depending on the value of this parameter were obtained. Most connected is quantum entangled state of document wave functions chosen by a pair of words that corresponds to a certain value of the contextual query parameter. The suggested methods of realization of semantic contextual query are necessary for determination of nonlocal context that is demanded for acquiring better understanding during automated search and machine translation. The second word in the pair of query words clarifies the meaning of the first word through their semantic connection. Keywords: hyponym; hyperonym; isotopy; genus-species relations; photonic qubit; entangled state; Bell test; holographic processor METRIC EVALUATIONS OF THE ANGULAR POINTS OF THE SET OF ATTAINABLE INTERNODAL FLOWS OF MULTIUSER NETWORK
Abstract: The paper considers a model of a multiuser communication network in which information flows of various types are simultaneously transmitted between all pairs of correspondent nodes. The results of computational experiments for evaluation of the metric characteristics of a convex set of attainable interstitial flows and angular points located on the faces are analyzed. The angular points of intersection of the outer boundary of the set with the coordinate axes, each of which corresponds to the maximum internodal flow of a certain type, are considered as basic-point. To determine the coordinates of the support-angular-points, the values of permissible internodal flows are calculated, with simultaneous transmission of which the maximum load of all network edges is achieved. The coordinates of the bench-mark-point at which the sum of the internodal flows reaches the maximum possible value on the attainable set are also calculated. The norm of vectors corresponding to the coordinates of angular points is estimated in conditional units of flows during the computational experiments. Comparative diagrams of conditional distances between the bench-mark and support-angular points are provided. Computational experiments make it possible to write an explicit form of the vectors of internodal flows, the convex combination of which can be used to guarantee the evaluation of the functional characteristics of the network at the maximum load of all edges.
Keywords: multicommodity network model; internodal flows set; network peak-load NORMALIZATION OF SYSTEMS WITH STOCHASTICALLY UNSOLVED DERIVATIVES
Abstract: For a system with stochastically unsolved derivatives, two approaches for reduction of such systems to deterministic systems are developed. The first approach is based on equations for mathematical expectations and covariance characteristics. The second approach considers equations for mathematical expectations and coordinate functions for canonical expansions. The theory of normal stochastic systems is the basis of the developed approaches. An illustrative example is given. Applications to estimation, identification, and calibration problems are considered. Some generalizations are mentioned. Keywords: canonical expansion (CE); methods of analytical modeling (VFV); normalization by Pugachev; stochastic processes (StP); stochastic systems (StS); stochastic function system with stochastically unsolved derivatives ON THE APPLICATION OF A TOPOLOGICAL APPROACH TO ANALYSIS OF POORLY FORMALIZED PROBLEMS FOR CONSTRUCTING ALGORITHMS FOR VIRTUAL SCREENING OF QUANTUM-MECHANICAL PROPERTIES OF ORGANIC MOLECULES I: THE BASICS OF THE PROBLEM-ORIENTED THEORY
Abstract: The topological approach to the analysis of poorly formalized problems and the theory of chemographs are extensions of Zhuravlev's algebraic approach to recognition. In the first part of the article, a problem-oriented formalism is proposed aimed at development of algorithms for screening assessments of the quantum-mechanical properties of molecules on the basis of their chemical structure. Methods for introducing metrics on sets of molecules and procedures for generating "synthetic" feature descriptions are proposed. The latter are generated by matching the values of some "expert" metric on the set of molecular properties to a tunable metric on the set of molecular structures. Keywords: algebraic approach; chemoinformatics; labeled graphs; combinatorial solvability analysis PERSONAL COGNITIVE ASSISTANT: PLANNING ACTIVITY WITH SCRIPTS
Abstract: The paper presents procedures for a cognitive assistant's behavior planning based on scripts - generalized schemes of tasks solving. A cognitive assistant is a virtual intelligent agent that has its own worldview and builds a worldview of the user, it helps to solve various common or specific problems. The key component of assistant's goal-based behavior is scenario - a reusable abstract sequence of actions and situations that are used for synthesis of a concrete plan of actions for a user. The concept of a scenario in psychological and linguistic interpretation as well as the procedure of scenarios extraction from texts are considered. The scenario and the plan of behavior are formalized using the sign-based approach. Methods for synthesizing a plan of behavior are proposed. A test case of a behavior plan synthesis for buying a car is considered. Keywords: cognitive assistant; activity script; behavior planning CONFLICT RESOLUTION IN HYBRID INTELLIGENT MULTIAGENT SYSTEMS
Abstract: The paper discusses an algorithm for reducing the intensity and resolving conflicts that arise in hybrid intelligent multiagent systems. The proposed algorithm is an integral part of the method for managing problem- and process-oriented conflicts in such systems. This method makes it possible to identify decision-making situations, stimulate, if necessary, and subsequently resolve constructive forms of conflict, as well as prevent its destructive forms using the proposed algorithm. Stimulation of the conflict together with the heterogeneity of the system according to the knowledge of specialists simulated by agents and the methods used by them provides an all-sided consideration of the problem posed. The proposed algorithm for reducing the intensity and resolving conflicts allows agents to reconcile automatically their positions on solving the problem and work out a single collective solution in order to save the user from the need for manual analysis and choosing a solution from the array of alternatives proposed by individual agents. Keywords: conflict; hybrid intelligent multiagent system; team of specialists; conflict resolution THE COMPARISON OF WAITING TIME EXTREMAL INDEXES IN M/G/1 QUEUEING SYSTEMS
Abstract: The theorem which states that if the initial stationary sequences are stochastically ordered, there are limiting distributions for maxima and the normalizing sequences are ordered, then their extreme indexes are also ordered is proved. This result is applied to compare the extreme indexes of stationary waiting times in two M/G/1 systems with the same input flows and stochastically ordered service times. Three examples of queueing systems with exponential distribution, Pareto distribution, and Weibull distribution of service times are considered. For these distributions, the relations between the parameters guaranteeing the stochastic ordering of the distributions and the normalizing sequences are obtained. Keywords: extreme value distributions; extremal index; queueing system; stochastic ordering SIMPLIFIED LANGUAGE FOR VISUAL IMAGES
Abstract: The implementation of the natural language model as an information system needs certain information about how the language ability of a person functions in his/her physiology and in what sequence its two autonomous components should interact: grammar and semantics as software for the linguistic phenomenon in digital technology The study of this problem should begin with the implementation of the language of visual images since in this case, the monitor screen can be used as the "organ of the visual system" of a native speaker (computer) which allows parallel processing of the same graphic information in two forms: in the form of text (syntactic analysis) and in the form of image (semantic analysis). The depth of the thought process depends on the ability of the information system to transform information from one form (text) to another (graphic) and vice versa. Keywords: natural language; syntax; semantics; dictionary; vision; semantic network; syntactic network; transformation; algorithm; memory OPTIMIZATION OF THE THRESHOLD SERVICE SPEED CONTROL IN THE G/M/1 QUEUE
Abstract: Consideration is given to the problem of optimal service speed switching in a G/M/1 queuing system with an objective function which takes into account the fee for customer's service, the penalty for customer's delay in the queue, the penalty for customer's rejection, the penalty for server being idle, and the maintenance costs. The case of finite capacity queue is also considered. The nonlinear optimization problem is formulated and solved in which the objective function is the system's revenue and the control variable is the queue length. The author proves that the objective function is unimodal and formulates the conditions for the existence of an optimal threshold service speed switching and necessary and sufficient conditions for the optimal control. Keywords: queuing system; threshold control; system costs FINDING MAXIMAL FREQUENT AND MINIMAL INFREQUENT SETS IN PARTIALLY ORDERED DATA
Abstract: Relevant issues of time costs reducing in the logical analysis of data with elements from the Cartesian product of finite partially ordered sets are investigated. An original method based on solving a complex discrete problem called dualization over the product of partial orders is proposed for the problem of finding maximal frequent and minimal infrequent sets in the transaction database. The proposed method is a synthesis of two other known methods, one of which is quite obvious and the other uses the idea of an incremental enumeration of target sets and is, therefore, mainly of theoretical interest. An experimental study of the considered approaches in the case of the product of finite chains is carried out and conditions for their effectiveness are revealed. The expediency of applying asymptotically optimal dualization algorithms over the product of partial orders is shown. Keywords: maximal frequent sets; minimal infrequent sets; dualization over the product of partial orders; asymptotically optimal dualization algorithm SOFTWARE PACKAGE FOR MULTISCALE MODELING OF STRUCTURAL PROPERTIES OF COMPOSITE MATERIALS
Abstract: Today, creation of new composite materials and methods of their construction with predictable properties is one of the urgent and most important tasks connected with modernization of industrial production in our country.
Keywords: multiscale modeling; composite materials; integration platform; software package; distributed system
|
 | |
 Phone of the Center: +7 (499) 135-62-60E-mail of the Center: ipiran@ipiran.ru | 
RUS
|