Publications associées (5)

Theoretical treatment and numerical simulation of potentiometric and amperometric enzyme electrodes and of enzyme reactors. Part 2: Time-dependent concentration profiles, fluxes, and responses

Nico de Rooij, Peter Van der Wal

The time-dependent behavior of sensor systems based on enzyme membranes is treated theoretically. The comparative treatment covers traditional potentiometric and amperometric enzyme electrodes as well as enzyme reactors. Theoretical solutions are derived b ...
2011

Conditional probabilities in the excursion set theory: generic barriers and non-Gaussian initial conditions

Andrea De Simone, Michele Maggiore

The excursion set theory, where density perturbations evolve stochastically with the smoothing scale, provides a method for computing the dark matter halo mass function. The computation of the mass function is mapped into the so-called first-passage time p ...
Blackwell Publishing Ltd, Oxford2011

TOQL: Temporal Ontology Querying Language

Nikolaos Maris

We introduce TOQL, a query language for querying time information in ontologies. TOQL is a high level query language that handles ontologies almost like relational databases. Queries are issued as SQL-like statements involving time (i.e., time points or in ...
2009

Vertebrate conserved non coding DNA regions have a high persistence length and a short persistence time

Philipp Bucher

ABSTRACT: BACKGROUND: The comparison of complete genomes has revealed surprisingly large numbers of conserved non-protein-coding (CNC) DNA regions. However, the biological function of CNC remains elusive. CNC differ in two aspects from conserved protein-co ...
2007

Charged exciton dynamics in GaAs quantum wells

Benoît Marie Joseph Deveaud, Jean-Daniel Ganière, Victoria Ciulin

We study the dynamics of the charged and neutral excitons in a modulation-doped GaAs quantum well by time-resolved photoluminescence under a resonant excitation. The radiative lifetime of the charged exciton is found to be surprisingly short, 60 ps. This t ...
1998

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.