ppxscal/embedding_network huggingface dataset:
Software development methodologies and traditional and modern information systems
Authors: Danny T. Connors
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Considerable discussion exists about the proper methodology for developing software. Some individuals favor a strict step-by-step approach, while others favor rapid prototyping. The extra dimensions of newer information systems such as Decision Support Systems and Expert Systems add to the confusion. Many individuals believe that new systems need new methodologies.This paper surveys the literature to determine current philosophies concerning traditional and modern information systems. Then, a typology which integrates the philosophies into a model useful for selecting an appropriate methodology for the information system task at hand is proposed.
A model for estimating trace-sample miss ratios
Authors: David A. Wood, Mark D. Hill, R. E. Kessler
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

Unknown references, also known as cold-start misses, arise during trace-driven simulation of uniprocessor caches because of the unknown initial conditions. Accurately estimating the miss ratio of unknown references, denoted by mu;, is particularly important when simulating large caches with short trace samples, since many references may be unknown.In this paper we make three contributions regarding mu;. First, we provide empirical evidence that mu; is much larger than the overall miss ratio (e.g., 0.40 vs. 0.02). Prior work suggests that they should be the same. Second, we develop a model that explains our empirical results for long trace samples. In our model, each block frame is either live, if its next reference will hit, or dead, if its next reference will miss. We model each block frame as an alternating renewal process, and use the renewal-reward theorem to show that mu; is simply the fraction of time block frames are dead. Finally, we extend the model to handle short trace samples and use it to develop several estimators of mu;. Trace-driven simulation results show these estimators lead to better estimates of overall miss ratios than do previous methods.
Algorithm of simplification of nonlinear equations systems
Authors: Jean-Michel Nataf
Venue: ACM SIGSAM Bulletin (1992)

The recent years have seen the development of automatic methods for the resolution of nonlinear equations systems. The standard numerical approach, when faced with a nonlinear equation system, is to solve it by Newton-Raphson method, that requires the expensive calculation of the Jacobian matrix of the system. Since inversion of a N*N matrix is O(N3) expensive, reducing the size of the system is therefore critical.We present here a simple, graph-theoretical algorithm for automatically reducing a nonlinear equation system beforehand, by use of successive substitutions. The algorithm treats the equation system as a graph, is heuristic, and automatically chooses what substitutions are likely to yield, at the end, the highest size reduction. This system must not necessarily be polynomial, can even be ill defined (then the algorithm just performs reduction) and can be used even in the presence of transcendental or a priori unknown functions.Two implementations have been made, one in FORTRAN, quicker but less efficient, and one in the computer algebra language MACSYMA, slower but with better reduction. The promises of computer algebra in this field are investigated. Applications are then presented to the reduction of equations systems simulating the steady state behavior of HVAC systems in buildings.
Object and Texture Classification Using Higher Order Statistics
Authors: Michail K. Tsatsanis, Georgios B. Giannakis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The problem of the detection and classification of deterministic objects and random textures in a noisy scene is discussed. An energy detector is developed in the cumulant domain by exploiting the noise insensitivity of higher order statistics. An efficient implementation of this detector is described, using matched filtering. Its performance is analyzed using asymptotic distributions in a binary hypothesis-testing framework. The object and texture discriminant functions are minimum distance classifiers in the cumulant domain and can be efficiently implemented using a bank of matched filters. They are immune to additive Gaussian noise and insensitive to object shifts. Important extensions, which can handle object rotation and scaling, are also discussed. An alternative texture classifier is derived from a ML viewpoint and is statistically efficient at the expense of complexity. The application of these algorithms to the texture-modeling problem is indicated, and consistent parameter estimates are obtained.
INTERACT'90 trip report
Authors: Lisa Neal
Venue: ACM SIGCHI Bulletin (1992)

The INTERACT'90 Conference took place in Cambridge, England from August 27--30, 1990. For the benefit of those who were unable to attend, an overview of the conference follows. This is quite limited in scope since there were generally five parallel sessions at any time, which included verbal paper presentations, visual presentations, panels, demonstrations, and videos. There were two sites, at Robinson and Selwyn Colleges. I mostly went to talks at the Selwyn Site. There was a large tent where visual presentations were given at the Robinson site, and the very high temperatures in the tent kept me from going back after my first visit to it, which undoubtedly meant I missed many interesting presentations.
Iterative Composite Filtering for Image Restoration
Authors: H. S. Mallikarjuna, L. F. Chaparro
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

