ppxscal/embedding_network huggingface dataset:
Evaluating the suggestiveness of command names
Authors: Jarrett Rosenberg
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

An important feature of the design of human-computer interfaces is that of command languages: the vocabulary and syntax that allow a user to express commands to the system. If we look at command languages from the standpoint of natural languages, rather than formal ones, then there are three aspects to their user interface. The first is the overall structure of the user-system dialogue&mdash;its pragmatics, so to speak (e.g., [3]), which includes issues of contextual reference, presuppositions, and so on. The second aspect of command languages is their syntax (e.g., [1], [4]). The important issue here is the trade-off between consistency of the syntax and its similarity to that of natural language. The third aspect of command languages is their semantics, primarily that of their commands. Most command languages are fairly small, with simple data and control structures, and so their semantics are fairly trivial. More important is the &ldquo;lexical&rdquo; semantics of commands and their arguments and parameters. The crucial factor here is the names given to the entities and operations in the system by the command language: if those names are not apt, performance will be impaired just as with poorly designed syntax or dialogue structure. This paper investigates the psycholinguistic aspects of this naming problem.
Controlling for variability in demand for an s,S inventory system
Authors: Keith A. Klafehn
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

In the establishment of an s,S inventory system, emphasis is given to determining the review period, the nominal order point (s) and the maximum level of inventory (S), which aids in the calculation of the order quantity. The level of safety stock, which is predicated on the demand during the lead time and review period will be affected by the variability present in the demand. This paper investigates the operation of the s,S inventory system under the condition of each of four different demand distributions; the Uniform, Normal, Poisson and Beta. Demand relative to each distribution is randomly generated, a review period is chosen and the levels of s and S are varied in a simulation model of the inventory system. The basic costs - inventory, order, stockout - are calculated to show the effect of the demand distribution.
On homogeneity in M/G/1 queueing systems
Authors: Raymond M. Bryant
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Operational analysis replaces certain classical gueueing theory assumptions with the condition of &ldquo;homogeneous service times.&rdquo; In this paper, we show that the sample paths of an M/G/1 queueing system have this property with non-zero probability if and only if the service time distribution is exponential. We also consider the relationship of the operational performance measures S(n) and the mean service time. This relationship is shown to depend on the form of the service distribution. It follows that using operational analysis to predict the performance of an M/G/1 queueing system when the mean service time is changed will be most successful when the service time distribution is exponential. Simulation evidence is presented which supports this claim.
A very small information retrieval system
Authors: Ward Douglas Maurer
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The problems of information retrieval are normally associated with large computers, large disk files, and very large amounts of information. Our purpose here is to describe an information retrieval system constructed for an unusual application, related to word processing systems, in which the primary goal is to implement the entire system (program plus data) in as small an amount of memory space as possible. It may be reasonably expected that this type of information retrieval system will become increasingly important as microcomputer systems become more commonly used.
Computer science for secondary schools: Course content
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Computers and computing are topics of discussion in many curriculum areas in secondary school. The four courses recommended by this task group, however, have computing as their primary content. The courses are: 1) Introduction to Computer Science I (a full year course) 2) Introduction to Computer Science II (a full year course) 3) Introduction to a High-level Computer Language (a half-year course) 4) Applications and Implications of Computers (a half-year course) Courses 1 and 2 are designed for students with a serious interest in computer science. Course 1 can serve as a single introductory course for some students and also act as a prerequisite for Course 2. At the end of two years of study, students should be prepared to be placed in second level computer science classes in post-secondary educational institutions or to take the Advanced Placement Exam available through the College Entrance Exam Board.
Art and architecture thesaurus (abstract only)
Authors: Pat Mohlot
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

