ppxscal/embedding_network huggingface dataset:
The special role of remote user services for a network-based higher education modeling system
Authors: Alexander M. Jones, Lynn Ann Merrill
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

EFPM, an interactive modeling system developed by EDUCOM, is used by administrators and analysts at more than 120 colleges and universities. The software resides on the IBM 370/168 computer at Cornell University and is accessed via the national commercial networks TYMNET and Telenet. Much of the success of EFPM can be attributed to the effective delivery of a broad spectrum of user services to a diverse and remote constituency. We describe those services, suggest they are primary, rather than secondary aspects of EFPM, and point out the role of networking in the effective delivery of remote user services. The delivery of high-quality substantive user support at a distance is expensive and difficult. For one set of users, it's worth it.
Verifying formal specifications of synchronous processes
Authors: Patricia P. Griffiths, Charles J. Prenner
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

SYNVER is an automatic programming system for the synthesis of solutions to problems of synchronization among concurrent processes from specifications written in a high level assertion language (SAL). The correctness of the solutions constructed by SYNVER follows from the soundness of the synthesizer itself and from a verification phase which is applied to the specifications. This verification phase is the main topic of this paper. To provide context for the verification the paper includes a discussion of synchronization problems and a brief overview of both the SYNVER system and the SAL specification language. A formal definition of the correctness of a SAL specification is then presented along with algorithms which may be used to determine if a given specification is correct.
MACH : a high-hitting pattern checker for VLSI mask data
Authors: A. Tsukizoe, J. Sakemi, T. Kozawa, H. Fukuda
Venue: Proceedings of the 20th Design Automation Conference (1983)

A fast checking algorithm and evaluation of a high-hitting pattern checker (MACH) for VLSI mask data are presented. A two-dimensional-limited searching algorithm has realized O(Nv), where Nv is the number of vectors. The processing speed of MACH is 6,000 vectors per second. MACH can handle VLSI data of more than 10,000,000 vectors that include diagonal vectors. The designer can describe arbitrary design rules using a Design Rule Description Language. We have defined two quality measures for a pattern checker, that is, Detecting Rate and Hitting Rate. MACH has achieved the best detecting rate of 100% and a high hitting rate of more than 80%.
A design tool for the multilevel description and simulation of systems of interconnected modules
Authors: M. Moalla, G. Saucier, J. Sifakis, M. Zachariades
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

We suggest a methodology and a language to permit the study of a system's behavior (functional validation, evaluation of global performances, critical situations). Every system is regarded as an interconnection of communicating modules functioning in a synchronous or asynchronous manner. The control section and the data section of each module are described separately in terms of respectively non-procedural and procedural sub-languages.
Extensible pattern matching in SNOBOL4
Authors: Ralph E. Griswold
Venue: Proceedings of the 1975 annual conference (1975)

Although the string pattern-matching facilities of SNOBOL4 are the most powerful of those of any widely used programming language, they suffer both from complexity and lack of a mechanism for defining new scanning procedures. This paper describes a definitional mechanism that provides extensibility for the existing facilities in which programmer-defined scanning procedures are written as co-routines at the source-language level. The result provides a substantial increase in power as well as the potential for simplifying the existing language. The relationship of this new facility to the present language is discussed, as are implications for more extensive language changes.
A methodology for supporting existing CODASYL databases with new database machines
Authors: Jayanta Banerjee, David K. Hsiao
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

In this paper, an attempt is made to show that conventional database management system software, in particular those of CODASYL type, can be effectively replaced by database machines with good performance. The replacement of CODASYL system software involves two main steps: (i) In order to preserve the notions of CODASYL records, sets,-areas, and others, we need a methodology for database transformation so that an existing CODASYL database may be transformed into suitable formats for storing and retrieving in the database machine. (2) For the purpose of allowing existing application programs written in a CODASYL data sublanguage to store, retrieve and manipulate CODASYL data in the new environment without reprogramming, we need to be able to translate the data sublanguage calls dynamically into the commands of the database machine. Such process is termed query translation. In this paper, a database transformation methodology and a query translation process are presented which ensure that the content-addressability and parallel read-out capability of the database machine are used to advantage. The machine in consideration is known as the database computer (DBC) and is also briefly reviewed. DBC is one of the 'typical' new back-end machines for database management which utilize the emerging hardware and the modification of existing hardware for performance gain and capacity increase.
Industrial software training opportunities for computer professionals
Authors: Nancy Martin
Venue: Proceedings of the ACM '81 conference (1981)