An algorithm solution to the noisy image restoration problem under assumptions that the image is nonstationary and that the noise process is a superposition of white and impulsive noises is proposed. A composite model is used for the image in order to consider its nonstationarities, in the mean and the autocorrelation. Separating the gross information about the image from its textural information, the authors exploit the advantages of median, range, and Levinson filters in restoring the image. Median statistics are used to estimate the image's gross information and to filter the impulsive noise. Range statistics are used to segment the textural image into approximately locally stationary images to be filtered by Levenson filters. The proposed restoration algorithm adapts to the nonstationarity of the image, and, thus, it performs well. The algorithm is compared with others based on either median or linear filtering alone.
Composite theoretical performance
Authors: D. Ames, D. Gibson, B. Troy
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

Export controls require that computer systems, specifically Digital Central Processing units, be characterized as to performance. Absolute performance measurement is not required, rather a very wide range of CPUs, from micros to supercomputers, must be rank ordered. Ranking is based on a synthetic characterization and is influenced by the design details of the particular processor that make it useful for one or more strategic applications. This paper describes the strategic export control concerns, the rationale involved in the choice of a metric, the technical considerations, and the elements included in the CTP metric.
The Image Chip for High Performance 3D Rendering
Authors: Graham J. Dunnett, Martin White, Paul F. Lister, Richard L. Grimsdale
Venue: IEEE Computer Graphics and Applications (1992)

The Image chip, which accelerates 3D rendering algorithms base on Bresenham's line drawing and Pineda's parallel polygon drawing algorithms, is discussed. With these algorithms, Image can directly draw lines, spans, and triangles in wireframe, hidden-line, and Gouraud-shading modes. Image also directly antialiases vectors or provides antialiasing information to enhance antialiasing of vectors or triangles. Image's operation, separation into layers to maximize performance and simplify the input and output interfaces, and support of advanced rendering effects such as Phong shading and texture mapping are described. The designs of Image's internal architecture, host interface, and memory interface are also described.
Plan-then-compile architectures
Authors: Tom M. Mitchell
Venue: ACM SIGART Bulletin (1991)

Several architectures have recently been developed which integrate planning, reacting, and knowledge compilation learning, in order to improve system reactivity while retaining system flexibility. This paper assesses strengths and weaknesses of such Plan-Then-Compile architectures, by analyzing one such architecture, Theo-Agent [Mitchell 90]. We describe capabilities and limitations of the Theo-Agent, and use these to try to understand the generic capabilities and limits of Plan-Then-Compile architectures more generally.
Collaborative computing: collaboration first, computing second
Authors: Donald A. Norman
Venue: Communications of the ACM (1991)

These articles on Collaborative Computing will seem out of place to a number of readers from the computer science community. Interesting articles perhaps, but what do they have to do with computers? Where is the science&mdash;that is, where is the mathematics, or the code? What have these issues to do with everyday practice?
The ObjectWorld, a classless, object-based, visual programming language
Authors: Franz Penz, Thomas Wollinger
Venue: ACM SIGPLAN OOPS Messenger (1993)

The ObjectWorld is an experimental programming system combining the concepts of object-oriented programming and visual programming to enable software reuse. New objects are assembled from prefabricated ones. The concepts of object-oriented programming are characterized and the ObjectWorld is classified according to these concepts. Two examples demonstrate programming in the ObjectWorld.
Concurrency control in real-time database systems
Authors: Özgür Ulusoy, Geneva G. Belford
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Efficient concurrency control protocols are required in order for it to be possible to schedule real-time database transactions so as to satisfy both real-time constraints and data consistency requirements. In this paper, two new real-time concurrency control protocols are proposed. Performance of the protocols is discussed based on simulations comparing them to some previously proposed real-time concurrency control protocols.
A portable code generator for CRAY FORTRAN
Authors: Sanjiva Weerawarana, Paul S. Wang
Venue: ACM Transactions on Mathematical Software (TOMS) (1992)

One way to combine the powers of symbolic computing with numeric computing is to automaticaly derive and produce numeric code. This approach has important applications in science and engineering. Once the desired formulas and procedures are derived in a symbolic manipulation system, they can be translated into a target numeric language by a code generator. GENCRAY is a code generator written in the C language for portability. GENCRAY defines a LISP-style input language that is translated into either FORTRAN 77 or CRAY FORTRAN. By defining its own input syntax, GENCRAY becomes a free-standing code translator that can be made to work with any symbolic manipulation system. GENCRAY is portable to any computer system with a standard C compiler. Input to GENCRAY can come from a file or directly from a symbolic system through a pipe. On UNIX systems with Berkeley networking, GENCRAY also runs as a network server. The input syntax is customizable to allow both Common and Franz LISP input styles. In addition to generating easily vectorizable CRAY FORTRAN code, GENCRAY also provides high-level, easy-to-use parallel programming macros to produce parallel code for the multiprocessor CRAY systems. The features, applications, usage, and implementation of GENCRAY are described. Techniques for producing parallel codes are discussed and illustrated by a substantial example contained in the Appendix.
Providing high availability using lazy replication
Authors: Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat
Venue: ACM Transactions on Computer Systems (TOCS) (1992)

