ppxscal/embedding_network huggingface dataset:
Document classification for software quality systems
Authors: Kari Laitinen
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Software development origanizations need to have appropriate document control policies. A software document classification can serve as a framework for establishing such policies. This paper presents a software document classification and discusses the quality system functions needed for each class of documents. Software development is viewed as a documentation process, and documents are considered the most essential products of the development process. Referring to the document classification, new definitions for the concept of software are given, and the general difficulties of software documentation are analyzed.
A Comparative Evaluation of Expert System Tools
Authors: William Mettrey
Venue: Computer (1991)

The results of an assessment of the functionality and performance of tools with different architectural approaches are presented. The goal was to gain insight into the advantages and disadvantages of the various architectures. The tools evaluated in the study were (1) the Automated Reasoning Tool for Information Management (ARTIM), (2) the C Language Integrated Production System (CLIPS), (3) the Knowledge Engineering System (KES), (4) Level 5, and (5) VAX OPS5. Emphasis was on tools implemented in languages other than Lisp. KES and Level 5 were found to be inadequate for an application that required constructive problem solving, but both tools could be expected to provide improved performance for problems based on a heuristic classification approach due to their backward-chaining orientation. On the other hand, ART-IM, CLIPS, and VAX OPS5 might prove less effective for heuristic classification problem solving than for synthesis because they lack support for backward chaining. The results reinforce the fact that all expert system tools have strengths and weaknesses and that no single tool is dominant for a wide spectrum of applications or over a wide range of functionality.
Measuring data locality in internal sorting algorithms
Authors: Seth Bergmann
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A method for measuring data locality in four common sorting algorithms is investigated. A modification of the heap data structure exhibiting improved locality is also introduced.
Indirect Star-Type Networks for Large Multiprocessor Systems
Authors: Kyungsook Y. Lee, Hyunsoo Yoon
Venue: IEEE Transactions on Computers (1991)

The authors propose three indirect star-type networks, the indirect star networks I and II and the star-delta network, and investigate their properties. An indirect star-type network is obtained by unfolding the star graph. The star-delta network is obtained through an unfolding scheme based on the recursive property of the star graph, and has n-1 switching stages. The star-delta network has the advantage of being controlled by the destination tag routing scheme. The indirect star-type networks are to the star graph as the indirect cube-type networks are to the n-cube. The authors analyze the performance of the indirect star-type networks under uniform traffic to investigate their potential as an alternative to the indirect cube-type networks for the future high-performance large multiprocessor systems.
The role of natural language in a multimodal interface
Authors: Philip R. Cohen
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Although graphics and direct manipulation are effective interface technologies for some classes of problems, they are limited in many ways. In particular, they provide little support for identifying objects not on the screen, for specifying temporal relations, for identifying and operating on large sets and subsets of entities, and for using the context of interaction. On the other hand, these are precisely strengths of natural language. This paper presents an interface that blends natural language processing and direct manipulation technologies, using each for their characteristic advantages. Specifically, the paper shows how to use natural language to describe objects and temporal relations, and how to use direct manipulation for overcoming hard natural language problems involving the establishment and use of context and pronominal reference. This work has been implemented in SRI's Shoptalk system, a prototype information and decision-support system for manufacturing.
Computer-looking for non trivial repetitions in the Pascal triangle
Authors: J. M. Molinelli, J. L. Freire, A. Blanco
Venue: ACM SIGSMALL/PC Notes (1991)

An exploration of the Pascal triangle, finding some non trivial repetitions, using a PC environment with Turbo-Pascal and REDUCE (3.3) is given. Some of the experimental results are also mathematically classified.
Invariant and geometric aspects of algebraic complexity theory I
Authors: Jacques Morgensern
Venue: Journal of Symbolic Computation (1991)

We expound new approaches to the analysis of algebraic complexity based on synthetic and algebraic geometry. The search for interesting lower bounds is a good reason to study the complexity of computation of linear forms. The analysis of linear algorithms leads naturally to questions about computational networks with their combinatorial aspects and about special configurations of sets of points in projective spaces which classical invariant theory might help to answer.
Forecasting system of an employment pension scheme
Authors: Timo Korpela, Bo Lundqvist
Venue: ACM SIGAPL APL Quote Quad (1991)