Industrial software training is becoming big business. The magnitude of the problem of producing a sufficient number of well-trained software engineers has led to a proliferation of internal corporate training divisions and programs in software education. Such programs are becoming an added incentive in the hiring and retention of software professionals. Industry is no longer limiting its efforts to developing and teaching specific skill-related courses. Individual corporations are offering a software education the equivalent of a bachelor and/or master's degree, sometimes with university credit. While many of these programs involve cooperation between industry and university, others are obvious attempts to provide education felt lacking in the university setting. Each decade finds new contributions to the computer science education literature on the gap between university education and industrial needs for trained software producers [1, 4, 5, 7, 9, 10]. A capitulation statement on the part of one educator recently appeared in the Open Channel forum of the IEEE Computer: &ldquoUniversities should expose students to modern technologies but leave training in the use of these technologies to industry, which should expect to provide months of training to new employees.&rdquo;[12] Not all corporations can afford such intensive training programs. In view of our collective software personnel needs, the lack of personnel qualified to develop, package and lead training programs, and the economic investment such programs require, a collective effort should be established. Minimally, we need a vehicle for inter-corporate sharing of training products and direct incentives for universities and colleges to educate productive software engineers.
A computer-aided flow diagram teaching system
Authors: Elliot B. Koffman, Frank L. Friedman
Venue: ACM SIGCUE Outlook (1976)

This paper describes a system intended to aid beginning computer science students develop a systematic approach towards problem solution using structured flow diagrams. The student is carefully monitored during the specification of an initial flow diagram and through successive stages of refinement. As each new flow diagram symbol is entered, the system checks to see that the student is being consistent with earlier work and has not introduced potential errors. The flow diagram is an intermediate level representation of an algorithm which is independent of the particular programming language chosen for implementation. When the structured flow diagram has been completely refined, the final translation to a programming language is relatively automatic. To test the program logic, the resultant source code should be executed. The student can modify the flow diagram, generate new code, and re-execute until the program runs correctly.
Using Covariance Analysis as an aid to interpret the results of a performance measurement
Authors: Carlos González
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

This paper reports on a measurement study of the Scheduler in the PDP-10 TENEX Operating System under normal loads in a Computer Science research environment at Case Western Reserve University. A complete description of the methodology and the results of a Covariance Analysis is presented here. The analysis was made in parallel with the analysis of the collected data, therefore a brief description of the experiments as well as some comments of the most interesting results are also discussed in this report. The complete report of the study is in Gonz&aacute;lez [5] which shall serve as a reference document for this paper.
Design and verification of real-time systems
Authors: Jorge V. Phillips, Thomas H. Bredt
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper presents a methodology for the design and verification of a class of real-time systems frequently encountered in applications of digital control. These methodologies are described in the form of a design and informal verification of a system used for navigation control of airborne vehicles. The high reliability standards required for such tasks suggest the use of fault-tolerant hardware and software. A design is presented for both an abstract version of the system running in an ideal environment and for a version running in a non-ideal fault-prone one. A specification language for real-time systems is developed as an extension of the programming language PASCAL, that provides for concise and clear system descriptions while preserving the degree of efficiency and portability needed to qualify as a practical high-level system implementation language. An informal verification of both designs is given.
Visualizing the Potential of Interactive Systems
Authors: Harold Thimbleby
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Interactive systems are complex and often difficult to use. Their complex design therefore presents ideal, and worthwhile, material for visualizing. Some of the generic ways of visualizing interaction, and some of the pitfalls, are illustrated using simple techniques applied to real examples. One problem with interactive devices, particularly in the consumer market, is rapid obsolescence: we show that this can be visualized as a performance over time graph, and that doing so provides further insight into the design process and its problems.
An automated FORTRAN documenter
Authors: Timothy E. Erickson
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

