ppxscal/embedding_network huggingface dataset:
Set-based analysis of ML programs
Authors: Nevin Heintze
Venue: Proceedings of the 1994 ACM conference on LISP and functional programming (1994)

Reasoning about program variables as sets of &ldquo;values&rdquo; leads to a simple, accurate and intuitively appealing notion of program approximation. This paper presents approach for the compile-time analysis of ML programs. To develop the core ideas of the analysis, we consider a simple untyped call-by-value functional language. Starting with an operational semantics for the language, we develop an approximate &ldquo;set-based&rdquo; operational semantics, which formalizes the intuition of treating program variables as sets. The key result of the paper is an O(n3) algorithm for computing the set based approximation of a program. We then extend this analysis in a natural way to deal with arrays, arithmetic, exceptions and continuations. We briefly describe our experience with an implementation of this analysis for ML programs.
Real-time performance of intelligent autonomous agents (abstract)
Authors: Anne Collinot, Barbara Hayes-Roth
Venue: ACM SIGOIS Bulletin (1992)

The topic of this paper is a representation model for solid objects used for physical simulation purposes and for planning in a robot assembly system. The system combines analogical representation and multi-agent modelling, using a bottom-up representation for objects based on analogical agents. We call these agents analogical because they are mapped into, interact with and reason directly on the workspace representation, which is a discrete grid. The agents contain local geometrical and physical constraints and they cooperate to satisfy them while moving in the direction of an external force and interacting with other objects in the workspace. An emergent functionality of the simulation of a block moving in a complex environment is the solution to various stability problems.
Original Contribution: An analog neural network to solve the hamiltonian cycle problem
Authors: Shashank Mehta, Laszlo Fulop
Venue: Neural Networks (1993)

Hopfield's (analog) neural net algorithm shows very different characteristics when the net is allowed to evolve while the gain factor of the neural response is gradually increased. The study of the new approach (called quasi stationary flow) yields that (1) The net converges if the weights are symmetric and the strength of inhibitory self connection is less than the slope of the transfer function (i.e., -w"a","a 0). This approach has been successful in solving very large optimization problems. The quasi stationary approach is applied to the Hopfield and Tank's algorithm to solve the Traveling Salesman Problem (TSP). Besides the method of approaching the stable state, modifications are also suggested in (i) the energy function; (ii) the method of determining the energy coefficients: and (iii) the connectivity of the network. Results are reported of experiments with the Hamiltonian Cycle Problem (HCP or discrete TSP) on graphs of up to 500 nodes. The result of experiments with the well known 318 city TSP is also reported and compared with its best known solution computed by linear programming.
Methods and rules
Authors: Serge Abiteboul, Georg Lausen, Heinz Uphoff, Emmanuel Waller
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

We show how classical datalog semantics can be used directly and very simply to provide semantics to a syntactic extension of datalog with methods, classes, inheritance, overloading and late binding. Several approaches to resolution are considered, implemented in the model, and formally compared. They range from resolution in C++ style to original kinds of resolution suggested by the declarative nature of the language. We show connections to view specification and a further extension allowing runtime derivation of the class hierarchy.
Exploiting cache affinity in software cache coherence
Authors: Hui Li, Kenneth C. Sevcik
Venue: Proceedings of the 8th international conference on Supercomputing (1994)

Cache affinity is important to the performance of scalable shared memory multiprocessors. For multiprocessors without hardware cache coherence support, software cache coherence is the only alternative. Most existing software cache schemes ignore cache affinity across parallel loops. In this paper, we propose a new scheme, Cache Affinity-based Software cache coherence scheme (CAS), that exploits cache affinity across parallel loops to achieve high cache hit ratios without requiring extra hardware support. The experimental results show that the new scheme outperforms other existing schemes.
Mathematical foundations for time warp systems
Authors: Jonathan I. Leivent, Ronald J. Watro
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1993)

We develop a simple formal model of the Time Warp approach to distributed computation, prove several important properties of the model, and devise some extensions to Time Warp that provide improved termination behavior. Our model consists of processes that communicate solely via message passing. One of the basic process steps is a rollback operation that includes message retraction via transmission of antimessages. In the model, we consider three problems: safety, progress, and termination. By safety, we mean that for a given system of processes, if a run of the system terminates, then the final system state of the run is identical to the final system state of a rollback-free run. We give premises that imply safety, and a counterexample that shows how safety can fail. By progress, we mean that, as a run of a system proceeds, the minimum timestamp of an unprocessed message always eventually increases. We state three axioms that imply the progress property. By termination, we mean that, if all rollback-free runs of a system terminate, then all runs terminate. The termination property is generally false in existing implementations of Time Warp systems due to the possibility of Time Warp vortices. We define additional mechanisms that can guarantee the termination property for most Time Warp applications.
Telecommunications technologies: patterns of usage
Authors: Varun Grover, Martin Goslar
Venue: ACM SIGMIS Database (1993)

