ppxscal/embedding_network huggingface dataset:
Organizing and managing computer personnel: Conceptual approaches for the MIS manager
Authors: Cyrus F. Gibson, Richard L. Nolan
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

The manager of computer-based systems in most organizations today is involved in a bewildering and rapidly changing set of technical and managerial problems. The sources of these problems may be traced to two developments in the external environment of organizations which are not within the power of the typical MIS manager to control. The first development is the continuing pace of technological change in computer hardware and software; the second development is the increasing specialization and professionalization of computer personnel. In addition, the MIS or EDP function within most organizations continues to grow in total budget size and in importance to day-to-day operations and to higher and higher levels of administrative decision-making.
Computing on a shoestring: Initial data entry for service organizations
Authors: Martha R. Horton
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

This paper addresses the feasibility of computerized record-keeping for low-budget volunteer organizations, and presents results of an experiment designed to determine a fast, reliable, and comfortable data entry technique for enabling non-computer-user to enter large amounts of manually recorded data into a computer file.
A microprogrammed architecture for front end processing
Authors: Rodnay Zaks
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

The increasing diversity of hardware devices and software procedures developed for remote processing has yielded a multiplicity of new facilities and telecommunication network structures. The corresponding architectures for front-end systems range from specialized device control to sophisticated multi-purpose multi-terminal support. Simultaneously, the very complexity of new data transmission and processing techniques has created a need for flexible and powerful yet transparent communications processors. The functions of a front-end system will be analyzed in order to derive the concepts which will be used to establish a classification. In a first part, telecommunications and control functions are analyzed in detail, as well as the user facilities at the functional level. The level of support provided by major commercial operating systems with respect to front-end systems is then examined. Their facilities and shortcomings provide the basis for front-end systems. Finally, the architecture of a commercial microprogrammed front-end processor is presented. A modular microprogrammed architecture of this type allows efficient and economical system structuring for a wide range of teleprocessing services.
Automatic symbolic solution of differential equations of first order and first degree
Authors: Peter Schmidt
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The problem of solving first order, first degree differential equations symbolically is characterized as a heuristic search process. An investigation into the problem of automatically solving such differential equations has resulted in a heuristic program, called EULE. The selection and the realization of the methods for EULE are based on a detailed analysis of the problem domain: the standard work of Kamke (1961), which is representative of the state of knowledge of differential equations, was examined in three different respects: the collected methods of solution, the methods utilized for the collection of differential equations and the structure of these differential equations. The realization of the methods is based on this result and on defined principles which ensure the effectiveness of the program. The effectiveness of EULE can be characterized by the fact that EULE achieved a 'rate of solution' of 90% for Kamke's representative collection of first order, first degree differential equations and a rate of 95% for Murphy's (1960) representative collection. For two collections for training students EULE achieved a rate of 100%.
A generalized transition network representation for interactive systems
Authors: David Kieras, Peter G. Polson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A general method for describing the behavior of an interactive system is presented which is based on transition networks generalized enough to describe even very complex systems easily, as shown by an example description of a word processor. The key feature is the ability to easily describe hierarchies of modes or states of the system. The representation system is especially valuable as a design tool when used in a simulation of a proposed user interface. In order to characterize the interaction between a user and a system, an explicit and formal representation of the behavior of the system itself is needed. To be of value in the design of user interfaces, the representation should be independent of the actual implementation of the system, but also reflect the structural properties of the system's behavior, such as its hierarchical form, the possible modes, and the consistent patterns of interaction. At the same time, the representation must be easy to define and understand. This paper presents a representation notation with these properties.
Simulation model of a multiphasic screening unit for use by a department of surgery
Authors: Frances M. Delaney, Marilyn Oppenheim, Martin Goldberg, William Schumer, A. Gerson Greenburg
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Increased emphasis has been placed on the utilization of automated multiphasic screening units as a means of contributing to the improvement of health-care delivery. This paper describes the application of a GPSS program to evaluate such a unit for use by a surgical service. By using the simulation model, statistics on the efficiency and utilization of the unit are obtained and compared with real-world data. Variations in patient scheduling and processing made within the model assist in the determination of the most effective use of fixed health-care personnel and facilities. Based upon model-generated data, predictions can be made about personnel and facility capacities required to cope with the increasing demands projected for services in the hospital. Application of a simulation model to the planning, analysis and implementation of a multiphasic screening unit can lead to economic benefits and efficient service for patients and physicians.
An application of variable-valued logic to inductive learning of plant disease diagnostic rules
Authors: R. Chilausky, B. Jacobsen, R. S. Michalski
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Knowledge acquisition and representation in machines is growing in importance to computer science research. Most of the work in this direction has used traditional binary logic as a theoretical framework. However, a more adequate treatment of these problems may be achieved by an advance into multiple-valued logic. In particular, the concepts of variable-valued logic (Michalski 72,73,74a) provide useful and flexible tools for representation and automated acquisition of knowledge. This paper describes an application of AQVAL/1, a set of programs implementing the variable-valued logic system VL1, to determine diagnostic rules for soybean diseases through an inductive inference process. The methods of application and the results of an experiment are briefly described.
Consistency checking within embedded design languages
Authors: A. Rudmik, B. E. Casey, H. Cohen
Venue: Proceedings of the 6th international conference on Software engineering (1982)

