ppxscal/embedding_network huggingface dataset:
NUDES 2: A numeric utility displaying ellipsoid solids, version 2
Authors: Don Herbison-Evans
Venue: ACM SIGGRAPH Computer Graphics (1978)

A system is described for producing 16 mm animated films of moving humanoid figurines and other figures composed of concatenated articulated interpenetrating ellipsoids. For such figures, the hidden line algorithm used consists in solving the quartic equations which result from simultaneous pairs of ellipses viz. (a) the projection of the outline of one being drawn, and (b) that of one potentially obscuring it. This is done in terms of Cohen's parameter, resulting in an ordered list of compacted hidden arcs of each outline. The visible outlines are then generated to the required fidelity separately. Where two ellipsoids interpenetrate, the outline of each is drawn up to the points where it disappears into the other. These points can be found by the simultaneous solution of the ellipse equations of (a) the projection of the outline being drawn, and (b) the projection of the ellipse of intersection of the obscuring ellipsoid with the plane of the outline of the drawn ellipsoid. The viewing window is assumed to be an ellipse also. Parts of objects projecting outside this ellipse are not drawn. The number of quartics to be solved is reduced significantly by testing each pair of ellipsoids for non-intersection of projected outlines by comparing the projected separation of centres with the sum of their maximum semiaxis lengths, and taking advantage of the total obscuration of one ellipsoid by another when discovered.
Performance evaluation of file organizations through modelling
Authors: Dennis G. Severance, Alan G. Merten
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper contains an identification and description of the fundamental components of all file organizations. A restricted but important class of problems is defined and a generalized file organization for these problems is constructed. A specific design problem is defined in terms of a logical data set, a physical environment, and a projected level of file organization activity. For a given design problem, a simulation model is used to generate a spectrum of alternative file organizations by varying the parameters of the generalized model. These alternative organizations are evaluated in terms of retrieval speed, storage space, and maintenance overhead, and good file organization for the problem is selected on the basis of these measures. The results obtained from several simulation runs for a variety of design problems are discussed.
An investigation of curve fitting methods using an APL graphics terminal
Authors: Anne Kellerman
Venue: Proceedings of the sixth international conference on APL (1974)

Several curve fitting methods are discussed, compared, and finally implemented in APL. Primary stress in this paper is given to newer fitting methods: Splines, B-Splines, and Bezier polynomials. The APL functions described are suitable for use with a graphics terminal or with the standard plot on a 2741 like terminal.
Extraction of Type Style Based Meta-Information from Imaged Documents
Authors: U. Garain, B. B. Chaudhuri
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Extraction of some meta-information from printed documents without OCR approach is considered. It can be statistically verified that important terms in articles are printed in italic, bold and all capital style. Detection of these type styles helps in automatic extraction of the lines containing titles, authors' names, subtitles, references as well as sentences having important terms occurring in the text. It also helps in improving the OCR performance for reading the italicized text. Some experimental results on the performance of the approach on good quality as well as degraded document images are presented.
An operational system for computer resource sharing
Authors: B. P. Cosell, P. R. Johnson, J. H. Malman, R. E. Schantz, J. Sussman, R. H. Thomas, D. C. Walden
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

Users and administrators of a small computer often desire more service than it can provide. In a network environment additional services can be provided to the small computer, and in turn to the users of the small computer, by one or more other computers. An operational system for providing such &ldquo;resource sharing&rdquo; is described; some &ldquo;fundamental principles&rdquo; are abstracted from the experience gained in constructing the system; and some generalizations are suggested.
Exception handling in APL
Authors: Dennis R. Adler
Venue: Proceedings of the international conference on APL (1982)

This paper examines APL exception handling facilities as they relate to applications programming. A brief background on exception handling is first presented. Next, the qualities most desirable in an exception handler are discussed. These criteria are then used to examine and compare two different implementations of an exception handling facility, those of STSC, Inc. and I. P. Sharp Associates (IPSA). Finally, a set of APL-coded handlers is compared to the system-level implementations on the same basis.
Computer Aided Software Engineering (CASE)
Authors: F. W. Day
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a system methodology, Computer Aided Software Engineering (CASE) as applied to a Bell Laboratories Computer Aided Design System (BELLCAD). This methodology can effectively assist personnel during the analysis, engineering, design, implementation and management phases of the development of large and complex Computer Aided Design Systems.
Model for interactive design and analysis of communication systems
Authors: Richard W. Moss, Robert W. Rice, Peter K. Leong
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

