ppxscal/embedding_network huggingface dataset:
Initialization of Sequential Circuits and its Application to ATPG
Authors: Jalal A. Wehbeh, Daniel G. Saab
Venue: Journal of Electronic Testing: Theory and Applications (1998)

A general method for determining whether a certain design is initializable, and for generating its initialization sequence, is presented in this paper. This method is based on structural decomposition of the circuit, and can handle both logical (using X-value simulation) and functional initializability. The routines developed are then used for ATPG of sequential circuits. A &ldquo;pre-test&rdquo; sequence that initializes the good and as many of the faulty machines as possible is generated and used in conjunction with CRIS [5], a simulation based sequential ATPG program, to generate a test set for the circuit.
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey
Authors: Alexander S. Szalay, Peter Z. Kunszt, Ani Thakar, Jim Gray, Don Slutz, Robert J. Brunner
Venue: ACM SIGMOD Record (2000)

The next-generation astronomy digital archives will cover most of the sky at fine resolution in many wavelengths, from X-rays, through ultraviolet, optical, and infrared. The archives will be stored at diverse geographical locations. One of the first of these projects, the Sloan Digital Sky Survey (SDSS) is creating a 5-wavelength catalog over 10,000 square degrees of the sky (see http://www.sdss.org/). The 200 million objects in the multi-terabyte database will have mostly numerical attributes in a 100+ dimensional space. Points in this space have highly correlated distributions. The archive will enable astronomers to explore the data interactively. Data access will be aided by multidimensional spatial and attribute indices. The data will be partitioned in many ways. Small tag objects consisting of the most popular attributes will accelerate frequent searches. Splitting the data among multiple servers will allow parallel, scalable I/O and parallel data analysis. Hashing techniques will allow efficient clustering, and pair-wise comparison algorithms that should parallelize nicely. Randomly sampled subsets will allow de-bugging otherwise large queries at the desktop. Central servers will operate a data pump to support sweep searches touching most of the data. The anticipated queries will require special operators related to angular distances and complex similarity tests of object properties, like shapes, colors, velocity vectors, or temporal behaviors. These issues pose interesting data management challenges.
Differential Thermal Testing: An Approach to its Feasibility
Authors: J. Altet, A. Rubio, W. Claeys, S. Dilhaire, E. Schaub, H. Tamamoto
Venue: Journal of Electronic Testing: Theory and Applications (1999)

Testing techniques based on the functional behaviour, the propagation delay and the levels of quiescent current have been used with great success for the last two decade technologies. However, the efficiency of such techniques is dubious for future technologies, characterised by huge mixed-mode complex circuits and very low supply voltage levels. In this paper the feasibility of using internal thermal sensors to detect heat sources provoked by structural defects are considered and evaluated.
A Minimal Universal Test Set for Self-Test of EXOR-Sum-of-Products Circuits
Authors: Ugur Kalay, Douglas V. Hall, Marek A. Perkowski
Venue: IEEE Transactions on Computers (2000)

A testable EXOR-Sum-of-Products (ESOP) circuit realization and a simple, universal test set which detects all single stuck-at faults in the internal lines and the primary inputs/outputs of the realization are given. Since ESOP is the most general form of AND-EXOR representations, our realization and test set are more versatile than those described by other researchers for the restricted GRM, FPRM, and PPRM forms of AND-EXOR circuits. Our circuit realization requires only two extra inputs for controllability and one extra output for observability. The cardinality of our test set for an $n$ input circuit is ($n+6$). For Built-in Self-Test (BIST) applications, we show that our test set can be generated internally as easily as a pseudorandom pattern and that it provides 100 percent single stuck-at fault coverage. In addition, our test set requires a much shorter test cycle than a comparable pseudoexhaustive or pseudorandom test set.
Public case-base and tool kit using a validated RRM
Authors: D. Rine, N. Nada
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Software systems are important, yet poorly understood entities. Users, and at times even developers, do not always understand what is occurring within the software in use. The Exploratory Visualization project attempts to address the technical issues involved in helping users understand running computations, especially long-lived distributed computations. The three facets of this problem that we investigate in our project are 1) creating accurate views of a running execution, 2) providing comprehensive and efficient access to a computation, and 3) responding to the user's interactions to promote understanding and optimize data collection.
Data integration and warehousing in Telecom Italia
Authors: Stefano M. Trisolini, Maurizio Lenzerini, Daniele Nardi
Venue: ACM SIGMOD Record (1999)

