Results 1 - 10 of 9,964

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

by Edward Ashford Lee, David G. Messerschmitt - IEEE TRANSACTIONS ON COMPUTERS , 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract - Cited by 598 (37 self) - Add to MetaCart
special case of Petri nets. This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple proces-sors. A class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single

Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling

by N. Audsley, A. Burns, M. Richardson, K. Tindell, A. J. Wellings - Software Engineering Journal , 1993
"... The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract - Cited by 448 (64 self) - Add to MetaCart
The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions

A Survey of Program Slicing Techniques

by F. Tip - JOURNAL OF PROGRAMMING LANGUAGES , 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract - Cited by 790 (10 self) - Add to MetaCart
, whereas the latter relies on some specific test case. Procedures, arbitrary control flow, composite datatypes and pointers, and interprocess communication each require a specific solution. We classify static and dynamic slicing methods for each of these features, and compare their accuracy

Synchronous data flow

by Edward A. Lee, et al. , 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract - Cited by 622 (45 self) - Add to MetaCart
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case

Contour Tracking By Stochastic Propagation of Conditional Density

by Michael Isard, Andrew Blake , 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract - Cited by 661 (23 self) - Add to MetaCart
simultaneous alternative hypotheses. Extensions to the Kalman filter to handle multiple data associations work satisfactorily in the simple case of point targets, but do not extend naturally to continuous curves. A new, stochastic algorithm is proposed here, the Condensation algorithm --- Conditional

Cooperative strategies and capacity theorems for relay networks

by Gerhard Kramer, Michael Gastpar, Piyush Gupta - IEEE TRANS. INFORM. THEORY , 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract - Cited by 739 (19 self) - Add to MetaCart
with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial

The Cyclical Behavior of Equilibrium Unemployment and Vacancies

by Robert Shimer - American Economic Review , 2005
"... This paper argues that a broad class of search models cannot generate the observed business-cycle-frequency fluctuations in unemployment and job vacancies in response to shocks of a plausible magnitude. In the U.S., the vacancy-unemployment ratio is 20 times as volatile as average labor productivity ..."
Abstract - Cited by 871 (23 self) - Add to MetaCart
productivity, while under weak assumptions, search models predict that the vacancy-unemployment ratio and labor productivity have nearly the same variance. I establish this claim both using analytical comparative statics in a very general deterministic search model and using simulations of a stochastic version

Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media

by Kane S. Yee - IEEE Trans. Antennas and Propagation , 1966
"... The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 1158-1165, Deinterface which separates a semi-infinite region of free cember 1954. space from that of a magnetoionic medium are in ..."
Abstract - Cited by 1048 (0 self) - Add to MetaCart
are investi- [2] T. Tamir and A. A. Oliner, “The spectrum of electromagnetic waves guided by a plasma layer, ” Proc. IEEE, vol. 51, pp. 317gated for the case in which the static magnetic field is 332, February 1963. oriented perpendicular to the plane interface. It is [3] &I. A. Gintsburg, “Surface waves

Scheduling aircraft landings -the static case

by J. E. Beasley, Y. M. Sharaiha - Transportation Science , 2000
"... In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all ..."
Abstract - Cited by 34 (1 self) - Add to MetaCart
of all successive planes are respected. We present a mixed-integer zero–one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss

Self-adjusting binary search trees

by Daniel Dominic Sleator, Robert Endre Tarjan , 1985
"... The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an am ..."
Abstract - Cited by 432 (18 self) - Add to MetaCart
an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access
Results 1 - 10 of 9,964