Designing and providing subject access to works of art has traditionally been very subjective. This is due to the fact that there are no standardized word lists which can be expected to meet the scope of all art collections. Whereas tailoring subject terms to the scope of a given collection is the most practical approach for the curator in charge of the collection, the researcher, who may not be an art specialist, often is frustrated when the listing of subject terms does not include the terms relevant for his/her purposes. This presentation will explore how the development of a thesaurus resolves the conflict of subject vocabulary. Specific examples will be drawn from four computer projects at the National Museum of American Art. Each of the projects varies in scope, yet a single subject classification guide has been developed for purposes of providing subject access to the contents of each project.Because a separate subject word list was not originally designed for each project, a thesaurus is now being developed which will allow for a listing of terms not used for indexing but which are relevant to both the scope of each project and anticipated researcher needs.From a practical viewpoint, the presentation will demonstrate how the computer can be used to generate terminology to be included in the thesaurus.
Trw's extended sceptre software-dc program (TESS-DC) a non-linear worst case program
Authors: B. A. Hass
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

Since the advent of the computer, many circuit analysis programs have been developed for the purpose of eliminating much of the expensive breadboarding associated with a design. However, a large class of circuits cannot be analyzed by the programs and hence many circuits are still being evaluated only by breadboard methods. A much larger class of circuits could be analyzed by the programs if the limitations on circuit size, input, and output were removed. Described in this paper is a new non-linear d-c circuit analysis program called TESS-DC, which was designed specifically to analyze a much larger class of d-c problems. Included in this paper is the description as well as an example of the program's input language. The program's capabilities are presented and a number of flow diagrams provided to illustrate the operation of the program.
On proving the correctness of optimizing transformations in a digital design automation system
Authors: Michael C. McFarland
Venue: Proceedings of the 18th Design Automation Conference (1981)

As part of our research for the Carnegie-Mellon University Design Automation System, we have been investigating methods for proving that the system produces correct designs from correct specifications. This paper presents a mathematical model of the behavior of hardware descriptions which has been used to prove that some of the optimizing transformations applied to abstract hardware descriptions in the system preserve behavioral equivalence. The model goes beyond the usual computational models used in program verification in that it takes into account the proper sequencing of &ldquo;events&rdquo; which represent interactions with the environment.
A polynomial decomposition algorithm
Authors: David R. Barton, Richard E. Zippel
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) &equil; g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.
Using ADA as a design language - classroom experience
Authors: George Corliss
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

ADA was used as a design language in a software engineering course. Students were able to become familiar with the features of ADA as a programming language and to improve their software development skills. ADA proved to be a powerful and flexible language for the expression of the design of a home environmental control system.
Flexible Group Communication Protocol for Distributed Applications
Authors: Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The group protocol supports applications with enough quality of service (QoS) in change of QoS supported by the underlying network and required by applications. A flexible group service is supported for applications by cooperation of multiple autonomous agents. Each agent dynamically and autonomously takes a class of each protocol function like retransmission which is consistent with the other agents.
Userbook: A modular approach to the users' reference manual
Authors: Stanley Yagi
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The University of Toronto Computer Centre operates several large computer systems: an IBM Sytem/370-165-II, and IBM System/360-65, and IBM 7094-II and an IBM System/370-155-II. In addition, the Computer Centre operates a Computer Research Facility with minicomputer systems. Each system supports a unique complement of services: e.g., the System/370-165-II provides a high-speed job stream service, batch and TSO facilities, remote terminal facilities, Calcomp and Gould plotting, etc. The System/360-65 provides interactive computer facilities such as ATS and APL. Each user has access to all facilities and thus requires a complete information package to acquaint him with the resources available and to aid him in using those facilities in which he is interested. Prior to the establishment of USERBOOK, the official reference manual, UTCC supported more than 40 different documents, manuals, guides, notices, recorded messages and other means of formal user communication. The variety of communication vehicles resulted in duplication of material, severe updating problems and a general lack of user confidence in UTCC publications. USERBOOK was produced in response to a growing demand for a single official reference document which would provide accurate, reliable information on all aspects of computing at UTCC. UTCC recognized that each user has different documentation requirements. To provide each user with current documentation exclusively related to his particular needs, UTCC has redesigned USERBOOK to be modular in form.
Interpretative sub-routines
Authors: J. M. Bennett, D. G. Prinz, M. L. Woods
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The subject of this talk is interpretative programming. An interpretative programme (or routine, i.e. part of a programme) is one formulated in a special code, usually quite different from the normal code of the machine with which it is used.
A logic partitioning procedure by interchanging clusters
Authors: Tadakatsu Ishiga, Tokinori Kozawa, Shoji Sato
Venue: Proceedings of the 12th Design Automation Conference (1975)

