ppxscal/embedding_network huggingface dataset:
The FORTRAN Language
Authors: Bernard A. Galler
Venue: ACM SIGPLAN Notices (1978)

The FORTRAN language was intended to be a vehicle for expressing scientific and mathematical computation, while allowing efficient object code to be produced. Since there was an emphasis on scientific computation in FORTRAN and FORTRAN II, little provision was made for heterogeneous data structures. Only arrays of up to three dimensions were possible, and they had to be declared explicitly: DIMENSION ALPHA (10,15), BETA (12) Input and output statements allowed a little more flexibility, in that provision was made for controlling the format of information read from or written to the outside world (as opposed to reading or writing binary information on disk or tape): WRITE (5,200) MTH, BETA, Y 200FORMAT (6H MONTH, 13, 8H; QUOTAS, 12F4.0, 10H; FORECAST, F 6.2 )
Simulation optimization using response surfaces based on spline approximations
Authors: Andrew F. Daughety, Mark A. Turnquist
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper presents an approach designed to increase the efficiency and utility of search for optima of simulation models. Specifically, spline functions (odd-order polynomials fitted between simulation run outputs that match curvature at the end points) are used to approximate the simulation along suitably chosen directions of search. The splines are used to generate &ldquo;pseudo-experiments&rdquo; which enrich the data base formed from actual simulation runs. An overall (grand) function is then fit to this data base, yielding new direction(s) of search for the next iteration. Several characteristics of this technique are examined, including its sensitivity to experimental budget, number of iterations allowed, and size of feasible region. This approach results in not only an estimate of the optimal response from the simulation, but also a response surface estimated over a larger domain useful both for sensitivity analysis and in some cases as an approximate representation of the simulation for use in other modeling efforts. The paper describes an application of the technique to a model of a railroad classification yard. The objective is to find the numbers and sizes of inbound and outbound trains, and the dispatching policy within the yard, which minimize total car delay.
Query using inferential processing implemented with inverted hashed files
Authors: M. H. McKinney
Venue: Proceedings of the 1977 annual conference (1977)

A methodology is presented for a prototype query processor that can infer the semantics of a query and thus allow a very natural-language-like request from a user. The inference is accomplished by fully inverting all attribute values, attribute names, and system keywords. All atoms of a query are treated in the same manner until the semantics are either positively inferred by the system or explicitly declared by the user. The implementation approach uses a common hash area containing: the attribute names, the inverted attribute values, the key words allowed by the query processor, and any synonyms that have been declared by the user. The methodology includes provision for performing updates, adds, and deletions as well as query. Advantages of the approach are the simplicity of the query language for the user and the elegance of the semantic interpretation by the system.
Learning effectiveness: The impact of response time (abstract only)
Authors: Sherry Weinberg
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Response time is one of the key components of the human interface in an interactive computer system. This study evaluated two different response times and their impact on learning effectiveness. Using a counterbalanced experimental design (2**2 combinations of 2 response times), this study measured completion times, lesson mastery, error rates, and attitude. Data were obtained from student questionnaires.The Control Data PLATO Computer-based Education system provided the environment for the study. The system was connected to two networks with different response time characteristics. The means of the two response times tested were .25 sec (response time A) and 1.3 seconds (response time B). The covariate analysis of variance and chi square tests were used to show the significant difference between the two response times (p lt; .05), giving the following results:1. The subjects using the shorter response time finished the lessons significantly faster than the subjects using the longer response time.2. The number of subjects that mastered the lessons was significantly higher for the subjects using the shorter response time.3. The performance of subjects using the shorter response time for time dependent tasks was significantly better than the subjects using the longer response time. However, for time independent tasks, the subjects using the longer response time performed significantly better.4. The subjects using the faster response time showed significantly more favorable attitudes toward the response time experienced than the subjects using the slower response time.In conclusion, the shorter response time (A) was more efficient for learning and was more favored by students.
The martyrdom of user services
Authors: John Simon
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper proposes to demonstrate how consideration of the mind state that spawned the organism, its evolution thus far, and the nature and extent of the forces that impinge upon it might lead one to prognosticate a violent mutation in the User Services phenomenon at this juncture.
Edge-labeled directed graphs in APL
Authors: Lyle G. Hartman
Venue: Proceedings of seventh international conference on APL (1975)

