ppxscal/embedding_network huggingface dataset:
Inter-class synergy by design
Authors: Roy J. Daigle, Marino J. Niccolai
Venue: ACM SIGCSE Bulletin (1997)

Most often curricula are defined in university catalogs according to course prerequisite structures. Formal linkages between individual courses are typically first-order relationships based on prerequisite knowledge or discipline maturity. This paper describes a second-order, collaborative relationship that was established between two computer science courses that has greatly benefitted the students of both classes and has added another dimension to a combined computer and information sciences curricula.
Evaluation of an algorithm for finding a match of a distorted texture pattern in a large image database
Authors: N. Vujovic, D. Brzakovic
Venue: ACM Transactions on Information Systems (TOIS) (1998)

Evaluation of an algorithm for finding a match for a random texture pattern in a large image database is presented. The algorithm was designed assuming that the random pattern may be subject to misregistration relative to its representation in the database and assuming that it may have missing parts. The potential applications involve authentication of legal documents, bank notes, or credit cards, where thin fibers are embedded randomly into the document medium during medium fabrication. The algorithm achieves image matching by a three-step hierarchical procedure, which starts by matching parts of fiber patterns while solving the misregistration problem and ends up by matching complete fiber patterns. Performance of the algorithm is studied both theoretically and experimentally. Theoretical analysis includes the study of the probability that two documents have the same pattern, and the probability of the algorithm establishing a wrong match, as well as the algorithm's performance in terms of processing time. Experiments involving over 250,000 trials using databases of synthetic documents, containing up to 100,000 documents, were used to confirm theoretical predictions. In addition, experiments involving a database containing real images were conducted in order to confirm that the algorithm has potential in real applications.
Fault Diagnosis in a Benes Interconnection Network
Authors: S. Das(Bit), A. Chaudhuri
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

Benes network, being a back-to-back connection of two Baseline networks, the method for fault diagnosis for the class of nonredundant networks, as elucidated in our previous work, can be directly mapped on the two nonredundant networks. The individual results from these two networks can be combined to construct a comprehensive algorithm for the Benes network to diagnose single fault.
Modeling ATM systems with GSPNs and SWNs
Authors: Marco Ajmone Marsan, Rossano Gaeta
Venue: ACM SIGMETRICS Performance Evaluation Review (1998)

This paper overviews the work of the authors in the field of modeling and analysis of Asynchronous Transfer Mode (ATM) networks using Generalized Stochastic Petri Nets (GSPN) and a special class of high-level stochastic Petri nets known as Stochastic Well-formed Nets (SWN). These formalisms are first shown to be adequate tools for the development of models of ATM systems, provided that only one timed transition is used, together with many immediate transitions. The only timed transition in the GSPN and SWN models represents the ATM systems cell time, while immediate transitions implement the ATM systems behavior. The firing time distribution of the only timed transition is irrelevant for the computation of several interesting performance indices. The results, as well as the problems, derived from the analysis of ATM switches and Local Area Networks (LAN) that adopt the Available Bit Rate (ABR) service category are summarized and discussed, providing references to the works containing the technical details.
A Geometrical-Mechanical Interpretation of Gradient-Weighted Moving Finite Elements
Authors: Keith Miller
Venue: SIAM Journal on Numerical Analysis (1997)

The usual explanation of the gradient-weighted moving finite element (GWMFE) method has been in terms of its variational interpretation. This paper presents a more intuitive geometrical-mechanical interpretation of GWMFE as a balance of forces on the nodes, forces concentrated onto the nodes by the laws of leverage. It also presents significant simplifications in the "internodal viscosity" terms for regularization of the nodal movements, plus some simple "linear internodal tensions" for regularization of the long-term nodal positioning. These simplifications of the regularizations are especially important in two and three space dimensions. One of the generalizations which follows from the geometrical-mechanical interpretation is a promising but still untested second GWMFE formulation for systems of PDEs. The original MFE method is seen to be the small-slope limit of GWMFE under "vertical rescaling." Reporting on the design and extensive numerical trials of robust and versatile GWMFE systems codes in one and two dimensions is deferred to two forthcoming papers by Carlson and the author [Design and application of a gradient-weighted moving finite element code, Part I, in 1-D, SIAM J. Sci. Comput., to appear] and [Design and application of a gradient-weighted moving finite element code, Part II, in 2-D, SIAM J. Sci. Comput., to appear]. Here only a few illustrative examples are presented involving motion of surfaces by mean curvature, i.e., by surface tension.
Geometric Separators for Finite-Element Meshes
Authors: Gary L. Miller, Shang-Hua Teng, William Thurston, Stephen A. Vavasis
Venue: SIAM Journal on Scientific Computing (1998)