A logic partitioning procedure for computer aided design of LSI's which gets solutions by interchanging clusters is described. The procedure of generating clusters has some distinct features which assure that the clusters are suitable as units for interchanging. The cluster concept gives the Kernighan and Lin algorithm foresight and efficiency, and because of these, iteration of interchanging leads to a good solution. Results of partition for a variety of LSI's obtained with the program of this procedure are detailed. The solutions obtained with the program are compared with the manual solutions, and the quality of the procedure is confirmed to be as good as, or better than, that of manual design. The CPU time is within a reasonable value.
Unary inclusion dependencies have polynomial time inference problems
Authors: Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We study the interaction between unary inclusion dependencies (UIND's) and other known classes of dependencies, in the context of both unrestricted and finite implication. We provide complete axiomatizations for unrestricted and finite implication of UIND's and functional dependencies, and polynomial-time algorithms for the inference problems. The inference problem becomes, however, NP-hard, if we require that some attribute have a bounded domain. We show that for unrestricted implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and embedded implicational dependencies. Also, for finite implication, the interaction between UIND's and unary functional dependencies completely characterizes the interaction between UIND's and full implicational dependencies (but not UIND's and embedded implicational dependencies).
Transparent files in APL (A Preliminary Proposal)
Authors: Jim Lucas
Venue: ACM SIGAPL APL Quote Quad (1982)

File-related operations in APL could be classified according to whether manipulation of the file is restricted solely to APL or whether the file is to be accessible via another language. In the latter case communication is often dependent on the other language and should not affect APL language design, except for the provision of a general facility. Guidelines for using shared variables and defined functions to this end are presented. Files strictly intra-APL can and should be independent of such external communication, and a detailed proposal is presented whereby such internal files can be viewed and manipulated as if they were ordinary variables. The same conventions could also be extended to cover named objects in the workspace, thus giving enhanced access control within the workspace. Concerns addressed include syntax and nomenclature for reference to controlled or extra-workspace named objects, space constraints, error classification and reporting, upward compatibility, and to some extent, implementation concerns.
The design of system architectures for information retrieval
Authors: L. A. Hollaar, B. J. Hurley, D. J. Kuck, D. H. Lawrie, J. W.S. Liu, J. M. Milner, J. K. Morgan, J. R. Rinewalt, W. H. Stellhorn
Venue: Proceedings of the 1976 annual conference (1976)

A broad-based program for studying hardware, software and human factors affecting information retrieval system performance is described. Using EUREKA, a minicomputer-based retrieval program, studies of user adaptation to an on-line system, search strategy development and use of special features are in progress. Performance comparisons are made between machine-assisted users and those using conventional printed materials. Concurrently, special-purpose retrieval hardware is being designed, and one prototype system is under construction. To support and supplement this work, various modeling and simulation studies are also in progress.
Towards a parallel SIMULA machine
Authors: P. I. Georgiadis, M. P. Papazoglou, D. G. Maritsas
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

SIMULA language has been designed as a general-purpose programming tool and is particularly offered for describing and efficiently simulating large-scale systems. Such simulation models are usually characterized by inherent parallelism, which reflects corresponding activities of the system. This kind of natural parallelism remains unexploited by the implementation of the SIMULA language in a uniprocessor machine. We have critically assessed SIMULA, and we present a scheme that aims towards implementing SIMULA programs in a multiprocessor environment. This scheme establishes a parallel structure to replace the existing quasiparallel SIMULA mechanism. Our approach is based on the nature of SIMULA classes and the process interactions. An appropriate process interaction structure is proposed. This structure makes it possible to overcome such problems as mutual exclusion, deadlock, and synchronization. Further, an executive algorithm is outlined to guarantee the correct flow of processes in a multiprocessor environment. This work leads to a parallel SIMULA machine architecture, which is feasible within the current trends of LSI/VLSI technology.
Upper and lower bounds on time-space tradeoffs
Authors: Thomas Lengauer, Robert Endre Tarjan
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

This paper derives asymptotically tight bounds on the time-space tradeoffs for pebbling three different classes of directed acyclic graphs. Let N be the size of the graph, S the number of available pebbles, and T the time necessary for pebbling the graph. (a) A time space tradeoff of the form ST &equil; &thgr;(N2) is proved for a special class of permutation graphs which implement the bit reversal permutation. (b) A time-space tradeoff of the form T &equil; S &thgr;(N/S)&thgr;(N/S) is proved for a class of graphs constructed by stacking superconcentrators in series. (c) A time-space tradeoff of the form T &equil; S.22&thgr;(N/S)is proved for pebbling general directed acyclic graphs.
System optimization: Mathematical programming techniques for optimal computer use
Authors: H. E. Thiess
Venue: Proceedings of the 1965 20th national conference (1965)

IN THIS PAPER we consider the application of mathematical programming techniques for the solution of allocation, assignment, or selection problems of digital computer uses involving large amounts of data input and output in a series of computer runs. Files may be input to several runs in a series of machine runs; further, a file may originally be an output of one of the computer runs. We seek to optimize the allocation or selection of computer memory to blocks of records for each file. Also, we shall seek to optimize the assignment of input-output devices if more than one type of such devices is available. Aside from other applications, we have a memory allocation problem. The minimization of use of memory locations for mostly scientific computing problems was the subject of the ACM Storage Allocation Symposium held in Princeton, N. J. on June 23 - 24, 19611. Wolman2 discusses memory allocation in situations where, e.g., &ldquo;a general-purpose computer performs the control, switching, and storage functions in a data communication system with message storage.&rdquo; White3 describes the &ldquo;Relative Effects of Central Processor and Input-Output Speeds Upon Throughput on the Large Computer.&rdquo; Delgalvis and Davison4 derive a computational procedure to evaluate the input-output buffer storage requirements of a real-time system.
Mathematical rigor&mdash;a prerequisite for numerical analysis?
Authors: Shirley A. Liss
Venue: Proceedings of the 1966 21st national conference (1966)

Frequently mathematical errors can be attributed to applying a theorem or using a formula in a situation which does not meet all the initial requirements. An obvious example would be the use of the Pythagorean theorem to compute the length of the longest side of a scalene triangle. Such trivial mistakes are rarely made. However, when considering mathematical theory together with the physical universe, this is essentially what some mathematicians have done. Instead of determining theoretical relationships to describe the universe, they idealize the universe to conform to a mathematical model. In doing this some errors slip by under the guise of extrapolation and simplification. To avoid these sources of error and to obtain significant results relevant to the physical universe, it has become necessary for numerical analysis to transcend the bounds of mathematical rigor.
Self-Assessment as a precursor to professional development
Authors: James S. Ketchel, James R. Douglass
Venue: Proceedings of the ACM '81 conference (1981)

This paper discusses the Association for Computing Machinery (ACM) Self-Assessment Procedures and their use for professional development. A background and history of the Procedures is presented, including a statement of intention and philosophy along with a list of currently available Procedures. The use of the Self- Assessment Procedures by individuals is described, along with ideas for use in ACM Chapter professional development programs. Three group uses of the Procedures are presented: the distribution of the Procedures in packets (particularly to new members); the formation of self-assessment workshops; and, the use of the Procedures in a CDP review course. The authors advocate the use of self-assessment as a precursor to any professional development program.
Scheduling independent processors with different storage capacities
Authors: D. G. Kafura, V. Y. Shen
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The analysis of multiprocessor scheduling strategies has been the focus of substantial research in recent years. Because of the inherent complexity of the general scheduling problem, many researchers have proposed simple mathematical models of computing systems and analyzed the worst-case performance bounds of heuristic scheduling algorithms. This paper presents the analysis of simple scheduling strategies on a model of a computer system with an arbitrary number of identical but independent processors each with a possibly different storage capacity. Most simple strategies are shown to be unattractive as the bound on their worst-case behavior increases without limit. However, two strategies are presented with worst-case bounds asymptotically approaching 2. In addition, if the system has a preemptive-resume feature, a simple optimal strategy exists that will produce minimal-length schedules for any given task set.