The paper describes long-term forecasting system of the Finnish employment pension scheme. All employees and self-employed persons are included in the scheme. The forecasting system has three main models: demographic model, pension expenditure model and financing model. All models are programmed in APL2, but they make use of other products in the same environment, e.g., APE (Application Prototype Environment), SQL (Structured Query Language), ICU (Interactive Chart Utility), AFP (Advanced Function Printing). The models are composed of modules, which makes it possible to change the model at all levels. This structure gives also self-documentary programming code. Flexibility and documentary reasons have guided the programming so that compact and efficient code have not been primary objectives. The system consists of 300 functions and total amount of APL-code is about 5000 lines. Only specialists use the forecasting model application. The stored output of the model can be retrieved with the help of an APE-based interface. It gives all end users - also those who have no knowledge of APL - possibility to make tables and ICU-graphics of the data.
Integrating perception, action and learning
Authors: Jim Antonisse, Harry Wechsler
Venue: ACM SIGART Bulletin (1991)

The construction of robots adequate for field operation requires the integration of planning, perception, and learning. The coordination of these technologies in the context of constraints of realtime, robust, and safe operation is leading to coupled representations of perception and action. We are developing a system that explores the use of Case-Based Reasoning techniques for inducing low-level, coupled representations of potential robot locations. These will subsequently be used for planning and possibly as operationality criteria in deriving efficient task description. This work is proceeding under an architectural design that integrates horizontal, subsumption approaches to building robots with the vertical Perception-Control-Action internal structure for each layer.
Toward an Expert System for Expressive Musical Performance
Authors: Margaret L. Johnson
Venue: Computer (1991)

The development and implementation of an expert system that determines the tempo and articulations of Bach fugues are described. The rules in the knowledge base are based on the expertise of two professional performers. The system's input is a numeric representation of the fugue. The system processes the input using a transition graph, a data structure consisting of nodes where data is stored and edges that connect the nodes. The transition graph recognizes rhythmic patterns in the input. Once the system identifies a pattern, it applies a specific rule or performs a procedure. System output consists of a listing of tempo and articulation instructions. To validate the expert system, its output was compared with versions of fugues edited by one of the two experts used in developing the system. In tests with six fugues, the expert system generated the same editing instructions 85 to 90% of the time.
A performance standard for Ada 9X
Authors: A. Burns
Venue: ACM SIGAda Ada Letters (1990)

Real-time systems have special performance requirements that are often impossible to satisfy utilizing only general purpose Ada compilation and run-time environments. It is proposed that a secondary Performance Standard be produced which explains and documents the programming paradigms used by real-time practitioners, and the language structures amenable to effective optimization. It is argued that a Catalogue of authorized scheduling models should also be part of this secondary standard.
Collecting interpretations of expressions
Authors: Paul Hudak, Jonathan Young
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1991)

A collecting interpretation of expressions is an interpretation of a program that allows one to answer questions of the sort: &ldquo;What are all possible values to which an expression might evaluate during program execution?&rdquo; Answering such questions in a denotational framework is akin to traditional data flow analysis and, when used in the context of abstract interpretation, allows one to infer properties that approximate the run-time behavior of expression evaluation. Exact collecting interpretations of expressions are developed for three abstract functional languages: a strict first-order language, a nonstrict first-order language, and a nonstrict higher order language (the full untyped lambda calculus with constants). It is argued that the method is simple (in particular, no powerdomains are needed), Natural (it captures the intuitive operational behavior of a cache), yet more expressive than existing methods (it is the first exact collecting interpretation for either nonstrict higher order languages). Correctness of the interpretations with respect to the standard semantics is shown via a generalization of the notion of strictness. It is further shown how to form abstractions of these exact interpretations, using as an example a collecting strictness analysis which yields compile-time information not previously captured by conventional strictness analyses.
Interactive constraint-based search and replace
Authors: David Kurlander, Steven Feiner
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

