ppxscal/embedding_network huggingface dataset:
Complexity of implementations on the level of algebraic specifications
Authors: Hartmut Ehrig, Bernd Mahr
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

The aim of this paper is to study implementations of abstract data types and their complexity within the framework of algebraic specifications. An implementation of an abstract data type ADTO by an abstract data type ADT1 is defined on a syntactical and on a semantical level where data and operations of ADTO are simulated by those of ADT1. In order to investigate complexity of implemented operations and to compair different implementations we axiomatically introduce complexity measures for the operations in ADTO with respect to a given implementation of ADTO by ADT1. A most natural interesting class of complexity measures which satisfy our axioms is compatible with time complexity of Turing Machines. This is shown by specification and implementation of timebounded Turing Machines within our algebraic framework and the simulation of a general nondeterministic interpreter for algebraic implementations by a nondeterministic Turing Machine. This relationship allows to show the existence of solutions and of upper and lower bounds for the complexity of a broad class of implementation problems in our sense. A corollary shows that there are algebraic specifications for all those recursive functions which are bounded in time by algebraically specifyable functions. Since the complexity measure for ADTO-operations in a given implementation IMPL1 of ADTO by ADT1 in general depends on the complexity of the ADT1-operations it is possible to substitute the complexity of the ADT1-operations which may be obtained from an implementation IMPL2 of ADT1 by ADT2. On the other hand the composite implementation IMPL3 of ADTO by ADT2 can be constructed and it is shown that the composite complexity of IMPL3 is less or equal to the substituted complexity considered above provided that some natural consistency conditions are satisfied.
The evolution of an integrated data base
Authors: J. C. Foster
Venue: Proceedings of the 12th Design Automation Conference (1975)

The concept of an integrated data base has great appeal for design automation system developers (Fig. 1). A single repository for all data on a given design has many advantages, though it can be argued there are severe disadvantages also. It is not the purpose of this paper to discuss the pros and cons of integrated data bases, but to look at the process through which the concept becomes a reality in a DA system. This process is described as an evolution through various stages of integration and system structure.
A quantitative analysis of view degeneracy and its use for active focal length control
Authors: D. Wilkes, S. J. Dickinson, J. K. Tsotsos
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We quantify the observation by Kender and Freudenstein (1987) that degenerate views occupy a significant fraction of the viewing sphere surrounding an object. This demonstrates that systems for recognition must explicitly account for the possibility of view degeneracy. We show that view degeneracy cannot be detected from a single camera viewpoint. As a result, systems designed to recognize objects from a single arbitrary viewpoint must be able to function in spite of possible undetected degeneracies, or else operate with imaging parameters that cause acceptably low probabilities of degeneracy. To address this need, we give a prescription for active control of focal length that allows a principled tradeoff between the camera field of view and probability of view degeneracy.
Supporting microcomputers in a multi-vendor environment
Authors: William E. Mihalo
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

BEFORE THE POPULARITY of microcomputers, the computing environment in many universities was usually comprised of a single mainframe computer. Although the development of minicomputers started a drift away from a single vendor environment for computing hardware, the changes that occurred were of the type that many user services personnel could easily handle. The popularity of microcomputers in a university environment has had a strong impact on the type of support which is given to users. Typically, users will insist on deciding what type of microcomputer they want to purchase, and then will make demands on user services staff for software support of their machines. In another situation, users who are accustomed to addressing all questions to the computing center will inquire about what is the best machine and software that can be purchased for a particular application. The purpose of this paper is to describe some of the different models which are used for supporting microcomputers in a university environment. The advantages and disadvantages of each of these models will be discussed. The intention is not to suggest that one model is superior to another. Rather, the intention is to illustrate how different models are used to handle different situations.
Performance evaluation and improvement of a dynamically microprogrammable computer with low-level parallelism
Authors: Shinji Tomita, Kiyoshi Shibayama, Toshiaki Kitamura, Hiroshi Hagiwara
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

A new microprogrammable computer with low-level parallelism was built and has been utilized as a research vehicle for solving different classes of research-oriented applications such as real-time processings on static/dynamic images, pictures and signals, and emulations of both existing and virtual machines including high (intermediate) level language machines. The design goal of a research-oriented computer, QA-1, was to achieve a high degree of processing power and system flexibility by means of a low-level parallel processing organization combined with dynamically microprogrammable control. This paper describes the QA-1's architecture-tailorability to different classes of emulations for existing machines such as the PDP-11/40 and the HITAC-10, and for high-level language machines such as, BASIC and PASCAL machines. All the results obtained from these experiments, together with the ones from well-defined applications such as a real-time color animation presented in another paper, have clarified some drawbacks of the QA-1 in its architectural uniformity, high functionality and microprogram productivity. On the basis of these final evaluations of the QA-1, this paper proposes a new architecture for a next generation computer, QA-2.
Hardware component of an upper level computer science curriculum
Authors: Y. S. Chua, C. N. Winton
Venue: ACM SIGCSE Bulletin (1983)

