Publications related to A refined estimate for the topological degree

Related publications (31)

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

The Two Times Problem: Where Is the Problem?

Michael Herzog

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Brill2024

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

Graphical solutions to one-phase free boundary problems

Xavier Fernandez-Real Girona

We study viscosity solutions to the classical one-phase problem and its thin counterpart. In low dimensions, we show that when the free boundary is the graph of a continuous function, the solution is the half-plane solution. This answers, in the salient di ...

Walter De Gruyter Gmbh2023

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Richard Lee Davis, Bertrand Roland Schneider

This study investigated the impact of participating in a year-long digital-fabrication course on high-school seniors' problem-solving skills, with a focus on problems involving mechanistic systems. The research questions centered on whether working in a ma ...

Springer2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Maryam Kamgarpour

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control pol ...

IEEE2023

Fredholm transformation on Laplacian and rapid stabilization for the heat equation

Shengquan Xiang

We study the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. This classical framework allows us to present the backstepping method with Fredholm transformations for the Lapla ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Single-Chain Nanoparticles for Intracellular Drug Delivery

Suiyang Liao

Single-chain nanoparticles (SCNPs) are a type of polymeric nanoparticles formed by collapsing/folding individual polymer chains via intra-molecular interactions. Their emergence holds promise to construct sub-20 nm polymeric nanoparticles with defined stru ...

EPFL2022

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

EPFL2022

Removing Algorithmic Discrimination (With Minimal Individual Error)

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Le Nguyen Hoang

We address for the first time the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analy ...

2022

Rapid Scalable Distributed Power Flow with Open-Source Implementation

Yuning Jiang

This paper introduces a new method for solving the distributed AC power flow (PF) problem by further exploiting the problem formulation. We propose a new variant of the ALADIN algorithm devised specifically for this type of problem. This new variant is cha ...

ELSEVIER2022

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Probabilistic and temporal failure detectors for solving distributed problems

Rachid Guerraoui

Failure detectors (FD)s are celebrated for their modularity in solving distributed problems. Algorithms are constructed using FD building blocks. Synchrony assumptions to implement FDs are studied separately and are typically expressed as eventual guarante ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Critical review of standards for indoor thermal environment and air quality

Dolaana Khovalyg

Quality of the indoor environment has become an important parameter to account for in new and existing buildings due to the increasing number of people spending most of their time indoors. Generally, the design and evaluation of indoor environments in buil ...

2020

Crack front waves: A 3D dynamic response to a local perturbation of tensile and shear cracks

Jean-François Molinari, Fabian Barras, Damien Spielmann

Crack front waves are long-lived perturbations propagating along the crack front. They are triggered by heterogeneities on the crack plane, as for instance tough asperities, which disturb the crack front shape. Crack front waves are thought to leave a trac ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Waste collection inventory routing with non-stationary stochastic demands

Michel Bierlaire, Mohammad Yousef Maknoon, Sacha Varone, Iliya Dimitrov Markov

We solve a rich routing problem inspired from practice, in which a heterogeneous fixed fleet is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor that communicates its level ...

PERGAMON-ELSEVIER SCIENCE LTD2020