We propose a class of graphs that would occur naturally in finite-element and finite-difference problems and we prove a bound on separators for this class of graphs. Graphs in this class are embedded in $d$-dimensional space in a certain manner. For d-dimensional graphs our separator bound is O(n(d-1)d), which is the best possible bound. We also propose a simple randomized algorithm to find this separator in O(n) time. This separator algorithm can be used to partition the mesh among processors of a parallel computer and can also be used for the nested dissection sparse elimination algorithm.
ProfileMe: hardware support for instruction-level profiling on out-of-order processors
Authors: Jeffrey Dean, James E. Hicks, Carl A. Waldspurger, William E. Weihl, George Chrysos
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Profile data is valuable for identifying performance bottlenecks and guiding optimizations. Periodic sampling of a processor's performance monitoring hardware is an effective, unobtrusive way to obtain detailed profiles. Unfortunately, existing hardware simply counts events, such as cache misses and branch mispredictions, and cannot accurately attribute these events to instructions, especially on out-of-order machines. We propose an alternative approach, called ProfileMe, that samples instructions. As a sampled instruction moves through the processor pipeline, a detailed record of all interesting events and pipeline stage latencies is collected. ProfileMe also support paired sampling, which captures information about the interactions between concurrent instructions, revealing information about useful concurrency and the utilization of various pipeline stages while an instruction is in flight. We describe an inexpensive hardware implementation of ProfileMe, outline a variety of software techniques to extract useful profile information from the hardware, and explain several ways in which this information can provide valuable feedback for programmers and optimizers.
Super Arrovian Domains with Strict Preferences
Authors: Peter C. Fishburn, Jerry S. Kelly
Venue: SIAM Journal on Discrete Mathematics (1997)

Given $m \geq 3$ alternatives and $n \geq 2$ voters, let $\sigma(m, n)$ be the least integer $k$ for which there is a set of $k$ strict preference profiles for the voters on the alternatives with the following property: Arrow's impossibility theorem holds for this profile set and for each of its strict preference profile supersets. We show that $\sigma(3, 2) = 6$ and that for each $m$, $\sigma(m, n)/4^n$ approaches 0 monotonically as $n$ gets large. In addition, for each $n$ and $\epsilon > 0$, $\sigma(m, n)/(\log_2 m)^{2+\epsilon}$ approaches 0 as $m$ gets large. Hence for many alternatives or many voters, a robust version of Arrow's theorem is induced by a very small fraction of the set of all $(m!)^n$ strict preference profiles.
Improved Quasi-Steady-State-Approximation Methods for Atmospheric Chemistry Integration
Authors: L. O. Jay, A. Sandu, F. A. Potra, G. R. Carmichael
Venue: SIAM Journal on Scientific Computing (1997)

In the last fifteen years the quasi-steady-state-approximation (QSSA) method has been a commonly used method for integrating stiff ordinary differential equations arising from atmospheric chemistry problems. In this paper a theoretical analysis of the QSSA method is developed, stressing its strengths and its weaknesses. This theory leads to practical improvements to the QSSA method. New algorithms, including symmetric and extrapolated QSSA are presented.
Hierarchical modeling and distributed simulation with HIT
Authors: A. M. Warda, M. Sczittnick
Venue: ACM SIGSIM Simulation Digest (1997)

