ppxscal/embedding_network huggingface dataset:
Pfinder: Real-Time Tracking of the Human Body
Authors: Christopher Richard Wren, Ali Azarbayejani, Trevor Darrell, Alex Paul Pentland
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Pfinder is a real-time system for tracking people and interpreting their behavior. It runs at 10Hz on a standard SGI Indy computer, and has performed reliably on thousands of people in many different physical locations. The system uses a multiclass statistical model of color and shape to obtain a 2D representation of head and hands in a wide range of viewing conditions. Pfinder has been successfully used in a wide range of applications including wireless interfaces, video databases, and low-bandwidth coding.
Path-based next trace prediction
Authors: Quinn Jacobson, Eric Rotenberg, James E. Smith
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

The trace cache has been proposed as a mechanism for providing increased fetch bandwidth by allowing the processor to fetch across multiple branches in a single cycle. But to date predicting multiple branches per cycle has meant paying a penalty in prediction accuracy. We propose a next trace predictor that treats the traces as basic units and explicitly predicts sequences of traces. The predictor collects histories of trace sequences (paths) and makes predictions based on these histories. The basic predictor is enhanced to a hybrid configuration that reduces performance losses due to cold starts and aliasing in the prediction table. The Return History Stack is introduced to increase predictor performance by saving path history information across procedure call/returns. Overall, the predictor yields about a 26% reduction in misprediction rates when compared with the most aggressive previously proposed, multiple-branch-prediction methods.
Isotach Networks
Authors: Paul F. Reynolds,  Jr., Craig Williams, Raymond R. Wagner,  Jr.
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We introduce a class of networks called isotach networks designed to reduce the cost of synchronization in parallel computations. Isotach networks maintain an invariant that allows each process to control the logical times at which its messages are received and consequently executed. This control allows processes to pipeline operations without sacrificing sequential consistency and to send isochrons, groups of operations that appear to be received and executed as an indivisible unit. Isochrons allow processes to execute atomic actions without locks. Other uses of isotach networks include ensuring causal message delivery and consistency among replicated data. Isotach networks are characterized by this invariant, not by their topology. They can be implemented in a wide variety of configurations, including NUMA (nonuniform memory access) multiprocessors. Empirical and analytic studies of isotach synchronization techniques show that they outperform conventional techniques, in some cases by an order of magnitude or more. Results presented here assume fault-free systems; we are exploring extension to selected failure models.
Specification and Management of Interdependent Data in OperationalSystems and Data Warehouses
Authors: Dimitrios Georgakopoulos, George Karabatis, Sridhar Gantimahapatruni
Venue: Distributed and Parallel Databases (1997)

({\it Inter}){\it Dependent} objects include data replicated or cached in multiple database systems, data collected and summarized in data warehouses for analysis, planning, and decision support, as well as any other category of objects whose states are related and they are maintained in different information systems. In this paper we discuss dependencies between objects in an environment consisting of operational systems and a data warehouse, and describe their specification and enforcement. To specify object dependencies we introduce {\it Object\ Dependency\ Descriptors} ({\it ObjectDDs}). These describe the relationships between dependent objects, and define how much inconsistency between original objects and their replicas/collections/summaries can be tolerated before it is necessary to restore their consistency. Object dependencies are enforced by {\it extended\ transactions} designed specifically for evaluating if dependent objects satisfy their specified relationships, evaluating whether possible inconsistencies can be tolerated, and (if not) restoring consistency. To describe the transactional behavior of such {\it consistency\ evaluation} and {\it restoration} transactions we use{\it Transaction\ Dependency\ Descriptors} ({\it TransactionDDs}) . TransactionDDs define the transactional relationships between consistency evaluation and restoration (asynchronous) transactions, as well as the relationships between such asynchronous transactions and regular (synchronous) transactions executed directly by applications. To automatically maintain the consistency of dependent objects, we propose the concept of a {\it Dependency\ Management\ System} ({\it DMS}). A DMS monitors dependent objects, evaluates object consistency, and schedules and controls consistency restoration transactions to keep dependent objects within acceptable consistency levels. We describe key components in the DMS architecture, and a relatively simple implementation involving straightforward extensions in a relational DBMS.
Query by templates: a generalized approach for visual query formulation for text dominated databases
Authors: Arijit Sengupta, Andrew Dillon
Venue: Proceedings of the IEEE international forum on Research and technology advances in digital libraries (1997)

