Results 1 - 10
of
1,269
Stability calculations for piecewise-smooth delay equations
"... This paper describes a new method for computing the stability of nonsmooth periodic orbits of piecewise-smooth dynamical systems with delay. Stability computations for piecewise-smooth dynamical systems without delay have previously been performed using discontinuity mappings to ‘correct’ the linear ..."
Abstract
- Add to MetaCart
This paper describes a new method for computing the stability of nonsmooth periodic orbits of piecewise-smooth dynamical systems with delay. Stability computations for piecewise-smooth dynamical systems without delay have previously been performed using discontinuity mappings to ‘correct
Comparing Algorithms for Dynamic Speed-Setting of a Low-Power CPU
, 1995
"... To take advantage of the full potential of ubiquitous computing, we will need systems which minimize powerconsumption. Weiser et al. and others have suggested that this may be accomplished by a CPU which dynamically changes speed and voltage, thereby saving energy by spreading run cycles into idle t ..."
Abstract
-
Cited by 301 (0 self)
- Add to MetaCart
time. Here we continue this research, using a simulation to compare a number of policies for dynamic speed-setting. Our work clarifies a fundamental power vs. delay tradeoff, as well as the role of prediction and of smoothing in dynamic speed-setting policies. We conclude that success seemingly depends
Measurement and modeling of the temporal dependence in packet loss
, 1999
"... Abstract — Understanding and modelling packet loss in the Internet is especially relevant for the design and analysis of delay-sensitive multimedia applications. In this paper, we present analysis of ¢¡¤ £ hours of endto-end unicast and multicast packet loss measurement. From these we selected ¥§ ¦ ..."
Abstract
-
Cited by 270 (11 self)
- Add to MetaCart
Abstract — Understanding and modelling packet loss in the Internet is especially relevant for the design and analysis of delay-sensitive multimedia applications. In this paper, we present analysis of ¢¡¤ £ hours of endto-end unicast and multicast packet loss measurement. From these we selected
Inattentive consumers
- Journal of Monetary Economics
, 2006
"... This paper studies the consumption decisions of agents who face costs of acquiring, absorbing and processing information. These consumers rationally choose to only sporadically update their information and re-compute their optimal consumption plans. In between updating dates, they remain inattentive ..."
Abstract
-
Cited by 187 (13 self)
- Add to MetaCart
inattentive. This behavior implies that news disperses slowly throughout the population, so events have a gradual and delayed effect on aggregate consumption. The model predicts that aggregate consumption adjusts slowly to shocks, and is able to explain the excess sensitivity and excess smoothness puzzles
An Algorithm for Lossless Smoothing of MPEG Video
- in Proc. ACM SIGCOMM
, 1994
"... Interframe compression techniques, such as those used in MPEG video, give rise to a coded bit stream where picture sizes differ by a factor of 10 or more. As a result, buffering is needed to reduce (smooth) rate fluctuations of encoder output from one picture to the next; without smoothing, the perf ..."
Abstract
-
Cited by 74 (4 self)
- Add to MetaCart
resort. In this paper, we design and specify an algorithm for lossless smoothing. The algorithm is characterized by three parameters: D (delay bound), K (number of pictures with known sizes), and H (lookahead interval for optimization). We present a theorem which guarantees that, if K 1, the algorithm
An Improved Algorithm for Lossless Smoothing of MPEG Video with Delay Constraints
"... This paper improves upon a lossless smoothing algorithm designed to be used with a real-time Variable Bit Rate (VBR) MPEG video coding and transmission system. The original algorithm [1] is characterized by three parameters: D (delay bound), K (number of frames with known sizes), and H (lookahead ..."
Abstract
- Add to MetaCart
This paper improves upon a lossless smoothing algorithm designed to be used with a real-time Variable Bit Rate (VBR) MPEG video coding and transmission system. The original algorithm [1] is characterized by three parameters: D (delay bound), K (number of frames with known sizes), and H
Adaptive Voice Smoothing with Optimal Playback Delay Based on
- Department of Electrical Engineering, National University of Tainan, Taiwan. His
, 2005
"... Abstract. Perceived voice quality is mainly affected by IP network impairments such as delay, jitter and packet loss. Adaptive smoothing buffer at the receiving end can compensate for the effects of jitter based on a tradeoff between delay and loss to archive a best voice quality. This work formula ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. Perceived voice quality is mainly affected by IP network impairments such as delay, jitter and packet loss. Adaptive smoothing buffer at the receiving end can compensate for the effects of jitter based on a tradeoff between delay and loss to archive a best voice quality. This work
The Initiation of Smooth Pursuit is Delayed in Anisometropic Amblyopia
, 2016
"... Citation: Raashid RA, Liu IZ, Blakeman A, Goltz HC, Wong AMF. The initiation of smooth pursuit is delayed in anisometropic amblyopia. Invest Ophthalmol Vis Sci. 2016;57:175757: -176457: . DOI:10.1167 PURPOSE. Several behavioral studies have shown that the reaction times of visually guided movement ..."
Abstract
- Add to MetaCart
Citation: Raashid RA, Liu IZ, Blakeman A, Goltz HC, Wong AMF. The initiation of smooth pursuit is delayed in anisometropic amblyopia. Invest Ophthalmol Vis Sci. 2016;57:175757: -176457: . DOI:10.1167 PURPOSE. Several behavioral studies have shown that the reaction times of visually guided
Hop-by-hop Congestion Control over a Wireless Multi-Hop Network
, 2004
"... This paper focuses on congestion control over multihop, wireless networks. In a wireless network, an important constraint that arises is that due to the MAC (Media Access Control) layer. Many wireless MACs use a time-division strategy for channel access, where, at any point in space, the physical ch ..."
Abstract
-
Cited by 138 (1 self)
- Add to MetaCart
that this algorithm are globally stable using a Lyapunov function based approach. Next, in the presence of delay, we show that the hop-by-hop control algorithm has the property of spatial spreading. In other words, focused loads at a particular spatial location in the network get "smoothed" over space. We
Results 1 - 10
of
1,269