Search results for "Reti"
showing 10 items of 16256 documents
Interrogating witnesses for geometric constraint solving
2012
International audience; Classically, geometric constraint solvers use graph-based methods to decompose systems of geometric constraints. These methods have intrinsic limitations, which the witness method overcomes; a witness is a solution of a variant of the system. This paper details the computation of a basis of the vector space of free infinitesimal motions of a typical witness, and explains how to use this basis to interrogate the witness for dependence detection. The paper shows that the witness method detects all kinds of dependences: structural dependences already detectable by graph-based methods, but also non-structural dependences, due to known or unknown geometric theorems, which…
A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […
Networked Bio-Inspired Evolutionary Dynamics on a Multi-Population
2019
We consider a multi-population, represented by a network of groups of individuals. Every player of each group can choose between two options, and we study the problem of reaching consensus. The dynamics not only depend on the dynamics within the group, but they also depend on the topology of the network, so neighboring groups influence individuals as well. First, we develop a mathematical model of this networked bio-inspired evolutionary behavior and we study its steady-state. We look at the special case where the underlying network topology is a regular and unweighted graph and show that the steady-state is a consensus equilibrium. A sufficient condition for exponential stability is given.…
Graph-theoretical derivation of brain structural connectivity
2020
Brain connectivity at the single neuron level can provide fundamental insights into how information is integrated and propagated within and between brain regions. However, it is almost impossible to adequately study this problem experimentally and, despite intense efforts in the field, no mathematical description has been obtained so far. Here, we present a mathematical framework based on a graph-theoretical approach that, starting from experimental data obtained from a few small subsets of neurons, can quantitatively explain and predict the corresponding full network properties. This model also changes the paradigm with which large-scale model networks can be built, from using probabilisti…
Consensus via multi-population robust mean-field games
2017
In less prescriptive environments where individuals are told ‘what to do’\ud but not ‘how to do’, synchronization can be a byproduct of strategic thinking,\ud prediction, and local interactions. We prove this in the context of multipopulation\ud robust mean-field games. The model sheds light on a multi-scale\ud phenomenon involving fast synchronization within the same population and\ud slow inter-cluster oscillation between different populations.
New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates
2015
This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.
P-FCM: a proximity-based fuzzy clustering for user-centered web applications
2003
Abstract In last years, the Internet and the web have been evolved in an astonishing way. Standard web search services play an important role as useful tools for the Internet community even though they suffer from a certain difficulty. The web continues its growth, making the reliability of Internet-based information and retrieval systems more complex. Nevertheless there has been a substantial analysis of the gap between the expected information and the returned information, the work of web search engine is still very hard. There are different problems concerning web searching activity, one among these falls in the query phase. Each engine provide an interface which the user is forced to le…
Transformation of Construction Cement to a Self-Healing Hybrid Binder
2019
A new biomimetic strategy to im prove the self-healing properties of Portland cement is presented that is based on the application of the biogenic inorganic polymer polyphosphate (polyP), which is used as a cement admixture. The data show that synthetic linear polyp, with an average chain length of 40, as well as natural long-chain polyP isolated from soil bacteria, has the ability to support self-healing of this construction material. Furthermore, polyP, used as a water-soluble Na-salt, is subject to Na+/Ca2+ exchange by the Ca2+ from the cement, resulting in the formation of a water-rich coacervate when added to the cement surface, especially to the surface of bacteria-containing cement/c…
Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
2011
We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…