The Hierarchical Tool HIT is a software tool for hierarchical modeling and performance evaluation of discrete event systems. Besides analytical and numerical solution techniques HIT provides the evaluation of models by sequential simulation. Here we present concepts for optimistic distributed simulation of HIT-models by partitioning them with respect to subhierarchies. The main goals of the concept being presented are the preservation of model structure even in lower levels of the realization (e.g. use of the process view of simulation throughout all levels of abstraction) and distribution transparency on the modeling level (homogeneous model specification for all solution techniques).
Graphical interpretation of output illustrated by a SIMAN manufacturing system simulation
Authors: Lisa A. Pegden, Trevor I. Miles, Gustavo A. Diaz
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper discusses the role of graphical analysis of simulation data. Both static graphics and dynamic graphics contribute to the understanding of the simulation model. The advantages and disadvantages of these two major classes of output graphics are described. A SIMAN model of a manufacturing system is used to illustrate the different types of graphical output, three commercially available packages for graphically analyzing the system are discussed.
SVD Algorithms: APEX-like versus Subspace Methods
Authors: Andreas Weingessel, Kurt Hornik
Venue: Neural Processing Letters (1997)

We compare several new SVD learning algorithms which are based on the subspace method in principal component analysis with the APEX-like algorithm proposed by Diamantaras. It is shown experimentally that the convergence of these algorithms is as fast as the convergence of the APEX-like algorithm.
Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets
Authors: Alexandre Yakovlev
Venue: Formal Methods in System Design (1998)

This paper approaches the problem of synthesising an asynchronous control circuit for a stage of the Sproull Counterflow pipeline processor (CFPP) as an exercise in exploiting formal techniques available for Petri nets. We first synthesise a Petri net model of the CFPP stage control from its original &ldquo;five-state-five-event&rdquo; description due to Charles Molnar. Secondly, we implement that model in asynchronous circuits, using two-phase and four-phase components. The latter stage involves synthesising circuits with arbitration elements from behavioural descriptions with internal conflicts. This exercise appears to be quite instructive in the sense that it helps to estimate the scope and power of formal methods and today&lsquo;s automatic tools in assisting the process of asynchronous design.
Discrete stochastic optimization via a modification of the stochastic ruler method
Authors: Mahmoud H. Alrefaei, Sigrún Andradóttir
Venue: Proceedings of the 28th conference on Winter simulation (1996)

In this paper, we present a modification of the stochastic ruler method for solving discrete stochastic optimization problems. Our method generates a stationary Markov chain sequence taking values in the feasible set of the underlying discrete optimization problem. The number of visits to every state by this Markov chain is used to estimate the optimal solution. Unlike the original stochastic ruler method, our method is guaranteed to converge almost surely to a global optimal solution. We present empirical results that illustrate the performance of our method, and we show that these results compare favorably with empirical results obtained using the original stochastic ruler method.
A Functional Decomposition Method for Redundancy Identification and Test Generation
Authors: Michael L. Bushnell, John Giraldi
Venue: Journal of Electronic Testing: Theory and Applications (1997)

We present a new combinational circuit automatic test-pattern generation (ATPG) acceleration method called EST that detects equivalent search states, which are saved for later use. The search space is learned and characterized using E-frontiers, which are circuit cut-sets induced by the implication stack contents. The search space is reduced by matching the current search state against previously-encountered search states (possibly from prior faults), and this reduces the length of the search. A second contribution is a calculus of redundant faults, which enables EST to make many more mandatory assignments before search than is possible by prior algorithms, by effectively using its knowledge of prior faults proven to be redundant. This accelerates ATPG for subsequent faults. These methods accelerate the TOPS algorithm 33.3 times for the hard-to-test faults in the ISCAS &lsquo;85 benchmarks, and the SOCRATES algorithm 5.6 times for the same hard-to-test faults, with little memory overhead.
ANDYMMO: animation of the dynamics of mechanical and control models
Authors: Willi Hahn, Erwin Hasenjäger, Jens Trautmann
Venue: Proceedings of the conference on Designing the future (1996)