An APL-based system for describing and manipulating sets of edge-labeled directed graphs is described. An associative naming system allows the user to label structures and elements of those structures with names of his own choosing. Provision is made for mathematically attaching to both edges and vertices information which can later be given semantic interpretation by user supplied algorithms. The approach allows application to a wide variety of areas of investigation where an experimental testbed for exploring new techniques is important. Examples of such areas include study of the relation between choice of representation and algorithmic efficiency for graph processing, directed graph representation of programs with edge labels representing control transfers, scene analysis techniques in artificial intelligence, and transition-diagram networks (C0N63).
Application development without programmers (Panel Discussion)
Venue: Proceedings of the ACM '82 conference (1982)

Information systems development backlogs have a habit of growing larger by the year. What is more, the observable, recorded backlog often hides an even larger, invisible backlog of applications which users would request if only those they had already requested were in sight. In the face of such a backlog, any way of improving development productivity must be seriously considered. In this session, we examine the extent to which gains in productivity may be obtained by the use of software development tools designed with the user in mind.
Abstract machines and software design
Authors: J. C. King
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

A recent trend in operating system design [1,2,6,7] is to consider the design as a hierarchy of abstract machines. The problem is viewed as constructing a &ldquo;users' machine&rdquo; from a given hardware machine by means of software. Rather than do this in one large step, a progression of abstract machines are defined starting at the hardware machine and ending with the users' machine. Each new machine is &ldquo;built from&rdquo; the earlier machines, adding to their capabilities. This approach appears to be a strong positive step toward bringing more discipline to the software development process. Liskov [6, 7] carefully documents the advantages. She also tries to establish formal rules to guide the process and relates this approach to structured programming [3, 8].
Multiprocessors and computer networks
Authors: Marvin Solomon
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

In this brief note, I would like to review the histories of computer networking and multiprocessor architecture and suggest ways in which these two streams of research are flowing back together and enriching each other. One can view both fields of research as departures from an original von Neumann computer organization consisting of a central processing unit (CPU) acting on data in a main memory and interacting with the outside world through peripheral devices.
A comparison of lifecycle models
Authors: Pentti Kerola, Peter Freeman
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Preliminary comparison of world views in systems development is given. The purpose of the paper is to present the Finnish PSC systemeering model to the software engineering (SE) community and to compare it with the ideas of D. Ross and practical approaches in SE.
Uses of CONFER at Wayne State University (abstract only)
Authors: Alan McCord
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

CONFER is used by a variety of organizations which have no direct contact with any MTS site (the CONFER host computer system). In many cases, the main contact of the CONFER user is with the third party vendor or consultant who is supporting the networking effort. Several problems arise when the third party relationship is not broadened to include the institutional consulting and documentation efforts. Such problems include:1. Overload on the time of the third-party consultant.2. Production of custom documentation which parallels the institutional documentation.3. User perceptions that they are not "ready" for institutional documentation.4. Development of abbreviated cognitive maps of the system and its user network.5. Users exchange superstitious views of how the system works.While it is not yet clear that the absorption of third-party, mediated networks will solve such problems, it is an obvious first step to a solution. MTS Help Facility A version of CONFER is tentatively planned for use as the principal Help Facility at WSU. A subset of CONFER capabilities will be employed to decrease demands on the system. Features of the Help Facility will include agenda string searches, execution of computer assisted instruction lessons from within tbe CONFERence, a "suggestion box" facility, and user modelling features intended to decrease user frustration and maximize efficiency. Existing help files will be called from the Help Facility to increase the redundancy of available help to the user. The agenda used will be multi-dimensional, allowing the user to search for help within subject areas, type of information and skill level. For example, the user would be able to view all items which serve as tutorials on statistical packages with the CONFER command: AGENDA TUTORIALS+STATISTICS. Similarly, the user will be able to search item descriptors or text for character strings, such as using WHICH "SPSS" to locate all items dealing with SPSS. Requests for help will be sent directly to various CSC departments, and responded to either via CONFER or telephone. User suggestions and requests will be screened on a continuing basis by CSC staff, and changes to the information contained in each item will be made as a result of these suggestions. Materials developed by users will be solicited for inclusion in the Help Facility.
Automatic machine grading programs
Authors: George E. Forsythe
Venue: Proceedings of the 1964 19th ACM national conference (1964)