We discuss the main methodological and technological issues arosen in the last years in the development of the enterprise integrated database of Telecom Italia and, subsequently in the management of the primary data store for Telecom Italia data warehouse applications. The two efforts, although driven by different needs and requirements can be regarded as a continous development of an integrated view of the enterprise data. We review the experience accumulated in the integration of over 50 internal databases, highlighting the benefits and drawbacks of this scenario for data warehousing and discuss the development of a large dedicated data store to support the analysis of data about customers and phone traffic.
Tissue Blood Flow Assessment of Pulsed Doppler Ultrasound Using Autoregressive Modeling
Authors: Ömer Faruk Bay, İnan Güler
Venue: Journal of Medical Systems (1999)

Tissue blood flow measurement using 20 MHz pulsed Doppler ultrasound is presented. Autoregressive modeling is applied to Doppler signals obtained from tissue blood flow. The measurement system is tested on the reference flow model and then applied to man right hand tissue. It is seen that the reasonable results are obtained.
Collaborative Web caching based on proxy affinities
Authors: Jiong Yang, Wei Wang, Richard Muntz
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

With the exponential growth of hosts and traffic workloads on the Internet, collaborative web caching has been recognized as an efficient solution to alleviate web page server bottlenecks and reduce traffic. However, cache discovery, i.e., locating where a page is cached, is a challenging problem, especially in the fast growing World Wide Web environment, where the number of participating proxies can be very large. In this paper, we propose a new scheme which employs proxy affinities to maintain a dynamic distributed collaborative caching infrastructure. Web pages are partitioned into clusters according to proxy reference patterns. All proxies which frequently access some page(s) in the same web page cluster form an &ldquo;information group&rdquo;. When web pages belonging to a web page cluster are deleted from or added into a proxy's cache, only proxies in the associated information group are notified. This scheme can be shown to greatly reduce the number of messages and other overhead on individual proxies while maintaining a high cache hit rate. Finally, we employ trace driven simulation to evaluate our web caching scheme using three web access trace logs to verify that our caching structure can provide significant benefits on real workloads.
The OpenView Enterprise Management Framework
Authors: Nathan J. Muller
Venue: International Journal of Network Management (1996)

In OpenView, Hewlett-Packard has concentrated on creating a multivendor management platform for TCP&ndash;IP-based internets. This plays to the company&rsquo;s strengths in LAN management, where it has been a major player in the LAN protocol analyzer market since the early 1980s, and its expertise in TCP&sol;IP, which the company had been using internally since the early 1980s.
Mechanical Verification of Adder Circuits using Rewrite RuleLaboratory
Authors: Deepak Kapur, M. Subramaniam
Venue: Formal Methods in System Design (1998)

A methodology for mechanically verifying generic adder circuits is proposed using the rewrite-rule based theorem prover {\it Rewrite\ Rule\ Laboratory} ({\it RRL}). Proofs of properties of adder circuit descriptions are done by rewriting and induction. Carry lookahead adder circuit is described using {\it powerlists}, a data structure introduced by Misra to support {\it divide-and-conquer} strategy used for designing data-parallel algorithms. This description uses an algorithm for {\it parallel\ prefix} computation on powerlists due to Adams. Reasoning about properties of this algorithm can be of independent interest since parallel prefix operator has been found useful in many data-parallel algorithms. The correctness of the carry-lookahead adder (i.e., the adder indeed implements addition on numbers) is established by showing its equivalence to a recursive description of the ripple-carry adder, which is shown to correctly implement addition on natural numbers. The ripple carry adde r circuit is described in two different but equivalent ways: using powerlists employing the divide-and-conquer strategy, as well as using linear lists employing the linear decomposition strategy. The description of the ripple carry adder using powerlists is useful for showing equivalence of its input-output behavior to that of carry lookahead adder, whereas the description using linear lists is useful for showing its correctness with respect to addition on natural numbers. Descriptions of adder circuits using powerlists are based on Adams&lsquo; work who also gave a hand proof of their correctness using the powerlist algebra. The emphasis in this paper is to {\it generate\ proofs\ mechanically\ by\ a\ theorem\ prover} . {\em RRL} exploits the algebraic laws of the powerlist algebra as rewrite rules, and uses heuristics for mechanizing proofs by induction using the cover set method to generate such proofs. The regularity in hardware circuits gets refl ected in compact descriptions generated using the divide-and-conquer strategy as well as in mechanically generated proofs by induction. Mechanical proofs generated by {\em RRL} closely follow the well-crafted hand-proofs which is quite encouraging. A comparison with Adams&lsquo; hand generated proof is also made. There is strong evidence that the proposed methodology for generating proofs should scale up for large circuits exhibiting regularity that can be described using divide-and-conquer strategy in terms of powerlists.
Ergonomics of wearable computers
Authors: Chris Baber, James Knight, D. Haniff, L. Cooper
Venue: Mobile Networks and Applications (1999)

