ppxscal/embedding_network huggingface dataset:
The Computation of Visible-Surface Representations
Authors: Demetri Terzopoulos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A computational theory of visible-surface representations is developed. The visible-surface reconstruction process that computes these quantitative representations unifies formal solutions to the key problems of: (1) integrating multiscale constraints on surface depth and orientation from multiple-visual sources; (2) interpolating dense, piecewise-smooth surfaces from these constraints; (3) detecting surface depth and orientation discontinuities to apply boundary conditions on interpolation; and (4) structuring large-scale, distributed-surface representations to achieve computational efficiency. Visible-surface reconstruction is an inverse problem. A well-posed variational formulation results from the use of a controlled-continuity surface model. Discontinuity detection amounts to the identification of this generic model's distributed parameters from the data. Finite-element shape primitives yield a local discretization of the variational principle. The result is an efficient algorithm for visible-surface reconstruction.
A dynamic framework for object projection views
Authors: Victor Vianu
Venue: ACM Transactions on Database Systems (TODS) (1988)

User views in a relational database obtained through a single projection ("projection views") are considered in a new framework. Specifically, such views, where each tuple in the view represents an object ("object-projection views"), are studied using the dynamic relational model, which captures the evolution of the database through consecutive updates. Attribute sets that yield object-projection views are characterized using the static and dynamic functional dependencies satisfied by the database. Object-projection views are then described using the static and dynamic functional dependencies &ldquo;inherited&rdquo; from the original database. Finally, the impact of dynamic constraints on the view update problem is studied in a limited context. This paper demonstrates that new, useful information about views can be obtained by looking at the evolution of the database as captured by the dynamic relational model.
Approximations for the Halstead software science software error rate and project effort estimators
Authors: Victor Schneider
Venue: ACM SIGPLAN Notices (1988)

Experimental estimators are presented relating the expected number of software errors (B) in a software development project tothe overall reported months of programmer effort for the project (E)the number of subprograms (n)the count of thousands of coded source statements (S)These estimators areB asymp; 7.6 E0.667 S0.333andB asymp; n ((S/n)/.047)1.667These estimators are shown to be consistent with data obtained from the air force Rome air development center, the naval research laboratory, and Fujitsu corporation. It is suggested here that more data is needed to refine these estimators further.
Bindings persistent programming languages
Authors: R. Morrison, M. P. Atkinson, A. L. Brown, A. Dearle
Venue: ACM SIGPLAN Notices (1988)

In designing and building persistent object systems we are attempting to regularise the activities on data that are traditional in programming languages, operating systems, database management systems and file systems. We hypothesise that regularity and simplicity may be achieved by regarding the exercise as one of designing a language powerful enough to allow for all our programming needs and using some principles in the design of the language to achieve this regularity and simplicity.In this paper we investigate the nature of binding mechanisms showing how some form of dynamic binding is necessary for persistence. The binding mechanisms of Ada, which has a traditional file based view of persistence, and of Napier, which has an object based view, are used as illustrations.
File processing and the undergraduate computer science curriculum
Authors: Kirk L. Malmrose, Robert P. Burton
Venue: Proceedings of the eighteenth SIGCSE technical symposium on Computer science education (1987)

In March of 1979, the Curriculum Committee on Computer Science (C3 S) of the Association for Computing Machinery (ACM) proposed recommendations for the undergraduate curriculum in computer science: &ldquo;Curriculum '78.&rdquo; &ldquo;Curriculum '78&rdquo; includes CS 5, &ldquo;Introduction to File Processing,&rdquo; as an undergraduate core requirement. Seven years after &ldquo;Curriculum '78,&rdquo; findings show that more than 70% of universities offering undergraduate degrees in computer science do not require a course similar to CS 5. The controversial role of CS 5 in the undergraduate computer science curriculum id discussed.
Modules and type checking in PL/LL
Authors: Lars-Erik Thorelli
Venue: ACM SIGPLAN Notices (1987)

The type system of a programming language system PL/LL is described. PL is a simple object oriented programming language and LL is a language for composing PL modules into programs. The goals of the PL/LL system are to enable the programming of efficient object-oriented computations and to provide the powerful linking language LL for facilitating the construction of large programs. The goal of the type system is to ensure efficient and secure object handling through a combination of static and dynamic type checking, and to preserve this property across module boundaries. The solution is based on (i) the module and linking concepts of LL, (ii) a language construct in PL for the safe creation of linked data structures, and (iii) a limited form of type polymorphism and type unification.
Conversion of a PDP-11/40 assembler and simulator from mainframe Pascal to Ada on IBM PC microcomputers
Authors: Richard Gayer, Catherine M. Beise, G. Scott Owen
Venue: Proceedings of the eighteenth SIGCSE technical symposium on Computer science education (1987)

