ppxscal/embedding_network huggingface dataset:
Using interaction networks for visualisation of message passing
Authors: Paul Ashton
Venue: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education (1997)

Understanding software structured as separate programs that communicate via message passing requires understanding how the various programs interact with each other, as well as understanding the individual programs in isolation. An interaction network display shows in a visual way message passing within and between programs. We have implemented an interaction network monitor for the MINIX operating system, for use in showing students how the system programs and processes of MINIX interact to provide operating system services. We give three examples to demonstrate the insights into message-based systems that can be gained from studying interaction network displays.
The Number of Intersection Points Made by the Diagonals of a Regular Polygon
Authors: Bjorn Poonen, Michael Rubinstein
Venue: SIAM Journal on Discrete Mathematics (1998)

We give a formula for the number of interior intersection points made by the diagonals of a regular n-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by using Euler's formula V - E + F = 2.
The Numerical Computation of Homoclinic Orbits for Maps
Authors: W.-J. Beyn, J.-M. Kleinkauf
Venue: SIAM Journal on Numerical Analysis (1997)

Transversal homoclinic orbits of maps are known to generate shift dynamics on a set with Cantor-like structure. In this paper a numerical method is developed for computation of the corresponding homoclinic orbits. They are approximated by finite-orbit segments subject to asymptotic boundary conditions. We provide a detailed error analysis including a shadowing-type result by which one can infer the existence of a transversal homoclinic orbit from a finite segment. This approach is applied to several examples. In some of them parameters appear and closed loops of homoclinic orbits are found by a path-following algorithm.
Evaluating software engineering methods and tools part 6: identifying and scoring features
Authors: Barbara Ann Kitchenham, Lindsay Jones
Venue: ACM SIGSOFT Software Engineering Notes (1997)

This article discusses the issues involved in selecting the list of features that will be used in a particular feature analysis evaluation exercise. We also consider candidate methods/tools can be evaluated by scoring them in terms of their provision of and support for features that are important to the users of technology.
A deductive technique for diagnosis of bridging faults
Authors: Srikanth Venkataraman, W. Kent Fuchs
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

A deductive technique is presented that uses voltage testing for the diagnosis of single bridging faults between two gate input or output lines and is applicable to combinational or full-scan sequential circuits. For defects in this class of faults the method is accurate by construction while making no assumptions about the logic-level wired-AND/OR behavior. A path-trace procedure starting from failing outputs deduces potential lines associated with the bridge and eliminates certain faults. The information obtained from the path-trace from failing outputs is combined using an intersection graph to make further deductions. The intersection graph implicitly represents all candidate faults, thereby obviating the need to enumerate faults and hence allowing the exploration of the space of all faults. The above procedures are performed dynamically and a reduced intersection graph is maintained to reduce memory and simulation time. No dictionary or fault simulation is required. Results are provided for all large ISCAS89 benchmark circuits. For the largest benchmark circuit, the procedure reduces the space of all bridging faults, which is of the order of 10^9 to a few hundred faults on the average in about 30 seconds of execution time.
Characteristic Galerkin Schemes for Scalar Conservation Laws in Two and Three Space Dimensions
Authors: Peixiong Lin, K. W. Morton, E. Süli
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper we are concerned with a finite element method for multidimensional scalar conservation laws: we describe a general formulation of the Euler characteristic Galerkin (ECG) scheme, motivated by key features of the one-dimensional ECG scheme. The method is defined by projecting the transport collapse operator onto a finite element space spanned by piecewise constant basis functions. The ECG scheme is {\em TVD, monotone, maximum norm nonincreasing and unconditionally stable in the $L^{1}$-norm}. To the best of our knowledge, there is no other method which has all these properties. However, with piecewise constant basis functions, the ECG scheme is at most first-order accurate; greater accuracy can be obtained through a recovery procedure. Unlike conventional dimension-by-dimension methods, multidimensional ECG schemes contain important terms which describe corner effects. Nonuniform meshes and large time steps can be used with this class of schemes.
Does Error Control Suppress Spuriosity?
Authors: Mark A. Aves, David F. Griffiths, Desmond J. Higham
Venue: SIAM Journal on Numerical Analysis (1997)

In the numerical solution of initial value ordinary differential equations, to what extent does local error control confer global properties? This work concentrates on global steady states or fixed points. It is shown that, for systems of equations, spurious fixed points generally cease to exist when local error control is used. For scalar problems, on the other hand, locally adaptive algorithms generally avoid spurious fixed points by an indirect method---the stepsize selection process causes spurious fixed points to be unstable. However, problem classes exist where, for arbitrarily small tolerances, stable spurious fixed points persist with significant basins of attraction. A technique is derived for generating such examples.
Generalized vector spaces model in information retrieval
Authors: S. K. M. Wong
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

