Publications associées à Fichier de configuration

Dataset for the publication "Reversal of nanomagnets by propagating magnons in ferrimagnetic yttrium iron garnet enabling nonvolatile magnon memory"

Raw data associated to the manuscript ‘’Reversal of nanomagnets by propagating magnons in ferrimagnetic yttrium iron garnet enabling nonvolatile magnon memory‘’, Nature Communications (2023); doi: https://doi.org/10.1038/s41467-023-37078-8 Information abou ...

Zenodo2023

Dataset for manuscript: Rock anisotropy promotes hydraulic fracture containment at depth

Brice Tanguy Alphonse Lecampion, Seyyedmaalek Momeni, Carlo Peruzzo, Fatima-Ezzahra Moukhtari, Guanyi Lu

This is the experimental data used in manuscript: "Rock anisotropy promotes hydraulic fracture containment at depth". This data set has 5 folders: K1, T2, M3 and M4 contain the raw data collected by active acoustic monitoring system and various pumps and t ...

EPFL Infoscience2023

Spin wave dispersion of ultra-low damping hematite (α-Fe2O3) at GHz frequencies

Dirk Grundler, Mohammad Hamdi, Ferdinand Rémy Hynek Posva

Raw data associated to the manuscript ‘’Spin wave dispersion of ultra-low damping hematite (α-Fe2O3) at GHz frequencies‘’, Physical Review Materials 7, 054407(2023); doi: 10.1103/PhysRevMaterials.7.054407 Information about file fo ...

Zenodo2023

The DCU-EPFL Enhanced Dependency Parser at the IWPT 2021 Shared Task

James Henderson, Alireza Mohammadshahi

We describe the DCU-EPFL submission to the IWPT 2021 Parsing Shared Task: From Raw Text to Enhanced Universal Dependencies. The task involves parsing Enhanced UD graphs, which are an extension of the basic dependency trees designed to be more facilitative ...

ASSOC COMPUTATIONAL LINGUISTICS-ACL2021

Relaxed Wyner's Common Information

Michael Christoph Gastpar, Erixhen Sula

In the problem of coded caching for media delivery, two separate coding opportunities have been identified. The first opportunity is a multi-user advantage and crucially hinges on a public broadcast link in the delivery phase. This has been explored in a p ...

IEEE2019

Interactive Programming by Example

Mikaël Mayer

As of today, programming has never been so accessible. Yet, it remains a challenge for end-users: students, non-technical employees, experts in their domains outside of computer science, and so on. With its forecast potential for solving problems by only o ...

EPFL2017

Method for Generating an HTML Document that Contains Encrypted Files and the Code Necessary for Decrypting Them When a Valid Passphrase is Provided

Radhakrishna Achanta, Thomas Lochmatter

A computer implemented method for encrypting one or more files and wrapping them in an HTML document. The HTML document contains the encrypted files, the necessary code to decrypt the files, as well as user interface code to receive a passphrase input from ...

2015

Creep behaviour of sandwich panels with rigid polyurethane foam core and glass-fibre reinforced polymer faces: Experimental tests and analytical modelling

Thomas Keller, Mário Alexandre De Jesus Garrido

This paper presents experimental and analytical investigations about the creep behaviour of sandwich panels comprising glass-fibre reinforced polymer faces and rigid polyurethane foam core for civil engineering applications. A full-scale sandwich panel was ...

SAGE Publications2014

Quasi-static cyclic tests on masonry spandrels

Katrin Beyer, Alessandro Dazio

This paper presents the results of an experimental campaign on masonry spandrels. Within this campaign four masonry spandrels were subjected to quasi-static cyclic loading. Two different spandrel configurations were tested. The first configuration comprise ...

Earthquake Engineering Research Inst2012

Offline file assignments for online load balancing

Monika Henzinger, Ingmar Weber

We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for ...

2011