This report elaborates on the hard-ware requirement recommended in North Florida. Brief course contents, minimal laboratory facilities, key experiments and laboratory management are described.
Scanline rendering of parametric surfaces
Authors: Dino Schweitzer, Elizabeth S. Cobb
Venue: ACM SIGGRAPH Computer Graphics (1982)

A scanline algorithm is described which renders bicubic patches directly from the parametric description without producing a polygonal approximation. The algorithm is partially based on earlier work by Whitted. A primitive object, called a &ldquo;curved-edge polygon&rdquo;, is defined, and an algorithm for breaking down a bicubic patch into the primitive objects is described. A general surface intersection method is employed to provide a robust silhouette edge detector. Shades are computed by calculating a cubic approximation to the normal surface and performing either a cubic or a linear interpolation of the bounding edge normals across the scanline. Subdivision of parametric surfaces is used to reduce the complexity of the surfaces being rendered, providing dramatic improvement in the results of both the silhouette detector and the shading methods.
Design considerations of a micro-based APL
Authors: J. C. Wilson, T. A. Wilkinson
Venue: Proceedings of the international conference on APL (1982)

This paper discusses some of the decisions involved in the creation of Waterloo microAPL. It describes the goals of the project and some of the concerns with respect to a sucessful implementation. An explanation of the portable software philosophy is included along with some details of the versions of Waterloo microAPL presently in existence.
Education and training: Computers in Engineering Education 1960-1964
Authors: D. L. Katz, B. Carnahan, E. I. Organick, S. D. Navarro
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

ENGINEERING EDUCATORS have accepted computing techniquesas valid subject matter in undergraduate engineering curricula. Acceptance has come about dramatically in the past two years as evidenced by the results of a questionnaire recently sent to deans of accredited engineering colleges. Of one-hundred-thirty schools reporting in the survey, eighty-eight noted that computer training is required in some or all curricula, and forty-one schools, accounting for over 50,000 students, require computer training in all curricula. This poll was conducted by the Project on the Use of Computers in Engineering Education at The University of Michigan. Since 1960 this project has provided training for some 225 professors from 80 engineering schools in the United States and Canada, and through broad-scale dissemination of useful literature, problems, and text, has indirectly sped many decisions to integrate computers into engineering curricula.
An operating systems programming laboratory course
Authors: Tsunetoshi Hayashi
Venue: ACM SIGCSE Bulletin (1983)

Some inherent difficuties are present for good exercise and practice in operating systems programming laboratory course. This paper gives a fairly manageable laboratory course plan for programming operating systems (OSs) and a teaching tool which is used in it. The plan enables a prototype operating system as a whole, including the nucleus and multiprogramming mechanism, to be written in high level language. The operating system can run a binary machine program as job program. It is realized through simulation in a common programming environment. Some drawbacks of the plan are discussed and solutions are also given.
A production-system model of human-computer interaction
Authors: John Durrett, Theron Stimmel
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper presents what we believe to be a novel application of production systems to the modeling of complex human-computer interaction. Within the limits of this paper we will briefly describe a production system and discuss its use to model human-computer interaction. We will also mention some existing research supporting its plausibility as a modeling technique. We describe a relatively complex task requiring human-computer interaction that provided experimental data to test the applicability of production systems to this problem area. The completion of this task by individuals was modeled using a set of psychologically plausible productions. The results of this process indicated that a production system may be a powerful empirical and theoretical technique for studying the human factors associated with computer systems.
The complexity of approximate counting
Authors: Larry Stockmeyer
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

