Concept

Langage rationnel

Publications associées (38)

Qualitative properties and global bifurcation of solutions for a singular boundary value problem

This paper deals with a singular, nonlinear Sturm-Liouville problem of the form {A(x)u'(x)}'+ lambda u (x) = f (x, u(x), u'(x)) on (0,1) where A is positive on (0,1] but decays quadratically to zero as x approaches zero. This is the lowest level of degener ...

UNIV SZEGED, BOLYAI INSTITUTE2020

Particle size selection in capillary instability of locally heated coaxial fiber

François Gallaire, Pierre-Thomas Paul Brun, Saviz Mowlavi, Isha Shukla

Harnessing fluidic instabilities to produce structures with robust and regular properties has recently emerged as a new fabrication paradigm. This approach is exemplified in the work of Gumennik et al. [Nat. Commun. 4, 2216 (2103)], in which the authors fa ...

AMER PHYSICAL SOC2019

Smart Sensor Buoys - Scalable Solution for Continuous and Flexible Water Monitoring

Within this paper an industry-driven insight to an environmental development project will be given. The approach offers the novel possibility to interconnect commercially available sensors to economic and high-performance floating platforms. Each platform ...

Paul Scherrer Institute, World Resources Forum2019

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...

2018

Deductive Synthesis and Repair

Etienne Kneuss

In this thesis, we explore techniques for the development of recursive functional programs over unbounded domains that are proved correct according to their high-level specifications. We present algorithms for automatically synthesizing executable code, st ...

EPFL2016

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

Finite-Length Scaling for Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani

Consider a binary-input memoryless output-symmetric channel W. Such a channel has a capacity, call it I (W), and for any R < I (W) and strictly positive constant P-e we know that we can construct a coding scheme that allows transmission at rate R with an e ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

Symbolic execution of Reo circuits using constraint automata

Hossein Hojjat

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

2012

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