The assembly language course at Georgia State University is taught using a PDP-11/40 Assembler and Simulator, written in Pascal, running on a Sperry UNIVAC mainframe. In the past two years most of the computer science program has been switched to IBM PC compatible microcomputers. This, coupled with the fact that the UNIVAC system is about to be retired, motivated us to translate the PDP-11/40 system to the microcomputers. The translation is from the mainframe Pascal version to Ada for the PC's. The use of the assembler and simulator, the rationale for the use of Ada, and the problems encountered in the translation are all discussed.
Faculty computer literacy at the University of Wisconsin-Milwaukee
Authors: Neil A. Trilling
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

The CSD Faculty Loan Program focuses on the computer-phobic, or at least computer-anxious, faculty member, rather than those faculty who have already come to grips with computer technology. We started the program in June, 1985. Objectives: To provide faculty with sufficient computing experience to enable them to evaluate the use of computers in their instructional and research activities. To expose participants to several computing tools that could enhance their personal productivity.
Randomized parallel communications on an extension of the omega network
Authors: D. Mitra, R. A. Cieslak
Venue: Journal of the ACM (JACM) (1987)

Parallel communication algorithms and networks are central to large-scale parallel computing and, also, data communications. This paper identifies adverse source-destination traffic patterns and proposes a scheme for obtaining relief by means of randomized routing of packets on simple extensions of the well-known omega networks. Valiant and Aleliunas have demonstrated randomized algorithms, for a certain context which we call nonrenewal, that complete the communication task in time O(log N) with overwhelming probability, where N is the number of sources and destinations. Our scheme has advantages because it uses switches of fixed degree, requires no scheduling, and, for the nonrenewal context, is as good in proven performance. The main advantage of our scheme comes when we consider the renewal context in which packets are generated at the sources continually and asynchronously. Our algorithm extends naturally from the nonrenewal context. In the analysis in the renewal context we, first, explicitly identify the maximum traffic intensities in the internal links of the extended omega networks over all source-destination traffic specifications that satisfy loose bounds. Second, the benefits of randomization on the stability of the network are identified. Third, exact results, for certain restricted models for sources and transmission, and approximate analytic results, for quite general models, are derived for the mean delays. These results show that, in the stable regime, the maximum mean time from source to destination is asymptotically proportional to log N. Numerical results are presented.
From semi-syntactic lexical analyzer to a new compiler model
Authors: Y H Shyu
Venue: ACM SIGPLAN Notices (1986)

This paper introduces the "semi-syntactic lexical analyzer", a new concept of lexical analyzer which is capable of recognizing program fragments. The significant results of such an analyzer are that some syntactic analysis can be omitted, better intermediate or object codes can be generated and a new compiler model is thus derived. The main difference among currently used models and our new model is that currently used models separate input symbol stream into tokens, while our new model separates them into "meaningful units" (simple expressions or even part of an expression) if possible. We found that separating them into meaningful units is much easier for further analysis, translation and optimization.
Examples of Maple applied to problems from the American Mathematical Monthly
Authors: Gaston H. Gonnet
Venue: ACM SIGSAM Bulletin (1988)

The following pages show the output of the Maple system applied to some selected problems from the Problem Section of the American Mathematical Monthly. The purpose of assembling these examples is to show some of the facilities and commands of the Maple system. These examples were run on our Vax 11/785 computer, under the Unix operating system. This is a rather random sample, and does not represent a systematic search of problems in the AMM.
MULTILISP: a language for concurrent symbolic computation
Authors: Robert H. Halstead,  Jr.
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing parallelism. The potential complexity of dealing with side effects in a parallel context is mitigated by the nature of the parallelism constructs and by support for abstract data types: a recommended Multilisp programming style is presented which, if followed, should lead to highly parallel, easily understandable programs. Multilisp is being implemented on the 32-processor Concert multiprocessor; however, it is ultimately intended for use on larger multiprocessors. The current implementation, called Concert Multilisp, is complete enough to run the Multilisp compiler itself and has been run on Concert prototypes including up to eight processors. Concert Multilisp uses novel techniques for task scheduling and garbage collection. The task scheduler helps control excessive resource utilization by means of an unfair scheduling policy; the garbage collector uses a multiprocessor algorithm based on the incremental garbage collector of Baker.
Optimized mesh-connected networks for SIMD and MIMD architectures
Authors: R. Beivide, E. Herrada, J. L. Balcazar, J. Labarta
Venue: Proceedings of the 14th annual international symposium on Computer architecture (1987)

