UScholar Works
 
Filters: Department: "Computing, School of" Format: "application/pdf" School Or College: "College of Engineering" Collection: "ir_uspace"
1 - 25 of 912
Number of results to display per page
CreatorTitleDescriptionSubjectDate
1 Sobh, Tarek M.; Henderson, Thomas C.A dynamic framwork for intelligent inspectionCAD Computer Aided Design typically involves the design manufacture and inspection of a me chanical part. The problem of reverse engineering is to take an existing mechanical part as the point of departure and to inspect or produce a design and perhaps a manufacturing process for the part. ...CAD; Manufacture; Inspection; Intelligent inspection1992
2 Sobh, Tarek M.; Henderson, Thomas C.A dynamic recursive structure for intelligent explorationWe suggest a new approach for inspection and reverse engineering applications. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dy...Intelligent exploration; Discrete event dynamic systems; DEDS; Dynamic recursive finite state machines; DRFSM1992
3 Sobh, Tarek M.; Henderson, Thomas C.A dynamic recursive structure for intelligent inspectionWe suggest a new approach for inspection and reverse engineering applications. In particular we investigate the use of discrete event dynamic systems DEDS to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering?? We introduce...Intelligent inspection; Discrete event dynamic systems; DEDS; Industrial inspection; Dynamic recursive structure1992
4 Whitaker, Ross T.A fast iterative method for a class of Hamilton-Jacobi equations on parallel systemsIn this paper we propose a novel computational technique, which we call the Fast Iterative Method (FIM), to solve a class of Hamilton- Jacobi (H-J) equations on massively parallel systems. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes u...Fast Iterative Method; FIM; Parallel systems2007
5 Smith, Kent F.A fast parallel squarer based on divide-and-conquerFast and small squarers are needed in many applications such as image compression. A new family of high performance parallel squarers based on the divide-and-conquer method is reported. Our main result was realizing the basis cases of the divide-and-conquer recursion by using optimized n-bit primiti...Squarer; Parallel squarers; Divide-and-conquer; MOPS; CMOS1995
6 Henderson, Thomas C.; Hansen, Charles D.A fault tolerant sensor schemeMulti-sensor systems pose the problem of how to coherently and efficiently treat the data provided by the various sensors. However. the availability of greater numbers of sensors also broadens the ability to build fault tolerant sensor systems. We define a framework in which sensors can be abstractl...Multi-sensor systems; Logical sensors1983
7 Lindstrom, Gary E.A framework for module-based language processorsA system composed of interconnected modules is a module-based system. We present an object-oriented (0-0) framework for the development of processors for module-based systems, such as compilers for 0-0 languages, linkers/loaders, and tools for user/system libraries. We claim t h a t this framework,...Language processors; Jigsaw; Module-based1993
8 Michell, NickA gallium arsenide mutual exclusion elementA mutual exclusion element is a key component in building asynchronous and self-timed circuits. As part of our effort to design high performance self-timed circuits, we have designed a mutual exclusion element in gallium arsenide. This circuit has been fabricated in a 1.2? process and tested. A test...Mutual exclusion element; Self-timed circuits1993
9 Mathew, Binu K.; Davis, Al; Fang, ZhenA Gaussian probability accelerator for SPHINX 3Accurate real-time speech recognition is not currently possible in the mobile embedded space where the need for natural voice interfaces is clearly important. The continuous nature of speech recognition coupled with an inherently large working set creates significant cache interference with other...Speech recognition; SPHINX 3; Speech recognizers2003-07-22
10 Gopalakrishnan, GaneshA general compositional approach to verifying hierarchical cache coherence protocolsModern chip multiprocessor (CMP) cache coherence protocols are extremely complex and error prone to design. Modern symbolic methods are unable to provide much leverage for this class of examples. In [1], we presented a method to verify hierarchical and inclusive versions of these protocols using ...Hierarchical cache coherence protocols; Verification2006-11-26
11 Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E.A generic operational memory model specification framework for multithreaded program verificationGiven the complicated nature of modern architectural and language level memory model designs, it is vital to have a systematic ap- proach for specifying memory consistency requirements that can support verification and promote understanding. In this paper, we develop a spec- ification methodolog...Multithreaded program verification2003
12 Lefohn, Aaron; Whitaker, Ross T.A GPU-based, three-dimensional level set solver with curvature flowLevel set methods are a powerful tool for implicitly representing deformable surfaces. Since their inception, these techniques have been used to solve prob- lems in fields as varied as computer vision, scientific visualization, computer graphics and computational physics. With the power and flexi...GPU-based; Level set solver2002-12-11
13 Sobh, Tarek M.A graphical environment and applications for discrete event and hybrid systems in robotics and automationIn this paper we present an overview for the development of a graphical environment for simulating, analyzing, synthesizing, monitoring, and controlling complex discrete event and hybrid systems within the robotics, automation, and intelligent system domain. We start by presenting an overview of di...Intelligent system domain; Graphical environment1994
14 Warnock, John E.A hidden line algorithm for halftone picture representationIn exploring applications in computer graphics, one finds quickly that the representation of three dimensional objects in picture form is both a desirable and necessary capability. Applications dealing with any form of spatial design or with visual environment simulation need the ability to represen...Halftone picture representation; Spatial design1968
15 Cohen, ElaineA hole-filling algorithm for triangular meshesData obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the ...Hole-filling algorithm; Triangular meshes; 3D models; Scanning2004-12-20
16 Starkey, MikeA lisp-based occam interpreterThe OCCAM programming language is an implementation of Communicating Sequential Processes and is used in a number of different areas. These areas usually require explicitly describing small-grain paralleslism. OCCAM programs formed by such descriptions can be tested for correctness by executing the...Lisp-based; Occam interpreter1991
17 Bennion, Scott ThomasA method of solution for hydrodynamics and radiation diffusion as a multi-material problem in one dimensionMulti-material problem1971
18 Weinstein, DavidA morphing algorithm for generating near optimal grids: applications in computational medicineWe apply morphing to t h e problem of generating the initial mesh for finite element simulations. This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh. We apply this method to large-scale bioelectric field problems invol...Morphing algorithm; Bioelectric field problems1994
19 Subrahmanyam, P.A.A new approach to specifying and handling exceptionsAn operation generally exhibits different patterns of behavior over different parts of its domain. Depending upon the context, such behavior may either be conceived of as "normal" or as an "exception." Thus, the behavior of an operation Is quite naturally characterized by the set of partial operatio...Computer operations; Exceptions; Exception handling1980
20 Bruderlin, BeatA new approach to tolerance analysisTolerance analysis is seen as part of a more general problem, namely handling data with uncertainty. Uncertain geometric data arises when interpreting measured data, but also in solid modeling where floating point approximations are common, when representing design tolerances, or when dealing with l...Tolerance analysis1994
21 Kirby, Robert Michael II; Johnson, Christopher R.A new family of variational-form-based regularizers for reconstructing epicardial potentials from body-surface mappingWe propose a new family of regularizers for the inverse ECG problem, using a variational principle that underlies finite element approximation methods. As an alternative to traditional Tikhonov regularizers, the variational formulation has several advantages: 1)it enables a simple construction of ...2010
22 Cohen, ElaineA new local basis for designing with tensioned splinesRecently there has been a great deal of interest in the use of "tension" parameters to augment control mesh vertices as design handles for piecewise polynomials. A particular local cubic basis called p-splines, which has been termed a "generalization of B-splines", has been proposed as an appropriat...Tensioned splines1985
23 Sikorski, KrisA note on optimal algorithms for fixed pointsWe present a constructive lemma that we believe will make possible the design of nearly optimal 0(dlog | ) cost algorithms for computing eresidual approximations to the fixed points of d-dimensional nonexpansive mappings with respect to the infinity norm. This lemma is a generalization of a two-...Fixed points; Constructive lemma2009
24 Lyche, TomA note on the Oslo algorithmThe Oslo algorithm is a recursive method for updating the B-spline representation of a curve or tensor product surface when extra knots are added. In the present note the derivation of this method is simplified.Oslo algorithm; B-spline; Curve product surface; Tensor product surface1987
25 Sloan, Peter-PikeA painterly approach to human skinRendering convincing human figures is one of the unsolved goals of computer graphics. Previous work has concentrated on modeling physics of human skin. We have taken a different approach. We are exploring techniques used by artists, specifically artists who paint air-brushed portraits. Our goal is t...Human skin1999
1 - 25 of 912