To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expensive. For some applications a weaker causal operation order can preserve consistency while providing better performance. This paper describes a new way of implementing causal operations. Our technique also supports two other kinds of operations: operations that are totally ordered with respect to one another and operations that are totally ordered with respect to all other operations. The method performs well in terms of response time, operation-processing capacity, amount of stored state, and number and size of messages; it does better than replication methods based on reliable multicast techniques.
Generic Neighborhood Operators
Authors: Jan J. Koenderink, Andrea J. van Doorn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A method that treats linear neighborhood operators within a unified framework that enables linear combinations, concatenations, resolution changes, or rotations of operators to be treated in a canonical manner is presented. Various families of operators with special kinds of symmetries (such as translation, rotation, magnification) are explicitly constructed in 1-D, 2-D, and 3-D. A concept of 'order' is defined, and finite orthonormal bases of functions closely connected with the operators of various orders are constructed. Linear transformations between the various representations are considered. The method is based on two fundamental assumptions: a decrease of resolution should not introduce spurious detail, and the local operators should be self-similar under changes of resolution. These assumptions merely sum up the even more general need for homogeneity isotropy, scale invariance, and separability of independent dimensions of front-end processing in the absence of a priori information.
A dynamical system approach to approach to continuous recognition
Authors: V. Digalakis, J. R. Rohlicek, M. Ostendorf
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

A dynamical system model is proposed for better representing the spectral dynamics of speech for recognition. We assume that the observed feature vectors of a phone segment are the output of a stochastic linear dynamical system and consider two alternative assumptions regarding the relationship of the segment length and the evolution of the dynamics. Training is equivalent to the identification of a stochastic linear system, and we follow a nontraditional approach based on the Estimate-Maximize algorithm. We evaluate this model on a phoneme classification task using the TIMIT database.
Multiple SIP strategies and bottom-up adorning in logic query optimization
Authors: Seppo Sippu, Eljas Soisalon-Soininen
Venue: Proceedings of the third international conference on database theory on Database theory (1990)

Preprocessing methods called &ldquo;readorning&rdquo; and &ldquo;bottom-up adorning&rdquo; are introduced as means of enlarging the application domain of magic sets and related query optimization strategies for logic databases. Readorning tries to make possible the simultaneous use of multiple sideways information passing (sip) strategies defined for a rule, thus yielding an optimization effect that may not be achieved by any particular choice of sip strategies. Bottom-up adorning is used to make magic sets applicable to cases in which potential optimizations can be derived from bindings coming upwards from rule bodies to rule heads in bottom-up evaluation. These include the cases in which we know that some base relation is small or that the domain of an attribute of some relation is small. Bottom-up adorning followed by readorning will propagate these bindings to other parts of the datalog program.
Symbolic computation research in Italy
Venue: ACM SIGSAM Bulletin (1991)

CAMASA (the acronym stands for Calcolo Algebrico: Metodi, Algoritmi, Sistemi, Applicazioni; you should be able to translate that) is the Italian Research Group in Symbolic Computation. It is funded by MURST (Board for the University and Scientific-Technological Research) at a national level and coordinates other projects or contracts funded by research agencies in Italy. Its aim is the coordination of the research activity in Symbolic Computation and the diffusion of this discipline through the organization of schools and meetings, also at an international level.
Synthesizing communication protocol converter: a model and method
Authors: Z. P. Tao, M. Goossens
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

A method for synthesizing a protocol converter with a High Level Petri Net (HLPN) model will be presented in this paper. The services provided by the underlying protocols will first be converted, and then the protocol converter will be derived from the service converter and the specifications of the protocols by Petri net transformation. The advantages of the method will be discussed.
The evolution of CycL, the Cyc representation language
Authors: Douglas B. Lenat, R. V. Guha
Venue: ACM SIGART Bulletin (1991)

CycL is the language in which the Cyc Knowledge Base is being encoded. This paper reviews some of the methodological considerations and the technical decisions (resulting from these considerations) that are both different from conventional thinking and that have significantly influenced the design of the language.
A magnifier tool for video data
Authors: Michael Mills, Jonathan Cohen, Yin Yin Wong
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