A class of mesh networks with wrap-around links is obtained from a class of circulant graphs by means of a graph isomorphism. We demonstrate how to obtain, from the adjacency pattern of the graph, simple parameters that serve to construct a planar design of the network. Several performance parameters are evaluated: in particular, we show that diameter and average distance are simultaneously minimized. This implies a minimization of the network communication delays. Due to its easy implementation and good behavior characteristics, the proposed interconnection scheme is appropriate in several architectural environments. Specifically, this topology is suitable as an interconnection subsystem for message passing MIMD architectures, as well as for SIMD machines with a static interconnection scheme. In the particular case of SIMD machines, a comparison is made with the ILLIAC IV-type networks. As a consequence, we propose still another topology, when the number of processing elements is an even power of 2; for this solution, we show that a reduction in the network distances is achieved, without losing speed in performing arbitrary permutations.
Tools and methods for computational lexicology
Authors: Roy J. Byrd, Nicoletta Calzolari, Martin S. Chodorow, Judith L. Klavans, Mary S. Neff, Omneya A. Rizk
Venue: Computational Linguistics (1987)

This paper presents a set of tools and methods for acquiring, manipulating, and analyzing machine-readable dictionaries. We give several detailed examples of the use of these tools and methods for particular analyses. A novel aspect of our work is that it allows the combined processing of multiple machine-readable dictionaries. Our examples describe analyses of data from Webster's Seventh Collegiate Dictionary, the Longman Dictionary of Contemporary English, the Collins bilingual dictionaries, the Collins Thesaurus, and the Zingarelli Italian dictionary. We describe existing facilities and results they have produced as well as planned enhancements to those facilities, particularly in the area of managing associations involving the senses of polysemous words. We show how these enhancements expand the ways in which we can exploit machine-readable dictionaries in the construction of large lexicons for natural language processing systems.
A Monte Carlo comparison of the binary and interpolation search algorithms
Authors: Clark B. Archer
Venue: Proceedings of the eighteenth SIGCSE technical symposium on Computer science education (1987)

This paper provides performance comparisons of the traditional binary search and the interpolation search for nearly uniformly distributed ordered arrays of keys. The algorithms for the search routines are given along with performance statistics.
Comparison of Some Data Models for Engineering Objects
Authors: Martin Hardwick, David L. Spooner
Venue: IEEE Computer Graphics and Applications (1987)

Many proposals using object-oriented data models for engineering objects have appeared in the literature. These data models try to represent the data in engineering systems more naturally by organizing it logically and/or physically into objects relevant to the engineering applications using the database. In this article we review and examine several of these proposed data models to identif important properties of the models. We show that none of the data models excels in all areas, but each has desirable properties.
Provably monotone approximations, ROMANNUMERAL 3
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1988)

Familiar forms which may be theoretically monotone may not be evaluated monotonically even with monotone arithmetic.
An APL/370 compiler and some performance comparisons with APL interpreter and FORTRAN
Authors: Wai-Mee Ching
Venue: ACM SIGAPL APL Quote Quad (1986)

The experimental APL/370 E-compiler compiles a subset of APL which is large enough for most scientific and engineering uses, directly into 370 assembly code. The compiler does not require variable declarations. The front-end employs extensive type-shape analysis based on global dataflow analysis. The back-end takes the parse trees, graphs and tables produced by the front-end and generates 370-code which runs independently of the interpreter. The compiled-code executes at 2-10 times the speed of the interpreter on several one-line functions, and this ratio increases significantly with iterative programs. The code quality is comparable to that produced by an optimizing FORTRAN compiler on FORTRAN programs corresponding to our test cases. This removes the performance penalty of APL in computation intensive applications.
Modulo 3 Residue Checker: New Results on Performance and Cost
Authors: James W. Watterson, Jill J. Hallenbeck
Venue: IEEE Transactions on Computers (1988)

