Publication

Improvement of utilisation safety by a hierarchical method of analysis

Related publications (32)

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.

Reduced complexity attacks on the alternating step generator

Willi Meier, Shahram Khazaei, Simon Fischer

In this paper, we present some reduced complexity attacks on the Alternating Step Generator (ASG). The attacks are based on a quite general framework and mostly benefit from the low sampling resistance of the ASG, and of an abnormal behavior related to the ...

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

Regularized frequency domain equalization algorithm and its VLSI implementation

Andreas Peter Burg

Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a novel technique to compute linear equalizer coefficients in the frequency domain. It is s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Bayesian Factorial Linear Gaussian State-Space Models for Biosignal Decomposition

Silvia Chiappa

We discuss a method to extract independent dynamical systems underlying a single or multiple channels of observation. In particular, we search for one dimensional subsignals to aid the interpretability of the decomposition. The method uses an approximate B ...

IDIAP2005

Bayesian Linear Gaussian State Space Models for Biosignal Decomposition

Silvia Chiappa

2005

An automatic tool for high-level algorithmic complexity evaluation and optimization for system design

Marco Mattavelli, Massimo Ravasi

The increasing complexity of nowadays applications has lead to the need of more and more intensive specification and validation tasks by means of software implementations. Besides, as the complexity grows, it is becoming very hard to understand the specifi ...

IEEE, Piscataway, N.J., ETATS-UNIS (2004) (Monographie)2004

POEtic Tissue: An Integrated Architecture for Bio-inspired Hardware

Dario Floreano, Eduardo Sanchez, Daniel Mange

It is clear to all, after a moments thought, that nature has much wemight be inspired by when designing our systems, for example: robustness, adaptability and complexity, to name a few. The implementation of bio-inspired systems in hardware has however bee ...

Springer2003

Fault location algorithms for optical networks

Today, there is no doubt that optical networks are the solution to the explosion of Internet traffic that two decades ago we only dreamed about. They offer high capacity with the use of Wavelength Division Multiplexing (WDM) techniques among others. Howeve ...

EPFL2000

Distance transformations: fast algorithms and applications to medical image processing

Olivier Cuisenaire

Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...

1999

Optimized design of variable speed drives and electrical networks based on numerical simulation.

Jean-Jacques Simond, Philippe Allenbach, Basile Kawkabani, Alain Sapin

The present paper describes the modelling and the prediction of the steady-state or transient behaviour of different modern variable-speed drives and electrical networks. The necessity of a performant numerical simulation tool in order to guarantee an opti ...

1998

Optimal Parameterization of Point Distribution Models

We address the problem of determining the \emph{optimal model complexity} for shape modeling. This complexity is a compromise between model specificity and generality. We show that the error of a model can be split into two components, the model error and ...

IDIAP1998