Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Dedekind-infinite set

Related publications (26)

An objective skill assessment framework for microsurgical anastomosis based on ALI scores

Aude Billard, Kunpeng Yao, Soheil Gholami

IntroductionThe current assessment and standardization of microsurgical skills are subjective, posing challenges in reliable skill evaluation. We aim to address these limitations by developing a quantitative and objective framework for accurately assessing ...

Springer Wien2024

A Method of Moments Estimator for Interacting Particle Systems and their Mean Field Limit

Andrea Zanoni

We study the problem of learning unknown parameters in stochastic interacting particle systems with polynomial drift, interaction, and diffusion functions from the path of one single particle in the system. Our estimator is obtained by solving a linear sys ...

Siam Publications2024

Correspondence functors and duality

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Early decoding of walking tasks with minimal set of EMG channels

Silvestro Micera

Objective. Powered lower-limb prostheses relying on decoding motor intentions from non-invasive sensors, like electromyographic (EMG) signals, can significantly improve the quality of life of amputee subjects. However, the optimal combination of high decod ...

IOP Publishing Ltd2023

A convex set of robust D—stabilizing controllers using Cauchy's argument principle

Alireza Karimi, Philippe Louis Schuchert

A new approach is presented to obtain a convex set of robust D—stabilizing fixed structure controllers, relying on Cauchy's argument principle. A convex set of D—stabilizing controllers around an initial D—stabilizing controller for a multi-model set is re ...

Elsevier2022

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Pascal Frossard, Arun Venkitaraman

We propose an approach for estimating graph diffusion processes using annihilation filters from a finite set of observations of the diffusion process made at regular intervals. Our approach is based on the key observation that a graph diffusion process can ...

IEEE2022

Positive moments for scattering amplitudes

Riccardo Rattazzi, Francesco Riva, Brando Bellazzini, Marc Riembau Saperas

We find the complete set of conditions satisfied by the forward 2 -> 2 scattering amplitude in unitary and causal theories. These are based on an infinite set of energy dependent quantities (the arcs) which are dispersively expressed as moments of a positi ...

American Physical Society2021

Deterministic error bounds for kernel-based learning techniques under bounded noise

Colin Neil Jones, Emilio Maddalena, Paul Scharnhorst

We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to th ...

2021

Local invertibility and sensitivity of atomic structure-feature mappings

Michele Ceriotti, Sergey Pozdnyakov

Background: The increasingly common applications of machine-learning schemes to atomic-scale simulations have triggered efforts to better understand the mathematical properties of the mapping between the Cartesian coordinates of the atoms and the variety o ...

2021

Localization of Electromagnetic Interference Sources Using a Time-Reversal Cavity

Farhad Rachidi-Haeri, Marcos Rubinstein, Mohammad Azadifar, Amirhossein Mostajabi, Hamidreza Karami

In this article, we propose and implement a novel technique to locate electromagnetic interference (EMI) sources using the concept of time-reversal (TR) cavity. We show in an intuitive manner that reflections from the surfaces of a cavity can emulate an in ...

2021

The algebra of Boolean matrices, correspondence functors, and simplicity

Jacques Thévenaz, Serge Bouc

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...

2020

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

Graph-based regularization of inverse problems in imaging

Mattia Rossi

As of today, the extension of the human visual capabilities to machines remains both a cornerstone and an open challenge in the attempt to develop intelligent systems. On the one hand, the development of more and more sophisticated imaging devices, capable ...

EPFL2020

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...

ELSEVIER SCIENCE BV2019

Dynamic Optimization of Reaction Systems via Exact Parsimonious Input Parameterization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper discusses the use of parsimonious input parameterization for the dynamic optimization of reaction systems. This parameterization is able to represent the optimal inputs with only a few parameters. In the context of batch, semibatch, and continuo ...

AMER CHEMICAL SOC2019

Simple and projective correspondence functors

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence functors are projective. We also determine which simple ...

2021

On reducing the number of decision variables for dynamic optimization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper presents an input parameterization for dynamic optimization that allows reducing the number of decision variables compared to traditional direct methods. A small number of decision variables is likely to be beneficial for various applications su ...

2020

Continuity Of Multimarginal Optimal Transport With Repulsive Cost

Maria Colombo, Maria Carola Colombo, Federico Stra

We provide sharp conditions for the finiteness and the continuity of multimarginal optimal transport with repulsive cost, expressed in terms of a suitable concentration property of the measure. To achieve this result, we analyze the Kantorovich potentials ...

2019

Designing Gabor windows using convex optimization

Nathanaël Perraudin

Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l(2)-norm dual window, is widely used. This window function however, might lack desirable properties, e. g. good time-fre ...

ELSEVIER SCIENCE INC2018

Correspondence functors and finiteness conditions

Jacques Thévenaz, Serge Bouc

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018