ppxscal/embedding_network huggingface dataset:
A life cycle model of new product profitability
Authors: Kenneth Deemer
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

A model, based on the product life cycle concept, considers the revenues and expenses associated with development, introduction, and marketing of new products. Key parameters may be varied individually to investigate the projects's profitability under different scenarios. The product life cycle model may be programmed on a hand calculator and used as a convenient first pass when evaluating new product proposals.
An Efficient Algorithm for Maintaining Consistent Group Membership in Ad Hoc Networks
Authors: Pushkar Pradhan, Abdelsalam (Sumi) Helal
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Designing a reliable group membership algorithm for mobile ad hoc networks is a non-trivial task since we must deal with limited device power, possibilities of frequent disconnections and network partitions. The function of the group membership service is to maintain a consistent group view across all members of the group. Only then can we say that the group membershipservice is reliable. Reliable group membership protocols in distributed systems (e.g., the virtualpartitioning (VP) algorithm) make free use of aborts as a tactic to ensure the reliability of group formation. We present a group membership algorithm based on VP that minimizes message exchanges and thus reduces the power spent in transmission by detecting and eliminating superfluous aborts.
Movement of implicit parallel and vector expressions out of program loops
Authors: Paul B. Schneck
Venue: ACM SIGPLAN Notices (1975)

The concept of &ldquo;interference&rdquo; is introduced and related to the problem of transforming implicit parallel and vector operations to an explicit form. Statement types and constructs which cause interference are identified. Programming techniques which avoid use of potentially interfering statements result in programs which are better suited for operation on parallel and vector processors. The analysis of the inhibiting effect of interfering statements on the motion of parallel and vector expressions has been implemented and demonstrated as an addition to an existing compiler which recognizes parallelism implicit in current serial programs.
Process selection in a hierarchical operating system
Authors: R. C. Varney
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper presents a new model for use in scheduling processes for the sharing of a processor. The model may be used in various modes of operation, including multiprogramming, real time and time sharing. Because the model is applicable for various modes of operation and because it is significantly useful only within a well-defined system hierarchy, the context for discussion is Hansen's system for the RC 4000.3,4,5 Only the preliminary work has been reported in this paper, but the author believes that the model is worth investigating further, and, therefore, research into its effects and properties will continue.
A high performance delay calculation software system for MOSFET digital logic chips
Authors: Ants Koppel, Siddharth Shah, Prem Puri
Venue: Proceedings of the 15th Design Automation Conference (1978)

Practical assumptions in the implementation of a delay calculation software system yielded a means to economically calculate MOSFET chip circuit delays with sufficient accuracy for effective digital simulation.
SAR Image Processing Using Artificial Intelligence Planning
Authors: Forest Fisher, Steve Chien, Edisanter Lo, Ronald Greeley
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In recent times, improvements in imaging technology have made available an incredible array of information in image format. While powerful and sophisticated image processing software tools are available to prepare and analyze the data, these tools are complex and cumbersome, requiring significant expertise to properly operate. Thus, in order to extract (e.g., mine or analyze) useful information from the data, a user (in our case a scientist) often must possess both significant science and image processing expertise.This paper describes the use of Artificial Intelligence (AI) planning techniques to represent scientific, image processing, and software tool knowledge to automate elements of science data preparation and analysis of synthetic aperture radar (SAR) imagery for planetary geology. In particular, we describe the Automated SAR Image Processing system (ASIP) which is currently in use by the Department of Geology at Arizona State University (ASU) supporting aeolian science analysis of synthetic aperture radar images. ASIP reduces the number of manual inputs in science product generation by 10-fold, decreases the CPU time to produce images by 30%, and allows scientists to directly produce certain science products.
An analysis of naming conventions for distributed computer systems
Authors: Douglas B. Terry
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

Name servers that collectively manage a global name space facilitate sharing of resources in a large internetwork by providing means of locating named objects. The efficiency with which the name space can be managed is strongly influenced by the adopted naming convention. Structured name spaces are shown to simplify name space management from both an administrative and system viewpoint. Formulae have been derived which allow one to quantitatively measure the effect of the distributed name server configuration on a given client's level of performance. In general, the cost of a name server query can be reduced by distributing replicated copies of name server database entries in a way that exploits the locality of clients' reference patterns.
The use of minicomputers in a first computer systems course
Authors: Michael Levison
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

