ppxscal/embedding_network huggingface dataset:
AdaPT and Ada 9X
Authors: S. J. Goldsack, A. A. Holzbacher-Valero, R. Volz, R. Waldrop
Venue: ACM SIGAda Ada Letters (1994)

Following an initial proposal developed at the 4th Ada Real Time Programming Workshop, Nemacolin Woodlands, 1989, and further meetings to pursue the ideas, a series of papers were published [1][2][3] describing and discussing possible Ada language extensions to support the development of distributable programs. The language consisting of Ada with these extensions has been called AdaPT, which may be thought of as Ada with partitions. After introducing AdaPT, this paper describes how the AdaPT constructs can be implemented in Ada 83, and then shows how they can be related to constructs proposed for Ada 9X. In general, the paper endorses the ideas of the 9X team, and suggests an elegant synthesis bringing together two apparently unrealted aspects of the language (type derivation and distribution) that can provide a basis for managing distribution.
Automated assistance for program restructuring
Authors: William G. Griswold, David Notkin
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1993)

Maintenance tends to degrade the structure of software, ultimately making maintenance more costly. At times, then, it is worthwhile to manipulate the structure of a system to make changes easier. However, manual restructuring is an error-prone and expensive activity. By separating structural manipulations from other maintenance activities, the semantics of a system can be held constant by a tool, assuring that no errors are introduced by restructuring. To allow the maintenance team to focus on the aspects of restructuring and maintenance requiring human judgment, a transformation-based tool can be provided&mdash;based on a model that exploits preserving data flow dependence and control flow dependence&mdash;to automate the repetitive, error-prone, and computationally demanding aspects of restructuring. A set of automatable transformations is introduced; their impact on structure is described, and their usefulness is demonstrated in examples. A model to aid building meaning-preserving restructuring transformations is described, and its realization in a functioning prototype tool for restructuring Scheme programs is discussed.
Systematic generation of cryptographically robust S-boxes
Authors: Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng
Venue: Proceedings of the 1st ACM conference on Computer and communications security (1993)

Substitution boxes (S-boxes) are a crucial component of DES-like block ciphers. This research addresses problems with previous approaches towards constructing S-boxes, and proposes a new definition for the robustness of S-boxes to differential cryptanalysis, which is the most powerful cryptanalytic attack known to date. A novel method based on group Hadamard matrices is developed to systematically generate S-boxes that satisfy a number of critical cryptographic properties. Among the properties are the high nonlinearity, the strict avalanche characteristics, the balancedness, the robustness against differential cryptanalysis, and the immunity to linear cryptanalysis. An example is provided to illustrate the S-box generating method.
Deductive and inductive synthesis of equational programs
Authors: Nachum Dershowitz, Uday S. Reddy
Venue: Journal of Symbolic Computation (1993)

An equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves finding executable equations such that the given specification holds in their standard model. Hence, to synthesize such programs, induction is necessary. We formulate procedures for inductive proof, as well as for program synthesis, using the framework of ''ordered rewriting''. We also propose heuristics for generalizing from a sequence of equational consequences. These heuristics handle cases where the deductive process alone is inadequate for coming up with a program.
Using Knowledge-Based Neural Networks to Improve Algorithms: Refining the Chou&ndash;Fasman Algorithm for Protein Folding
Authors: Richard Maclin, Jude W. Shavlik
Venue: Machine Learning (1993)

This article describes a connectionist method for refining algorithms represented as generalized finite-state automata. The method translates the rule-like knowledge in an automaton into a corresponding artificial neural network, and then refines the reformulated automaton by applying backpropagation to a set of examples. This technique for translating an automaton into a network extends the KBANN algorithm, a system that translates a set of prepositional rules into a corresponding neural network. The extended system, FSKBANN, allows one to refine the large class of algorithms that can be represented as state-based processes. As a test, FSKBANN is used to improve the Chou&ndash;Fasman algorithm, a method for predicting how globular proteins fold. Empirical evidence shows that the multistrategy approach of FSKBANN leads to a statistically-significantly, more accurate solution than both the original Chou&ndash;Fasman algorithm and a neural network trained using the standard approach. Extensive statistics report the types of errors made by the Chou&ndash;Fasman algorithm, the standard neural network, and the FSKBANN network.
Bridging across content and tools
Authors: Glorianna Davenport
Venue: ACM SIGGRAPH Computer Graphics (1994)

