ppxscal/embedding_network huggingface dataset:
Simulation model design
Authors: Paul A. Fishwick
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Presents a structure for defining and categorizing simulation model designs. In the past, simulation researchers have created categories for discrete event simulation: event, process and activity; however, there are problems with this breakdown. First, the major problem is that the taxonomy based on these three sub-types deals with only discrete event methods. Discrete time methods including a spatial decomposition of a physical system (cellular automata, L-Systems) or a continuous model are not included. Second, the terms "event", "process" and "activity" create a division among classes of simulation languages, rather than a division based on model design. The term "process", for example, is really a level of abstraction higher than "event" and is not orthogonal to "event." The structure that we present in this talk is more comprehensive and provides simulationists with a unified framework that is independent of the terms discrete and continuous.
The application of second natural language acquisition pedagogy to the teaching of programming languages&mdash;a research agenda
Authors: Stephanie A. Robertson, Martin P. Lee
Venue: ACM SIGCSE Bulletin (1995)

The writing of programs is one of the central activities in computer science education, yet frequently it is poorly taught. In this paper we argue that some of the most recent principles emerging from research into and the successful teaching of second natural languages might be applied to the teaching of programming languages.The paper begins by reviewing the historical development of the teaching of both second natural languages and programming languages. It continues with a manifesto for potential research areas, in order to test these ideas further.
Access in Seattle
Authors: Marian Sherwood
Venue: 3C ON-LINE (1996)

Jamestown Community College offers a two-course sequence in Microcomputer Applications through which our students gain an in-depth knowledge of PC-based word processing, spreadsheets, and database management. Throughout both courses, the integration of these packages is stressed. In the second course, the students are expected to design and build an application system for a small business that utilizes advanced features of each software package. The major focus of the second course is on database design and programming. Prior to the fall 1995 semester, both courses were taught using WordPerfect 6.0, Lotus 1-2-3 release 5, and dBASE 5.0. However Microsoft Office has come to dominate the PC office application market in our immediate and surrounding communities. Accordingly, we switched this fall to Microsoft Office for both courses.
An Experimental Comparison of Autoregressive and Fourier-Based Descriptors in 2D Shape Classification
Authors: Hannu Kauppinen, Tapio Seppänen, Matti Pietikäinen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

An experimental comparison of shape classification methods based on autoregressive modeling and Fourier descriptors of closed contours is carried out. The performance is evaluated using two independent sets of data: images of letters and airplanes. Silhouette contours are extracted from non-occluded 2D objects rotated, scaled, and translated in 3D space. Several versions of both types of methods are implemented and tested systematically. The comparison clearly shows better performance of Fourier-based methods, especially for images containing noise.
The Effects of Layering and Encapsulation on Software Development Cost and Quality
Authors: Stuart H. Zweben, Stephen H. Edwards, Bruce W. Weide, Joseph E. Hollingsworth
Venue: IEEE Transactions on Software Engineering (1995)

Software engineers often espouse the importance of using abstraction and encapsulation in developing software components. They advocate the ¿layering¿ of new components on top of existing components, using only information about the functionality and interfaces provided by the existing components. This layering approach is in contrast to a ¿direct implementation¿ of new components, utilizing unencapsulated access to the representation data structures and code present in the existing components. By increasing the reuse of existing components, the layering approach intuitively should result in reduced development costs, and in increased quality for the new components. However, there is no empirical evidence that indicates whether the layering approach improves developer productivity or component quality. We discuss three controlled experiments designed to gather such empirical evidence. The results support the contention that layering significantly reduces the effort required to build new components. Furthermore, the quality of the components, in terms of the number of defects introduced during their development, is at least as good using the layered approach. Experiments such as these illustrate a number of interesting and important issues in statistical analysis. We discuss these issues because, in our experience, they are not well-known to software engineers.
User interface metrics
Authors: Peter Kokol, Ivan Rozman, Vlado Venuti
Venue: ACM SIGPLAN Notices (1995)

The most important part of the majority of recent computer software systems, according to the users view, is the user interface. In this paper authors present some new metrics devoted to the assessment of some user interface characteristics.
Clusters, meta-clusters, and digital libraries: digital libraries for scientific, engineering and medical applications
Authors: S. Bailey, R. L. Grossman, D. Hanley
Venue: ACM SIGWEB Newsletter (1995)