In information retrieval, it is common to model index terms and documents as vectors in a suitably defined vector space. The main difficulty with this approach is that the explicit representation of term vectors is not known a priori. For this reason, the vector space model adopted by Salton for the SMART system treats the terms as a set of orthogonal vectors. In such a model it is often necessary to adopt a separate, corrective procedure to take into account the correlations between terms. In this paper, we propose a systematic method (the generalized vector space model) to compute term correlations directly from automatic indexing scheme. We also demonstrate how such correlations can be included with minimal modification in the existing vector based information retrieval systems. The preliminary experimental results obtained from the new model are very encouraging.
Hardware/software co-simulation in a VHDL-based test bench approach
Authors: Matthias Bauer, Wolfgang Ecker
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Novel test bench techniques are required to cope with afunctional test complexity which is predicted to grow muchmore strongly than design complexity. Our test benchapproach attacks this complexity by using a stronghierarchical architecture, application domain-independentsynchronization, reusable modules, and easy incrementalextendability based on table-driven techniques. In addition,the integration of VHDL/C co-simulation under the controlof the test bench makes it possible to use the hardware modelfor software testing and vice versa and thus enables extremereductions in test bench coding. The efficiency of our testbench has already been demonstrated in several industrialprojects, among them a four-ASIC ATM board with oneembedded core and one external micro controller.
Structured design of microelectromechanical systems
Authors: Tamal Mukherjee, Gary K. Fedder
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In order to efficiently design complex microelectromechanicalsystems (MEMS) having large numbers of multi-domain components,a hierarchically structured design approach that iscompatible with standard IC design is needed. A graphical-basedschematic, or structural, view is presented as a geometrically intuitiveway to represent MEMS as a set of interconnected lumped-parameterelements. An initial library focuses on suspended-MEMStechnology from which inertial sensors and other mechanicalmechanisms can be designed. The schematic representationhas a simulation interface enabling the designer to simulate thedesign at the component level. Synthesis of MEMS cells for commontopologies provides the system designer with rapid, optimizedcomponent layout and associated macro-models. Asynthesis module is developed for the popular folded-flexuremicromechanical resonator topology. The algorithm minimizes acombination of total layout area and voltage applied to the electromechanicalactuators. Synthesis results clearly show the designlimits of behavioral parameters such as resonant frequency for afixed process technology.
Program analysis using binary relations
Authors: Adam Brooks Webber
Venue: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation (1997)

This paper presents a method called relational constraint for finding binary relations among the variables and constants of a program. The method constructs a table of binary relations and treats the program as a collection of constraints on tuples of relations in the table. An experimental optimizer called Thinner uses this method to analyze programs of size n in O(n2) time.
File system aging&mdash;increasing the relevance of file system benchmarks
Authors: Keith A. Smith, Margo I. Seltzer
Venue: ACM SIGMETRICS Performance Evaluation Review (1997)

Benchmarks are important because they provide a means for users and researchers to characterize how their workloads will perform on different systems and different system architectures. The field of file system design is no different from other areas of research in this regard, and a variety of file system benchmarks are in use, representing a wide range of the different user workloads that may be run on a file system. A realistic benchmark, however, is only one of the tools that is required in order to understand how a file system design will perform in the real world. The benchmark must also be executed on a realistic file system. While the simplest approach may be to measure the performance of an empty file system, this represents a state that is seldom encountered by real users. In order to study file systems in more representative conditions, we present a methodology for aging a test file system by replaying a workload similar to that experienced by a real file system over a period of many months, or even years. Our aging tools allow the same aging workload to be applied to multiple versions of the same file system, allowing scientific evaluation of the relative merits of competing file system designs.In addition to describing our aging tools, we demonstrate their use by applying them to evaluate two enhancements to the file layout policies of the UNIX fast file system.
Injecting simulation and modeling upstream in the system engineering process
Authors: Shahar Yarden
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes the application of simulation and modeling to enhance the understanding of a communication networking solution for the Trucking Locator Control System (TLCS) case study at the Johns Hopkins University Masters Program in Technical Management. The four major steps in this process were: developing a model of the TLCS system; generating assumptions about the TLCS system; selecting a simulation tool using a trade-study; and implementing the selected simulation tool. The selected simulation package, COMNET III, was used to establish common understanding about the system under consideration, to provide insight into its performances, and to generate data for further analysis. The same process can be utilized in other System Engineering applications, not only for educational purposes, but also to provide tools for conceptual system design and to enhance the design and integration phase in the System Engineering life-cycle.
On-line Successive Synthesis of Wavelet Networks
Authors: Kwok-Wo Wong, Andrew Chi-Sing Leung
Venue: Neural Processing Letters (1998)

