Results 1 - 10 of 7,275

Capacity of Fading Channels with Channel Side Information

by Andrea J. Goldsmith , et al. , 1997
"... We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency-sele ..."
Abstract - Cited by 586 (20 self) - Add to MetaCart
We obtain the Shannon capacity of a fading channel with channel side information at the transmitter and receiver, and at the receiver alone. The optimal power adaptation in the former case is "water-pouring" in time, analogous to water-pouring in frequency for time-invariant frequency

A theory of social comparison processes,”

by Leon Festinger - Human Relations, , 1954
"... In this paper we shall present a further development of a previously published theory concerning opinion influence processes in social groups (7). This further development has enabled us to extend the theory to deal with other areas, in addition to opinion formation, in which social comparison is i ..."
Abstract - Cited by 1318 (0 self) - Add to MetaCart
to instances where the performance which reflects the ability can be clearly ordered. In the former case, the evaluation of the ability does function like other opinions which are not directly testable in "objective reality'. For example, a person's evaluation of his ability to write poetry

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
in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input

Pricing with a Smile

by Bruno Dupire, The Black–scholes Model (see Black, Gives Options - Risk Magazine , 1994
"... prices as a function of volatility. If an option price is given by the market we can invert this relationship to get the implied volatility. If the model were perfect, this implied value would be the same for all option market prices, but reality shows this is not the case. Implied Black–Scholes vol ..."
Abstract - Cited by 445 (1 self) - Add to MetaCart
prices as a function of volatility. If an option price is given by the market we can invert this relationship to get the implied volatility. If the model were perfect, this implied value would be the same for all option market prices, but reality shows this is not the case. Implied Black

Intrusion Detection using Sequences of System Calls

by Steven A. Hofmeyr, Stephanie Forrest, Anil Somayaji - Journal of Computer Security , 1998
"... A method is introducted for detecting intrusions at the level of privileged processes. Evidence is given that short sequences of system calls executed by running processes are a good discriminator between normal and abnormal operating characteristics of several common UNIX programs. Normal behavio ..."
Abstract - Cited by 396 (15 self) - Add to MetaCart
behavior is collected in two ways: Synthetically, by exercising as many normal modes of usage of a program as possible, and in a live user environment by tracing the actual execution of the program. In the former case several types of intrusive behavior were studied; in the latter case, results were

Q : Worst-case Fair Weighted Fair Queueing

by Jon Bennett, Jon C. R, Bennett Hui Zhang
"... The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose traffic is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless o ..."
Abstract - Cited by 365 (11 self) - Add to MetaCart
of whether or not their traffic is constrained. The former property is the basis for supporting guaranteed service traffic while the later property is important for supporting best-effort service traffic. Since GPS uses an idealized fluid model which cannot be realized in the real world, various packet

Transactional Locking II

by Dave Dice, Ori Shalev, Nir Shavit - In Proc. of the 20th Intl. Symp. on Distributed Computing , 2006
"... Abstract. The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-ti ..."
Abstract - Cited by 359 (17 self) - Add to MetaCart
periods of unsafe execution, that is, using its novel version-clock validation, user code is guaranteed to operate only on consistent memory states, and (3) in a sequence of high performance benchmarks, while providing these new properties, it delivered overall performance comparable to (and in many cases

Dataflow Process Networks

by Edward A. Lee, Thomas Parks - Proceedings of the IEEE , 1995
"... We review a model of computation used in industrial practice in signal processing software environments and experimentally in other contexts. We give this model the name "dataflow process networks," and study its formal properties as well as its utility as a basis for programming language ..."
Abstract - Cited by 325 (32 self) - Add to MetaCart
design. Variants of this model are used in commercial visual programming systems such as SPW from the Alta Group of Cadence (formerly Comdisco Systems), COSSAP from Synopsys (formerly Cadis), the DSP Station from Mentor Graphics, and Hypersignal from Hyperception. They are also used in research software

Geometric Ad-Hoc Routing: Of Theory and Practice

by Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger , 2003
"... All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc routing. In particular we consider two aspects: We propose a new geometric routing algorithm which is outstandingly efficient ..."
Abstract - Cited by 317 (13 self) - Add to MetaCart
on practical average-case networks, however is also in theory asymptotically worst-case optimal. On the other hand we are able to drop the formerly necessary assumption that the distance between network nodes may not fall below a constant value, an assumption that cannot be maintained for practical networks

Nonlinear Neural Networks: Principles, Mechanisms, and Architectures

by Stephen Grossberg , 1988
"... An historical discussion is provided of the intellectual trends that caused nineteenth century interdisciplinary studies of physics and psychobiology by leading scientists such as Helmholtz, Maxwell, and Mach to splinter into separate twentieth-century scientific movements. The nonlinear, nonstatio ..."
Abstract - Cited by 262 (21 self) - Add to MetaCart
-Schuster models. A Liapunov functional method is described for proving global limit or oscillation theorems for nonlinear competitive systems when their decision schemes are globally consistent or inconsistent, respectively. The former case is illustrated by a model of a globally stable economic market
Results 1 - 10 of 7,275