ppxscal/embedding_network huggingface dataset:
PRISM architecture: parallel and pipeline features
Authors: Beverly Gocal
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

Reconstruction of Computer Tomography images requires several processing steps for reduction of electronic noise and correction of physical inaccuracies. The most time-consuming step is a convolution implemented with Fast Fourier Transforms. The architecture of a single board computer designed to provide an efficient implementation of the Fast Fourier Transform is presented. Parallel and pipeline features are discussed and a typical array routine is used to present software features.
Inside simulation software: how it works and why it matters
Authors: Thomas J. Schriber, Daniel T. Brunner
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper provides simulation practitioners and interested simulation consumers with a grounding in how discrete-event simulation software works. Topics include discrete-event systems and modeling; entities, resources and operations; simulation runs; entity states; entity lists; and entity-list management. The implementation of these generic ideas in SIMAN, ProModel, and GPSS/H is described. The paper concludes-with several examples of "why it matters" for modelers to know in fine detail how their simulation software works. (This paper is an updated version of an identically named paper appearing in the Proceedings of the 1995 Winter Simulation Conference, pp. 110-117.)
Measuring the effectiveness of simulation-based training
Authors: Michael L. McGinnis, George F. Stone,  III
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The relationship between measures of training performance and the achievement of training goals is often difficult to quantify. This continues to be an obstacle to the development of curricula for simulation based training systems. These include both constructive and virtual computer simulations for training. This paper discusses the development of training effectiveness measures as they relate to the design of instructional, simulation-based training systems featuring automated tools for planning training.
A framework for high-speed controller design
Authors: J. M. Mulder, R. J. Portier, A. Srivastava
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

The SCARCE architecture framework allows the cost-effective design of application-specific architectures for a wide variety of embedded applications (controllers, signal processing, graphics). Cost-effective in this context means reduction of recurrent hardware and software development costs while achieving high performance. To aid efficient control over the design and documentation process we have integrated the framework in the ASA silicon compiler from Sagantec Inc.. The SCARCE framework is completely described by means of the Sagantec hardware description language, SID. Generating an application-specific processor reduces to a number of SID-description transformations. Currently these transformations are by hand; in the future all transformations will be made automatically. Generating the processor layout from the SID description is done by the ASA silicon compiler. To optimize the resulting layout, custom building blocks are being integrated as regular structures. Since all descriptions are in SID, the ASA silicon compiler allows simulation to take place on all stages of processor development. In this paper we describe the overall structure of the SCARCE framework, its representation in the SID description language, and the processor design trajectory.
Variability Reduction Through Operations Reversal
Authors: Hau L. Lee, Christopher S. Tang
Venue: Management Science (1998)

Products with high product variety are often made in a manufacturing process (or a supply chain) consisting of multiple stages, with products taking certain features or "personalities" at each stage. The product may start as a common single engine. As the product moves along manufacturing process, more features are added, and the product assumes more identities of the final end product. When demands of the end products are variable from period to period, the production volumes of the intermediate stages in the manufacturing process are also variable. It is widely recognized that variabilities of production volumes may add cost to the process. This paper is motivated by our observations in industry, where some companies have reengineered the manufacturing process by reversing two consecutive stages of the process. Such changes could lead to variance reduction, thereby improving the performance of the process. We develop formalized models that characterize the impact of such changes: operations reversal. These models are used to derive insights on when such reversal would be advisable.
A hardware-based performance monitor for the Intel iPSC/2 hypercube
Authors: Allen D. Malony, Daniel A. Reed
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

The complexity of parallel computer systems makes a priori performance prediction difficult and experimental performance analysis crucial. A complete characterization of software and hardware dynamics, needed to understand the performance of high-performance parallel systems, requires execution time performance instrumentation. Although software recording of performance data suffices for low frequency events, capture of detailed, high-frequency performance data ultimately requires hardware support if the performance instrumentation is to remain efficient and unobtrusive. This paper describes the design of HYPERMON, a hardware system to capture and record software performance traces generated on the Intel iPSC/2 hypercube. HYPERMON represents a compromise between fully-passive hardware monitoring and software event tracing; software generated events are extracted from each node, timestamped, and externally recorded by HYPERMON. Using an instrumented version of the iPSC/2 operating system and several application programs, we present a performance analysis of an operational HYPERMON prototype and assess the limitations of the current design. Based on these results, we suggest design modifications that should permit capture of event traces from the coming generation of high-performance distributed memory parallel systems.
A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform
Authors: Weiguang Guan, Songde Ma
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