We describe an interface prototype, the Hierarchical Video Magnifier, which allows users to work with a video source at fine-levels of detail while maintaining an awareness of temporal context. The technique allows the user to recursively magnify the temporal resolution of a video source while preserving the levels of magnification in a spatial hierarchy. We discuss how the ability to inspect and manipulate hierarchical views of temporal magnification affords a powerful tool for navigating, analyzing and editing video streams.
The Convergence of TD(&lambda;) for General &lambda;
Authors: Peter Dayan
Venue: Machine Learning (1992)

The method of temporal differences (TD) is one way of making consistent predictions about the future. This paper uses some analysis of Watkins (1989) to extend a convergence theorem due to Sutton (1988) from the case which only uses information from adjacent time steps to that involving information from arbitrary ones.It also considers how this version of TD behaves in the face of linearly dependent representations for states&mdash;demonstrating that it still converges, but to a different answer from the least mean squares algorithm. Finally it adapts Watkins' theorem that \cal Q-learning, his closely related prediction and action learning method, converges with probability one, to demonstrate this strong form of convergence for a slightly modified version of TD.
Four Dimensions of programming-language independence
Authors: Daniel J. Salomon
Venue: ACM SIGPLAN Notices (1992)

The features of programming languages can be evaluated according to how they affect programming-language independence in four dimensions. The four dimensions are: 1) machine independence, 2) problem independence, 3) human independence, and 4) time independence. This paper presents a definition of independence, and shows how that definition applies to each of the dimensions. By organizing language features in this way, the strengths and weaknesses of many language designs can be identified, and new directions for programming-language research become apparent. This paper also presents the advantages of, and methods of achieving, independence in these dimensions, and occasionally presents the disadvantages of independence.Each of the four dimensions is treated as a discrete domain, and the elements of each domain are classified according to their properties. The elements of the machine domain are classified according to (a) architecture, (b) machine size, (c) peripheral devices, and (d) operating system. The problem domain is classified according to (a) discipline, (b) problem context, (c) system mode, and (d) problem-solving methods. The human domain is classified according to (a) user qualifications, (b) natural language spoken, (c) the three classes designers, implementors, and users, and (d) independence in the class implementors is considered alone. Finally the time dimension is treated in three time scales: (a) program processing, (b) project development, and (c) language evolution.
A survey of asynchronous remote procedure calls
Authors: A. L. Ananda, B. H. Tay, E. K. Koh
Venue: ACM SIGOPS Operating Systems Review (1992)

Remote Procedure Call (RPC) is a popular paradigm for interprocess communication in distributed systems. It is simple, flexible and powerful. However, most of the RPC systems today are synchronous in nature, and hence fail to exploit fully the parallelism inherent in distributed applications. In view of this, various asynchronous RPC systems have been designed and implemented to achieve higher parallelism while retaining the familiarity and simplicity of synchronous RPC. Asynchronous RPC calls do not block the caller (client) and the replies can be received as and when they are needed, thus allowing the client execution to proceed locally in parallel with the callee (server) invocation. Asynchronous RPC calls can be classified into two types depending on whether the calls return a value. Most asynchronous RPC systems only support calls that do not return a value, and few support both classes. In this paper, an analysis and comparison of various asynchronous RPC systems are presented.
The Pan language-based editing system
Authors: Robert A. Ballance, Susan L. Graham, Michael L. Van De Vanter
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1992)

Powerful editing systems for developing complex software documents are difficult to engineer. Besides requiring efficient incremental algorithms and complex data structures, such editors must accommodate flexible editing styles, provide a consistent, coherent, and powerful user interface, support individual variations and projectwide configurations, maintain a sharable database of information concerning the documents being edited, and integrate smoothly with the other tools in the environment. Pan is a language-based editing and browsing system that exhibits these characteristics. This paper surveys the design and engineering of Pan, paying particular attention to a number of issues that pervade the system: incremental checking and analysis, information retention in the presence of change, tolerance for errors and anomalies, and extension facilities.
The implementation of guaranteed, reliable, secure broadcast networks
Authors: Lawrence C. N. Tseung, Keh-Chiang Yu
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This paper depicts a conceptually simple and easy to implement protocol that provides reliable and secure broadcast/multicast communication. The methodology used in this protocol is surprisingly simple. Three logical nodes are enforced in the network - a Central Retransmitter, a Designated Acknowledger, and a (many when needed) Playback Recorder(s). Through the coordinated service of the three nodes, every user node can be guaranteed to receive all broadcast messages in the correct temporal order. A fourth logical node, the Security Controller, can be added to the protocol to provide security-related services such as user authentication, message encryption, etc. This protocol (GRSB - Guaranteed, Reliable, Secure Broadcast) can be implemented in many types of networks - local area networks, wide area networks, as well as satellite communications. Some of its implementation and performance issues are also discussed in the paper.