Publications related to Union (set theory)

Correspondence functors and duality

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, Francesco Iberite, Federica Barberi, Eugenio Anselmino

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

On Approximations of Data-Driven Chance Constrained Programs over Wasserstein Balls

Daniel Kuhn, Zhi Chen, Wolfram Wiesemann

Distributionally robust chance constrained programs minimize a deterministic cost function subject to the satisfaction of one or more safety conditions with high probability, given that the probability distribution of the uncertain problem parameters affec ...

2023

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

NP Satisfiability for Arrays as Powers

Viktor Kuncak, Rodrigo Raya

We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is inNP. As an application, we extend the combinatory array logic fragmentto handle cardinality constraints. The resulting fragme ...

Springer, Cham2022

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2023

Positive moments for scattering amplitudes

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

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, Paul Scharnhorst, Emilio Maddalena

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

A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle

Daniel Kuhn, Jianzhe Zhen, Wolfram Wiesemann

Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from within an ambigu ...

2023

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

An Ink–and–Paper Automaton: The Conceptual Mechanization of Cognition and the Practical Automation of Reasoning in Leibniz’s De Affectibus (1679)

Simon François Dumas Primbault

On ten loose handwritten folios dating back from April 1679, Leibniz gradually devised, in the course of three days, a full-blown theory of thought that nonetheless remained unpublished and still has received little attention from scholars. Conceiving of a ...

2020

Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms

Daniel Kuhn

In distributionally robust optimization the probability distribution of the uncertain problem parameters is itself uncertain, and a fictitious adversary, e.g., nature, chooses the worst distribution from within a known ambiguity set. A common shortcoming o ...

2020

Distributionally Robust Mechanism Design

Daniel Kuhn, Cagil Kocyigit, Wolfram Wiesemann

We study a mechanism design problem where an indivisible good is auctioned to multiple bidders, for each of whom it has a private value that is unknown to the seller and the other bidders. The agents perceive the ensemble of all bidder values as a random v ...

2020

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

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

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Andres Jacinto Ruiz Vargas

We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...

ELSEVIER SCIENCE BV2019

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

Design of Load-Bearing Systems for Open-Ended Downstream Reuse

Corentin Jean Dominique Fivet

This paper discusses the design of load-bearing systems for buildings with regard to their current lack of open-ended reusability. The reason for dismantling load-bearing systems today tends to be less related to material degradation than to a loss of func ...

2019

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