The performance and cost of a modulo-3 residue code checker that has been attached to a pipelined serial multiplier to provide a concurrent self-test capability are considered. Analytical results are derived for error detection coverage and minimum error latency; these quantities are observed to be in agreement with simulation results obtained by using ISPS, a register-transfer language. The residue checker error detection coverage and minimum error latency are observed to be dependent on the statistical properties of the multiplier input operands. The checker and serial multiplier were implemented in 4- mu m NMOS, using a standard cell design. The residue code checker required approximately half of the total silicon area.
Production of large computer programs
Authors: H. D. Benington
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

The paper is adapted from a presentation at a symposium on advanced programming methods for digital computers sponsored by the Navy Mathematical Computing Advisory Panel and the Office of Naval Research in June 1956. The author describes the techniques used to produce the programs for the Semi-Automatic Ground Environment (SAGE) system.
From design to redesign
Authors: G. Fischer, A. C. Lemke, C. Rathke
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

Software Engineering environments have to support design methodologies whose main activity is not the generation of new independent programs, but the maintenance, integration, modification and explanation of existing ones. Especially for software systems in ill-structured problem domains where detailed specifications are not available (like Artificial Intelligence and Human-Computer Communication), incremental, evolutionary redesign has to be efficiently supported.To achieve this goal we have designed and constructed an object-oriented, knowledge-based user interface construction kit and a large number of associated tools and intelligent support systems to be able to exploit this kit effectively. Answers to the &ldquo;user interface design question&rdquo; are given by providing appropriate building blocks that suggest the way user interfaces should be built. The object-oriented system architecture provides great flexibility, enhances the reusability of many building blocks, and supports redesign. Because existing objects can be used either directly or with minor modifications, the designer can base a new user interface on standard and well-tested components.
LES: a layout expert system
Authors: Y.-L. S. Lin, D. D. Gajski
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In this paper we describe an expert system for layout generation in a hierarchical VLSI design system. It applies a combination of rule- and algorithmic-based techniques on a new layout style. Experimental results have demonstrated the superiority of this expert system against various standard-cell systems and its competitiveness with human designers.
A deterministic prediction model for the American game of football
Authors: John A. Trono
Venue: ACM SIGSIM Simulation Digest (1988)

This article describes a simulation model of the sport known as football. It was created to predict results of post season football games, most notably college bowl games. By constructing a totally deterministic model of the game, one in which there are no random events, and by using data that is directly accessible to represent the participants, an objective prediction can be reached. The remainder of this paper is divided as follows: Section 2 discusses more about the model's internal workings; Section 3 describes the all-important play selection strategy; Section 4 presents the results collected for verifying the model's accuracy; and finally Section 5 presents some observations and shortcomings of the model along with possible directions for further investigation.
The IBM VHDL design system
Authors: L. F. Saunders
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper presents the IBM VHDL Design System. This set of Computer Aided Engineering (CAE) design tools, built around the VHSIC Hardware Description Language (VHDL) and developed for IBM internal use, along with other design automation tools, is used by IBM design engineers to develop computer hardware. The function and operation of each piece of the system is described. IBM usage and some of the problems encountered are also discussed.
Knowledge-based tools to promote shared goals and terminology between interface designers
Authors: Robert Neches
Venue: ACM Transactions on Information Systems (TOIS) (1988)

Two tools that support cooperation are described: one for the construction of consistent and principled human-computer interfaces and the other for the construction of AI knowledge bases. These tools provide a central repository for design knowledge that otherwise would not be easily shared among users. The AI knowledge representation technology upon which the tools are founded is first described. A knowledge-based approach to interface construction is discussed, and how that approach applies to detecting design conflicts and inconsistencies stemming from two different kinds of team communication failure is illustrated. Next, a knowledge acquisition aid that is utilized within the interface construction paradigm and that also illustrates the same approach to supporting cooperative work is described. Finally, four sources of difficulty in team design efforts, which this approach seeks to address, are reviewed.
A customized control store design in microprogrammed control units
Authors: M. S. Tudruj
Venue: ACM SIGMICRO Newsletter (1985)

The paper reports on the control store cost minimization using an approach related to the bit reduction method. A methodology is presented for finding the microinstruction format which provides a minimum joint cost of the control store and microinstruction decoder circuitry for a given set of microprograms. The optimization criterion measures the area taken by the control store and decoders in a large scale integrated circuit. The methodology is based on the concepts of codable microoperation classes and microoperation class distributivity introduced in the paper. The codable classes are those that provide the length reduction of the microinstruction field used for binary encoding microoperation combinations, compared to the single bit/microoperation encoding method. Microoperation class properties and basic types of fields assignments in microinstruction word formats for codable class approach are also discussed.