It is difficult to ensure consistency between a program's design and its implementation. An embedded design language (one superimposed on an implementation language) can help. This paper describes a particular embedded design language that was successfully used to design and implement a very large compiling system. This design language has a rich set of constructs for expressing the high-level and detailed designs of a program. It also supports various levels of design and implementation consistency checking, and the generation of a variety of documents for use by programmers and reviewers.
Color image quantization for frame buffer display
Authors: Paul Heckbert
Venue: ACM SIGGRAPH Computer Graphics (1982)

Algorithms for adaptive, tapered quantization of color images are described. The research is motivated by the desire to display high-quality reproductions of color images with small frame buffers. It is demonstrated that many color images which would normally require a frame buffer having 15 bits per pixel can be quantized to 8 or fewer bits per pixel with little subjective degradation. In most cases, the resulting images look significantly better than those made with uniform quantization. The color image quantization task is broken into four phases: 1) Sampling the original image for color statistics 2) Choosing a colormap based on the color statistics 3) Mapping original colors to their nearest neighbors in the colormap 4) Quantizing and redrawing the original image (with optional dither). Several algorithms for each of phases 2-4 are described, and images created by each given.
Consideration in the design of a multiple computer system with extended core storage
Authors: Kurt Fuchel, Sidney Heller
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

This paper discusses the recent innovation of the use of large quantities of addressable (but not executable) fast random access memory in order to heighten the multiprogramming performance of a multicomputer system. The general design of the hardware arrangement and the software components and functions of such a system are based on Brookhaven's future configuration of dual CDC 6600's sharing one million words of Extended Core Storage. In the generalization of such a design, special emphasis is placed on estimating expected gains compared to the traditional configuration of separate and independent computers without ECS. An observation is made on the use of conventional slower speed random access storage devices in place of the faster memory.
Business and management data processing I: Small business executive decision simulation
Authors: A. G. Dale
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE MODEL of a computerized game, developed at The University of Texas for The Small Business Administration, will be described in this paper. Also to be discussed is its application, on the basis of a series of extended gaming sessions, with executives of small companies as participants.
An Activity-Based Model of Collective Knowledge
Authors: Helen Hasan
Venue: Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 3 - Volume 3 (2003)

In the challenges faced by organisations in the area of knowledge management, there is clearly a role for information and communications technologies in supporting the exploitation of business knowledge. This paper proposes a model of knowledge processes, based on the concept of "activity", i.e. what people do, as determined by the Cultural-Historical Activity Theory. The evolutionary development, of an implementation of the model in currently available technology will be described, together with the results of an evaluation of its suitability and effectiveness. This work is substantiating both the practicability of the implementation and the usefulness of the structure for the extraction of rich information that can support group memory and knowledge processes.
Graphic update of automated logic diagrams
Authors: Richard J. Uhlik
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