Technologies associated with telecommunications and computing are rapidly converging. It is therefore becoming difficult for IS practitioners to ignore telecommunications technologies and important for IS researchers to begin investigating them. This paper identifies a set of representative telecommunications technologies, and reports the results of a study undertaken to assess their usage in American industry. The data identifies technologies that are prominent and innovative as perceived by the executives surveyed.
SHyd&mdash;a model for bridging text and hypermedia
Authors: Zheng Min, Roy Rada
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

This paper presents a model of the document-hypermedia world which shows the bi-directional exchanges between the two worlds which are facilitated by international standards and a widely accepted hypertext reference model. In particular we show the role of the Dexter Model and the SGML/HyTime standards in supporting document-hypermedia transformations and hypermedia interchange. A first prototype &mdash; the SGML-MUCH (SM) system &mdash; has been developed which follows the principles of the model. The SM system can accept different text and hypertext markup documents by going through a standard SGML representation, which can represent both text and hypermedia structure, and the SM system can then import these documents into a collaborative hypermedia system &mdash; the MUCH system. On the other hand, a part of the MUCH database can be exported into a markup document which retains all the hypermedia information. This exported document then can be processed by a conventional document editor or used to interchange information with other hypermedia systems.
Designing, Packaging, and Testing a 300-MHz, 115 W ECL Microprocessor
Authors: Norman P. Jouppi, Patrick Boyle, John S. Fitch
Venue: IEEE Micro (1994)

A custom microprocessor implemented with 1-/spl mu/m bipolar technology operates at 300 MHz and dissipates 115 W. By using full-custom ECL technology, we achieved clock rates three to six times faster than 1-/spl mu/m CMOS processors. We designed this research prototype to develop VLSI ECL circuit techniques, a new style of CAD tools, high-performance chip interfaces, and advanced packaging techniques for high-power microprocessors.
Exploiting emergent behavior in multi-agent systems (abstract)
Authors: Peter Wavish
Venue: ACM SIGOIS Bulletin (1992)

This paper addresses the question of how to exploit emergent behaviour in the design of multi-agent systems. The method advocated is to design the individual agents so that they maintain symbolic representations of emergent behaviour which can then be used as a basis for building higher level behaviours. The paper falls into four main parts: a description of behaviour-based agents, a discussion of emergent behaviour, a description of a methodology for developing agents which exploit emergent behaviour, and a practical example of the application of these ideas to the development of a simulated multi-agent system.
The analysis and design of distributed systems (abstract)
Authors: Mehmet Aksit
Venue: ACM SIGPLAN OOPS Messenger (1993)

The Analysis and Design of Distributed Systems Mehmet Aksit, University of Twente The design of distributed object-oriented systems involves a number of considerations that rarely arise in sequential object-oriented design or in non-object-oriented languages. The tutorial describes analysis and design techniques for data abstraction, inheritance, delegation, persistence, atomicity, concurrency, synchronization, and coordinated behavior in a distributed object-oriented framework. Special attention will be paid to the uniform integration of these concepts with the object-oriented paradigm. Discussions will be accompanied by examples that arose from constructing such systems.
Completeness results for recursive data bases
Authors: Tirza Hirst, David Harel
Venue: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1993)

We consider infinite recursive (i.e., computable) relational data bases. Since the set of computable queries on such data bases is not closed under even simple relational operations, one must either make do with a very humble class of queries or considerably restrict the class of allowed data bases. We define two query languages, one for each of these possibilities, and prove their completeness. The first is the language of quantifier-free first-order logic, which is shown to be complete for the non-restricted case. The second is an appropriately modified version of Chandra and Harel's complete language QL, which is proved complete for the case of &ldquo;highly symmetric&rdquo; data bases, i.e., ones whose set of automorphisms is of finite index for each tuple-width. We also address the related notion of BP-completeness.
Algorithm 716: TSPACK: tension spline curve-fitting package
Authors: R. J. Renka
Venue: ACM Transactions on Mathematical Software (TOMS) (1993)

The primary purpose of TSPACK is to construct a smooth function which interpolates a discrete set of data points. The function may be required to have either one or two continuous derivatives. If the accuracy of the data does not warrant interpolation, a smoothing function (which does not pass through the data points) may be constructed instead. The fitting method is designed to avoid extraneous inflection points (associated with rapidly varying data values) and preserve local shape properties of the data (monotonicity and convexity), or to satisfy the more general constraints of bounds on function values or first derivatives. The package also provides a parametric representation for construction general planar curves and space curves.
InQuisiX&mdash;an electronic catalog for software reuse
Authors: Cameron Donaldson
Venue: ACM SIGIR Forum (1994)

