ppxscal/embedding_network huggingface dataset:
A Software Management System
Authors: Darrell W. Preble
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

This paper discuss's about the Software Management System(SMS). The Software Management System (SMS) was designed, developed, and implemented at GSU User Services to address these challenges facing our computer system and user community. SMS is organized into a group of &ldquo;protocols&rdquo;, as they will be called in this paper. A &ldquo;protocol&rdquo; is a standard formal set of actions to be taken which may include Executive Command Language (ECL) procedures, file editor procedures, compilations, linkages, tape handling, documentation instructions and communications.
Generation and display of geometric fractals in 3-D
Authors: Alan Norton
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

We present some straightforward algorithms for the generation and display in 3-D of fractal shapes. These techniques are very general and particularly adapted to shapes which are much more costly to generate than to display, such as those fractal surfaces defined by iteration of algebraic transformations. In order to deal with the large space and time requirements of calculating these shapes, we introduce a boundary-tracking algorithm particularly adapted for array-processor implementation. The resulting surfaces are then shaded and displayed using z-buffer type algorithms. A new class of displayable geometric objects, with great diversity of form and texture, is introduced by these techniques.
Microprogrammed operations for a three-value logic simulator
Authors: Stephen L. Squires
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper describes an application of microprogramming to improve the performance of the three-value simulation part of a logic design verification system. Emphasis is placed on developing a theory of computing three-value logic functions in such a way that independent identical functions may be computed in parallel. As a result, it is possible to simulate a number of nearly identical machines simultaneously. The following is a summary of the main sections: Section 0 defines the notation. Section 1 defines the problem of computing three-value logic functions. Section 2 gives a solution to the problem in terms of the normal Boolean functions and one auxiliary function. Section 3 gives several algorithms for computing the auxiliary function in terms of various sets of functions which may be interpreted as machine instruction sets. Section 4 extends the results to compute independent identical functions which may be used in the simulation of nearly identical machines. Section 5 gives examples of implementations on various microprogrammed machines. The theoretical results are currently being applied to an existing and heavily used design automation system. This work represents one of a number of studies being carried out to utilize microprogrammed processors as a means of constructing special purpose computing facilities.
Controlled graphs and instructions
Authors: Guy Boulaye
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper is concerned with controlled graphs, a graph-theoretic formalism which was developed from the study of microprogramming. In this formalism, a microinstruction is equivalent to a subgraph of the graph representing the (microprogrammed) computer, and the problem of designing a micro-instruction is simply that of finding an appropriate subgraph. However, this idea can be generalized and applied to other networks which are characterized by flows of discrete elements. The results of one instruction or of a sequence of instructions, a natural notion for a programmer, are developed for controlled graphs in this paper.
A Kernel System for information system development, evolution, and operation
Authors: Harlan D. Mills, Max L. Wilson
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

We believe that the current boundaries and distinctions between operating systems, data base management systems (both &ldquo;host language&rdquo; and &ldquo;self-contained&rdquo;), programming language processors (both interpretive and compiled), programming support systems (library management, testing, and integration services), instructional systems, and certain other generalized data processing services, can and should be eliminated. That is, we believe that all these seemingly separate functions, which are currently separate for historical reasons as much as any other, can and should be addressed by a single integrated (but subsettable) &ldquo;Kernel System&rdquo;. We also believe that with the proper system architecture and implementation techniques (e.g., top-down and structured programming) and with the wholesale elimination of duplicated functions, a Kernel System can be built that would address the sum total of these functions and, at the same time, remain comparable in size and complexity to a typical self-contained data base management system alone. Further, such a structured Kernel System would be much better able to support the development, continued evolution, and operation of both itself and its applications.
Weaknesses of commercial data base management systems in engineering applications
Authors: Thomas W. Sidle
Venue: Proceedings of the 17th Design Automation Conference (1980)

In recent years many engineering organizations have come to the conclusion that a centralized data base, containing all of their design/manufacturing data, is the most cost effective solution to their needs. Increasing numbers of the designers of these central data bases are utilizing commercially available DBMS packages to implement their systems. There are many good reasons for using an &ldquo;off the shelf&rdquo; system, but the results often do not live up to the expectations. This paper attempts to explain why this is so, and to identify features which should be in an Engineering Data Base Management System, but which are not available in commercial DBMS packages at the present time.
System Development Corporation
Authors: Edward A Nelson
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper discusses several comparatively recent contributions by System Development Corporation to the management of computer programming: a planning aid; cost estimation guides; and, a general project reporting and control system. These contributions and the process by which they were developed is considered in the context of traditional management practices, with the intention of establishing the extent to which these practices are, in fact, applicable to the management of computer programming.
Automated war gaming for enhancing fleet readiness
Authors: M. Leonard Birns
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

