Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
A hybrid scheme for action representation
1993
Strong deficiencies are present in symbolic models for action representation and planning, regarding mainly the difficulty of coping with real, complex environments. These deficiencies can be attributed to several problems, such as the inadequacy in coping with incompletely structured situations, the difficulty of interacting with visual and motorial aspects, the difficulty in representing low-level knowledge, the need to specify the problem at a high level of detail, and so on. Besides the purely symbolic approaches, several nonsymbolic models have been developed, such as the recent class of subsym-bolic techniques. A promising paradigm for the modeling of reasoning, which combines feature…
Vertical Representation of C∞-words
2015
International audience; We present a new framework for dealing with C∞-words, based on their left and right frontiers. Thisallows us to give a compact representation of them, and to describe the set of C∞-words throughan infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers ofC∞-words. We show that this map can be defined recursively and with no explicit reference toC∞-words. We then show that some important conjectures on C∞-words follow from analogousstatements on the structure of the graph G.
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Pure Functions in C: A Small Keyword for Automatic Parallelization
2017
AbstractThe need for parallel task execution has been steadily growing in recent years since manufacturers mainly improve processor performance by increasing the number of installed cores instead of scaling the processor’s frequency. To make use of this potential, an essential technique to increase the parallelism of a program is to parallelize loops. Several automatic loop nest parallelizers have been developed in the past such as PluTo. The main restriction of these tools is that the loops must be statically analyzable which, among other things, disallows function calls within the loops. In this article, we present a seemingly simple extension to the C programming language which marks fun…
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
Categorical Modeling Method, Proof of Concept for the Petri Net Language
2019
Modeling increases the importance of processes significantly, but also imposes higher requirements for the accuracy of process specifications, since an error in the design of a process may only be discovered after it already produces large cumulative losses. We believe that modeling tools can help build better models in a shorter time. This inevitably results in the need to build formal models that can be theoretically verified. A category as well as a model is a mixture of graphical information and algebraic operations. Therefore, category language seems to be the most general to describe the models. The category theory offers an integrated vision of the concepts of a model, and also provi…
Fast Decentralized Linear Functions via Successive Graph Shift Operators
2019
Decentralized signal processing performs learning tasks on data distributed over a multi-node network which can be represented by a graph. Implementing linear transformations emerges as a key task in a number of applications of decentralized signal processing. Recently, some decentralized methods have been proposed to accomplish that task by leveraging the notion of graph shift operator, which captures the local structure of the graph. However, existing approaches have some drawbacks such as considering special instances of linear transformations, or reducing the family of transformations by assuming that a shift matrix is given such that a subset of its eigenvectors spans the subspace of i…
Performability of Actions
2021
AbstractAction theory may be regarded as a theoretical foundation of AI, because it provides in a logically coherent way the principles of performing actions by agents. But, more importantly, action theory offers a formal ontology mainly based on set-theoretic constructs. This ontology isolates various types of actions as structured entities: atomic, sequential, compound, ordered, situational actions etc., and it is a solid and non-removable foundation of any rational activity. The paper is mainly concerned with a bunch of issues centered around the notion of performability of actions. It seems that the problem of performability of actions, though of basic importance for purely practical ap…
Method to find the Minimum 1D Linear Gradient Model for Seismic Tomography
2016
The changes in the state of a geophysical medium before a strong earthquake can be found by studying of 3D seismic velocity images constructed for consecutive time windows. A preliminary step is to see changes with time in a minimum 1D model. In this paper we develop a method that finds the parameters of the minimum linear gradient model by applying a two-dimensional Taylor series of the observed data for the seismic ray and by performing least-square minimization for all seismic rays. This allows us to obtain the mean value of the discrete observed variable, close to zero value.