We describe the architectural design and our early experience with scientific, engineering, and medical digital libraries that we have developed as part of the National Scalable Cluster Project (NSCP). Our goal is to develop an infrastructure for scalable, interactive digital libraries supporting high performance computing and high performance data management which interfaces to and interoperates with the World Wide Web (WWW).
Sensitivity analysis and optimization in simulation: design of experiments and case studies
Authors: Jack P. C. Kleijnen
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This paper is an advanced tutorial on the use of statistical techniques in sensitivity analysis, including the application of these techniques to optimization and validation of simulation models. Sensitivity analysis is divided into two phases. The first phase is a pilot stage, which consists of screening or searching for the important factors; a simple technique is sequential bifurcation. In the second phase, regression analysis is used to approximate the input/output behavior of the simulation model. This regression analysis gives better results when the simulation experiment is well designed, using classical statistical designs such as fractional factorials. To optimize the simulated system, Response Surface Methodology (RSM) is applied; RSM combines regression analysis, design of experiments, and steepest ascent. To validate a simulation model that lacks input/output data, again regression analysis and design of experiments are applied. Several case studies are summarized; they illustrate how in practice statistical techniques can make simulation studies give more general results, in less time.
Optimal Stopping of a Discrete Markov Process by Two Decision Makers
Authors: Krzysztof Szajowski
Venue: SIAM Journal on Control and Optimization (1995)

In this paper a problem of optimal stopping of the discrete time Markov process by two decision makers in a competitive situation is considered. The zero-sum game approach is adopted. The gain function depends on the states chosen by both decision makers. The random assignment mechanism is used when both want to accept the realization of the Markov process at the same moment. The construction of the value function and the optimal strategies for the players are given. Examples related to the generalization of the best choice problem are solved.
On the Effect of Defect Clustering on Test Transparency and IC Test Optimization
Authors: A. D. Singh, C. M. Krishna
Venue: IEEE Transactions on Computers (1996)

We recently proposed a wafer-based testing approach which for the first time employs defect clustering information on the wafer to optimize test cost and defect levels in the shipped product. Preliminary analysis of this approach had implicitly assumed that the probability that a test detects a faulty circuit is independent of the number of faults in that circuit. This assumption may be optimistic. In this correspondence, we study the effect of clustering and test transparency on defect distributions in individual dice, and its impact on the fault detection capabilities of a given test set. We show here that significant defect-level improvements in the shipped product can indeed be achieved by exploiting defect clustering in optimization testing.
Resource-Constrained Software Pipelining
Authors: Alexander Aiken, Alexandru Nicolau, Steven Novack
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

This paper presents a software pipelining algorithm for the automatic extraction of fine-grain parallelism in general loops. The algorithm accounts for machine resource constraints in a way that smoothly integrates the management of resource constraints with software pipelining. Furthermore, generality in the software pipelining algorithm is not sacrificed to handle resource constraints, and scheduling choices are made with truly global information. Proofs of correctness and the results of experiments with an implementation are also presented.
The roles of digital libraries in teaching and learning
Authors: Gary Marchionini, Hermann Maurer
Venue: Communications of the ACM (1995)

Libraries have long served crucial roles in learning. The first great library, in Alexandria 2,000 years ago, was really the first university. It consisted of a zoo and various cultural artifacts in addition to much of the ancient world's written knowledge and attracted scholars from around the Mediterranean, who lived and worked in a scholarly community for years at a time. Today, the rhetoric associated with the National/Global Information Infrastructure (N/GII) always includes examples of how the vast quantities of information that global networks provide (i.e., digital libraries) will be used in educational settings [16].
Efficient context-sensitive pointer analysis for C programs
Authors: Robert P. Wilson, Monica S. Lam
Venue: ACM SIGPLAN Notices (1995)

This paper proposes an efficient technique for context-sensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We can reuse a PTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful&mdash;a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and we show that it runs efficiently for a set of C benchmarks.
Bounded rationality and adaptive agents in economic modeling
Authors: T. Grimm, J. Mitlöhner, W. Schönfeldinger
Venue: Proceedings of the international conference on Applied programming languages (1995)

