Publications related to Succinct ordering and aggregation constraints in algebraic array theories

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

Pandula Manura Liyanage, Claudia Cancellieri, Giacomo Lorenzin

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

Orthologic with Axioms

Viktor Kuncak, Simon Guilloud

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polyno ...

Association for Computing Machinery2024

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

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

Wiley-Hindawi2023

Light-Driven Thermo-Optical Effects in Nanoresonator Arrays

Giulia Tagliabue, Ershad Mohammadi, Alfredo Angelo Luigi Naef, Theodoros Tsoulos

Thermonanophotonics, that is the study of photothermal effects in optical nanoantennas, has recently attracted growing interest. In particular, going beyond thermoplasmonic designs, thermo-optical modulation of dielectric nanoantennas opens new opportuniti ...

WILEY-V C H VERLAG GMBH2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

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

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Maryam Kamgarpour, Tony Alan Wood

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seyed Mohammadhossein Tabatabaee

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023