This paper describes some experiences in the use of a set of small minicomputers in an elementary computer systems course.
LIPP - a SIMD multiprocessor architecture for image processing
Authors: T. Ericsson, P. E Danielsson
Venue: ACM SIGARCH Computer Architecture News (1983)

LIPP (Link&ouml;ping Image Parallell Processor) is a multiprocessor system intended mainly for image analysis and image processing but even other computing tasks where large amount of data should be manipulated in forms of matrices, such as weather forecasts or other related problems namely systems of differential equations. The processors within the processor array are of bit-serial type with the capability of directly processing data with wordlengths in the range of 1 bit to 32 bits in one bit increments without time penalty. Bit-serial operation gives the possibility of designing suprisingly fast algorithms. To each processor is a fairly large memory (64 Kbit) associated. A processor can instantly reach 8 neighboring memories through an interconnecting network. The processor array whose size is thought to be 16 by 16 it running in SIMD mode. In this way memory access collisions can be minimized. Image and matrix data are mapped in the memory space so that each memory holds a subimage. We call this mapping distributed processor topology. Because of the memory mapping and interconnection network neighborhood operations such as two dimensional convolution are easily performed.
Dynamic buffer management for computer communications
Authors: Wesley W. Chu
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Buffer management plays an important role in store-and-forward computer communication systems. The management policy will influence the cost as well as the performance of the system. In this paper we present an implementation of a dynamic buffer management strategy for a shared buffer computer communication system. Such a management policy provides flexibility as well as efficiency in utilization of buffer space. An estimation of required buffer size and strategies for handling buffer overflow are described. Finally, methods for allocating buffer resources among the set of buffer outputs (destinations) are discussed.
Optimum speed of service in the design of customer data communications systems
Authors: F. R. Mastromonaco
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

A model is given for selection of optimum bit speed for private line data communications applications based on the tradeoff between the cost of delay and the cost of equipment. Costs of delay are those costs incurred by the communications user which occur outside the communications system as a result of delays introduced by that system. The delays considered result from transmission delay and customer's queuing delay. The model assumes Poisson input, exponentially distributed message lengths, and k servers. A method for including the effect of error control is given. The bit speed selection model is applied to an information retrieval application.
A MULTILINGUAL INTERPRETER for interactive computing in an academic environment
Authors: Larry Kheriaty
Venue: Proceedings of the ACM annual conference (1973)

In order to satisfy three types of terminal users, student programmers, production users and CAI authors, Western Washington State College has developed a MULTILINGUAL INTERPRETER. The MULTILINGUAL INTERPRETER allows PL/I, BASIC and COURSEWRITER III to be run on a single terminal system. The configuration of the language processor is such that programs can be prepared in more than one source language. The main purpose of this development is to provide advanced programming features not only to the non-CAI programmer, but to the CAI programmer as well. This paper describes the steps taken in the development of this system and the system's language mixing capabilities.
A hardware laboratory for computer architecture research
Authors: Jean Vaucher, Christian Rey
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

Because of dramatic reductions in cost of mini-computers, peripherals and logic modules, it is becoming evident that many problems confronting the computer system designer will be solved in the future by hybrid designs involving not only software but also specialized computers with architectures best suited to each application. Accordingly, hardware research must no longer be considered as a separate discipline by system programmers but as a tool in exactly the same way as languages. To illustrate this philosophy, a hardware laboratory has been set up at the University of Montreal. The primary interest of the founders was in designing and building small specialized computing systems. This paper describes some of the aspects of the laboratory with emphasis on two major developments: (1) The design of a programmable I/O switch between two mini-computers. (2) The addition and monitoring of a writable control store connected to one system.
Reducing risk for central site equipment moves
Authors: Roger Kleffman, Rick Glesener, Jerry Brzeczek
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Equipment changes - moving, adding or removing units in a central computer facility - can have a devastating effect on a computer center. Equipment failures and cable problems can result in prolonged service outages, user disservice and management frustration. Risks from these changes can be effectively controlled by means of sound implementation planning tools. An effective methodology based on a graphics technique that accurately represents equipment location in a computer room on standard size paper provides the planning tools that minimizes the risk of outages.
The avail system
Authors: Arthur O. Cromer
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

