ppxscal/embedding_network huggingface dataset:
Module Level Weighted Random Patterns
Authors: Jacob Savir
Venue: Journal of Electronic Testing: Theory and Applications (1997)

The paper describes a module level self-test architecture that uses weighted random patterns. A pseudorandom pattern generator (PRPG) is used to generate equally likely patterns that are then transformed to weighted patterns by a universal weighting generator. The module being tested is assumed to be composed of a number of chips all of which have been designed to support a scan test. The signature is collected by a multiple input signature register (MISR). Each scan latch in the module is fed by its near-optimal weight during test. In order to avoid any additional test pins, some of the existing signal pins are designated (demultiplexed) to perform a weight control function during test. This architecture can dramatically decrease the self-test time with only a small increase of hardware overhead.
Regularization of Higher-Index Differential-Algebraic Equations with Rank-Deficient Constraints
Authors: Linda R. Petzold, Yuhe Ren, Timothy Maly
Venue: SIAM Journal on Scientific Computing (1997)

In this paper we present several regularizations for higher-index differential-algebraic equations with rank-deficient or singular constraints. These types of problems arise, for example, in the solution of constrained mechanical systems, when a mechanism's trajectory passes through or near a kinematic singularity. We derive a class of regularizations for these problems which is based on minimization of the norm of the constraints. The new regularizations are analogous to trust-region methods of numerical optimization. We give convergence results for the regularizations and present some numerical experiments which illustrate their effectiveness.
System-Level Data-Flow Transformation Exploration andPower-Area Trade-offs Demonstrated on Video Codecs
Authors: Francky Catthoor, Martin Janssen, Lode Nachtergaele, Hugo De Man
Venue: Journal of VLSI Signal Processing Systems (1998)

Application studies in the domain of image and video processing systems indicate that up to 80% of the power and area cost in customized architectures for such data-dominant processing is due to storage and transfers for multi-dimensional (M-D) data. This paper has two main contributions. First, as a crucial step to reduce this dominant cost, we propose an exploration subscript focused on data-flow transformations which address the system-level storage organization. This subscript fits within a complete high-level memory management methodology developed in the context of our ATOMIUM research activity. We will also indicate the potential for future design support in each of the stages of the subscript. Secondly, we will demonstrate the usefulness of the stages in this novel system exploration approach based on realistic test-vehicles, in particular crucial modules in a complex H.263 video decoder system for teleconferencing.
OBOA model of explanation module in intelligent tutoring shell
Authors: Ljubomir Jerinic, Vladan Devedzic
Venue: Proceedings of the 2nd conference on Integrating technology into computer science education (1997)

The important characteristics of any intelligent systems are the possibilities of explanation. So, any software product which intend to be intelligent must provide some kind of explanation, i.e., explanation of some conclusions, explanation of new knowledge (theorem), etc. As Intelligent Tutoring Systems (ITSs) intend to be intelligent software, the explanation feature must be provided in ITSs. In this paper, we will briefly survey how we realized the explanation properties and features in Intelligent Tutoring System (ITS) shell called EduSof. The OBOA (OBject - Oriented Abstraction) model for representing the knowledge, interaction within that knowledge and actions on that knowledge is used for the model of explanation, the transitions and the interactions features in EduSof shell.
A visual development environment for multi-lingual curricula
Authors: T. Dean Hendrix, Larry A. Barowski, James H. Cross,  II
Venue: ACM SIGCSE Bulletin (1997)

