ppxscal/embedding_network huggingface dataset:
Implementation and performance analysis of parallel assignment algorithms on a hypercube computer
Authors: B. A. Carpenter, N. J. Davis,  IV
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

The process of effectively coordinating and controlling resources during a military engagement is known as battle management/command, control, and communications (BM/C3). One key task of BM/C3 is allocating weapons to destroy targets. The focus of this research is on developing parallel computation methods to achieve fast and cost effective assignment of weapons to targets. Using the sequential Hungarian method for solving the assignment problem as a basis, this paper presents the development and the relative performance comparison of four parallel assignment methodologies that have been implemented on the Intel iPSC hypercube computer. The first three approaches are approximations to the optimal assignment solution. The advantage to these is that they are computationally fast and have proven to generate assignments that are very close the optimal assignment in terms of cost. The fourth approach is a parallel implementation of the Hungarian algorithm, where certain subtasks are performed in parallel. This approach produces an optimal assignment as compared to the sub-optimal assignments that result from the first three approaches. The relative performance of the four approaches is compared by varying the number of weapons and targets, the number of processors used, and the size of the problem partitions.
Parallel Parsing of Arithmetic Expressions
Authors: Y. N. Srikant
Venue: IEEE Transactions on Computers (1990)

Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires O( square root n) time on the mesh-connected model and O(log/sup 2/ n) time on others. For the mesh-connected computer, the author uses a wrap-around row-major ordering. For the shuffle computer, he uses an extra connection between adjacent processors, and thus four connections per processor are required.
3D Euclidean Versus 2D Non-Euclidean: Two Approaches to 3D Recovery from Images
Authors: K. I. Kanatani
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Methods of 3D recovery in computer vision for computing the shape and motion of an object from projected images when an object model is available are classified into two types: the 3D Euclidean approach, which is based on geometrical constraints in 3D Euclidean space, and the 2D non-Euclidean space. Implications of these two approaches are discussed, and some illustrating examples are presented.
Vertical partitioning for database design: a graphical algorithm
Authors: Shamkant B. Navathe, Mingyoung Ra
Venue: Proceedings of the 1989 ACM SIGMOD international conference on Management of data (1989)

Vertical partitioning is the process of subdividing the attributes of a relation or a record type, creating fragments. Previous approaches have used an iterative binary partitioning method which is based on clustering algorithms and mathematical cost functions. In this paper, however, we propose a new vertical partitioning algorithm using a graphical technique. This algorithm starts from the attribute affinity matrix by considering it as a complete graph. Then, forming a linearly connected spanning tree, it generates all meaningful fragments simultaneously by considering a cycle as a fragment. We show its computational superiority. It provides a cleaner alternative without arbitrary objective functions and provides an improvement over our previous work on vertical partitioning.
APEX1, a library of dynamic programming examples
Authors: Michael Britt
Venue: ACM SIGCSE Bulletin (1989)

This paper surveys the growing field of program visualization or visual programming, the ability to visualize the execution of a computer program or the effects of a computer program on its data structures on a display device. Additionally, a library of dynamic Pascal examples, APEX1, designed for use in a second Pascal (data structures) course is introduced. Finally, the characteristics that an optimal program visualization system should possess are discussed.
Is Ada too big? A designer answers the critics
Authors: Brian A. Wichmann
Venue: Communications of the ACM (1984)

Many have criticized the Department of Defense's new computer language, Ada, saying it is too large, too complicated, or too difficult to use. Are they right? And are there some simplifications that could be made to Ada without destroying its usefulness?
Experimental comparison of three system test strategies preliminary report
Authors: J. Rowland, Y. Zuyuan
Venue: Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification (1989)

This paper reports on some experiments which compare three system test strategies which were applied to artificial software systems. The artificial systems were seeded with known defects and then tested according to the three strategies which involved random system level input, random system level input with defect removal, and modified module coverage. The results suggests that of the three strategies considered here, the modified module coverage exposes a higher number of defects, especially for large systems.
Computation of the cohomology of B¿On for 23 ¿ n ¿ 26 using REDUCE
Authors: Tze Beng Ng
Venue: Journal of Symbolic Computation (1989)

