Publication

Computation and visualization of ideal knot shapes

Publications associées (31)

Privatized graph federated learning

Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-m ...

SPRINGER2023

Bounded and unbounded cohomology of homeomorphism and diffeomorphism groups

Nicolas Monod

We determine the bounded cohomology of the group of homeomorphisms of certain low-dimensional manifolds. In particular, for the group of orientation-preserving homeomorphisms of the circle and of the closed 2-disc, it is isomorphic to the polynomial ring g ...

SPRINGER HEIDELBERG2023

An optimal preconditioned FFT-accelerated finite element solver for homogenization

Till Junge, Ali Falsafi, Martin Ladecký

We generalize and provide a linear algebra-based perspective on a finite element (FE) ho-mogenization scheme, pioneered by Schneider et al. (2017)[1] and Leuschner and Fritzen (2018)[2]. The efficiency of the scheme is based on a preconditioned, well-scale ...

ELSEVIER SCIENCE INC2023

Better Trees for Santa Claus

Etienne Michel François Bamas, Lars Rohwedder

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Assoc Computing Machinery2023

Validation of GBS plasma turbulence simulation of the TJ-K stellarator

Joaquim Loizu Cisquella, Paolo Ricci

We present a validation of a three-dimensional, two-fluid simulation of plasma turbulence in the TJ-K stellarator, a low temperature plasma experiment ideally suited for turbulence measurements. The simulation is carried out by the GBS code, recently adapt ...

IOP Publishing Ltd2023

Snap buckling of bistable beams under combined mechanical and magnetic loading

Pedro Miguel Nunes Pereira de Almeida Reis, Dong Yan, Tomohiko Sano, Arefeh Abbasi

We investigate the mechanics of bistable, hard-magnetic, elastic beams, combining experiments, finite-element modelling (FEM) and a reduced-order theory. The beam is made of a hard magneto-rheological elastomer, comprising two segments with antiparallel ma ...

ROYAL SOC2023

Acceleration of graph pattern mining and applications to financial crime

Jovan Blanusa

Various forms of real-world data, such as social, financial, and biological networks, can be represented using graphs. An efficient method of analysing this type of data is to extract subgraph patterns, such as cliques, cycles, and motifs, from graphs. For ...

EPFL2023

A combined genetic algorithm and active learning approach to build and test surrogate models in Process Systems Engineering

François Maréchal, Julia Granacher

In Process Systems Engineering, computationally-demanding models are frequent and plentiful. Handling such complexity in an optimization framework in a fast and reliable way is essential, not only for generating meaningful solutions but also for providing ...

Pergamon-Elsevier Science Ltd2023

The Claude Debussy Solo Piano Corpus

Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Ludovica Schaerf, Sabrina Laneve

This dataset originates from the DCML corpus initiative and contains musicological research data. For more information, please refer to its documentation page https://dcmlab.github.io/debussy_piano Please cite this dataset as Laneve, S., Schaerf ...

Zenodo2023

The diachronic development of Debussy’s musical style: a corpus study with Discrete Fourier Transform

Martin Alois Rohrmeier, Johannes Hentschel, Gabriele Cecchetti, Ludovica Schaerf, Sabrina Laneve

Claude Debussy’s personal style is typically characterised as a departure from earlier diatonic tonality, including a greater variety of pitch-class materials organised in fragmented yet coherent compositions. Exploiting the music-theoretical interpretabil ...

2023

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