ppxscal/embedding_network huggingface dataset:
A Test Methodology for High Performance MCMs
Authors: Thomas M. Storey, Bruce McWilliam
Venue: Journal of Electronic Testing: Theory and Applications (1997)

Satellite and avionics applications represent an ideal application for the tremendous performance, cost, space, and reliability benefits of MCMs. These advantages are only realized, however, if accompanied by an efficient test strategy which verifies defect-free fabrication. This paper describes a methodology developed to test high performance VLSI CMOS ICs that have been mounted onto a multi-chip silicon substrate. A test strategy, which addresses testing from the wafer level through to the populated substrate, is detailed. This strategy uses a combination of LSSD, AC LSSD-On-Chip Self Test, Deterministic Delay Fault Testing, and Design for Partitionability to ensure high test quality at a reasonable cost. The methodology is then contrasted to alternative approaches.
Optimization on instruction reorganization
Authors: Feipei Lai, Hung-Chang Lee
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

A pipelined processor increases its performance by partitioning an instruction into several separate operation steps. Several instructions can be executed in the pipeline in different pipe stages at the same time. Since the overlapped execution of instructions, the result of an instruction may be attempted to be used before it is available. One way to solve this problem is to schedule instructions at compiler time, thus the codes generated will be free from interlocks. The scheduling algorithm presented by [Hen 83, Gro 83] had significantly reduced the pipeline interlocks. With some modifications to distinguish the conflict condition, the algorithm will do better works at the same cost.
Empirical Support for Winnow and Weighted-MajorityAlgorithms: Results on a Calendar Scheduling Domain
Authors: Avrim Blum
Venue: Machine Learning (1997)

This paper describes experimental results on using Winnow and Weighted-Majority based algorithms on a real-world calendar scheduling domain. These two algorithms have been highly studied in the theoretical machine learning literature. We show here that these algorithms can be quite competitive practically, outperforming the decision-tree approach currently in use in the Calendar Apprentice system in terms of both accuracy and speed. One of the contributions of this paper is a new variant on the Winnow algorithm (used in the experiments) that is especially suited to conditions with string-valued classifications, and we give a theoretical analysis of its performance. In addition we show how Winnow can be applied to achieve a good accuracy/coverage tradeoff and explore issues that arise such as concept drift. We also provide an analysis of a policy for discarding predictors in Weighted-Majority that allows it to speed up as it learns.
Handling multiple data bases in document retrieval
Authors: Ian A. Macleod
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

There is no such thing as a standard document. Bibliographic information comes in a wide variety of formats. Existing retrieval systems handle different document styles either by creating an artificial document type or by providing different and independent data bases. Neither approach seems satisfactory. In this paper we describe a data model which we feel is more appropriate for document representation and show it can handle the multiple document type problem quite naturally.
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
Authors: Joseph Czyzyk, Robert Fourer, Sanjay Mehrotra
Venue: SIAM Journal on Scientific Computing (1998)

Most implementations of interior-point methods for linear programming rely on some form of elimination to solve the key equation system or systems at each iteration. Although these systems are typically very sparse, a substantial dense block often arises as the elimination proceeds. We describe a strategy that uses a serial "front-end" computer to carry out the sparse part of the elimination and a massively parallel processor to complete the elimination on the dense block. Through computational tests, we show that two such computers working together can solve hard linear programs much faster than either could alone. We conclude that our strategy is technically feasible now but that its components will have to be closer to the state of the art---in both serial and parallel processing---for it to be feasible in an economic sense.
Solutions to hidden terminal problems in wireless networks
Authors: Chane L. Fullmer, J. J. Garcia-Luna-Aceves
Venue: ACM SIGCOMM Computer Communication Review (1997)

The floor acquisition multiple access (FAMA) discipline is analyzed in networks with hidden terminals. According to FAMA, control of the channel (the floor) is assigned to at most one station in the network at any given time, and this station is guaranteed to be able to transmit one or more data packets to different destinations with no collisions. The FAMA protocols described consist of non-persistent carrier or packet sensing, plus a collision-avoidance dialogue between a source and the intended receiver of a packet. Sufficient conditions under which these protocols provide correct floor acquisition are presented and verified for networks with hidden terminals; it is shown that FAMA protocols must use carrier sensing to support correct floor acquisition. The throughput of FAMA protocols is analyzed for single-channel networks with hidden terminals; it is shown that carrier-sensing FAMA protocols perform better than ALOHA and CSMA protocols in the presence of hidden terminals.
Security management for administration and control of corporate-wide, diverse systems
Authors: Gerhard Schimpf
Venue: ACM SIGSAC Review (1997)