The dynamics of mechanical and/or control systems is traditionally documented by plots of system variables. The imagination of the underlying movements is restricted to very simple cases.ANDYMMO enhances imagination by introducing the possibility to see animated sequences of movements. The source may be any output generated by standard simulation tools. For linear models ANDYMMO has its own buiIt-in simulator.
On extending the vector space model for Boolean query processing
Authors: S. K. M. Wong
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

An information retrieval model, named the Generalized Vector Space Model (GVSM), is extended to handle situations where queries are specified as (extended) Boolean expressions. It is shown that this unified model, unlike currently available alternatives, has the advantage of incorporating term correlations into the retrieval process. The query language extension is attractive in the sense that most of the algebraic properties of the strict Boolean language are still preserved. Although the experimental results for extended Boolean retrieval are not always better than the vector processing method, the developments here are significant in facilitating commercially available retrieval systems to benefit from the vector based methods. The proposed scheme is compared to the p-norm model advanced by Salton and coworkers. An important conclusion is that it is desirable to investigate further extensions that can offer the benefits of both proposals.
Note. Optimal Storage Assignment Policies for Automated Storage and Retrieval Systems with Stochastic Demands
Authors: Ulrich W. Thonemann, Margaret L. Brandeau
Venue: Management Science (1998)

In existing AS/RS research, storage assignment policies are evaluated based on the probability that item type j will be stored (and subsequently retrieved). This note applies the turnover-based and class-based assignment policies of Hausman et al. (1976) to a stochastic environment by identifying the kth pallet of item type j: Frequently demanded pallets are stored close to the input/output point and rarely demanded pallets are stored at the end of the storage rack. We consider a discrete storage rack and a continuous storage rack. For the continuous rack case, we develop an expression for expected one-way travel time given uniform and exponentially distributed demand. We show that the turnover-based policy applied to the stochastic environment is optimal (it minimizes one-way travel time) and that both the turnover-based and class-based assignment policies applied in the stochastic environment reduce expected storage/retrieval time compared with random assignment. These savings can be directly translated into increased throughput capacity for existing systems and can be used to improve the design of proposed systems.
Testing for Bounded Faults in RAMs
Authors: R. David, J. A. Brzozowski, H. Jürgensen
Venue: Journal of Electronic Testing: Theory and Applications (1997)

We study the class of &ldquo;bounded faults&rdquo; in random-access memories; these are faults that involve a bounded number of cells. This is a very general class of memory faults that includes, for example, the usual stuck-at, coupling, and pattern-sensitive faults, but also many other types of faults. Some bounded faults are known to require deterministic tests of length proportional to n log2 n, where n is the total number of memory cells. The main result of this paper is that, for any bounded fault satisfying certain very mild conditions, the random test length required for a given level of confidence is always O(n).
An Approximate Distribution for the Maximum Order Complexity
Authors: Diane Erdmann, Sean Murphy
Venue: Designs, Codes and Cryptography (1997)

In this paper we give an approximate probability distribution for the maximum order complexity of a random binary sequence. This enables the development of statistical tests based on maximum order complexity for the testing of a binary sequence generator. These tests are analogous to those based on linear complexity.
Internet-based learning
Authors: Byron Storck
Venue: 3C ON-LINE (1997)

My involvement in the development of Internet-based learning activities began in April of 1996 when I was asked to prepare a document briefly listing the types of Internet applications I would use in LaGuardia Community College's Topics in Astronomy course. Our College was fortunate to participate in a five-year NASA-MUSPIN (National Aeronautics and Space Administration [NASA] Minority University-Space Interdisciplinary Network) grant that provided LaGuardia with a 100 Mbps fiber optic backbone connection to the Internet. As a result, we were required to provide examples of how we planned to involve students and faculty in the development and use of Internet applications.
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
Authors: Mihir Pandya, Miroslaw Malek
Venue: IEEE Transactions on Computers (1998)