Over the past 10 years, I have contributed to the development of two kinds of "multimedia environments." In the first, the human-machine partnership evolved as a means of accessing specific content for discovery and enjoyment - this was true for works such as "New Orleans in Transition" (1987), "Elastic Charles" (1988) as well as for several fictional narratives. In the second, the human-machine partnership was designed to allow users facilities for describing, managing and sequencing content. Both types of environments encourage the invention of richer human-readable pneumonics and incorporate machine-readable description as tools for content-look-ahead. What has fascinated me over the years is the complementarity which binds the generation of content and the design of tools. In fact we cannot talk about form without discussing content and the tools for accessing that content.
Multidatabase interdependencies in industry
Authors: Amit P. Sheth, George Karabatis
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

In this paper we address the problem of data consistency between interrelated data. In industrial environments, lack of consistent data creates difficulties in interoperation between systems and often requires manual interventions to restart operations that fail due to inconsistent data. We report the results of a study to understand applicability, adequacy and advantages of a framework we had proposed earlier to specify interdatabase dependencies in multidatabase environments. We studied several existing Bellcore systems and identified examples of interdependent data. The examples demonstrate that the framework allows precise and detailed specification of complex interdependencies that lead to efficient strategies to enforce the consistency requirements among the corporate data managed in multiple databases. We believe that our specification framework can help in the maintenance of data that meet a business's consistency needs, reduce time consuming and costly manual operations, and provide data of better quality to end users.
Original Contribution: Multilayer feedforward networks with a nonpolynomial activation function can approximate any function
Authors: Moshe Leshno, Vladimir Ya. Lin, Allan Pinkus, Shimon Schocken
Venue: Neural Networks (1993)

Several researchers characterized the activation function under which multilayer feedforward networks can act as universal approximators. We show that most of all the characterizations that were reported thus far in the literature are special cases of the following general result: A standard multilayer feedforward network with a locally bounded piecewise continuous activation function can approximate any continuous function to any degree of accuracy if and only if the network's activation function is not a polynomial. We also emphasize the important role of the threshold, asserting that without it the last theorem does not hold.
Object-oriented programming without recursive types
Authors: Benjamin C. Pierce, David N. Turner
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

It is widely agreed that recursive types are inherent in the static typing of the essential mechanisms of object-oriented programming: encapsulation, message passing, subtyping, and inheritance. We demonstrate here that modeling object encapsulation in terms of existential types yields a substantially more straightforward explanation of these features in a simpler calculus without recursive types.
Neural networks and pattern recognition in human-computer interaction
Authors: Janet Finlay, Russell Beale
Venue: ACM SIGCHI Bulletin (1993)

This paper reports on the activities of the workshop held on Sunday 28th April at the CHI'91 conference. Participants were there to discuss different ideas, methods and approaches to using pattern recognition in human-computer interaction.The workshop aimed to bring together researchers using novel methodologies, such as neural networks, in HCI applications, as well as practitioners using alternative or more traditional methods to perform pattern recognition tasks in HCI. The intention was to explore the scope and limitations of each type of approach and its requirements, for example in terms of representation and resources. The workshop considered the relationships between the different approaches and the possibility of developing hybrid methodologies to resolve HCI problems.Researchers working with both traditional and novel pattern recognition methods that have applications to human-computer interaction, and those with strong views either way, submitted position statements outlining their interest and viewpoints. Their research results are summarised in this report; in addition, the discussions on methods, on how the work reported interrelates, and on future areas of interest are presented. Major results from the use of neural network systems and other pattern recognition systems in the interface are presented, with application areas ranging from the interpretation of gestural input to the automatic determination of user task. Fuller details of the research can be found in a book based on the proceedings[2].
Accessing Files in an Internet: The Jade File System
Authors: Herman C. Rao, Larry L. Peterson
Venue: IEEE Transactions on Software Engineering (1993)