The basic concepts developed for the implementation of an interactive communication simulation program are described. The problems considered include the means of generating mathematical models, the accuracy of those models, the means of exercising the configured models, and the speed of the exercising process.
BARONET:: a simplified CRT-based information storage and retrieval system
Authors: John W. Young,  Jr.
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper describes BARONET, an experimental program for page-oriented storage and retrieval of information at multiple remote display (CRT) terminals. Two major objectives determined the structure of the system: a. It was to be easily usable by personnel with essentially no preliminary training. b. It was to be implemented with a minimum of programming effort. Both of these objectives have been realized. A user can begin retrieving information from the system with less than a minute's experience and full mastery of all its features generally requires less than an hour's training. Approximately 18 man-months of programming was devoted to BARONET and related routines. BARONET was developed as part of a series of time-sharing experiments, in particular to explore applications of keyboard-display devices. It has been used extensively for demonstrations, where its capability for rapid set-up and linking of pages has been most useful.
STAND ALONE graphics; now more than ever
Authors: C. D. Barry
Venue: Proceedings of the 1975 annual conference (1975)

The role seen for computer graphics in studying proteins and in aiding their structure determination through interpretation of electron density maps resulting from x-ray (and now neutron) diffraction has changed little since the design of the first molecular graphics system by Leventhal?. The obvious definition of a STAND ALONE SYSTEM has likewise remained unchanged; computers, however, have not. The last 10 years have seen a dramatic change in both the cost and the performance of small machines. We believe these changes strongly favor the development of stand alone systems now and in the future. Examination of the problem at hand shows a spectrum of computer tasks with a range of acceptable response times. The tasks require different degrees of machine performance with certain, but not all, tasks requiring high performance equipment. This is perhaps the major dillemma encountered in designing these systems.
Formal specification and development of an ada compiler - a vdm case study
Authors: Geert B. Clemmensen, Ole N. Oest
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The Vienna Development Method (VDM) has been employed by Dansk Datamatik Center (DDC) on a large-scale, industrial Ada compiler development project. VDM is a formal specification and development method in that it insists on the initial specifications and all design steps being expressed in a formal (mathematically based) notation. This paper gives an overview of how VDM was used in the various steps of the DDC Ada project, and we guide the reader through the steps involved from the initial formal specification of Ada down to the actually coded multipass compiler. Finally we report on the quantitative and qualitative experiences we have gained, both as regards the technical suitability of VDM for the project and as regards the implications on software management and quality assurance.
A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems
Authors: Rafael O. Fontao
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

In computer systems in which resources are allocated dynamically, algorithms must be executed whenever resources are assigned to determine if the allocation of these resources could possibly result in a deadlock, a situation in which two or more processes remain in an idle or blocked state indefinitely. In previous research, execution of the process requesting resources is suspended while an algorithm is executed to determine that the assignment could not cause a deadlock. In this paper, an algorithm is used to calculate all possible safe requests before they are made. This algorithm is executed concurrently with other processes between requests for resource allocations. If the determination of all safe requests has been completed and a process makes a request, the calculations required by the resource allocation are trivial.
Introduction to an LSI test system
Authors: M. Correia, F. B. Petrini
Venue: Proceedings of the 14th Design Automation Conference (1977)

Within the IBM Corporation, the use of LSI technology has brought a need for new methods of generating logic tests. This paper outlines the major problems in testing LSI networks, and the principal considerations that have led to an integrated technical solution.
Editing by example
Authors: Robert Nix
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

