Concept

Langage rationnel

Publications associées (38)

Enhancing Procedural Writing Through Personalized Example Retrieval: A Case Study on Cooking Recipes

Antoine Bosselut, Jibril Albachir Frej, Paola Mejia Domenzain, Luca Mouchel, Tatjana Nazaretsky, Seyed Parsa Neshaei, Thiemo Wambsganss

Writing high-quality procedural texts is a challenging task for many learners. While example-based learning has shown promise as a feedback approach, a limitation arises when all learners receive the same content without considering their individual input ...

2024

Safety climate in university laboratories. Part I: model development and practical application

Thierry Meyer, Anastasia Jung

Safety climate assessment has become a regular practice for most organisations. However, it is often limited to questionnaires, providing only qualitative information. The indicator-based approach takes precedence over decision-making, and practical risk a ...

2023

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

An unrefinement algorithm for planar THB-spline parameterizations

Annalisa Buffa

Unrefinement is a tool that allows to perform faster numerical simulations by controlling the level of precision in the specified area. We introduce an algorithm that creates a coarser geometry from an initial regular geometry, which is represented with re ...

ELSEVIER2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

LHC Schottky Spectrum from Macro-Particle Simulations

Tatiana Pieloni, Nicolas Frank Mounet, Christophe Emmanuel R. Lannoy

We introduce a method for building Schottky spectra from macro-particle simulations performed with the PyHEADTAIL code, applied to LHC beam conditions. In this case, the use of a standard Fast Fourier Transform (FFT) algorithm to recover the spectral conte ...

JACoW Publishing2022

Free Boundary Regularity for Almost Every Solution to the Signorini Problem

Xavier Fernandez-Real Girona

We investigate the regularity of the free boundary for the Signorini problem in Rn+1. It is known that regular points are (n−1)-dimensional and C∞. However, even for C∞ obstacles φ, the set of non-regular (or degenerate) points could be very large—e.g. wit ...

2021

Capture zone models of a multi-well system in aquifers bounded with regular and irregular inflow boundaries

David Andrew Barry, Setareh Nagheli

Being bounded by hydrological (inflow and barrier) boundaries, natural aquifers have regular/irregular shapes. Here, we consider aquifers bounded by segmental inflow (variable head) boundaries in which water is extracted/injected by a multi-well system. St ...

2020

Flexure Pivot Oscillator Insensitive to Gravity

Simon Nessim Henein, Etienne Frédéric Gabriel Thalmann, Mohammad Hussein Kahrobaiyan

The mechanical oscillator according to the invention comprises an oscillating body (601), at least one rigid intermediate body (602) and a support (600). Each rigid intermediate body is connected to the support by a pair of elements (610, 611) providing ro ...

2020

TFHE: Fast Fully Homomorphic Encryption Over the Torus

This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary ...

SPRINGER2020

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