ppxscal/embedding_network huggingface dataset:
Wide-area gigabit networking: Los Alamos HIPPI-SONET gateway
Authors: Wally St. John, Dave DuBois
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

This paper describes a HIPPI-SONET Gateway which has been designed by members of the Computer Network Engineering Group at Los Alamos National Laboratory. The Gateway has been used in the CASA Gigabit Testbed at Caltech, Los Alamos National Laboratory, and the San Diego Supercomputer Center to provide communications between the sites. This paper will also make some qualitative statements as to lessons learned during the deployment and maintenance of this wide area network. We report record throughput for transmission of data across a wide area network. We have sustained data rates using the TCP/IP protocol of 550 Mbits/second and the rate of 792 Mbits/second for raw HIPPI data transfer over the 2,000 kilometers from the San Diego Supercomputer Center to the Los Alamos National Laboratory.
An efficient and secure authentication protocol using uncertified keys
Authors: I.-Lung Kao, Randy Chow
Venue: ACM SIGOPS Operating Systems Review (1995)

Most authentication protocols for distributed systems achieve identification and key distributions on the belief that the use of a uncertified key, i.e. the key whose freshness and authenticity cannot be immediately verified by its receiving principal while being received, should be avoided during the mid-way of an authentication process. In this paper we claim that using a uncertified key prudently can give performance advantages and not necessarily reduces the security of authentication protocols, as long as the validity of the key can be verified at the end of an authentication process. A nonce-based authentication protocol using uncertified keys is proposed. Its total number of messages is shown to be the minimal of all authentication protocols with the same formalized goals of authentication. The properties which make the protocol optimal in terms of message complexity are elaborated, and a formal logical analysis to the protocol is performed. The protocol is extended to counter the session key compromise problem and to support repeated authentication, in a more secure and flexible way without losing its optimality.
Factors influencing electronic data interchange success
Authors: Ali F. Farhoomand, Don H. Drury
Venue: ACM SIGMIS Database (1996)

With the rapid proliferation of electronic data interchange (EDI) in recent years, there has been a growing need for understanding various issues surrounding the adoption, implementation, and evaluation of such systems. In particular, as an increasing number of firms are piloting, implementing, or using EDI, it is becoming crucial to identify the factors that influence the success of EDI. Through a survey of 242 companies that were at different stages of adopting EDI, we show that EDI success is affected by four distinct factors relating to information quality, systems outcomes, user participation, and system quality. Evidence of reliability and validity of the scale, along with some practical standards and evaluation baseline, are provided.
Electronic markets and electronic hierarchies
Authors: Thomas W. Malone, Joanne Yates, Robert I. Benjamin
Venue: Communications of the ACM (1987)

By reducing the costs of coordination, information technology will lead to an overall shift toward proportionately more use of markets&mdash;rather than hierarchies&mdash;to coordinate economic activity.
The multiple prime random number generator
Authors: Alexander Haas
Venue: ACM Transactions on Mathematical Software (TOMS) (1987)

A new pseudorandom number generator, the Multiple Prime Random Number Generator, has been developed; it is efficient, conceptually simple, flexible, and easy to program. The generator utilizes cycles around prime numbers to guarantee the length of the period, which can easily be programmed to surpass the maximum period of any other presently available random number generator. There are minimum limits placed on the seed values of the variables because the period of the generator is not a function of the initial values of the variables. The generator passes thirteen standard random number generator tests. It requires only about fifteen lines of FORTRAN code to program and utilizes programming language constructs found in most major languages. Finally, it compares very favorably to the fastest of the other available generators.
Futures and multiple values in parallel Lisp
Authors: Tanaka Tomoyuki, Uzuhara Shigeru
Venue: ACM SIGPLAN Lisp Pointers (1995)

We consider the impact of introducing the future construct to the multiple value facility in Lisp (Common Lisp and Scheme). A natural way to accommodate this problem is by modifying the implementation of futures so that one future object returns (or resolves to) multiple values instead of one. We first show how a such straightforward modification fails to maintain the crucial characteristic of futures, namely that inserting futures in a functional program does not alter the the result of the computation. A straightforward modification may result in wrong number of values. We then present two methods which we call the mv-context method and the mv-p flag method to overcome this problem. Both of these methods have been tested in TOP-1 Common Lisp, an implementation of a parallel Common Lisp on the TOP-1 multiprocessor workstation. To our knowledge, this problem has never been analyzed nor solved in an implementation of parallel Lisp. We also present the technique of future chain elimination which avoids creation of unnecessary futures and processes at run-time, which was inspired by this solution.
Italy: an explosion of subdisciplines in computer graphics education
Authors: Bianca Falcidieno
Venue: ACM SIGGRAPH Computer Graphics (1996)