Traditional economic theory sees human economic decisions as rational choices of action to achieve maximum utility. However, economic reality shows that people often behave in ways different from that ideal: actions are not always determined rationally; often they are influenced by other factors, such as chance and tradition. In order to describe the behaviour of economic agents in the real world, we take irrationality and adaptation into account: we present work in progress on a market simulation that shows the effects of partly irrational and adaptive consumer buying decisions on the course of action of entrepreneurs.
Dynamic change within workflow systems
Authors: Clarence Ellis, Karim Keddara, Grzegorz Rozenberg
Venue: Proceedings of conference on Organizational computing systems (1995)

Dynamic change is a large and pervasive unsolved problem which surfaces within office systems as well as within software engineering, manufacturing, and numerous other domains. Procedural changes, performed in an ad hoc manner, can cause inefficiencies, inconsistencies, and catastrophic breakdowns within offices. This paper is concerned with dynamic change to procedures in the context of workflow systems. How can we make workflow systems more flexible and open? We believe that part of the answer lies in the study and solution of the dynamic change problem. In this paper, we use a Petri net formalism to analyze structural change within office procedures. As an example, we define a class of change called &ldquo;synthetic cut-over change&rdquo;, and apply our formalism to prove that this class maintains correctness when downsizing occurs.
Test error fluctuations in finite linear perceptrons
Authors: D. Barber, D. Saad, P. Sollich
Venue: Neural Computation (1995)

We examine the fluctuations in the test error induced by random, finite, training and test sets for the linear perceptron of input dimension n with a spherically constrained weight vector. This variance enables us to address such issues as the partitioning of a data set into a test and training set. We find that the optimal assignment of the test set size scales with n2/3.
Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers
Authors: Edward Rothberg
Venue: SIAM Journal on Scientific Computing (1996)

Sparse Cholesky factorization has historically achieved extremely low performance on distributed-memory multiprocessors. We believe that three issues must be addressed to improve this situation: (1) parallel factorization methods must be based on more efficient sequential methods; (2) parallel machines must provide higher interprocessor communication bandwidth; and (3) the sparse matrices used to evaluate parallel sparse factorization performance should be more representative of the sizes of matrices people would factor on large parallel machines. This paper demonstrates that all three of these issues have in fact already been addressed. Specifically, (1) single node performance can be improved by moving from a column-oriented approach, where the computational kernel is level 1 BLAS, to either a panel- or block-oriented approach, where the computational kernel is level 3 BLAS; (2) communication hardware has improved dramatically, with new parallel computers (the Intel Paragon system) providing one to two orders of magnitude higher communication bandwidth than previous parallel computers (the Intel iPSC/860 system); and (3) several larger benchmark matrices are now available, and newer parallel machines offer sufficient memory per node to factor these larger matrices. The result of addressing these three issues is extremely high performance on moderately parallel machines. This paper demonstrates performance levels of 650 double-precision Mflops on 32 nodes of the Intel Paragon system, 1 Gflop on 64 nodes, and 1.7 Gflops on 128 nodes. This paper also does a direct performance comparison between the iPSC/860 and Paragon systems, as well as a comparison between panel- and block-oriented approaches to parallel factorization.
Empirical study of parallel trace-driven LRU cache simulators
Authors: David Nicol, Eric Carr
Venue: ACM SIGSIM Simulation Digest (1995)

This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC92 benchmark programs.
On the combinatorial and algebraic complexity of quantifier elimination
Authors: Saugata Basu, Richard Pollack, Marie-Françoise Roy
Venue: Journal of the ACM (JACM) (1996)

In this paper, a new algorithm for performing quantifier elimination from first order formulas over real closed fields in given. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this data. A new feature of this algorithm is that the role of the algebraic part (the dependence on the degrees of the imput polynomials) and the combinatorial part (the dependence on the number of polynomials) are sparated. Another new feature is that the degrees of the polynomials in the equivalent quantifier-free formula that is output, are independent of the number of input polynomials. As special cases of this algorithm new and improved algorithms for deciding a sentence in the first order theory over real closed fields, and also for solving the existential problem in the first order theory over real closed fields, are obtained.
Exploiting domain architectures in software reuse
Authors: Cristina Gacek
Venue: ACM SIGSOFT Software Engineering Notes (1995)

This paper provides motivation towards the use of domain specific repositories and DSSA's. It shows many of the positive side-effects this usage brings about.An extension to the faceted approach to components classification [Prieto-Diaz and Freeman 1987] is introduced. Our extension suggests a natural way of further benefiting from the use of domain specific repositories.
Hypermedia support for a digital library in CS
Authors: Edward A. Fox
Venue: ACM SIGWEB Newsletter (1995)

