ppxscal/embedding_network huggingface dataset:
Nightmare on Westwood Avenue: product development laboratory: success, failure, both, neither???
Authors: Mary Lou Dorf, Gerald R. Heuring
Venue: ACM SIGCSE Bulletin (1996)

Traditionally, computer software development courses have produced projects with small numbers of homogeneous users requiring limited maintenance and which run on a single platform as opposed to products which are distributed to large numbers of diverse users, run on multiple platforms, and which are upgraded and re-released many times. The NSF/ILI-IG grant with the university match provided funding to establish a software product development laboratory in an effort to provide students with the product development experience that many will need upon graduation.This paper discusses the concept for, the goals and subgoals of, and the first year's evaluation of the Product Development Laboratory.
Parametricity and local variables
Authors: P. W. O'Hearn, R. D. Tennent
Venue: Journal of the ACM (JACM) (1995)

We propose that the phenomenon of local state may be understood in terms of Strachey's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our proposal is the following analogy: a non-local procedure is independent of locally-declared variables in the same way that a parametrically polymorphic function is independent of types to which it is instantiated.A connection between parametricity and representational abstraction was first suggested by J.C. Reynolds. Reynolds used logical relations to formalize this connection in languages with type variables and user-defined types. We use relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria. Reasoning about local variables essentially involved proving properties of polymorphic functions. The new model supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics, and encompasses standard methods of reasoning about data representations. It is not known whether our techniques yield fully abstract semantics. A model based on partial equivalence relations on the natural numbers is also briefly examined.
A language-oriented data modeling approach
Authors: Geoffrey Steinberg, Jicheng Lin
Venue: ACM SIGMIS Database (1996)

This paper presents a fresh data modeling tool: Language-Oriented Data Modeling (LODM). The language used is the English language. After a brief summary of previous research in this field, the paper discusses the theoretical under-pinnings of the LODM approach from the perspectives of both relational theory and linguistic theory. The paper then illustrates the implementation of LODM with a research prototype tool, "Database Designer." Through a step-by-step description of the stages involved in using this new tool, the paper addresses the linguistic and database issues encountered in the process of mapping English sentences into a relational schema. In discussing the robustness of the LODM tool, the paper presents both its strengths and its weakness.
Super-criticality revisited
Authors: Sudhir Srinivasan, Paul F. Reynolds,  Jr.
Venue: Proceedings of the ninth workshop on Parallel and distributed simulation (1995)

Critical path analysis has been suggested as a technique for establishing a lower bound on the completion times of parallel discrete event simulations. A protocol is super-critical if there is at least one simulation that can complete in less than the critical path time using that protocol. Previous studies have shown that several practical protocols are super-critical while others are not. We present a sufficient condition to demonstrate that a protocol is super-criticality. It has been claimed that super-criticality requires independence of one or more messages (states) on events in the logical past of those messages (states). We present an example which contradicts this claim and examine the implications of this contradiction on lower bounds.
Workflow automation: applications, technology and research
Authors: Amit Sheth
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

With increasing global exposure, today's enterprises must react quickly to changes, rapidly develop new services and products, and at the same time improve productivity and quality and reduce cost. Business process re-engineering and workflow automation to coordinate activities throughout the enterprise are recognized as important emerging technologies to support these requirements. Rosy estimates of a multi-billion dollar marketplace for workflow software has resulted in significant commercial activities in the area, with nearly hundred products now claiming to support workflow automation. While many help to automate document- and image-driven office applications, therefore helping to improve the productivity of small groups, most current products fail to support: bull; mission critical and enterprise-wide applications with requirements such as failure handling and recovery, and bull; interoperability with existing heterogeneous information systems.In this tutorial, we will discuss requirements for applications involving workflow automation, present an overview of the current state-of-the-art in products, and present some of the research efforts that are attempting to respond to unmet challenges.
A parallel software infrastructure for structured adaptive mesh methods
Authors: Scott R. Kohn, Scott B. Baden
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

