Catégorie

Logique mathématique

Publications associées (29)

Succinct ordering and aggregation constraints in algebraic array theories

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

Experimental and ab initio derivation of interface stress in nanomultilayered coatings: Application to immiscible Cu/W system with variable in-plane stress

Claudia Cancellieri, Pandula Manura Liyanage

Interface stress is a fundamental descriptor for interphase boundaries and is defined in strict relation to the interface energy. In nanomultilayers with their intrinsically high interface density, the functional properties are dictated by the interface st ...

Elsevier2024

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Robert Dalang, Fei Pu

We study the hitting probabilities of the solution to a system of d stochastic heat equations with additive noise subject to Dirichlet boundary conditions. We show that for any bounded Borel set with positive (d-6)\documentclass[12pt]{minimal} \usepackage{ ...

Springer/Plenum Publishers2024

Dynamical system approach to navigation around obstacles

Aude Billard, Aradhana Nayak

In this article, we propose a dynamical system to avoid obstacles which are star shaped and simultaneously converge to a goal. The convergence is almost-global in a domain and the stationary points are identified explicitly. Our approach is based on the id ...

2024

Scalable Logic Rewriting Using Don’t Cares

Giovanni De Micheli, Alessandro Tempia Calvino

Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...

2024

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Rom Pinchasi

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Electronic Journal Of Combinatorics2024

Reliable data-driven decision-making through optimal transport

Bahar Taskesen

Decision-making permeates every aspect of human and societal development, from individuals' daily choices to the complex decisions made by communities and institutions. Central to effective decision-making is the discipline of optimization, which seeks th ...

EPFL2024

Reducing uncertainties in response predictions of earthquake-damaged masonry buildings using data from image-based inspection

Ian Smith, Katrin Beyer, Bryan German Pantoja Rosero, Mathias Christian Haindl Carvallo

Image information about the state of a building after an earthquake, which can be collected without endangering the post-earthquake reconnaissance activities, can be used to reduce uncertainties in response predictions for future seismic events. This paper ...

Springer2024

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

Additive and geometric transversality of fractal sets in the integers

Florian Karl Richter

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In this work, we in ...

2024

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

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

IEEE2024

MaskCLR: Attention-Guided Contrastive Learning for Robust Action Representation Learning

Alexandre Massoud Alahi, Mohamed Ossama Ahmed Abdelfattah, Mariam Ahmed Mahmoud Hegazy Hassan

Current transformer-based skeletal action recognition models tend to focus on a limited set of joints and low-level motion patterns to predict action classes. This results in significant performance degradation under small skeleton perturbations or changin ...

2024

Pivot, process for manufacturing such a pivot, oscillator comprising such a pivot, watch movement and timepiece comprising such an oscillator

Simon Nessim Henein, Loïc Benoît Tissot-Daguette

The present invention concerns a pivot comprising two assemblies, namely a central assembly (401) and a peripheral assembly (400). These two assemblies are mobile in rotation relative to each other around an axis of rotation (A). The pivot is characterized ...

2024

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Shafranov shift correction to the Furth-Yoshikawa scaling of tokamak adiabatic compression

Olivier Sauter

In 1970, Furth and Yoshikawa (1970 Phys. Fluids 13 2593-6) introduced the scalings of adiabatic plasma compression. Basically, if the shape of the external plasma boundary and the aspect ratio are preserved during the compression, then the density, kinetic ...

2023

Thick points of the planar GFF are totally disconnected for all & gamma;=6 0*

Juhan Aru

We prove that the set of-y-thick points of a planar Gaussian free field (GFF) with Dirichlet boundary conditions is a.s. totally disconnected for all-y =6 0. Our proof relies on the coupling between a GFF and the nested CLE4. In particular, we show that th ...

INST MATHEMATICAL STATISTICS-IMS2023

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Pascal Fua

3D reconstruction of deformable (or non-rigid) scenes from a set of monocular 2D image observations is a long-standing and actively researched area of computer vision and graphics. It is an ill-posed inverse problem, since-without additional prior assumpti ...

WILEY2023

Present design of the Steering Mirror Assembly (SMA) for ITER ECHUL

Timothy Goodman, René Chavan, Anastasia Xydou

In the ITER Tokamak, four Electron Cyclotron Heating Upper Launchers (ECHUL) are needed to control plasma instabilities at the rational surfaces, most importantly the q = 3/2 and q = 2/1 neoclassical tearing modes (NTMs). Each ECHUL is equipped with a set ...

2023

LISA – A Modern Proof System

Viktor Kuncak, Simon Guilloud, Sankalp Gambhir

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...

Dagstuhl, Germany, Schloss Dagstuhl - Leibniz-Zentrum fur Informatik2023