The Automated Logic Diagram, or ALD, is a well defined document prepared by engineers to specify the design of a machine. 1 The document is coded for computer input by highly trained transcription personnel. Changes or corrections are batched for a master file update computer run. Because of the number of queues involved, a day or more is normally required to complete this process. A project was undertaken to investigate the utility of a graphic display device as a direct interface between the designer and the computerized data base. The purpose was to drastically reduce the turnaround time of updating ALD's. In this paper, the format and contents of the ALD are first defined. This will aid the reader in understanding the document which this project was designed to display and update at the graphic console.
A hierarchical structure for concurrency control in a distributed database system
Authors: H. Yamazaki, S. Hikita, I. Yoshida, S. Kawakami, Y. Matsushita
Venue: Proceedings of the sixth symposium on Data communications (1979)

This paper focuses on the concurrency control problem for a distributed database system. A new control philosophy called hierarchical processing structure is proposed. Two different types of the consistency are clearly defined, and the hierarchical processing structure is derived from these consistency types. This structure provides the following features; 1) The centralization of processing load on a particular site can be avoided. 2) Two distinct types of updating mechanism are defined according to two aspects of data consistency. 3) A comprehensible philosophy for the concurrency control is established.
A Multi Radar Tracking simulation using ALGOL 68'R
Authors: P. R. West
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

The paper outlines the use of ALGOL 68R in the production of a series of simulation models for a Multi Radar Tracking feasibility study. Particular reference is made to the use of structures, the chaining mechanisms used and the modularity of the models. The multi-radar tracking models were developed in ALGOL 68'R by Plessey Radar Ltd. and run on their 1906S under George 3/MOP.
Positive effects of computer programming on students understanding of variables and equations
Authors: John Clement, Jack Lochhead, Elliot Soloway
Venue: Proceedings of the ACM 1980 annual conference (1980)

There is a common intuition among those in computer science that programming helps to develop good problem solving skills . Our work has attempted to isolate the specific factors in programming which enhance mathematical problem solving ability. We have found that a surprising number of college students have difficulty with very simple algebra word problems. However, significantly more students are able to solve these word problems correctly in the context of writing computer programs, than in the context of simply writing an algebraic equation. We obtained similar results in comparing the reading of algebraic equations within computer programs and the reading of algebraic equations by themselves. Computer programming apparently puts an emphasis precisely on the active , procedural semantics of equations that many students lack.
Computer science, federal programs, and Nirvana
Authors: Kent K. Curtis
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

My text this morning comes from a highly regarded German algebraist of the nineteenth century, Leopold Kronecker. He was engaged in a vigorous debate with other mathematicians on exactly this question, what are the foundations of mathematics? What set of axioms can be used as a basis for deriving everything else? Most mathematicians were following directions of thought which invoked the concept of infinity, infinite sequences, infinite sets, infinite classes, and reciprocally, the notion of infinitesimal. By consistent application of logic, their premise inexorably led to further elaborations such as trans-finite numbers which are esoteric in the experience of most of us. Kronecker vigorously asserted that following this path was an error. He claimed that one must begin, and not only begin but remain content with the integers and those things which can be described algorithmically in terms of them. &ldquo;God made the integers, and all the rest is the work of man.&rdquo;
A Computer Aided System (CAS) for the design, manufacture, test, and documentation of digital Printed Circuit Boards.
Authors: R. J. Summers
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper is an overview of a complete set of software packages for the design, manufacture, test and documentation of Digital Printed Circuit Boards.
A sorting routine of intermediate size and speed
Authors: Marty Ossefort
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

In this paper, we consider the problem of sorting a file in a database which is stored on a diskette and is to be processed by a small desk-sized computer. In many applications, such as output applications for a general-purpose database, it is also a requirement that the order of the records on the disk not be changed. There are many ways to accomplish such a sort-on-output.
Friends and Foes: Preventing Sel.shness in Open Mobile Ad Hoc Networks
Authors: Hugo Miranda, Luís Rodrigues
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Technological advances are leveraging the widespread deployment of mobile ad hoc networks. An interesting characteristic of ad hoc networks is their self-organization and their dependence of the behavior of individual nodes. Until recently, most research on ad hoc networks has assumed that all nodes were cooperative. This assumption is no longer valid in spontaneous networks formed by individuals with diverse goals and interests. In such environment, the presence of selfish nodes may degrade significantly the performance of the ad hoc network. This paper proposes a novel algorithm that aims to discourage selfish behavior in mobile ad hoc networks.
Programming languages for operating systems.
Authors: R. M. McKeag
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper outlines some of the things that an operating system designer looks for in a programming language. This working paper was submitted to the A.C.M. SIGPLAN/SIGOPS Interface Meeting held at Savannah, Georgia from 9th to 12th April 1973.
A generalized bound on LPT sequencing
Authors: E. G. Coffman,  Jr., Ravi Sethi
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

