Publication

Succinct ordering and aggregation constraints in algebraic array theories

Publications associées (28)

Transformations silencieuses : étude sur l'architecture alpine

This thesis addresses the question of abandonment in architecture, not in its negative sense of desertion, but as a possibility offered to buildings which have lost their original purpose, which is to say those buildings from social and economic contexts w ...

EPFL2021

Virtual reality to assess visual attraction and perceived interest to daylit scene variations

Marilyne Andersen, Kynthia Chamilothori, Bahar Aydemir, Caroline Karmann

Façades and light pattern composition have been shown to influence the spatial experience and physiological responses of humans [1,2]. The present study examines the effect of sunlight penetration and window size on fixations to the floor of the scene, and ...

2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

ASSOC COMPUTING MACHINERY2021

JET ILA full array and polychromatic operation

Paulo Giovane Paschoali Pereira Puglia

The JET ILA is an Ion Cyclotron Resonance Heating (ICRH) antenna composed of four resonant double loops (RDLs) arranged in a 2 toroidal by 2 poloidal compact array. It has been operated in a range of frequencies from 29 to 51 MHz, but mostly on half array. ...

2021

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Yu Bai, Zhengwen Jiang, Jie Li, Yihe Zhao, Zichen Liu

A capacitive micromachined ultrasonic transducers (CMUTs) array with dual-mixed radii is designed to improve bandwidth and realize multi-modes operating for immersed ultrasonic applications. The two-size (TS) CMUT array is composed of two sub-arrays with d ...

IEEE2021

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Halo Mass-concentration Relation at the High-mass End

Jean-Paul Richard Kneib, Huanyuan Shan, Ginevra Favole

The concentration-mass (c-M) relation encodes key information about the assembly history of dark matter halos. However, its behavior at the high mass end has not been measured precisely in observations yet. In this paper, we report the measurement of the h ...

IOP Publishing Ltd2021

Tree in Tree: from Decision trees to Decision Graphs

Mahsa Shoaran, Bingzhao Zhu

Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional dec ...

Curran Associates, Inc, (NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems)2021