HOW MANY TIMES HAVE YOU BEEN ASKED, &ldquo;WHAT DO YOU HAVE AVAILABLE TO HANDLE MULTIPLE REGRESSION&rdquo;, OR &ldquo;...TIME SERIES ANALYSIS&rdquo;, OR ONE OF A THOUSAND OTHER TOPICS? HOW DO YOU HANDLE SUCH QUESTIONS ON AN INTERACTIVE NETWORK COVERING AN ENTIRE STATE. SEVERAL APPROACHES TO THIS PROBLEM HAVE BEEN TRIED BY OTHERS, AND THE SOLUTION WE HAVE COME UP WITH IS BY NO MEANS UNIQUE, OR SPARKLINGLY ADVANCED, OR EVEN CLEVER. THE ONLY THING THAT CAN BE OFFERRED IN ITS DEFENSE IS THAT SOMETHING HAD TO BE DONE AND IT WAS. THE IDEA OF THE AVAIL SYSTEM IS BASED ON A PROGRAM OBTAINED THROUGH DECUS (10-226) (1). THE PROGRAM IS WRITTEN IN FORTRAN, TO ACCESS INDEX WORDS IN ONE FILE THAT POINT TO DOCUMENTATION RECORDS IN A SECOND FILE (AS CAN BE SEEN IN FIGURE 1.), AFTER CHECKING TO SEE THE INDEX WORDS ARE NOT BLOCKED (COMMON) WORDS.
A discriminant metric for module cohesion
Authors: Thomas J. Emerson
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The decomposition of a large program into modules can be guided by the use of a property called cohesion, first described by Constantine. Cohesion is a quality that describes the degree to which the different actions performed by a module contribute to a unified function. However, this technique may be difficult to apply due to the subjective nature of the definitions of levels of cohesion. In this paper a software metric is defined and proposed as a discriminant for classifying modules according to their cohesion. Formal properties of the metric are derived which can be used to set the metric value ranges for module classification.
A computerized model for analyzing the financial impact of developments
Authors: Patricia Anne Owen
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A computerized model has been developed for evaluating the financial impact of a new development on existing jurisdictions. It can be applied to many types of real estate development such as new towns, residential subdivisions or industrial parks to analyze their impact on jurisdictions such as the local city, county, school board or utility district. It can be used by both the jurisdictions in evaluating proposed development and by the developer in obtaining zoning changes, building approvals, etc. Outputs include a projected budget for up to twenty years for each jurisdiction and an impact statement with projected tax millage rates, and bonding margins. The types of problems which this model solves and its general features are first explained in the introduction. Then the mathematical model structure and equations are presented. Finally, results from applying the model to the analysis of new community development and industrial plant construction are discussed.
Time-bounded random access machines
Authors: Stephen A. Cook, Robert A. Reckhow
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

In this paper we introduce a formal model for random access computers and argue that the model is a good one to use in the theory of computational complexity. Results are proved which compare run times for recognizing sets using this model (which has a fixed program) with a stored program model and with Turing machines. The main result, theorem 3, shows the existence of a time complexity hierarchy which is finer than that of any standard abstract computer model. An Algol-like programming language is introduced which facilitates proofs of the theorems.
The challenge of human resources staffing and utilization in industrial computing - part 2
Authors: Claude Walston, Ed Coady
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Claude Walston An analysis of staffing needs to the computer industry itself is considered. The general organizational and functional structure is described, then needs within this area for computer science graduates is considered. Needs now exist in a number of major areas, especially research, system architecture, system software design, program product design, and internal operational data processing support. The type of qualifications this industry hopes to find in computer science graduates is presented. Ed Coady The Social Security Administration &ldquo;allegedly&rdquo; has the largest computer installation under one roof in the world. Thirty-seven distinct computer systems are available, comprising an integrated marriage of multi-vendor equipment. Eleven hundred programmers (called computer specialists) and eight hundred operations specialists make up the teams that program and operate these systems. The recruiting, selecting, and training of personnel directly associated with the computer systems is discussed. The importance of this function is of high and continuing interest and includes involvement by the top management executives at Social Security Administration. This presentation will cover the experiences and future needs for the education of computer personnel.
Implementing an academic computing services experimental program on a university-wide basis
Authors: W. Berton, D. F. Costello, C. Sundermeier
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Over the past fiscal year the University of Nebraska Computer Network has sponsored a Computer Augmented Instruction/Experimental Program (CAI/EP). The paper will discuss the CAI/EP from three perspectives: first, that of the Director of Academic Computing Services; second, that essentially pedagogic perspective of the faculty committee member; and third, that of one of the staff members responsible for implementing the program. In a later paper an effort will be made to summarize the reactions of the grant recipients and the effect of this on the second round of grants.
Automated aids fob reliable software
Authors: Donald J. Reifer
Venue: Proceedings of the international conference on Reliable software (1975)