The Rate Monotonic Scheduling (RMS) policy is a widely accepted scheduling strategy for real-time systems due to strong theoretical foundations and features attractive to practical uses. For a periodic task set of n tasks with deadlines at the end of task periods, it guarantees a feasible schedule on a single processor as long as the utilization factor of the task set is below n(21/n$-$ 1) which converges to 0.69 for large n. We analyze the schedulability of a set of periodic tasks that is scheduled by the RMS policy and is susceptible to a single fault. The recovery action is the reexecution of all uncompleted tasks. The priority of the RMS policy is maintained even during recovery. Under these conditions, we guarantee that no task will miss a single deadline, even in the presence of a fault, if the utilization factor on the processor does not exceed 0.5. Thus, 0.5 is the minimum achievable utilization that permits recovery from faults before the expiration of the deadlines of the tasks. This bound is better than the trivial bound of 0.69/2 = 0.345 that would be obtained if computation times were doubled to provide for reexecutions in the RMS analysis. Our result provides scheduling guarantees for tolerating a variety of intermittent and transient hardware and software faults that can be handled simply by reexecution. In addition, we demonstrate how permanent faults can be tolerated efficiently by maintaining common spares among a set of processors that are independently executing periodic tasks.
Interval Arithmetic for Input-output Models with Inexact Data
Authors: Max E. Jerrell
Venue: Computational Economics (1997)

Input-output models are subject to uncertainty. If these models are solved without regard to the effects of the uncertainty the solutions can be substantially in error. Interval arithmetic offers a means by which the effects of this uncertainty can be assessed. They also offer a means of evaluating changes in the technical coefficients and a means of determining inverse important coefficients.
Nonconforming Mortart Element Methods for the Spectral Discretization of Two-Dimensional Fourth-Order Problems
Authors: Zakaria Belhachmi
Venue: SIAM Journal on Numerical Analysis (1997)

This paper deals with two versions of the mortar element method applied to the spectral discretization of two-dimensional fourth-order problems. In each case, the analysis of the discrete problem is carried out. The key results are the uniform ellipticity of the discrete bilinear form, leading to error estimates which are optimal with respect to the discretization parameter and the regularity of the exact solution. Some numerical results are given to illustrate various aspects of the method.
Incremental-in-time algorithm for digital simulation
Authors: Kiyoung Choi, Sun Young Hwang, Tom Blank
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Recently, an incremental algorithm (incremental-in-space algorithm) for digital simulation has been studied with good results in speeding up simulation. In this paper we present another algorithm (incremental-in-time algorithm) for incremental simulation of digital circuits. The incremental-in-space algorithm pessimistically resimulates the circuit components that could be affected by design changes throughout the simulation time frames. On the other hand, the incremental-in-time algorithm resimulates a circuit component only for the simulation time frames when its inputs or internal state variables make different state transitions from the previous simulation run. It maximally utilizes the past history thereby reducing the number of component evaluations to a minimum. Experimental results obtained for several practical circuits show speedups up to 30 times faster than conventional event-driven simulation.
A General Zero-Knowledge Scheme
Authors: Mike Burmester, Yvo G. Desmedt, Fred Piper, Michael Walker
Venue: Designs, Codes and Cryptography (1997)

There is a great similarity between the zero-knowledge proof of quadratic residuocity presented by Goldwasser-Micali-Rackoff and the graph isomorphism proof presented by Goldreich-Micali-Wigderson. There is also a resemblance between the zero-knowledge proofs of Fiat-Shamir, Chaum-Evertse-van de Graaf, Beth and Guillou-Quisquater. A similar observation holds for zero-knowledge proofs based on encryption: the 3-colourability proofs and the Hamiltonian-circuit proofs of Blum and Goldreich-Micali-Wigderson, and the Brassard-Chaum-Crepeau proof for SAT. Feige, Fiat and Shamir introduced the concept of zero-knowledge proofs of knowledge. In this paper we present a general zero-knowledge scheme which unifies all these Arthur-Merlin proofs.