Since 1991 we have been developing a digital library (DL) in computer science and applying if for CS education. NSF has founded two large projects focusing in this area, as well as several related efforts. "A User-Centered Database for the Computer Science Literature" ran from 1991 through early 1995, benefited from strong support from ACM, and led to the Envision system [8, 9, 10]. "Interactive Learning With a Digital Library in Computer Science" [6, 7] runs from 1993 through early 1997, is supported by ACM as well as other publishers like IEEE-CS, includes efforts at Norfolk State University (NSU), and benefits from extensive hypermedia system support. By late April 1995, thirteen courses were supported by this El (NSF Education Infrastructure) project and over forty thousand accesses a week were logged by our server.
Umbriel&mdash;another minimal programming language
Authors: P. D. Terry
Venue: ACM SIGPLAN Notices (1995)

Umbriel is the name of a simple Modula-like programming language, expressly intended for teaching introductory imperative programming.Umbriel, like Oberon, is the name of a moon of Uranus. Miranda is the smallest of her moons, but that name is already bespoke in the programming language game. So is Ariel, the original name chosen for the new language.
Efficient checking of temporal integrity constraints using bounded history encoding
Authors: Jan Chomicki
Venue: ACM Transactions on Database Systems (TODS) (1995)

We present an efficient implementation method for temporal integrity constraints formulated in Past Temporal Logic. Although the constraints can refer to past states of the database, their checking does not require that the entire database history be stored. Instead, every database state is extended with auxiliary relations that contain the historical information necessary for checking constraints. Auxiliary relations can be implemented as materialized relational views.
Applying ethics to information technology issues
Authors: Richard O. Mason
Venue: Communications of the ACM (1995)

The articles in this special section express a common theme; the use of information technology in society is creating a rather unique set of ethical issues that requires the making of new moral choices on the part of society and has spawned special implications for its members. Technology itself is not the only, nor necessarily the most responsible, cause of these issues. All ethical questions arise initially out of human agency. Technology, due to its capability to augment mental and physical powers of human beings, does stand in the role of a coconspirator. The hire of power-enhancing capabilities makes technology an inducer of sorts, a necessary but not sufficient underpinning to many of the ethical issues we face today.
Area and Length Preserving Geometric Invariant Scale-Spaces
Authors: Guillermo Sapiro, Allen Tannenbaum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, area preserving multi-scale representations of planar curves are described. This allows smoothing without shrinkage at the same time preserving all the scale-space properties. The representations are obtained deforming the curve via geometric heat flows while simultaneously magnifying the plane by a homethety which keeps the enclosed area constant. When the Euclidean geometric heat flow is used, the resulting representation is Euclidean invariant, and similarly it is affine invariant when the affine one is used. The flows are geometrically intrinsic to the curve, and exactly satisfy all the basic requirements of scale-space representations. In the case of the Euclidean heat flow, it is completely local as well. The same approach is used to define length preserving geometric flows. A similarity (scale) invariant geometric heat flow is studied as well in this work.
Approximation of the Zakai Equation for Nonlinear Filtering
Authors: Kazufumi Ito
Venue: SIAM Journal on Control and Optimization (1996)

In this paper we consider numerical approximations of solutions to the Zakai equation. Time discretization based on the implicit Milshtein and Euler methods and Galerkin approximation in the spatial coordinates are investigated. Convergence and rate of convergence of approximation methods are established.
Continuous improvement applied to simulation modeling: a case study
Authors: Arun Jayaraman, Jason A. Green, Ali K. Gunal
Venue: Proceedings of the 27th conference on Winter simulation (1995)

A typical transfer machine consists of several synchronous stations served by a common transfer mechanism. Many simulation languages and simulators available today may provide useful constructs that allow detailed modeling of such mechanisms. However, large models involving many entities can be slow to run. The paper presents several techniques that can be used to build accurate and efficient models of systems that include one or more transfer machines and long conveyors. The techniques described in the paper were developed during a simulation study of a large-scale manufacturing system. The overall approach to the modeling also demonstrates the application of the "continuous improvement" concepts in simulation model development.
A Restarted GMRES Method Augmented with Eigenvectors
Authors: Ronald B. Morgan
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that approximate eigenvectors corresponding to a few of the smallest eigenvalues be formed and added to the subspace for GMRES. The convergence can be much faster, and the minimum residual property is retained.