The Jade file system, which provides a uniform way to name and access files in an Internet environment, is introduced. Jade is a logical system that integrates a heterogeneous collection of existing file systems in which underlying file systems support different file access protocols. Because of autonomy, Jade is designed under the restriction that the underlying file systems may not be modified. In order to avoid the complexity of maintaining an Internet-wide, global name space, Jade permits each user to define a private name space. Jade's name space supports two features: it allows multiple file systems to be mounted under one directory, and it permits one logical name space to mount other logical name spaces. A prototype of Jade has been implemented to examine and validate its design. The prototype consists of interfaces to the Unix File System, the Sun Network File System, and the File Transfer Protocol. An overview of Jade's design is reported, and the authors' experiences in designing and implementing a large scale file system are reviewed.
A survey on usage of SQL
Authors: Hongjun Lu, Hock Chuan Chan, Kwok Kee Wei
Venue: ACM SIGMOD Record (1993)

Relational database systems have been on market for more than a decade. SQL has been accepted as the standard query language of relational systems. To further understand the usage of relational systems and relational query language SQL, we conducted a survey recently that covers various aspects of the usage of SQL in industrial organizations. In this paper, we present those results that may interest DBMS researcher and developers, including the profiles of SQL users, the application areas where SQL is used, the usage of different features of SQL and difficulties encountered by SQL users.
Using scheduler information to achieve optimal barrier synchronization performance
Authors: Leonidas Kontothanassis, Robert W. Wisniewski
Venue: ACM SIGPLAN Notices (1993)

Parallel programs frequently use barriers to synchronize successive steps in an algorithm. In the presence of multiprogramming the choice of spinning versus blocking barriers can have a significant impact on performance. We demonstrate how competitive spinning techniques previously designed for locks can be extended to barriers, and we evaluate their performance. We design an additional competitive spinning technique that adapts more quickly in a dynamic environment. We then propose and evaluate a new method that obtains better peformance than previous techniques by using scheduler information to decide between spinning and blocking. The scheduler information technique makes optimal choices incurring little overhead.
Towards a relational model for exclusively disjunctive information
Authors: Lu Zhang, Ken-Chih Liu
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

In this paper, the results obtained thus far in an ongoing research effort devoted to the modeling of indefinite information is presented. Specifically, an extended relational model coined E-tables for representing exclusive indefinite type model coined information is described. The semantic, or information content, of E-tables is precisely defined. Both syntactic and semantic definitions of the extended relational algebra operators of selection, projection, and Cartesian product are defined to deal with E-tables. Redundancies that might occur in E-tables are identified. Furthermore, relationships among E-tables, the Generalized Closed World Assumptions, and negations are explored.
How to aid non-experts
Authors: Mark Neerincx, Paul de Greef
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Aiding functions may be added to a computer system, so that users with insufficient knowledge can perform their tasks. The aiding should be integrated into the task execution of such users. Empirical knowledge is lacking about the conditions for successful aiding. We evaluated the on-line help system of the statistical software package SPSS/PC. It appears that the addition of help facilities to the system worsens the task performance and learning of novices substantially. In our view, the addition of help is harmful, because communication with the system is more complex as a result, whereas the help hardly provides the task support that novices need. De Greef et al. [5] provide two design principles that result in consistent communication and aiding in correspondence with users' needs: (i) the design of aiding functions is an integrated part of interface design and (ii) aiding is based upon an expert model of the users' task. We evaluated an interface for the statistical program HOMALS, which was designed according to these principles. As a consequence of the addition of aiding functions, non-expert users perform their tasks better and learn more.
Parallel Computations on Reconfigurable Meshes
Authors: Russ Miller, V. K. Prasanna-Kumar, Dionisios I. Reisis, Quentin F. Stout
Venue: IEEE Transactions on Computers (1993)

The mesh with reconfigurable bus is presented as a model of computation. The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, CHiP, polymorphic-torus network, and bus automation. It consists of an array of processors interconnected by a reconfigurable bus system that can be used to dynamically obtain various interconnection patterns between the processors. A variety of fundamental data-movement operations for the reconfigurable mesh are introduced. Based on these operations, algorithms that are efficient for solving a variety of problems involving graphs and digitized images are also introduced. The algorithms are asymptotically superior to those previously obtained for the aforementioned reconfigurable architectures, as well as to those previously obtained for the mesh, the mesh with multiple broadcasting, the mesh with multiple buses, the mesh-of-trees, and the pyramid computer. The power of reconfigurability is illustrated by solving some problems, such as the exclusive OR, more efficiently on the reconfigurable mesh than is possible on the programmable random-access memory (PRAM).
A model of the IS/organizational interface and users' perceptions of IS effectiveness
Authors: Catherine M. Beise
Venue: ACM SIGCPR Computer Personnel (1994)