In connection with introductory programming and numerical analysis courses at Stanford University, grading programs have been used intermittently since 1961. The original idea came from the TEACH routine devised at Carnegie Tech. by A. J. Perlis and others. Our programs furnish data, check student answers in various ways, keep track of running time, and keep a -and-ldquo;grade book-and-rdquo; for the problems. They do not check the quality of the programming in any other way. In contrast to the TEACH routine, the Stanford routines, called GRADER1, GRADER2, etc., are written separately for each problem. The most flexible and useful system was used with the Burroughs 220 computer in the BALGOL language, a dialect of ALGOL 58, and will now be described. Each grader program was written as a BALGOL-language procedure. It was then compiled together with a procedure called BUTTERFLY, written by Roger Moore of Stanford. The result was a relocatable machine-language procedure, with a mechanism for equating its variables to variables of any BALGOL program, in just the form of the BALGOL compiler's own machine-language library procedures (SIN, WRITE, READ, etc.). Finally, the grader program was added to the compiler library tape for the duration of its use.
Attributes of computer professionals
Authors: Bruce H. Barnes, Malcolm H. Gotterer
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

In order to ascertain some of the attributes of computer professionals and to determine their attitude towards their undergraduate education, two questionnaires were sent to the graduates of the Bachelor of Science program in Computer Science at the Pennsylvania State University. The questionnaire consisted of two parts. Part I dealt with professional information such as employment, job satisfaction, society membership, etc. Part 2 delved into the graduates' attitudes concerning the baccalaureate program in computer science at Penn State. It was concerned primarily with courses and curriculum. We report on the attributes of these graduates.
Performance evaluation of communicating processes
Authors: Ilya Gertner
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

This paper concerns the performance evaluation of an operating system based on communicating processes. Processes communicate via messages and there is no shared data. Execution of a program is abstracted as a sequence of events to denote significant computational steps. A finite state machine model of computation is used for the specifications of abstract computational properties and, thereafter, for the selective analysis of measurement data. A set of conventions is developed to characterize the performance of communicating processes. A hierarchical layering technique is used to concisely describe the characteristics of large systems. A performance monitoring system was implemented and applied to the analysis of RIG, a message-based operating system.
An approach to error-resistant software design
Authors: S. S. Yau, R. C. Cheung, D. C. Cochrane
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper presents a flexible framework, using a System Monitor, to design error-resistant software. The System Monitor contains the code and data for error detection, error containment and recovery at the module level, program level, and system level. It contains five types of components: the Internal Process Supervisor, the External Process Supervisor, the Interaction Supervisor, the System Monitor Kernel, and the Maintenance Program. The functions of each component is discussed, followed by a discussion of the strategies to handle errors in the module, program, and system levels.
A multiprocessing system for the direct execution of LISP
Authors: Rhon Williams
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

Current implementations were found to be impractical for airborne use due to LISP's incompatability with conventional computer architectures. Direct execution of LISP with tasks distributed between three processors, seemed to be a workable solution. The language was analyzed, and a special token was devised, using a descriptor with a single pointer. Through careful distribution of responsibilities, control and data flow between the processors was minimized. Significant memory savings resulted from ASCII storage and real time garbage collection. A simulation was used to help estimate execution times and showed a factor of 50 to 100 increase in speed. Thus, through the direct execution of LISP by a multiprocessing system, Computer-Aided Decision-Making could be implimented to enhance the safety of flight operations.
Organizing a college microcomputer show
Authors: James W. Cerny
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Going to a microcomputer fair or show is fun, exhilarating, and exhausting. Organizing a microcomputer fair or show is also fun, exhilarating, and exhausting! Despite the work that goes into a show, it is worthwhile if things go well. Many arrangements for a microcomputer show are similar to the arrangements for any kind of show, fair, or exhibit. But there are some differences as well. For example, the organizers of a college microcomputer show may be less practiced in anticipating all the decisions that must be made. This is the report of one experience at organizing a microcomputer show and a descriptive checklist of things to consider.
Text file inversion: An evaluation
Authors: R. M. Bird, J. B. Newsbaum, J. L. Trefftzs
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

This paper compares inversion of text files with inversion of more structured records. The unique characteristics of textual data which restrict the utility of inversion are identified and discussed. Inversion is shown to be useful only for small, static data bases, and when full text search is not required.
What lies beyond the branch arrow?
Authors: Garth H. Foster
Venue: Proceedings of seventh international conference on APL (1975)