Computer graphics is a rapidly expanding field of science and technology, and education in this area is increasingly important. Development in computer graphics and the requirements of different applications have led to an explosion of subdisciplines.These share many fundamental principles, but each has a specialized orientation, with its own techniques and approaches to computer graphics. The basic disciplines, such as geometric modeling of single objects and 2D and 3D scenes, need efficient algorithms that involve computational geometry and knowledge of parallel computation. Other disciplines are oriented toward realistic visualization, and the enhancement of human/machine interaction leads to developing fields such as user interfaces, interactive modeling, multimedia and hypermedia and visual languages. A strong link is also required with related disciplines such as computer vision and image processing.Many of these subjects integrate knowledge derived from different sciences such as mathematics, physics, computer science and engineering, into a variety of applications. In Italy, computer graphics courses are taught in a number of curricula of traditional disciplines such as computer science, mathematics, physics, architecture and engineering. The choice was not to establish specific departments on computer graphics, but to give each discipline an overall sense of computer graphics as a subject into which they can fit their own specialities.This has led a number of universities to propose courses in computer graphics at both fundamental and advanced levels, especially in scientific departments. The variety of topics in computer graphics is so wide that they cannot be easily compressed in one course or a series of courses, but must be split according to the application requirements. A typical feature of computer graphics courses is that they are not usually intended for a single department's students, but they are of broad interest.
An introduction to intelligent operating system KZ2
Authors: Li Xie, Xing Du, Jun Chen, Yuhua Zheng, Zhongxiu Sun
Venue: ACM SIGOPS Operating Systems Review (1995)

This paper proposes an intelligent operating system, KZ2, which is a new generation OS to manage the resources of massively parallel computing systems, to provide a friendly human-computer interface, and control the execution of programs based on knowledge processing and parallel processing. A knowledge based demonstrative example is also described in the paper to show how KZ2 improves the functions and performance of existing operating systems.
Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
Authors: Andre Bouchet, William H. Cunningham
Venue: SIAM Journal on Discrete Mathematics (1995)

This paper relates an axiomatic generalization of matroids, called a jump system, to polyhedra arising from bisubmodular functions. Unlike the case for usual submodularity, the points of interest are not all the integral points in the relevant polyhedron but form a subset of them. However, it is shown that the convex hull of the set of points of a jump system is a bisubmodular polyhedron, and that the integral points of an integral bisubmodular polyhedron determine a (special) jump system. The authors prove addition and composition theorems for jump systems, which have several applications for delta-matroids and matroids.
State event location in differential-algebraic models
Authors: Taeshin Park, Paul I. Barton
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1996)

An efficient discontinuity handling algorithm for initial value problems in differential-algebraic equations is presented. The algorithm supports flexible representation of state conditions in propositional logic, and guarantees the location of all state events in strict time order. The algorithm consists of two phases:(1) event detection and(2) consistent event location. In the event detection phase, the entire integration step is searched for the state event by solving the interpolation polynomials for the discontinuity functions generated by the BDF method. An efficient hierarchical polynomial root-finding procedure based upon interval arithmetic guarantees detection of the state event even if multiple state condition transitions exist in an integration step, in which case many existing algorithms may fail. As a second phase of the algorithm, a consistent even location calculation is developed that accurately locates the state event detected earlier while completely eliminating incorrect reactivation of the same state event immediately after the consistent initialization calculation that may follow. This numerical phenomenon has not been explained before and is termed discontinuity sticking. Results from various test problems are presented to demonstrate the correctness and efficiency of the algorithm.
Graph models for reachability analysis of concurrent programs
Authors: Mauro Pezzè, Richard N. Taylor, Michal Young
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1995)

The problem of analyzing concurrent systems has been investigated by many researchers, and several solutions have been proposed. Among the proposed techniques, reachability analysis&mdash;systematic enumeration of reachable states in a finite-state model&mdash;is attractive because it is conceptually simple and relatively straightforward to automate and can be used in conjunction with model-checking procedures to check for application-specific as well as general properties. This article shows that the nature of the translation from source code to a modeling formalism is of greater practical importance than the underlying formalism. Features identified as pragmatically important are the representation of internal choice, selection of a dynamic or static matching rule, and the ease of applying reductions. Since combinatorial explosion is the primary impediment to application of reachability analysis, a particular concern in choosing a model is facilitating divide-and-conquer analysis of large programs. Recently, much interest in finite-state verification systems has centered on algebraic theories of concurrency. Algebraic structure can be used to decompose reachability analysis based on a flowgraph model. The semantic equivalence of graph and Petri net-based models suggests that one ought to be able to apply a similar strategy for decomposing Petri nets. We describe how category-theoretic treatments of Petri nets provide a basis for decomposition of Petri net reachability analysis.
The power of assignment motion
Authors: Jens Knoop, Oliver Rüthing, Bernhard Steffen
Venue: ACM SIGPLAN Notices (1995)

