ppxscal/embedding_network huggingface dataset:
Evolving object oriented design, a case study
Authors: M. P. Schuler
Venue: Proceedings of the eighth annual Washington Ada symposium summer SIGAda meeting on Ada: software: foundation for competitveness (1991)

Handling the complexity of hierarchical Object Oriented Design (OOD) decomposition and dealing with the subjective nature of the supporting pictorial representations have historically been two relatively undeveloped aspects of the design methodology. By defining decomposition rules, a requirements allocation scheme, and an organized method of uniquely cataloging objects, the overall complexity of the hierarchical design decomposition process can be reduced. The addition of documentation standards, which are used to formally record and track the assignment of requirements, further reduces the complexity. The documentation standards also require that all relevant information concerning objects and operations, as well as their interactions, be formally recorded. The subjective nature of OOD pictorial representations can be eliminated by incorporating data couples and control arrow and using support documentation to record that information which can not be represented pictorially. The intent of this paper is to illustrate, by case study, method improvements to further evolve OOD. By incorporating these improvements into the OOD process, the portability, reusability and maintainability of the resulting software can be increased.
An extension of manifold boundary representations to the r-sets
Authors: H. Desaulniers, N. F. Stewart
Venue: ACM Transactions on Graphics (TOG) (1992)

In this paper we study the relationship between manifold solids (r-sets whose boundaries are two-dimensional closed manifolds) and r-sets. We begin by showing that an r-set may be viewed as the limit of a certain sequence of manifold solids, where distance is measured using the Hausdorff metric. This permits us to introduce a minimal set of generalized Euler operators, sufficient for the construction and manipulation of r-sets. The completeness result for ordinary Euler operators carries over immediately to the generalized Euler operators on the r-sets and the modification of the usual boundary data structures, corresponding to our extension to nonmanifold r-sets, is straightforward. We in fact describe a modification of a well-known boundary data structure in order to illustrate how the extension can be used in typical solid modeling algorithms, and describe an implementation. The results described above largely eliminate what has been called an inherent mismatch between the modeling spaces defined by manifold solids and by r-sets. We view the r-sets as a more appropriate choice for a modeling space: in particular, the r-sets provide closure with respect to regularized set operations and a complete set of generalized Euler operators for the manipulation of boundary representations, for graphics and other purposes. It remains to formulate and prove a theorem on the soundness of the generalized Euler operators.
Uni-directional hypercubes
Authors: Chih-Hsiang Chou, David H. C. Du
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Uni-directional hypercubes are hypercube interconnection topologies with simplex uni-directional links. While accommodating large number of nodes, uni-directional hypercubes require less complicated communication hardware than conventional bi-directional hypercubes. In addition, they alleviate the pin-limitation problem encountered in fabricating VLSI hypercubes and allow hypercube implementation of the Metropolitan Area Networks using optical fiber links. We propose in this paper two novel schemes of the uni-directional hypercubes. Our research results show that both proposed schemes, while using uni-directional links only, preserve most of the nice characteristics of conventional hypercubes such as short diameter, short average distance and efficient routing. In particular, the diameter of the second scheme with degree n is n+1 (n+2) only when n &ne; 3 (n = 3).
An apprentice that discovers hypertext links
Authors: Mark Bernstein
Venue: Hypertext: concepts, systems and applications (1992)

The fully dynamic planarity testing problem consists of performing an arbitrary sequence of the following three kinds of operations on a planar graph G: (i) insert an edge if the resultant graph remains planar; (ii) delete an edge; and (iii) test whether an edge could be added to the graph without violating planarity. We show how to support each of the above operations in O(n2/3) time, where n is the number of vertices in the graph. The bound for tests and deletions is worst-case, while the bound for insertions is amortized. This is the first algorithm for this problem with sub-linear running time. The same data structure has further applications in maintaining the biconnected and triconnected components of a dynamic planar graph.
Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler
Authors: F. Bonomi, A. Kumar
Venue: IEEE Transactions on Computers (1990)

A model comprising several servers, each equipped with its own queue and with possibly different service speeds, is considered. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive to a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson and all jobs have the same exponentially distributed service requirements, the probabilistic splitting of the generic stream that minimizes the average job response time is such that it balances the server idle times in a weighted least-squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times if the service speeds are all equal. This result is used to develop adaptive quasi-static algorithms for allocating jobs in the generic arrival stream when the load parameters are unknown. The algorithms utilize server idle-time measurements which are sent periodically to the central job scheduler. A model is developed for these measurements, and the result mentioned is used to cast the problem into one of finding a projection of the root of an affine function, when only noisy values of the function can be observed.
Critique of some trends in the TCS community in light of two controversies
Authors: Oded Goldreich
Venue: ACM SIGACT News (1992)