Structured adaptive mesh algorithms dynamically allocate computational resources to accurately resolve interesting portions of a numerical calculation. Such methods are difficult to implement and parallelize because they rely on dynamic, irregular data structures. We have developed an efficient, portable, parallel software infrastructure for adaptive mesh methods; our software provides computational scientists with high-level facilities that hide low-level details of parallelism and resource management. We have applied our software infrastructure to the solution of adaptive eigenvalue problems arising in materials design. We describe our software infrastructure and analyze its performance. We also present computational results which indicate that the uniformity restrictions imposed by a data parallel Fortran implementation of a structured adaptive mesh application would significantly impact performance.
Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations
Authors: Kemal Efe, Venkatesh Krishnamoorthy
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In a network of high performance workstations, many workstations are underutilized by their owners. The problem of using these idle cycles for solving computationally intensive tasks by executing a large task on many workstations has been addressed before [1] and algorithms with $O(N^2)$ time and $O(N)$ space for choosing the optimal subset of workstations out of $N$ workstations were presented. We improve these algorithms to reduce the running time to $O(N \log N)$, while keeping the space requirement the same. The proposed algorithms are particularly useful for SPMD parallelism where computation is the same for all workstations and the data space is partitioned between the workstations.Index Terms¿Task scheduling, SPMD computations, resource allocation, distributed operating systems, networks of workstations.
1995 high level synthesis design repository
Authors: Preeti R. Panda, Nikil D. Dutt
Venue: Proceedings of the 8th international symposium on System synthesis (1995)

Abstract: In this paper we briefly describe a set of designs that earn serve as examples for high level synthesis (HLS) systems. The designs vary in complexity from simple behavioral finite state machines to more complex designs such as microprocessors and floating point units. Most of the designs are described in the VHDL language at the behavioral level. We divide the designs into two categories. The first category contains designs that have documentation on the specifications of the designs along with the strategy used to test the individual design models. The second category contains examples used in many HLS papers, but lack comprehensive documentation and/or test vectors.
Demonstrational and constraint-based techniques for pictorially specifying application objects and behaviors
Authors: Brad Vander Zanden, Brad A. Myers
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1995)

The Lapidary interface design tool is a demonstrational system that allows the graphics and run-time behaviors that go inside an application window to be specified pictorially. In particular, Lapidary allows the designer to draw example pictures of application-specific graphical objects that the end user will manipulate (such as boxes, arrows, or elements of a list), the feedback that shows which objects are selected (such as small boxes on the sides and corners of an object), and the dynamic feedback objects (such as hairline boxes to show where an object is being dragged). The run-time behavior of all these objects can be specified ina straightforward way using constraints, demonstration, and dialog boxes that allow the designer to provide abstract descriptions of the interactive response to the input devices. Lapidary generalizes from these specific example pictures and behaviors to create prototype objects and behaviors from which instances can be made at run-time. A novel feature of Lapidary's implementation is its use of constraints that have been explicitly specified by the designer to help it generalize example objects and behaviors and to guide it in making inferences.
Concrete multidimensional statistics in APL2
Authors: Bernhard Strohmeier
Venue: ACM SIGAPL APL Quote Quad (1995)

This paper deals with problems which occur in discrete multi-dimensional statistics and shows how they are solved using APL2. In particular, the APL2 feature primitive function with axis proves to be helpful and allows smart solutions to the problems of computing conditional probability tables and performing the iterative proportional fitting procedure. The implementation is done using the literate APL2-style.
A Uniqueness Result for the Linear System of Elasticity and Its Control Theoretical Consequences
Authors: Enrique Zuazua
Venue: SIAM Journal on Control and Optimization (1996)

We consider the time-dependent linear system of three-dimensional elasticity for an homogeneous and isotropic elastic body $\Omega$ with Dirichlet boundary conditions. We prove that when the domain $\Omega$ is of class $C^{2}$ and is not symmetric with respect to a plane parallel to $x_3=0$, any solution whose first two components vanish in some open subset of $\Omega$ for a large enough time interval has to be identically zero. The proof of this uniqueness result can be reduced to show that solutions of the scalar wave equation with zero Dirichlet boundary conditions that are of the form $u(x,y,z,t)=arphi(x,y,t)+\psi(z,t)$ have to be identically zero. This result depends not only on the length of the time interval but also on the geometry of the domain. As a consequence of this uniqueness result we prove that the linear system of elasticity is approximately controllable by means of planar volume forces with zero third component. We show that these results fail for some Lipschitz domains that are piecewise smooth and symmetric with respect to the plane $x_3=0$.
Decomposition of Arbitrarily Shaped Morphological Structuring Elements
Authors: Hochong Park, Roland T. Chin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