In this paper we shall generalize Graham's result so as to include a parameter characterizing the number of tasks assigned to processors by the LPT rule. The new result will show that the worst-case performance bound for LPT sequencing approaches unity approximately as 1+1/k, where k is the least number of tasks on any processor, or where k is the number of tasks on a processor whose last task terminates the schedule. Thus, we shall have a result very similar to the parameterized bounds for bin-packing heuristics [JDUGG]. We shall also obtain out of the analysis an alternate proof of Graham's result.
Structural models for software reliability prediction
Authors: Martin L. Shooman
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Many previous software reliability prediction models by this author and others have concentrated on the bulk (macro) aspects of the program. This paper describes a newly developed micro model which is based on program structure. It is assumed that the program has been written in structured or modular form so that decomposition in to its constituent parts is simple. Further, we assume that via analysis of the program the decomposition can be related to several paths or other functional structures within the program. The model is constructed based upon the frequencies with which each of the j paths are run, (fj), the running time of each path, (tj), and the probability of error along each path, (qj). Several methods of calculating or measuring the fj, tj, and qj parameters are suggested. In fact it is possible to use one technique (historical data) to produce crude estimates at the start of the design, and refine the estimates with more accurate values as the design progresses. The paper concludes with the application of the model to a particular example: calculation of the roots of a quadratic equation, and a discussion of proposed experiments for validating the model.
An experimental distributed switching system to handle bursty computer traffic
Authors: W. D. Farmer, E. E. Newhall
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

Data and encoded voice signals differ in certain characteristics which require, if switching is the goal, slightly different approaches. Some of the characteristics of digitized speech and data are compared This paper describes an operating experimental system (three terminals) which switches messages of variable message length occurring at periodic and aperiodic rates, achieves fast access time, and accommodates bit rate inputs from teletypewriter (110 bits/sec) to disc transfer rates (4 &times; 10 6 bits/sec).
The architecture of Tandem's NonStop system
Authors: Dennis McEvoy
Venue: Proceedings of the ACM '81 conference (1981)

A Tandem T16 computer system is a network of up to 256 nodes. Each node consists of two to sixteen processors. The system had three major design goals: (1) Continuous data availability. (2) Modular growth by adding processing elements to a node. (3) Support of a network of geographically distributed nodes for on-line transaction processing. This talk will sketch Tandem's approach to continuous data availability. At the hardware level, NonStop is achieved by designing a single-fault tolerant system. A Tandem system has two or more modules and paths for each function. In addition, the system design addresses issues such as power failure, on-line maintenance, and reconfiguration.
On the use of simulation models to evaluate alternative schedules
Authors: S. A. Weiner, J. W. Grant, S. L. Pohly, L. Y. Tsui, S. B. O'Reilly
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The work presented here today is based on a simulation model of a portion of one of our stamping plants. The presentation begins by briefly describing a typical section of the stamping plant and the scheduling environment in which the plant operates. After describing the reality, the author will then proceed to describe the simulation model built and its verification and scheduling approaches. The presentation concludes with a summary of the results and some general remarks on the importance of scheduling in the factory of the future.
Some problems concerning the automatic translation of Fortran to Algol 68
Authors: A. Prudom, M. A. Hennell
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

We consider briefly some of the problems encountered in the initial implementation of a system to automatically convert Fortran programs to Algol 68.
An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals
Authors: Deborah S. Franzblau, Daniel J. Kleitman
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We provide an algorithm which solves the following problem: given a polygon with edges parallel to the x and y axes, which is convex in the y direction, find a minimum size collection of rectangles, which cover the polygon and are contained within it. The algorithm is quadratic in the number of vertices of the polygon. Our method also yields a new proof of a recent duality theorem equating minimum size rectangle covers to maximum size sets of independent points in the polygon.