InQuisiX is an interactive system supporting the development and use of an electronic catalog. Features are provided for organizing the catalog, classifying and describing items, and searching and browsing catalog descriptions. Items described in the catalog are stored elsewhere and are accessed for display or retrieval through end-user tools integrated with InQuisiX. InQuisiX provides public interfaces for loading data, exchanging catalog data with other tools, invoking end-user tools, and making searchable any information stored outside the catalog, such as documents or graphics.Although InQuisiX is being marketed for use in cataloguing reusable software assets, there is nothing inherent in the design or functionality which restricts its use to this domain. Certain features, particularly the ability to invoke and work cooperatively with other automated tools in the development environment, are particularly useful to software developers. Hexible classification and description features are also important for the emerging software reuse market because best practices in classifying and describing software are still a research topic.InQuisiX runs on UNIX/X Window based environments and is currently hosted on both Sun SPARCstations and IBM RISC 6000 workstations. The system has been developed entirely in Classic-Ada, an object-oriented preprocessor for Ada, and uses a custom, automatically generated persistent object base for storing all information, including both the organization and the contents of the catalog, inverted indexes used to support searching, saved queries, and interfaces to end-user tools. The object base is implemented as a single binary file.
Interaction design at the Utrecht School of the Arts
Authors: Lon Barfield, Willie van Burgsteden, Ruud Lanfermeijer, Bert Mulder, Jurriënne Ossewold, Dick Rijken, Philippe Wegner
Venue: ACM SIGCHI Bulletin (1994)

The "Hogeschool voor de Kunsten Utrecht" (Utrecht School of the Arts, Utrecht, The Netherlands) offers a four-year curriculum in interaction design (roughly equivalent to an MA) and a one year master of arts degree in interactive multimedia. The material here presents our approach to interaction design as a discipline and the curriculum that embodies this approach. It features a collection of thoughts and snapshots-- we regard it as work in progress. Interaction design is a new field. It is growing fast, continuously adapting to new circumstances. We believe in our approach, but do not regard it as the final truth. There will be questions, as well as answers. Your comments, criticisms and suggestions are appreciated!
Original Contribution: Bounds on the number of hidden units in binary-valued three-layer neural networks
Authors: Masahiko Arai
Venue: Neural Networks (1993)

For three-layer artificial neural networks (TANs) that take binary values, the number of hidden units is considered regarding two problems: One is to find the necessary and sufficient number to make mapping between the binary output values of TANs and learning patterns (inputs) arbitrary, and the other is to get the sufficient number for two-category classification (TCC) problems. We show that for the former I - 1 hidden units are necessary and sufficient for I learning patterns and that for the latter about I/3 hidden units are sufficient. These results mean that we can reduce the necessary number of hidden units by taking into account the features of learning pattern distributions.
On the analytical modeling of database concurrency control
Authors: Philip S. Yu, Daniel M. Dias, Stephen S. Lavenberg
Venue: Journal of the ACM (JACM) (1993)

The Concurrency Control (CC) scheme employed can profoundly affect the performance of transaction-processing systems. In this paper, a simple unified approximate analysis methodology to model the effect on system performance of data contention under different CC schemes and for different system structures is developed. This paper concentrates on modeling data contention and then, as others have done in other papers, the solutions of the data contention model are coupled with a standard hardware resource contention model through an iteration. The methodology goes beyond previously published methods for analyzing CC schemes in terms of the generality of CC schemes and system structures that are handled. The methodology is applied to analyze the performance of centralized transaction processing systems using various optimistic- and pessimistic-type CC schemes and for both fixed-length and variable-length transactions. The accuracy of the analysis is demonstrated by comparison with simulations. It is also shown how the methodology can be applied to analyze the performance of distributed transaction-processing systems with replicated data.
Faults on its sleeve: amplifying software reliability testing
Authors: Dick Hamlet, Jeff Voas
Venue: ACM SIGSOFT Software Engineering Notes (1993)

Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance organizations spend a great deal of effort preventing, detecting, and removing &ldquo;defects&rdquo;&mdash;parts of software responsible for operational failure. But software quality can be measured only by statistical parameters like hazard rate and mean time to failure, measures whose connection with defects and with the development process is little understood. At the same time, direct reliability assessment by random testing of software is impractical. The levels we would like to achieve, on the order of 106 - 108 executions without failure, cannot be established in reasonable time. Some limitations of reliability testing can be overcome but the &ldquo;ultrareliable&rdquo; region above 108 failure-free executions is likely to remain forever untestable. We propose a new way of looking at the software reliability program. Defect-based efforts should amplify the significance of reliability testing. That is, developers should demonstrate that the actual reliability is better than the measurement. We give an example of a simple reliability-amplification technique, and suggest applications to systematic testing and formal development methods.
PSD&mdash;a portable scheme debugger
Authors: Pertti Kellomäki
Venue: ACM SIGPLAN Lisp Pointers (1993)