Although a computer science curriculum may use a single language as its "core" language, many curricula require students to learn and use multiple languages for course or practicum work. Students benefit from the exposure to other languages and other language models. However, a problem arising from the multi-lingual nature of a curriculum is the necessity to learn and use different development environments and language front-ends. GRASP (Graphical Representations of Algorithms, Structures, and Processes) is a software engineering tool currently being successfully utilized as a common development environment for the multi-lingual computer science curriculum at Auburn University. Besides providing a common front-end for different languages, GRASP also provides automated visualization of source code in the form of the control structure diagram and the complexity profile graph. This paper describes GRASP and its current use in the computer science curriculum. GRASP is freely available via the Internet at the following URL: http://www.eng.auburn.edu/grasp
Use of simulation to test client-server models
Authors: Yogesh L. Deshpande, Roger Jenkins, Simon Taylor
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Simulation is used for many purposes: for example, to analyse a complex system, to visualise the functioning of a system, and to optimise or tune a system. While there is no limitation on the use of simulation, the general consensus is that an analytical solution, if one is possible, is always to be preferred to simulation as a methodology. In the field of information systems, client-server models exhibit a degree of complexity and richness not amenable to easy analytical solutions, except for some specific algorithms useful in limited contexts. Simulation could, therefore, be a good strategy to analyse the client-server systems and help in better implementation of feasible solutions. This paper examines the current state of client-server models and use of simulation in dealing with the problems encountered. The paper then compares the seven-layer OSI model for communications architecture and recommends that a similarly layered approach is likely to prove useful in simulating client-server systems. In the process, the paper also points out that the simulation models bring into a sharp focus the importance of software metrics, an area of vital importance in software development.
Using a Protean Language to Enhance Expressiveness in Specification
Authors: Bard Bloom, Allan Cheng, Ashvin Dsouza
Venue: IEEE Transactions on Software Engineering (1997)

A Protean specification language [6] based on Structured Operational Semantics (SOS) allows the user to invent appropriate operations to improve abstraction and readability. This is in contrast to traditional specification languages, where the set of operations is fixed. An efficient algorithm, described in [10], uses binary decision diagrams (BDDs) to verify properties of finite specifications written in a Protean language and provides the basis for a model checker we have developed. This paper provides a synthesis of our work on Protean languages and relates the work to other specification techniques. We show how abstraction and refinement in the Protean framework can improve the effectiveness of model checking. We rewrite and verify properties of an existing Z specification by defining suitable operations. We also show how a Protean language can be used to model restricted I/O automata, action refinement, and 1-safe and k-bounded Petri nets.
Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
Authors: Tei-Wei Kuo, Aloysius K. Mok
Venue: IEEE Transactions on Computers (1997)

We provide a framework for discussing how to adjust load in order to handle periodic processes whose timing parameters vary with time. The schedulability of adjustable periodic processes by a preemptive fixed priority scheduler is formulated in terms of a configuration selection problem for which a PTIME solution is shown. When the list of allowable configurations is implicitly given by a set of scalable periodic processes, the corresponding period assignment problem is shown to be NP-Complete. We present an approximation algorithm for the period assignment problem for which we show some encouraging experimental results.
Corrigenda: Software Size Estimation of Object-Oriented Systems
Authors: B. Henderson-Sellers
Venue: IEEE Transactions on Software Engineering (1997)

In an interesting paper, Laranjeira [3] describes a first attempt to understand cost estimation within an object-oriented environment. While the presented approach presents many interesting and useful ideas, it is, unfortunately, marred by several mathematical errors pertaining to statistics, exponential functions, and the nature of discrete vs. continuous data. These are discussed here and more appropriate-correct procedures outlined.
The Generic Bilinear Calibration-Estimation Problem
Authors: Jan J. Koenderink, Andrea J. Van Doorn
Venue: International Journal of Computer Vision (1997)

We identify a very general, recurring pattern in a number of well known problems in biological and machine vision. Many problems are of a peculiar double-sided nature: One attempts to estimate certain properties of the environment using a certain type of equipment and simultaneously one attempts to calibrate the same equipment on the structure of the environment. At first sight this appears the kind of the chicken and the egg problem that might well prove to be insoluble. However, due to basic constraints that universally apply (e.g., the world is only three-dimensional), a solution&mdash;up to a certain class of ambiguity transformations&mdash;often exists. The more complicated the problem is, the less important the remaining ambiguity will be, at least in a relative sense. Many well known problems are special in that they can be cast in bilinear form, sometimes after transformation or the introduction of dummy variables. Instances include photometric stereo, photometric estimations (e.g., of lightness), local (differential) image operators, a variety of photogrammetric problems, etc. It turns out that many of these problems&mdash;and together these make up a large fraction of the generic problems in machine vision today&mdash;can be cast in a simple universal framework. This framework enables one to handle arbitrarily large (that is, not minimal, consistent configurations), noisy (thus inconsistent) date sets automatically. The level at which prior information (either of a deterministic or a statistical nature) is used (assumptions such as constant albedo, rigidity, uniform distributions, etc.) is clearly separated as an additional, typically nonlinear, stage.
An efficient assertion checker for combinational properties
Authors: Gagan Hasteer, Anmol Mathur, Prithviraj Banerjee
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Formally verifying properties of signals in a circuit hasseveral applications in an equivalence checking based formalverification flow.In a hierarchical design, functionalityis divided across blocks.This necessitates the useof constraints on input signals of a block to avoid falsenegatives.Validating such input constraints requires assertionchecking at the outputs of modules generatingthe constrained signals.In this paper, we present anefficient assertion checker for combinational propertieswhich avoids the BDD explosion problem by finding anoptimal intermediate correlation free frontier.It hasbeen successfully used in an industrial setting to uncovera number of bugs.
Passage retrieval revisited
Authors: Marcin Kaszkiel, Justin Zobel
Venue: Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval (1997)

