Related papers: Independent sets of words and the synchronization …
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…
Consistency regularization describes a class of approaches that have yielded state-of-the-art results for semi-supervised classification. While semi-supervised semantic segmentation proved to be more challenging, a number of successful…
We study the problem of synchronizing a general complex network by means of an adaptive strategy in the case where the network topology is slowly time varying and every node receives at each time only one aggregate signal from the set of…
This paper gives a fresh look at network synchronization. Here we no longer analyze it from the view of mathematics, such as graph theory, while we probe into one from control theory. First, we analyze the synchronization region using the…
Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…
A new class of control problems is discussed - homeostasis control. Homeostasis control problems can be considered as control problems with a given target set, in particular, as a problem of stabilizing the values of some target function,…
This paper deals with the problem of classifying signals. The new method for building so called local classifiers and local features is presented. The method is a combination of the lifting scheme and the support vector machines. Its main…
Synchronization among autonomous agents via local interactions is one of the benchmark problems in multi-agent control. Whereas synchronization algorithms for identical agents have been thoroughly studied, synchronization of heterogeneous…
Nowadays the question `what is complexity?' is a challenge to be answered. This question is triggering a great quantity of works in the frontier of physics, biology, mathematics and computer science. Even more when this century has been…
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network…
This work is about the synchronization of nonlinear coupled dynamical systems driven by $\alpha$-stable noise. Firstly, we provide a novel technique to construct the relationship between synchronized system and slow-fast system. Secondly,…
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance. Second, using existing graph generators results in a…
We study the stabilization of networked control systems with asynchronous sensors and controllers. Offsets between the sensor and controller clocks are unknown and modeled as parametric uncertainty. First we consider multi-input linear…
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
We introduce a new method for determining the global stability of synchronization in systems of coupled identical maps. The method is based on the study of invariant measures. Besides the simplest non-trivial example, namely two…
Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we…
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
Recent years have witnessed a surge of publications aimed at tracing temporal changes in lexical semantics using distributional methods, particularly prediction-based word embedding models. However, this vein of research lacks the cohesion,…
The paper addresses the synchronization of multi-agent systems with continuous-time dynamics interacting through a very general class of monotonic continuous signal functions that covers estimation biases, approximation of discrete…