Psd is a portable debugger for the Scheme language. Debugging with Psd is accomplished by instrumenting the original source program. When the instrumented program is run, it presents the user with an interactive interface that lets him or her examine and change values of variables, set breakpoints, and single step evaluation. Psd is designed to be run within GNU Emacs, which is used for displaying the current source code position.
Does licensing require new access control techniques?
Authors: Ralf C. Hauser
Venue: Proceedings of the 1st ACM conference on Computer and communications security (1993)

Licensing is a topic of increasing importance for software publishers and users. More and more, the magnitude of financial transfers between these two partners are determined by some electronic licensing service being part of the system on which the licensed software is running. In order to ease the use and management of such licensing schemes and to enable economic software usage in enterprise-wide computer systems through flexible and fair billing structures, various organizations are working on formulating requirements, defining architectures, and building standard interfaces for so called license brokerage systems. The trustworthiness of these services is essential because large amounts of money can depend on them. Most of these licensing services are currently operating independently of access control and rely on proprietary and unpublished security algorithms. This paper proposes an extension of access control to integrate licensing called Stateful Access Control and it addresses some aspects of virus protection.
Interfacing different object-oriented programming languages
Authors: Scott Danforth
Venue: ACM SIGPLAN OOPS Messenger (1993)

This poster presentation illustrates the use of SOM (the IBM System Object Model) for interfacing, different object-oriented programming (OOP) languages. Our approach allows classes defined in one OOP language to be used by different (possibly non-OOP) languages&mdash;both for subclassing, and for object creation. This extends the utility of OOP class libraries and makes it possible to define &ldquo;multilanguage&rdquo; objects, whose supporting methods and instance variables are provided by different languages.
A neural network model of inhibitory information processing in Aplysia
Authors: Diana E. J. Blazis, Thomas M. Fischer, Thomas J. Carew
Venue: Neural Computation (1993)

Recent cellular studies have revealed a novel form of inhibitory information processing in the siphon withdrawal reflex of the marine mollusc Aplysia: Motorneuronal output is significantly reduced by activity-dependent potentiation of recurrent inhibition within the siphon withdrawal network (Fischer and Carew 1991, 1993). This inhibitory modulation is mediated by two types of identified interneurons, L29s and L30s. In an effort to describe and analyze this and other forms of inhibitory information processing in Aplysia, and to compare it with similar processing in other nervous systems, we have constructed a neural network model that incorporates many empirically observed features of these interneurons. The model generates important aspects of the interactions of cells L29 and L30, and with no further modification, exhibits many network level phenomena that were not explicitly incorporated into the model.
Inspecting continuations
Authors: Antônio Carlos da Rocha Costa, Vanderlei Moraes Rodrigues
Venue: ACM SIGACT News (1994)

This note discusses some implications of allowing programs to inspect their continuations.
Small computers and security: an oxymoron?
Authors: Rayford B. Vaughan,  Jr., Cleopas O. Angaye
Venue: ACM SIGICE Bulletin (1994)

Security of small computing devices networked locally or over long haul networks need not be accomplished without adequate protection of the data being processed. There are adequate commercial products and techniques available today to secure data requiring protection while it is being viewed, processed, stored, or transmitted. The key to protection in such environments is risk assessment, proper integration of protection mechanisms, and assurance of protection.
Automatic generation and management of interprocedural program analyses
Authors: Kwangkeun Yi, Williams Ludwell Harrison,  III
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

We have designed and implemented an interprocedural program analyzer generator, called system Z. Our goal is to automate the generation and management of semantics-based interprocedural program analysis for a wide range of target languages. System Z is based on the abstract interpretation framework. The input to system Z is a high-level specification of an abstract interpreter. The output is a C code for the specified interprocedural program analyzer. The system provides a high-level command set (called projection expressions) in which the user can tune the analysis in accuracy and cost. The user writes projection expressions for selected domains; system Z takes care of the remaining things so that the generated analyzer conducts an analysis over the projected domains, which will vary in cost and accuracy according to the projections. We demonstrate the system's capabilities by experiments with a set of generated analyzers which can analyze C, FORTRAN, and SCHEME programs.