In this paper, we propose an efficient Voronoi transform algorithm for constructing Voronoi diagrams using segment lists of rows. A significant feature of the algorithm is that it takes segments rather than pixels as the basic units to represent and propagate the nearest neighbor information. The segment lists are dynamically updated as they are scanned. A distance map can then be easily computed from the segment list representation of the Voronoi diagram. Experimental results have demonstrated its high efficiency. Extension of the algorithm to higher dimensions is also discussed.
Solving general sparse linear systems using conjugate gradient-type methods
Authors: K. Gallivan, A. Sameh, Z. Zlatev
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

The problem of finding an approximation of @@@@ = A&dagger;b (where A&dagger; is the pseudo-inverse of A &isin; @@@@m@@@@n with m &ge; n and rank(A) = n) is discussed. It is assumed that A is sparse but has neither a special pattern (as bandedness) nor a special property (as symmetry or positive definiteness). In this paper it is shown that preconditioners obtained by neglecting small elements during the decomposition of A into easily invertible matrices can be used efficiently with conjugate gradient-type methods if an adaptive strategy for deciding when an element is small is implemented. The resulting preconditioned methods are often better than the corresponding direct and pure iterative methods or those based on preconditionings in which elements are neglected when they appear in a predefined set of positions in the matrix, i.e. positional rather than numerical dropping. Numerical results are given to illustrate the performance of the CG-type methods preconditioned via numerical dropping.
Interconvertbility of set constraints and context-free language reachability
Authors: David Melski, Thomas Reps
Venue: ACM SIGPLAN Notices (1997)

We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gives a solution to the set-constraint problem. The interconvertibility of these two formalisms offers an conceptual advantage akin to the advantage gained from the interconvertibility of finite-state automata and regular expressions in formal language theory, namely, a problem can be formulated in whichever formalism is most natural. It also offers some insight into the "O(n3) bottleneck" for different types of program-analysis problems, and allows results previously obtained for context-free-language reachability problems to be applied to set-constraint problems.
Verifying and validating simulation models
Authors: Robert G. Sargent
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper discusses verification and validation of simulation models. The different approaches to deciding model validity am presented; how model verification and validation relate to the model development process are discussed; various validation techniques are defined, conceptual model validity, model verification, operational validity, and data validity are described; ways to document results are given; and a recommended procedure is presented.
Record play: a structural fixed point iteration for sequential circuit verification
Authors: Dominik Stoffel, Wolfgang Kunz
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper proposes a technique for sequential logic equivalence checking by a structural fixed point iteration. Verification is performed by expanding the circuit into an iterative circuit array and by proving equivalence of each time frame by well-known combinational verification techniques. These exploit structural similarity between designs by local circuit transformations. Starting from the initial state, for each time frame the performed circuit transformations are stored (recorded) in an instruction queue. In subsequent time frames the instruction queue is re-used (played) and updated when necessary. At some point the instruction queue does not need to be modified any more and is valid in all subsequent time frames. Thus, a fixed point is reached and machine equivalence is proved by induction. Experimental results show the great promise of this approach to verify circuits after resynthesis and retiming.
Difference Sets and Hyperovals
Authors: Antonio Maschietti
Venue: Designs, Codes and Cryptography (1998)

We construct three infinite families of cyclic difference sets, using monomial hyperovals in a desarguesian projective plane of even order. These difference sets give rise to cyclic Hadamard designs, which have the same parameters as the designs of points and hyperplanes of a projective geometry over the field with two elements. Moreover, they are substructures of the Hadamard design that one can associate with a hyperoval in a projective plane of even order.
Using student-built algorithm animations as learning aids
Authors: Joel T. Stasko
Venue: ACM SIGCSE Bulletin (1997)

The typical application of algorithm animation to assist instruction involves students viewing already prepared animations. An alternative strategy is to have the students themselves construct animations of algorithms. The Samba algorithm animation tool fosters such student-built animations. Samba was used in an undergraduate algorithms course in which students constructed algorithm animations as regular class assignments. This article describes Samba and documents our experiences using it in the algorithms course. Student reaction to the animation assignments was very positive, and the students appeared to learn the pertinent algorithms extremely well.
An ADI Method for Hysteretic Reaction-Diffusion Systems
Authors: Chichia Chiu, Noel Walkington
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper we consider a mathematical model motivated by patterned growth of bacterial cells. The model is a system of differential equations that consists of two subsystems. One is a system of ordinary differential equations and the other is a reaction-diffusion system. An alternating-direction implicit (ADI) method is derived for numerically solving the system. The ADI method given here is different from the usual ADI schemes for parabolic equations due to the special treatment of nonlinear reaction terms in the system. Stability and convergence of the ADI method are proved. We apply these results to the numerical solution of a problem in microbiology.
The controlled cell transfer capability
Authors: Steven Van Luinen, Zigmantas L. Budrikis, Antonio Cantoni
Venue: ACM SIGCOMM Computer Communication Review (1997)

