scholarly journals Recursive decomposition tree of a Moore co-family and closure algorithm

2013 ◽  
Vol 70 (1-2) ◽  
pp. 107-122
Author(s):  
Pierre Colomb ◽  
Alexis Irlande ◽  
Olivier Raynaud ◽  
Yoan Renaud
Keyword(s):  
Decomposition Tree ◽  
Recursive Decomposition ◽  
Closure Algorithm

Synthesis of digital twins with use of multidimensional recursive decomposition

2019 ◽  
pp. 26-37
Author(s):  
V. A. Minaev ◽  
A. V. Mazin ◽  
K. B. Zdiruk ◽  
L. S. Kulikov
Keyword(s):  
Educational Institution ◽  
Subject Area ◽  
Information Storage ◽  
Information Space ◽  
Practical Implementation ◽  
Cognitive Approach ◽  
Recursive Decomposition ◽  
Digital Twins ◽  
Secondary Information ◽  
Integrated Information

The article presents the scientific and methodological issues of formation of digital twins collections based on the use of the multi-aspect recursive decomposition algorithm of the subject area. The general approaches to the solution of topical issues of the modern stage of artificial intelligence are considered. The terminology is concretized in the interrelated areas of knowledge – information – data and its relation with the term of «digital twins» as information containers of knowledge is discussed. The structure, power estimation and metrizability of the information space presented as a recursively defined ordered set of elements – a collection of digital twins (DT-collections) are considered. It is shown that the practical implementation of this approach and its application as part of automated control systems involves maintaining the life cycle of the creation and operation of digital twins in the Integrated information storage, implementing a two-circuit scheme (model) of management. A new cognitive approach to assess the completeness of the knowledge measure in the information space is proposed. The model of the integrated information storage realizing accumulation of knowledge in data banks of primary and secondary information is considered. As an example, a recursive decomposition of a subset of engineering systems of an educational institution is performed.

scholarly journals Topological Frontier-Based Exploration and Map-Building Using Semantic Information

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4595 ◽  
Author(s):  
Clara Gomez ◽  
Alejandra C. Hernandez ◽  
Ramon Barber
Keyword(s):  
Open Space ◽  
Semantic Information ◽  
State Of The Art ◽  
Fundamental Problem ◽  
Cost Utility ◽  
Indoor Environments ◽  
Map Building ◽  
Topological Map ◽  
Unknown Area ◽  
Closure Algorithm

Exploration of unknown environments is a fundamental problem in autonomous robotics that deals with the complexity of autonomously traversing an unknown area while acquiring the most important information of the environment. In this work, a mobile robot exploration algorithm for indoor environments is proposed. It combines frontier-based concepts with behavior-based strategies in order to build a topological representation of the environment. Frontier-based approaches assume that, to gain the most information of an environment, the robot has to move to the regions on the boundary between open space and unexplored space. The novelty of this work is in the semantic frontier classification and frontier selection according to a cost–utility function. In addition, a probabilistic loop closure algorithm is proposed to solve cyclic situations. The system outputs a topological map of the free areas of the environment for further navigation. Finally, simulated and real-world experiments have been carried out, their results and the comparison to other state-of-the-art algorithms show the feasibility of the exploration algorithm proposed and the improvement that it offers with regards to execution time and travelled distance.

scholarly journals Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink

1994 ◽  
Vol 1 (30) ◽  
Author(s):  
Thore Husfeldt
Keyword(s):  
Transitive Closure ◽  
Upper Bounds ◽  
Directed Acyclic Graphs ◽  
Closure Problem ◽  
Directed Path ◽  
Lower And Upper Bounds ◽  
New Techniques ◽  
Time Dynamic ◽  
Acyclic Graphs ◽  
Closure Algorithm

We give an algorithm for the Dynamic Transitive Closure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form `is there a directed path from u to v ?' for arbitrary vertices u and v can be answered in logarithmic time. The size of the data structure and the initialisation time are linear in the number of edges.<br /> <br />The result enlarges the class of graphs for which a logarithmic (or even polylogarithmic) time dynamic transitive closure algorithm exists. Previously, the only algorithms within the stated resource bounds put restrictions on the topology of the graph or on the delete operation. To obtain our result, we use a new characterisation of the transitive closure in plane graphs with one source and one sink and introduce new techniques to exploit this characterisation.<br /> <br />We also give a lower bound of Omega(log n/log log n) on the amortised complexity of the problem in the cell probe model with logarithmic word size. This is the first dynamic directed graph problem with almost matching lower and upper bounds.

scholarly journals Catalan words avoiding pairs of length three patterns

2021 ◽  
Vol vol. 22 no. 2, Permutation... (Special issues) ◽  
Author(s):  
Jean-Luc Baril ◽  
Carine Khalil ◽  
Vincent Vajnovszki
Keyword(s):  
Structural Properties ◽  
Generating Functions ◽  
Recursive Decomposition ◽  
Integer Sequence ◽  
Combinatorial Interpretations

Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last authors and of S. Kirgizov where (among other things) the enumeration of Catalan words avoiding a patterns of length 3 is completed. More precisely, we explore systematically the structural properties of the sets of words under consideration and give enumerating results by means of recursive decomposition, constructive bijections or bivariate generating functions with respect to the length and descent number. Some of the obtained enumerating sequences are known, and thus the corresponding results establish new combinatorial interpretations for them.

scholarly journals Parallelization of the next Closure algorithm for generating the minimum set of implication rules

2016 ◽  
Vol 5 (2) ◽  
Author(s):  
Nilander R. M. de Moraes ◽  
Sergio M. Dias ◽  
Henrique C. Freitas ◽  
Luis E. Zarate
Keyword(s):  
Closure Algorithm
Sign in / Sign up

Export Citation Format

Share Document