Assignment motion (AM) and expression motion (EM) are the basis of powerful and at the first sight incomparable techniques for removing partially redundant code from a program. Whereas AM aims at the elimination of complete assignments, a transformation which is always desirable, the more flexible EM requires temporaries to remove partial redundancies. Based on the observation that a simple program transformation enhances AM to subsume EM, we develop an algorithm that for the first time captures all second order effects between AM and EM transformations. Under usual structural restrictions, the worst case time complexity of our algorithm is essentially quadratic, a fact which explains the promising experience with our implementation.
Patterns of functional damage in neural network models of associative memory
Authors: Eytan Ruppin, James A. Reggia
Venue: Neural Computation (1995)

Current understanding of the effects of damage on neural networks is rudimentary, even though such understanding could lead to important insights concerning neurological and psychiatric disorders. Motivated by this consideration, we present a simple analytical framework for estimating the functional damage resulting from focal structural lesions to a neural network model. The effects of focal lesions of varying area, shape, and number on the retrieval capacities of a spatially organized associative memory are quantified, leading to specific scaling laws that may be further examined experimentally. It is predicted that multiple focal lesions will impair performance more than a single lesion of the same size, that slit like lesions are more damaging than rounder lesions, and that the same fraction of damage (relative to the total network size) will result in significantly less performance decrease in larger networks. Our study is clinically motivated by the observation that in multi-infarct dementia, the size of metabolically impaired tissue correlates with the level of cognitive impairment more than the size of structural damage. Our results account for the detrimental effect of the number of infarcts rather than their overall size of structural damage, and for the "multiplicative" interaction between Alzheimer's disease and multi-infarct dementia.
Backward Error Analysis for the Constrained and Weighted Linear Least Squares Problem when Using theWeighted $QR$ Factorization
Authors: Marten Gulliksson
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Backward errors are derived for the solution of the constrained and weighted linear least squares problem when using the weighted $QR$ factorization with column pivoting, [SIAM J. Matrix Anal. Appl., 13 (1992), pp.~1298--1313]. On the way to achieving this goal we attain a detailed description of the errors produced when using our $M$-invariant reflections.
Russia: computer graphics education takes off in the 1990s
Authors: Yuri M. Bayakovsky
Venue: ACM SIGGRAPH Computer Graphics (1996)

This paper is a first attempt at analyzing the history and the state of the art of computer graphics (CG) education in Russia. Since this collection of information has just begun, the resulting picture is necessarily incomplete.
An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
Authors: Ramesh Krishnamurti, Bhagirath Narahari
Venue: SIAM Journal on Discrete Mathematics (1995)

This paper addresses the problem of preemptive scheduling on parallel-task systems. A parallel-task system consists of several independent tasks, each of which can be executed on one or more processors. Du and Leung introduced the problem of minimizing the schedule length in parallel-task systems and showed that it is strongly NP-hard for both nonpreemptive and preemptive scheduling of independent tasks. This paper presents a polynomial-time approximation algorithm for preemptive scheduling of a parallel-task system with $n$ processors and $w$ tasks. We derive a tight worst-case performance bound of $r$ for the approximation algorithm, where $r$ is the maximum factor by which we can increase the number of processors on which a task can be executed. For example, $r=2$ in the model defined by Du and Leung for parallel-task systems in which a task can be executed on any integral number of processors.
The object oriented model and its advantages
Authors: José de Oliveira Guimarães
Venue: ACM SIGPLAN OOPS Messenger (1995)

This paper examines some advantages of the Object Oriented Model (O.O.M), such as reuse of code. better structured programs and easier transition from analysis to implementation. It presents some examples, showing why the O.O.M results in higher code reuse than procedural programming. The paper points also the advantages of Object Oriented Analysis (O.O.A) and of Data Abstraction (even though no direct connection exists between D.A. and the O.O.M).The reader is supposed to have some knowledge of the Object Oriented paradigm (class definition, objects. inheritance and polymorphism) and of C++ language.
Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
Authors: Niloufer Mackey
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