There are several computational problems that can be formulated as problems of counting the number of objects having a certain property. Valiant [22] has introduced the class #P which includes a variety of counting problems such as counting the number of perfect matchings in a graph, computing the permanent of a matrix [22], finding the size of a backtrack search tree [14], and computing the probability that a network remains connected when links can fail with a certain probability [23]. We define and study a class of restricted, but very natural, probabilistic sampling methods motivated by the particular counting problems mentioned above. Instead of &ldquo;singleton sampling&rdquo; the algorithm is allowed to sample a large set S ample; U in one step; the information returned from the sample is whether S contains any element having the property being counted. We attempt to classify the complexity of computing approximate solutions to problems in #P. The classification is done in terms of the polynomial-time hierarchy (for short, P-hierarchy) [21]. We give a relativization result that complements a recent result of Sipser and Gaacute;c [19] that BPP is contained in the second level of the P-hierarchy.
&ldquo;An application of simulation models to corporate planning processes&rdquo;
Authors: Ronald A. Seaberg
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A family of timeshared computer models written in APL have been developed in an effort to link the functional areas for communication, planning and control purposes. The models incorporate the concepts and tools of simulation, forecasting, long-range planning and probabilistic budgeting. Developed in a short time span and at low cost, they are widely used at XEROX in both corporate and region offices in both the U.S. and Canada. Under development is a system of statistical and econometric models. The paper discusses the approaches used to design, implement and involve the functional managers in building and utilizing the models.
Microinstruction sequencing and structured microprogramming
Authors: Louise H. Jones
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The purpose of this paper is to explore the relation between the sequencing functions of microprogrammable computers and the implementation of the control constructs of flowchartable logic with modular microcode. So far, there has been little or no discussion of this topic in the literature [8]. Sequencing functions for various microprogrammable processors are described in Section 2; the implementation of the Mills' control constructs using various sets ofsequencing functions is discussed in Section 3; and a discussion of the sequencing requirements for the microcoded implementation of various functions parsing algorithms is given in Section 4.
Careers of University of San Francisco Computer Science Graduates
Authors: James N. Haag
Venue: ACM SIGCSE Bulletin (1978)

One might ask: &ldquo;How have U.S.F. C.S. graduates done in their careers?&rdquo; Quantitatively speaking, the succinct answer, based on Table 1, appears to be &ldquo;Magnifique:&rdquo; At a 1976 annual salary of &dollar;19,100 for a 29-year old professional, they are among the higher-paid of all graduates from university-level baccalaureate programs. Qualitatively speaking, at a 1976 reunion attended by 27% of all C.S. alumni, they talked positively and optimistically about their careers. A similar phenomenon occurred at the most recent 1977 U.S.F. C.S. reunion The Administrative Management Society has surveyed 52,803 data processing position holders in seven job categories and employed by 4,895 U.S. companies in five industries and compiled average salaries, as of February 3, 1976 (I). The average U.S. programmer was then making an annual &dollar;13,572 (&dollar;261/week), a figure exceeded by our graduates after about 2 years of experience. However, the highest salaries, the survey reports, were in the western region of the U.S., with a programmer making an annual &dollar;16,900 (&dollar;325/week). Note, from Table 1, that our C.S. graduates, taken as a group, even though not all are programmers, exceed this figure also after about 4 years of experience.
Requirements for natural language fact retrieval
Authors: Janet L. Kolodner
Venue: Proceedings of the ACM '82 conference (1982)

One ideal information retrieval system that we can imagine is one that would read the newspaper, understanding and storing the contents of the articles. It would have running knowledge about world events, sports, business, the stock market, and popular medical advances and scientific discoveries. It would know which columnist had written a humerous article about children, the economy, or some well-known personality. It would be able to tell you the latest events in the lives of world figures and celebrities. It would advise you on recipes based on the ingredients you tell it you have available. A user would query the system in English, or some other natural language, using the same language and having a dialog similar to one with a human expert on a particular subject.
Machine generation of assignments for a mass education introductory programming course
Authors: Leonard H. Weiner
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

In any classroom, students vary in their background and aptitudes. It has long been recognized [6] that, ideally, each student should receive instruction and assignments geared to his own particular ability to perform: Weaker students should receive additional instruction and less demanding assignments; stronger students should be challenged by more complex or thought-provoking problems. In practice, however, many classes, especially in the introductory courses, have too many students for the instructor to provide such individualized attention. The slower students must struggle, often without much success, to keep up with the others, while some of the brighter ones become bored by it all.
A compiler&mdash;compiler system
Authors: Robert G. Trout
Venue: Proceedings of the 1967 22nd national conference (1967)

