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 real-world programs, a set

Abstract not found

We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence

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 quantifier-free theory containing these functions and predicates. The simplifier is currently used in the Stanford Pascal Verifier.

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

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

AOA angle of attack, deg bk transfer function denominator polynomial coefficients, k = 12, CA snubber circuit capacitance, F CF feedback network roll-off capacitance, F CL load capacitance, F D discriminant DAS data acquisition system DC denotes constant voltage DVM digital voltmeter Ei Laplace

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

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

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