ppxscal/embedding_network huggingface dataset:
Symbolic evaluation of performance models for tradeoff visualization
Authors: Jeffrey Walrath, Ranga Vemuri
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Often during the design process, it is necessary to analyzethe effects of tradeoff among various performance attributesof the design.Visual representations in the formof plots, graphs, and tables are typically used.These visualizationscan be generated using different applications suchas MatLab®, Mathematica®, Excel®, and so forth.Inorder to use these tools, performance equations for the designmust be rendered in an equational form with only afew variables, usually 2-3.However, performance modelsusually consist of a large number of attributes and evaluzationprocedures, typically written using the full power of aprogramming or hardware description language.We introducea symbolic evaluation procedure to simplify performancemodels.Given partial data, such evaluation yields a residualperformance model which is simpler than the original model.Symbolic evaluation can be effectively used to obtain residualperformance equations in terms of the variables whosetradeoff visualization is of interest to the user.
On-Line Fault Monitoring
Authors: J. J. Stiffler
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Sequoia&lsquo;s fault-tolerant computers were designed subject to some rather rigid constraints: No single hardware malfunction can generate an undetected error; an integrated circuit is a &ldquo;black box&rdquo; that can fail in arbitrary ways, affecting an arbitrary subset of input and output signals; faults can be transient or intermittent with arbitrary durations and repetition intervals. Moreover, the incremental hardware to be used to achieve these goals was to be kept to a minimum. The resulting computers do, to a very large extent, satisfy these constraints. To achieve this, a combination of fault-monitoring techniques was used, including: Bit and nibble error-correcting and error-detecting codes; byte parity codes with orthogonal partitioning; cyclic-residue codes on I/O data transfers; codes designed to protect against address counter overruns on I/O transfers; lossless control-signal compactors. The nature and rationale for these various fault monitors is described as well as the analytical and testing techniques used to estimate the resulting coverage.
An Effective Multi-Chip BIST Scheme
Authors: Yervant Zorian, Hakim Bederr
Venue: Journal of Electronic Testing: Theory and Applications (1997)

This paper addresses the general problem of module level test of assembled Multi-Chip Modules (MCMs) and specifically the performance test of such modules. It presents a novel solution based-on built-in self-test (BIST). This solution augments the conventional single-chip BIST approach, which is used to produce individual good dies, to an effective multi-chip BIST solution. The multi-chip BIST puts the entire module in a self-test mode. The self-test mode not only provides effective detection of static and dynamic faults, but also identifies the failed elements, i.e., bad dies or substrate. The multi-chip self-test scheme is based on pseudo-random test generation and uses multi-signature evaluation. The hardware design of multi-chip and single-chip self-test blocks is combined under one common architecture called the Dual BIST Architecture. The paper introduces the Dual BIST Architecture and demonstrates a set of design configurations to implement it. The presented BIST solution provides a reliable static and dynamic test at the module as well as the bare die levels.
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
Authors: Dario Bini, Victor Y. Pan
Venue: SIAM Journal on Computing (1998)

Surprisingly simple corollaries from the Courant--Fischer minimax characterization theorem enable us to devise a very effective algorithm for the evaluation of a set S interleaving the set E of the eigenvalues of an n X n real symmetric tridiagonal (rst) matrix Tn (as well as a point that splits E into two subsets of comparable cardinalities). Furthermore, we extend this algorithm so as to approximate all the n eigenvalues of Tn at nearly optimal sequential and parallel cost, that is, at the cost of staying within polylogarithmic factors from the straightforward lower bounds. The resulting improvement of the known processor bound in NC algorithms for the rst-eigenproblem is roughly by factor n. Our approach extends the previous works [M. Ben-Or and P. Tiwari, J. Complexity, 6(1990), pp. 417--442] and [M. Ben-Or et al., SIAM J. Comput., 17(1988), pp. 1081--1092] for the approximation of the zeros of a polynomial having only real zeros, and our algorithm leads to an alternative and simplified derivation of the known record parallel and sequential complexity estimates for the latter problem.
An Adaptive Object-Oriented Approach to Integration and Access ofHeterogeneous Information Sources
Authors: Ling Liu, Calton Pu
Venue: Distributed and Parallel Databases (1997)

