ppxscal/embedding_network huggingface dataset:
Comparative Analysis of Different Models of Checkpointing and Recovery
Authors: V. F. Nicola, J. M. van Spanje
Venue: IEEE Transactions on Software Engineering (1990)

Different checkpointing strategies are combined with recovery models of different refinement levels in the database systems. The complexity of the resulting model increases with its accuracy in representing a realistic system. Three different analytic approaches are used depending on the complexity of the model: analytic, numerical and simulation. A Markovian queuing model is developed, resulting in a combined Poisson and load-dependent checkpointing strategy with stochastic recovery. A state-space analysis approach is used to derive semianalytic expressions for the performance variables in terms of a set of unknown boundary state probabilities. An efficient numerical algorithm for evaluating unknown probabilities is outlined. The validity of the numerical solution is checked against simulation results and shown to be of acceptable accuracy, particularly in the stable operating range. Simulations have shown that realistic load-dependent checkpointing results in performance close to the optimal deterministic checkpointing. Furthermore, the stochastic recovery model is an accurate representation of a realistic recovery.
Method engineering: from data to model to practice
Authors: Erik Nilsen, Hee Sen Jong, Judith S. Olson, Peter G. Polson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This paper explores the behavior of experts choosing among various methods to accomplish tasks. Given the results showing that methods are not chosen solely on the basis of keystroke efficiency, we recommend a technique to help designers assess whether they should offer multiple methods for some tasks, and if they should, how to make them so that they are chosen appropriately.
On Achievable Accuracy in Edge Localization
Authors: Ramakrishna Kakarala, Alfred O. Hero
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

Edge localization occurs when an edge detector determines the location of an edge in an image. The authors use statistical parameter estimation techniques to derive bounds on achievable accuracy in edge localization. These bounds, known as the Cramer-Rao bounds, reveal the effect on localization of factors such as signal-to-noise ratio (SNR), extent of edge observed, scale of smoothing filter, and a priori uncertainty about edge intensity. By using continuous values for both image coordinates and intensity, the authors focus on the effect of these factors prior to sampling and quantization. They also analyze the Canny algorithm and show that for high SNR, its mean squared error is only a factor of two higher than the lower limit established by the Cramer-Rao bound. Although this is very good, the authors show that for high SNR, the maximum-likelihood estimator, which is also derived, virtually achieves the lower bound.
The perceptual structure of multidimensional input device selection
Authors: Robert J. K. Jacob, Linda E. Sibert
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Concepts such as the logical device, taxonomies, and other descriptive frameworks have improved understanding of input devices but ignored or else treated informally their pragmatic qualities, which are fundamental to selection of input devices for tasks. We seek the greater leverage of a predictive theoretical framework by basing our investigation of three-dimensional vs. two-dimensional input devices on Garner's theory of processing of perceptual structure in multidimensional tasks. Two three-dimensional tasks may seem equivalent, but if they involve different types of perceptual spaces, they should be assigned correspondingly different input devices. Our experiment supports this hypothesis and thus both indicates when to use three-dimensional input devices and gives credence to our theoretical basis for this indication.
A Real-Time Locking Protocol
Authors: Lui Sha, Sang Hyuk Son, Ragunathan Rajkumar, Chun-Hyon Chang
Venue: IEEE Transactions on Computers (1991)

The authors examine a priority driven two-phase lock protocol called the read/write priority ceiling protocol. It is shown that this protocol leads to freedom from mutual deadlock. In addition, a high-priority transactions can be blocked by lower priority transactions for at most the duration of a single embedded transaction. These properties can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet its deadlines. Finally, the performance of this protocol is examined for randomly arriving transactions using simulation studies.
Viewpoints (Computing in the 1990s)
Authors: Philip Treleaven
Venue: Computer (1991)

Fifteen academic and industry leaders share their views on current and future computer and related technology. They discuss Europe 1992 and its impact on information technology, 25 years of MITI and its influence on computing research in Japan, concurrent engineering, the scientific data decade, information systems, superconductivity and computing technology, semiconductor technology at middle age, past and future computer networks, testing and design verification of electronic components, operating systems in the year 2000, data parallel computing, computer-aided software prototyping, and object-oriented software technology.
Resource Integration Using a Large Knowledge Base in Carnot
Authors: Christine Collet, Michael N. Huhns, Wei-Min Shen
Venue: Computer (1991)

