Concept

Mess dress uniform

Publications associées (34)

Investigations on Caesium Dispersion and Molybdenum Coating on SPIDER Components

SPIDER is the 100 keV full-size Negative Ion Source prototype of the ITER Neutral Beam Injector, operating at Consorzio RFX in Padova, Italy. The largest Negative Ion Source in the world, SPIDER generates an RF driven plasma from which Deuterium or Hydroge ...

MDPI2023

Spatio-temporal patterns of fluid-driven aseismic slip transients: implications to seismic swarms

Brice Tanguy Alphonse Lecampion, Alexis Alejandro Sáez Uribe

Seismic swarms are often interpreted to be driven by natural fluid pressurization in the Earth’s crust, when seismicity is observed to spread away from a common origin and follows approximately a square-root-of-time pattern of growth. On the other hand, a ...

EGU2022

Nonreciprocity in Uniform Time-Varying Materials Using Spatial Dispersion

Mohammad Sajjad Mirmoosa, Xiao Wang

Conventionally, nonreciprocity in time-varying systems is achieved by exploiting both temporal and spatial modulations. In this paper, we introduce a concept of magnetless bianisotropic time-modulated systems that support nonreciprocal wave propagation at ...

IEEE2020

Exploring Perovskite-Metal Nanoassemblies for Photocatalytic Applications

Seryio Saris

The development of sustainable, renewable and economic chemical processes lies in the centre of todayâs global energy challenge. Like in plants, artificial photosynthesis offers an auspicious solution in harvesting solar energy and storing it in chemical ...

EPFL2020

Impedance and Admittance Formulas for a Multistair Model of Transmission Towers

This article discusses formulas for the surge/ characteristic impedance of vertical conductors. Calculated results of the surge impedance are compared with measured results on vertical conductors and transmission towers. The accuracy of the available time- ...

2020

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

H0LiCOW XII. Lens mass model of WFI2033-4723 and blind measurement of its time-delay distance and H-0

Frédéric Courbin, Hung-Hsu Chan, Vivien François Bonvin

We present the lens mass model of the quadruply-imaged gravitationally lensed quasar WFI2033 - 4723, and perform a blind cosmographical analysis based on this system. Our analysis combines (1) time-delay measurements from 14 yr of data obtained by the COSm ...

OXFORD UNIV PRESS2020

Microfluidics of binary liquid mixtures with temperature-dependent miscibility

Esther Amstad, Stefan Guldin

Liquid-liquid microfluidic systems rely on the intricate control over the fluid properties of either miscible or immiscible mixtures. Herein, we report on the use of partially miscible binary liquid mixtures that lend their microfluidic properties from a h ...

ROYAL SOC CHEMISTRY2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

A SHARP view of H0LiCOW: H-0 from three time-delay gravitational lens systems with adaptive optics imaging

Frédéric Courbin, Martin Raoul Robert Millon, Hung-Hsu Chan, Vivien François Bonvin

We present the measurement of the Hubble constant, H-0, with three strong gravitational lens systems, We describe a blind analysis of both PG 1115+080 and 11E0435-1223 as well as an extension of our previous analysis of RXJ 1131-1231. For each lens, we com ...

OXFORD UNIV PRESS2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search