A large-scale interoperable database system operating in a dynamic environment should provide Uniform access to heterogeneous information sources, Scalability to the growing number of information sources, Evolution and Composability of software and information sources, and Autonomy of participants, both information consumers and information producers. We refer to these set of properties as the USECA properties [29]. To address the research issues presented by such systems in a systematic manner, we introduce the Distributed Interoperable Object Model (DIOM). DIOM promotes an adaptive approach to interoperation via intelligent mediation [46, 47], aimed at enhancing the robustness and scalability of the services provided for integrating and accessing heterogeneous information sources. DIOM&lsquo;s main features include (1) the recursive construction and organization of information access through a network of application-specific mediators, (2) the explicit use of interface composition meta operations (such as specialization, generalization, aggregation, import and hide) to support the incremental design and construction of consumer&lsquo;s domain query model, (3) the deferment of semantic heterogeneity resolution to the query result assembly time instead of before or at the time of query formulation, and (4) the systematic development of the query mediation framework and the procedure of each query processing step from query routing, query decomposition, parallel access planning, query translation to query result assembly. To make DIOM concrete, we outline the DIOM-based information mediation architecture, which includes important auxiliary services such as domain-specific metadata library and catalog functions, object linking databases, and associated query services. Several practical examples and application scenarios illustrate the flavor of DIOM query mediation framework and the usefulness of DIOM in multi-database query processing.
Reengineering class hierarchies using concept analysis
Authors: Gregor Snelting, Frank Tip
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved into a derived class. Furthermore, different subsets of C's members may be accessed from different C-instances, indicating that it might be appropriate to split C into multiple classes. We present a framework for detecting and remediating such design problems, which is based on concept analysis. Our method analyzes a class hierarchy along with a set of applications that use it, and constructs a lattice that provides valuable insights into the usage of the class hierarchy in a specific context. We show how a restructured class hierarchy can be generated from the lattice, and how the lattice can serve as a formal basis for interactive tools for redesigning and restructuring class hierarchies.
Developing a real-time emulation/simulation capability for the control architecture to the RAMP FMS
Authors: Wayne J. Davis, Joseph G. Macro, Andrew L. Brook, Michael S. Lee, Guoyan S. Zhou
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper first discusses an object-oriented, control architecture and then applies the architecture to produce a real-time software emulator for the Rapid Acquisition of Manufactured Parts (RAMP) flexible manufacturing system (FMS). In specifying the control architecture, the coordinated object is first defined as the primary modeling element. These coordinated objects are then integrated into a Recursive, Object-Oriented Coordination Hierarchy. A new simulation methodology, the Hierarchical Object-Oriented Programmable Logic Simulator, is then employed to model the interactions among the coordinated objects. The final step in implementing the emulator is to distribute the models of the coordinated objects over a network of computers and to synchronize their operation to a real time clock. Specialized displays have also been developed to allow one to monitor the detailed, real-time operation of each coordinated object. The research will also convert the real-time emulation model into a real-time simulation model for the RAMP FMS. Both the real-time emulation and simulation capabilities will be demonstrated at the presentation.
Skew Angle Detection of Digitized Indian Script Documents
Authors: B. B. Chaudhuri, U. Pal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Skew angle detection of scanned documents containing most popular Indian scripts (Devnagari and Bangla) is considered. Most characters in these scripts have horizontal lines at the top, called head lines. The character head lines mostly join one another in a word and the word appears as a single component. In the proposed method the components are at first labeled. The upper envelope of a component is found by columnwise scanning from an imaginary line above the component. Portions of upper envelope satisfying the properties of digital straight line are detected. They are clustered as belonging to single text lines. Estimates from individual clusters are combined to get the skew angle. Apart from accuracy and efficiency, an advantage of the method is that character segmentation and zone detection can be readily done from head line information, which is useful in Optical Character Recognition approaches of these scripts.
On the completeness of object-creating database transformation languages
Authors: Jan Van Den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens
Venue: Journal of the ACM (JACM) (1997)

Object-oriented applications of database systems require database transformations involoving nonstandard functionalities such as set manipulation and object creation, that is, the introduction of new domain elements. To deal with thse functionalities, Abiteboul and Kanellakis [1989] introduced the &ldquo;determinate&rdquo; transformations as a generalization of the standard domain-preserving transformations. The obvious extensions of complete standard database programming languages, however, are not complete for the determinate transformations. To remedy this mismatch, the &ldquo;constructive&rdquo; transformations are proposed. It is shown that the constructive transformations are precisely the transformations that can be expressed in said extensions of complete standard languages. Thereto, a close correspondence between object creation and the construction of hereditarily finite sets is established.A restricted version of the main completeness result for the case where only list manipulations are involved is also presented.
The instruction parsing microarchitecture of the CVAX microprocessor
Authors: David W. Archer
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

