Search results for " computing"
showing 10 items of 2075 documents
Boolean computation in plants using post-translational genetic control and a visual output signal
2018
[EN] Due to autotrophic growing capacity and extremely rich secondary metabolism, plants should be preferred targets of synthetic biology. However, developments in plants usually run below those in other taxonomic groups. In this work we engineered genetic circuits capable of logic YES, OR and AND Boolean computation in plant tissues with a visual output signal. The circuits, which are deployed by means of Agrobacterium tumefaciens, perform with the conditional activity of the MYB transcription factor Roseal from Antirrhinum majus inducing the accumulation of anthocyanins, plant endogenous pigments that are directly visible to the naked eye or accurately quantifiable by spectrophotometric a…
Coupling agent-based with equation-based models to study spatially explicit megapopulation dynamics
2018
International audience; The incorporation of the spatial heterogeneity of real landscapes into population dynamics remains extremely difficult. We propose combining equation-based modelling (EBM) and agent-based modelling (ABM) to overcome the difficulties classically encountered. ABM facilitates the description of entities that act according to specific rules evolving on various scales. However, a large number of entities may lead to computational difficulties (e.g., for populations of small mammals, such as voles, that can exceed millions of individuals). Here, EBM handles age-structured population growth, and ABM represents the spreading of voles on large scales. Simulations applied to t…
CRISPR-mediated strand displacement logic circuits with toehold-free DNA
2021
DNA nanotechnology, and DNA computing in particular, has grown extensively over the past decade to end with a variety of functional stable structures and dynamic circuits. However, the use as designer elements of regular DNA pieces, perfectly complementary double strands, has remained elusive. Here, we report the exploitation of CRISPR-Cas systems to engineer logic circuits based on isothermal strand displacement that perform with toehold-free double-stranded DNA. We designed and implemented molecular converters for signal detection and amplification, showing good interoperability between enzymatic and nonenzymatic processes. Overall, these results contribute to enlarge the repertoire of su…
Communication cost of channel estimation interpolation for group-based vehicular communications in cellular networks
2020
Las comunicaciones inalámbricas para aplicaciones vehiculares en sistemas celulares de quinta generación (5G) deben ser de baja latencia y alta fiabilidad. Entre otros factores, la cantidad de información de control que debe intercambiarse entre cada vehículo y la estación base puede penalizar la latencia de la comunicación. Varios casos de uso vehicular 5G implican comunicaciones dentro de grupos de vehículos, por ejemplo el pelotón de vehículos. Este trabajo se centra en explotar la estructura y características de este servicio vehicular particular basado en grupos para disminuir el intercambio de información de control relacionado con la etapa de estimación del canal necesaria para las c…
Peer-to-peer cooperative GNSS-based localization for stationary reference nodes in wireless sensor networks
2017
Most localization algorithms in wireless sensor networks rely on a few reference nodes with known locations to estimate the locations of unknown nodes. The locations of reference nodes can be either manually configured or, more practically, obtained by means of some satellite-based positioning system(s). However, satellite-based locations may be inaccurate and imprecise, which results in reduced location accuracy of localization algorithms. This paper proposes a peer-to-peer cooperative GNSS-based localization algorithm for stationary reference nodes to improve their relative location accuracy and precision. The algorithm applies simple statistical methods and GNSS-based information from mu…
Efficient Parallel Sort on AVX-512-Based Multi-Core and Many-Core Architectures
2019
Sorting kernels are a fundamental part of numerous applications. The performance of sorting implementations is usually limited by a variety of factors such as computing power, memory bandwidth, and branch mispredictions. In this paper we propose an efficient hybrid sorting method which takes advantage of wide vector registers and the high bandwidth memory of modern AVX-512-based multi-core and many-core processors. Our approach employs a combination of vectorized bitonic sorting and load-balanced multi-threaded merging. Thread-level and data-level parallelism are used to exploit both compute power and memory bandwidth. Our single-threaded implementation is ~30x faster than qsort in the C st…
Regulating blockchain for sustainability? The critical relationship between digital innovation, regulation, and electricity governance
2021
Abstract Blockchain technology has found several innovative applications in the electricity industry. However, its potential has still to be discovered. This is partly due to the role that regulation plays in electricity markets. To be introduced, experimented with, and eventually adopted on a commercial scale, blockchain-supported innovations need to fit the existing regulatory framework or the rules to be reshaped or updated. We focus on energy regulators' possible responses to the blockchain-enhanced market operations (both from the incumbents and potential newcomers), suggesting a monitoring mechanism that can support innovation.
Online Scheduling of Task Graphs on Hybrid Platforms
2018
Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous \(4\sqrt{m/k}\)-competitive online algorithm [2], where m is the number of CPUs and k the number of GPUs (\(m\ge k\)). We prove that no online algorithm can have a competitive ratio …
Hybrid P2P schemes for remote terrain interactive visualization systems
2013
Over the last few years, there has been a lot of development of interactive terrain visualization applications using remote databases. One of the main problems that these applications must face is scalability. These applications usually use a client-server model that cannot support a large number of concurrent requests without using a considerable number of servers. In this paper, we present a full comparative study of new hybrid P2P schemes for terrain interactive visualization systems. The performance evaluation results show that the best strategy consists of avoiding the periodical reporting among peer nodes about the current information contained in each node, while using some servers a…
Massively Parallel ANS Decoding on GPUs
2019
In recent years, graphics processors have enabled significant advances in the fields of big data and streamed deep learning. In order to keep control of rapidly growing amounts of data and to achieve sufficient throughput rates, compression features are a key part of many applications including popular deep learning pipelines. However, as most of the respective APIs rely on CPU-based preprocessing for decoding, data decompression frequently becomes a bottleneck in accelerated compute systems. This establishes the need for efficient GPU-based solutions for decompression. Asymmetric numeral systems (ANS) represent a modern approach to entropy coding, combining superior compression results wit…