Results 1  10
of
1,650
Identifying Enumeration Types Modeled with Symbolic Constants
 In Third Working Conference on Reverse Engineering; WCRE’96
, 1996
"... An important challenge in software reengineering is to encapsulate collections of related data that, due to the absence of appropriate constructs for encapsulation in legacy programming languages, may be distributed throughout the code. The encapsulation of such collections is a necessary step for r ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
for reengineering a legacy system into an objectoriented design or implementation. Encapsulating a set of related symbolic constants into an enumeration type is an instance of this problem. We present a classification of how enumeration types are modeled using symbolic constants in realworld programs, a set
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
Simplification by cooperating decision procedures
 ACM Transactions on Programming Languages and Systems
, 1979
"... A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectiv ..."
Abstract

Cited by 455 (2 self)
 Add to MetaCart
symbols. If the expression is a theorem it is simplified to the constant true, so the simplifier can be used as a decision procedure for the quantifierfree theory containing these functions and predicates. The simplifier is currently used in the Stanford Pascal Verifier.
under NSF grant CCR8918233. Abstract Value Constructors Symbolic Constants for Standard ML ∗
, 2006
"... Standard ML (SML) has been used to implement a wide variety of large systems, such as compilers, theorem provers, graphics libraries, and even operating systems. While SML provides a convenient, highlevel notation for programming large applications, it does have certain deficiencies. One such defic ..."
Abstract
 Add to MetaCart
such deficiency is the lack of a general mechanism for assigning symbolic names to constant values. In this paper, we present a simple extension of SML that corrects this deficiency in a way that fits naturally with the semantics of SML. Our proposal is a generalization of SML’s datatype constructors: we
A New Approach to Text Searching
"... We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with classes of symbols, don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among the feature ..."
Abstract

Cited by 293 (15 self)
 Add to MetaCart
We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with classes of symbols, don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among
Symbols
, 1995
"... AOA angle of attack, deg bk transfer function denominator polynomial coefficients, k = 12, CA snubber circuit capacitance, F CF feedback network rolloff capacitance, F CL load capacitance, F D discriminant DAS data acquisition system DC denotes constant voltage DVM digital voltmeter Ei Laplace tran ..."
Abstract
 Add to MetaCart
AOA angle of attack, deg bk transfer function denominator polynomial coefficients, k = 12, CA snubber circuit capacitance, F CF feedback network rolloff capacitance, F CL load capacitance, F D discriminant DAS data acquisition system DC denotes constant voltage DVM digital voltmeter Ei Laplace
Symbols
, 1996
"... A constant I i intensity of ith component Mg.OEP magnesium octaethyl porphyrin Pt.OEP platinum octaethyl porphyrin P(S i), P(T i) singlet and triplet states of metalloporphyrin molecules R =S Doppler parameter, T i ith triplet state X(O 2) mole fraction of oxygen in surrounding ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A constant I i intensity of ith component Mg.OEP magnesium octaethyl porphyrin Pt.OEP platinum octaethyl porphyrin P(S i), P(T i) singlet and triplet states of metalloporphyrin molecules R =S Doppler parameter, T i ith triplet state X(O 2) mole fraction of oxygen in surrounding
Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent MultipleAntenna Channel
 IEEE TRANS. INFORM. THEORY
, 2002
"... In this paper, we study the capacity of multipleantenna fading channels. We focus on the scenario where the fading coefficients vary quickly; thus an accurate estimation of the coefficients is generally not available to either the transmitter or the receiver. We use a noncoherent block fading model ..."
Abstract

Cited by 273 (7 self)
 Add to MetaCart
model proposed by Marzetta and Hochwald. The model does not assume any channel side information at the receiver or at the transmitter, but assumes that the coefficients remain constant for a coherence interval of length symbol periods. We compute the asymptotic capacity of this channel at high signal
Highorder entropycompressed text indexes
, 2003
"... We present a novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet Σ, where each symbol is encoded by lg Σ  bits. We show that compressed suffix arrays use just nHh + O(n lg lg ..."
Abstract

Cited by 267 (22 self)
 Add to MetaCart
We present a novel implementation of compressed suffix arrays exhibiting new tradeoffs between search time and space occupancy for a given text (or sequence) of n symbols over an alphabet Σ, where each symbol is encoded by lg Σ  bits. We show that compressed suffix arrays use just nHh + O(n lg lg
Results 1  10
of
1,650