We describe enhancements to graphical search and replace that allow users to extend the capabilities of a graphical editor. Interactive constraint-based search and replace can search for objects that obey user-specified sets of constraints and automatically apply other constraints to modify these objects. We show how an interactive tool that employs this technique makes it possible for users to define sets of constraints graphically that modify existing illustrations or control the creation of new illustrations. The interace uses the same visual language as the editor and allows users to understand and create powerful rules without conventional programming. Rules can be saved and retrieved for use alone or in combination. Examples, generated with a working implementation, demonstrate applications to drawing beautification and transformation.
Robust Classifiers by Mixed Adaptation
Authors: Dan Gutfinger, Jack Sklansky
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The production of robust classifiers by combining supervised training with unsupervised training is discussed. A supervised training phase exploits statistically scene invariant labeled data to produce an initial classifier. This is followed by an unsupervised training phase that exploits clustering properties of unlabeled data. This two-phase process is termed mixed adaptation. A probabilistic model supporting this technique is presented along with examples illustrating mixed adaptation. These examples include the detection of unspecified dotted curves in dotted noise and the detection and classification of vehicles in cinematic sequences of infrared imagery.
Relational data models and category theory (abstract)
Authors: T. Y. Lin
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Mathematicians use the notion of category to define their universe. While database theorists use the data model to define their universe of discourse. Therefore, a close interconnection between these two disciplines should be anticipated. This paper represents our first effort to explore this interconnection. Our present focus is on the categorical constructions of data modeling. Our approach encompasses many of current data models, relational models [Codd79], poset models [GiHu83], metric models [Motr86], Topological data models [Lin89], Power set models [BuPe82], and Sea View's Multilevel relational Data Models [Denn87]. This unification is economical both in concept and development. The categorical data models is not merely a conceptual unification of data modeling. In fact, this give us a framework of &ldquo;generic database system&rdquo;. And each individual system can then be obtained by specifying the category or the objects. We are developing a prototype of a generic DBMS for categorical data model. By specifying the category to that of graded sets the prototype DBMS will turn into a multilevel DBMS. There is a common misconception about the category theory; it is a very GENERAL mathematical theory. Category theory is a very HIGH level, but NOT very general, mathematical language. For example, category theory is not general enough to express any internal structure of its objects.
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems
Authors: Chonggun Kim, Hisao Kameda
Venue: IEEE Transactions on Computers (1992)

The authors propose a load-balancing algorithm that determines the optimal load for each host so as to minimize the overall mean job response time in a distributed computer system that consists of heterogeneous hosts. The algorithm is a simplified and easily understandable version of the single-point algorithm originally presented by A.N. Tantawi and D. Towsley (1985).
Efficient routing techniques for cooperating processors in dataflow computers
Authors: Barry G. Douglass, A. Yavuz Oruc
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A key problem in designing a dataflow computer is to maintain a strong cooperation among the processors. This requires two types of communications among the processors which are commonly referred to as arbitration and distribution. The paper describes a family of switches, called CP networks which can be used as arbitrators and distributors in dataflow computers. The arbitration networks require &Ogr;(N log2 N) binary switches, and have &Ogr;(log22 N) delay, and distribution networks require &Ogr;(N log22 N) binary switches, and have &Ogr;(log22 N) delay.
A statistical approach to sense disambiguation in machine translation
Authors: Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, Robert L. Mercer
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

We describe a statistical technique for assigning senses to words. An instance of a word is assigned a sense by asking a question about the context in which the word appears. The question is constructed to have high mutual information with the word's translations.
A Microprocessor-Based Office Image Processing System-An Extension of Work
Authors: M. Atiquzzaman, W. H. Shehadah
Venue: IEEE Transactions on Computers (1992)

The authors extend the work done by L.M. Ni et al. on microprocessor-based office image processing systems. Ni et al. did not distinguish between the compute-bound and I/O-bound state of the machine in the case where image input time is greater than the output time. The authors clearly show the above distinction and present the correct expressions for such cases.
Sequential circuit verification using symbolic model checking
Authors: J. R. Burch, E. M. Clarke, K. L. McMillan, David L. Dill
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

