Search results for "Topologies"
showing 9 items of 9 documents
Bio-inspired evolutionary dynamics on complex networks under uncertain cross-inhibitory signals
2019
Given a large population of agents, each agent has three possiblechoices between option 1 or 2 or no option. The two options are equally favorable and the population has to reach consensus on one of the two options quickly and in a distributed way. The more popular an option is, the more likely it is to be chosen by uncommitted agents. Agents committed to one option can be attracted by those committed to the other option through a cross-inhibitory signal. This model originates in the context of honeybee swarms, and we generalize it to duopolistic competition and opinion dynamics. The contributions of this work include (i) the formulation of a model to explain the behavioral traits of the ho…
Variations of selective separability II: Discrete sets and the influence of convergence and maximality
2012
A space $X$ is called selectively separable(R-separable) if for every sequence of dense subspaces $(D_n : n\in\omega)$ one can pick finite (respectively, one-point) subsets $F_n\subset D_n$ such that $\bigcup_{n\in\omega}F_n$ is dense in $X$. These properties are much stronger than separability, but are equivalent to it in the presence of certain convergence properties. For example, we show that every Hausdorff separable radial space is R-separable and note that neither separable sequential nor separable Whyburn spaces have to be selectively separable. A space is called \emph{d-separable} if it has a dense $\sigma$-discrete subspace. We call a space $X$ D-separable if for every sequence of …
A very brief history of soft computing: Fuzzy Sets, artificial Neural Networks and Evolutionary Computation
2013
This paper gives a brief presentation of history of Soft Computing considered as a mix of three scientific disciplines that arose in the mid of the 20th century: Fuzzy Sets and Systems, Neural Networks, and Evolutionary Computation. The paper shows the genesis and the historical development of the three disciplines and also their meeting in a coalition in the 1990s.
Search for supersymmetry in events with large missing transverse momentum, jets, and at least one tau lepton in 7 TeV proton-proton collision data wi…
2012
A search for supersymmetry (SUSY) in events with large missing transverse momentum, jets, and at least one hadronically decaying τ lepton, with zero or one additional light lepton (e/μ), has been performed using 4.7 fb[superscript −1] of proton-proton collision data at √s = 7 TeV recorded with the ATLAS detector at the Large Hadron Collider. No excess above the Standard Model background expectation is observed and a 95 % confidence level visible cross-sectionupper limit for new phenomena is set. In the framework of gauge-mediated SUSY-breaking models, lower limits on the mass scale Λ are set at 54 TeV in the regions where the [bar over τ]1 is the next-to-lightest SUSY particle (tanβ > 20). …
MECHANISM DESIGN FOR OPTIMAL CONSENSUS PROBLEMS
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed and switching topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.We show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal proto…
Topologies réseau pour la réduction des coûts et l'amélioration de la qualité du service dans les centres de données massives
2017
Data centers (DC) are being built around the world to provide various cloud computing services. One of the fundamental challenges of existing DC is to design a network that interconnects massive number of nodes (servers)1 while reducing DC' cost and energy consumption. Several solutions have been proposed (e.g. FatTree, DCell and BCube), but they either scale too fast (i.e., double exponentially) or too slow. Effcient DC topologies should incorporate high scalability, low latency, low Average Path Length (APL), high Aggregated Bottleneck Throughput (ABT) and low cost and energy consumption. Therefore, in this dissertation, different solutions have been proposed to overcome these problems. F…
Breedbot: An Edutainment Robotics System to Link Digital and Real World
2007
The paper describes Breedbot an edutainment software and hardware system that could be used to evolve autonomous agents in digital (software) world and to transfer the evolved minds in physical agents (robots). The system is based on a wide variety of Artificial Life techniques (Artificial Neural Networks, Genetic Algorithms, User Guided Evolutionary Design and Evolutionary Robotics). An user without any computer programming skill can determine the robot behaviour. Breedbot was used as a didactic tool in teaching Evolutionary Biology and as a futuristic toy by several Science Centers. The digital side of Breedbot is downloadable from www.isl.unina.it/breedbot.
Data from: Empirical and theoretical study of Atelostomate (Echinoidea, Echinodermata) plate architecture: using graph analysis to reveal structural …
2015
Describing patterns of connectivity among organs is essential for identifying anatomical homologies among taxa. It is also critical for revealing morphogenetic processes and the associated constraints that control the morphological diversification of clades. This is particularly relevant for studies of organisms with skeletons made of discrete elements such as arthropods, vertebrates, and echinoderms. Nonetheless, relatively few studies devoted to morphological disparity have considered connectivity patterns as a level of morphological organization or developed comparative frameworks with proper tools. Here, we analyze connectivity patterns among apical plates in Atelostomata, the most dive…
The Abelian Kernel of an Inverse Semigroup
2020
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel. Steinberg extended the result for any variety of abelian groups with decidable membership. In this paper, we used a completely different approach to complete these results by giving an exact description of the abelian kernel of an inverse semigroup. An abelian group that gives this abelian kernel was also constructed.