Search results for "D algorithm"

Biological Peer-To-Peer Networks: From Bacterial Communication To The Development Of Synthetic Distributed Systems

2014

We address Bacterial Computing from the study of bacterial communication mechanisms, by assuming a conceptual framework between Computer Science and Biology in which cells are conceived as nodes. This nodes process information through modules formed of DNA as encoded software (biobricks) and are connected to other nodes. In order to understand how peerto-peer mechanisms operate in bacteria, we have studied Quorum sensing and Conjugation with an engineering perspective. Learning how cells process and exchange information we try to glimpse new theoretical approaches to develop synthetic networks and to transfer complex algorithms to natural environments. Extending bacterial communications we …

Computing abelian periods in words

2011

International audience

Simulazione numerica tridimensionale del campi de moto indotti dal vento

2006

Nell’articolo viene proposto un modello numerico tridimensionale al volume finiti, che viene utilizzato per la simulazione di campi di moto indotti dal mento in corpi idrici con batimetria complessa. I risultati numerici sono confrontati con misure sperimentali. Al fine di verificare gli effetti sul calcolo del campi idrodinamici di alcume ipotesi simplificative, relative alla distribuzione verticale della pressione e degli sforzi di Reynolds, sono stati quindi condotti alcuni test numerici, dai quali si è evidenziato che l’ipotesi di distribuzione idrostatica delle pressioni, cui si fa ricorso nelle approssinazioni di tipo “quasi-3D”, può essere utilizzata per il carcolo del profili vertic…

Sequential Mining Classification

2017

Sequential pattern mining is a data mining technique that aims to extract and analyze frequent subsequences from sequences of events or items with time constraint. Sequence data mining was introduced in 1995 with the well-known Apriori algorithm. The algorithm studied the transactions through time, in order to extract frequent patterns from the sequences of products related to a customer. Later, this technique became useful in many applications: DNA researches, medical diagnosis and prevention, telecommunications, etc. GSP, SPAM, SPADE, PrefixSPan and other advanced algorithms followed. View the evolution of data mining techniques based on sequential data, this paper discusses the multiple …

A Bacterial-Based Algorithm to Simulate Complex Adaptative Systems

2014

Paper presented at the 13th International Conference on Simulation of Adaptive Behavior which took place at Castellón, Spain in 2014, July 22-25. Bacteria have demonstrated an amazing capacity to overcome envi-ronmental changes by collective adaptation through genetic exchanges. Using a distributed communication system and sharing individual strategies, bacteria propagate mutations as innovations that allow them to survive in different envi-ronments. In this paper we present an agent-based model which is inspired by bacterial conjugation of DNA plasmids. In our approach, agents with bounded rationality interact in a common environment guided by local rules, leading to Complex Adaptive Syste…

Efficient distributed average consensus in wireless sensor networks

2020

International audience; Computing the distributed average consensus in Wireless Sensor Networks (WSNs) is investigated in this article. This problem, which is both natural and important, plays a significant role in various application fields such as mobile agents and fleet vehicle coordination, network synchronization, distributed voting and decision, load balancing of divisible loads in distributed computing network systems, and so on. By and large, the average consensus' objective is to have all nodes in the network converged to the average value of the initial nodes' measurements based only on local nodes' information states. In this paper, we introduce a fully distributed algorithm to a…

Bio-inspired security analysis for IoT scenarios

2020

Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however, the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graph analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…

The hybrid algorithm (Hbmr) to fight against blood doping in sports

2010

The expressive power of the shuffle product

2010

International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…

Fast Matrix Multiplication

2015

Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time O(n2.3755). Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le~Gall has led to an improved algorithm running in time O(n2.3729). These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time O(n2.3725), and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078}); in particular, this approach cannot prove the conjecture that for every e > 0, …