ppxscal/embedding_network huggingface dataset:
Characterization of VAX Macsyma
Authors: John K. Foderaro, Richard J. Fateman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

The algebraic manipulation system Macsyma [Grou77, Fate80] has been running for over a year on Digital Equipment Corp. VAX-11 large-address-space medium-scale computers [Stre78]. In order to run Macsyma in this environment, a Lisp system for the VAX, FRANZ LISP[Fode50], was constructed at Berkeley. The goal of running Macsyma provided direction and motivation and is partially responsible for the rapid development of the Lisp system. Because Lisp is a high level language there are many decisions to be made about the internal framework of the system. Efforts to increase efficiency require that we be able to characterize the demands of a large, compiled, Lisp system. Fortunately, the VAX/UNIX operating system provides useful tools for determining such characteristics. This paper presents some of our data and related analysis.
The mechanization of science
Authors: R. Hamming
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Let me briefly talk about the crisis in handling information that we now face, especially in the sciences. The number of persons working in science now greatly exceeds any reasonable predictions made a few decades ago, and will probably similarly increase in the future. The problem of keeping up with what is being published, even in a very narrow field, is a very large and time consuming task, and yet if you ignore the current literature then there is a very great danger that your own research will turn out to be a duplication, or an inferior product, because you have ignored something already published.
Measurements of major locality phases in symbolic reference strings
Authors: A. P. Batson, A. W. Madison
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Previous studies have shown that a program's behavior can be characterized as a sequence of transitions between phases of execution during which some subset of the program's segments is referenced. The nature of the phases (sometimes called localities or regimes), and the characteristics of the transitions between neighboring phases, will determine the performance of the program on a virtual memory system. We here investigate methods for identifying those &ldquo;major&rdquo; phases in programs which correspond to intervals of distinctive referencing behavior. Experimental measurements on symbolic reference strings generated by production Algol-60 programs are used to determine the properties of these phases and the transitions between them. The experimental results are discussed in terms of current models for program behavior and also with regard to their implications for memory management systems.
Distributed Output Encoding for Multi-Class Pattern Recognition
Authors: Roman Erenshteyn, Pavel Laskov, David Saxe, Richard Foulds
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Finger-spelling recognition and hand-shape recognition are two examples of real-world, multi-class recognition problems consisting of 26 and 78 classes respectively. While it is theoretically possible to solve any multi-class problem with a single "smart" classifier, the complexity of such a classifier is usually prohibitively high. This paper looks at several approaches to solving a numerous multi-class recognition problem and discusses in detail a method involving coded output. Experiments are conducted using bio-mechanical data from a human hand as input, but work is continuing concerning the extraction or this data from multi-view hand images alone. Code generation is discussed and results are presented for several different coded output cases including the Hamming, Golay, and several hybrid codes. Conclusions show that the recognition accuracy increases proportionally to code length.
The acquisition of text editing skills
Authors: Sherman W. Tyler, Steven Roth, Timothy Post
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The study of text editing is a significant undertaking for at least two reasons. Our study sought to examine text editing more extensively in two regards. First, we wanted to discover how the basic task develops into a routine cognitive skill, i.e., how does the novice user differ from the expert and how is that expertise eventually acquired. Second, we wanted to determine possible ways of improving the techniques for training people in the use of text editors, based on knowledge of how text editing skills develop.
On conventions for systems of numerical representation
Authors: Peter M. Neely
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Present conventions for numeric representation are considered inadequate to serve the needs of applied computing. Thus an augmented digital number system is proposed for use in programming languages and in digital computers. Special symbols are proposed for numbers too large, too small or too close to zero to be represented in the normal digital number system, or which are undefined. Properties of mappings among and between digital number systems are used to justify the augments chosen. Finally a suggestion is made for a new floating point word format that will serve all the above needs and will greatly extend the exponent range of floating point numbers.
SIGUCC (Tutorial/Panel Session)
Authors: Charles Mosmann, Joseph R. Denk, Leonard Alberts, Tom Kurtz, Roy F. Reeves
Venue: Proceedings of the 1976 annual conference (1976)