An editing by example system is an automatic program synthesis facility embedded in a text editor that can be used to solve repetitive text editing problems. The user provides the editor with a few examples of a text transformation. The system analyzes the examples and generalizes them into a program that can perform the transformation to the rest of the user's text. This paper presents the design, analysis, and implementation of a practical editing by example system. In particular, we study the problem of synthesizing a text processing program that generalizes the transformation implicitly described by a small number of input/output examples. We define a class of text processing programs called gap programs, characterize their computational power, study the problems associated with synthesizing them from examples, and derive an efficient heuristic that provably synthesizes a gap program from examples of its input/output behavior. We evaluate how well the gap program synthesis heuristic performs on the text encountered in practice. This evaluation inspires the development of several modifications to the gap program synthesis heuristic that act both to improve the quality of the hypotheses proposed by the system and to reduce the number of examples required to converge to a target program. The result is a gap program synthesis heuristic that can usually synthesize a target gap program from two or three input examples and a single output example. The editing by example system derived from this analysis has been embedded in a production text editor. The system is presented as a group of editor commands that use the standard interfaces of the editor to collect examples, show synthesized programs, and run them. By developing an editing by example system that solves a useful class of text processing problems, we demonstrate that program synthesis is feasible in the domain of text editing.
Game strategy and collusion in an oligopolistic market
Authors: Joel Shechter
Venue: Proceedings of the 1969 24th national conference (1969)

This paper provides a possible solution to the following problem: Can basic game strategy be applied in an oligopolistic market, where two individuals or firms, in collusion, divide a market area in which they have historically been competing? The competitors are brought together by the desire to eliminate ruinous price competition and by the need to determine a price leader as an integral part of the process of market division. A possible solution to this problem is presented through the vehicle of an original computer program called SELECT, which is based on the game of NIM, with modifications and extensions by the writer. The paper includes a discussion of the background of the problem, a description of how the game is played, and representations of actual computer input and output during the course of a game.
A financial simulation of a proposed computer leasing company
Authors: A. M. Economos
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper describes a simulation to analyze and forecast the financial posture of a computer leasing company as a subsidiary to a large corporation. The intent of this paper is to describe and evaluate a method of analyzing the risk of entering a certain business line, not to arrive at or recommend a particular decision. The paper describes a simulation of the financial position of a hypothetical, and proposed, computer leasing subsidiary, considered as a spinoff from a large parent corporation having a heavy demand for computers.
Designing HMO, an integrated hardware microcode optimizer
Authors: James O. Bondi, Paul D. Stigall
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper discusses an algorithm for optimizing the density and parallelism of microcoded routines in microprogrammable machines. Besides the algorithm itself, the algorithm's uses, design integration problems, architectural requirements, and adaptability to conventional machine characteristics are also discussed and analyzed. Even though the paper proposes a hardware implementation of the algorithm, the algorithm is viewed as an integral part of the entire microcode generation and usage process, from initial high-level input into a software microcode compiler down to machine-level execution of the resultant microcode on the host machine. It is believed that, by removing much of the traditionally time-consuming and machine-dependent microcode optimization from the software portion of this process, the algorithm can improve the overall process.
An electronic analogue machine for computing equations of degrees through the roots of algebraic the eighth
Authors: L. Lofgren
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

A computer for obtaining the roots of polynomials was described. This roots are displayed on a cathode-ray tube screen, and high accuracy is maintained by having a pilot root which can be moved into co-incidence with each root in turn.
Numerical analysis I: Partitioned Polynomials&mdash;an approach toward equilibrium between accuracy and speed in primary mathematical functions
Authors: D. J. Kiel, D. E. Johnson, R. E. Smith
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

STORAGE, SPEED AND ACCURACY have been concepts of concern to computer scientists for many years. Although all three are limited by hardware characteristics, an unrelenting concentration has gone into minimizing the programming requirements of these concepts. This problem, in turn, is very interesting, since economization within one area often propagates opposite tendencies in another. For example, it is a simple task for a programmer to increase the speed of a mathematical program and at the same time decrease the accuracies of results. If one is unwilling to sacrifice one concept in favor of another, the problem becomes one of attempting to approach an efficient balance between opposing concepts. An example, and the subject of this digested version of our paper, is the problem of how to program basic mathematical functions so as to contain both optima speed and accuracy characteristics.
Polygon comparison using a graph representation
Authors: Kevin Weiler
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