Recent investigations on the use of automation to realize the twin objectives of cost reduction and reliability improvement for computer programs developed for the U. S. Air Force are reported. The concepts of reliability and automation as they pertain to software are explained. Then, over twenty automated tools and techniques (aids) identified by this investigation are described and categorized. Based on the information reviewed, an assessment of the state of the technology is made. Finally, specific recommendations which try to give direction to future efforts are offered.
Multiprogramming the RCA 601
Authors: R. D. Smith
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Multiprogramming may be defined as the execution of several computer programs concurrently, under a time-sharing mode, with the aim of keeping all independently operable computer components continuously busy. The benefit to be derived from such a multiprogramming mode of operation then is to achieve maximum computer effectiveness. However, the running time required to achieve multiprogramming must be significantly less than the resultant gain in computer effectiveness. There are three cogent reasons why multiprogramming can enhance computer effectiveness. Since most programs are either compute limited or Input-Output limited rather than evenly divided, a mixture of programs is potentially better balanced than a single program. Secondly, as computer capability increases, programs to be operated do not necessarily increase in size. Hence~ these programs are inherently incapable of utilizing the full capacity of the computer, whereas a program mixture would be able to use all of the computer capacity. Thirdly, the nature of a particular problem or the ineptitude of a programmer may result in poor simultaneity within individual programs. Since multiprogramming permits another program to use this &ldquo;dead time&rdquo;, more efficient use of the computer is made and the requirements on programmer ability is significantly reduced.
A multiprogramming system for process control
Authors: Sam Howry
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper describes an operational small computer multiprogramming system developed for the control of the Stanford Two Mile Linear Accelerator (SLAC). The system has many features of larger systems such as dynamic memory allocation and interprocess control, but does not have to handle typical batch type jobs which need large arrays and many other system resources. This difference results in a drastic reduction in the complexity of both design and implementation. The accelerator control problem is discussed in terms of what requirements are imposed on the system by the environment. Then the basic subsystems are described with sufficient examples to show the reader other areas where such a system may be applicable.
A loop network for general purpose data communications in a heterogeneous world
Authors: Thomas E. Hassing, Raymond M. Hampton, Gerald W. Bailey, Robert S. Gardella
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

How do you interconnect a large, heterogeneous group of computers, batch terminals and conversational terminals to form a general purpose network of computing resources? What techniques and technologies can be applied to maximize throughput and minimize response times? Is major surgery on host processor operating systems really necessary to interface to a communications network? This paper will describe a packet switching data communications network under development at the National Security Agency for resource sharing and the future development of distributed processing and filing systems. Starting with an experimental three node loop, the network will consist of a hierarchy of interconnected loops or rings probably based on Bell System T carrier digital transmission technology. Also discussed will be the means of nodal connection to the loops, the configuration of a node, network protocol, security considerations and implications for the future.
A system simulation study of dynamic social change
Authors: Lynn P. Madden
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper will apply the concepts of general systems theory and systems modeling simulation to an initial study of social group interaction. The social groups or organizations to be considered are those relating to the &ldquo;civil rights movement&rdquo; within American society. It is necessary, at an initial stage, to deal with higher level, macro structure, relations and interactions. This paper will show that it is possible, at a macro level, to examine the dynamic nature of the interactions between social groups and categories such as the civil rights movement, legislative bodies, and the general non-civil rights society. The method that is used to accomplish this examination of &ldquo;key&rdquo; social system parameters and interactions is that of systems modeling and simulation.
A proposed Computer Science curriculum for two-year colleges
Authors: Josephine Peck
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

In the past decade many two-year colleges have developed and implemented various curricula in Data Processing and/or Computer Science. These programs grew out of existing vocational needs for computer operators, data prepares, EAM equipment operators and application programmers. Since very few four-year institutions offered a bachelor's program in Computer Science, the two-year schools generally did not develop a sequence of courses geared to the needs of the transfer student. These students were usually advised to concentrate in either mathematics or business administration - a situation which persists in many colleges today. This paper will offer a discussion of several factors which have affected the needs of both the terminal and the transfer student of two-year colleges and which consequently warrant a revision of the existing two-year Computer Science curricula. A curriculum and description of revised course content will be suggested as one possible alternative.