Publications associées à Ordre partiel complet

The Completion Of Covariance Kernels

We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain Omega of a rectangular domain I x I to a covariance kernel on the entire domain I x I. For a broad class of domains Omega call ...

INST MATHEMATICAL STATISTICS-IMS2022

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

A simple proof for a forbidden subposet problem

Abhishek Methuku

The poset Y-k,Y-2 consists of k + 2 distinct elements x(1), x(2), ..., x(k), y(1), y(2), such that x(1)

ELECTRONIC JOURNAL OF COMBINATORICS2020

Complete coordination of robotic fiber positioners for massive spectroscopic surveys

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian

Robotic fiber positioners play a vital role in the generation of massive spectroscopic surveys. The more complete a positioners set is coordinated, the more information its corresponding spectrograph receives during an observation. The complete coordinatio ...

2019

Suitably graded THB-spline refinement and coarsening: Towards an adaptive isogeometric analysis of additive manufacturing processes

Rafael Vazquez Hernandez, Alessandro Reali

In the present work we introduce a complete set of algorithms to efficiently perform adaptive refinement and coarsening by exploiting truncated hierarchical B-splines (THB-splines) defined on suitably graded isogeometric meshes, that are called admissible ...

ELSEVIER SCIENCE SA2019

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Driving a BCI Wheelchair: A Patient Case Study

José del Rocio Millán Ruiz, Robert Leeb, Tom Edward Carlson, Guillaume Monnard

Our brain-actuated wheelchair uses shared control to couple the user input with the contextual information about the surroundings in order to perform natural manoeuvres both safely and efficiently. In this study, we investigate the feasibility of using our ...

2012

Validation of Visual Contracts for Services

Alain Wegmann, Lam Son Lê, José Diego de la Cruz Garcia

Visual modeling languages have specialized diagrams to represent behavior and concepts. This diagram specialization has drawbacks like the dif-ficulty to represent the effects of actions. We claim that visual contracts can de-scribe actions in a more compl ...

2006