All of the information necessary to perform the polygon set operations (union, intersection, and difference) and therefore polygon clipping can be generated by a single application of a process called polygon comparison. This process accepts two or more input polygons and generates one or more polygons as output. These output polygons contain unique homogenous areas, each falling within the domain of one or more input polygons. Each output polygon is classified by the list of input polygons in which its area may be found. The union contour of all input is also generated, completing all of the information necessary to perform the polygon set operations. This paper introduces a polygon comparison algorithm which features reduced complexity due to its use of a graph data representation. The paper briefly introduces some of the possible approaches to the general problem of polygon comparison including the polygon set and clipping problems. The new algorithm is then introduced and explained in detail. The algorithm is sufficiently general to compare sets of concave polygons with holes. More than two polygons can be compared at one time; all information for future comparisons of subsets of the original input polygon sets is available from the results of the initial application of the process. The algorithm represents polygons using a graph of the boundaries of the polygons. These graphs are imbedded in a two dimensional geometric space. The use of the graph representation simplifies the comparison process considerably by eliminating many special cases from explicit consideration. Polygon operations like the ones described above are useful in a variety of application areas, especially those which deal with problems involving two dimensional or projected two dimensional geometric areas. Examples include VLSI circuit design, cartographic and demographic applications, and polygon clipping for graphic applications such as viewport clipping, hidden surface and line removal, detailing, and shadowing.
Simulating population and employment change for U.S. metropolitan and rural areas
Authors: Peter M. Allaman
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper reports on a computer simulation model of migration and employment change in 315 areas which together constitute the contiguous United States. In the process of constructing this model, an extensive database of 1960 and 1970 social and economic data was assembled at the county level from the Census of Population and Housing and procedures were developed for aggregating these data to more meaningful functional groupings of counties. This provided measures of levels of activities in each area. In addition to such aggregate databases, a facility was developed for working with large files of individual records from the 1/100 Public Use Sample, the one percent sample of Social Security records in the Continuous Work History Sample, and a file of 3.5 million businesses which was compiled by merging two years of data from the Dun and Bradstreet Corporation. These data were generally used to estimate the gross flows of the various actors in the system. A model of population and employment change was constructed which accepted initial stocks of people and employment in each region in 1960 or 1970. Based on characteristics of the areas, estimates of vital processes, migration, and employment change were calculated and equilibrated. The simulation moved forward on an annual basis for up to 15 years. Interactive methods were developed so that outside users&mdash;perhaps unsophisticated in the use of computers&mdash;could access both the model results and the databases using a simple set of commands over a time-sharing network.
Establishment communication systems: LAN's or PABX's&mdash;which is better?
Authors: K. Kümmerle
Venue: Proceedings of the eighth symposium on Data communications (1983)

In the sixties and early seventies, major activities in networking were focused on private and public data networks using either circuit and packet-switching technology or integrating both switching methods into a single network. In this time frame, manufacturers of main frames defined and implemented network architectures, ISO started work on the reference model of the Open-System Interconnect Architecture, and CCITT recommended the X-series of interfaces. Local-area communication networks (LAN's) represent a comparatively new field of activity which can be viewed as an extension to data networks for making high-speed packet-switching services available to the in-house domain. Currently, much research and development work is being pursued in this field, both at universities and in industry. The term local refers to communication on the users' premises, i.e., within a building or among a cluster of buildings. Local data and voice communication are not new. A typical example of a system widely used today for local data communication between hosts and display terminals is a star configuration where the terminals are attached to control units tightly coupled to a processor via I/O channels. The necessary terminal control functions are provided in the control unit and shared among a set of terminals. The most widely used local communication system is the Private Automatic Branch Exchange (PABX). Most PABX's installed today are optimised for real-time voice, and use analog technology.
Hardware/software tradeoffs for increased performance
Authors: John Hennessy, Norman Jouppi, Forest Baskett, Thomas Gross, John Gill
Venue: ACM SIGARCH Computer Architecture News (1982)

Most new computer architectures are concerned with maximizing performance by providing suitable instruction sets for compiled code and providing support for systems functions. We argue that the most effective design methodology must make simultaneous tradeoffs across all three areas: hardware, software support, and systems support. Recent trends lean towards extensive hardware support for both the compiler and operating systems software. However, consideration of all possible design tradeoffs may often lead to less hardware support. Several examples of this approach are presented, including: omission of condition codes, word-addressed machines, and imposing pipeline interlocks in software. The specifics and performance of these approaches are examined with respect to the MIPS processor.