I criticize the growing influence of some "trade-unionism'' attitudes in the Theoretical Computer Science community. I trace these attitudes in the arguments used in two recent controversies which attracted much attention: the controversy on the acceptance rate in STOC/FOCS conferences and the controversy on anonymous submissions (in Crypto conferences). I believe that these attitudes stand in contradiction to the scientific progress and call for their abolishment.
A definition of lines of code for Ada
Authors: Juergen F. H. Winkler
Venue: ACM SIGAda Ada Letters (1990)

The application of the principles and methods of modern software engineering requires the measurement of the essential factors of the software development process. One basic factor is the program size. Up to now no satisfactory definition of program size has been agreed upon. A popular definition of program size is "lines of code " (LOC) but even for this specific measure the situation is the same and there are different definitions of LOC in use. That is, for the same program we may obtain different values for its size.In this paper we report about a new definition of lines of code for Ada. This definition was developed at Siemens as part of an in-house standard, in which LOC is defined for different languages. This standard defines the number of all source lines as the gross size of a program and the number of all those lines which are essential for the correct execution of the program as the net size of a program. Furthermore, the standard distinguishes five sorts of lines which are important for a more detailed analysis of a program: statement, declaration, directive, comment, and separator lines.
An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands
Authors: Allan Hansen, Farhad Arbab
Venue: ACM Transactions on Graphics (TOG) (1992)

In this paper we describe algorithms for generating NC tool paths for machining of arbitrarily shaped 2 l/2 dimensional pockets with arbitrary islands. These pocketing algorithms are based on a new offsetting algorithm presented in this paper. Our offsetting algorithm avoids costly two-dimensional Boolean set operations, relatively expensive distance calculations, and the overhead of extraneous geometry, such as the Voronoi diagrams, used in other pocketing algorithms.
A high-performance, memory-based interconnection system for multicomputer environments
Authors: Creve Maples
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The objective of this paper is to outline the design and operation of a very high-performance, memory-mapped interconnection system, called Merlin. The design can be effectively utilized to interconnect processors in a wide variety on environments, ranging from closely-coupled, dedicated systems to distributed workstations. The system provides a uniform approach to parallel programming which is independent of interconnection topology, processing elements, and languages. By using dynamically mapped reflective memory, the system can support selectively shared virtual memory regions. This approach permits user selected information to be shared at high speeds and with low latency. There is no software involvement in the actual sharing of information and the system overlaps computation and communication automatically, word-by-word, to the extent possible.
A Hybrid Number System Processor with Geometric and Complex Arithmetic Capabilities
Authors: Fang-shi Lai, Ching-Farn Eric Wu
Venue: IEEE Transactions on Computers (1991)

The architecture, design, and performance of a hybrid number system processor are described. The processor performs multiplication, division, square root, and square in the logarithmic number system (LNS) domain. However, the input, output, addition, and subtraction are all executed in the 32-b IEEE standard floating-point number system. With the LNS multiplier and pipelined architecture, the processor is able to perform the geometric and complex arithmetic very effectively. The processor is also shown to compare well to an existing 32-b floating-point DSP (digital signal processor) chip. For the same level of CMOS technology, the performance ratios between the hybrid number system and the floating-point processor are shown to be 6.4:1 and 8:1 for division and square root, respectively; for the complex FFT (fast Fourier transform) algorithm, the ratio is around 2:1.
A remote execution mechanism for distributed homogeneous stable stores
Authors: Alan Dearle, John Rosenberg, Francis Vaughan
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

Persistent languages and systems provide the ability to create and manipulate all data in a uniform manner regardless of how long it persists. Such systems are usually implemented above a stable persistent store which supports relaible long-term storage of persistent data. In this paper we consider the issue of distribution of the persistent store across nodes. A number of existing persistent languages with support for distribution are described in terms of a taxonomy of distributed stores. It is shown that there are considerable difficulties with these systems, particularly in terms of scalability. A new mechanism based on the exportation and remote execution of procedures is then described. A key feature of this mechanism is that an exported procedure may dynamically bind to data in the remote store. It is shown that the mechanism alleviates most of the problems of existing systems and provides considerable flexibility. The paper concludes with some examples of practical use of the proposed mechanism.
The NSFNET and the evolution of a national research and education network
Authors: Doug Gale
Venue: ACM SIGUCCS Newsletter (1991)

