ppxscal/embedding_network huggingface dataset:
Formative design evaluation of superbook
Authors: Dennis E. Egan, Joel R. Remde, Louis M. Gomez, Thomas K. Landauer, Jennifer Eberhardt, Carol C. Lochbaum
Venue: ACM Transactions on Information Systems (TOIS) (1989)

SuperBook is a hypertext browsing system designed to improve the usability of conventional documents. Successive versions of SuperBook were evaluated in a series of behavioral studies. Students searched for information in a statistics text. presented either in conventional printed form or in SuperBook form. The best version of SuperBook enabled students to answer search questions more quickly and accurately than they could with the conventional text. Students wrote higher quality &ldquo;open-book&rdquo; essays using SuperBook than they did with the conventional text, and their subjective ratings of the documentation strongly favored SuperBook. This work is a case study of formative design-evaluation. Behavioral evaluation of the first version of SuperBook showed how design factors and user strategies affected search and established baseline performance measures with printed text. The second version of SuperBook was implemented with the goal of improving search accuracy and speed. User strategies that had proved effective in the first study were made very easy and attractive to use. System response time for common operations was greatly improved. Behavioral evaluation of the new SuperBook demonstrated its superiority to printed text and suggested additional improvements that were incorporated into &ldquo;MiteyBook,&rdquo; a SuperBook implementation for PC-size screens. Search with MiteyBook proved to be approximately 25 percent faster and 25 percent more accurate than that obtained with a conventional printed book.
An incremental constraint solver
Authors: Bjorn N. Freeman-Benson, John Maloney, Alan Borning
Venue: Communications of the ACM (1990)

An incremental constraint solver, the DeltaBlue algorithm maintains an evolving solution to the constraint hierarchy as constraints are added and removed. DeltaBlue minimizes the cost of finding a new solution after each change by exploiting its knowledge of the last solution.
APL as the foundation for a universal computer language
Authors: Stephen W. Dunwell
Venue: ACM SIGAPL APL Quote Quad (1990)

Some ways in which universal computer languages differ from those in common use today. Universal dictionary. Universal alphabet. Universal character representation. Universal keyboard. Universal communication among computer systems. Elimination of an operating system as a separate entity. Some advantages of universal computer languages over those in common use today. Easier to teach and to learn. Easier and faster creation and modification of software. Faster execution. Easier transfer of software from one system to another. Fewer application software packages required. Some of the changes and additions required to make APL an acceptable universal computer language. Implement the APL interpreter at the chip level. Add language features to meet operating system requirements. Eliminate the features now required to communicate with operating systems of the present kind. Improve communication among users of a system. Improve the handling of integers. Improve the handling of graphics. Improve alphabet, character representation, and keyboard. The second edition of my monograph on this subject will be available at the Copenhagen APL Conference.
Cost-error relationships in A* tree-searching
Authors: Henry W. Davis
Venue: Journal of the ACM (JACM) (1990)

Pearl has shown that, in admissible A* tree-searching, the expected number of nodes expanded is bounded above and below by exponential functions of heuristic error. An additional assumption required for the validity of Pearl's argument is given. The assumption's significance and interpretation are discussed.
Application of neurolinguistic techniques to knowledge acquisition
Authors: P. F. Micciche, J. S. Lancaster
Venue: Issue 108 (April 1989) (1989)

Good communication between the domain expert and the knowledge engineer is a must for successful knowledge engineering. However, this is not an easily achieved goal because much of the process of knowledge engineering is still a relatively ad hoc endeavor, pursued by individuals from a wide range of backgrounds with limited training. Consequently, individual knowledge engineers are frequently faced with numerous difficulties including experts who have difficulty verbalizing their knowledge and reasoning processes, who feel uncomfortable discussing their work, or who are unwilling to reveal their knowledge. In these situations, a primary responsibility of the knowledge engineer is to establish an environment in which the expert can be more able, comfortable, and willing to communicate his knowledge. The authors argue that the techniques used in psychological interviewing can be used equally well in knowledge engineering. They discuss some techniques derived from neurolinguistic programming (NLP) (Grinder amp; Bandler, 1976) and show how they can address possible trouble points in setting up a comfortable interviewing environment.
win and sin: predicate transformers for concurrency
Authors: Leslie Lamport
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1990)

The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
Expressing qualified logic in APL
Authors: J. C. McInturff
Venue: ACM SIGAPL APL Quote Quad (1989)