The WWW has a great potential of evolving into a globally distributed digital document library. The primary use of such a library is to retrieve information quickly and easily. Because of the size of these libraries, simple keyword searches often result in too many matches. More complex searches involving boolean expressions are difficult to formulate and understand. This paper describes QBT (Query By Templates), a visual method for formulating queries for structured document databases modeled with SGML. Based on Zloof's QBE (Query By Example), this method incorporates the structure of the documents for composing powerful queries. The goal of this technique is to design an interface for querying structured documents without prior knowledge of the internal structure. This paper describes the rationale behind QBT, illustrates the query formulation principles using QBT, and describes results obtained from a usability analysis on a prototype implementation of QBT on the Web using the Java(TM) programming language.
Router plugins: a software architecture for next generation routers
Authors: Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner
Venue: Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication (1998)

Present day routers typically employ monolithic operating systems which are not easily upgradable and extensible. With the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion. We have designed and implemented a high performance, modular, extended integrated services router software architecture in the NetBSD operating system kernel. This architecture allows code modules, called plugins, to be dynamically added and configured at run time. One of the novel features of our design is the ability to bind different plugins to individual flows; this allows for distinct plugin implementations to seamlessly coexist in the same runtime environment. High performance is achieved through a carefully designed modular architecture; an innovative packet classification algorithm that is both powerful and highly efficient; and by caching that exploits the flow-like characteristics of Internet traffic. Compared to a monolithic best-effort kernel, our implementation requires an average increase in packet processing overhead of only 8%, or 500 cycles/2.1ms per packet when running on a P6/233.
Buffered Clock Tree Synthesis with Non-Zero Clock Skew Schedulingfor Increased Tolerance to Process Parameter Variations
Authors: Josè Luis Neves, Eby G. Friedman
Venue: Journal of VLSI Signal Processing Systems (1997)

An integrated top-down design system is presented in this paper for synthesizing clock distribution networks for application to synchronous digital systems. The timing behavior of a synchronous digital circuit is obtained from the register transfer level description of the circuit, and used to determine a non-zero clock skew schedule which reduces the clock period as compared to zero skew-based approaches. Concurrently, the permissible range of clock skew for each local data path is calculated to determine the maximum allowed variation of the scheduled clock skew such that no synchronization failures occur. The choice of clock skew values considers several design objectives, such as minimizing the effects of process parameter variations, imposing a zero clock skew constraint among the input and output registers, and constraining the permissible range of each local data path to a minimum value.The clock skew schedule and the worst case variation of the primary process parameters are used to determine the hierarchical topology of the clock distribution network, defining the number of levels and branches of the clock tree and the delay associated with each branch. The delay of each branch of the clock tree is physically implemented with distributed buffers targeted in CMOS technology using a circuit model that integrates short-channel devices with the signal waveform shape and the characteristics of the clock tree interconnect. A bottom-up approach for calculating the worst case variation of the clock skew due to process parameter variations is integrated with the top-down synthesis system. Thus, the local clock skews and a clock distribution network are obtained which are more tolerant to process parameter variations.This methodology and related algorithms have been demonstrated on several MCNC/ISCAS-89 benchmark circuits. Increases in system-wide clock frequency of up to 43% as compared with zero clock skew implementations are shown. Furthermore, examples of clock distribution networks that exploit intentional localized clock skew are presented which are tolerant to process parameter variations with worst case clock skew variations of up to 30%.
Tolerating Concept and Sampling Shift in Lazy Learning UsingPrediction Error Context Switching
Authors: Marcos Salganicoff
Venue: Artificial Intelligence Review (1997)

In their unmodified form, lazy-learning algorithms may have difficulty learning and tracking time-varying input/output function maps such as those that occur in concept shift. Extensions of these algorithms, such as Time-Windowed forgetting (TWF), can permit learning of time-varying mappings by deleting older exemplars, but have decreased classification accuracy when the input-space sampling distribution of the learning set is time-varying. Additionally, TWF suffers from lower asymptotic classification accuracy than equivalent non-forgetting algorithms when the input sampling distributions are stationary. Other shift-sensitive algorithms, such as Locally-Weighted forgetting (LWF) avoid the negative effects of time-varying sampling distributions, but still have lower asymptotic classification in non-varying cases. We introduce Prediction Error Context Switching (PECS) which allows lazy-learning algorithms to have good classification accuracy in conditions having a time-varying function mapping and input sampling distributions, while still maintaining their asymptotic classification accuracy in static tasks. PECS works by selecting and re-activating previously stored instances based on their most recent consistency record. The classification accuracy and active learning set sizes for the above algorithms are compared in a set of learning tasks that illustrate the differing time-varying conditions described above. The results show that the PECS algorithm has the best overall classification accuracy over these differing time-varying conditions, while still having asymptotic classification accuracy competitive with unmodified lazy-learners intended for static environments.
An efficient statistical analysis methodology and its application to high-density DRAMs
Authors: Sang-Hoon Lee, Chang-Hoon Choi Jeong-Taek Kong Wong-Seong Lee Jei-Hwan Yoo
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