An approach for the on-line synthesis of wavelet network using recursive least square (RLS) training is proposed. It is based on the concept of successive approximation of the system function to be learned. By using the Bayesian Information Criteria (BIC), the optimal number of wavelets is determined in the training process. Simulation results show that the proposed approach can approximate the unknown system function satisfactorily. Moreover, it can adapt to the changes in system parameters that off-line training cannot.
Relative Residual Bounds For The Eigenvalues of a Hermitian Semidefinite Matrix
Authors: Zlatko Drmac, Vjeran Hari
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

Let $H$ be a Hermitian matrix, $X$ an orthonormal matrix, and $M=X^*HX$. Then the eigenvalues of $M$ approximate some eigenvalues of $H$ with an absolute error bounded by $\ns{R}$, $R=HX-XM$. This work contains estimates of $|\lambda - \mu |/|\mu |$ and $|\lambda - \mu |/|\lambda |$, where $\mu$, $\lambda$ is a matching pair of the eigenvalues of $M$ and $H$ when $H$ is semidefinite. The general bound is expressed in terms of sines of the canonical angles between certain subspaces associated with $H$ and $X$. A more refined quadratic bound which uses the relative distances between eigenvalues is also proved.
The BUCKY object-relational benchmark
Authors: Michael J. Carey, David J. DeWitt Jeffrey F. Naughton Mohammad Asgarian Paul Brown, Johannes E. Gehrke Dhaval N. Shah
Venue: ACM SIGMOD Record (1997)

According to various trade journals and corporate marketing machines, we are now on the verge of a revolution&mdash;the object-relational database revolution. Since we believe that no one should face a revolution without appropriate armaments, this paper presents BUCKY, a new benchmark for object-relational database systems. BUCKY is a query-oriented benchmark that tests many of the key features offered by object-relational systems, including row types and inheritance, references and path expressions, sets of atomic values and of references, methods and late binding, and user-defined abstract data types and their methods. To test the maturity of object-relational technology relative to relational technology, we provide both an object-relational version of BUCKY and a relational equivalent thereof (i.e., a relational BUCKY simulation). Finally, we briefly discuss the initial performance results and lessons that resulted from applying BUCKY to one of the early object-relational database system products.
Resource sharing in hierarchical synthesis
Authors: Oliver Bringmann, Wolfgang Rosenstiel
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents a new approach to hierarchical high-level synthesis with respect to internal register-transfer structures of complex components. Entire subdesigns can efficiently be used as complex components at a higher hierarchical level of the design. After synthesis, the calculated schedule of each subdesign is added to its register-transfer component model. This enables the sharing of unused subcomponents across different hierarchical levels of the design. Especially, subcomponents of autonomous components, with a separate controller, can also be shared. As a result, the presented methodology offers a high degree of optimization to hierarchically specified designs.
Practical Bounded-Skew Clock Routing
Authors: Andrew B. Kahng, C.-W. Albert Tsao
Venue: Journal of VLSI Signal Processing Systems (1997)

In Clock routing research, such practical considerations as hierarchical buffering, rise-time and overshoot constraints, obstacle- and legal location-checking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production design environments. Specifically, the following issues are addressed: (i) clock routing for varying layer parasitics with non-zero via parasitics; (ii) obstacle-avoidance clock routing; and (iii) hierarchical buffered tree synthesis. We develop new theoretical analyses and heuristics, and present experimental results that validate our new approaches.
An algorithm to align words for historical comparison
Authors: Michael A. Covington
Venue: Computational Linguistics (1996)

The first step in applying the comparative method to a pair of words suspected of being cognate is to align the segments of each word that appear to correspond. Finding the right alignment may require searching. For example, Latin d&omacr; 'I give' lines up with the middle d&omacr; in Greek did&omacr;mi, not the initial di.This paper presents an algorithm for finding probably correct alignments on the basis of phonetic similarity. The algorithm consists of an evaluation metric and a guided search procedure. The search algorithm can be extended to implement special handling of metathesis, assimilation, or other phenomena that require looking ahead in the string, and can return any number of alignments that meet some criterion of goodness, not just the one best. It can serve as a front end to computer implementations of the comparative method.
Manufacturing cell simulation
Authors: James A. Chisman, Parker S. Owen
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper demonstrates the value of using simulation to model a gear manufacturing cell at the Reliance Electric Co. for the purpose of evaluating changes in equipment, layout, operator tasks and operating policies.
The computation of spectral density functions for singular Sturm-Liouville problems involving simple continuous spectra
Authors: C. T. Fulton, S. Pruess
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