Computer networks have become fashionable. The literature is filled with articles about the NSFNET and the emerging National Research and Education Network (NREN). In this article I would like to review the evolution of the NSFNET before speculating on the emerging NREN.
Using Extremal Boundaries for 3-D Object Modeling
Authors: Régis Vaillant, Olivier D. Faugeras
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The extremal boundaries, of 3-D curved objects are the images of special curves drawn on the object and are called rims. They are viewpoint dependent and characterized by the fact that the optical rays of their points are tangential to the surface of the object. The mathematics of the relationship between the extremal boundaries and the surface of the object is studied. This study makes it possible to design an algorithm for detecting those boundaries in the images that are likely to be extremal. Once this has been done, one can reconstruct the rims and compute the differential properties of the surface of the object along them up to the second order. If a qualitative description is sufficient, the sign of the Gaussian curvature of the surface along the rim can be computed in a much simpler way. Experimental results are presented on synthetic and real images. The work provides a better understanding of the relationship between the apparent and real shape of a 3-D object as well as algorithms for reconstructing the local shape of such an object along the rims.
A research program to assess user perceptions of group work support
Authors: John Satzinger, Lorne Olfman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Computer support for group work is a technological innovation receiving considerable attention from developmental researchers. This paper reports the preliminary results from two surveys which assessed user perceived needs for various types of group work support. The instruments, distributed to managers and professionals in a variety of organizations, described group support scenarios and associated functions/tools and asked for an assessment of their usefulness to one of the respondent's organizational work groups. Support for between meetings group work was perceived to be more useful than support for either face to face or electronic meetings. Common single user tools were generally perceived to be more useful than multi-user group tools. Individual differences and implications are addressed.
An incrementally extensible document retrieval system based on linguistic and logical principles
Authors: Michael Hess
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

Most natural language based document retrieval systems use the syntax structures of constituent phrases of documents as index terms. Many of these systems also attempt to reduce the syntactic variability of natural language by some normalisation procedure applied to these syntax structures. However, the retrieval performance of such systems remains fairly disappointing. Some systems therefore use a meaning representation language to index and retrieve documents. In this paper, a system is presented that uses Horn Clause Logic as meaning representation language, employs advanced techniques from natural Language Processing to achieve incremental extensibility, and uses methods from Logic Programming to achieve robustness in the face of insufficient data.
A Default Hierarchy for Pronouncing English
Authors: J. Hochberg, S. M. Mniszewski, T. Calleja, G. J. Papcun
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors study the principles governing the power and efficiency of the default hierarchy, a system of knowledge acquisition and representation. The default hierarchy trains automatically, yet yields a set of rules which can be easily assessed and analyzed. Rules are organized in a hierarchical structure containing general (default) and specific rules. In training the hierarchy, general rules are learned before specific rules. In using the hierarchy, specific rules are accessed first, with default rules used when no specific rules apply. The main results concern the properties of the default hierarchy architecture, as revealed by its application to English pronunciation. Evaluating the hierarchy as a pronouncer of English, the authors find that its rules capture several key features of English spelling. The default hierarchy pronounces English better than the neural network NETtalk, and almost as well as expert-devised systems.
Parallel algorithm research at CERFACS
Authors: Iain S. Duff
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

We first discuss the present status of CERFACS, a European Centre for Research and Advanced Training in Supercomputing situated in Toulouse in South West France. The Parallel Algorithm Team has been a central group in CERFACS since the Centre started in 1987, its main focus being the efficient solution of large sparse systems on vector and parallel architectures. We discuss in detail two such projects, namely the solution by direct methods using a multifrontal scheme and by iterative methods using a block projection method. In particular we stress the portability of our algorithmic paradigms over a range of architectures so that high efficiency can be obtained with a minimum and isolated degree of tuning.
Update on National Science Foundation funding of the &ldquo;Collaboratory&rdquo;
Authors: Laurence C. Rosenberg
Venue: Communications of the ACM (1991)