The importance of high level management of complex information systems, extending over several heterogeneous and geographically distributed computing platforms, is rapidly increasing. The design of a comprehensive and enterprise-wide security strategy, including the efficient administration of large user groups while maintaining the access rights of tens of thousands of users, is next to impossible without support from sophisticated and powerful software toolsets. In this paper we highlight some applications of the software product Security Administration Manager (SAM). With SAM, the staff responsible for security administration has at its disposal an object-oriented tool to monitor the security management of a complex IS-environment.
Secure transaction processing in firm real-time database systems
Authors: Binto George, Jayant Haritsa
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

Many real-time database applications arise in safety-critical installations and military systems where enforcing security is crucial to the success of the enterprise. A secure real-time database system has to simultaneously satisfy who requirements guarantee data security and minimize the number of missed transaction deadlines. We investigate here the performance implications, in terms of missed deadlines, of guaranteeing security in a real-time database system. In particular, we focus on the concurrency control aspects of this issue. Our main contributions are the following: First, we identify which among the previously proposed real-time concurrency control protocols are capable of providing protection against both direct and indirect (covert channels) means of unauthorized access to data. Second, using a detailed simulation model of a firm-deadline real-time database system, we profile the real-time performance of a representative set of these secure concurrency control protocols. Our experiments show that a prioritized optimistic concurrency control protocol. OPT-WAIT, provides the best overall performance. Third, we propose and evaluate a novel dual approach to secure transaction concurrency control that allows the real-time database system to simultaneously use different concurrency control mechanisms for guaranteeing security and for improving real-time performance. By appropriately choosing these different mechanisms, we have been able to design hybrid concurrency control algorithms that provide even better performance than OPT-WAIT.
Ada development system technical and performance requirements (with rationale)
Authors: Donald G. Krantz
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

This paper discusses requirements for Ada1 compilers and associated tools used for real-time embedded weapons systems (EWS) development. The requirements have been developed over a period of several years by embedded systems developers at Honeywell Inc. and Alliant Techsystems Inc. Requirements for the run time system, compiler-generated code, and host tools such as linkers are presented. A short rationale statement is provided with each specific requirement.
Precision Performances of Terminal Conditions for Short Time HorizonsForward-Looking Systems
Authors: Raouf Boucekkine, Michel Juillard, Pierre Malgrange
Venue: Computational Economics (1997)

In this paper we investigate theoretically the numerical bias due to the truncation of structurally infinite time forward-looking models, by the means of various terminal conditions. On a general multivariate optimal growth model, we first analytically confirm some well-known heuristic properties for certain extreme spectral cases. However, we show that the heuristic findings stated in the literature, relying on intermediate spectral configurations, lack theoretical basis as that they omit, among other relevant features, the crucial role of initial conditions: in this case, comparison criteria exclusively based on spectral considerations lack theoretical sense. Numerical evidence is proposed to illustrate this point and other related empirical findings are presented.
Differential and Numerically Invariant Signature Curves Applied to Object Recognition
Authors: Eugenio Calabi, Peter J. Olver, Chehrzad Shakiban, Allen Tannenbaum, Steven Haker
Venue: International Journal of Computer Vision (1998)

We introduce a new paradigm, the differential invariant signature curve or manifold, for the invariant recognition of visual objects. A general theorem of &Eacute;. Cartan implies that two curves are related by a group transformation if and only if their signature curves are identical. The important examples of the Euclidean and equi-affine groups are discussed in detail. Secondly, we show how a new approach to the numerical approximation of differential invariants, based on suitable combination of joint invariants of the underlying group action, allows one to numerically compute differential invariant signatures in a fully group-invariant manner. Applications to a variety of fundamental issues in vision, including detection of symmetries, visual tracking, and reconstruction of occlusions, are discussed.
Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
Authors: Svante Linusson
Venue: SIAM Journal on Discrete Mathematics (1997)

Given a list of n real numbers, one wants to decide whether every number in the list occurs at least k times. It will be shown that $\Omega(n\log n)$ is a sharp lower bound for the depth of an algebraic decision or computation tree solving this problem for a fixed k. For linear decision trees, the coefficient can be taken to be arbitrarily close to 1 (using the ternary logarithm). This is done by using the Björner--Lovász--Yao method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. The method will work also for the more general T-multiplicity problem when T is additive and cofinite. A formula for the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general will also be given.
Tracking Context Changes through Meta-Learning
Authors: Gerhard Widmer
Venue: Machine Learning (1997)

