ppxscal/embedding_network huggingface dataset:
A marketing framework for user services management
Authors: Elliott J. Haugen
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Dramatic, new developments in technology plus continually changing needs of users present great challenges for those of us involved with computing in higher education. While it is quite evident that a tremendous amount of change is occurring around us, it is often less noticeable that the rate of change is accelerating. One of the major factors contributing to this acceleration is the rapid growth and development of technology. Alvin Toffler, in Future Shock, called the &ldquo;technological engine&rdquo; the driving force of change and he predicted that as man's search for new knowledge expands, the rate of technological development will increase spectacularly. Probably the most significant recent technological development is the growth in the use of computers. The way computers are used has also changed during this technological explosion. The computer, previously only a calculating machine, has become a major information processing instrument. The role of computing on colleges campus has changed accordingly. It is not uncommon for graduate students to spend as much time at a terminal preparing thesis text as they do executing data analysis programs. The quickening pace of change, increasing demands on personnel, and tightening financial constraints mean that computing centers can no longer merely react to current circumstances, but must anticipate changing user needs. Therefore, it is important that a management framework be available to provide direction and guidance for all planning and decision making. Marketing provides a good framework because it contains an overall philosophy which stesses both a consumer orientation and the identification of specific consumer needs. The emphasis on customer satisfaction implies that all computing center activities should be focused upon this fundamental objective. While this sounds straightforward, some computing centers may not have a single objective, instead have subunits each striving for what it thinks is important. A consumer orientation also keeps the computing center alert to changing needs in the campus marketplace. It is important that we develop a &ldquo;user-friendly&rdquo; atmosphere or service, but it is more important to be &ldquo;user-conscious&rdquo; so we provide what is needed (2).
Human factors in information filing and retrieval
Venue: Proceedings of the ACM '82 conference (1982)

Session Overview: The development of, and increased reliance on, advanced workstations by a variety of users is creating the need for more user oriented filing and retrieving systems. With manuscripts, reports, personal mail, and data being stored in computers, the need for simplifying the storage and access of this information is increasing in importance. Part of this simplifying process has to address the problem of remembering file structure and file names, keywords, passwords, and other retrieval cues all of which can be very taxing to the user. The purpose of this session is to focus on those cognitive issues which affect user performance and satisfaction in the filing and retrieving of information from computer systems.
Exception handling in communication protocols
Authors: M. Stella Atkins
Venue: Proceedings of the eighth symposium on Data communications (1983)