A method for integrating separately developed information resources that overcomes incompatibilities in syntax and semantics and permits the resources to be accessed and modified coherently is described. The method provides logical connectivity among the information resources via a semantic service layer that automates the maintenance of data integrity and provides an approximation of global data integration across systems. This layer is a fundamental part of the Carnot architecture, which provides tools for interoperability across global enterprises.
From the classroom to the real world (panel session)
Authors: Lawrence Forsley
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Forth is interesting because of its differences. Panelists will discuss experiences with Forth as a University teaching tool, evaluation of Forth and its derivative languages in practical computer applications, the position of Forth in the industrial environment, and Forth practices outside of the United States.
CHI'90 workshop on multimedia and multimodal interface design
Authors: Meera M. Blattner, Roger B. Dannenberg
Venue: ACM SIGCHI Bulletin (1990)

A large number of disparate technologies contribute to an understanding of how to design a multimedia, multimodal interface. These vary from the use of vision, gesture and sound to applications, tools for interface construction, models and metaphors, and enabling technologies, such as video disk, and image processing. The primary objective of the workshop was to integrate what we presently know of these technologies and consider the areas that need to be explored for future development of multimedia in the computer interface.
Structured development of graph-grammars for icon manipulation
Authors: José Javier Dolado
Venue: ACM SIGSOFT Software Engineering Notes (1991)

In this work we are showing a structured process to build a grammar for icon manipulation. We presuppose that the object to be manipulated in the computer screen can be stated as a set of relations among its parts. We describe a procedure to generate a program that manipulates the object, guaranteeing that only objects with those properties will be constructed, and that every instance of that object is allowable. The formation rules for the object are stored in terms of attributed graph-grammars productions.
The standards factor: standards on the horizon
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1990)

This month's column focuses on the current status of various drafts of international standards, rather than on the progress of individual committees. There are two reasons for this shift in emphasis. First, in many cases, an International Organization for Standardization (ISO) committee and its parallel American National Standards Institute (ANSI) committee are jointly developing one or more parts of the same standard, so there is a lot of duplication in the reports of their activities. Second, several user-interface-related draft ISO standards have recently been released for balloting. Each country belonging to ISO, including the United States, has the opportunity to vote on these drafts. However, since there is only one vote per country, it is important that all interested parties in the U. S. follow the progress of these drafts and register any concerns they may have before the draft becomes an official international standard.
Simulation of an automatic banking system with the Ada programming language (abstract)
Authors: Trong Wu
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In a class of applications, a model exists in which calculations depend upon a fixed set of independent real model parameters, say V1, V2, &hellip;, Vn. Each of the V's is a function of auxiliary data. The model often has a large number of discrete states, characterized by a set of discrete state parameters S1, S2, &hellip;, Sm. To calculate any particular V, a different function (algorithm and auxiliary data) may be needed for each state; typically, however, a function is shared among some group of states. It is desirable that only one copy of each function exist. The state may change frequently. Moreover, the state parameters are usually not independent; for example, choosing a particular value for one S may restrict permitted values for other S's. In an interactive application, inconsistent choices must be detected. An application oriented framework is presented for supplying the application with the V's while efficiently reconfiguring the model as the S's are changed. The role of the S's and the details of calculating each V are hidden from the application. The framework is maintainable and, moreover, allows the system to be enhanced by the addition of new states. Finally, inconsistent choices among the state parameters can be easily detected.
Analysis of Ada-LINPACK benchmark results
Authors: Lynn Purser, Robin Graham
Venue: ACM SIGAda Ada Letters (1991)

Implementation of standard algorithms coupled with immature optimization techniques often cause VAX/Ada's run-time performance to be less than optimal. An analysis of a VAX/Ada LINPACK benchmark test revealed that the storage scheme of two dimensional arrays and the column addressing of matrix elements leads to a disproportionate number of index computation multiplications. Further analysis shows how the LINPACK decomposition algorithm can be rewritten so that VAX/Ada run-time performance is optimized.
On subcube dependability in a hypercube
Authors: Jong Kim, Chita R. Das
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