Despite restricted budgets, most colleges and universities continue to experience a rise in demand for computing resources for instructional purposes. The cost of such service and its educational importance are becoming matters of critical concern both on and off campus. Although periodic efforts have been made to survey colleges and universities about expenditures and hardware resources, no serious effort to establish a normative standard has taken place since the initial effort of the President's Science Advisory Board in 1967. No effort at all has been made to establish standards of quality independent of cost. An NSF project began with a survey of representative institutions in an effort to determine what kinds of measures are now in use, as a basis for the design of criteria that would be acceptable and meaningful to a large range of institutions. A second effort was to develop procedures and standards in terms of which these measures can be evaluated. Findings of the project will be reported in this session. A lively panel discussion will follow the presentation.
Analyze - Compose - Display computer aided space planning
Authors: Franz S. Veit
Venue: Proceedings of the 8th Design Automation Workshop (1971)

ACD is an approach for space allocation which uses the digital computer for analysis of large quantities of subjective data. It allows direct participation by an increased number of people in the solution generating process, and facilitates the investigation of a greater number of alternate spatial concepts than traditional procedures would normally permit.
Languages which capture complexity classes
Authors: Neil Immerman
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a graph property is in polynomial time if and only if it is expressible in the language of first order graph theory together with a least fixed point operator. As another example, a group theoretic property is in the logspace hierarchy if and only if it is expressible in the language of first order group theory together with a transitive closure operator. In this paper we also introduce a reduction between problems that is new to complexity theory. First order translations, as the name implies, are fixed first order sentences which translate one kind of structure into another. We present problems which are complete for logspace, nondeterministic logspace, polynomial time, etc., via first order translations.
Computers in communications and education at Coast Community College District
Authors: Bernard J. Luskin, Monty W. Ruth
Venue: Proceedings of the ACM annual conference (1973)

Coast Community College District is a publicly-supported community college district located in Orange County, California. It is comprised of two colleges: Orange Coast College and Golden West College. In addition, Coast Community College District owns and operates KOCE-TV, Channel 50, Orange County's only color public service educational television station. Currently employing coordinated instructional systems in courses in a number of disciplines, Coast has been a pioneer in the development of auto-tutorial modes of instruction. Auto-tutorial permeates such diverse areas as biology, typewriting, physical sciences, and English. Coast has kept abreast of the rather dramatic growth of the computer industry during the past 15 years. As a result, students enrolled in computer-related occupational programs are trained on the latest generation of computer systems. This training allows the student to enter the labor market with knowledge, skills and confidence so necessary for success in today's working environment.
Using tools for verification, documentation and testing
Authors: Loen J. Osterweil
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

There has been considerable interest lately in methodologies for the production of high quality computer software. Work in this area has been carried out by researchers in a wide variety of disciplines and covers an impressive spectrum of approaches. Some of the more active current lines of research include: software management techniques [1, 2]; creation of error resistant programming techniques [3, 4, 5]; and design of error resistant programming languages [6, 7]. There has also been considerable activity in the creation of program testing, verification and documentation tools. The work in this area has been directed primarily towards two different but related goals&mdash;the detection and examination of errors present in a program, and the determination that a given program has no errors of some particular type. Among the diverse activities in this area, this paper shall focus on four of the major approaches&mdash;namely dynamic testing, symbolic execution, formal verification and static analysis. In this paper, the different patterns of strengths, weaknesses and applications of these approaches will be shown. It will, moreover, be demonstrated that these patterns are in many ways complementary, offering the hope that they can be coordinated and unified into a single comprehensive program testing and verification system capable of performing a diverse and useful variety of error detection, verification and documentation functions.
On the relationships among three software metrics
Authors: Sallie Henry, Dennis Kafura, Kathy Harris
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

Automatable metrics of software quality appear to have numerous advantages in the design, construction and maintenance of software systems. While numerous such metrics have been defined, and several of them have been validated on actual systems, significant work remains to be done to establish the relationships among these metrics. This paper reports the results of correlation studies made among three complexity metrics which were applied to the same software system. The three complexity metrics used were Halstead's effort, McCabe's cyclomatic complexity and Henry and Kafura's information flow complexity. The common software system was the UNIX operating system. The primary result of this study is that Halstead's and McCabe's metrics are highly correlated while the information flow metric appears to be an independent measure of complexity.
A systems design game
Authors: Norman R. Lyons
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A major problem for a manager who used computer services is the problem of systems acquisition and design. He must decide which system to buy and how the system should be structured. This paper presents a computer game written in PL/I that enables a user to choose from among three basic computer systems with a wide variety of CPU, channel and peripheral equipment options the one that best fits the computing needs of a hyothetical organization. A simulated set of jobs is run on the configuration chosen, and throughput and equipment utilization statistics are reported.
The computing problem in the analysis of non-stochastic time series using an auto-regression model
Authors: Z. Szatrowski
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

