Concept

Universal quantification

Publications associées (144)

Cement and Concrete Research

Paul Bowen, Sandra Caroline Galmarini, Nicolas Ruffray

Experimental work has been done to determine changes in the particle shape of portlandite grown in the presence of different ions. To quantify the experimentally observed changes in morphology a new analysis tool was developed, allowing the calculation of ...

Elsevier2011

Disambiguating Temporal-Contrastive Discourse Connectives for Machine Translation

Thomas Meyer

Temporal–contrastive discourse connectives (although, while, since, etc.) signal various types of relations between clauses such as temporal, contrast, concession and cause. They are often ambiguous and therefore difficult to translate from one language to ...

2011

How Comparable are Parallel Corpora? Measuring the Distribution of General Vocabulary and Connectives

Andrei Popescu-Belis, Thomas Meyer

In this paper, we question the homogeneity of a large parallel corpus by measuring the similarity between various sub-parts. We compare results obtained using a general measure of lexical similarity based on c2 and by counting the number of discourse conne ...

2011

Multilingual Annotation and Disambiguation of Discourse Connectives for Machine Translation

Andrei Popescu-Belis, Thomas Meyer

Many discourse connectives can signal several types of relations between sentences. Their automatic disambiguation, i.e. the labeling of the correct sense of each occurrence is important for discourse parsing, but could also be helpful to machine translati ...

2011

Sets with Cardinality Constraints in Satisfiability Modulo Theories

Viktor Kuncak, Philippe Paul Henri Suter, Robin Steiger

Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that can express constraints on sets of elements and their cardinalities. Problems from verification of complex properties of software often contain fragments that belong to quantifier- ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Quantifying Location Privacy

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Reza Shokri, Georgios Theodorakopoulos

It is a well-known fact that the progress of personal communication devices leads to serious concerns about privacy in general, and location privacy in particular. As a response to these issues, a number of Location-Privacy Protection Mechanisms (LPPMs) ha ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

A Corpus-based Contrastive Analysis for Defining Minimal Semantics of Inter-sentential Dependencies for Machine Translation

Andrei Popescu-Belis, Thomas Meyer

Inter-sentential dependencies such as discourse connectives or pronouns have an impact on the translation of these items. These dependencies have classically been analyzed within complex theoretical frameworks, often monolingual ones, and the resulting fin ...

2011

Statistical analysis of rainfall intermittency at small spatial and temporal scales

Alexis Berne, Marc Schleiss, Joël Jaffrain

Rainfall intermittency is analyzed and quantified at small spatial and temporal scales using 2 years of radar and disdrometer data collected in Switzerland. Analytical models are fitted and used to describe the intermittency for spatial scales between 0 an ...

American Geophysical Union2011

Ozone oxidation of oleic acid surface films decreases aerosol cloud condensation nuclei activity

Athanasios Nenes

Heterogeneous oxidation of aerosols composed of pure oleic acid (C 18H34O2, an unsaturated fatty acid commonly found in continental and marine aerosol) by gas-phase O3 is known to increase aerosol hygroscopicity ...

Blackwell Publishing Ltd2011

On Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

Automated software verification tools typically accept specifications of functions in terms of pre- and postconditions. However, many properties of functional programs can be more naturally specified using a more general form of universally quantified prop ...

2010

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