UScholar Works
 
Filters: Date: "1998" School Or College: "College of Engineering" Collection: ir_uspace
1 - 25 of 42
Number of results to display per page
CreatorTitleDescriptionSubjectDate
1 Gopalakrishnan, GaneshThe 'test model-checking' approach to the verification of formal memory models of multiprocessorsWe offer a solution to the problem of verifying formal memory models of processors by com bining the strengths of model checking and a formal testing procedure for parallel machines We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety p...Formal memory models; Shared memory multiprocessors; Formal testing; Model; Checking1998
2 Gopalakrishnan, GaneshThe 'Test model-checking' approach to the verification of formal memory models of multiprocessorsWe offer a solution to the problem of verifying formal memory models of processors by combining the strengths of model-checking and a formal testing procedure for parallel machines. We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety proper...Test Model-checking; Formal memory; Verification1998
3 Mathews, V. John; Schlegel, ChristianA blind adaptive projection receiver for CDMA systemsAbstract - This paper presents a blind and adaptive CDMA receiver that does not require knowledge of the spreading codes associated with users other than the ones of interest. Receivers for synchronous as well as asynchronous transmission by multiple users with error control coding are develope...1998
4 Stevens, KennethA mathematical approach to a low power FFT architectureArchitecture and circuit design are the two most effective means of reducing power in CMOS VLSI. Mathematical manipulations have been applied to create a power efficient architecture of an FFT. This architecture has been implemented in asynchronous circuit technology that achieves significant powe...1998
5 Gopalakrishnan, GaneshA partial order reduction algorithm without the ProvisoThis paper presents a partial order reduction algorithm, called Two phase, that preserves stutter free LTL properties. Two phase dramatically reduces the number of states visited compared to previous partial order reduction algorithms on most practical protocols. The reason can be traced to a step o...Order reduction algorithm; Proviso step1998
6 Stevens, KennethA single chip low power asynchronous implementation of an FFT algorithm for space applicationsA fully asynchronous _x000C_fixed point FFT processor is introduced for low power space applications. The architecture is based on an algorithm developed by Suter and Stevens specifi_x000C_cally for a low power implementation. The novelty of this architecture lies in its high localization of compo...1998
7 Beazley, David. M.A wrapper generation tool for the creation of scriptable scientific applicationsIn recent years, there has been considerable interest in the use of scripting languages as a mechanism for controlling and developing scientific software. Scripting languages allow scientific applications to be encapsulated in an interpreted environment similar to that found in commercial scientific...1998
8 Mathews, V. JohnAdaptive parallel-cascade truncated volterra filtersAbstract-This paper studies adaptive truncated Volterra filters employing parallel-cascade structures. Parallel-cascade realizations implement higher order Volterra systems a s a parallel connection of multiplicative combinations of lower order truncated Volterra systems. A normalized LMS adaptive f...1998
9 Mathews, V. JohnAdaptive, quadratic preprocessing of document images for binarizationAbstract-This paper presents an adaptive algorithm for preprocessing document images prior to binarization in character recognition problems. Our method is similar in its approach to the blind adaptive equalization of binary communication channels. The adaptive filter utilizes a quadratic system mod...1998
10 Mathews, V. JohnAn analytical model of the perceptual threshold function for multichannel image compressionABSTRACT The human observer is often the final judge of the quality of compressed images. One way to design a compression system that attempts to reduce or eliminate subjective distortions in the coded images is to incorporate a perceptual threshold function model into the compression system. The...1998
11 Sikorski, KrisAn interior ellipsoid algorithm for fixed pointsWe consider the problem of approximating fixed points of non-smooth contractive functions with using of the absolute error criterion. In [12] we proved that the upper bound on the number of function evaluations to compute ?-approximations is 0(n3(In 1/? + In 1/1-q +In n)) in the worst case, where ...Ellipsoid algorithm; Contractive functions; Fixed points1998
12 Weinstein, DavidThe analytic 3-D transform for the least-squared fit of three pairs of corresponding pointsWe derive the analytic transformation for minimizing the summed-squared-distance between three movable points in one three-space pose to three corresponding fixed points in another three-space pose. This change of basis is a general rigid-body transformation (translation and rotation), with the addi...3-D transform; summed-squared-distance; three movable points; Three-space1998
13 Carter, John B.AS-COMA: An adaptive hybrid shared memory ArchitectureScalable shared memory multiprocessors traditionally use either a cache coherent nonuniform memory access (CC-NUMA) or simple cache-only memory architecture (S-COMA) memory architecture. Recently, hybrid architectures that combine aspects of both CC-NUMA and S-COMA have emerged. In this paper, we pr...AS-COMA; Hybrid shared memory1998
14 Stevens, Kenneth; Myers, Chris J.Average-case optimized technology mapping of one-hot domino circuitsThis paper presents a technology mapping technique for optimizing the average-case delay of asynchronous combinational circuits implemented using domino logic and one-hot encoded outputs. The technique minimizes the critical path for common input patterns at the possible expense of making less commo...1998
15 Myers, Chris J.; Stevens, KennethAverage-case optimized technology mapping of one-hot domino circuits*This paper presents a technology mapping technique for optimizing the average-case delay of asynchronous combinational circuits implemented using domino logic and one-hot encoded outputs. The technique minimizes the critical path for common input patterns at the possible expense of making less commo...1998
16 Freire, JulianaBeyond depth-first strategies: improving tabled logic programs through alternative schedulingTabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the fi rst one encountered will use program-clause resolution; the rest will resolve with the answers generated by the f...Alternate scheduling; SLG-WAM; Tabled logic programs1998
17 Riloff, Ellen M.Case study in using linguistic phrases for text categorization on the WWWMost learning algorithms that arc applied to text categorization problems rely on a bag-of-words document representation, i.e., each word occurring in the document is considered as a separate feature. In this paper, we investigate the use of linguistic phrases as input features for text categoriz...Learning algorithms; Text categorization; Linguistic phrases; Information extraction patterns; AutoSlog-TS1998
18 Nelson, DonaldConstraint Jacobians for constant-time inverse kinematics and assembly optimizationAn algorithm for the constant-time solution of systems of geometric constraint equations is presented in this work. constraint equations and their Jacobians may be used in conjunction with other numerical methods to solve for a variety of kinematics, dynamics, and assembly optimization problems. The...Constant-time; Inverse kinematics; Constraint Jacobians1998
19 Myers, Chris J.Covering conditions and algorithms for the synthesis of speed-independent circuitsAbstract-This paper presents theory and algorithms for the synthesis of standard C-implementations of speed-independent circuits. These implementations are block-level circuits which may consist of atomic gates to perform complex functions in order to ensure hazard freedom. First, we present Boolean...1998
20 Gopalakrishnan, GaneshDecomposing the proof of correctness of pipelined microprocessorsWe present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction function using completion functions, one per unfinished instruction, each of which specify the effect (on the observables) of ...Pipelined microprocessors; Proof of correctness1998
21 Carter, John B.Design alternatives for shared memory multiprocessorsIn this paper. we consider the design alternatives available for building the next generation DSM machine (e.g., the choice of memory architecture, network technology, and amount and location of per-node remote data cache). To investigate this design space, we have simulated six applications on a wi...Shared memory multiprocessors1998
22 Riloff, Ellen M.Empirical approach to conceptual case frame acquisitionConceptual natural language processing systems usually rely on case frame instantiation to recognize events and role objects in text. But generating a good set of case frames for a domain is time-consuming, tedious, and prone to errors of omission. We have developed a corpus-based algorithm for a...Conceptual case frame acquisition; Case frame instantiation; Corpus-based algorithm1998
23 Furse, Cynthia M.Faster than fourier -- ultra-efficient time-to-frequency domain conversions for FDTDTwo highly efficient methods of computing magnitude and phase from time-domain data are demonstrated. These methods, based on solution of linear equations, are found to be equally accurate and more efficient than Fourier transform methods (DIT and FFT) for limited numbers of Frequencies. These metho...Finite-difference time-domain method; FDTD; Fourier transform methods; Sine wave magnitude; Sine wave phase1998
24 Cohen, ElaineFeature-based process planning for CNC machiningToday CNC machining is used successfully to provide program-driven medium lot size manufacturing. The range of applicability of CNC machining should be greater: For small lot sizes such as prototyping or custom products, these machines should provide quick turnaround and flexible production schedul...CNC machining1998
25 Hibler, Michael J.The flask security architecture: system support for diverse security policiesOperating systems must be flexible in their support for security policies, i.e., the operating system must provide sufficient mechanisms for supporting the wide variety of real-world security policies. Systems claiming to provide this support have failed to do so in two ways: they either fail to pro...Flask; Security architecture1998
1 - 25 of 42