This paper describes structures used for exception handling in multi-process implementations of the X.25 and X.29 protocols. Each protocol layer is implemented as a collection of cooperating processes. These are structured in one of two alternative ways, reflecting differences in the type of exceptional situations that may occur. Within each of the lower protocol layers, one process takes the form of a Finite State Machine. In these lower level protocols, where it is difficult to identify &ldquo;normal&rdquo; transitions, there are no special exception cases; we treat all transitions as being equally likely to occur. For higher level protocols such as the X.29 protocol, exceptions occur less frequently. Here, transmitting and receiving are performed by two independent processes, and exception handling is performed by an auxiliary process which is invoked as needed. This multi-process structure matches the functionality of the protocol, and results in software which is easy to program and easy to understand.
On shortest paths in polyhedral spaces
Authors: Micha Sharir(, Amir Schorr
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We consider the problem of computing the shortest path between two points in two- or three-dimensional space bounded by polyhedral surfaces. In the 2-D case the problem is easily solved in time O(n2 log n).In the general 3-D case the problem is quite hard to solve, and is not even discrete; we present a doubly-exponential procedure for solving the discrete subproblem of determining the sequence of boundary edges through which the shortest path passes. The main result of this paper involves a favorable special case of the 3-D shortest path problem, namely that of finding the shortest path between two points along the surface of a convex polyhedron. We analyze this problem and solve it in time O(n3 log n).
Grapevine: An exercise in distributed computing
Authors: Andrew D. Birrell, Roy Levin, Roger M. Needham, Michael D. Schroeder
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

Grapevine is a distributed, replicated system running on a large internet within the Xerox research and development community. The internet extends from coast to coast in the USA, to Canada and to Europe, and contains more than 50 Ethernet local networks linked by leased telephone lines. Over 1500 computers are attached to the internet. Most computers are used an personal workstations, but some are used as servers providing access to shared facilities such as printers, large-scale secondary storage, or data bases. Computers on the internet are uniformly addressable using the PUP family of protocols.
Invited papers&mdash;1: basic concepts of automata theory
Authors: R. J. Nelson
Venue: Proceedings of the 1965 20th national conference (1965)

I WAS INVITED to present a survey of the theory of automata. Since there are already several surveys, especially the very competent ones of Chomsky 10, McNaughton 37, and Rogers 54, all of which deal with various aspects of the theory of automata and more, I shall confine myself to an exposition of what might loosely be called a &ldquo;philosophy of automata&rdquo;. On the way, however, I hope to touch upon certain developments of the subject which have come about since McNaughton's 1961 paper. Readers who feel they are up on the theory may wish to omit sections 2 and 3.
Selecting the population with the smallest dispersion in a nonparametric setting
Authors: Milton Sobel
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A nonparametric formulation is set up for selecting the best one of k populations where best is defined as the one with the smallest inter(&agr;,&bgr;)-range; here inter(&agr;,&bgr;)-range is a measure of dispersion defined by the difference of the &bgr;th quantile and the &agr;th quantile. The formulation is strictly nonparametric in the sense that the df's are only assumed to be continuous and are not assumed to be stochastically ordered. The formulation and solution are similar to the solution of the corresponding &ldquo;central tendency&rdquo; problem treated by Sobel in [5], except that tables have not been prepared. Appendix A gives a second-order correction term for the probability of a correct selection. Appendix B deals with a related problem of selecting a subset containing the best population and is similar to the solution of the corresponding &ldquo;central tendency&rdquo; problem treated by Rizvi and Sobel in [4].
A study of file sizes and functional lifetimes
Authors: M. Satyanarayanan
Venue: ACM SIGOPS Operating Systems Review (1981)

The performance of a file system depends strongly on the characteristics of the files stored in it. This paper discusses the collection, analysis and interpretation of data pertaining to files in the computing environment of the Computer Science Department at Carnegie-Mellon University (CMU-CSD). The information gathered from this work will be used in a variety of ways: 1. As a data point in the body of information available on file systems. 2. As input to a simulation or analytic model of a file system for a local network, being designed and imlemented at CMU-CSD [1]. 3. As the basis of implementation decisions and parameters for the file system just mentioned. 4. As a step toward understanding how a user community creates, maintains and uses files.
A Computer Science Practicum
Authors: Ronald L. Lancaster, Richard T. Thomas
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

An approach is described for introducing practical work experience into an undergraduate computer science curriculum. This approach differs from others which have been reported in that it is not necessary for the student to make any arrangements for academic credit in advance. The requirements for obtaining practicum credit are described, and examples of projects which have received such credit are given. This approach has made a significant contribution to the educational program by offering academic credit for learning experiences which are difficult to duplicate in a typical computer science curriculum.
Information retrieval I: Keyword in context (KWIC) indexing on the IBM 7090 DPS
Authors: R. V. Wadding
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

KWIC is a system which produces an index of keywords contained in the text or titles of documents. The system produces a keyword index, a bibliography, and an author list, all derived from an input deck of bibliography cards.
A computerized management control system
Authors: James F. Weaver, Richard E. Huffman
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The following paragraphs will describe the purpose and operation of several of the program modules associated with the LCK management control system. Where applicable, the relationship of the program modules to each other and to the cost accounting system will be discussed. Input, output, and information retrieved from, added to, or updated in the common data files, will be mentioned. In addition, an evaluation of the usefulness of each module will be made.
A description of an AAW model and its classroom uses
Authors: Alvin F. Andrus
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A probabilistic event store computer simulation of the interactions between surface-to-air missile systems and aircraft in a non-jamming environment and over flat terrain is presented. The purpose of the model is to test the general disposition of the missile areas and the associated missile system reaction times against an aircraft attack. The model is used as text material in a simulation course. Several model applications are included.
FLAIR - user interface dialog design tool
Authors: Peter C. S. Wong, Eric R. Reid
Venue: ACM SIGGRAPH Computer Graphics (1982)

To aid the system designers in achieving early involvement of the users, FLAIR (a user interface dialog design tool) was conceptualized and developed. FLAIR allows the designer to rapidly prototype a system's Man-Machine Interface. A system designer can select a desired mix of input/output devices ranging from voice to high resolution graphics equipment. FLAIR prompts its users with a dynamic menu according to a pre-defined English-like syntax. Commands are entered by the designer's own voice. Entered commands are validated by voice pattern recognition and command language-gating. Pointing devices are used to locate, place, and/or pick objects from the RAMTEK 9400 25&rdquo; high-resolution color monitor. The graphics display portion of FLAIR is handled by a Core Standard graphics package. This particular package also fits the specific needs of FLAIR in that it makes available most of the RAMTEK 9400's hardware features. A relational DBMS has been integrated into FLAIR in order to manage system and user-defined data relationships. The user-defined data can be associated with a particular on-screen graphics symbol, and can then be queried at a later time. In addition to single graphics snapshots (or &ldquo;static frames&rdquo;), FLAIR allows the system designer to create command menu hierarchies for &ldquo;dynamic scenarios.&rdquo; This allows the designer to simulate, through client menu item selection, the system control flow. He can, in effect, create a tree of menus, traverse the tree at will, and select more menus or system actions as desired. All menus appear as sensitized areas on the graphics screen, and can be selected via any of the available input devices. It is estimated that a system designer can greatly improve his dialog design productivity by using FLAIR. The designers need not code any formal programs. The designer need not master the usage of the host computer, the graphic input/output systems, the menu controls, or the database programming before his designs are realized. FLAIR is there to assimilate, assemble, save and exercise his instructed operator dialog.
A Program Generator Package For Management Of Data Files&mdash;The Input Language
Authors: Lewis M. Norton
Venue: Proceedings of the 1978 annual conference (1978)

After a brief discussion of the use of existing program generators, this paper discusses a new, integrated package of generators of programs which perform manipulation of sequential data files. The generated programs create, update, validate, and reformat data sets, invert textual data, and produce reports. Emphasis in the paper is placed on the semantics and syntax of the statements used as input to the generators. Alternatively, this may be viewed as the design of a new, non-procedural, special-purpose, high-level language for data manipulation. The term conceptual record is defined to be the set of logical records pertaining to a subject. Input and output in the generated programs is done in terms of conceptual records. A detailed example of a conceptual record description is given and discussed to illustrate the flavor of the new package. Brief remarks on individual generators in the package conclude the presentation.
On computing certain integrals, and implications for symbolic algebraic manipulation
Authors: W. Morven Gentleman
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Overcoming numerical difficulties in the calculation of certain integrals in an atomic physics computation provides an interesting application of symbolic algebraic manipulation. Complications in doing the symbolic calculation have implications for the design and use of symbolic algebra systems.
A utility program for systematic layout planning
Authors: H. K. Eldin, B. J. Schroer
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper presents the results of an attempt to develop a utility simulation program for studying the system characteristics of a loading terminal under various terminal configurations. The simulation program was written in the IBM 360/GPSS simulation language.
A Real-Time Scheduling Approach for a Web-Based Rapid Prototyping Manufacturing Platform
Authors: Hsin-hung Lin, Chih-wen Hsueh, Chung-hung Chen
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Rapid prototyping is an automated manufacturing process that quickly builds physical models from CAD files of three-dimentional prototypes. It dramatically speeds up design and manufacturing process and substantially reduces the production cost. With the advanced Web technologies, rapid prototyping manufacturing systems can be further integrated and more effectively utilized. We have designed a distributed web platform where users can design prototypes, simulate manufacturing, and issue ordering request for real manufacturing through browser interfaces. However, an improper scheduling approach may degrade system utilization and throughput significantly. To solve this problem, we propose a real-time scheduling approach to maximize system utilization and minimize the average response time with the best effort. Using this approach, new requests can be accepted dynamically and all accepted requests can be finished before deadlines. We show that the scheduling overhead can be neglected and the average response time is very close to the optimal solution. With the proposed scheduling approach, the Web rapid prototyping platform is able to fully utilize Web resources for rapid prototyping manufacturing and the quality of service is significantly improved.
A form-based approach to human engineering methodologies
Authors: H. C. Kuo, C. H. Li, J. Ramanathan
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Experience in the development and maintenance of software leads to the design of methodologies for different phases of the software engineering process. Such methodologies attempt to usefully support the programmer's thought process for re-creating only good, standard patterns of programming without limiting creativity. However methodologies, as they are generally used, are limited in their impact on software quality. In this paper we present an approach for human engineering methodologies based on forms. The advantages of using a form-based interface for a software engineering environment are discussed by focusing on the design of forms, on the impact of forms on the software engineering process, and on the improved tool support facilitated by the standardization achieved by forms.
Methodology for teaching introductory computer science
Authors: R. R. Oldehoeft, R. V. Roman
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

In the last few years it has been generally recognized that teaching programming involves more than describing a new FORTRAN statement each day and providing programming problems to be coded. The concepts of disciplined programming and the accompanying interest in the problem solving process, coupled with the increasing economic desirability of constructing correct and maintainable software has resulted in significant attention being focused on what should be taught, and, to a lesser extent, on how this is best accomplished. In order to discuss how an introductory programming course is taught, it is essential to first establish a set of objectives for such a course. Some of these objectives are obvious and generally agreed upon, others are engendered by the academic environment in which this particular course exists. We first state the objectives and then comment on their appropriateness and interrelation.
Throughput analysis of computer systems - multiprogramming versus multiprocessing
Authors: W. Chang, Y. J. Paternot, J. A. Ray
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

To increase system throughput, multiprogramming and multiprocessing systems are introduced. The first improves the throughput by means of interleaving the individual service requests, and the latter by exploiting the parallelism in the system design. The basic philosophy of multiprogramming is compared with that of multiprocessing to put the concepts in their proper perspective. Simple mathematical models, based on the theory of queues, were used to analyze the throughput capacity of these systems. The throughput of a given multiprogramming system configuration is compared with a number of multiprocessing systems. Within each multiprocessing system, the throughput is maximized by determining the optimum number of processors, and the optimum number of control and supervision programs which are required to control the system. The mathematical analysis is completely substantiated by the GPSS simulation results.
On the scope of static checking in definitional languages
Authors: B. Szymanski, N. Prywes, E. Lock, A. Pnueli
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The paper concerns the use in software development of a class of very high level languages characterized as definitional, where a specification of a program consists of assertions expressed as conditional equations. As compared to logic programming, where assertion are expressed in the form of Horn clauses, definitional languages are more amenable to efficient compilation. Also, use of equations is a natural way of expressing mathematical models in science, engineering and economics, where computer simulation of such models is often required. Finally, definitional languages are well suited for programming dataflow machines, another important building block in a Fifth Generation Project. Thus, in many applications definitional languages are preferred choice for programming new generation computers. In using definitional languages to develop programs, a user relies heavily on static analysis during the compilation stage of development, as compared to the traditional practice of relying much more extensively on dynamic analysis performed by execution of the program with test data. As this seems to be the common trend in development of all software tools for Fifth Generation Computers, the limits of static checking are investigated for definitional languages in this paper. A comprehensive approach to selecting and implementing automatic checks in the compiler is proposed. The checking methodology consists of representing the specification of a program by a directed graph and propagating various attributes throughout the entire graph. The choice of attributes and checks depends greatly on the types of errors that users are prone to make. This approach is described in the context of the MODEL language and compiler. The paper reports also on an experiment to evaluate the effectiveness of various checking methods incorporated in the compiler and on reliance of static vs dynamic methods of checking. The types of checking constructed were: syntax analysis, ambiguity in naming, completeness of definitions, data type consistency, dimensionality (corresponds to nesting of loops), ranges of dimensions (corresponds to loop terminations) and circular logic.
Optimal replication of parallel-read, sequential-write systems
Authors: E. G. Coffman,  Jr., Erol Gelenbe, Roger C. Wood
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Frequently used computer elements that can be written by at most one process at a time constitute important bottlenecks in multiprocessor system operation, particularly when such elements are accessible only serially. Hardware devices, data files, system tables and critical sections in general may be examples of such elements. One common way to relieve this congestion is to provide several copies of the element, which can then be read (used) in parallel. However, the requirement that writing (changing) remain sequential means that writing times increase with the number of copies provided. The optimization question in this trade-off is the main concern of this paper. A probability model of such a system is formulated with the objective of obtaining read-rate capacities as a function of read/write loads and the number of copies provided. The above optimization problem is expressed in terms of these results and then solved. In particular, it is shown how to select the number of copies that maximizes the read-rate capacity for given system parameters. Two distinct operating regimes, based on how interrupted read operations are restarted, are analyzed.