ppxscal/embedding_network huggingface dataset:
The use of a simulation model for planning ambulatory surgery
Authors: Laurie Meier, Elliot Sigal, Frank R. Vitale
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A computer simulation model of a hospital operating room and a freestanding center with planned expansion was used to assist planners in analysis of a joint venture among surgeons, the hospital and the center. Methods used for projecting ambulatory surgery demand are described. A general overview of the model, the model inputs, outputs and use in decision-making is discussed.
Mixed Finite Elements for Elliptic Problems with Tensor Coefficients as Cell-Centered Finite Differences
Authors: Todd Arbogast, Mary F. Wheeler, Ivan Yotov
Venue: SIAM Journal on Numerical Analysis (1997)

We present an expanded mixed finite element approximation of second-order elliptic problems containing a tensor coefficient. The mixed method is expanded in the sense that three variables are explicitly approximated, namely, the scalar unknown, the negative of its gradient, and its flux (the tensor coefficient times the negative gradient). The resulting linear system is a saddle point problem. In the case of the lowest order Raviart--Thomas elements on rectangular parallelepipeds, we approximate this expanded mixed method by incorporating certain quadrature rules. This enables us to write the system as a simple, cell-centered finite difference method requiring the solution of a sparse, positive semidefinite linear system for the scalar unknown. For a general tensor coefficient, the sparsity pattern for the scalar unknown is a 9-point stencil in two dimensions and 19 points in three dimensions. Existing theory shows that the expanded mixed method gives optimal order approximations in the $L^2$- and $H^{-s}$-norms (and superconvergence is obtained between the $L^2$-projection of the scalar variable and its approximation). We show that these rates of convergence are retained for the finite difference method. If $h$ denotes the maximal mesh spacing, then the optimal rate is $O(h)$. The superconvergence rate $O(h^{2})$ is obtained for the scalar unknown and rate $O(h^{3/2})$ for its gradient and flux in certain discrete norms; moreover, the full $O(h^{2})$ is obtained in the strict interior of the domain. Computational results illustrate these theoretical results.
Learning in the &ldquo;Real World&rdquo;
Authors: Lorenza Saitta, Filippo Neri
Venue: Machine Learning (1998)

In this paper we define and characterize the process of developing a &ldquo;real-world&rdquo; Machine Learning application, with its difficulties and relevant issues, distinguishing it from the popular practice of exploiting ready-to-use data sets. To this aim, we analyze and summarize the lessons learned from applying Machine Learning techniques to a variety of problems. We believe that these lessons, though primarily based on our personal experience, can be generalized to a wider range of situations and are supported by the reported experiences of other researchers.
Constructions and Properties of k out of nVisual Secret Sharing Schemes
Authors: Eric R. Verheul, Henk C. A. Van Tilborg
Venue: Designs, Codes and Cryptography (1997)

The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.
LOGEX&mdash;an automatic logic extractor form transistor to gate level for CMOS technology
Authors: Michael Boehner
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A program for automatic extraction of a gate level description from a transistor level description based on the layout of a CMOS VLSI circuit is presented. The extraction algorithm combines transistors to gates of arbitrary complexity without the help of any cell library. The resulting gate level description provides the input for a digital logic simulator for further investigations.
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
Authors: Gleb Naumovich, George S. Avrunin
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

Information about which pairs of statements in a concurrent program can execute in parallel is important for optimizing and debugging programs, for detecting anomalies, and for improving the accuracy of data flow analysis. In this paper, we describe a new data flow algorithm that finds a conservative approximation of the set of all such pairs. We have carried out an initial comparison of the precision of our algorithm and that of the most precise of the earlier approaches, Masticola and Ryder's non-concurrency analysis [8], using a sample of 159 concurrent Ada programs that includes the collection assembled by Masticola and Ryder. For these examples, our algorithm was almost always more precise than non-concurrency analysis, in the sense that the set of pairs identified by our algorithm as possibly happening in parallel is a proper subset of the set identified by non-concurrency analysis. In 132 cases, we were able to use reachability analysis to determine exactly the set of pairs of statements that may happen in parallel. For these cases, there were a total of only 10 pairs identified by our algorithm that cannot actually happen in parallel.
The exponential hash function
Authors: Bradley J. Smith, Gregory L. Heileman
Venue: Journal of Experimental Algorithmics (JEA) (1997)

