Search results for "Cluster computing"
showing 10 items of 120 documents
Simulation-based estimation of branching models for LTR retrotransposons
2017
Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …
Cimo: An efficient 2-phases calculator of multimodal itineraries for real trans-territories based on a dynamic programming
2015
In this work we propose an exact solution for calculating multimodal itinerary. This solution is named Cimo (Calculateur d'Itineraires Multimodaux Ordonnes). Cimo is an exact optimal itineraries' calculator wherein itineraries are sorted, multimodal, and trans-territorial. The solution is based on a dynamic programming algorithm "cut", "price" and "share". This solution is multi-objectives and multi-constraints. Several versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity's gain : through theoretical calculus and benchmarks. In the first version of realistic problem, we propose a solution with itineraries calculated…
"Table 5" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 13…
2019
Expected signal yield and acceptance x efficiency, estimated background and observed number of events in data for the full range of simulated masses in the full-detector R-hadron search.
"Table 5" of "Search for heavy charged long-lived particles in the ATLAS detector in 31.6 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} = 13…
2019
Expected signal yield and acceptance x efficiency, estimated background and observed number of events in data for the full range of simulated masses in the full-detector R-hadron search.
"Table 20" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
3-jet rate for the Durham Algorithm.
A distributed real-time data prediction and adaptive sensing approach for wireless sensor networks
2018
International audience; Many approaches have been proposed in the literature to reduce energy consumption in Wireless Sensor Networks (WSNs). Influenced by the fact that radio communication and sensing are considered to be the most energy consuming activities in such networks. Most of these approaches focused on either reducing the number of collected data using adaptive sampling techniques or on reducing the number of data transmitted over the network using prediction models. In this article, we propose a novel prediction-based data reduction method. furthermore, we combine it with an adaptive sampling rate technique, allowing us to significantly decrease energy consumption and extend the …
Ancestral Reconstruction and Investigations of Genomic Recombination on some Pentapetalae Chloroplasts
2019
Abstract In this article, we propose a semi-automated method to rebuild genome ancestors of chloroplasts by taking into account gene duplication. Two methods have been used in order to achieve this work: a naked eye investigation using homemade scripts, whose results are considered as a basis of knowledge, and a dynamic programming based approach similar to Needleman-Wunsch. The latter fundamentally uses the Gestalt pattern matching method of sequence matcher to evaluate the occurrences probability of each gene in the last common ancestor of two given genomes. The two approaches have been applied on chloroplastic genomes from Apiales, Asterales, and Fabids orders, the latter belonging to Pe…
A Hardware and Secure Pseudorandom Generator for Constrained Devices
2018
Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…
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…
Construction of Disjoint Virtual Backbones for Wireless Sensor Networks
2020
A wireless sensor network is a wireless network of sensors aimed at monitoring physical events. It has ingratiated itself into almost all areas of human endeavors. Data dissemination in these networks is quite challenging and is generally accomplished by flooding. But flooding introduces broadcast storm problem due from implosion and overlap. To overcome this, topology management can prescribe a virtual backbone network to which routing is confined. In this paper we propose an algorithm that constructs multiple disjoint virtual backbone networks, using only nodes' locations. The disjointedness makes routing more robust and the network exploitation energy efficient. Simulations show our algo…