The article deals with the problem of learning incrementally (&lsquo;on-line&rsquo;) in domains where the target concepts are context-dependent, so that changes in context can produce more or less radical changes in the associated concepts. In particular, we concentrate on a class of learning tasks where the domain provides explicit clues as to the current context (e.g., attributes with characteristic values). A general two-level learning model is presented that effectively adjusts to changing contexts by trying to detect (via &lsquo;meta-learning&rsquo;) contextual clues and using this information to focus the learning process. Context learning and detection occur during regular on-line learning, without separate training phases for context recognition. Two operational systems based on this model are presented that differ in the underlying learning algorithm and in the way they use contextual information: METAL(B) combines meta-learning with a Bayesian classifier, while METAL(IB) is based on an instance-based learning algorithm. Experiments with synthetic domains as well as a number of &lsquo;real-world&rdquo; problems show that the algorithms are robust in a variety of dimensions, and that meta-learning can produce substantial increases in accuracy over simple object-level learning in situations with changing contexts.
Redundancy in model representation: a blessing or a curse?
Authors: Richard E. Nance, C. Michael Overstreet, Ernest H. Page
Venue: Proceedings of the 28th conference on Winter simulation (1996)

With the intent of dispelling the prevailing negative connotations associated with redundancy, we argue that redundancy can effect benefits in model specification as opposed to model execution. Sources of redundancy are classified as accidental or intentional, and several examples are given for each. The comparative benefits and detriments are discussed briefly, and for the most interesting source of redundancy that induced by a modeling methodology, we demonstrate that automated elimination of redundancy can actually improve the execution time. Although the set of models investigated is small, these results are encouraging for researchers in modeling methodologies using automated model diagnosis.
Oracle security
Authors: Marlene Theriault, William Heney
Venue:  (1998)

This book covers the field of Oracle security from simple to complex. It describes basic RDBMS security features (e.g., passwords, profiles, roles, privileges, synonyms) and includes many practical strategies for securing an Oracle system, developing auditing and backup plans, and using the Oracle Enterprise Manager and Oracle Security Server. Also touches on advanced security features, such as encryption, Trusted Oracle, and Internet and Web protection.
A non-fragmenting non-moving, garbage collector
Authors: Gustavo Rodriguez-Rivera, Michael Spertus, Charles Fiterman
Venue: Proceedings of the 1st international symposium on Memory management (1998)

One of the biggest disadvantages of non-moving collectors compared to moving collectors has been their limited ability to deal with memory fragmentation. In this paper, we describe two techniques to reduce fragmentation without the need for moving live data. The first technique reduces internal fragmentation in BiBoP (Big-Bag-of-Pages) like allocators. The second technique reduces external fragmentation using virtual memory culls available in most modern operating systems. It can also reduce the size of the heap after periods of great activity in long lived applications. These techniques have been successfully used in Geodesic Systems' Great Circle, a commercially-available conservative garbage collector. This paper describes these techniques, their implementation, and some experimental results.
Guaranteeing non-disruptiveness and real-time deadlines in an incremental garbage collector
Authors: Fridtjof Siebert
Venue: Proceedings of the 1st international symposium on Memory management (1998)

For Garbage Collection (GC) to be a generally accepted means of memory management it is required to prove its efficiency. This paper presents a scheme that guarantees that an incremental Garbage Collector will have completed its collection cycle before the system runs out of memory. Furthermore, it is shown that the work that has to be done by the collector in one incremental step is limited by a small constant depending on the percentage of total memory used by the application program. This result then allows a suitable trade-off between memory demand and GC overhead to be found.
Accurate power estimation for large sequential circuits
Authors: Joseph N. Kozhaya, Farid N. Najm
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

A power estimation approach is presented in which blocks of consecutive vectors are selected at random from a user-supplied realistic input vector set and the circuit is simulated for each block starting from an unknown state. This leads to two (upper and lower) bounds on the desired power value which can be quite tight (under 10% difference between the two in many cases). As a result, the power dissipation is obtained by simulating only a fraction of the potentially very large vector set.
Strong loss tolerance of electronic coin systems
Authors: Birgit Pfitzmann, Michael Waidner
Venue: ACM Transactions on Computer Systems (TOCS) (1997)