A Controlled Cell Transfer (CCT) capability has been proposed to ITU for definition in Recommendation I.371. The CCT capability, if accepted, will bring the number of ATM transfer layer capabilities to five. The other four capabilities being Deterministic Bit Rate (DBR), Statistical Bit Rate (SBR), ATM Block Transfer (ABT) and Available Bit Rate (ABR). It is believed that this capability will endow the ATM network with LAN like service over the wide area. In this article, we discuss the features and mechanisms of the proposed CCT capability. We also discuss the applications that CCT is targeted at supporting and present results of simulation studies, highlighting the advantages of CCT.
Preconditioning Chebyshev Spectral Collocation by Finite-Difference Operators
Authors: Sang Dong Kim, Seymour V. Parter
Venue: SIAM Journal on Numerical Analysis (1997)

In 1979 Orszag proposed a finite-difference preconditioning of the Chebyshev collocation discretization of the Poisson equation. In 1984 Haldenwang, Labrosse, Abboudi, and DeVille gave analytic formulae for the eigenvalues of this preconditioned operator in the one-dimensional case. Experimental results over many years have shown the effectiveness of this procedure and appropriate bounds on the eigenvalues in two dimensions. However, there have been no mathematical proofs describing the behavior of the eigenvalues in two or more dimensions. In this work we consider the generalized field of values $(U^*\hat A_NU)/(U^*L_NU)$, where $\hat A_N$ is the matrix of the Chebyshev collocation scheme and $L_N$ is the matrix of the finite-difference operator. For the case of the Chebyshev collocation of the Helmoltz operator, $Au:=-\Delta u+au$, $a\ge 0$ preconditioned by the finite-difference operator associated with the Helmholtz operator $Bu:=-\Delta u+bu$, $b\ge 0$, we prove that there are two constants $00$ and $|(U^*\hat A_NU)/(U^*L_NU)| \le\Lambda_1$. These results extend to higher dimensions and to bounds on $\| L_N^{-1}\hat A_N\|_{1,w}$ and $\|\hat A_N^{-1}L_N\|_{1,w}$ in the general case where $Au:=-\Delta u+a_1u_x+a_2u_y+au$.
SED AWK (2nd ed.)
Authors: Dale Dougherty, Arnold Robbins
Venue:  (1997)

sed & awk describes two text manipulation programs that are mainstays of the UNIX programmer's toolbox. This edition covers the sed and awk programs as they are mandated by the POSIX standard and includes discussion of the GNU versions of these programs.
Splitting for rare event simulation: analysis of simple cases
Authors: Paul Glasserman, Philip Heidelberger, Perwez Shahabuddin, Tim Zajic
Venue: Proceedings of the 28th conference on Winter simulation (1996)

An approach to rare event simulation uses the technique of splitting. The basic idea is to split sample paths of the stochastic process into multiple copies when they approach closer to the rare set; this increases the overall number of hits to the rare set for a given amount of simulation time. This paper analyzes the bias and efficiency of some simple cases of this method.
Semiring-based constraint satisfaction and optimization
Authors: Stefano Bistarelli, Ugo Montanari, Francesca Rossi
Venue: Journal of the ACM (JACM) (1997)