The software package SLEDGE has as one of its options the estimation of spectral density functions p(t) for a wide class of singular Strurm-Liouville problems. In this article the underlaying theory and implementation issues are discussed. Several examples exhibiting quite varied asymptotic behavior in p are presented.
Programming-free graphic factory simulation with GEFMS/PC (graphically enhanced flexible modeling system)
Authors: Ralph R. Duersch, Marc A. Laymon
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper describes the capabilities and operation of a simulation tool designed for manufacturing applications[1] that does not require programming. The input of the simulation is based on a graphic layout of the model and the user's responses to a series of questions and answers. This implementation on IBM Personal Computers makes it possible for a larger group of manufacturing planners, engineers, and others to use simulation than was possible with an earlier implementation on the DEC&dagger; VAX[2].
Analytical estimation of transition activity from word-level signal statistics
Authors: Sumant Ramprasad, Naresh R. Shanbhag, Ibrahim N. Hajj
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Presented here is an analytical methodologyto determine the average signal activity, T, from the high-levelsignal statistics, a statistical signal generation model,and the signal encoding.Simulation results for 16 bit signalsgenerated via AR(1) and MA(1) models indicate anestimation error in T of less than 2%.The applicationof the proposed method to the estimation of T in DSPhardware is also explained.
Tutorial on high-level synthesis
Authors: Michael C. McFarland, Alice C. Parker, Raul Camposano
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

High-level synthesis takes an abstract behavioral specification of a digital system and finds a register-transfer level structure that realizes the given behavior. In this tutorial we will examine the high-level synthesis task, showing how it can be decomposed into a number of distinct but not independent subtasks. Then we will present the techniques that have been developed for solving those subtasks. Finally, we will note those areas related to high-level synthesis that are still open problems.
Noncontiguous Processor Allocation Algorithms for Mesh-Connected Multicomputers
Authors: Virginia Lo, Kurt J. Windisch, Wanqian Liu, Bill Nitzberg
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Current processor allocation techniques for highly parallel systems are typically restricted to contiguous allocation strategies for which performance suffers significantly due to the inherent problem of fragmentation. As a result, message-passing systems have yet to achieve the high utilization levels exhibited by traditional vector supercomputers. We are investigating processor allocation algorithms which lift the restriction on contiguity of processors in order to address the problem of fragmentation.Three noncontiguous processor allocation strategies¿Paging allocation, Random allocation, and the Multiple Buddy Strategy (MBS)¿are proposed and studied in this paper. Simulations compare the performance of the noncontiguous strategies with that of several well-known contiguous algorithms. We show that noncontiguous allocation algorithms perform better overall than the contiguous ones, even when message-passing contention is considered. We also present the results of experiments on an Intel Paragon XP/S-15 with 208 nodes that show noncontiguous allocation is feasible with current technologies.
An aircraft operations simulation model for the United Parcel Service Louisville Air Park
Authors: Kay K. Cornett, W. Swain Ottman, Scott A. Miller
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper presents the development of a flexible data driven model of the aircraft operations at the United Parcel Service Louisville Air Park. The model describes the unloading, refueling, and loading of aircraft by dedicated crews and equipment during the daily sortation operations. Inputs to the model include aircraft schedules, crew schedules and equipment allocation. Customized outputs include aircraft departure information, crew utilization, and equipment requirements. The model allows planners to develop crew schedules and allocation strategies to employ resources efficiently while maintaining rapid aircraft turnaround time. Preliminary analysis has identified aircraft arrival patterns and the specific crew availability as parameters to which the system is extremely sensitive.
Digital library and electronic publishing activities of German professional societies
Authors: A. Endres
Venue: Proceedings of the IEEE international forum on Research and technology advances in digital libraries (1997)

The rate of innovation occurring in the field of digital libraries and electronic publishing has been recognized as an obligation for action by several professional societies in Germany. Six of them have signed an agreement to mutually support each other in managing this transitional process. Several activities have been started in order to inform and to support the respective membership. One such effort is project MeDoc which is led by the German Informatics society (GI). Recently announced technology emphasis programs of the German research council and the federal government also address this area, and will stimulate additional focused research and development activities.