Publications associées à Chaîne de caractères

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

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

How Many CPU Cores is an FPGA Worth? Lessons Learned from Accelerating String Sorting on a CPU-FPGA System

Paolo Ienne, Mikhail Asiatici, Damian Maiorano

String sorting is a fundamental kernel of string matching and database index construction; yet, it has not been studied as extensively as fixed-length keys sorting. Because processing variable-length keys in hardware is challenging, it is no surprise that ...

SPRINGER2021

Out-of-equilibrium phase diagram of long-range superconductors

Within the ultimate goal of classifying universality in quantum many-body dynamics, understanding the relation between out-of-equilibrium and equilibrium criticality is a crucial objective. Models with power-law interactions exhibit rich well-understood cr ...

2020

Fractal-like Mechanical Resonators with a Soft-Clamped Fundamental Mode

Tobias Kippenberg, Sergey Fedorov, Alberto Beccari, Nils Johan Engelsen

Self-similar structures occur naturally and have been employed to engineer exotic physical properties. We show that acoustic modes of a fractal-like system of tensioned strings can display increased mechanical quality factors due to the enhancement of diss ...

AMER PHYSICAL SOC2020

Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces

Charles Pfister

For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...

2020

FPGAs in the Datacenters: the Case of Parallel Hybrid Super Scalar String Sample Sort

Paolo Ienne, Mikhail Asiatici, Damian Maiorano

String sorting is an important part of database and MapReduce applications; however, it has not been studied as extensively as sorting of fixed-length keys. Handling variable-length keys in hardware is challenging and it is no surprise that no string sorte ...

IEEE COMPUTER SOC2020

Reliability of photovoltaic modules : from indoor testing to long-term performance prediction

Eleonora Annigoni

A fundamental challenge with solar energy is improving the reliability, and increasing the lifetime, of photovoltaic modules. Typically, photovoltaic module manufacturers guarantee 80% of the nominal power of their modules for 25 years, but this type of gu ...

EPFL2018

An Update on Deductive Synthesis and Repair in the Leon Tool

Viktor Kuncak, Emmanouil Koukoutos, Etienne Kneuss

We report our progress in scaling deductive synthesis and repair of recursive functional Scala programs in the Leon tool. We describe new techniques, including a more precise mechanism for encoding the space of meaningful candidate programs. Our techniques ...

2017

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

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