We introduce a general framework for constraint satisfaction and optimization where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated with each tuple of values of the variable domain, and the two semiring operations (+ and X) model constraint projection and combination respectively. Local consistency algorithms, as usually used for classical CSPs, can be exploited in this general framework as well, provided that certain conditions on the semiring operations are satisfied. We then show how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can be used also in newly defined schemes.
CAD at the design-manufacturing interface
Authors: H. T. Heineken, J. Khare, W. Maly, P. K. Nag, C. Ouyang, W. A. Pleskacz
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Owing to rapid changes of IC technologies, traditionaldesign rule checking is becoming inadequate to assure satisfactorylevels of IC manufacturability. This paper describes a newcomputer supported design analysis environment that improvesthe efficiency of manufacturability assessment of new products.This environment, called MAPEX 2, is described in the paperalong with some of its key procedures and algorithms. Illustrationsof MAPEX 2 applications and performance figures are provided as well.
Communications model for analysis and design (COMMAND)
Authors: Brian E. Esterby, Larry J. Williams, Mark H. Hellbusch
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The COMmunications Model for ANalysis and Design (COMMAND) is a flexible and adaptable communications simulation model capable of modeling virtually any number of message source/destination and link combinations. COMMAND's flexibility is indicated by its data driven nature; most applications require database changes only. COMMAND is adaptable; if it doesn't contain the logic to support a unique protocol, buffer management technique, or other particular feature, one need only add or substitute a simple subroutine. Data structures and simulation control are hidden from and transparent to the user. COMMAND models traffic where message parameters vary widely, multimedia are employed, the user requires the capability to dictate dynamic environmental changes, and the content of the messages that reach their destination is important to measures of system performance.
A Shift-Invariant Neural Network for the Lung FieldSegmentation in Chest Radiography
Authors: Akira Hasegawa, Shih-Chung B. Lo, Jyh-Shyan Lin, Matthew T. Freedman, Seong K. Mun
Venue: Journal of VLSI Signal Processing Systems (1998)

We have developed a computerized method using a neural network for the segmentation of lung fields in chest radiography. The lung is the primary region of interest in routine chest radiography diagnosis. Since computer is expected to perform disease pattern search automatically, it is important to design appropriate algorithms to delineate the region of interest. A reliable segmentation method is essential to facilitate subsequent searches for image patterns associated with lung diseases. In this study, we employed a shift invariant neural network coupled with error back-propagation training method to extract the lung fields. A set of computer algorithms were also developed for smoothing the initially detected edges of lung fields. Our preliminary results indicated that 86% of the segmented lung fields globally matched the original chest radiographs. We also found that the method facilitates the development of computer algorithms in the field of computer-aided diagnosis.
Abstraction mechanisms in discrete-event inductive modeling
Authors: Hessam S. Sarjoughian, Bernard P. Zeigler
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The power of abstraction lies in its ability to deal with "lack" of knowledge. In this regard, success in modeling and simulation rests on discovering useful abstractions that can support objectives of modeling. In our treatment, we refer to "data abstraction" as opposed to "structure simplification" since we consider a system's behavior rather than its structure. A system's behavior can be represented as time varying input/output segments. Given the behavior of a causal, time-invariant system, we define some basic abstraction mechanisms to support inductive modeling. The basis for these abstraction mechanisms are a set of general assumptions which allow consistent abstraction of IO segments. Then, given these assumptions and non-monotonic reasoning paradigm, capable of handling them, we try to tackle the fundamental problem of insufficient knowledge in the realm of inductive modeling. In this way, by making useful abstractions, we can predict a system's unobserved behavior according to a well-defined framework of discrete-event inductive modeling.
Global computation
Authors: Luca Cardelli
Venue: ACM SIGPLAN Notices (1997)

Computation over planet-wide structures is hindered by administrative, architectural, and physical constraints. These problems are surmountable, but must be addressed by developing new models of programming and of computation.
Evaluating Reliability Improvements of Fault Tolerant Array Processors Using Algorithm-Based Fault Tolerance
Authors: D. L. Tao, Kamal Kantawala
Venue: IEEE Transactions on Computers (1997)

Algorithm-based fault tolerance (ABFT) is used to provide low-cost error protection for VLSI processor arrays used in real-time digital signal processing. The main objective of incorporating an ABFT technique in a processor array is to improve its reliability. All previous approaches on ABFT are evaluated in terms of their error detecting/correcting capabilities, the reliability improvement has never been addressed. In this paper, we develop a stochastic model for an array processor incorporating ABFT that takes the behavior of transient/intermittent failures and hardware overhead into account. This model is then used to evaluate reliability and reliability improvements of several existing ABFT techniques that tolerate single faults. Therefore, a user can evaluate a number of ABFT techniques and make a trade-off between reliability and cost prior to the implementation. Moreover, we have conducted extensive simulation experiments and the simulation results validate the proposed model.
Algorithm for vectorizing logic simulation and evaluation of &ldquo;VELVET&rdquo; performance
Authors: Yoshiharu Kazama, Yoshiaki Kinoshita, Motonobu Nagafuji, Hiroshi Murayama
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A very large-scale logic simulation engine &ldquo;VELVET&rdquo; has been developed. VELVET is a vectorized event-driven simulator which can handle simultaneously both gate-level logic and Register Transfer Level structure. VELVET can process simulation jobs two orders of magnitude faster than a conventional gate-level simulator. This paper describes how to realize such high performance, an algorithm for vectorizing the simulation and performance.