In this paper, we present an analytical model for computing the dependability of hypercube systems. The model, referred to as task-based dependability (TBD), is developed under the assumption that a task needs at least an m-cube (m lt; n) in an n-cube for its execution. Two probabilistic terms are required for computing this dependability. The first is the probability of any x nodes working out of 2n nodes. The second term is a conditional probability that at least a connected m-cube exists among those x working nodes. This term is computed using a recursive expression. Two dependability measures, reliability and availability, are analyzed in this paper. A combinatorial enumeration is used in the reliability analysis, and a machine repairman model is used in the availability analysis to find the first probability. The machine repairman model is modified to capture imperfect coverage and imprecise repair. The TBD model is also extended to find multitask dependability. Numerical results are presented for n-cubes with different task requirements and are validated through extensive simulation. It is observed that an m-cube requirement is highly restrictive compared to the simple 2m-connected node requirement.
The Geneva convention on the treatment of object aliasing
Authors: John Hogg, Doug Lea, Alan Wills, Dennis deChampeaux, Richard Holt
Venue: ACM SIGPLAN OOPS Messenger (1992)

Aliasing has been a problem in both formal verification and practical programming for a number of years. To the formalist, it can be annoyingly difficult to prove the simple Hoare formula {x = true} y := false {x = true}. If x and y refer to the same boolean variable, i.e., x and y are aliased, then the formula will not be valid, and proving that aliasing cannot occur is not always straightforward. To the practicing programmer, aliases can result in mysterious bugs as variables change their values seemingly on their own. A classic example is the matrix multiply routine mult(left, right, result) which puts the product of its first two parameters into the third. This works perfectly well until the day some unsuspecting programmer writes the very reasonable statement mult(a, b, a). If the implementor of the routine did not consider the possibility that an argument may be aliased with the result, disaster is inevitable.
Application development through reuse: the ITHACA tools environment
Authors: M. G. Fugini, O. Nierstrasz, B. Pernici
Venue: ACM SIGOIS Bulletin (1992)

This paper presents the architecture and basic features of the ITHACA Application Development Environment based on a Software Information System for enhancing reusability of both software components and artifacts about development of these components. Object-oriented techniques are used in the Environment at all levels of the development of an application: requirement specification, scripting, implementation through class refinement and tailoring. In the Environment, it is tracked how the various products of the development phases were produced by providing tools for the Application Engineer who is responsible for abstracting application skeletons and development information and storing these as Application Frames into a Software Information Base. In particular, the paper describes the Requirement Collection And Specification Tool (RECAST) and the Visual Scripting Tool (Vista) of the ITHACA Development Environment.
Lower bounds for data structure problems on RAMs (extended abstract)
Authors: Amir M. Ben-Amram, Zvi Galil
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A technique is described for deriving lower bounds and tradeoffs for data structure problems. Two quantities are defined. The output variability depends only on the model of computation. It characterizes in some sense the power of a model. The problem variability depends only on the problem under consideration. It characterizes in some sense the difficulty of the problem. The first theorem states that if a model's output variability is smaller than the problem variability, a lower bound on the worst case (average case) time for the problem follows. A RAM that can add, subtract and compare unbounded integers is considered. The second theorem gives an upper bound on the output variability of this model. The two theorems are used to derive lower bounds for the union-find problem in this RAM.
K-Rep system overview
Authors: Eric Mays, Robert Dionne, Robert Weida
Venue: ACM SIGART Bulletin (1991)

The K-Rep system was built to explore the utility of a KL-One style knowledge representation in the development of expert systems. Beginning in about 1985, our activity in expert systems has been centered on the FAME (FinAncial Marketing Expertise) system[4]. FAME attempts to provide support to an IBM marketing representative in the financing decisions involved in the acquisition of large mainframe computer systems. Based on our experience in building a feasibility demonstration of FAME using a rule based approach, we concluded that the rule based technology would not easily scale up. Thus we abandoned the rule based approach in favor of organizing the system as a set of problem solvers around a common conceptual core. Since diverse problem solvers would be utilized in FAME, it was thought desireable that the conceptual core have a well-defined, enforceable semantics. These considerations led us to the KL-One[3] style knowledge representation.
Advances in Interactive Digital Multimedia Systems
Authors: Edward A. Fox
Venue: Computer (1991)

This paper introduces basic concepts in digital multimedia systems and surveys recent literature. Background is provided regarding developments in interactive videodiscs, which first made images and video accessible through computer systems. Digital storage media, including optical, magnetic, and network options, are addressed. The characteristics of audio and video and their digital representations are discussed. Because these media are so demanding of space and channel bandwidth, compression methods are reviewed. Standards for digital multimedia are considered. Current multimedia systems are described, and future prospects are indicated.
Optimal multi-writer multi-reader atomic register
Authors: Amos Israeli, Amnon Shaham
Venue: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing (1992)