As the line between the IS function and user functional areas becomes increasingly blurred due to end-user computing and the deeper integration of IS with organizational planning and operations, the quality of the IS/organizational interface consists of communication linkages between the IS function and other functional organizational subunits. Components of this interface include general IS/user communication and coordination mechanisms, user training and documentation, end-user support and services, chargeback policies, and alignment of IS/organizational planning processes. In an effort to better define and understand this interface, data were gathered via interviews and questionnaires from IS and user department managers and staff in nine private sector firms. The results of the research indicate that perceived IS effectiveness is related to the quality of this interface. This paper develops a model of the IS/organizational interface and provides specific focal points for improving IS personnel effectiveness with respect to the model.
Predicate migration: optimizing queries with expensive predicates
Authors: Joseph M. Hellerstein, Michael Stonebraker
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers by &ldquo;predicate pushdown&rdquo; rules, which apply restrictions in some random order before as many joins as possible. These rules work under the assumption that restriction is essentially a zero-time operation. However, today's extensible and object-oriented database systems allow users to define time-consuming functions, which may be used in a query's restriction and join predicates. Furthermore, SQL has long supported subquery predicates, which may be arbitrarily time-consuming to check. Thus restrictions should not be considered zero-time operations, and the model of query optimization must be enhanced. In this paper we develop a theory for moving expensive predicates in a query plan so that the total cost of the plan &mdash; including the costs of both joins and restrictions &mdash; is minimal. We present an algorithm to implement the theory, as well as results of our implementation in POSTGRES. Our experience with the newly enhanced POSTGRES query optimizer demonstrates that correctly optimizing queries with expensive predicates often produces plans that are orders of magnitude faster than plans generated by a traditional query optimizer. The additional complexity of considering expensive predicates during optimization is found to be manageably small.
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
Authors: Stephen E. Eldridge, Colin D. Walter
Venue: IEEE Transactions on Computers (1993)

Hardware is described for implementing the fast modular multiplication algorithm developed by P.L. Montgomery (1985). Comparison with previous techniques shows that this algorithm is up to twice as fast as the best currently available and is more suitable for alternative architectures. The gain in speed arises from the faster clock that results from simpler combinational logic.
Toward an architecture for adaptive, rational, mobile agents (abstract)
Authors: Innes A. Ferguson
Venue: ACM SIGOIS Bulletin (1992)

It is becoming widely accepted that neither purely reactive nor purely deliberative control techniques are capable of producing the range of behaviours required of intelligent agents in dynamic, unpredictable, multiagent worlds. We present a new architecture for controlling autonomous, mobile agents - building on previous work addressing reactive and deliberative control methods. The proposed multi-layered control architecture allows a resource-bounded, goal-directed agent to react promptly to unexpected changes in its environment; at the same time it enables the agent to reason predictively about potential conflicts by constructing and projecting theories which hypothesies other agents' intentions.The line of research adopted is very much a pragmatic one. A single, common architecture has been implemented which, being heavily parameterised, allows an experimenter to study functionally- and behaviourally-diverse agent configurations. A principal aim of this research is to understand the role different functional capabilities play in constraining an agent's behaviour under varying environmental conditions. To this end, an experimental testbed comprising a simulated multi-agent world has also been constructed. Some preliminary experience with the new control architecture is described.
Mondrian: a teachable graphical editor
Authors: Henry Lieberman
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Mondrian is an object-oriented graphical editor that can learn new graphical procedures through programming by demonstration. A user can demonstrate a sequence of graphical editing commands on a concrete example to illustrate how the new procedure should work. An interface agent records the steps of the procedure in a symbolic form, using machine learning techniques, tracking relationships between graphical objects and dependencies among the interface operations. The agent generalizes a program that can then be used on &ldquo;analogous&rdquo; examples. The generalization heuristics set it apart from conventional &ldquo;macros&rdquo; that can only repeat an exact sequence of steps. The system represents user-defined operations using pictorial &ldquo;storyboards&rdquo; of examples. By bringing the power of procedural programming to easy-to-use graphical interfaces, we hope to break down the &ldquo;Berlin Wall&rdquo; that currently exists between computer users and computer programmers.