This paper expresses the imperative form of the logic qualifiers all (or every), some (or there exists), and none (or no). These qualifiers will be cast in the form of new logic verbs or functions expressed in APL.A simple inference engine will be created which starts with rules using the imperative form of these qualifiers. These rules will be expressed to the computer in APL. The expert system will arrive at all possible inferences and express the meaning of these inferences as an output which uses the same conversational language as the input. An added capability of the system, to predict the likelihood of the inferences, will be demonstrated.
Space shuttle main engine component assembly, assignment, and scheduling expert system
Authors: W. E. Dietz, H. J. Ferber, M. Ali
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The Space Shuttle utilizes several rocket engine systems, all of which must function with a high degree of reliability for successful mission completion. The Space Shuttle Main Engine (SSME) is by far the most complex of the rocket engine systems. In earlier spacecraft, rocket systems (and, in fact, the entire spacecraft) were designed for use on only a single mission and were discarded after use. In a major departure from earlier practices, almost all systems on the Space Shuttle, including the rocket systems, are designed to be reusable; only the external tank is discarded during each mission.The reusability of spacecraft systems introduces many problems related to testing, reliability, and logistics. Components must be assembled from parts inventories in a manner which will most effectively utilize the available parts. Assembly must be scheduled to efficiently utilize available assembly benches while still maintaining flight schedules. Assembled components must be assigned to as many contiguous flights as possible, to minimize component changes. Each component must undergo a rigorous testing program prior to flight. In addition, testing and assembly of flight engines and components must be done in conjunction with the assembly and testing of developmental engines and components.The development, testing, manufacture, and flight assignments of the engine fleet involves the satisfaction of many logistical and operational requirements, subject to many constraints. The purpose of the SSME Component Assembly and Life Management Expert System (CALMES) is to assist the engine assembly and scheduling process, and to insure that these activities utilize available resources as efficiently as possible.
Translation and Execution of Distributed Ada Programs: Is It Still Ada?
Authors: Richard A. Volz, Trevor N. Mudge, Padmanabhan Krishnan, Gregory D. Buzzard
Venue: IEEE Transactions on Software Engineering (1989)

Some of the fundamental issues and tradeoffs involved in the translation and execution of programs written in the Ada language and intended for distributed execution are examined. The memory access architecture, binding time and degree of system homogeneity are the three basic characteristics in terms of which target systems can be described. Library subprograms and library packages are identified as natural distributable units of the language. The program-to-process/memory mapping and the unit of the language to be distributed are the key issues in the distribution of Ada. The implications of various alternatives for these are analyzed.
An object-oriented datamodel for the VLSI design system PLAYOUT
Authors: E. Siepmann, G. Zimmermann
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A complete datamodel for an integrated VLSI design system is developed in a stepwise manner. This datamodel introduces a unified view of all design domains and hierarchy levels that result in a considerable simplification of the communication among the design tools. We defined five basic objects: cell, interface, contents, instance and configuration for high level description of all design data. The model also covers views, types, alternatives, versions and the design history. In particular our handling of the configuration demonstrates reasonable response times, due to the strict avoidance of redundant information and the storage of complex objects. This datamodel can be directly used for the implementation of an efficient object-oriented design database.
Extending ordinary inheritance schemes to include generalization
Authors: C. H. Pedersen
Venue: ACM SIGPLAN Notices (1989)

The arrangement of classes in a specialization hierarchy has proved to be a useful abstraction mechanism in class-based object oriented programming languages. The success of the mechanism is based on the high degree of code reuse that is offered, along with simple type conformance rules. The opposite of specialization is generalization. We will argue that support of generalization in addition to specialization will improve class reusability. A language that only supports specialization requires the class hierarchy to be constructed in a top down fashion. Support for generalization will make it possible to create super-classes for already existing classes, hereby enabling exclusion of methods and creation of classes that describe commonalties among already existing ones. We will show how generalization can coexist with specialization in class-based object oriented programming languages. Furthermore, we will verify that this can be achieved without changing the simple conformance rules or introducing new problems with name conflicts.
Rigi-A system for programming-in-the-large
Authors: H. A. Müller, K. Klashinsky
Venue: Proceedings of the 10th international conference on Software engineering (1988)