CVAX is a single chip, CMOS VLSI VAX microprocessor. Several microarchitectural innovations helped achieve the desired performance goal of this machine. In particular, the instruction parsing and prefetching mechanism is different from other VAX implementations. This new instruction parsing microarchitecture is discussed in this paper.
Motivating the Church-Turing thesis in the twenty-first century
Authors: R. Gregory Taylor
Venue: ACM SIGCSE Bulletin (1998)

Theory of Computation students frequently fail to appreciate the significance of the Church---Turing Thesis for one of two reasons. First, there is a tendency, on the part of students, to regard Church---Turing as tautologous and, consequently, devoid of important content. Second, there is a contrary impulse to view Church---Turing as unmotivated or even implausible. We describe our experience using simulation software in an effort to combat these two tendencies.
A Teaching Strategy for Memory-Based Control
Authors: John W. Sheppard, Steven L. Salzberg
Venue: Artificial Intelligence Review (1997)

Combining different machine learning algorithms in the same system can produce benefits above and beyond what either method could achieve alone. This paper demonstrates that genetic algorithms can be used in conjunction with lazy learning to solve examples of a difficult class of delayed reinforcement learning problems better than either method alone. This class, the class of differential games, includes numerous important control problems that arise in robotics, planning, game playing, and other areas, and solutions for differential games suggest solution strategies for the general class of planning and control problems. We conducted a series of experiments applying three learning approaches &ndash; lazy Q-learning, k-nearest neighbor (k-NN), and a genetic algorithm &ndash; to a particular differential game called a pursuit game. Our experiments demonstrate that k-NN had great difficulty solving the problem, while a lazy version of Q-learning performed moderately well and the genetic algorithm performed even better. These results motivated the next step in the experiments, where we hypothesized k-NN was having difficulty because it did not have good examples &ndash; a common source of difficulty for lazy learning. Therefore, we used the genetic algorithm as a bootstrapping method for k-NN to create a system to provide these examples. Our experiments demonstrate that the resulting joint system learned to solve the pursuit games with a high degree of accuracy &ndash; outperforming either method alone &ndash; and with relatively small memory requirements.
Modeling and simulation enabling technologies for military applications
Authors: Alex F. Sisti, Steven D. Farr
Venue: Proceedings of the 28th conference on Winter simulation (1996)

While there has been much attention paid lately to the field of Modeling and Simulation as a general tool to be used in specific and well-founded application areas, little has been done to address those broad technology areas that enable such application-oriented simulations to be more easily constructed, run and analyzed. This paper deals with the wide variety of research issues in simulation science being addressed by Government, academia and industry, and their application to the military domain; specifically, to the problems of the Intelligence analyst
Simulation model decomposition by factor analysis
Authors: Kenneth W. Bauer, Bipin Kochar, Joseph J. Talavage
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper offers a solution to the simulation model decomposition problem discussed briefly in Overstreet and Nance [1] and elaborated in detail in Overstreet [2]. The solution scheme involves the use of principal components analysis. We offer an example of the technique on a simple directed graph and then demonstrate the method on a small model given in Overstreet [2].
Subspace Orthogonalization for Substructuring Preconditioners for Non-self-adjoint Elliptic Problems
Authors: Gerhard Starke
Venue: SIAM Journal on Scientific Computing (1997)

For non-self-adjoint elliptic boundary value problems which are preconditioned by a substructuring method, i.e., nonoverlapping domain decomposition, we introduce and study the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods, the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) subspace, in this case the edge and vertex unknowns with respect to the partitioning into subdomains. We discuss the convergence properties of these iteration schemes and compare them with Krylov methods applied to the full preconditioned system.
A new approach to the pin assignment problem
Authors: Xianji Yao, Massaki Yamada, C. L. Liu
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

In this paper we study a pin assignment problem for macro-cells which is motivated by the goal of integrating the placement and routing steps in the physical design of VLSI circuits. We assume that the macro-cells have already been placed. In the mean time, we assume that the design of the macro-cells is still &ldquo;soft&rdquo; in that although the pins in a cell have a fixed relative order, they can be shifted around the boundary of the cell. A new algorithm was developed to determine the optimal shiftings of the pins so that a weighted sum of the lengths of the connecting wires is minimum. Good experimental results were obtained.
Transform domain techniques for efficient extraction of substrate parasitics
Authors: Ranjit Gharpurey, Srinath Hosur
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