In this work, a new approach for the statistical worst case of full-chip circuit performance and parametric yield prediction, using both the Modified-Principal Component Analysis (MPCA) and the Gradient Method (GM), is proposed and verified. This method enables designers not only to predict the standard deviations of circuit performances but also track the circuit performances associated with the process shift by measuring E-tests. This new method is validated experimentally during the development and production of high density DRAMs. Our contributions to statistical circuit design are as follows: 1) a method for directly generating a parametrized model associated with electrical test data 2) the first application to high density DRAMs using the true statistical method
The performance of the concurrent fault simulation algorithms in MOZART
Authors: Silvano Gai, Pier Luca Montessoro, Fabio Somenzi
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

MOZART is a concurrent fault simulator for large circuits described at the RT, functional, gate, and switch levels. Performance is gained by means of techniques aimed at the reduction of unnecessary activity. Two such techniques are levelized two-pass simulation, which minimizes the number of events and evaluations, and list event scheduling, which allows optimized processing of simultaneous (fraternal) events for concurrent machines. Moreover, efficient handling of abnormally large or active faulty machines can dramatically improve fault simulator performance. These and related issues are discussed in this paper: both analytical and experimental evidence is provided for the effectiveness of the solutions adopted in MOZART. A new performance metric is introduced for fault simulation. This is based on comparison with the serial algorithm and is more accurate than those used up till now.
APLIM&mdash;applied linear interactive models
Authors: J. I. Ansell, A. M. Sykes
Venue: ACM SIGAPL APL Quote Quad (1985)

Regression is the most frequently and widely applied technique in Statistics. The field of applications range from experimental design (historically in agriculture) to financial modelling. The technique has been greatly enhanced by the radical approach due to Nelder and Wedderburn. Their approach unified many apparently disparate applications of linear models to produce the Generalized Linear Model. Others have subsequently expanded their work. The paper briefly reviews this work indicating the main features which should be of interest to practitioners in many disciplines, e.g. education, sociology, medicine, economics, and the sciences. The original software developed from this approach was written in FORTRAN which the present authors believe constrained the development of a truly interactive package. APLIM, the first commercial APL version of the Generalized Linear Model is described. Stress is placed on a &ldquo;user friendly&rdquo; approach throughout the package. The authors have used APLIM to teach undergraduate students at the College Generalized Models, and a taste of their present teaching approach is given. The software has already been tested internally at the college by allowing other research workers access to it. The authors are at present working on a version for the IBM PC, aided by IBM UK.
Integral Solutions of Linear Complementarity Problems
Authors: William H. Cunningham, James F. Geelen
Venue: Mathematics of Operations Research (1998)

We characterize the class of integral square matrices M having the property that for every integral vector q the linear complementarity problem with data M, q has only integral basic solutions. These matrices, called principally unimodular matrices?, are those for which every principal nonsingular submatrix is unimodular. As a consequence, we show that if M is rank-symmetric and principally unimodular, and q is integral, then the problem has an integral solution if it has a solution. Principal unimodularity can be regarded as an extension of total unimodularity, and our results can be regarded as extensions of well-known results on integral solutions to linear programs. We summarize what is known about principally unimodular symmetric and skew-symmetric matrices.
MCM Test Strategy Synthesis from Chip Test and Board TestApproaches
Authors: Andrew Flint
Venue: Journal of Electronic Testing: Theory and Applications (1997)