To the author's knowledge three other operational compiler-compiler systems, whose strategy is similar to the scheme documented here, have been developed. The Feldman system [6, 7, 8] is a bounded context, syntax directed system. Syntax specifications are expressed in Floyd production language (FPL) and semantics are defined in Feldman semantic language (FSL). FSL seems to be a good model on which to base semantic languages. A lexical analysis (subscan to distinguish identifiers, operators, delimiters and punctuation marks) precedes the full analysis. In the COGENT system [5], on the other hand, each character is interpreted separately, hence allowing greater flexibility (e.g. its use in a symbolic differentiation program) and enforcing more detailed attention to syntax. Syntax for a source program is virtually in Backus Normal Form (BNF) [3] and this system is syntax directed along the lines suggested by Irons [1]. Much has been written on the compiler-compiler system of Brooker and Morris [2, 22, 23] which has superficial similarities with the COGENT scheme and the system described below.
Fundamentals of digital simulation modeling
Authors: J. W. Schmidt
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper and the tutorial session with which it is associated treat the fundamental concepts of digital simulation. The topics discussed include system modeling, simulation models and their advantages and disadvantages relative to mathematical models, the development of simulation and current applications, the role of simulation modeling in systems analysis and simulation languages. The paper and the tutorial are presented at a level which requires no previous exposure to digital simulation. However, familiarity with the fundamentals of probability, probability distributions and inferential statistics will facilitate the participant's understanding of the material presented.
Embedding a relational data sublanguage in a general purpose programming language
Authors: Eric Allman, Michael Stonebraker, Gerald Held
Venue: ACM SIGMOD Record (1976)

This paper describes EQUEL, a programming language which embeds the relational data sublanguage QUEL into the general purpose programming language &ldquo;C&rdquo;. Both QUEL and EQUEL are operational parts of the INGRES relational data base management system at Berkeley. Also briefly described are two operational subsystems written in this combined language. Lastly some of the language oriented shortcomings that have been observed in QUEL and EQUEL are discussed.
Message repository definitional facility: An architectural model for interprocess communication
Authors: Krishna M. Kavi, Edward W. Banios, Bruce D. Shriver
Venue: ACM SIGARCH Computer Architecture News (1984)

An architectural model of a system research tool, the Message Repository Definitional Facility (MRDF), is presented. MRDF provides for interprocess communication and synchronization by message passing, and permits the user a wide selection of policy options, promising general descriptive power. The project's current levels of system definition, design considerations and issues, and plans for future development are briefly described. The current goal for this research is the implementation of the MRDF in the data flow simulation environment for test and evaluation. Potential application of this concept beyond the research tool stage is speculated as incorporation in a computer architecture to support concurrent processes and a &ldquo;self-optimizing&rdquo; operating system.
Data graphs and addressing schemes (Extended Abstract)
Authors: Arnold L. Rosenberg
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

A data graph is obtained from a data structure by masking out the specific data items at the nodes of the structure and concentrating only on the linkages in the structure. Structural uniformities in data graphs can often be exploited to facilitate and systematize the accessing of nodes in the graph and the implementation of the graph in a computer. This paper presents a model for data graphs which can be used to study such uniformities. The main results reported characterize, in terms of structural uniformities, those classes of data graphs which can be implemented by &ldquo;relative addressing&rdquo; and by &ldquo;relocatable relative addressing&rdquo;.
A microcoded tool to sample the software instruction address
Authors: C. Edward Armbruster,  Jr.
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

This paper introduces the concept of software execution localization and defines a microcoded tool for measuring execution localization. The tool is presented as a conceptual description. This tool has been used during development of microcode assists for the System/370 Models 138 and 148, and also the 4341 Processor.
Microcomputer applications
Authors: John McGann
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Surveys of the use of micros that were made a few years ago suggested that use was concentrated in a few business functions. Calcs and financial reporting packages were expanding in use so rapidly that other types of applications seemed to be unnoticed. However, micros were being introduced in many laboratories and production facilities. A recent survey of departments of companies that use micros reported 98 separate applications that could be grouped under the following organizational areas: accounting, planning, treasurer, purchasing, administration, personnel, operations or production, marketing and other Most of the applications were financial in nature although operations or production uses were significant. Financial modeling and calc packages were used not only in financial applications, but they were also used develop a master scheduling job for manufacturing and for administrative and planning applications. Word processing packages were also used to handle many different jobs such as promotion, scheduling, tracking of assignments and automatic editing of information accessed from data bases. Packages are used quite often with micros as generalized development tools. This results in interesting support problems. Applications of micros can also be considered in terms of the data communication involved. Most uses of micros have been on a stand alone basis, but an increasing number of applications involve communication with another micro or a host computer. The micro may be an intelligent terminal controlled by the host or it may be directing the other computing system. The micro may also transfer control back and forth to the other system in an integrated application.