Wearable computers represent a new and exciting area for technology development, with a host of issues relating to display, power and processing still to be resolved. Wearable computers also present a new challenge to the field of ergonomics; not only is the technology distinct, but the manner in which the technology is to be used and the relationship between user and computer have changed in a dramatic fashion. In this paper, we concentrate on some traditional ergonomics concerns and examine how these issues can be addressed in the light of wearable computers.
A Numerical Verification Method for Solutions of Boundary Value Problems with Local Uniqueness by Banach's Fixed-Point Theorem
Authors: Nobito Yamamoto
Venue: SIAM Journal on Numerical Analysis (1998)

In this paper, we propose a method to prove the existence and the local uniqueness of solutions to infinite-dimensional fixed-point equations using computers. Choosing a set which possibly includes a solution, we transform it by an approximate linearization of the operator appearing in the equation. Then we calculate the radii of the transformed set in order to check sufficient conditions for Banach's fixed-point theorem. This method is applied to elliptic problems and numerical examples are given.
Pseudolinear Programming
Authors: Serge Kruk, Henry Wolkowicz
Venue: SIAM Review (1999)

This short note revisits an algorithm previously sketched by Mathis and Mathis [SIAM Rev., 37 (1995), pp. 230--234] and used to solve a nonlinear hospital fee optimization problem. An analysis of the problem structure reveals how the Simplex algorithm, viewed under the correct light, can be the driving force behind a successful algorithm for an almost linear problem. This presentation is intended for students who have been exposed to the Simplex method for linear programming and are progressing, via the Karush--Kuhn--Tucker conditions, toward nonlinear optimization.
Decoupling Orientation Recovery from Position Recovery with 3D-2D Point Correspondences
Authors: Rodrigo L. Carceroni, Christopher M. Brown
Venue: Journal of Mathematical Imaging and Vision (1999)

We propose a new algorithm for model-based extrinsic camera calibration that allows one to separate the recovery of the relative orientation of the camera from the recovery of its relative position, given a set of at least three correspondences between model and image points. The key idea is to replace each (real) model point whose correspondence is known by two (virtual) model edges, and then to use the fact that these edges have pairwise intersections in 3D space to derive a set of alignment constraints. We provide a proof that the resulting technique is essentially more powerful than any of the traditional methods for decoupled orientation and position recovery based uniquely on line correspondences. We also present a detailed example of a real-life application that benefits from our work, namely autonomous navigation using distant visual landmarks. We use simulation to show that, for this specific application, our algorithm, when compared to similar techniques, is either significantly more accurate at the same computational cost, or significantly faster with roughly the same average-case accuracy.
Space-time memory: a parallel programming abstraction for interactive multimedia applications
Authors: Umakishore Ramachandran, Rishiyur S. Nikhil, Nissim Harel, James M. Rehg, Kathleen Knobe
Venue: ACM SIGPLAN Notices (1999)

Realistic interactive multimedia involving vision, animation, and multimedia collaboration is likely to become an important aspect of future computer applications. The scalable parallelism inherent in such applications coupled with their computational demands make them ideal candidates for SMPs and clusters of SMPs. These applications have novel requirements that offer new kinds of challenges for parallel system design.We have designed a programming system called Stampede that offers many functionalities needed to simplify development of such applications (such as high-level data sharing abstractions, dynamic cluster-wide threads, and multiple address spaces). We have built Stampede and it runs on clusters of SMPs. To date we have implemented two applications on Stampede, one of which is discussed herein.In this paper we describe a part of Stampede called Space-Time Memory (STM). It is a novel data sharing abstraction that enables interactive multimedia applications to manage a collection of time-sequenced data items simply, efficiently, and transparently across a cluster. STM relieves the application programmer from low level synchronization and data communication by providing a high level interface that subsumes buffer management, inter-thread synchronization, and location transparency for data produced and accessed anywhere in the cluster. STM also automatically handles garbage collection of data items that will no longer be accessed by any of the application threads. We discuss ease of use issues for developing applications using STM, and present preliminary performance results to show that STM's overhead is low.
Designing information-supported performance: the scope for graphics
Authors: Patricia Wright
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1998)

This paper discusses the progress we have made in document design and suggests some of the issues remaining to be addressed, particularly in relation to multimedia documents. In order to sharpen these issues, it reports three empirical studies of the varying effects that graphics in electronic documents have on readers and the reading process in different contexts. It concludes by discussing how to represent our growing knowledge about the effects of design features, and suggests that such an information resource is more usefully thought of as a "map" to be consulted than a recipe to be followed. The varied factors that must be taken into account when reaching design decisions may mean that the "map" will need to be an interactive document in order to be a useful tool for designers scaling the heights in the online century ahead.
Fast Deconvolution by a Two-Step Method
Authors: Piero Barone
Venue: SIAM Journal on Scientific Computing (1999)