For image processing systems that have a limited size of region of support, say 3 × 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of large morphological operations. In this paper, we present the decomposition of arbitrarily shaped (convex or concave) structuring elements into 3 × 3 elements, optimized with respect to the number of 3 × 3 elements. The decomposition is based on the concept of factorization of a structuring element into its prime factors. For a given structuring element, all its corresponding 3 × 3 prime concave factors are first determined. From the set of the prime factors, the decomposability of the structuring element is then established, and subsequently the structuring element is decomposed into a smallest possible set of 3 × 3 elements. Examples of optimal decomposition and structuring elements that are not decomposable are presented.
CUTE: constrained and unconstrained testing environment
Authors: I. Bongartz, A. R. Conn, Nick Gould, Ph. L. Toint
Venue: ACM Transactions on Mathematical Software (TOMS) (1995)

The purpose of this article is to discuss the scope and functionality of a versatile environment for testing small- and large-scale nonlinear optimization algorithms. Although many of these facilities were originally produced by the authors in conjunction with the software package LANCELOT, we believe that they will be useful in their own right and should be available to researchers for their development of optimization software. The tools can be obtained by anonymous ftp from a number of sources and may, in many cases, be installed automatically. The scope of a major collection of test problems written in the standard input format (SIF) used by the LANCELOT software package is described. Recognizing that most software was not written with the SIF in mind, we provide tools to assist in building an interface between this input format and other optimization packages. These tools provide a link between the SIF and a number of existing packages, including MINOS and OSL. Additionally, as each problem includes a specific classification that is designed to be useful in identifying particular classes of problems, facilities are provided to build and manage a database of this information. There is a Unix and C shell bias to many of the descriptions in the article, since, for the sake of simplicity, we do not illustrate everything in its fullest generality. We trust that the majority of potential users are sufficiently familiar with Unix that these examples will not lead to undue confusion.
An Interface to a Reliable Packet Delivery Service for Parallel Systems
Authors: Mark Debbage, Mark B. Hill, Denis A. Nicole
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Modern distributed memory parallel computers provide hardware support for the efficient and reliable delivery of interprocessor messages. This facility needs to be accessed by lightweight protocols that do not waste the performance of the underlying hardware; the heavyweight layering techniques traditionally used in distributed systems are wholly inappropriate. A low-level communication interface is therefore presented which exploits modern architectures effectively, while maintaining a good match to existing parallel programming environments. The interface defines mechanisms to access an asynchronous reliable packet delivery service. It permits messaging protocols to be efficiently synthesized by considering the activity at their end-points alone. This arrangement effectively decouples the implementation of protocols from low-level architectural features, and hence aids the portability of parallel programming environments. Furthermore, the interface allows the communication network to be shared by multiple programming paradigms, giving additional flexibility over existing systems.Index Terms¿Communication networks, multicomputers, packet routing, parallel processing, protocol support, standard interface.
Correlation of Boolean Functions and Pathology in Recursion Trees
Authors: Ingo Althofer, Imre Leader
Venue: SIAM Journal on Discrete Mathematics (1995)

A Boolean function $f : \{0, 1\}^{n} \rightarrow \{0, 1\}$ is called trivial if it depends on only one coordinate. We show that nontrivial Boolean functions of positively correlated random variables are strictly less correlated than the variables themselves. This improves on a correlation inequality of Witsenhausen. Over the last decade, several people in computer science and computer chess have investigated the problem of quality and reliability in game-tree searching, where the heuristic evaluation function is not free of errors. In random models with independent leaf values and independently occuring errors, a phenomenon of pathology was observed: the deeper the search in the tree, the worse the final estimate of the root value. The main result of this note implies that pathology is not only a feature of game trees, but appears in any sequence of increasing bivalued recursion trees with independent leaf values, independently occuring errors, and nontrivial recursion rules.
Introduction to SIMAN/Cinema
Authors: David M. Profozich, David T. Sturrock
Venue: Proceedings of the 27th conference on Winter simulation (1995)