In this paper we present the result of a computation of H{su*(BSO"4; @?"2) for 23 @? n @? 26, which allows us to write down the polynomial structure of H{su*(BSO"4; @?"2), 23 @? n @? 26, explicitly. We use Grobner basis method in the computation. It seems that the method can be extended to the computation of the E~ term of some Leray-Serre spectral sequence of a fibration when the rood 2 cohomology ring of the base space is a polynomial algebra over @?"2.
Preparing students for programming-in-the-large
Authors: Laurie Honour Werth
Venue: ACM SIGCSE Bulletin (1989)

A variety of applications to improve the use of software tools are described with emphasis placed on using tools as software engineering projects. Tool use incorporates quantitative and qualitative benefits, while better preparing students to meet the increasing demands of programming-in-the-large. Improved university-industry cooperation and resource-sharing are other advantages. Some inexpensive approaches to major problems are suggested together with future directions.
Issues in multimedia interface design: media integration and interface agents
Authors: Brenda Laurel, Tim Oren, Abbe Don
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

A central challenge in the design of multimedia databases is integrating information from different media sources while reducing the cognitive load imposed on users by the tasks of learning and operating the interface. In light of results from a prototype multimedia project developed at Apple, we believe that an agent-style interface addresses this challenge in several ways. This paper discusses techniques for achieving media integration and details the use of interface agents in facilitating 'navigation', enhancing content through point of view, and supporting users in a variety of instrumental and experiential tasks.
The AIDA experiment
Authors: F. Mazzanti
Venue: ACM SIGAda Ada Letters (1989)

Most of currently available debugging tools for Ada do not allow to monitor enough in detail the powerful features of the language. For example, the help usually provided to the user for checking the program dependence from the particular characteristics of the language implementation, rarely goes beyond the detection of the most evident aspects. Similarly, no facilities are usually provided for detecting at run-time the occurrence of an erroneous execution, or for driving the program execution in all its aspects to generate the desired program effects.Possible directions for the improvement of debugging techniques to match the needs of Ada, and, more in general, of highly nondeterministic and concurrent languages, have been investigated as part of the activity of the EEC MAP project 755 "SFD-APSE", leading to the development of a prototype of an Advanced Interpreter/Debugger for Ada (AIDA). In this paper the experience gained with the project is briefly summarized, illustrating some of the useful features for a powerful and detailed monitoring of the execution of Ada programs.
Development Life Cycle of Computer Networks: The Executable Model Approach
Authors: J. Etkin, J. A. Zinky
Venue: IEEE Transactions on Software Engineering (1989)

An approach is proposed for extending the use of design models to the implementation and operational phases of the network development life cycle. A conceptual approach is offered for using executable models in the day-to-day operation of computer networks. Several strategies are given for integrating models into different development tasks. It is shown why these strategies are feasible. Characteristics of executable models that differ from those of traditional models are identified along with new technologies that reduce the cost of implementing and using executable models.
Magic tooltool interface
Authors: Erik Fretheim, J. W. DeGroat
Venue: ACM SIGDA Newsletter (1989)

The Air Force Institute of Technology, like many other schools, uses the Berkeley Tool Set for chip layout in VLSI design courses. One of the important tools of this set is the layout editor, MAGIC. Designing at the mask level is one of the important aspects of a VLSI design course, as it allows students to get a feel for what kinds of decisions and design trade-offs must be made in creating a circuit. One of the drawbacks of using a layout editor, such as MAGIC, is the amount of time it takes students to learn the interface to the tool, and the resistance to having to memorize a long list of commands or macros. To overcome this drawback, we have created a graphical user interface using Tooltool.
Constraint grammars&ndash;a new model for specifying graphical applications
Authors: B. T. Zanden
Venue: ACM SIGCHI Bulletin (1989)

User Interface Management Systems often attempt to separate the graphical and nongraphical aspects of an application, but rarely succeed. Constraint grammars provide a new model for specifying interfaces that achieves this goal by encapsulating the data structures in a single package, and providing a powerful transformation-based editing model for manipulating them. Constraint grammars incorporate a number of important tools, such as the part-whole hierarchy, almost hierarchical structures, and multidirectional constraints, that permit designers to specify a wide variety of graphical applications, including simulation systems, program visualization systems, and visual programming environments.
Design principles behind Chiron: a UIMS for software environments
Authors: M. Young, R. N. Taylor, D. B. Troup, C. D. Kelly
Venue: Proceedings of the 10th international conference on Software engineering (1988)

User interface facilities are a crucial part of the infrastructure of a software environment. We discuss the particular demands and constraints on a user interface management system (UIMS) for a software environment, and the relation between the architecture of the environment and the UIMS. A model for designing user interface management systems for large, extensible environments is presented. This model synthesizes several recent advances in user interfaces and specializes them to the domain of software environments. The model can be applied to a wide variety of environment contexts. A prototype implementation is described.
COMP: a VHDL composition system
Authors: P. R. Jordan, R. D. Williams
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

An automated system for creating and managing VHDL design units is described in this paper. This system helps the hardware designer to learn the syntax of the VHSIC Hardware Description Language (VHDL) and to produce code which can be used for simulations. This demonstration prototype tool is written in C to run on a Sun workstation, and it produces IEEE standard 1076 VHDL code.
Footprint evaluation for volume rendering
Authors: Lee Westover
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

This paper presents a forward mapping rendering algorithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer calculates an image plane footprint for each data sample and uses the footprint to spread the sample's energy onto the image plane. A result of the technique is that the forward mapping algorithm can support perspective without excessive cost, and support adaptive resampling of the three-dimensional data set during image generation.
A comparative study of think-aloud and critical decision knowledge elicitation methods
Authors: B. W. Crandall
Venue: Issue 108 (April 1989) (1989)

The knowledge elicitation phase of expert system development continues to be identified as a major hurdle in construction of comprehensive, functional expert systems (Berry, 1987; Hoffman, 1987). One of the major difficulties is that expert knowledge is multifaceted. The expert has both explicit, objective knowledge and knowledge that is more implicitly understood. Such tacit knowledge is among the most difficult for experts to articulate on their own. Reliance on standard interview methods or unstructured think-aloud protocols may inadvertently bias the knowledge engineer into focusing on those aspects of the task that can be reasonable well represented within if/then, rule-based systems. The systems that result may lack critical components of expert knowledge. It is therefore essential that knowledge elicitation methods be sensitive to the contributions made by tacit knowledge and perceptual learning (Berry, 1987; Collins, Green, amp; Draper, 1985; Klein, Calderwood, amp; MacGregor, in press).
Modelling and performance evaluation of multiprocessors organization with shared memories
Authors: M. Naderi
Venue: ACM SIGARCH Computer Architecture News (1988)

This paper is primarily concerned with theoretical evaluation of the performance of multi-processors system. A markovian waiting line model have been developed for various different multi-processors configurations, with shared memory.The system is analysed at the request level rather than job level.
YACKOS on a shared-memory multiprocessor
Authors: Raphael Finkel, Debra Hengsen
Venue: ACM SIGARCH Computer Architecture News (1988)

Yackos(yet another communication-kernel operating system)is designed for high speed, low latency inter-process communication. Speed is obtained by avoiding context switches and presenting to processes a low-level interface. Processes avoid context switches when passing messages by sharing data with the kernel. Yackos message passing was first implemented above Unix on Sequent shared-memory multiprocessors where round-trip messages can be passed in under 200 microseconds. It was then ported to both Sun and Vax workstations.
A mesh/token ring hybrid-architecture LAN
Authors: C. Kang, J. Herzog
Venue: Symposium proceedings on Communications architectures and protocols (1988)

This paper presents a hybrid architecture for local area networks (LANs) which combines the advantages of token ring and mesh networks while remaining relatively simple. Each node may have two communication channels. The first is a token ring and is used for short or prioritized message data transmissions. The other consists of an arbitrary collection of data links, which are used for relatively high volume and low priority data messages. With this architecture, a LAN can be installed in the form of token ring and can be upgraded and &ldquo;tuned&rdquo; to its application environment by the insertion of node-to-node data links. Simulation results indicate that even with rather simple network control and routing algorithms, performance is improved over token ring due to data transmission concurrency greater than one.
A hybrid scheme for detecting AND-parallelism in prolog programs
Authors: H. Xia, W. K. ,  Giloi
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

In this paper, we present a hybrid scheme for detecting AND-parallelism in Prolog programs, in which data dependency analysis is conducted partly at runtime and partly at compile time. The philosophy reflected in the hybrid scheme is to do as much as possible at compile time and leave only things that must be dynamically accomplished to runtime. With tolerable runtime overhead, our methodology can achieve sufficient accuracy and can thus remedy the weakness both in dynamic detection and in static data dependency analysis (SDDA). In addition, the hybrid scheme greatly supports the combining exploitation of AND- and OR-parallelism of Prolog.
Programming at the processor-memory-switch level
Authors: M. R. Barbacci, C. B. Weinstock, J. M. Wing
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Users of networks of heterogeneous processors are concerned with allocating specialized resources to tasks of medium to large size. They need to create processes, which are instances of tasks, allocate these processes to processors, and specify the communication patterns between processes. These activities constitute Processor-Memory-Switch (PMS) Level Programming, in contrast with traditional programming activities, which take place at the Instruction Set Processor (ISP) Level. In this paper we describe the use of PMS-level programming in computation-intensive, real-time applications, e.g., vision, robotics, and vehicular control, that require efficient concurrent execution of multiple tasks, e.g., sensor data collection, obstacle recognition, and global path planning, devoted to specific pieces of the application. At CMU we are developing languages and tools for this new style of programming, and in this paper we describe their status.
A verified connection management protocol for the transport layer
Authors: S. L. Murphy, A. U. Shankar
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

We specify and verify a connection management protocol for use between entities connected by channels that can lose, reorder, and duplicate messages. The protocol is symmetric. Each entity is in one of the following states: closed, listen, open, active opening, passive opening, or closing. The first three are stable states to be exited only by user request, while the last three are transient states. Each entity maintains a local incarnation number at all times, and a remote incarnation number only when opening, open, and closing. Our protocol employs the 3-way handshake used in TCP and ISO Transport Protocol (Class 4). We verify the safety property that when an entity is open, its remote incarnation number matches the remote entity's local incarnation number. This ensures that data messages from past connection instances are not delivered to the user. We verify the following progress properties: an actively opening entity will eventually establish a connection, provided that the remote entity is willing to communicate or is itself actively opening; the states of active opening, passive opening, and closing are transient; if the entities remain closed, the channels will eventually become empty, assuming messages have a maximum lifetime. This protocol specification can be immediately combined with the data transfer protocol specifications presented in [SHAN1, SHAN2, SHAN3] to provide a transport layer protocol with the functions of connection management and two-way data transfer. The verifications too can be immediately combined to provide a hierarchical verification of the multi-function protocol. The specifications and verifications can be combined because the connection management and data transfer protocols are images of the multi-function protocol. This illustrates the power of protocol projections in constructing multi-function protocols.
Coefficients of combining concept classes in a collection
Authors: E. A. Fox G. L. Nunn, W. C. Lee
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This report considers combining information to improve retrieval. The vector space model has been extended so different classes of data are associated with distinct concept types and their respective subvectors. Two collections with multiple concept types are described, ISI-1460 and CACM-3204. Experiments indicate that regression methods can help predict relevance, given query-document similarity values for each concept type. After sampling and transformation of data, the coefficient of determination for the best model was .48 (.66) for ISI (CACM). Average precision for the two collections was 11% (31%) better for probabilistic feedback with all types versus with terms only. These findings may be of particular interest to designers of document retrieval or hypertext systems since the role of links is shown to be especially beneficial.
Learning Based on Conceptual Distance
Authors: Y. Kodratoff, G. Tecuci
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

An approach to concept learning from examples and concept learning by observation is presented that is based on a intuitive notion of conceptual distance between examples (concepts) and combines symbolical and numerical methods. The approach is based on the observation that very different examples generalize to an expression that is very far from each of them, while identical examples generalize to themselves. Following this idea the authors propose some domain-independent and intuitively justified estimates for the conceptual distance. A hierarchical conceptual clustering algorithm that groups objects so as to maximize the cohesiveness (a reciprocal of the conceptual distance) of the clusters is presented. It is shown that conceptual clustering can improve learning from complex examples describing objects and the relation between them.
Resolvents and symmetric functions
Authors: A. Valibouze
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

In the present paper a model of transformations of polynomial equations (the so called &ldquo;direct image&rdquo; model) is studied. We express, in this model, some minimal polynomials and some resolvents relative to the Galois group of a polynomial in order to use a general algorithm of resolution. This algorithm can be effectively computed in MACSYMA with the extension SYM that manipulates symmetric polynomials. We give a few examples obtained by specializing the general algorithm for the Galois resolvent.
Analysis and design skills required by end-users in small organizations
Authors: G. Schell
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

End user computing (EUC) in small organizations is different from EUC in large organizations. The difference appears to be associated with the degree of job specialization in the organization, especially as it pertains to skills required to develop information systems. Analysis and design expertise for developing information systems is not a widely needed skill in the traditional functional areas of organizations. Small organizations tend to lack members who can be called upon to furnish this expertise. This article presents preliminary work that attempts to examine how analysis and design needs of small organizations are met. Several small organizations were studied and the persons responsible for developing significant end user applications were interviewed. While the objectives for and justification of end user computing is similar in both large and small organizations, the methodology and organizational support associated with those projects are different.