Two implementations of a multi-writer, multi-reader, atomic register are presented. The physical registers used by the first implementation are single-writer, multi-reader, atomic registers; the physical registers used by the second implementation are single-reader, single-writer, atomic registers. Both implementations are optimal with respect to the two most important complexity criteria: In both implementation the space complexity is logarithmic, thus matching the lower bound proven by Cori and Sopena; and the time complexity is linear, thus matching the obvious lower bound. These implementations improve upon the space complexity of all previous implementations in their respective classes, by an exponential factor.
Erhard Konrad: software metrics, measurement theory, and viewpoints-critical remarks on a new approach
Authors: Horst Zuse, Peter Bollmann
Venue: ACM SIGPLAN Notices (1991)

This paper is the reply to the paper "Erhard Konrad: Software Metrics, Measurement Theory, and Viewpoints - Critical Remarks on a New Approach", which was published in SIGPLAN Notices in March 1991. Konrad imputes that the authors of /ZUSE89/ misapply measurement theory, and confuse reality with mathematics. The statements of Konrad are wrong. It will be shown that Konrad misunderstood important concepts of measurement theory. Konrad's critical statements to our approach deny theoretical investigations of software complexity metrics. That has fatal consequences for the use of software complexity metrics in practice, to make statistics, and to calculate correlations.
Issues encountered in building a flexible software development environment: lessons from the Arcadia project
Authors: R. Kadia
Venue: ACM SIGSOFT Software Engineering Notes (1992)

This paper presents some of the more significant technical lessons that the Arcadia project has learned about developing effective software development environments. The principal components of the Arcadia-1 architecture are capabilities for process definition and execution, object management, user interface development and management, measurement and evaluation, language processing, and analysis and testing. In simultaneously and cooperatively developing solutions in these areas we learned several key lessons. Among them: the need to combine and apply heterogenous componentry, multiple techniques for developing components, the pervasive need for rich type models, the need for supporting dynamism (and at what granularity), the role and value of concurrency, and the role and various forms of event-based control integration mechanisms. These lessons are explored in the paper.
Performance Analysis of Two-Phase Locking
Authors: Alexander Thomasian, In Kyung Ryu
Venue: IEEE Transactions on Software Engineering (1991)

A straightforward analytic solution method is developed which takes into account the variability of transaction size (the number of lock requests). The authors first obtain analytic expressions for the probability of lock conflict, probability of deadlock, and the waiting time per lock conflict. They then develop a family of noniterative analytic solutions to evaluate the overall system performance by considering the expansion in transaction response time due to transaction blocking. The accuracy of these solutions is verified by validation against simulation results. Also introduced is a new measure for the degree of lock contention, which is a product of the mean number of lock conflicts per transaction and the mean waiting time per lock conflict (when blocked by an active transaction). It is shown that the variability in transaction size results in an increase in both measures as compared to fixed-size transactions of comparable size. The authors also provide a solution method for the case when the processing times of transaction steps are different.
On the object-orientedness of C++
Authors: Chung-Shyan Liu
Venue: ACM SIGPLAN Notices (1991)

In this note, two different definitions of object-oriented programming, whether a class is equivalent to a type or not, will be presented. Then the relative merits of the two definitions, regarding encapsulation of objects, type checking, genericity, and inheritance of objects, will be discussed. In particular, a C++ sample program will be given to illustrate that the encapsulation of objects may be violated.
Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks
Authors: David Servan-Schreiber, Axel Cleeremans, James L. McClelland
Venue: Machine Learning (1991)

We explore a network architecture introduced by Elman (1990) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step t-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the net has a minimal number of hidden units, patterns on the hidden units come to correspond to the nodes of the grammar&semi; however, this correspondence is not necessary for the network to act as a perfect finite-state recognizer. Next, we provide a detailed analysis of how the network acquires its internal representations. We show that the network progressively encodes more and more temporal context by means of a probability analysis. Finally, we explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements to distant elements. Such information is maintained with relative ease if it is relevant at each intermediate step&semi; it tends to be lost when intervening elements do not depend on it. At first glance this may suggest that such networks are not relevant to natural language, in which dependencies may span indefinite distances. However, embeddings in natural language are not completely independent of earlier information. The final simulation shows that long distance sequential contingencies can be encoded by the network even if only subtle statistical properties of embedded strings depend on the early information. The network encodes long-distance dependencies by shading internal representations that are responsible for processing common embeddings in otherwise different sequences. This ability to represent simultaneously similarities and differences between several sequences relies on the graded nature of representations used by the network, which contrast with the finite states of traditional automata. For this reason, the network and other similar architectures may be called Graded State Machines.