SIMAN/Cinema V is a general-purpose simulation language and animation system designed to model discrete event, continuous, and combined discrete/ continuous systems. SIMAN/Cinema V are best known today as the core technologies of the Arena Simulation System. Arena, an object-based simulation development system, provides an environment for analysts to rapidly develop SIMAN/Cinema V applications by interacting with high-level graphical objects. This paper presents an overview of the SIMAN/Cinema V modeling capabilities and describes some of the recent enhancements to the software.
Encoding of a priori Information in Active Contour Models
Authors: Bjørn Olstad, Anders H. Torp
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

The theory of active contours models the problem of contour recovery as an energy minimization process. The computational solutions based on dynamic programming require that the energy associated with a contour candidate can be decomposed into an integral of local energy contributions. In this paper we propose a grammatical framework that can model different local energy models and a set of allowable transitions between these models. The grammatical encodings are utilized to represent a priori knowledge about the shape of the object and the associated signatures in the underlying images. The variability encountered in numerical experiments is addressed with the energy minimization procedure which is embedded in the grammatical framework. We propose an algorithmic solution that combines a nondeterministic version of the Knuth-Morris-Pratt algorithm for string matching with a time-delayed discrete dynamic programming algorithm for energy minimization. The numerical experiments address practical problems encountered in contour recovery such as noise robustness and occlusion.
Impossibility of distributed consensus with one faulty process
Authors: Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson
Venue: Journal of the ACM (JACM) (1985)

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the &ldquo;Byzantine Generals&rdquo; problem.
An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
Authors: Jennifer A. Scott
Venue: ACM Transactions on Mathematical Software (TOMS) (1995)

Arnoldi methods can be more effective than subspace iteration methods for computing the dominant eigenvalues of a large, sparse, real, unsymmetric matrix. A code, EB12, for the sparse, unsymmetric eigenvalue problem based on a subspace iteration algorithm, optionally combined with Chebychev acceleration, has recently been described by Duff and Scott and is included in the Harwell Subroutine Library. In this article we consider variants of the method of Arnoldi and discuss the design and development of a code to implement these methods. The new code, which is called EB13, offers the user the choice of a basic Arnoldi algorithm, an Arnoldi algorithm with Chebychev acceleration, and a Chebychev preconditioned Arnoldi algorithm. Each method is available in blocked and unblocked form. The code may be used to compute either the rightmost eigenvalues, the eigenvalues of largest absolute value, or the eigenvalues of largest imaginary part. The performance of each option in the EB13 package is compared with that of subspace iteration on a range of test problems, and on the basis of the results, advice is offered to the user on the appropriate choice of method. &mdash;Author's Abstract
Much ado about shared-nothing
Authors: Michael G. Norman, Thomas Zurek, Peter Thanisch
Venue: ACM SIGMOD Record (1996)

In a 'shared-nothing' parallel computer, each processor has its own memory and disks and processors communicate by passing messages through an interconnect. Many academic researchers, and some vendors, assert that shared-nothingness is the 'consensus' architecture for parallel DBMSs. This alleged consensus is used as a justification for simulation models, algorithms, research prototypes and even marketing campaigns. We argue that shared-nothingness is no longer the consensus hardware architecture and that hardware resource sharing is a poor basis for categorising parallel DBMS software architectures if one wishes to compare the performance characteristics of parallel DBMS products.
On subtyping and matching
Authors: Martín Abadi, Luca Cardelli
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1996)

A relation between recursive object types, called matching, has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded subtyping (as was originally intended). We show that a new interpretation of matching as higher-order subtyping has better properties. Matching turns out to be a third-order construction, possibly the only one to have been proposed for general use in programming.