The question posed in the title could be interpreted as being rhetorical so that its answer would provide a stage to suggest how control flow in user-defined APL functions could be improved. The last thing that APL needs is design by a large committee; there is ample evidence [1] that design by a relatively small group acting by Quaker consensus produces good results. The results have been so pleasing that we may have become myopic in our almost evangelical enthusiasm. Perhaps the time is ripe to take a more critical view of APL in the spirit of constructive criticism. To avoid discussing the issues on the grounds that the Friends are still meeting may not be timely. The area of control flow in a program is one which: (1) continues to receive a great deal of attention in the literature; (2) has provided some sharp criticism of APL from computing professionals; and (3) has produced some variation in the APL community. Summarizing these three directions shall be our objective in the balance of this paper.
An algorithm to support code-skeleton generation for concurrent systems
Authors: Maria Heloisa Penedo, Daniel M Berry, Gerald Estrin
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Computers are increasingly being used in engineering systems which could utilize a multiplicity of processors. Computer aided design methods are needed to support the design of inherently complex concurrent software. UCLA's SARA (System ARchitects Apprentice) is a design environment which provides computer aid to both hardware and software design of concurrent systems. This paper focusses on an improved capability to aid software design. This capability is provided by defining a Module Interface Description (MID), which allows designers to deal with the structure of code, and effecting a mapping between SARA models and MID-models. It then becomes clear how to create a tool to accept these descriptions and perform various checks on the consistency and completeness of the modeling and implementation descriptions. The addition of this capability reduces the gap between the modeling and realization of systems by providing for automatic generation of code skeletons.
An approach to automatic asymptotic expansions
Authors: Richard J. Fateman
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

An example of a multiple-scale perturbation expansion using the MACSYMA algebraic manipulation system is derived. The problem solved is a differential equation for a linear damped oscillator, whose closed form solution can be easily compared to the generated approximation. The advantages of the automatic approach include, especially in more difficult cases, the rapid computation of higher order terms by computer, complete accuracy in algebra, and automatic and accurate conversion of the formulas to graphical or numerical form. Among the unusual features used is MACSYMA's ability to solve in closed form, elementary ordinary differential equations.
Formes: An object and time oriented system for music composition and synthesis
Authors: Pierre Cointe, Xavier Rodet
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

It is well known [Winograd79] that the development and use of complex systems was stifled by the inadequacy of ordinary programming languages. Music Composition and Synthesis (MCS) by computer offers an appropriate example of this &ldquo;complexity barrier&rdquo;. Object-Oriented programming matches a lot of MCS requirements: an object-oriented programming environment, called Formes, has been developed at IRCAM, including original features like precise control of Time and Hierarchy of events. In this paper the structure and implementation of the system Formes are presented. Particular attention is given to a functional approach of message passing and an extension of the class concept to real-time control structure. Two musical examples and a meta-circular definition of Formes are developed.
A high-level data manipulation language for hierarchical data structures
Authors: Barron C. Housel, Nan C. Shu
Venue: ACM SIGMOD Record (1976)

In this paper we assert that the hierarchical view of data will continue to be popular for a broad class of applications and users. In particular, some of these applications require complex data manipulation which, heretofore, has been dealt with procedurally. In this light, a nonprocedural language, CONVERT, is proposed as a high-level DBMS interface. CONVERT is meant to provide users with a tool for performing complex data manipulation and query of hierarchical data abstractions, called &ldquo;Forms&rdquo;. Included in the paper are a description of the Form data abstraction and the CONVERT language, as well as a complete illustrative sample application.
The computer capacity curve - a prerequisite for computer performance evaluation and improvement
Authors: D. E. Brotherton
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

Measurements of themselves have tended to concentrate on specific computer configuration components (e.g., CPU load, channel load, disk data set contention, problem program optimization, operating system optimization, etc.) rather than at the total computer configuration level. As a consequence, since these components can have a high degree of interaction, the requirement currently exists for a workable configuration performance concept which will reflect the configuration performance change that is the resultant of single or multiple component change. It is the author's opinion that such a concept will provide management and measurement specialists a planning and analysis tool that can be well Used in evaluating the costs. It is to this configuration performance concept that this paper is addressed, and the concept by my choosing is named &ldquo;The Computer Capacity Curve.&rdquo;