The temporal logic model checking algorithm developed by Clarke, Emerson, and Sistla [9] is modified to represent a state graph using binary decision diagrams (BDD's) [4]. Because this representation captures some of the regularity in the state space of sequential circuits with data path logic, we are able to verify circuits with an extremely large number of states. We demonstrate this new technique on a synchronous pipelined design with approximately 5 x 1020 states. Our model checking algorithm handles full CTL with fairness constraints. Consequently, we are able to handle a number of important liveness and fairness properties, which would otherwise not be expressible in CTL. We give empirical results on the performance of the algorithm applied to both synchronous and asynchronous circuits with data path logic.
MAX: a meta-reasoning architecture for &ldquo;X&rdquo;
Authors: Daniel R. Kuokka
Venue: ACM SIGART Bulletin (1991)

This article summarizes the MAX system, a meta-reasoning architecture designed to integrate the reasoning, execution, and learning required of intelligent agents. MAX is based on the idea of specifying all the reasoning and learning capabilities of a system as explicit, declarative knowledge. The mechanisms that support this, as well as the benefits and drawbacks are outlined. An example of the integrated behavior implemented in MAX is given, along with comparisons to related architectures.
ToolCASE: a repository of computer-aided software engineering tools
Authors: Panagiotis Linos
Venue: ACM SIGSOFT Software Engineering Notes (1992)

The design and construction of an up-to-date repository of CASE (Computer-Aided Software Engineering) tools, called ToolCASE, is introduced in this paper. ToolCASE is populated with information regarding purchasing, citations and software engineering capabilities of existing CASE tools. Purchasing information, included in ToolCASE, embodies vendors, costs, discounts, hardware and software requirements; the citations encompass various publications on CASE, whereas software engineering capabilities comprise phases of the paradigm automated, software application area targeted and methodologies supported by CASE tools. ToolCASE is designed for people with diverse backgrounds who wish to choose the proper CASE tool for their specific needs. For instance, a project manager can retrieve the name and phone number of the company that develops a particular CASE tool, its price and the first year it was available. A software engineer may request all CASE tools that automate a particular phase of a software engineering paradigm, aim at the development of software for a specific application area or follow a certain methodology. In addition, a researcher could acquire citations on existing CASE tools that meet specific requirements.
AD/Cycle repository manager from object-oriented perspective
Authors: Leszek A. Maciaszek
Venue: ACM SIGSOFT Software Engineering Notes (1991)

The advantage of an object-oriented approach to development is that it offers the analyst, designer and programmer a higher level of abstraction in which to work. AD/Cycle uses object orientation in two contexts: (1) it encourages an object-oriented approach to software production based on AD/Cycle, and (2) it presents itself as an object-oriented database development platform. The former is a methodological issue, the latter - an environmental issue.The methodological issue is only sketched in AD/Cycle documents, and as such is addressed only briefly in this paper. The main thread of the paper is on the evaluation of the environmental aspect of AD/Cycle. This implies that the paper concentrates on the Repository Manager of AD/Cycle. In particular, the paper examines the conceptual specification view and also the logical specification view combined with run-time services.The conclusions of this paper are only as sound as the object orientation paradigm itself. The paper places special emphasis on this issue. It is believed that object orientation solves the application and data management problems faced by CASE developers and users, but hard proof has yet to be provided. The same applies to the claims of productivity improvements in most but particularly susceptible application development activities (such as window management).
On randomly interleaved memories
Authors: Ram Raghavan, John P. Hayes
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Memory address interleaving, where an address k generated by a processor is mapped into the memory bank k (mod m), is a basic technique for increasing memory bandwidth. However, the access conflicts that can occur in interleaved memories sometimes reduce the bandwidth gain significantly, especially in vector processors. Recently, a few random interleaving schemes have been proposed to reduce memory contention. We define a class of such methods, called LINEAR, that uses linear transformations of addresses for randomization and includes those used in the RP3 and Cydra 5 computers. After identifying a basic deficiency of LINEAR, we define a new class of random interleaving methods called RANDOM-H and, through comparative analysis, show that RANDOM-H performs better than LINEAR. To illustrate RANDOM-H, we describe MASH, which is a random interleaving technique based on multiplicative hashing. Our simulation results indicate that MASH generally performs better than typical linear methods.
Using Program Slicing in Software Maintenance
Authors: Keith Brian Gallagher, James R. Lyle
Venue: IEEE Transactions on Software Engineering (1991)

Program slicing is applied to the software maintenance problem by extending the notion of a program slice (that originally required both a variable and line number) to a decomposition slice, one that captures all computation on a given variable, i.e., is independent of line numbers. Using the lattice of single variable decomposition slices ordered by set inclusion, it is shown how a slice-based decomposition for programs can be formed. One can then delineate the effects of a proposed change by isolating those effects in a single component of the decomposition. This gives maintainers a straightforward technique for determining those statements and variables which may be modified in a component and those which may not. Using the decomposition, a set of principles to prohibit changes which will interfere with unmodified components is provided. These semantically consistent changes can then be merged back into the original program in linear time.
Lincoln
Authors: Clifford J. Weinstein
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

The Lincoln Laboratory Program in Robust Speech Recognition Technology was initiated in FY85 with the major goal of developing techniques for high-performance speech recognition under the stress and noise conditions typical of the fighter cockpit. After achieving significant advances in robust isolated-word recognition (IWR) during FY85 and FY86, the program evolved in FY87 to the development of robust continuous speech recognition (CSR) techniques for the stressful, limited-task-domain environment typical of the Pilot's Associate. In FY88, the Lincoln CSR work was extended successfully to the large-vocabulary task typical of the Battle Management environment. A major goal of the current program, starting in FY89, is to extend and apply these robust CSR techniques to talker-independent, noisy and distorted speech conditions.