This paper describes Rigi, a model and a tool for programming-in-the-large. Rigi uses a graph model and abstraction mechanisms to structure and represent the information accumulated during the development process. The objects and relationships of the graph model represent system components and their dependencies. The objects can be arranged in aggregation and generalization hierarchies. The Rigi editor assists the designers, programmers, integrators, and maintainers in defining, manipulating, exploring, and understanding, the structure of large, integrated, evolving software systems. Rigi was designed to address three of the most difficult problems in the area of programming-in-the-large: the mastery of the structural complexity of large software systems, the effective presentation of development information, and the definition of procedures for checking and maintaining the completeness, consistency, and traceability of system descriptions. Thus, the major objective of Rigi is to effectively represent and manipulate the building blocks of a software system and their myriad dependencies, thereby aiding the development phases of the project.
Three-Dimensional Shape Analysis Using Moments and Fourier Descriptors
Authors: A. P. Reeves, R. P. Prokop, Susan E. Andrews, Frank P. Kuhl
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A procedure for using moment-based feature vectors to identify a three-dimensional object from a two-dimensional image recorded at an arbitrary viewing angle and range is presented. A moment form called standard moments, rather than the usual moment invariants, is considered. A standard six-airplane experiment was used to compare different techniques. Fourier descriptors and moment invariants were both compared to the present scheme for normalized moments. Various experiments were conducted using mixtures of silhouette and boundary moments and different normalization techniques. Standard moments gave slightly better results than Fourier descriptors for this experiment; both of these techniques were much better than moment invariants.
A cross-cultural comparison of IS designer values
Authors: Kuldeep Kumar, Niels Bjorn-Andersen
Venue: Communications of the ACM (1990)

The values of system designers have a significant influence on the extent to which information system meet the broad effectiveness needs of an organization.
Integer programming vs. expert systems: an experimental comparison
Authors: Vasant Dhar, Nicky Ranganathan
Venue: Communications of the ACM (1990)

Expert system and integer programming formulations of an NP-complete constraint satisfaction problem are contrasted in terms of performance, ability to encode complex preferences, control of reasoning, and supporting incremental modification of solutions in response to changing input data.
Bugfind: a tool for debugging optimizing compilers
Authors: J. M. Caron, P. A. Darnell
Venue: ACM SIGPLAN Notices (1990)

This paper describes a tool for isolating modules that are compiled incorrectly when optimization is invoked. This tool benefits application developers by automatically compiling each module to its highest level of correct optimization. It benefits compiler writers by pinpointing failing modules.
Algorithm alterable models and APL
Authors: Alexey L. Miroshnikov
Venue: ACM SIGAPL APL Quote Quad (1990)

The paper deals with a software development of a certain kind of economics systems models: algorithm alterable models. The special feature of algorithm alterable models as follows: a research work with the model gives new knowledge about the modelling system, that cause a necessity to change the model itself. After changes this cycle is repeated. APL is mostly suitable for a development of the alterable models software. A method of the development is discussed in the paper as well. As an example the paper outlines a modeling of a long-term planning process in a capital construction. A corresponding software - DDS for the planning - is described. The DDS had been implemented in APL 2.0 on a CDC Cyber-172 mainframe in LIIAS USSR. So called, psuedo-parallel executions, combined APL with ALGOL and FORTRAN subsystems, have been developed to improve dynamics characteristics of the DSS software.
Special function integration
Authors: J. C. Piquette
Venue: ACM SIGSAM Bulletin (1989)

This article describes a method by which the integration capabilities of symbolic-mathematics computer programs can be extended to include integrals that contain special functions. A summary of the theory that forms the basis of the method is given in Appendix A. A few integrals that have been evaluated using the method are presented in Appendix B. A more thorough development and explanation of the method is given in Piquette, in review (b).
Relationship Between P-Valued Majority Functions and P-Valued Threshold Functions
Authors: Y. Yamamoto, F. Fujita
Venue: IEEE Transactions on Computers (1988)

In a previous paper (Trans. IECE Japan, vol.J63-D, p.493-500, 1980, vol.J64-D, p.172-3, 1981 and vol.E-67, p.47-8, 1984), the authors defined a new class of multiple-valued logic functions, called multiple-valued majority functions. The authors clarifies the distinction of multiple-valued majority functions from multiple-valued threshold functions through the difference between a number function and an inner product of an input vector and a weight vector.
HELPing writer and product team communication through online document design
Authors: Julie S. McDuffee
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1990)

As technology advances, software companies must reevaluate and adapt their policies toward product development. The specific product addressed in this paper is an Asset/Liability Management System (ALMS) for the financial industry. The project involves three programmers, who will design and code the ALMS application and one writer, who will design and code an online help system. The end users sees one product, a diskette, that contains both the application and the documentation.
Optimum polynomial retrieval functions based on the probability ranking principle
Authors: Norbert Fuhr
Venue: ACM Transactions on Information Systems (TOIS) (1989)