War Gaming at all levels has received increased attention as a result of DOD's emphasis on decreasing the use of fuel and travel. The Naval Warfare Gaming System is a sophisticated, flexible tool which provides a realistic decision-making environment for naval officers. The system provides multiple levels of models, automated doctrine control, and user-oriented features to support the four standard gaming phases: design, preparation, play, and analysis.
&ldquo;Minimizing PWB NC drilling&rdquo;
Authors: John D. Litke
Venue: Proceedings of the 20th Design Automation Conference (1983)

A computationally efficient method to minimize PWB drilling time has been developed. The algorithm achieves an average 27% path length reduction over the best that humans can do.
An interpretation oriented theorem prover over integers
Authors: James C. King, Robert W. Floyd
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

A special purpose theorem prover for establishing the validity of expressions over integer variables was developed as part of a program verifier. It is built around a powerful system for manipulating and simplifying integer expressions.
The new field of &ldquo;Software Linguistics&rdquo;: An early-bird view
Authors: Linda D. Misek-Falkoff
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

The phrase &ldquo;Software Linguistics&rdquo; is applied here to a text-based perspective on software quality matters. There is much in the new work on Software Metrics generally, and Software Science in particular, that is reminiscent of the activities of Natural Language analysis. Maurice Halstead held that Software Science could shed light on Linguistics; this paper sketches some mutually informing reciprocities between the two fields, and across related areas of textual, literary, discourse, and communications analysis.
Management applications
Authors: Arnold Ockene, Willaim F. Hamilton, Charles C. Daniel, Hamid K. Eldin, D. Jeffrey Blumenthal, H. J. Miller, John Lastavica, Stanley G. Reed, Harold Steinberg, Henry Lande
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This session presents four papers dealing with models for use by upper management. The first evaluation of simulation as a tool for corporate financial planning, and includes a discussion optimization models. This is followed by a description of a general university simulation program for the study of resource allocation and utilization problems. The final two papers are concerned with gas utilities. One deals with the relationships between rate, revenue, and cost of service; the other with the investment problems facing gas pipeline companies.
Loom-constrained designs: An algebraic solution
Authors: Janice R. Lourie
Venue: Proceedings of the 1969 24th national conference (1969)

This paper presents an algebraic solution to the problem: given a diagrammatic representation of a woven design (weave), determine (1) the size and type of loom patterning mechanism necessary to produce it; (2) the initial conditions of this loom, i.e., the way the threads are connected to the patterning mechanism; and (3) the dynamic control information to this mechanism. First, the problem is solved for weaves of one layer (two dimensions). Then the method is extended to two-layer (three dimensional) weaves. It is then generalized to n layers (three dimensions). The method of solution represents the given weave as a binary matrix W and the weaving process as the multiplication of two binary matrices L and H. The product of this multiplication is the design W. The method shows how to compute L and H given W. A technique is developed for reducing multilayer woven structures to a single layer W in order to compute the L and H matrices more easily.
Design of command menus for CAD systems
Authors: Lynne A. Price
Venue: Proceedings of the 19th Design Automation Conference (1982)

Dynamic, hierarchical, command menus are practical when 1) certain entered commands can be used to predict the following commands (in other words, when there exist commands that stimulate a change of menu) and 2) when a small, changing menu is preferable to a large menu that includes the entire command set. A project on possible menu form tested the relevance of the first of these criteria to a friendly graphics environment. The order in which commands were entered during production use of an IC design system was analyzed. Results not only indicate that the criterion is met, but also suggest the form of a possible dynamic menu.
A program stability measure
Authors: Norman Loongsung Soong
Venue: Proceedings of the 1977 annual conference (1977)

This paper contributes to the understanding of program structures in terms of its stability and reliability in a quantitative sense. Distinctions are made between the logical structure of a program and the information structure of a program. The general characteristics of a good program will not be discussed in this paper other than citing relevent references. The term stability is defined as the resistance to the amplification of changes that has been made to a given program. The information structure of a program is based on the sharing of information between the components of the program.
A concept for test and reconfiguration of a fault-tolerant VLSI processor system
Authors: K. E. Grosspietsch, J. Kaiser, E. Nett
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

The following paper is to present a test and reconfiguration strategy for fault-tolerant VLSI processor systems. This is accomplished with respect to the requirements imposed by the VLSI technology. The proposed concept is exemplified by a model composed of four microprogrammable processors each with a local memory. The test strategy of a gradually expanding hardcore is applied where the central hardcore consists of a small test unit of low complexity. This test unit enables each processor to diagnose autonomously its data path structure and its associated local memory. A particular reconfiguration scheme is proposed for these components. It is implemented at microprogram level. As a result, compared with other fault-tolerance techniques, system reliability is considerably improved.
Computer Science Core Curriculum And Mathematics
Authors: Alan C. Tucker
Venue: Proceedings of the 1978 annual conference (1978)

The history of computer science and of new areas of applicable mathematics are intimately related. Much of this common development is due to common developers. In the 1940's John von Neumann developed the concept and first implementation of a stored-program calculating machine. Thus von Neumann was the father of modern computer programming and, in a sense, the founder of computer architectture (2). He also was developer of the theory of games (14), a new mathematical subject that is both highly applicable and involves some of the purest of mathematics On a lower pedagogical level, we find the first simple widely used programming language and associated time-sharing system and the first textbook on finite mathematics also developed from one man, John Kemeny. Between his initial career as a brilliant logician and his current career as a university president, Kemeny championed the cause of finite mathematics in the undergraduate curriculum in the 1950's. He oversaw the future importance of finite math: logic, combinatorics, finite probability models, and linear programming. Shortly after his textbook, Introduction to Finite Mathematics, with L. Snell and G. Thompson appeared, Kemeny became involved in a project to make computers easy for average college students to use. The result was the language BASIC and one of the first successful time-sharing system.
Computer literacy on a University campus.
Authors: Isabel Lida Nirenberg, Kathleen A. Turek
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

At the State University of New York at Albany desktop computers are being loaned to faculty members as part of an overall effort to advance &ldquo;computer literacy&rdquo; on campus. This paper describes this year-long experimental project: its goals, its implementation, and its support by Computing Center personnel. This paper is written by the members of the Computing Center staff who bore primary responsibility for developing and supporting the project.
Continuous anti-aliased rotation and zoom of raster images
Authors: Carl F. R. Weiman
Venue: ACM SIGGRAPH Computer Graphics (1980)

Raster graphics images are difficult to smoothly rotate and zoom because of geometric digitization error. A new algorithm is presented for continuous rotation and zoom, free from the disturbing aliasing artifacts introduced by traditional methods. Applications include smooth animation. No matrix multiplication of pixel coordinates is executed. Instead row and column parallel operations which resemble local digital filters are used. This suggests real time implementation with simple hardware. Anti-aliasing is inherent in the algorithm which operates solely on pixel data, not the underlying geometric structures whose images the pixels may depict. Zoom magnification is achieved without replicating pixels and is easily attained for any rational scale factor including but not restricted to the integer values which most existing commercial raster graphics systems use. The algorithm is based on a digitized code for lines on rasters, generalized to an interpolation scheme capable of executing all linear geometric transformations. Samples of images which have been rotated and zoomed by a software implementation of the algorithm are presented.
An analog/hybrid computer simulation of phase-locked-loops in motor speed control
Authors: M. H. Kuo, G. A. Perdikaris, T. E. Mueller
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

This paper describes the simulation of the precise control of speed in servo systems using the digital phase-locked-loop (PLL) method and analog/hybrid computer techniques. The PLL for motor speed control is essentially a hybrid feedback control system in which a reference square-wave signal is used to command servo velocity and position. The system consists of a phase comparator, a low-pass filter, the motor under control, and a voltage-controlled-oscillator (VCO) in the feedback path. The mathematical model of the motor and the low-pass filter are simulated on the analog computer. The input reference is a frequency-modulated (FM) digital signal. An integrated circuit is used as the phase comparator which compares the perturbed VCO feedback frequency and the input signal. The method introduced here is simple to learn and practical to implement in undergraduate control courses. It introduces the student to the basic concepts of PLL control, without overwhelming him with its complex problems.
Analyzer-generated and human-judged predictors of computer program readability
Authors: Gerrit E. DeYoung, Garry R. Kampen, James M. Topolski
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The readability of a computer program has recently attained a high level of interest deriving in part from its expected close relationship with program maintainability; debugging and modification expenses are understood to account for a large proportion of software costs over the life of the software. A computable measure of readability would therefore be useful to program developers during coding and to those assuming responsibility for maintenance of software developed elsewhere. In a series of Algol 68 programs, analyzer generated (machine-computable) and human-judged program factors were examined. The first two present authors found that program length and reasonable practice concerning identifier length were excellent predictors of judgments of readability. These predictors were chosen from a large set of analyzer-generated predictors including software science measures as defined by Halstead and several others; the analyzer-generated predictors were found to replicably estimate a high proportion (41 percent) of variance in readability in new readability judgments. While an estimate of readability based only on analyzer-generated predictors would be clearly useful, human ratings (such as quality of comments, logicality of control flow, and meaningfulness of identifier names) were examined to determine whether they could add significantly to the quality of estimates of readability. The addition of the rating of well structured control flow to the set of analyzer-generated predictors increased the proportion of replicably estimated variance in new readability judgments from 41 to 72 percent.
Abstract data and functors
Authors: J. M. Foster
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

The use of 'functors' is proposed to generalise the ideas of abstract data and representation, and it is shown that these ideas have further uses in setting up libraries of algorithms. The properties of functors are discussed.
Two-dimensional alternating Turing machines
Authors: Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

This paper introduces a two-dimensional alternating Turing machine (2-ATM) which is an extension of an alternating Turing machine to two-dimensions. This paper also introduces a three-way two-dimensional alternating Turing machine (TR2-ATM) which is an alternating version of a three-way two-dimensional Turing machine. We first investigate a relationship between the accepting powers of space-bounded 2-ATM's (or TR2-ATM's) and ordinary space-bounded two-dimensional Turing machines (or three-way two-dimensional Turing machines). We then introduce a simple, natural complexity measure for 2-ATM's (or TR2-ATM's), called -&-ldquo;leaf-size-&-rdquo;, and provides a spectrum of complexity classes based on leaf-size bounded computations. We finally investigate the recognizability of connected patterns by 2-ATM's (or TR2-ATM's).
Some experiments in man-machine interaction relevant to computer assisted instruction
Authors: Philip G. Barker
Venue: Proceedings of the ACM '81 conference (1981)

Some experiments in man-machine interaction are briefly described in the context of their relevance to multi-media audio-visual instruction. Two important points emerge: the need for the development of appropriate data base management systems and the necessity for a suitable author language capable of providing the instructor with a means of coordinating the use of a wide variety of instructional resources.
Contention problem of a multiprocessor simulator
Authors: Eric K. Lin, Chian-Li Jen
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

With the increase in the scope of simulation, more minicomputers are used by military and industrial real-time simulators. The performance degradation caused by contention among computers is therefore becoming more acute. The problem will be even more serious when a network of distributed microcomputers is to operate the real-time simulators. In an effort to estimate the contention degradation apriori, a recursive relationship linking the effective worth of a multiprocessor structure consisting of k+1 processors to that of k processors has been obtained. The computational results have been favorably compared to the measured values. The relationship has since been used to help select most cost-effective computer systems for real-time simulators.
Detecting straight edges in millimeter-wave images
Authors: S. Lakshmanan, A. K. Jain, Y. Zhong
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper presents two new methods for detecting edges in millimeter-wave radar images. The first method is based on a deformable template model of edge shapes and a random field model of the millimeter-wave imaging process. The second method is similar to the first, except that the imaging model component is replaced by one that is based on the magnitude and direction of the image gradient. Experimental results are shown to illustrate the advantages of using these methods over traditional edge detectors.
Path expressions in pascal
Authors: Roy H. Campbell, Robert B. Kolstad
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper describes the enhancement of Pascal to specify synchronization between concurrent processes by Path Expressions. The extended language is being used to gain experience in the design and construction of practical real time systems and operating systems. An encapsulation mechanism is included to synchronize all accesses to encapsulated data. A network message transfer system is presented as an extended example of the use of Path Expressions.