A semi-analytical technique for computation of the frequency- behavior of silicon substrates is demonstrated. The technique uses a boundary element approach, that utilizes the complex substrate Green Function and the two-dimensional Fast Fourier Transform. The resultant dense system matrix is sparsified by application of orthogonal transform operators on the matrix representing the system. Three transform operators are evaluated for this purpose - the Discrete Cosine Transform (DCT), the Discrete Wavelet Transform (DWT) and the Discrete Hadamard Transform (DHT). The application of any one of these operators provides a rigorous sparsification technique, which significantly reduces the computation time. The Green Function is computed in the two layers at the top of the substrate. This is done so that contacts in the oxide layer can be included in the substrate model, along with contacts in the silicon substrate. Hence, substrate loss terms in metal interconnect lines and in line-to- line interaction models, can be evaluated using this technique. Extraction of a simple circuit-simulator compatible model from frequency-domain data is discussed.
Object identity as a query language primitive
Authors: Serge Abiteboul, Paris C. Kanellakis
Venue: Journal of the ACM (JACM) (1998)

We demonstrate the power of object identities (oids) as a database query language primitive. We develop an object-based data model, whose structural part generalizes most of the known complex-object data models: cyclicity is allowed in both its schemas and instances. Our main contribution is the operational part of the data model, the query language IQL, which uses oids for three critical purposes: (1) to represent data-structures with sharing and cycles, (2) to manipulate sets, and (3) to express any computable database query. IQL can be type checked, can be evaluated bottom-up, and naturally generalizes most popular rule-based languages. The model can also be extended to incorporate type inheritance, without changes to IQL. Finally, we investigate an analogous value-based data model, whose structural part is founded on regular infinte trees and whose operational part is IQL.
Architecture issues in multimedia storage systems
Authors: Banu Özden, Rajeev Rastogi, Avi Silberschatz
Venue: ACM SIGMETRICS Performance Evaluation Review (1997)

Next generation storage systems will need to provide support for both textual data and other types of multimedia data (e.g., images, video, audio). These two types of data differ in their characteristics, and hence require different techniques for their organization and management. In this paper, we provide an overview of 1) how storage systems can be architectured to support multimedia data, and 2) what are the main challenges in devising new algorithms to manage multimedia data. In order to provide rate guarantees for continuous media data, an admission control scheme must be employed that determines, for each client, whether there are sufficient resources available to service that client. To maximize the number of clients that can be admitted concurrently, the various system resources must be allocated and scheduled carefully. In terms of disks, we use algorithms for retrieving/storing data from/to disks that reduce seek latency time and eliminate rotational delay, thereby providing high throughput. In terms of main-memory, we use buffer management schemes that exploit the sequential access patterns for continuous media data, thereby resulting in efficient replacement of buffer pages from the cache.
Machine Learning for the Detection of Oil Spills in Satellite Radar Images
Authors: Miroslav Kubat, Robert C. Holte, Stan Matwin
Venue: Machine Learning (1998)

During a project examining the use of machine learning techniques for oil spill detection, we encountered several essential questions that we believe deserve the attention of the research community. We use our particular case study to illustrate such issues as problem formulation, selection of evaluation measures, and data preparation. We relate these issues to properties of the oil spill application, such as its imbalanced class distribution, that are shown to be common to many applications. Our solutions to these issues are implemented in the Canadian Environmental Hazards Detection System (CEHDS), which is about to undergo field testing.
The Orthogonal qd-Algorithm
Authors: Urs von Matt
Venue: SIAM Journal on Scientific Computing (1997)

The orthogonal qd-algorithm is presented to compute the singular value decomposition of a bidiagonal matrix. This algorithm represents a modification of Rutishauser's qd-algorithm, and it is capable of determining all the singular values and their corresponding singular vectors to high relative accuracy. A generalization of the Givens transformation, which has applications besides the orthogonal qd-algorithm, is also introduced. The shift strategy of the orthogonal qd-algorithm is based on Laguerre's method, which is used to compute a lower bound on the smallest singular value of the bidiagonal matrix. Special attention is devoted to the numerically stable evaluation of this shift.