Autoregression models have been used in the analysis of stochastic time series or time series which have been assumed to be stochastic after some kind of adjustment. In economics, meteorology, biology, etc., the time series data are non-stochastic and the problem is to estimate, in some way, the periodic, the trend, the cyclical and the random components. In business and economic data the periodic component may be the seasonal pattern or regular weekly fluctuation. Quite frequently, in such series, the pattern of the periodic movement depends on the recent history of the series. Also, these periodic patterns may change over a period of time. Existing methods for the analysis of the above are successive approximation methods. For example, the long term cyclical and trend movements are approximated by moving averages and removed from the series by subtraction. From the adjusted data the periodic movements are estimated by some averaging process and the time series of such estimates may be further examined for changes in the pattern of the periodic movement. Usually no estimates of statistical significance or reliability are made. Even though the inadequacies of the above methods were known, more adequate and more comprehensive models were not used because of the computing difficulties.
On the complexity of deriving imprecise assertions
Authors: Judea Pearl
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The paper studies the amount of computation resources that can be saved by relaxing the requirement that questions regarding the truth of propositions be answered in binary terms and allow answers to be cast in approximate phrasings. We consider a question-answering system which at the filing phase is presented with a long list and of logically independent propositions with their associated truth values, and at a later time (with the list removed) the system is to issue approximate assessments of the truth values of the propositions on the list. Bounds are derived on the expected memory-space and computation-work required to produce probabilistic estimates of a specified quality standard. The main result shows that if the admissible queries are logically independent and equivalued, then the savings resulting from the use of imprecise answers could not be very drastic. If the number of propositions is N, then the memory required to produce answers with any reasonable quality must grow linearly with N. Similarly, the combinational complexity of hardware design to compute the answers must grow like 0(2N/N). Our analysis also demonstrates that very little savings in either memory or computation could be realized by refining the uncertainty scale (i.e., the answers vocabulary) to more than a few discrete values.
A realistic, two-course sequence in large scale software engineering
Authors: Richard E. Bolz, Lawrence G. Jones
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

We discuss a two semester, senior level sequence of courses in large scale software development. The courses are keyed upon the element of realism by having an actual user supply an actual project. In the first course students develop a functional specification of user needs. In the second course students design a system from the specifications and implement at least a portion of the project. We discuss the significant benefits of having a real project and point to some drawbacks. We conclude by discussing possible applicability of our courses to other schools.
The automated desk
Authors: Laura Yedwab, Christopher F. Herot, Ronni L. Rosenberg, Carol Gross
Venue: ACM SIGSMALL Newsletter (1981)

The Automated Desk is an online, spatial interface to a time-shared computer utility. It supports a user in organizing, locating, and handling computerized information and tools. Naive computer users benefit from the ability to use the power of an operating system without knowing operating system commands. Experienced programmers benefit from the ability to &ldquo;browse&rdquo; a large number of &ldquo;virtual terminals,&rdquo; each running instances of various software programs. All users benefit from the ability to access computer-resident information while retaining the familiar visual orientation of the office desk. The user sees his &ldquo;desk top&rdquo; through an intelligent display terminal that is connected to a host computer. The desk top is a large flat surface about 100 times the size of an ordinary desk top. On it, the user can place objects in groupings that are meaningful to him. Processes can be associated with these objects to perform any online information handling function. The Automated Desk is a derivative of the Spatial Data Management System (SDMS) implemented by Computer Corporation of America. In the Automated Desk, the essential SDMS concepts of spatial organization and pictorial identification are implemented in simple ways on equipment of modest cost. The objective of the Automated Desk is to put key SDMS-like capabilities into an inexpensive product that runs on widely-available equipment. It is intended for widespread use in practical applications.
Applied variance reduction - some concepts and examples
Authors: G. Dobbins
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Given virtually infinite computational speed and resources - in terms of both people and machines - we would all carefully structure deterministic methods. The absence of such capabilities is what motivates Monte Carlo simulation; it should not, however, cause us to abandon systemic approaches. Unfortunately, in most applications of Monte Carlo simulation, the judicious selection of sampling techniques is ignored, often at great expense. In addressing this point, the &ldquo;benchmark&rdquo; solution to an apparently simple (but delusive) problem provides a method of gauging the merits of some basic sampling tactics. Parallel synchronous techniques substantially reduce the sample size needed to compare alternatives on a relative basis but do little for absolute measures. On the other hand, perfecting the distribution of a short-term sequence of psuedorandom numbers can meaningfully improve the rate of convergence of estimates of the mean. These techniques can also contribute to the efficiency of large simulation models and find utility in (strict) Monte Carlo applications.
A system architecture for compile-time actions in databases
Authors: Tomás Lang, Eduardo B. Fernández, Rita C. Summers
Venue: Proceedings of the 1977 annual conference (1977)

