نتایج جستجو برای: switching time

تعداد نتایج: 1946735  

2011
Giorgio Battistelli João P. Hespanha Edoardo Mosca Pietro Tesi

This paper addresses the problem of controlling an uncertain time-varying plant by means of a finite family of linear candidate controllers supervised by an appropriate switching logic. It is shown that global stability of the closed-loop system can be guaranteed provided that (i) at every time there is at least one candidate controller that would stabilize the current time-invariant “frozen” p...

2017
Aaron Potechin David Steurer

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with r incoherent, orthogonal components in ’ from r · Õ(n1.5) randomly observed entries of the tensor. This bound improves over the previous best one of r · Õ(n2) by reduction to exact matrix completion. Our...

2002
Pu Shen

In this paper, we present a few simple market-timing strategies that appear to outperform the “buy-and-hold” strategy, with real-time data from 1970 to 2000. Our focus is on spreads between the E/P ratio of the S&P 500 index and interest rates. Extremely low spreads, as compared to their historical ranges, appear to predict higher frequencies of subsequent market downturns in monthly data. We c...

Journal: :IEEE Trans. Communications 1986
Peter O'Reilly Sayeed Ghani

The performance of data in burst switching has been rnalyzed in previous work with a fluid approximation of the data traffic. rhis study extends the previous model to the case where the silence interval between talkspurts has a hyperexponential, rather than an exponential, distribution. It is shown that data performance is extremely sensitive to the variance of the silence interval, and that, f...

1995
Efstratios Karaivazoglou Paul G. Spirakis Vasilis Triantafilou

We present here a series of experimental results for several implementations of online, oblivious wormhole routing on a mesh-connected processor network, using one bend paths. Theoretical studies so far were able to prove that the running time for such algorithms is O(L p N log(N)) .Our experimental results connrm that there exists a linear dependence between the time (average and maximum) requ...

Journal: :IEEE Journal on Selected Areas in Communications 1990
Haim Kobrinski Mario P. Vecchi Matthew S. Goodman Evan L. Goldstein Thomas E. Chapuran Janet M. Cooper Moshe Tur Chung-En Zah Serafin G. Menocal

This paper discusses system aspects and describes experimental demonstrations of nanosecond wavelength tuning in laser diode structures. Both tunable transmitters and tunable filters are considered. The dependence of the refractive index on the carrier density in semiconductors is exploited to obtain fast wavelength tuning. Experimentally, switching times of < 15 ns have been demonstrated in a ...

2000
Xuerong Mao

The main aim of this paper is to investigate the exponential stability of stochastic functional differential equations with Markovian switching. The Razumikhin argument and the generalized Itô formula will play their important roles in this paper. Applying our new results to several important types of equations e.g. stochastic differential delay equations and stochastic differential equations, ...

1996
Christian Dünkel Dietrich Reschke

Existing cell switched and packet switched transmission systems have difficulties to support real-time data transfer because the queuing characteristics and load variations in the network nodes are a handicap for it. With our interval-based transmission control method the data stream behavior is regulated in each network node and a data stream dependent time parameter adjustment is performed in...

Journal: :Rel. Eng. & Sys. Safety 2009
Maxim Finkelstein

Simple series systems of identical components with spare parts are considered. It is shown that the cumulative distribution function of a system failure time tends to a step function as the number of components increases and resources can be shared. An example of ‘continuous resources’ is also described. The time-sharing strategy for standby systems is investigated. It is proved that an optimal...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید