Publications associées à Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Publications associées (35)

Numerical simulation of a helium plasma-material interaction experiment in GyM linear device through SOLPS-ITER and ERO2.0 codes

In this paper, a numerical investigation of plasma-material interaction-relevant helium plasma experimental discharges in GyM linear device is presented, in which SOLPS-ITER and ERO2.0 codes are coupled for plasma background generation and material erosion ...

IOP Publishing Ltd2025

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Yingying Ren

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Ensemble learning and ground-truth validation of synaptic connectivity inferred from spike trains

Guillaume Romain Obozinski

Probing the architecture of neuronal circuits and the principles that underlie their functional organization remains an important challenge of modern neurosciences. This holds true, in particular, for the inference of neuronal connectivity from large-scale ...

San Francisco2024

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

Alexander Carl Unnervik

The field of biometrics, and especially face recognition, has seen a wide-spread adoption the last few years, from access control on personal devices such as phones and laptops, to automated border controls such as in airports. The stakes are increasingly ...

EPFL2024

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

arXiv2023

Bayesian reconstruction of memories stored in neural networks from their connectivity

Lenka Zdeborová, Florent Gérard Krzakala

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

2023

Hardware Implementation of Digital Signal Processing Algorithms for Programmable Epilepsy Control Systems

Keyvan Farhang Razi

Epilepsy is a common chronic neurological disorder that causes recurring seizures and affects more than 50 million people worldwide. Implantable medical devices (IMDs) are regarded as effective tools to cure patients who suffer from refractory epilepsy. Se ...

EPFL2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Fast correlation function calculator A high-performance pair-counting toolkit

Cheng Zhao

Context. A novel high-performance exact pair-counting toolkit called fast correlation function calculator (FCFC) is presented.Aims. With the rapid growth of modern cosmological datasets, the evaluation of correlation functions with observational and simula ...

EDP SCIENCES S A2023

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

Assoc Computing Machinery2023

Image scanning microscopy with a doughnut beam: signal strength and integrated intensity

Giorgio Tortarolo

We discuss the effects of image scanning microscopy using doughnut beam illumination on the properties of signal strength and integrated intensity. Doughnut beam illumination can give better optical sectioning and background rejection than Airy disk illumi ...

Optica Publishing Group2023

Use of high frequency electrorotation to identify cytoplasmic changes in cells non-disruptively

Kevin Theodric Uning

In this paper we demonstrate how the use of frequencies ranging from 50 kHz to 5 GHz in the analysis of cells by electrorotation can open the path to the identification of differences not detectable by conventional set-ups. Earlier works usually reported e ...

2023

From Nano to Macro An overview of the IEEE Bio Image and Signal Processing Technical Committee

Michaël Unser, Dimitri Nestor Alice Van De Ville, Michael Stefan Daniel Liebling

The Bio Image and Signal Processing (BISP) Technical Committee (TC) of the IEEE Signal Processing Society (SPS) promotes activities within the broad technical field of biomedical image and signal processing. Areas of interest include medical and biological ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Fabrication and characterization of NbTi microwave superconducting resonators

Jürgen Brugger, Giovanni Boero, Nergiz Sahin Solmaz, Reza Farsi, Hernán Furci, Roberto Russo, André Chatel

Superconducting resonators are widely used in fields spanning from quantum computing to electron spin resonance (ESR) spectroscopy. With the goal of realizing superconducting resonators, a broad variety and combination of superconducting materials, substra ...

ELSEVIER2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Mahmoud S. M. Shaqfa

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

EPFL2022

Assessing real-world gait with digital technology? Validation, insights and recommendations from the Mobilise-D consortium

Kamiar Aminian, Anisoara Ionescu, Abolfazl Soltani

Background: Although digital mobility outcomes (DMOs) can be readily calculated from real-world data collected with wearable devices and ad-hoc algorithms, technical validation is still required. The aim of this paper is to comparatively assess and validat ...

BioMed Central2023

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Seyed Jalal Etesami, Sina Akbari

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022