We have written a set of programs designed to help R and D programmers document their FORTRAN programs more effectively. The central program reads FORTRAN source code and asks the programmer questions about things it has not heard of before. It inserts the answers to these questions as comments into the FORTRAN code. The comments, as well as extensive cross-reference information, are also written to an unformatted file. Other programs read this file to produce printed information or to act as an interactive document.
An efficient time-shared link processor for supporting communication in parallel systems with dynamic structure
Authors: H. K. Reghbati
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper presents low-level architectural features for supporting software systems which are organized as collections of concurrent processes in which processes may be created or destroyed and interprocess interaction paths may be established and closed over the course of system's operation. The interprocess interaction aspect of the mentioned systems is discussed in some detail and a suitable architecture is developed for a processor which provides for efficient coordination and communication between processes running on possibly different computers.
A multiprocessor network suitable for single-chip VLSI implementation
Authors: M. R. Samatham, D. K. Pradhan
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper presents a multiprocessor network architecture suitable for VLSI implementation. The proposed class of architectures is based on De Bruijn graphs which are distinct from the well-studied shuffle-exchange graphs. Compared to these latter De Bruijn graphs possess a smaller diameter and a greater fault-tolerance. The proposed architectures are shown to be suitable for efficient execution of parallel algorithms such as the N-point fast Fourier transform (FFT). It is shown that any VLSI layout of the proposed networks requires an area of atleast &Ohgr;(N2/logN), thus, providing a lower bound which is greater than that for shuffle-exchange graphs. Two procedures for laying out these networks on a VLSI chip are presented. The first procedure produces an O(N2/logN)-area layout and has a time complexity of O(N). The second procedure also produces an O(N2/logN)-area layout with good aspect ratio close to unity (for small N).
Designing a low cost general purpose computer
Authors: Willis E. Dobbins
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Since the late war a number of computer projects have been started. Most of them have stressed the construction of large computing centers, staffed by expert programmers and more or less available to the general public as a technical service. There is another approach to the computation problem. This one is to develop small, relatively low-cost computers which, we hope, can be widely used. The direct advantages to this approach are: 1. Low investment in computer and installation. 2. Low operating expense.
SIGBDP 7 developing user-oriented business systems(Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

Have we lost the &ldquo;human touch?&rdquo; Almost as a matter of course we grasp the latest technology and hurriedly search for places in our organizations where we may apply it. As our systems have grown larger and more complex they involve more and more people - to a greater extent then ever before. The recent SHARE SILT report says &ldquo;The percentage of the U.S. labor force that depends on the availability of data processing services to accomplish its daily work will grow from 30% today to 70% by 1985. Ultimately, the mission of the data processing industry is to serve these end users; a substantial fraction of these end users will interact directly with data processing systems, specifying both the data and the functions to be performed on that data. Very major improvements are needed in the quality, reliability, availability, and adaptability of the systems they will use.&rdquo;
Structuring BASIC programs for managing overlays in a small computer system
Authors: Ted Cary
Venue: ACM SIGPLAN Notices (1976)

In a small computer system, it is not unusual to write a BASIC program which is too large to fit into main memory. Such a program must be replaced by a collection of overlay modules together with inter-module sequencing logic. A sophisticated BASIC interpreter allows this sequencing to be done under program control. Unless carefully managed, a decomposition can produce an environment where programs exhibit undesirable characteristics. A structuring and design strategy is presented, discussed, and illustrated by a typical business application. Attention is given to program production, efficiency, reliability, maintainability, and modifiability using this strategy.
Cultivating trees - an essay in APL2
Authors: N. D. Thomson
Venue: Proceedings of the international conference on APL (1984)

General arrays and the each operator allow tree-structures to be modelled in ways which have not hitherto been possible in any programming language. There are many algorithms in mathematics associated with tree-structures, which suggests that a whole new collection of relevant idioms and techniques will evolve. This paper is intended to illustrate ways in which the concepts of APL2 match those which arise in studying trees. After an introductory overview addressed to those who are unfamiliar with the basic notions of general arrays the discussion is developed through a set of 6 problems, which appear between them to raise many of the more important considerations involved.
The allocation of real-time computing within a multiple-user organization
Authors: Jeffrey H. Moore
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The allocation of computer time among competing uses within an organization has received considerable attention in the literature. Most approaches focus upon the use of decentralized mechanisms for effecting resource allocation of computer time within the non-market setting of an organization. Under the simplifying assumption that the only resource to be allocated is computer time, this paper investigates a decentralized mechanism, based upon bidding, for the optimal real-time allocation of computer time within a multiple-user organization. A simulation model is then developed to generate alternative decision rules for the cases in which no known analytical rules exist. A general principle for simulation methodology, called &ldquo;reducto ad credibilis,&rdquo; is proposed for restricting the class of simulations.
GNOME: An introductory programming environment based on a family of structure editors
Authors: David B. Garlan, Philip L. Miller
Venue: ACM SIGPLAN Notices (1984)

Structure editors have frequently been used as powerful and unifying interfaces for programming environments in computer science research settings. Few, however, have found their way into common use. GNOME is an attempt to channel the experience gained in the use of structure editing for software development environment research of the Gandalf Project into a practical novice programming environment. Based on a family of structure editors, it is currently being used to teach programming to undergraduates at Carnegie-Mellon University. This paper describes the GNOME environment, recounts lessons learned in adapting structure editors to novice programmers, and discusses its effectiveness as a teaching environment.
Aggregation of stations in queueing network models of multiprogrammed computers
Authors: Alexander Thomasian, Behzad Nadji
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

In queueing network models the complexity of the model can be reduced by aggregating stations. This amounts to obtaining the throughput of the flow-equivalent station for the subnetwork of stations to be aggregated. When the subnetwork has a separable solution, aggregation can be carried out using the Chandy-Herzog-Woo theorem. The throughput of the subnetwork can be expressed explicitly in terms of its parameters when the stations are balanced (have equal utilizations). This expression for throughput can be used as an approximation when the stations are relatively unbalanced. The basic expression can be modified to increase the accuracy of the approximation. A generating function approach was used to obtain upper bounds on the relative error due to the basic approximation and its modifications. Provided that the relative error bound is tolerable, a set of unbalanced stations can be replaced by a single aggregate station or a set of balanced stations. Finally, we propose a methodology to simplify the queueing network model of a large-scale multiprogrammed computer, which makes use of the previous aggregation results.
An O (N log N) algorithm for Boolean mask operations
Authors: Ulrich Lauther
Venue: Proceedings of the 18th Design Automation Conference (1981)

A new algorithm is presented which calculates Boolean combinations (AND, OR, EXOR, AND NOT) between two layers of an integrated circuit layout. Input and output of the algorithm is an edgebased description of the set of polygons which represent the artwork. The algorithm has O (N log N) time and O (@@@@N) space complexity, i.e. it is faster than previously published methods. Moreover, we believe that it is easier to understand and to implement than the previously leading method in the field.
Problem solving with APL using micro-computers
Authors: A D Crossley, H J Ward
Venue: Proceedings of the international conference on APL (1982)

This paper discusses the criteria used in deciding whether or not an APL based micro-computer solution to a business problem would be a viable alternative to the traditional use of an APL time-sharing service. The micro environment is placed in perspective in considering the limitations of APL micros, special facilities which seek to counteract their deficiencies, the problems of data storage and operational aspects of using micros. Some conclusions are drawn from past experience of implementing quite large systems on a micro-computer.
On imaginary fields, token transfers and floating codes in intelligent secondary memories
Authors: G. J. Lipovski
Venue: ACM SIGARCH Computer Architecture News (1977)

In analyzing two implemented intelligent secondary memories, CASSM and RAP, we recognize a common mechanism which is here called an imaginary field. The mechanism can be generalized to suggest further design possibilities. It further explains the complex and controversial CASSM mechanism, &ldquo;pointer transfer&rdquo; in terms of separate but related principles&mdash;imaginary fields, token transfers, and floating codes&mdash;such that further designs can utilize some or all of the techniques.
Microprocessors: A platform for true program portability with examples from MicroCobol
Authors: A. d'Agapeyeff
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The special advantages and difficulties of microprocessors, as a platform for truly portable software, are considered. A sample implementation of such software is described in the form of the virtual machine, run time and development system of MicroCobol. This language executes invariantly across a dozen real computers.
Time-space-optimal string matching (Preliminary Report)
Authors: Zvi Galil, Joel Seiferas
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we describe a new linear-time string-matching algorithm requiring neither dynamic storage allocation nor other high-level capabilities. The algorithm can be implemented to run in linear time even on a six-head two-way finite automaton. Moreover, the automaton requires only &ldquo;{&equil; @@@@}- branching&rdquo; [1]. (Decisions depend on which of the six scanned pattern or text symbols and positions are the same, but not on the particular symbols or how many symbols there are. Hence the same algorithm works even for an infinite alphabet.) A &ldquo;real-time&rdquo; implementation is possible on such a multihead finite automaton with a few more heads.