Ranking based on passages addresses some of the shortcomings of whole-document ranking. It provides convenient units of text to return to the user, avoids the difficulties of comparing documents of different length, and enables identification of short blocks of relevant material amongst otherwise irrelevant text. In this paper we explore the potential of passage retrieval, based on an experimental evaluation of the ability of passages to identify relevant documents. We compare our scheme of arbitrary passage retrieval to several other document retrieval and passage retrieval methods; we show experimentally that, compared to these methods, ranking via fixed-length passages is robust and effective. Our experiments also show that, compared to whole-document ranking, ranking via fixed-length arbitrary passages significantly improves retrieval effectiveness, by 8% for TREC disks 2 and 4 and by 18%-37% for the Federal Register collection.
Ranking and selection procedures using standardized time series
Authors: David Goldsman
Venue: Proceedings of the 17th conference on Winter simulation (1985)

We study the problem of determining that one of k stationary simulated processes which has the largest mean. We adapt for use in the simulation environment a ranking and selection procedure due to Dudewicz and Dalal (1975). In order to implement this procedure, it is necessary to estimate the process variance of each of the k simulated systems; variance estimators arising from the theory of standardized time series are used for this purpose.
Second moment resource allocation in multi-service networks
Authors: Edward W. Knightly
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

A crucial problem for the efficient design and management of integrated services networks is how to best allocate network resources for heterogeneous and bursty traffic streams in multiplexers that support prioritized service disciplines. In this paper, we introduce a new approach for determining per-connection performance parameters such as delay-bound violation probability and loss probability in multi-service networks. The approach utilizes a traffic characterization consisting of the variances of a stream's rate distribution over multiple interval lengths, which captures its burstiness properties and autocorrelation structure. From this traffic characterization, we provide a simple and efficient resource allocation algorithm by deriving stochastic delay-bounds for static priority schedulers and employing a Gaussian approximation over intervals. To evaluate the scheme, we perform trace-driven simulation experiments with long traces of MPEG-compressed video and show that our approach is accurate enough to capture most of the inherent statistical multiplexing gain, achieving average network utilizations of up to 90% for these traces and substantially outperforming previous "effective bandwidth" techniques.
SMDSS&mdash;a structured microcode development and simulation system
Authors: Djahida Smati, Jerry Hwang, C. Papachristou
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

This paper presents a software environment SMDSS for specification, simulation, and design of digital systems based on the concept of modularity in microprogramming. It provides a hardware description language SMDSL, a modular microcode generator, and a functional simulator. Besides the distinction of structural and behavioral parts in a digital system description, the language covers high level structured constructs to facilitate the control sequencing. The microcode generator implementation is based on a previously developed microprogram control architecture which has been improved to enable the presence of structured constructs. The functional simulator is developed to allow testing the design validity.
Constrained Regular LQ-Control Problems
Authors: G. Stefani, P. Zezza
Venue: SIAM Journal on Control and Optimization (1997)

In this paper we give a complete description of how the Jacobi theory of conjugate points can be extended to a regular linear-quadratic control problem where the state end-points are jointly constrained to belong to a subspace of ${\bf R}^n \times {\bf R}^n$ and there is a linear pointwise state-control constraint. We introduce also the definition of semiconjugate point which describes a distinctive feature of these problems and state the corresponding necessary and sufficient conditions for the quadratic form to be nonnegative or coercive. In the case in which the constraints and the costs act separately on the initial and final points we give equivalent characterizations of the coercivity of the quadratic form by means of the solutions of an associated Riccati equation in both the controllable and uncontrollable case.
A Dual Source, Parallel Architecture for Computer Vision
Authors: A. M. Wallace, G. J. Michaelson, N. Scaife, W. J. Austin
Venue: The Journal of Supercomputing (1998)