A case is made for the use of compile-time actions to reduce the overhead incurred when comprehensive authorization and integrity features are incorporated in a shared database system. A model of authorization and integrity evaluation is discussed as well as the performance, sensitivity and system security aspects of early binding for database access and control. A problem incurred with this early binding is the sensitivity of the compiled programs to changes in the physical structure of the database or changes in the authorization rules or integrity constraints. Also, more security problems exist because of the need to protect the results of compile-time checking. A system architecture is proposed to decrease sensitivity and to improve security. The degree of improvement and some performance/sensitivity tradeoffs are analyzed.
Progress on an ANSI standard for APL
Venue: ACM SIGAPL APL Quote Quad (1981)

This paper discusses what a programming language standard is and discusses how one is developed. It also reports the progress to date on the planned ANSI standard for APL. Through the process of standardization, many existing differences between APL systems will be resolved, resulting in a benefit to the APL community that will fully justify the effort.
Toward Model Curricula in Software Engineering
Authors: Richard E. Fairley
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

This paper is a progress report from the IEEE Computer Society's Subcommittee on Model Curricula in Software Engineering. Both undergraduate and graduate curricula are discussed, and the current status of the effort is summarized. Some of the problems that remain to be solved are mentioned. The paper describes work in progress and should not be considered a final document.
A path analysis approach to the diagnosis of combinational circuits
Authors: Sarma R. Vishnubhotla, Ying Huang Chuang
Venue: Proceedings of the 8th Design Automation Workshop (1971)

A unified procedure to find test patterns for detection and location of stuck-at-type single faults in the combinational circuits is described. A reduction algorithm to obtain a minimal set of detection patterns and a location algorithm to obtain complete location information obtainable by external observation; are presented. The circuit may consider AND, OR, NOT, NOR, NAND, EXCLUSIVE OR and LOGICAL EQUIVALENCE gates. A basis for the article are the single and multi-dimensional path sensitization (1,2) and the graph theoretical approach for system diagnosis (3). The main parts of this work is the construction of sensitization functions and the path analysis table, and the development of the reduction and location algorithms. The procedure is illustrated in detail by two examples.
On non-linear lower bounds in computational complexity
Authors: Leslie G. Valiant
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The purpose of this paper is to explore the possibility that purely graph-theoretic reasons may account for the superlinear complexity of wide classes of computational problems. The results are therefore of two kinds: reductions to graph theoretic conjectures on the one hand, and graph theoretic results on the other. We show that the graph of any algorithm for any one of a number of arithmetic problems (e.g. polynomial multiplication, discrete Fourier transforms, matrix multiplication) must have properties closely related to concentration networks.
Executive Support For Urban Technology: The case of computing
Authors: William H. Dutton, Kenneth L. Kraemer
Venue: Proceedings of the 1978 annual conference (1978)

This paper describes the high level of support for computer technology among local government chief executives and suggests that this support is explained, in large part, by a generalized &ldquo;faith in technology.&rdquo;
Elementary bounds for presburger arithmetic
Authors: Derek C. Oppen
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

We consider the first-order theory whose language has as nonlogical symbols the constant symbols 0 and 1, the binary relation symbols &equil; and <, the unary function symbol &minus; and the binary function symbol + This theory of integers under addition is commonly called the 'Presburger Arithmetic' and is known to be decidable for truth [Presburger (1929), Hilbert and Bernays (1968)]. We prove here that there exists a decision procedure for this theory, involving quantifier elimination, for which there is a superexponential upper bound on the size of formula produced when all variables have been eliminated.