Concept

Time-invariant system

Related publications (111)

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.

Multiresolution Approximation Using Shifted Splines

Michaël Unser

We consider the construction of least squares pyramids using shifted polynomial spline basis functions. We derive the pre- and post-filters as a function of the degree n and the shift parameter Δ. We show that the underlying projection operator is entirely ...

IEEE1998

Adaptive Transform Coding Using LMS-like Principal Component Tracking

Martin Vetterli

A new set of algorithms for transform adaptation in adaptive transform coding is presented. These algorithms are inspired by standard techniques in adaptive finite impulse response (FIR) Wiener filtering and demonstrate that similar algorithms with simple ...

1998

The Renegotiable Variable Bit Rate Service

Jean-Yves Le Boudec

A shaper is a system that stores incoming bits in a buffer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traffic constraint is defined by a fixed arrival cur ...

1998

On a Class of Time Varying Shapers with Application to the Renegotiable Variable Bit Rate Service

Jean-Yves Le Boudec

1998

Modeling urgency in timed systems

Joseph Sifakis

We define timed automata with deadlines (TAD) which are a class of timed automata where time progress conditions depend on deadlines associated with transitions. We show that using TAD makes urgency specification easier. We present the model of Petri nets ...

1998

On the zeros of discrete-time linear periodic systems

Giancarlo Ferrari Trecate

Discrete-time linear periodic SISO systems having uniform relative degree are considered. A closed-form expression of the blocking input is derived and exploited to obtain a computationally advantageous characterisation of the structural zeros. Indeed, it ...

1997

Energy principles for linear dissipative systems with application to resistive MHD stability

A formalism for the construction of energy principles for dissipative systems is presented. It is shown that dissipative systems satisfy a conservation law for the bilinear Hamiltonian provided the Lagrangian is time invariant. The energy on the other hand ...

1997

Compositional specification of timed systems

Joseph Sifakis

We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator are not well adapted for the compositional description of timed Petri nets. Timed automata with deadlines are presented. We pres ...

1996

First and Second Law Based Fuel Minimization in a Batch Furnace.

This paper presents results for the minimization of fuel consumption in a batch furnace. Several different criteria are used and minimized with respect to time-dependent process and control variables. The results show that globally there is no significant ...

1995

Generalized Chandrasekhar recursions from the generalized Schur algorithm

Ali H. Sayed

Presents a new approach to the Chandrasekhar recursions and some generalizations thereof. The derivation uses the generalized Schur recursions, which are O(N/sup 2/) recursions for the triangular factorization of N/spl times/N matrices having a certain Toe ...

IEEE1994