ppxscal/embedding_network huggingface dataset:
ASAP: A language and philosophy for teaching file processing
Authors: Howard L. Morgan, James C. Kinard
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

Because large file processing applications are the dominant activity on computers today, it has been a surprise that computer science departments, and particularly schools of business, have been so lax in the attention given to the subject. It is still true that most students receive training in languages such as FORTRAN and BASIC, which must certainly color their opinion of the ability and purpose of computers. Surely few of us would expect a person who is going to be employed in commercial computing to be primarily concerned with the programming of calculations. Rather, what that person will end up doing is requesting and examining information stored in a relatively large data base. It is our contention that such people can be trained in a manner which is directly transferrable to problems in large file processing. Moreover, with this training as the first introduction to computing, one can place computational algorithm languages in their proper context in the commercial world. The ASAP information processing software system, developed by one of us (Morgan) along with Professors Richard Conway and William Maxwell at Cornell University, is a tool for this training. (This software system has been described in the Computing Newsletter for Schools of Business, Daniel Couger, Editor, under the title &ldquo;Data Management System Available for Instructional Use.&rdquo;) The emergence of the generalized data base management systems (GDBMS) over the past few years has clearly been one of the most significant developments in administrative data processing. These systems had their origins in the report generators and statistical packages of the mid-sixties, but are not logically complete&mdash;they are capable of creating and maintaining a relatively sophisticated data base, as well as selectively retrieving and updating information in that data base. Well over a thousand computing installations have now got more than fifty of these systems running (see the article by T. William Olle, &ldquo;Data Base Management Systems'&rdquo;, in Datamation, 15 November 1970).
A function definition operator
Authors: Kenneth E. Iverson, Peter K. Wooster
Venue: Proceedings of the international conference on APL (1981)

This paper proposes two related extensions to APL: the extension of assignment to allow a name F to be assigned to a derived function by an expression of the form F&larr;+.x, and the introduction of a dyadic operator @@@@ to apply to character arrays D and M so that D@@@@M produces an ambivalent function in which the dyadic case is defined by D and the monadic case by M.
A computer method for the arrangement of phytosociological tables
Authors: G. William Moore, William S. Benninghoff, Paul S. Dwyer
Venue: Proceedings of the 1967 22nd national conference (1967)

A phytosociological table is a matrix, each of whose rows corresponds to the occurrence of a particular plant species and each of whose columns corresponds to a sample plot in which the several species occur. Each plot list is called a releve. The elements of this matrix are binary, corresponding to the presence or absence of each species in each plot. Thus if the ith species is present in the jth releve, then the ijth element of the phytosociological table is equal to one; if the ith species is not present in the jth releve, then the ijth element is equal to zero. For over half a century, botanists have used tables of this kind to indicate patterns of association among species of plants by showing which combinations of species are either mutually present or mutually absent in groups of releves.1 One of the major problems in communicating the information in one of these tables is the problem of arranging the order of the rows and columns of the table so as best to display the relationships of mutual presence and mutual absence among the species. This problem has been solved in the past by selecting the best of a series of trial arrangements, based on the botanist's experience of putative associations among the several plant species and similarities among the releves in the table. While this method is adequate for most displays, it suffers from at least two serious drawbacks. First, the number of trial arrangements which the botanist may test in a reasonable amount of time is quite small; second, the arrangements which are most likely to be attempted are highly dependent on the training and experience of the individual botanist. In other words, it is quite possible that the &ldquo;best&rdquo; arrangement of species and releves for the display of a particular phytosociological table may vary substantially from botanist to botanist. In the interest of speeding up this procedure and making it more objective, we present a computer program for the arrangement of phytosociological tables.
Diet: A data independent system for medical applications
Authors: R. J. Dubien, H. D. Covvey, K. C. Sevcik, E. D. Wigle
Venue: Proceedings of the 1977 annual conference (1977)

A Cardiovascular Research Database System is being developed at Toronto General Hospital on a Varian V-76 minicomputer. The system utilizes the TOTAL Database Management System as a manager of the internal network structure of the database and the data dictionary/ directory. The system was designed to achieve data independence as defined by the ANSI/X3/SPARC/SGDBMS committee. This paper will describe the first phase of this project.
A file system supporting cooperation between programs
Authors: Loretta Guarino Reid, Philip L. Karlton
Venue: ACM SIGOPS Operating Systems Review (1983)

File systems coordinate simultaneous access of files by concurrent client processes. Although several processes may read a file simultaneously, the file system must grant exclusive access to one process wanting to write the file. Most file systems consider processes to be antagonistic: they prevent one process from taking actions on a file that have any chance to harm to another process already using the file. If several processes need to cooperate in a more sophisticated manner in their use of a file, they must communicate explicitly among themselves. The next three sections describe the file system procedures used by clients for using and sharing files. Section Two discusses how a client gains access to a file and how a client can respond if the file system asks it to give up a file it is using. Section Three discusses the mechanism by which a client might ask to be notified that a file is available for some access. Section Four discusses a controlled type of file access that lets clients read and write the same file at the same time. Section Five comprises three examples of the cooperative features of the file system taken from the Xerox Development Environment. Section Six discusses the subtleties of writing the call-back procedures that clients provide to the file system to implement interprocess cooperation. Section Seven discusses the implementation of this file system.
Multisystem processing with APL
Authors: J. F. Sencindiver, D. H. Steinbrook
Venue: ACM SIGAPL APL Quote Quad (1979)

Interfaces (both ASCII and EBCD) are presented which allow an IBM5100 or IBM5110 with APL to communicate as an intelligent terminal with a host APL timesharing system. The two concurrently active workspaces are coordinated through the Serial I/O Adapter Feature attached to a data set or acoustic coupler. Various transfer options are discussed, as well as hardware and software compatibility. A working application with cooperating workspaces is presented to illustrate some possibilities and implications of the interfaces.
Static inference of properties of applicative programs
Authors: Prateek Mishra
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

An applicative program denotes a function mapping values from some domain to some range. Abstract interpretation of applicative programs involves using the standard denotation to describe an abstract function from a &ldquo;simplified&rdquo; domain to a &ldquo;simplified&rdquo; range, such that computation of the abstract function is effective and yields some information, such as type information, about the standard denotation. We develop a general framework for a restricted class of abstract interpretations that deal with non-strict functions defined on non-flat domains. As a consequence, we can develop inference schemes for a large and useful class of functional programs, including functions defined on streams. We describe several practical problems and solve them using abstract interpretation. These include inferring minor signatures and relevant clauses of functions, which have arisen out of our work on a strongly-typed applicative language.
A mathematical model of the briquette industry in Victoria
Authors: S. E. Blanch, N. J. Handerson, K. W. Laing
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper describes how a business model is created and used. In particular it focuses attention on a model which has been developed to represent a typical business comprising production, storage, distribution and demand in a competitive environment. It describes the situation of the briquette industry in Victoria. The paper is presented not only to illustrate one successful and valuable application, but also to indicate the powerful nature of mathematical models and the way in which all businesses can be so represented. The example used in this paper to high-light the various aspects of model buildings fits into an emerging pattern of quantitative studies which are contributing toward the preparation of investment decisions by the State Electricity Commission of Victoria.
User communication in a heterogeneous distributed network
Authors: Christine Wendt
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Helping people learn and use a computer system involves at least three different paths of communication: user-to-consultant (and vice versa); user-to-user; and&mdash;especially for large and diverse systems&mdash;consultant-to-consultant. The Merit Computer Network presents in many ways a textbook example of barriers to user and consultant communication: the host computing centers not only are geographically distant but also vary in their hardware and operating systems. The paper discusses the different mechanisms that Merit has evolved for dealing with these barriers, with particular emphasis on the use of computer conferencing, as well as some plans (and dreams) for future improvements.
Data integrity considerations in computer based accounting systems
Authors: Dan S. Dhaliwal, Benn R. Konsynski
Venue: Proceedings of the 1977 annual conference (1977)

Over the past few years there has been a steady increase in the applications of computers to accounting functions. While computerized accounting systems enable one to store a large volume of data and process these data very rapidly, such systems also contribute to the complexity of data integrity problems. The purpose of this paper is to review several important considerations in developing and maintaining the integrity of data in computerized accounting systems. In order to establish a reasonable degree of confidence in data generated by an accounting system, the hardware, software, communications and human operating procedures must operate in concert. Integrity of data can be compromised in any one of the several phases of the &ldquo;life cycle&rdquo; of accounting data. The basic stages in this life cycle might be characterized as follows: 1. Measurement and classification 2. Transcription, validation and storage 3. Processing, updating and recovery
The finalization operation for abstract types
Authors: Richard L. Schwartz, P. M. Melliar-Smith
Venue: Proceedings of the 5th international conference on Software engineering (1981)

In this paper we argue the importance of a finalization capability in a programming language abstract type facility. Finalization, the dual of initialization, is crucial for applications involving the allocation of, and access to, abstract resources. A semantic model for finalization is given, defining both statically and dynamically allocated abstract objects, in the presence of exception handling. For illustration, we incorporate finalization in an abstract data type facility designed as an extension of Ada.
Placement algorithms for arbitrarily shaped blocks
Authors: B. T. Preas, W. M. vanCleemput
Venue: Proceedings of the 16th Design Automation Conference (1979)

New placement algorithms have been developed which are suitable for the layout of Very Large Scale Integrated (VLSI) circuits Hierarchical decomposition is used to reduce the circuit function to a size that can be comprehended by the designer and is computationally feasible to layout. At each hierarchical level the problem consists of the placement of interconnected rectangular blocks of arbitrary size and shape such that the area occupied by the blocks and their interconnections is minimal. Constructive initial placement and iterative improvement algorithms are presented.
SLIC - Symbolic Layout of Integrated Circuits
Authors: Dave Gibson, Scott Nance
Venue: Proceedings of the 13th Design Automation Conference (1976)

The purpose of this paper is to introduce a symbolic layout technique for MOS integrated circuits. We will give a description of symbolic layout, talk about its potential and briefly describe the symbolic layout system we have developed at AMI.
Deciding branching time logic
Authors: E. Allen Emerson, A. Prasad Sistla
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

In this paper we study the full branching time logic (CTL*) in which a path quantifier, either A (&ldquo;for all paths-&-rdquo;) or E (-&-ldquo;for some path&rdquo;), prefixes an assertion composed of arbitrary combinations of the usual linear time operators F (&ldquo;sometime&rdquo;), G (&ldquo;always&rdquo;), X (&ldquo;nexttime&rdquo;), and U (&ldquo;until&rdquo;). We show that the problem of determining if a CTL* formula is satisfiable in structure generated by a binary relation is decidable in triple exponential time. The decision procedure exploits the special structure of the finite state &ohgr;-automata for linear temporal formulae which allows them to be determinized with only a single exponential blowup in size. We also compare the expressive power of tree automata with CTL* augmented by quantified auxillary propositions.
Optimal texture filtering
Authors: T. Randen, J. H. Husoy
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper deals with the design of a finite impulse response filter for optimal feature extraction in texture segmentation/classification. Motivated by the Fisher criterion, we develop techniques for optimal filter design. Posing some restrictions on the data, we are able to find a closed form solution to the problem, and we develop a unifying framework for this and several other approaches. We also show how the optimal filters may be designed, using less restrictive assumptions and a gradient search.
Computer Science And Graduate Education In Applied Mathematics
Authors: Clayton V. Aucoin
Venue: Proceedings of the 1978 annual conference (1978)

The term &ldquo;applied mathematics&rdquo; in the title and throughout this discussion includes all areas of the mathematical sciences rather than just classical applied mathematics. The comments in this paper are derived from two primary sources: an ad hoc committee formed at Clemson to investigate the interface between the mathematical sciences and computer science and ideas developed in the implementation of Clemson's NSF grant &ldquo;An Alternative in Higher Education in the Mathematical Sciences.&rdquo; The ideas gleaned from the grant activity were developed through actual experience and through comments from many of the departmental visitors supported by the grant, especially those sixty or so conferees from industry, government, and academia who participated in the grant-sponsored conference, &ldquo;Graduate Programs in the Applied Mathematical Sciences: Perspectives and Prospects&rdquo;[24].
The development and implementation of an executive seminar on computer awareness for university administrators
Authors: Richard A. Pollak
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The computing centers at the U.S. Naval Academy have found an increasing number of Academy Administrators turning to the computer to solve their problems without first fully defining their problem. In this modern age, when the amount of information manually processed is continually increasing, top level administrators should be aware of computer capabilities and the facilities available at the Navel Academy. Upon completion of this seminar, the participants will be able to: (1) Define those factors that the user/customer is responsible for during the development of a large-scale computer project. (2) Describe the purposes of the computer facilities at the Academy and how their missions differ, as well as recognize the computing centers' capabilities and limitations in terms of mode of operation, hardware, software, and human resources. (3) Compare various types of modern computer input/output devices and how they can be used to process information.
The automatic generation and execution of function test plans for electronic switching systems
Authors: Jonathan Bauer, Susan Faasse, Alan Finger, William Goodhue
Venue: ACM SIGSOFT Software Engineering Notes (1978)

A three phase functional testing methodology is described for use in the development cycle of electronic switching systems. The methodology centers on a directed graph model of the system and provides for the checking of system requirements, the generation of functional tests and the automatic execution of these tests.
A &ldquo;greedy&rdquo; channel router
Authors: Ronald L. Rivest, Charles M. Fiduccia
Venue: Proceedings of the 19th Design Automation Conference (1982)

We present a new, &ldquo;greedy&rdquo;, channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more than one track more than required by channel density. (It may be forced in rare cases to make a few connections &ldquo;off the end&rdquo; of the channel, in order to succeed.) It assumes that all pins and wiring lie on a common grid, and that vertical wires are on one layer, horizontal on another. The greedy router wires up the channel in a left-to-right, column-by-column manner, wiring each column completely before starting the next. Within each column the router tries to maximize the utility of the wiring produced, using simple, &ldquo;greedy&rdquo; heuristics. It may place a net on more than one track for a few columns, and &ldquo;collapse&rdquo; the net to a single track later on, using a vertical jog. It may also use a jog to move a net to a track closer to its pin in some future column. The router may occasionally add a new track to the channel, to avoid &ldquo;getting stuck&rdquo;.
Job satisfaction as a predictor of tenure
Authors: Elias M. Awad
Venue: Proceedings of the 1977 annual conference (1977)

Work is central to man's development and total life adjustment and provides a situation for satisfying needs. Upon accepting employment, an individual makes adjustments to the job and work environment and contributes to the job's purposes and objectives. When the employee quits that job, the employing organization faces various adjustments in finding a replacement. The impact of such turnover is especially critical to a computer facility, because short-term, uncertain commitment to the system's day-to-day operations can create costly chaos rather than the economic efficiency it is designed to achieve. Several studies of this personnel problem have been published (Vroom 1960, Sells 1963, Pervin 1968, Thompson 1969, Warren 1971, Willoughby 1971, Awad 1970, 1976); and while each offers a different cause or a cure, they all agree that the turnover among data processing personnel resulting from voluntary resignation is excessively high.
Recent developments in ISI-interlisp
Authors: Raymond L. Bates, David Dyer, Mark Feber
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper reports on recent developments of the ISI- Interlisp implementation of Interlisp on a VAX computer. ISI-Interlisp currently runs under UNIX, specifically the Berkeley VM/UNIX and VMS operating systems. Particular attention is paid to the current status of the implementation and the growing pains experienced in the last few years. Included is a discussion of the conversion from UNIX to VAX/VMS, recent modifications and improvements, current limitations, and projected goals. Since much of the recent effort has concerned performance tuning, our observations on this activity are included. ISI-Interlisp, formerly known as Interlisp-VAX, was reported in 1982 ACM Symposium on LISP and Functional Programming, August 1982 [1]. Experiences and recommendations since the 1982 LISP conference are presented.
Database services for personal computers linked by a local area network
Authors: Andreas Diener, Richard Brägger, Andreas Dudler, Carl August Zehnder
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Recently, more and more personal computers are getting linked by means of a local area network. This calls for network-wide services, among others for a network database service. However, the question of an appropriate architecture for such a database system is quite open. This paper establishes a set of criteria for this evaluation and presents three possible architectures. Among them, the concept of a federative database server is introduced and is shown to be an excellent solution in many cases. Hardware dependencies are Identified and hints for optimal decisions in different hardware environments are given. Finally, the concept chosen by the authors for implementation is presented.
A requirements engineering methodology for real-time processing requirements
Authors: Mack Alford
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper describes a methodology for the generation of software requirements for large, real-time unmanned weapons systems. It describes what needs to be done, how to evaluate the intermediate products, and how to use automated aids to improve the quality of the product. An example is provided to illustrate the methodology steps and their products and the benefits. The results of some experimental applications are summarized.
A problem oriented computer-based instructional procedure
Authors: Richard B. Hoffman, John P. Seagle
Venue: Proceedings of the 1969 24th national conference (1969)

Reasons for the failure of computer assisted instruction to be more widely adopted at the university level are explored. Among the possible causes are inability to allow individualized instruction, and a lack of consideration of the reactions of professors. A computer-based procedure, oriented around quantitative problems, is proposed to overcome these two causes. The procedure requires the ability to generate varied problems for the student to solve. A computer program to generate one class of problems is reported in order to establish the feasibility of problem generation. An example is given.