Concept

Limit set

Related publications (36)

Comparison of different chaos shift keying methods

This paper examines a number of chaos shift keying methods Different approaches for the optimization of the transmitter and the receiver (based on statistical arguments) are compared through simulation. Based on the results, The tradeoff between computatio ...

2001

Friction modeling, identification and compensation

High-precision tracking requires excellent control of slow motion and positioning. Recent advances have provided dynamic friction models that represent almost all experimentally observed properties of friction. The state space formulation of these new math ...

EPFL1999

Friction Modeling, Identification and Compensation (PhD Thesis)

Abstract HIGH-PRECISION tracking requires excellent control of slow motion and positioning. Recent advances have provided dynamic friction models that represent almost all experimentally observed properties of friction. The state space formulation of these ...

EPFL - PPUR1999

Channel networks

Andrea Rinaldo

This review proceeds from Luna Leopold's and Ronald Shreve's lasting accomplishments dealing with the study of random-walk and topologically random channel networks. According to the random perspective, which has had a profound influence on the interpretat ...

1998

Dynamics of nonstationary dipole vortices

Jan Sickmann Hesthaven

The dynamics of tilted dipole vortices in the equivalent barotropic vorticity (or Hasegawa-Mima) equation is studied. A recent theory is compared with numerical simulations and found to describe the short time behavior of dipole vortices well. In the long ...

AMER INST PHYSICS1993

A Note on Transport in Stratified Formations by Flow Tilted with Respect to the Bedding

Andrea Rinaldo

The tendency to ergodicity of transport through heterogeneous stratified formations by a flow tilted with respect to the bedding is examined in this note. The idealized model of evenly stratified formations resembles recharge areas in naturally layered sed ...

1991

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.