Chip test practices such as functional test and Bist, and their relevance to MCM testing are summarized. Drawbacks of using these techniques, for some MCMs, are presented. Board test practices such as in-circuit test and boundary-scan, are summarized; the advantages of incorporating board test techniques for certain MCMs are given. Test strategies are categorized and compared. Appropriate MCM test equipment is discussed. Examples of using chip, board, and hybrid test approaches are then given.
Weirton Steel&mdash;Ada in process control
Authors: Kenneth L. James, Gregory J. Saul, David L. Shroads, William F. Zickefoose
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Transformation of a totally mechanically operated hot strip steel rolling mill with no previous automation into one of the most automated rolling mills in the world. Most of the real-time software was written in Ada (500K+ LOC)
ProbView: a flexible probabilistic database system
Authors: Laks V. S. Lakshmanan, Nicola Leone, Robert Ross, V. S. Subrahmanian
Venue: ACM Transactions on Database Systems (TODS) (1997)

Probability theory is mathematically the best understood paradigm for modeling and manipulating uncertain information. Probabilities of complex events can be computed from those of basic events on which they depend, using any of a number of strategies. Which strategy is appropriate depends very much on the known interdependencies among the events involved. Previous work on probabilistic databases has assumed a fixed and restrictivecombination strategy (e.g., assuming all events are pairwise independent). In this article, we characterize, using postulates, whole classes of strategies for conjunction, disjunction, and negation, meaningful from the viewpoint of probability theory. (1) We propose a probabilistic relational data model and a genericprobabilistic relational algebra that neatly captures various strategiessatisfying the postulates, within a single unified framework. (2) We show that as long as the chosen strategies can be computed in polynomial time, queries in the positive fragment of the probabilistic relational algebra have essentially the same data complexity as classical relational algebra. (3) We establish various containments and equivalences between algebraic expressions, similar in spirit to those in classical algebra. (4) We develop algorithms for maintaining materialized probabilistic views. (5) Based on these ideas, we have developed a prototype probabilistic database system called ProbView on top of Dbase V.0. We validate our complexity results with experiments and show that rewriting certain types of queries to other equivalent forms often yields substantial savings.
An Algorithm for Continuous Type Optimal LocationProblem
Authors: Changyu Wang, Chengyun Gao, Zhenjun Shi
Venue: Computational Optimization and Applications (1997)

In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn&lsquo;t everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper have smaller amount of computation, quicker convergence rate than the gradient method and conjugate direction method in some sense.
Real-Time Transaction Scheduling: A Framework for SynthesizingStatic and Dynamic Factors
Authors: Sharma Chakravarthy, Dong-Kweon Hong, Theodore Johnson
Venue: Real-Time Systems (1998)

Real-time databases are poised to be an important component of complex embedded real-time systems. In real-time databases (as opposed to real-time systems), transactions must satisfy the ACID properties in addition to satisfying the timing constraints specified for each transaction (or task). Although several approaches have been proposed to combine real-time scheduling and database concurrency control methods, to the best of our knowledge, none of them provide a framework for taking into account the dynamic cost associated with aborts, rollbacks, and restarts of transactions. In this paper, we propose a framework in which both static and dynamic costs of transactions can be taken into account. Specifically, we present: i) a method for pre-analyzing transactions based on the notion of branch-points for data accessed up to a branch point and predicting expected data access to be incurred for completing the transaction, ii) a formulation of cost that includes static and dynamic factors for prioritizing transactions, iii) a scheduling algorithm which uses the above two, and iv) simulation of the algorithm for several operating conditions and workload. Our dynamic priority assignment policy (termed the cost conscious approach or CCA) adapts well to fluctuations in the system load without causing excessive numbers of transaction restarts. Our simulations indicate that i) CCA performs better than the EDF-HP algorithm for both soft and firm deadlines, ii) CCA is more fair than EDF-HP, iii) CCA is better than EDF-CR for soft deadline, even though CCA requires and uses less information, and iv) CCA is especially good for disk-resident data.
Processing free-text input to obtain a database of medical information
Authors: Emile C. Chi, Carol Friedman, Naomi Sager, Margaret S. Lyman
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

The Linguistic String Project of New York University has developed computer programs that convert the information in free-text documents of a technical specialty into a structured form suitable for mapping into a relational database. The processing is based upon the restrictions on the use of language that are characteristic of the subject matter and the document type. These restrictions are summarized in a &ldquo;sublanguage grammar&rdquo; that provides a set of word classes and formulas corresponding to the objects and relations of interest in the domain. The programs are independent of the particular sublanguage grammar employed. The application to narrative patient records will be described and the applicability of the methods to other domains discussed.