Publications associées à Tableau associatif

Overflow-free compute memories for edge AI acceleration

David Atienza Alonso, Giovanni Ansaloni, Alexandre Sébastien Julien Levisse, Marco Antonio Rios, Flavio Ponzina

Compute memories are memory arrays augmented with dedicated logic to support arithmetic. They support the efficient execution of data-centric computing patterns, such as those characterizing Artificial Intelligence (AI) algorithms. These architectures can ...

2023

Request, Coalesce, Serve, and Forget: Miss-Optimized Memory Systems for Bandwidth-Bound Cache-Unfriendly Applications on FPGAs

Paolo Ienne, Mikhail Asiatici

Applications such as large-scale sparse linear algebra and graph analytics are challenging to accelerate on FPGAs due to the short irregular memory accesses, resulting in low cache hit rates. Nonblocking caches reduce the bandwidth required by misses by re ...

ASSOC COMPUTING MACHINERY2022

JET ILA full array and polychromatic operation

Paulo Giovane Paschoali Pereira Puglia

The JET ILA is an Ion Cyclotron Resonance Heating (ICRH) antenna composed of four resonant double loops (RDLs) arranged in a 2 toroidal by 2 poloidal compact array. It has been operated in a range of frequencies from 29 to 51 MHz, but mostly on half array. ...

2021

Differential presentation of a single antimicrobial peptide is sufficient to identify LPS from distinct bacterial samples

Timothy Matthias Reichart

Rapid detection and identification of bacteria is important for human health, biodefense, and food safety. Small arrays of different antimicrobial peptides (AMPs) enable the identification of lipopolysaccharide (LPS) samples from a variety of bacterial spe ...

2019

Sparse Recovery of Strong Reflectors With an Application to Non-Destructive Evaluation

Jean-Philippe Thiran, Martin Vetterli, Dimitris Perdios, Eric Bezzam, Adrien Georges Jean Besson, Hanjie Pan

In this paper we show that it is sufficient to recover the locations of K strong reflectors within an insonified medium from three receive elements and 2K+1 samples per element. The proposed approach leverages advances in sampling signals with a finite rat ...

IEEE2018

Organoid arrays

Matthias Lütolf, Nathalie Brandenberg

The invention provides methods for producing arrays of organoids, the arrays thereof and uses of such arrays. ...

2018

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

Anastasia Ailamaki, Georgios Psaropoulos

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsiz ...

VLDB Endowment Inc.2017

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Rachid Guerraoui, Tudor Alexandru David

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and ...

ACM2016

Reaching millikelvin resolution in Raman distributed temperature sensing using image processing

Luc Thévenaz, Marcelo Alfonso Soto Hernandez

Image processing is proposed and experimentally demonstrated to improve the capabilities of Raman distributed optical fibre sensors. The here reported technique consists in stacking consecutive one-dimensional Raman Stokes and anti-Stokes traces in two-dim ...

Spie-Int Soc Optical Engineering2016

Dual Langmuir-probe array for 3D plasma studies in TORPEX

Ambrogio Fasoli, Ivo Furno, Fabio Avino, Rémy Jacquier, Marcelo Baquero Ruiz, Oulfa Chellaï, Fabian Manke

We have designed and installed a new Langmuir-probe (LP) array diagnostic to determine basic three-dimensional (3D) features of plasmas in TORPEX. The diagnostic consists of two identical LP arrays, placed on opposite sides of the apparatus, which provide ...

2016