We show that any approach to developing optimum retrieval functions is based on two kinds of assumptions: first, a certain form of representation for documents and requests, and second, additional simplifying assumptions that predefine the type of the retrieval function. Then we describe an approach for the development of optimum polynomial retrieval functions: request-document pairs (fl, dm) are mapped onto description vectors x(fl, dm), and a polynomial function e(x) is developed such that it yields estimates of the probability of relevance P(R | x (fl, dm) with minimum square errors. We give experimental results for the application of this approach to documents with weighted indexing as well as to documents with complex representations. In contrast to other probabilistic models, our approach yields estimates of the actual probabilities, it can handle very complex representations of documents and requests, and it can be easily applied to multivalued relevance scales. On the other hand, this approach is not suited to log-linear probabilistic models and it needs large samples of relevance feedback data for its application.
The parascope editor: an interactive parallel programming tool
Authors: V. Balasundaram, K. Kennedy, U. Kremer, K. McKinley, J. Subhlok
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The ParaScope project is building an integrated collection of tools to help scientific programmers develop correct and efficient parallel programs. The centerpiece of this collection is the ParaScope Editor, an intelligent interactive editor for parallel FORTRAN programs. The ParaScope Editor displays data dependencies, which correspond to potential data races among the iterations of a parallel loop, to assist the user in determining the correctness of a proposed parallelization. In addition, it uses dependencies to support a variety of program transformations selectable by the programmer. The eventual goal for the ParaScope Editor is to support arbitrary editing changes by performing full incremental data dependence analysis in response to program changes. In addition, it will understand and recognize when synchronization correctly prevents race conditions. The ParaScope Editor is a new kind of program construction tool; one that not only manages text, but also presents the user with insights into the semantic structure of the program being constructed.
Implementing a Prolog machine with multiple functional units
Authors: A. Singhal, Y. N. Patt
Venue: Proceedings of the 21st annual workshop on Microprogramming and microarchitecture (1988)

This paper describes the microarchitecture of the PLUM, a high performance Prolog machine. Multiple specialized functional units, each with a port to memory, operate in parallel using data driven control. Instructions are dynamically scheduled by a Prefetch Unit to execute on several specialized functional units. Out of order execution is allowed, and instructions execute when their operands are available. Special synchronization techniques that ensure correct parallel unification and pipelined operation are discussed. The performance of the PLUM is limited by unification, since almost all other operations execute in parallel with unification. Unification time is reduced by parallel unification, resulting in an overall speedup of approximately a factor of 4 over the Berkeley PLM.
High level specification of concurrency control in distributed database systems
Authors: L. Chiu, M. T. Liu
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Concurrency control is one of the major issues in database systems; therefore, many concurrency control algorithms based on different strategies have been proposed. Unfortunately there is still lack of a general model for describing these algorithms. Hence, algorithms cannot be uniformly presented, which makes it hard to understand them and to prove their correctness. This paper proposes a high level specification, based on an object-oriented model, of concurrency control algorithms. Concurrency control algorithms are specified in a high level fashion without losing their formality. Basing on the object-oriented model, objects are individually specified. Therefore, the specification of a concurrency control algorithm consists of the specifications of objects and their interactions.
Anatomy of a software engineering project
Authors: Catherine L. Bullard, Inez Caldwell, James Harrell, Cis Hinkle, A. Jefferson Offutt
Venue: ACM SIGCSE Bulletin (1988)

This paper discusses a complete software development project carried out in a one quarter undergraduate software engineering course. The project was the design and implementation of a complete system by 25 students. They worked in smaller groups on four functionally separate subsystems that were successfully integrated into a complete system. This was accomplished by using five advanced students to manage the groups, real users to criticize each step of the process, and UNIX tools to implement the subsystems. This paper describes the project, presents the methodologies used, and discusses both the positive and negative aspects of this course. It concludes by presenting a set of recommendations based on our experience with this project.
Providing Quality Responses with Natural Language Interfaces: The Null Value Problem
Authors: Mimi Kao, Nick Cercone, Wo-Shun Luk
Venue: IEEE Transactions on Software Engineering (1988)

An underlying relational database model and the database query language SQL are assumed, and methods are presented for responding with appropriate answers to null value responses. This is done by using a knowledge base based on RM/T, an extended relational model. The advantages of this approach are described. To demonstrate the utility of the knowledge base model, a simple knowledge base is constructed. The algorithms that provide additional information when a null answer is returned are detailed.