A method for solving a discretized Fredholm integral equation of the first kind with convolution kernel on the d-dimensional torus $(d\geq1)$ is presented. A two-step regularization method is used, based on the minimization of two objective functions, made up of a convex coherence-to-data term and a term which enforces a roughness penalty. This is convex in the first initialization step and nonconvex in the second one. The computational aspect is the main point addressed in the paper. A deterministic, as opposed to stochastic, approach is followed. Auxiliary variables are used. The separability of the original and the auxiliary variables is proven and exploited to reduce the computational burden. The first step provides an initial estimate by computing the unique minimum of the convex functional. The second step refines this initial estimate by computing a stationary point of the nonconvex functional. Experiments are reported on simulated data and in magnetic resonance (MR) imaging. A significant reduction in computer time and similar restoration quality is observed when the method is compared with dynamic Monte Carlo methods applied to global optimization of the nonconvex functional.
Use of a soundcard in teaching audio frequency and analog modem communications
Authors: Martin H. Levin
Venue: ACM SIGCSE Bulletin (1999)

Sound cards have become standard features of personal computers in the home, office and classroom. This paper demonstrates the usefulness of these inexpensive devices in the teaching of some of the basic and not so basic concepts of communications. These devices can be very effective in the explanation of amplitude, frequency and frequency multiplexed circuits, as well as modem handshake standards.
The Rate and Risk of Heat-Related Illness in Hospital Emergency Departments During the 1995 Chicago Heat Disaster
Authors: Robert J. Rydman, Dino P. Rumoro, Julio C. Silva, Teresita M. Hogan, Linda M. Kampe
Venue: Journal of Medical Systems (1999)

Objectives: To conduct an Emergency Department (ED)-based treated prevalence study of heat morbidity and to estimate the rate and risk of heat morbid events for all Chicago MSA EDs (N &equals; 95&semi; 2.7 million visits per year). Methods: ED patient log data were compiled from 13 randomly selected hospitals located throughout the Chicago MSA during the 2 weeks of the 1995 heat disaster and from the same 2-week period in 1994 (controls). Measurements included: age, sex, date, and time of ED service, up to three ICD-9 diagnoses, and disposition. Results: Heat morbidity for Chicago MSA hospital EDs was calculated at 4,224 (95%CI &equals; 2964&minus;5488) cases. ED heat morbidity increased significantly 5 days prior to the first heat-related death. In 1995, there was an increase in the estimated relative risk for the city &equals; 3.85 and suburbs &equals; 1.89 over the control year of 1994. Conclusions: Real time ED-based computer automated databanks should be constructed to improve public health response to infectious or noninfectious outbreaks. Rapid area-wide M M tabulations can be used for advancing the effectiveness of community-based prevention programs, and anticipating hospital ED resource allocation.
Validation of HOL Proofs by Proof Checking
Authors: Wai Wong
Venue: Formal Methods in System Design (1999)

Formal proofs generated by mechanised theorem proving systems may consist of a large number of inferences. As these theorem proving systems are usually very complex, it is extremely difficult if not impossible to formally verify them. This calls for an independent means of ensuring the consistency of mechanically generated proofs. This paper describes a method of recording HOL proofs in terms of a sequence of applications of inference rules. The recorded proofs can then be checked by an independent proof checker. Also described in this paper is an implementation of a proof checker which is able to check a practical proof consisting of thousands of inference steps.
A semester-long project in CS 2
Authors: Christine Shannon
Venue: ACM SIGCSE Bulletin (1999)

Two years ago, like many others, our Computer Science program made the switch from Pascal to C++. As we had in the past, we continued the practice of teaching some principles of software engineering in the second course. Because students were working primarily on small projects, they were not seeing the need for the design techniques I was presenting. I decided to devise a semester-long project through which I could illustrate not only the use of standard data structures but also the need for employing principles of software engineering.
A Least-Squares Finite Element Analysis for Diffraction Problems
Authors: Gang Bao, Hongtao Yang
Venue: SIAM Journal on Numerical Analysis (1999)

The diffraction of a time harmonic wave incident upon a grating (or periodic) structure is treated by a least-squares finite element method that incorporates the jump conditions at interfaces into the objective functional. Two fundamental polarizations are considered. Coercivity of the quadratic functional is established and optimal discretization error estimates are obtained in both cases. The theoretical results indicate that, for sufficiently smooth interfaces, the error estimates are superior to those of standard finite element methods.
Modeling Service Activation in a Multimedia Environment
Authors: A. Lombardo, S. Palazzo, G. Schembra
Venue: International Journal of Network Management (1996)

The emergence of multimedia applications requires appropriate management and control activities to be provided and organized in an integrated framework. This article presents an architectural approach to the modeling of service activation processing in a multimedia environment.