ppxscal/embedding_network huggingface dataset:
Two-stage procedures for multiple comparisons with a control in steady-state simulations
Authors: Halim Damerdji, Marvin K. Nakayama
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Suppose that we have k different stochastic systems, where /spl mu/i denotes the steady-state mean of system i. We assume that the system labeled k is a control and want to compare the performance of the other sys tems, labeled 1,2,...,k - 1, relative to this control. This problem is known in the statistical literature as multiple comparisons with a control (MCC). Independent steady-state simulations will be performed to compare the systems to the control. Two-stage procedures, based on the method of batch means, are presented to construct simultaneous lower one sided confidence intervals for/spl mu/i - /spl mu/k (i = 1, 2, . . ., k), each having prespecified (absolute or relative) half width 6. Under the assumption that the stochastic processes representing the evolution of the systems satisfy a functional central limit theorem, it can be shown that asymptotically (as /spl delta/ /spl rarr/ 0 with the size of the batches proportional to 1//spl delta//sup 2/), the joint probability that the confidence intervals simultaneously contain the /spl mu/i - /spl mu/k (i = 1, 2,..., k - 1) is at least 1 - /spl alpha/, where /spl alpha/ is prespecified by the user.
Generation of Pseudospectral Differentiation Matrices I
Authors: Bruno D. Welfert
Venue: SIAM Journal on Numerical Analysis (1997)

We present a simple method for computing $n \times n$ pseudospectral differentiation matrices of order $p$ in ${\cal O}(pn^2)$ operations for the case of quasi-polynomial approximation. The algorithm is based on Fornberg's finite difference algorithm and is numerically stable. A Fortran implementation is included. A necessary and sufficient condition for $D_p = D^p_1$ is also given.
An introduction to the Research Queueing Package
Authors: Edward A. MacNair
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The Research Queueing Package (RESQ) is a general purpose modeling tool for constructing and solving extended queueing network models of computer systems, communication networks, automated manufacturing systems and other types of contention systems. This paper is an introduction to RESQ which describes the basic model elements, submodels, statistical output analysis and graphical results.
Adaptive Neural Network for Nuclear Medicine Image Restoration
Authors: Wei Qian, Huaidong Li, Maria Kallergi, Dansheng Song, Laurence P. Clarke
Venue: Journal of VLSI Signal Processing Systems (1998)

A novel adaptive neural network is proposed for image restoration using a nuclear medicine gamma camera based on the point spread function of measured system. The objective is to restore image degradation due to photon scattering and collimator photon penetration with the gamma camera and allow improved quantitative external measurements of radionuclidesin-vivo . The specific clinical model proposed is the imaging of bremsstrahlung radiation using ^32P and^90 Y because of the enhanced image degradation effects of photon scattering, photon penetration and poor signal/noise ratio in measurements of this type with the gamma camera. This algorithm model avoids the common inverse problem associated with other image restoration filters such as the Wiener filter. The relative performance of the adaptive NN for image restoration is compared to a previously reported order statistic neural network hybrid (OSNNH) filter by these investigators, a traditional Weiner filter and a modified Hopfield neural network using simulated degraded images with different noise levels. Quantitative metrics such as the change of signal to noise ratio (&Delta;SNR) are used to compare filter performance. The adaptive NN yields comparable results for image restoration with a slightly better performance for the images with higher noise level as often encountered in bremsstrahlung detection with the gamma camera. Experimental attenuation measurements were also performed in a water tank using two radionuclides, ^32P and ^90 Y, typically used for antibody therapy. Similar values for an effective attenuation coefficient was observed for the restored images using the OSNNH filters and adaptive NN which demonstrate that the restoration filters preserves the total counts in the image as required for quantitative in-vivo measurements. The adaptive NN was computationally more efficient by a factor 4&ndash;6 compared to the OSNNH filter. The filter architecture, in turn, is also optimum for parallel processing or VLSI implementation as required for planar and particularly for tomographic mode of detection using the gamma camera. The proposed adaptive NN method should also prove to be useful for quantitative imaging of single photon emitters for other nuclear medicine tomographic imaging applications using positron emitters and direct X-ray photon detection.
Logic Synthesis with High Speed CMOS Circuit Techniques
Authors: Johnny Pihl, Einar J. Aas
Venue: Analog Integrated Circuits and Signal Processing (1997)

Systems for automated logic synthesis with the True Single Phase Clocking circuit technique (TSPC) and a modified form of the Clock and Data Precharged Dynamic (CDPD) circuit technique, are presented. The CDPD system synthesizes high speed one clock cycle modules of unate Boolean functions in short design time. A novel true single phase clocking (TSPC) flip-flop suitable for CDPD synthesis simplifies interfacing with standard edge triggered clocking schemes. Also, a TSPC cell library for automatic logic synthesis with the TSPC circuit technique is presented. The library is targeted for high performance DSP applications. Fabricated test circuits synthesized by both the CDPD and TSPC synthesis systems in a 0.8&mu;m standard CMOS process are described and their performance is verified. Clock frequencies up to 700MHz were measured.
Ideograph/Ideogram: framework/hardware for eager evaluation
Authors: S. ShouHan Wang, Augustus K. Uht
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

Ideograph integrates data and control dependencies into a unified representation and is used to precisely characterize the concepts of branch prediction and eager evaluation. The Ideogram computer is designed to execute Ideographs. Unlike dataflow computers, The Ideogram computer accepts a 3-address code language called igf. Through igf, Ideographs are constructed and executed by the Ideogram computer at run-time. In this paper, the descriptions of both Ideograph and Ideogram computer are introduced, and the preliminary benchmark results are included.
A Necessary and Sufficient Condition for the Existence of Some Ternary [n,k,d] Codes Meeting the Greismer Bound
Authors: Noboru Hamada
Venue: Designs, Codes and Cryptography (1997)

Let k and d be any integers such that k \geq 4 and 1 \leq d < 3^{k-1}. Then there exist two integers\alpha and \beta in \{0,1,2\} such that 3^{k-1} - \{(\alpha+1)3^{k-3} + \beta 3^{k-2}\} < d \leq 3^{k-1} - \{\alpha 3^{k-3} + \beta 3^{k-2}\}. The purpose of this paper is to prove that (1) in the case k \geq 5 and (\alpha,\beta) = (0,1), there exists a ternary [n,k,d] code meeting the Griesmer bound if and only if 3^{k-1} - 3^{k-2} - 2 \leq d \leq 3^{k-1} - 3^{k-2} and (2) in the case k \geq 4 and (\alpha,\beta) = (0,2) or (1,1), there is no ternary [n,k,d] code meeting the Griesmer bound for any integers k and d and (3) in the case k \geq 5 and d = 3^{k-1} - 3^{\lambda+1} - 3^{k-2}, there is no projective ternary [g_3(k,d)+1,k,d] code for any integers k and \lambda such that 1 \leq \lambda \leq k-3, where g_3(k,d) = v_k - v_{\lambda+2} - v_{k-1} and v_i = (3^i-1)/(3-1) for any integer i \geq 0. In the special case k = 6, it follows from (1) that there is no ternary linear code with parameters[233,6,154] , [234,6,155] or [237,6,157] which are new results.
On saying &ldquo;Enough already!&rdquo; in SQL
Authors: Michael J. Carey, Donald Kossmann
Venue: ACM SIGMOD Record (1997)

In this paper, we study a simple SQL extension that enables query writers to explicitly limit the cardinality of a query result. We examine its impact on the query optimization and run-time execution components of a relational DBMS, presenting two approaches&mdash;a Conservative approach and an Aggressive approach&mdash;to exploiting cardinality limits in relational query plans. Results obtained from an empirical study conducted using DB2 demonstrate the benefits of the SQL extension and illustrate the tradeoffs between our two approaches to implementing it.
Useful-Skew Clock Routing with Gate Sizing for Low Power Design
Authors: Joe Gufeng Xi, Wayne Wei-Ming Dai
Venue: Journal of VLSI Signal Processing Systems (1997)

This paper presents a new problem formulation and algorithm of clock routing combined with gate sizing for minimizing total logic and clock power. Instead of zero-skew or assuming a fixed skew bound, we seek to produce useful skews in clock routing. This is motivated by the fact that only positive skew should be minimized while negative skew is useful in that it allows a timing budget larger than the clock period for gate sizing. We construct an useful-skew tree (UST) such that the total clock and logic power (measured as a cost function) is minimized. Given a required clock period and feasible gate sizes, a set of negative and positive skew bounds are generated. The allowable skews within these bounds and feasible gate sizes together form the feasible solution space of our problem. Inspired by the Deferred-Merge Embedding (DME) approach, we devise a merging segment perturbation procedure to explore various tree configurations which result in correct clock operation under the required period. Because of the large number of feasible configurations, we adopt a simulated annealing approach to avoid being trapped in a local optimal configuration. This is complemented by a bi-partitioning heuristic to generate an appropriate connection topology to take advantage of useful skews. Experimental results of our method have shown 12% to 20% total power reduction over previous methods of clock routing with zero-skew or a single fixed skew bound and separately sizing logic gates. This is achieved at no sacrifice of clock frequency.
Ada as a parallel language for high performance computers: experience and results
Authors: Philippe Collard, Andre Goforth, Matthew Marquardt
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

This paper reports on experimental results which demonstrate the potential of Ada as a parallel programming language for large scale, scientific applications on high performance multiprocessors. Reported performance results show a linear speed-up of a factor of 10 over 10 processors. A linear speed-up performance over a larger number of processors is indicated given the availability of higher performance configurations and larger data sets. The results were obtained for an Ada program written to take advantage of the multiprocessing of the Sequent Balance and Symmetry computer series, which performed the classification of stars in a large infrared astronomical database, (IRAS). The classification procedure and algorithms, which were developed at NASA Ames Research Center and were originally coded in a Lisp program called AutoClassII, use an approximate Bayesian criterion. The procedure has been applied to a wide variety of classification domains besides astronomy. Through its tasking structure, Ada possesses the intrinsic ability to support parallel processing at the language level; however, much remains to be learned about the implementation of concurrent software systems in Ada on multiprocessor architectures. The paper provides a case study of the design issues faced in the attempt to exploit the inherent concurrency of the procedure and algorithms in the implementation of a portable version of AutoCIassII in Ada for benchmarking multiprocessors.
A fast and robust exact algorithm for face embedding
Authors: Evguenii I. Goldberg, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all faces of minimum length. Increasing dimensions of the Boolean space are explored; for a given dimension constraints are satisfied one at a time. The following features help to reduce the nodes of the solution space that must be explored: candidate cubes instead of candidate codes are generated, cubes yielding symmetric solutions are not generated, a smaller sufficient set of solutions (producing basic sections) is explored, necessary conditions help discard unsuitable candidate cubes, early detection that a partial solution cannot be extended to be a global solution prunes infeasible portions of the search tree. We have implemented a prototype package minsk based on the previous ideas and run experiments to evaluate it. The experiments show that minsk is faster and solves more problems than any available algorithm. Moreover, minsk is a robust algorithm, while most of the proposed alternatives are not. Besides most problems of the complete MCNC benchmark suite, other solved examples include an important set of decoder PLAs coming from the design of microprocessor instruction sets.
Bounds for the Differences of Matrix Means
Authors: M. Alic, B. Mond, J. Pecaric, V. Volenec
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

The classical inequality between the weighted arithmetic and geometric means has recently been extended to means of positive definite matrices. Here we give bounds for the difference between such matrix means. Differences between other matrix means, such as the geometric and harmonic means, are also given. Finally, conditions for the reversal of the matrix inequalities obtained are also pointed out.
On the Compuation of Lyapunov Exponents for Continuous Dynamical Systems
Authors: Luca Dieci, Robert D. Russell, Erik S. Van Vleck
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper, we consider discrete and continuous QR algorithms for computing all of the Lyapunov exponents of a regular dynamical system. We begin by reviewing theoretical results for regular systems and present general perturbation results for Lyapunov exponents. We then present the algorithms, give an error analysis of them, and describe their implementation. Finally, we give several numerical examples and some conclusions.
Cellular Automata for Weighted Random Pattern Generation
Authors: Danial J. Neebel, Charles R. Kime
Venue: IEEE Transactions on Computers (1997)

Fault testing random-pattern-resistant circuits requires that BIST (built-in self-test) techniques generate large numbers of pseudorandom patterns. To shorten these long test lengths, this study describes a cellular automata-based method that efficiently generates weighted pseudorandom BIST patterns. This structure, called a weighted cellular automaton (WCA), uses no external weighting logic. The design algorithm MWCARGO combines generation of the necessary weight sets and design of the WCA. In this study, WCA pattern generators designed by MWCARGO achieved 100 percent coverage of testable stuck-at faults for benchmark circuits with random-pattern-resistant faults. The WCA applies complete tests much faster than existing test-per-scan techniques. At the same time, the hardware overhead of WCA proves to be competitive with that of current test-per-clock schemes.
Fast algorithm for optimal layer assignment
Authors: Y. S. Kuo, T. C. Chern, Wei-kuan Shih
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Given the geometry of wires for interconnections, we want to assign two conducting layers to the segments of these wires so that the number of vias required is minimized. This layer assignment problem, also referred to as the via minimization problem, has been formulated as finding a maximum cut of a planar graph. In this paper, we propose a new algorithm for optimal layer assignment under a general model where the planar graph has real-valued edge weights. The time complexity of the proposed algorithm is O(n3/2 log n) where n is the number of wire-segment clusters in a given layout. In contrast, all existing optimal algorithms for layer assignment have the time complexity of O(n3).
A Threshold Function for Harmonic Update
Authors: Shao C. Fang, Santosh S. Venkatesh
Venue: SIAM Journal on Discrete Mathematics (1997)

Harmonic update is a randomized on-line algorithm which, given a random $m$-set of vertices $U(m)\subseteq\{-1,1\}^n$ in the $n$-dimensional cube, generates a random vertex $\bw\in\{-1,1\}^n$ as a putative solution to the system of linear inequalities: $\sum_{i=1}^n w_i u_i\geq0$ for each $\bu\in U(m)$. Using tools from large deviation multivariate normal approximation and Poisson approximation, we show that $\sqrt{n}\big/\!\sqrt{\log n}$ is a threshold function for the property that the vertex $\bw$ generated by harmonic update has positive inner product with each vertex in $U(m)$. More explicitly, let $P(n,m)$ denote the probability that $\sum_{i=1}^n w_i u_i\geq 0$ for each $\bu\in U(m)$. Then, as $n\to\infty$, $P(n,m)\to 0$ or $1$ according to whether $m=m_n$ varies with $n$ such that $m\gg\sqrt{n}\big/\!\sqrt{\log n}$ or $m\ll\sqrt{n}\big/\!\sqrt{\log n}$, respectively. The analysis also exposes the fine structure of the threshold function.
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
Authors: J. R. Driscoll, D. M. Healy,  Jr., D. N. Rockmore
Venue: SIAM Journal on Computing (1997)

Let $\poly = \{P_0,\dots,P_{n-1}\}$ denote a set of polynomials with complex coefficients. Let $\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx$ denote any set of {\it sample points}. For any $f = (f_0,\dots,f_{n-1}) \in \cplx^n$, the {\it discrete polynomial transform} of $f$ (with respect to $\poly$ and $\pts$) is defined as the collection of sums, $\{\fhat(P_0),\dots,\fhat(P_{n-1})\}$, where $\fhat(P_j) = \langle f,P_j \rangle = \sum_{i=0}^{n-1} f_iP_j(z_i)w(i)$ for some associated weight function $w$. These sorts of transforms find important applications in areas such as medical imaging and signal processing.In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system of $N$ orthogonal polynomials of degree at most $N-1$, we give an $O(N\log^2 N)$ algorithm for computing a discrete polynomial transform at an arbitrary set of points instead of the $N^2$ operations required by direct evaluation. Our algorithm depends only on the fact that orthogonal polynomial sets satisfy a three-term recurrence and thus it may be applied to any such set of discretely sampled functions. In particular, sampled orthogonal polynomials generate the vector space of functions on a distance transitive graph. As a direct application of our work, we are able to give a fast algorithm for computing subspace decompositions of this vector space which respect the action of the symmetry group of such a graph. This has direct applications to treating computational bottlenecks in the spectral analysis of data on distance transitive graphs, and we discuss this in some detail.
Self-Calibration of Stationary Cameras
Authors: Richard I. Hartley
Venue: International Journal of Computer Vision (1997)

A new practical method is given for the self-calibration of a camera. In this method, at least three images are taken from the same point in space with different orientations of the camera and calibration is computed from an analysis of point matches between the images. The method requires no knowledge of the orientations of the camera. Calibration is based on the image correspondences only. This method differs fundamentally from previous results by Maybank and Faugeras on self-calibration using the epipolar structure of image pairs. In the method of this paper, there is no epipolar structure since all images are taken from the same point in space, and so Maybank and Faugeras&lsquo;s method does not apply. Since the images are all taken from the same point in space, determination of point matches is considerably easier than for images taken with a moving camera, since problems of occlusion or change of aspect or illumination do not occur. A non-iterative calibration algorithm is given that works with any number of images. An iterative refinement method that may be used with noisy data is also described. The algorithm is implemented and validated on several sets of synthetic and real image data.
A prototype implementation of the SQL Ada module extension (SAME) method
Authors: Allison LeClair, Susan Phillips
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

As Ada becomes more widespread, the ability to access commercial database technologies through Ada systems becomes a significant issue. Researchers throughout our industry are investigating interface approaches between Ada and these technologies, including language bindings between Ada and SQL, a relational data base language. This paper presents a recent implementation of one such binding&mdash;the SQL Ada Module Extension (SAME) method.
Generalized Hadamard Matrices
Authors: J. L. Hayden
Venue: Designs, Codes and Cryptography (1997)

The paper studies a generalized Hadamard matrix H = (g_{ij}) of order n with entries g_{ij} from a group G of order n. We assume that H satisfies: (i) For m \neq k, G = \{g_{mi} g_{ki}^{-1}\mid i = 1, \ldots , n\}; (ii) g_{1i} = g_{i1} = 1 for each i; (iii) g_{ij}^{-1} = g_{ji} for all i, j. Conditions (i) and (ii) occur whenever G is a(P, L) -transitivity for a projective plane of order n. Condition (iii) holds in the case that H affords a symmetric incidence matrix for the plane. The paper proves that G must be a 2-group and extends previous work to the case that n is a square.
An investigation of operating methods for 0.25 micron semiconductor manufacturing
Authors: James F. Hallas, Jane D. Kim, Charles T. Mosier, Carolyn Internicola
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This study investigates a number of operational issues associated with the control of microprocessor fabrication facilities, specifically expanding the domain of previous research to investigate the effects of lot size, test wafer proportion, and tool productivity on wafer fabrication performance. Response variables included cost and production performance metrics.
Functional differentiation of computer programs
Authors: Jerzy Karczmarczuk
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

We present two purely functional implementations of the computational differentiation tools -- the well known numeric (not symbolic!) techniques which permit to compute pointwise derivatives of functions defined by computer programs economically and exactly. We show how the co-recursive (lazy) algorithm formulation permits to construct in a transparent and elegant manner the entire infinite tower of derivatives of higher order for any expressions present in the program, and we present a purely functional variant of the reverse (or adjoint) mode of computational differentiation, using a chain of delayed evaluations represented by closures. Some concrete applications are also discussed.
Algorithm 780: exponential pseudorandom distribution
Authors: Kenneth G. Hamilton
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

An algorithm is presented for the calculation of exponentially distributed random numbers. It is based on mathematics that was published by Ahrend and Dieter, but some errors have been corrected.