We present a parallel architecture for object recognition and location based on concurrent processing of depth and intensity image data. Parallel algorithms for curvature computation and segmentation of depth data into planar or curved surface patches, and edge detection and segmentation of intensity data into extended linear features, are described. Using this feature data in comparison with a CAD model, objects can be located in either depth or intensity images by a parallel pose clustering algorithm. The architecture is based on cooperating stages for low/intermediate level processing and for high level matching. Here, we discuss the use of individual components for depth and intensity data, and their realisation and integration within each parallel stage. We then present an analysis of the performance of each component, and of the system as a whole, demonstrating good parallel execution from raw image data to final pose.
Note on a problem with Reed and Long's FBR results
Authors: John T. Robinson, Murthy V. Devarakonda
Venue: ACM SIGOPS Operating Systems Review (1997)

This short note discusses a problem we found in a recent article in Operating Systems Review [1]. The problem is related to apparent inconsistencies in results presented for a data cache algorithm, known as FBR (frequency based replacement), which we first described in [2]. A property of this algorithm is that cache miss ratios obtained using FBR can be related to LRU cache miss ratios for any given trace. Application of this property to the results in [1] reveals apparent inconsistencies. These inconsistencies could be the result of errors either in implementing the algorithm or in recording the results. This note also highlights this property of FBR, which should help contribute to its understanding.
Decomposition Methods for Differentiable Optimization Problems overCartesian Product Sets
Authors: Michael Patriksson
Venue: Computational Optimization and Applications (1998)

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.
Generalized matching from theory to application
Authors: Patrick Vuillod, Luca Benini, Giovanni De Micheli
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We present a novel approach for post-mapping optimization. We exploit the concept of generalised matching, a technique that finds symbolically all possible matching assignments of library cells to a multi-output network specified by a Boolean relation. Several objectives are targeted: area minimization under delay constraints; power minimization under delay constraints; and unconstrained delay minimization. We describe the theory of generalized matching and the algorithmic optimization required for its efficient and robust implementation. A tool based on generalized matching has been implemented and tested on large examples of the MCNC'91 benchmark suite. We obtain sizable improvements in: speed (6% in average, up to 20.7%); area under speed constraints (13.7% an average, up to 29.5%); and power under speed constraints (22.3% in average, up to 38.1%).
On View Likelihood and Stability
Authors: Daphna Weinshall, Michael Werman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We define two measures on views: view likelihood and view stability. View likelihood measures the probability that a certain view of a given 3D object is observed; it may be used to identify typical, or "characteristic," views. View stability measures how little the image changes as the viewpoint is slightly perturbed; it may be used to identify "generic" views. Both definitions are shown to be identical up to the prior probability of camera orientations, and determined by the 2D metric used to compare images. We analytically derive the stability and likelihood measures for two feature-based 2D metrics, where the most stable and most likely view is shown to be the flattest view of the 3D shape.Incorporating view likelihood or stability in 3D object recognition and 3D reconstruction increases the chance of robust performance. In particular, we propose to use these measures to enhance 3D object recognition and 3D reconstruction algorithms, by adding a second step where the most likely solution is selected among all feasible solutions. These applications are demonstrated using simulated and real images.
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
Authors: Jie Wu, Ke Huang
Venue: IEEE Transactions on Computers (1997)

In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that shares the same set of neighboring nodes. Therefore, tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration. Other properties of balanced hypercubes are examined. It is also shown that odd-dimensional balanced hypercubes have smaller diameters than that of standard hypercubes. As an application of balanced hypercubes, we show a fault-tolerant embedding of rings in balanced hypercubes.
Practical use of Ada in a heterogeneous multi-processor computer
Authors: Valérie Lecompte
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Many embedded real time applications can be performed on multiprocessor architectures. For sonar domain, we have designed a multiprocessor based computer named Mark3. For this architecture, and more generally for multiprocessor architecture, we propose programming principles, based on Ada. We have set up a distributed real time layer which allows the application tasks to communicate, without being concerned about task location. We will discuss here the programming principles and run time environment which allow us to develop applications on Mark3 computer.