The algebra isomorphism between $\cal{M}_{4}(\cal{R})$ and $\cal{H} \otimes \cal{H}$, where $\cal{H}$ is the algebra of quaternions, has unexpected computational payoff: it helps construct an orthogonal similarity that $2 \times 2$ block-diagonalizes a $4\times 4$ symmetric matrix. Replacing plane rotations with these more powerful $4 \times 4$ rotations leads to a quaternion-Jacobi method in which the "weight" of four elements (in a $2 \times 2$ block) is transferred all at once onto the diagonal. Quadratic convergence sets in sooner, and the new method requires at least one fewer sweep than plane-Jacobi methods. An analogue of the sorting angle for plane rotations is developed for these $4 \times 4$ rotations.
A video retrieval and sequencing system
Authors: Tat-Seng Chua, Li-Qun Ruan
Venue: ACM Transactions on Information Systems (TOIS) (1995)

Video is an effective medium for capturing the events in the real world around us, and a vast amount of video materials exists, covering a wide range of applications. However, widespread use of video in computer applications is often impeded by the lack of effective tools to manage video information systematically. This article discusses the design and implementation of a frame-based video retrieval and sequencing system (VRSS). The system is designed to support the entire process of video information management: segmenting, indexing, retrieving, and sequencing of video data. A semiautomatic tool is developed to divide video sequences into meaningful shots. Each video shot is logged using text descriptions, audio dialogue, and cinematic attributes. A two-layered, concept-based model is used as the basis for accurately retrieving relevant video shots based on users' free-text queries. A cinematic, rule-based, virtual editing tool is also developed to sequence the video shots retrieved for presentation within a specified time constraint. The system has been tested on a video documentary on the NUS (National University of Singapore) engineering faculty. The results of video retrieval experiments are encouraging.
Reuse-oriented requirements engineering in NATURE
Authors: N. A. M. Maiden
Venue: ACM SIGSOFT Software Engineering Notes (1995)

This short paper outlines research undertaken as part of the ESPRIT III NATURE basic research action into domain-specific requirements engineering environments. It describes a set of problem abstractions which are the basis for intelligent guidance during requirements scoping, acquisition, modeling, critiquing and communication. It presents a toolkit designed to exploit the problem abstractions during different requirements engineering activities. Routes for industrial exploitation of these research results are also outlined.
PPIG-7: the seventh annual workshop of the Psychology of Programming Interest Group
Authors: Diane H. Sonnenwald
Venue: ACM SIGCHI Bulletin (1995)

The Psychology of Programming Interest Group (PPIG) is a multi-disciplinary network of researchers and practitioners interested in understanding cognitive, social, and educational aspects of programming and design. The group meets yearly to discuss their research progress and issues in an informal, supportive environment. This year's workshop, PPIG-7, was held at the University of Edinburgh, 4-6 January 1995.The organizers of PPIG-7 were Helen Pain (local organizer), Thomas Green, and Ben du Boulay; students at the University of Edinburgh assisted during the workshop. PPIG-7 was sponsored by the Engineering and Physical Science Research Council.Work from a variety of countries and disciplines was discussed at the workshop. Presentations were divided into the following themes: Tools and Techniques, Design Strategies, Competence, Knowledge and Learning, Using Diagrams and Graphical Programming Languages, and Perspectives. Following is an overview of the talks presented in each theme. Affiliations and email addresses of authors are provided so readers can contact the authors directly for further information.
Your local newspaper: will it just be content in a digital library?
Authors: B. David Kingery
Venue: ACM SIGWEB Newsletter (1995)

The current research in digital libraries focuses on the academic and research communities with good reason. However, there are other communities of users which need to be supported. One of these communities includes the producers and consumers of newspapers. The local newspaper publisher produces a product which contains information targeted for a specific market. By providing news of local interest, the newspaper publisher creates a specialized collection of text and photographs. It is this "localized" collection that is the focus of this paper. Will the local newspaper, in its electronic form, be relegated to content within the community's digital library? Or can the newspaper publisher transform the traditional paper-and-ink offering into a digital product that can stand alone as its own digital library?
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
Authors: Premkumar Vadapalli, Pradip K. Srimani
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.
A Regularization Parameter in Discrete Ill-Posed Problems
Authors: Teresa Reginska
Venue: SIAM Journal on Scientific Computing (1996)

The Tikhonov regularization method for discrete ill-posed problems is considered. For the practical choice of the regularization parameter $\alpha$, some authors use a plot of the norm of the regularized solution versus the norm of the residual vector for all $\alpha$ considered. This paper contains an analysis of the shape of this plot and gives a theoretical justification for choosing the regularization parameter so it is related to the "L-corner" of the plot considered in the logarithmic scale. Moreover, a new criterion for choosing $\alpha$ is introduced (independent of the shape of the plot) which gives a new interpretation of the "corner criterion" mentioned above. The existence of "L-corner" is discussed.