Untraceable electronic cash means prepaid digital payment systems, usually with offline payments, that protect user privacy. Such systems have recently been given considerable attention by both theory and development projects. However, in most current schemes, loss of a user device containing electronic cash implies a loss of money, just as with real cash. In comparison with credit schemes, this is considered a serious shortcoming. This article shows how untraceable electronic cash can be made loss tolerant, i.e., how the monetary value of the lost data can be recovered. Security against fraud and preservation of privacy are ensured; strong loss tolerance means that not even denial of recovery is possible. In particular, systems based on electronic coins are treated. We present general design principles and options and their instantiation in one concrete payment system. The measures are practical.
Proud: a fast sea-of-gates placement algorithm
Authors: Ren-Song Tsay, Ernest S. Kuh, Chi-Ping Hsu
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

We present a fast and effective placement algorithm which takes advantage of inherent scarcity in the connectivity specification. It solves repeatedly sparse linear equations by the SOR (Successive Over-Relaxation) method in a top-down hierarchy. The algorithm has been implemented; for a triple-metal-layer 100K sea-of-gates design with 26,000 instances, it takes 50 minutes on a VAX 8650 and yields excellent results.
Fast Nested Dissection for Finite Element Meshes
Authors: Shang-Hua Teng
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

We present a randomized O(nlog log n) time algorithm for constructing a recursive separator decomposition for well-shaped meshes in two and three dimensions. Our algorithm takes O(nlog log n) time while previous algorithms require $\Theta$(nlog n) time. It uses techniques from probability theory, computational geometry, and graph theory. The new algorithm has an application in the solution of sparse linear systems that arise in finite element calculations. In particular, it can be used to design O(nlog log n) time algorithms for finding a provably good nested-dissection ordering for 3D finite element systems. It can also be used to improve the construction of 3D point location structures, which are useful in hierarchical methods such as the multigrid and multilevel domain decompositions.
Reverse engineering and system renovation&mdash;an annotated bibliography
Authors: M. G. J. van den Brand, P. Klint, C. Verhoef
Venue: ACM SIGSOFT Software Engineering Notes (1997)

To facilitate research in the field of reverse engineering and system renovation we have compiled an annotated bibliography. We put the contributions not only in alphabetical order but also grouped by topic so that readers focusing on a certain topic can read their annotations in the alphabetical listing. We also compiled an annotated list of pointers to information about reverse engineering and system renovation that can be reached via Internet. For the sake of ease we also incorporated a brief introduction to the field of reverse engineering.
Multi-Path Reasoning in a Database
Authors: Dariush Navabi, Lois M. L. Delcambre
Venue: Journal of Intelligent Information Systems (1997)

Rules have been used in a database context for several purposes: deductive database queries, active database triggers, and production system programs. Exploring the search space for non-deterministic rule programs, however, has generally been available only in large monolithic systems intended for artificial intelligence applications. The goal of this research is to provide multi-path reasoning for non-deterministic rule programs in a database environment. The motivation for this work includes the increasing use of database-style triggers to assist data-intensive applications, e.g., the human genome project and the Intelligent Integration of Information (I^3) Program.A non-deterministic rule program is one where there is more than one terminal state. Such programs are generally not considered appropriate for database queries where the focus is on rules programs or techniques that guarantee a unique fixed point. But non-deterministic programs are commonly used for various heuristic search problems such as the traveling salesperson problem. With a non-deterministic program, it is particularly important to be flexible about the order in which the search space is explored because exhaustive search is generally not feasible. The contributions of this research are: the representation of the multi-path search tree within a database and the ability for the problem solver to control the search process for a non-deterministic rule program.
Hierarchical Delay Test Generation
Authors: C. P. Ravikumar, Nitin Agrawal, Parul Agarwal
Venue: Journal of Electronic Testing: Theory and Applications (1997)

Delay testing is used to detect timing errors in a digital circuit. In this paper, we report a tool called MODET for automatic test generation for path delay faults in modular combinational circuits. Our technique uses precomputed robust delay tests for individual modules to compute robust delay tests for the module-level circuit. We present a longest path theorem at the module level of abstraction which specifies the requirements for path selection during delay testing. Based on this theorem, we propose a path selection procedure in module-level circuits and report efficient algorithms for delay test generation. MODET has been tested against a number of hierarchical circuits with impressive speedups in relation to gate-level test generation.