In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter choices are provided for a number of hash functions. We also demonstrate experimentally that exponential hashing essentially matches the performance of a widely-used optimal double hash function for uniform data distributions, and performs significantly better for nonuniform data distributions. We show that exponential hashing exhibits a higher integer Lyapunov exponent and entropy than double hashing for initial data probes, which offers one explanation for its improved performance on nonuniform data distributions.
Robust estimation in software experiments
Authors: Yeh-Ling Chen, Arnold J. Stromberg
Venue: ACM SIGSOFT Software Engineering Notes (1997)

"Software development, like other scientific developments, requires formal experiments with a great deal of plan and analysis if they are to provide meaningful results"[11]. This paper uses examples to extend the discussion to certain statistical analyses, i.e., robust estimation and variance modeling, which are relatively new and may have never been practiced in the software engineering field.
Pattern-independent current estimation for reliability analysis of CMOS circuits
Authors: Richard Burch, Farid Najm, Ping Yang, Dale Hocevar
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Accurate and efficient expected current estimation is required in circuit designs to analyze electromigration failure rate, power consumption, voltage drop, etc. A new pattern-independent simulation approach for estimating this expected current waveform drawn by CMOS circuitry has been developed. Four original concepts, probability waveforms, probability waveform propagation, probabilistic circuit model, and statistical timing analysis, are presented which allow an efficient and accurate estimation of expected current waveforms. This approach is dramatically faster than traditional methods and yields comparable results.
Scalable Test Generators for High-Speed Datapath Circuits
Authors: Hussain Al-Asaad, John P. Hayes, Brian T. Murray
Venue: Journal of Electronic Testing: Theory and Applications (1998)

This paper explores the design of efficient test sets and test-pattern generators for on-line BIST. The target applications are high-performance, scalable datapath circuits for which fast and complete fault coverage is required. Because of the presence of carry-lookahead, most existing BIST methods are unsuitable for these applications. High-level models are used to identify potential test sets for a small version of the circuit to be tested. Then a regular test set is extracted and a test generator TG is designed to meet the following goals: scalability, small test set size, full fault coverage, and very low hardware overhead. TG takes the form of a twisted ring counter with a small decoder array. We apply our technique to various datapath circuits including a carry-lookahead adder, an arithmetic-logic unit, and a multiplier-adder.
Type specialisation for imperative languages
Authors: Dirk Dussart, John Hughes, Peter Thiemann
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

We extend type specialisation to a computational lambda calculus with first-class references. The resulting specialiser has been used to specialise a self-interpreter for this typed computational lambda calculus optimally. Furthermore, this specialiser can perform operations on references at specialisation time, when possible.
Data structures for efficient broker implementation
Authors: Anthony Tomasic, Luis Gravano, Calvin Lue, Peter Schwarz, Laura Haas
Venue: ACM Transactions on Information Systems (TOIS) (1997)

With the profusion of text databases on the Internet, it is becoming increasingly hard to find the most useful databases for a given query. To attack this problem, several existing and proposed systems employ brokers to direct user queries, using a local database of summary information about the available databases. This summary information must effectively distinguish relevant databases and must be compact while allowing efficient access. We offer evidence that one broker, GlOSS, can be effective at locating databases of interest even in a system of hundreds of databased and can examine the performance of accessing the GlOSS summeries for two promising storage methods: the grid file and partitioned hashing. We show that both methods can be tuned to provide good performance for a particular workload (within a broad range of workloads), and we discuss the tradeoffs between the two data structures. As a side effect of our work, we show that grid files are more broadly applicable than previously thought; inparticular, we show that by varying the policies used to construct the grid file we can provide good performance for a wide range of workloads even when storing highly skewed data.
Text compression using prediction
Authors: Jukka Teuhola, Timo Raita
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

In the compression of the text files, the dependencies between the successive characters should be exploited to as great an extent as possible. There are two obvious possibilities: either to detect and encode often occurring character strings, or to encode successors of character blocks. This paper presents two methods based on the latter approach. In the first method we encode only the most probable successors of blocks, whereas in the second we encode them all, using the knowledge of their distribution. The second method uses recursion to store effectively the dependencies between the characters and this results in good compression gains in practical cases.
Overlapping Block-Balanced Canonical Forms and Parametrizations: The Stable SISO Case
Authors: Bernard Hanzon, Raimund J. Ober
Venue: SIAM Journal on Control and Optimization (1997)

