Concept

Concurrent versions system

Publications associées (50)

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

Membrane stress tensor in the presence of lipid density and composition inhomogeneities

Anne-Florence Raphaëlle Bitbol

We derive the expression of the stress tensor for one-and two-component lipid membranes with density and composition inhomogeneities. We first express the membrane stress tensor as a function of the free-energy density by means of the principle of virtual ...

Springer Nature2011

The Voice of Personality: Mapping Nonverbal Vocal Behavior into Trait Attributions

Gelareh Mohammadi, Alessandro Vinciarelli

This paper reports preliminary experiments on automatic attribution of personality traits based on nonverbal vocal behavioral cues. In particular, the work shows how prosodic features can be used to predict, with an accuracy up to 75% depending on the trai ...

2010

Distributed Awareness for Class Orchestration

Pierre Dillenbourg, Frédéric Kaplan, Hamed Seiied Alavi

The orchestration process consists of managing classroom interactions at multiple levels: individual activities, teamwork and class-wide sessions. We study the process of orchestration in recitation sections, i.e. when students work on their assignments in ...

Springer2009

Distributed Awareness for Class Orchestration

Pierre Dillenbourg, Frédéric Kaplan, Hamed Seiied Alavi

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

Capturing Order in Social Interactions

Alessandro Vinciarelli

As humans appear to be literally wired for social interaction, it is not surprising to observe that social aspects of human behavior and psychology attract interest in the computing community as well. The gap between social animal and unsocial machine was ...

2009

Multiversion concurrency control for the generalized search tree

Boi Faltings, Ion Constantinescu, Samuel Spycher

Many read-intensive systems where fast access to data is more important than the rate at which data can change make use of multidimensional index structures, like the generalized search tree (GiST). Although in these systems the indexed data are rarely upd ...

2009

Programming with Undo

Ersoy Bayramoglu

This thesis is about objects that can undo their state changes. Based on an earlier work on data structure persistence, we propose generating undo methods for classes from annotated classes automatically. As opposed to ephemeral data structures, persistent ...

2009

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008

Towards a molecular dynamics consensus view of B-DNA flexibility

We present a systematic study of B-DNA flexibility in aqueous solution using long-scale molecular dynamics simulations with the two more recent versions of nucleic acids force fields (CHARMM27 and parmbsc0) using four long duplexes designed to contain seve ...

Oxford University Press2008

Some graph products and their expansion properties

Mohammad Amin Shokrollahi, Andrew Brown

We introduce "derandomized" versions of the tensor product and the zig-zag product, extending the ideas in the derandomized squaring operation of Rozenman and Vadhan. These enable us to obtain graphs with smaller degrees than those obtained using their non ...

2006