NSF-funded collaboratories are experimental and empirical research environments in which domain scientist work with computer, communications, behavioral and social scientists to design systems, participate in collaborative science, and conduct experiments to evaluate and improve the systems. These research projects are concerned with distributed and collaborative research that requires intense reliance on wide-area networks and the Internet, to bring together instruments, laboratories and researchers.
Evaluating two aspects of direct manipulation in advanced cockpits
Authors: James A. Ballas, Constance L. Heitmeyer, Manuel A. Pérez-Quiñones
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Increasing use of automation in computer systems, such as advanced cockpits, presents special challenges in the design of user interfaces. The challenge is particularly difficult when automation is intermittent because the interface must support smooth transitions from automated to manual mode. A theory of direct manipulation predicts that this interface style will smooth the transition. Interfaces were designed to test the prediction and to evaluate two aspects of direct manipulation, semantic distance and engagement. Empirical results supported the theoretical prediction and also showed that direct engagement can have some adverse effects on another concurrent manual task. Generalizations of our results to other complex systems are presented.
Data Transfers in Broadcast Networks
Authors: Anindo Bagchi, S. Louis Hakimi
Venue: IEEE Transactions on Computers (1992)

One of the main methods for designing data link protocols in broadcast networks is based on the allocation of transmission rights to nodes in timeslots guaranteeing collision-free access to the channel. Extensions of certain results on vertex coloring are used to establish bounds on the number of timeslots required for a network to finish transmitting a backlog of data. Such networks are also observed when they are structured as rings and trees. Distributed algorithms for the allocation of timeslots in these networks are presented.
An intelligent component database for behavioral synthesis
Authors: Gwo-Dong Chen, Daniel D. Gajski
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper describes an intelligent component database system that delivers components for given set of attributes and constraints. Requirements of a component server are defined and an implementation is described. Our experiments demonstrate that such a component sever can replace component catalogs with hundreds of pages.
A Critical Look at Experimental Evaluations of EBL
Authors: Alberto Segre, Charles Elkan, Alexander Russell
Venue: Machine Learning (1991)

A number of experimental evaluations of explanation-based learning (EBL) have been reported in the literature on machine learning. A close examination of the design of these experiments reveals certain methodological problems that could affect the conclusions drawn from the experiments. This article analyzes some of the more common methodological difficulties, and illustrates them using selected previous studies.
Coordinating planning, perception, and action for mobile robots
Authors: Reid Simmons
Venue: ACM SIGART Bulletin (1991)

To operate effectively with complex tasks in complex environments, agents must intelligently manage their limited physical and computational resources. This can be accomplished by explicitly coordinating the agent's planning, perception, and action. The Task Control Architecture (TCA) provides a vocabulary of coordination constructs that combines both deliberative and reactive aspects. The paper briefly describes the control constructs of TCA, and characterizes their applicability along several important dimensions.
A taxonomy of concepts for evaluating chess strength
Authors: Hans Berliner, Danny Kopec, Ed Northam
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

This paper is an attempt to classify that which is important in chess. Other authors have chosen to make classifications relating to, for example, the material on the board, or whether there exists an attack on the king. We find that this is sufficient for an introductory treatment of the subject of advantages. However, the chess specialist understands that two apparently similar positions may, in fact, be quite different since there may be a very important difference in the features of each. Earlier attempts to develop test suites for evaluating human and computer chess strength [12, 8], although valuable, have had clear drawbacks in terms of their depth, range and number of positions examined. We present a taxonomy of positions in chess that require special knowledge. The taxonomy is what drives our selection of positions, and not vice-versa. It is easy to understand what a passed pawn is, and a bit of classic advice such as &ldquo;Passed pawns must be pushed&rdquo; makes use of the simple metric that a passed pawn becomes more valuable with each advance. However, there are outside passed pawns, protected passed pawns, blockaded passed pawns, and passed pawn masses. Each requires its own understanding, and frequently other features of a position can cause great variation in what may at first appear to be positions that should be treated very similarly.
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
Authors: Ph. L. Toint, D. Tuyttens
Venue: ACM Transactions on Mathematical Software (TOMS) (1992)

The implementation and testing of LSNNO, a new FORTRAN subroutine for solving large-scale nonlinear network optimization problems is described. The implemented algorithm applies the concepts of partial separability and partitioned quasi-Newton updating to high-dimensional nonlinear network optimization problems. Some numerical results on both academic and practical problems are reported.