The balanced canonical form and parametrization of Ober for the case of SISO stable systems are extended to block-balanced canonical forms and related input-normal forms and parametrizations. They form an overlapping atlas of parametrizations of the manifold of stable SISO systems of given order. This extends the usefulness of these parametrizations, e.g., in gradient algorithms for system identification. As an implication of our construction it follows that each of the subsets of the parametrization of [R. Ober, Internat. J. Control, 46 (1987), pp. 643--670] corresponding to a choice for the structural indices is in fact an imbedded submanifold of the manifold of stable SISO systems of fixed order.
High dictionary compression for proactive password checking
Authors: Francesco Bergadano, Bruno Crispo, Giancarlo Ruffo
Venue: ACM Transactions on Information and System Security (TISSEC) (1998)

The important problem of user password selection is addressed and a new proactive password-checking technique is presented. In a training phase, a decision tree is generated based on a given dictionary of weak passwords. Then, the decision tree is used to determine whether a user password should be accepted. Experimental results described here show that the method leads to a very high dictionary compression (up to 1000 to 1) with low error rates (of the order of 1%). A prototype implementation, called ProCheck, is made available online. We survey previous approaches to proactive password checking, and provide an in-depth comparison.
An electrical optimizer that considers physical layout
Authors: Fred W. Obermeier, Randy H. Katz
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Electrical performance and area improvement are important parts of the overall VLSI design task. Given designer specified constraints on area, delay, and power, EPOXY will size a circuit's transistors and will attempt small circuit changes to help meet the constraints. In addition, the system provides a flexible framework within which to evaluate the effects of different area and electrical models, as well as different optimization algorithms. Since the sum of transistor area is a better measure of dynamic power than cell area, a more accurate area model is presented. Optimization of a CMOS eight-stage inverter chain illustrates this difference; a typical minimum power implementation is 32.3% larger than the one for minimum area. The combination of a TILOS-style heuristic and augmented Lagrangian optimization algorithm yields quality results rapidly. EPOXY'S circuit analysis is from 5 to 56 times faster than Crystal.
Performance analysis in a differential file environment
Authors: Timothy R. Hill, Ananth Srinivasan
Venue: Proceedings of the 17th conference on Winter simulation (1985)

An analysis of filtering characteristics for database differential file design architecture is presented. Shortcomings of previous work on this topic are discussed and a corrected analytical model is proposed. The impact of assumption violations on the analytical model is explored through the use of a computer simulation. The simulation model is described and results are presented, suggesting the sensitivity of the analytical model and providing some direction for further research.
An Efficient Task Allocation Scheme for 2D Mesh Architectures
Authors: Seong-Moo Yoo, Hee Yong Youn, Behrooz Shirazi
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances, irrespective of the size of meshes and distribution of the shape of the incoming tasks.
Some Improvement Of Oppenheim's Inequality For M-Matrices
Authors: Jianzhou Liu, Li Zhu
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

This paper improves Oppenheim's inequality as follows: if $A=(a_{ij})$ is an M-matrix and $B=(b_{ij})$ is an M-matrix or positive definite real symmetric matrix and $A_{k}$ and $B_k$ $ (k=1,2,\ldots,n-1)$ are the $k\times k$ leading principal submatrices of $A$ and $B$, respectively, then $$ \det \left (A\circ B\right )\geq a_{11}b_{11}\prod\limits_{k=2}^{n}\left [b_{kk}\frac {\det A_k}{\det A_{k-1}}+\frac {\det B_k}{\det B_{k-1}}\left (\sum\limits_{i=1}^{k-1}\frac {a_{ik}a_{ki}}{a_{ii}}\right )\right ].$$
The road ahead in CPLD FPGA design methodology (panel)
Authors: Rhondalee Rohleder, John Birkner, Don Faria, Steve Golson, Robert K. Beachler, Bruce Kleinman, Mike Dini, Bob Donaldson, Davie Kohlmeier
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Large capacity CPLD and FPGA design opportunities and challenges are explored by this panel. As densities grow beyond 20,000 gates, there is a disconnect between the cutting-edge EDA tools featured in trade shows and the more ordinary toolsused by the typical programmable logic designer as s/he moves to a higher level design methodology. A three-to-five year roadmap will guide this discussion of the future of synthesis and simulation, the impact of HDLs on complex devices, and the role of intellectual property and universal tools in the CPLD & FPGA designscape.
Efficient simulation model generation using automatic programming techniques
Authors: Jae-Wook Lee, Sungho Kang
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Generating simulation models is a knowledge intensive, time consuming, and error-prone task in implementing a simulator. The main purpose of this research was to find an easy, fast, and reliable way to generate simulation models and model library. To solve this problem, the Automatic Element Routine Generation System (AERO) is developed as an efficient way for automatic model development using domain specific automatic programming techniques. Behavioral and structural models are generated from Boolean equations, truth tables, HDL descriptions, schematic diagrams, or incomplete specifications. Results show that the system could greatly reduce the cost of simulation model generation for CAD systems and, consequently, reduce the design cycle considerably.
Texture mapping 3D models of real-world scenes
Authors: Frederick M. Weinhaus, Venkat Devarajan
Venue: ACM Computing Surveys (CSUR) (1997)

