Concept

Grammaire non contextuelle

Publications associées (127)

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Fengyun Liu, Sandro Stucki, Olivier Eric Paul Blanvillain

Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala ...

2017

Design considerations for implantable and wearable antennas

Anja Skrivervik

This contribution gives a review of our results characterizing the propagation in lossy biological tissues. These results were mainly obtained using a simplified spherical model allowing a description in spherical wave decomposition. This model is of cours ...

IEEE2017

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Synthesis and Reactivity of 1-Allenyltriazenes

Rosario Scopelliti, Kay Severin, Farzaneh Fadaei Tirani, Loïc Nicolas Jeanbourquin

1-Aryl-3,3-dialkyltriazenes have received considerable attention in the context of synthetic and medicinal chemistry. In contrast, the chemistry of other unsaturated triazenes is largely unexplored. The synthesis of 1-allenyltriazenes is described. This ne ...

American Chemical Society2017

Families with no s pairwise disjoint sets

Andrei Kupavskii

For integers n >= s >= 2 let e (n, s) denote the maximum of vertical bar F vertical bar, where F is a family of subsets of an n- element set and F contains no s pairwise disjoint members. Half a century ago, solving a conjecture of Erd. os, Kleitman determ ...

Wiley2017

Disruption mitigation by injection of small quantities of noble gas in ASDEX Upgrade

Basil Duval, Emiliano Fable, Bernhard Sieglin, Gergely Papp

The most recent experiments of disruption mitigation by massive gas injection in ASDEX Upgrade have concentrated on small-relatively to the past-quantities of noble gas injected, and on the search for the minimum amount of gas necessary for the mitigation ...

Iop Publishing Ltd2017

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Michael Christoph Gastpar, Saeid Sahraei

A particular instance of the shortest vector problem (SVP) appears in the context of compute-and-forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order O(nψlog(nψ)) , where ψ=sqrt(P ||h||^2+1) ...

Institute of Electrical and Electronics Engineers2017

Caradoc: a pragmatic approach to PDF parsing and validation

PDF has become a de facto standard for exchanging electronic documents, for visualization as well as for printing. However, it has also become a common delivery channel for malware, and previous work has highlighted features that lead to security issues. I ...

Ieee2016

SLA: to Sign or Not to Sign

Gil Regev, Alain Wegmann, Gorica Tapandjieva Sekulovska

We present our experience of a three-week fieldwork in the form of a contextual inquiry with a service manager at the EPFL IT department. During these three weeks, we encounter a refusal of a user committee to sign a service-level agreement (SLA). We descr ...

CEUR Workshop Proceedings2016

Aggregation of Power Capabilities of Heterogeneous Resources for Real-Time Control of Power Grids

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Wajeb Saab, Andrey Bernstein

Aggregation of electric resources is a fundamental function for the operation of power grids at different time scales. In the context of a recently proposed framework for the real-time control of microgrids with explicit power setpoints, we define and form ...

Università degli Studi di Genova, Italy2016

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