Texture mapping has become a popular tool in the computer graphics industry in the last few years because it is an easy way to achieve a high degree of realism in computer-generated imagery with very little effort. Over the last decade, texture-mapping techniques have advanced to the point where it is possible to generate real-time perspective simulations of real-world areas by texture mapping every object surface with texture from photographic images of these real-world areas. The techniques for generating such perspective transformations are variations on traditional texture mapping that in some circles have become known as the Image Perspective Transformation or IPT technology. This article first presents a background survey of traditional texture mapping. It then continues with a description of the texture-mapping variations that achieve these perspective transformations of photographic images of real-world scenes. The style of the presentation is that of a resource survey rather thatn an in-depth analysis.
A comparison of perturbation analysis techniques
Authors: Michael C. Fu, Jian-Qiang Hu
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Perturbation analysis (PA) is a technique for estimating gradients of performance measures, particularly applicable to the simulation of discrete-event systems. Over the past two decades, various "versions" have been developed. In this paper, we compare and contrast some of these perturbation analysis techniques by applying them to a simple example. This example also serves to highlight the issue of process representation that can play a very crucial role in the application of perturbation analysis.
On the Dealer&lsquo;s Randomness Required in Secret Sharing Schemes
Authors: C. Blundo, A. Giorgio Gaggia, D. R. Stinson
Venue: Designs, Codes and Cryptography (1997)

In this paper we provide upper and lower bounds on the randomness required by the dealer to set up a secret sharing scheme for infinite classes of access structures. Lower bounds are obtained using entropy arguments. Upper bounds derive from a decomposition construction based on combinatorial designs (in particular, t-(v,k,&lambda;) designs). We prove a general result on the randomness needed to construct a scheme for the cycle Cn; when n is odd our bound is tight. We study the access structures on at most four participants and the connected graphs on five vertices, obtaining exact values for the randomness for all them. Also, we analyze the number of random bits required to construct anonymous threshold schemes, giving upper bounds. (Informally, anonymous threshold schemes are schemes in which the secret can be reconstructed without knowledge of which participants hold which shares.)
Firmware approach to fast Lisp interpreter
Authors: Hiroshi G. Okuno, Nobuyasu Osato, Ikuo Takeuchi
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

The approach to speed up a Lisp interpreter by implementing it in firmware seems promising. A microcoded Lisp interpreter shows good performance for very simple benchmarks, while it often fails to provide good performance for larger benchmarks and applications unless speedup techniques are devised for it. This was the case for the TAO/ELIS system. This paper describes various techniques devised for the TAO/ELIS system in order to speed up the interpreter of the TAO language implemented on the ELIS Lisp machine. The techniques include data type dispatch, variable access, function call and so on. TAO is not only upward compatible with Common Lisp, but also incorporates logic programming, object-oriented programming and Fortran/C-like programming into Lisp programming. TAO also provides concurrent programming and supports multiple users (up to eight users). The TAO interpreter for those programming paradigms is coded fully in microcodes. In spite of rich functionalities, the speed of interpreted codes of TAO is comparable to that of compiled codes of commercial Lisp machines. Furthermore, the speeds of the interpreted codes of the same program written in various programming paradigms in TAO does not differ so much. This speed balance is very important for the user. Another outstanding feature of the TAO/ELIS system is its firmware development environments. Micro Assembler and Linker are written in TAO, which enables the user to use the capability of TAO in microcodes. Since debugging tools are also written in a mini-Lisp, many new tools were developed in parallel to debugging of microcodes. This high level approach to firmware development environments is very important to provide high productivity of development.
(invited paper) A new theoretical framework for information retrieval
Authors: C. J. van Rijsbergen
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

A new framework based on a non-classical logic is proposed for investigating IR. The paper motivates the use of a particular conditional logic as the 'right' logic for IR. A new principle, the logical uncertainty principle, is proposed, to deal with the inherent uncertainty associated with applicable inferences.