ppxscal/embedding_network huggingface dataset:
Microprocessors for non-numeric processing
Authors: S. G. Zaky
Venue: ACM SIGARCH Computer Architecture News (1977)

The problem of processing of non-numeric data has received considerable attention in the last few years. This is primarily motivate by the pressing needs in the are a of data base management. It has long been recognized that the parallel processing capabilities of an associative processor are fundamentally well suited to this environment. However, the complexity and cost of truely associative memories make this approach impractical. In this paper, the demands that non-numeric processing place on memory and processor hardware are discussed. Some emerging trends are presented, and a suggestion is given regarding the development of a &ldquo;general purpose&rdquo; microprocessor that is suited to this environment. Basically, the microprocessor discussed here is capable of performing simple search and update functions on a high speed, serial data stream. Therefore, it is suited to any application where such a situation is encountered, such as in digital communications.
Modeling and analysis of flow controlled packet switching networks
Authors: Simon S. Lam, Y. Luke Lien
Venue: Proceedings of the seventh symposium on Data communications (1981)

Packet switching networks with flow controlled virtual channels are modeled by closed multi-chain queueing networks. The tree convolution algorithm for an exact analysis of such models is discussed. The algorithm is very efficient when routing chains have sparseness and locality properties that are typical of communication network models. The accuracy of an approximate model of equivalent open chains was investigated. An optimal routing criterion for adding a virtual channel (with a window size of one) to an existing network is explored.
Software design with invocation diagram
Authors: N. J. Denil
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper describes a medium being developed for abstraction and expression of program structure. The medium is to be used to represent programs during the design process; It forms the basis for their implementation. The following point of view is adopted. Program design is an iterative, trial-and-error process, in which a basic solution to part of the problem is refined, added to, and modified into a complete solution. The final result should be well-structured in the sense described by Dijkstra (1) in order for the designer to understand the program sufficiently to be confident in its correctness.
SPADOR: A scheduler, planner, and administrator of operations and resources
Authors: Richard Fikes
Venue: Proceedings of the 1976 annual conference (1976)

This presentation is a progress report on part of an ongoing project whose goals are to develop sophisticated computerized techniques for assisting managers and administrators in large organizations. In particular, we have focused on the development of a system that will provide the following services:
The use of a Module Interconnection Language in the SARA system design methodology
Authors: Maria Heloisa Penedo, Daniel M. Berry
Venue: Proceedings of the 4th international conference on Software engineering (1979)

In software design it is highly desirable to be able to deal with the structures of both the algorithm and the record of execution. A design methodology called SARA is being developed at UCLA. SARA's models are able to deal with the record of execution structure. This paper proposes the addition of a Module Interconnection Language to enable SARA to deal with the algorithm structure. An example illustrates how this combination can assist in the software design process.
Economic trends in data transmission by satellite
Authors: L. C. Palmer
Venue: Proceedings of the fifth symposium on Data communications (1977)

An analysis has been performed to examine the tradeoffs between cost and performance for digital data transmission via the communications satellite channel. The model relates both cost and performance to the major parameters of the spacecraft and the earth station. A combination of M-ary PSK transmission, and forward error correction (FEC) is selected to maximize communications efficiency (q in bps/Hz) for the prevailing carrier-to- noise ratio on the link. A data link control protocol using automatic repeat request (ARQ) as an error recovery technique is assumed. The overall performance measure computed herein is the annual cost per &ldquo;effective&rdquo; bit per second throughput over the link. Trends in cost/bps are shown for several satellite models as a function of information bit rate (Rb), and earth station figure of merit (G/T).
Interactive analysis of simulation output by the method of batch means
Authors: Thomas J. Schriber, Richard W. Andrews
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

An interactive FORTRAN subroutine is presented for use with ongoing simulations to determine and collect the sample size needed to estimate the mean of a process with a specified level of statistical precision. The subroutine can be used with simulation models written in a variety of languages, e.g., FORTRAN, GASP, GPSS, SIMSCRIPT. The subroutine partitions a sequence of observations on the random variable of interest into a series of consecutive batches, finding those batch sizes whose batch means are independent. The classical iid method is then applied to build a confidence interval on the mean. Under interactive user control, the subroutine then goes back to the simulation model as often as may be necessary to extend sample size to the point that the confidence interval satisfies the user's needs. This paper complements an earlier paper presenting software for interactive autoregressive analysis of simulation output [1]. The present paper reports on the use of both techniques to analyze data produced by data models for which analytic results are known. The method of batch means is not successful in identifying the batch size for which the batch means are known to be independent in one of these data sets. This raises serious questions about the procedure used to test for independence of batch means, and points out the need for further research in this area.
Methodology and empirical results of program behaviour measurements
Authors: Timo O. Alanko, Ilkka J. Haikala, Petri H. Kutvonen
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Program behaviour characteristics were examined using data gathered from real program executions. Experiments were performed in a segmented virtual memory with a working set policy; the analyzing costs were kept low using an efficient data reduction method. Empirical results were obtained concerning the influence of the window size on program behaviour characteristics, the accuracy of some average working set size approximations and the sensitivity of program behaviour to the program's input data. These results show that some commonly used assumptions concerning program behaviour are inaccurate. Also there seem to exist &ldquo;ill-behaving&rdquo; programs, the behaviour of which does not correspond well with results obtained earlier. The effects of real-time delays during program execution were considered using a new simple method. As an additional experiment, segmenting and paging were compared using various performance statistics; the results seem to favour segmenting.
Employment trends in computer occupations
Authors: L. R. Cottrell
Venue: Proceedings of the ACM 1980 annual conference (1980)

Computer programmers and systems analysts are expected to be among the fastest growing occupations in the economy through the 1980's, according to the latest projections of employment published by the Bureau of Labor Statistics. This growth is the result of a rapid increase in the number and types of computers in use and the rapid development of new computer applications. Over the next decade, more systems programmers will be needed to develop the complex operating programs made necessary by higher level languages and complicated computer configurations, as well as to link the output of different programs from different systems. Demand for applications programmers also will rise, despite increasing efficiency, as more computers are used. Continued strong demand for systems analysts will be assured by the need to reduce computer systems problems and to develop more sophisticated and complex computer operations. Although employment of computer professionals is expected to rise throughout the economy, demand will be strongest in the services factor, primarily in health care, education, and data processing, as well in banking.
A study of programming problem representation in novice and expert programmers
Authors: Joan Shertz, Mark Weiser
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

Based on a study by Chi and Glasser on physics problem-solving, [1] we hypothesized that novices represent computer programming problems initially on the basis of surface features, such as application areas, while experts represent programming problems on the basis of deep features, such as solution method and data structures. Using a problem sorting task, we studied differences in representation among beginning programmers, experienced programmers, and programming managers. Each participant in the study was given specifications for 27 different programming problems, and was asked to group together problems whose method of solution would be similar. The 27 problems were designed to have three different treatments on each of three dimensions of variation: data-structure, algorithm, and application area. Beginning programmers tended to group problems by application area, experienced programmers grouped by algorithm, and programming managers used a mix of the two methods. The experts were more consistent in their groupings and took more time to complete the grouping task, both of which are consistent with Chi and Glasser and reflect the expected novice/expert representation difference.
Student help and automatic grading: The organization of a large service course
Authors: Johannes J. Martin, Therese Martin
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

The organization of a programming service course is described. The objective is combining high instructional quality with economic use of departmental resources. With undergraduate tutors who help in the classroom as well as in consulting sessions and with the help of an automatic grading system, it was possible to lower the cost to about &dollar;7 per student credit hour (quarter system) without sacrificing instructional quality. Some results obtained by automatic monitoring of the student's work on programming assignments and by interviews and questionnaires are given to back the above claim.
Learner characteristics that predict success in using a text-editor tutorial
Authors: Dennis E. Egan, Cheryll Bowers, Louis M. Gomez
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Today, it is not unusual for secretaries to use computer-based word-processing systems to deal with manuscripts, correspondence, and memos. In the future, such functions as updating personal calendars, filing, and leaving messages undoubtedly will be handled by computers. For all these functions, people without a technical background are required to interact effectively with a computer system. A person's introduction to computers often begins with an attempt to learn how to use a text editor. Thus, knowing how to use a text editor is a requirement for a growing number of jobs. The importance of text editing is underscored by the recent psychological research devoted to understanding this skill [1,2,3,5].
GKS for imaging
Authors: Cliff Stoll
Venue: ACM SIGGRAPH Computer Graphics (1984)

By adopting the Graphical Kernel System (GKS), groups who manipulate pixelated images can take advantage of device independent graphics without giving up the functions which have traditionally been hardware dependent. Most of these functions, including image I/O, zoom, pan, lookup table manipulation, and cursor reading, are supported within GKS; several other functions, such as the use of multiple image planes and multiple look up tables, are accomodated by the GKS Escape and the Generalized Drawing Primitive (GDP). Because GKS has powerful inquire capabilities, it's possible to tightly customize applications code to a particular hardware display device. The inquire functions also can be used by an applications program to determine the hardware display size and thus avoid resampling of a pixelated image. GKS thoroughly separates applications programs from device- dependencies; however, device drivers must still be written. The time and effort of writing device drivers can be largely eliminated by using a single programmable device driver, which is tailored to each device by a GRAPHCAP configuration file, in much the same way as TERMCAP is used by Berkeley Unix implementations.
Human diversity and the choice of interface: A design challenge
Authors: Starr Roxanne Hiltz, Murray Turoff
Venue: ACM SIGSOC Bulletin (1982)

As part of a field trial, the Electronic Information Exchange System (EIES) provided a variety of interfaces and user aids. Users were permitted to freely choose from the available variety at any time. They were then asked to report on their frequency of use of the various alternatives at two points in time. We found that there is no one style of interface or source of user support which will satisfy all users at any point in time, or even the same user as experience and familiarity with the system change. While their generalizability is unknown, our observations suggest that human helpers (user consultants on EIES) are the single most valued source of user support, and that system designers should consider incorporating an integrated and somewhat redundant system of both menus and commands into the interface.
Structure of a direct-execution high-level Chinese programming language processor
Authors: Yaohan Chu
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Chinese language computer systems are those computer systems which accept programs in Chinese programming languages as well as data in Chinese characters. There are a number of ways that such a computer system could be implemented. This paper describes the structure of a direct-execution high-level language processor which accepts a Chinese programming language and Chinese data directly. This direct-execution high-level language processor has a multi-processor structure; each processor is functionally organized to perform a language processing function. These are: lexical processor, semantic processor, arithmetic processor, memory processor, in addition to I/0 channel and controllers and Chinese I/0 devices. A Chinese Algol program is chosen to describe the structure.
Unaffiliated papers (Paper Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This session consists of outstanding papers which, in the opinion of the Technical Program Committee, should be presented at the ACM '72 Conference, but for which there was no appropriate session available. Subjects covered range from automata theory to current work in computer music theory.
Measuring designer performance to verify design automation systems
Authors: D. E. Thomas, D. P. Siewiorek
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper describes an experiment statistically designed to gather data on designers' performances in digital design situations. Results of the experiment not only provide data by which to calibrate the results of register transfer level computer aided design algorithms but also the variance to be expected among designers given identical tasks. The experimental techniques described here are applicable to other non-optimal algorithms such as wire routing.
A perspective view of the MODCON system
Authors: Y. K. Chan
Venue: Proceedings of the 18th Design Automation Conference (1981)

In this paper, a system of computer programs for the geometric description of hot forgings is outlined. The system is known as the MODCON system which stands for MODular CONstruction. The MODCON system allows quite complex forging shapes to be produced from relatively few input instructions. The forging geometry is defined as a series of volumetric modules which are then merged together during generation of the N.C. tape necessary to machine the finishing-cut EDM electrode for the whole forging cavity. The system can also be used for the roughing cut of the EDM electrode before the finishing cut stage as well as for generating cross-sectional data which serves as input to subsequent preform design systems. The system represents a considerable saving in time and cost over current methods involving conventional pattern making for the copy milling of electrodes.
The random access hierarchy
Authors: Dale Myers
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

To be considered fast, algorithms for operations on large data structures should operate in polylog time, i.e., with the number of steps bounded by a polynomial in log(N) where N is the size of the data structure. Example: an ordered list of reasonably short strings can be searched in log2 (N) time via binary search. To measure the time and space complexity of such operations, the usual Turing machine with its serial-access input tape is replaced by a random access model. To compare such problems and define completeness, the appropriate relation is loglog reducibility: the relation generated by random-access transducers whose work tapes have length at most log(log(N)). The surprise is that instead of being a refinement of the standard log space, polynomial time, polynomial space, ... hierarchy, the complexity classes for these random-access Turing machines form a distinct parallel hierarchy, namely, polylog time, polylog space, exppolylog time, ... . Propositional truth evaluation, context-free language recognition and searching a linked list are complete for polylog space. Searching ordered lists and searching unordered lists are complete for polylog time and nondeterministic polylog time respectively. In the serial-access hierarchy, log-space reducibility is not fine enough to classify polylog-time problems and there can be no complete problems for polylog space even with polynomial-time Turing reducibility
What makes things fun to learn? heuristics for designing instructional computer games
Authors: Thomas W. Malone
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

In this paper, I will describe my intuitions about what makes computer games fun. More detailed descriptions of the experiments and the theory on which this paper is based are given by Malone (1980a, 1980b). My primary goal here is to provide a set of heuristics or guidelines for designers of instructional computer games. I have articulated and organized common sense principles to spark the creativity of instructional designers (see Banet, 1979, for an unstructured list of similar principles). To demonstrate the usefulness of these principles, I have included several applications to actual or proposed instructional games. Throughout the paper I emphasize games with educational uses, but I focus on what makes the games fun, not on what makes them educational. Though I will not emphasize the point in this paper, these same ideas can be applied to other educational environments and life situations. In a sense, the categories I will describe constitute a general taxonomy of intrinsic motivation&mdash;of what makes an activity fun or rewarding for its own sake rather than for the sake of some external reward (See Lepper and Greene, 1979). I think the essential characteristics of good computer games and other intrinsically enjoyable situations can be organized into three categories: challenge, fantasy, and curiosity.
On the diameter of permutation groups
Authors: James R. Driscoll, Merrick L. Furst
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We show that any group represented by generators that are cycles of bounded degree has O(n2) diameter, i.e., that the longest product of generators required to reach any permutation in the group is O(n2). We also show how such &ldquo;short&rdquo; products can be found in polynomial time. The techniques presented are applicable to generalizations of many permutation-group puzzles such as Alexander's Star and the Hungarian Rings.
Message Format Principles
Authors: George W. White
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

The transmission of data, telegrams or narrative messages (record material) over the facilities of one or more telecommunication networks, requires agreed-to message formats for traffic handling over these networks. This paper is designed to be a definitive discussion of the principles to be used for developing message formats. It is based upon the current efforts of American National Standards Institute Task Group X3S33, Message Header Formats. The subject of Message Format Principles no doubt connotes various things to various people. For example, it would have a certain significance to a person who has spent a lifetime in the communications world, while a person in another field would wonder what the subject was all about. With this in mind, it seems appropriate to define some of the terms which will be used in this paper. Each individual may not wholly agree with each definition. But if everyone will accept them for the purposes of this paper, we should better be able to understand the meaning of the &ldquo;message.&rdquo;
The symbolic manipulation of poisson series
Authors: J. M. A. Danby, André Deprit, A. R. M. Rom
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

Poisson series of three variables are manageable symbolically through a set of formal subroutines written partially in the IBM 7094 machine language, but to be called in the FORTRAN language for use in FORTRAN programs. An effort has been made to supply those operations which are most required by Celestial Mechanics. The routines are entirely self-contained subroutines and require only standard FORTRAN input-output units 5 and 6; they are designed to avoid waste and overflow of core storage space.
Comments on models of multi-processor multi-memory bank computer systems
Authors: W. R. Franta, Philip A. Houle
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This paper is concerned with processor degradation produced by access conflicts in multi-processor, multi-memory bank computer systems. Hardware and software parameters which influence performance are outlined and discussed. The incorporation of these parameters in analytic and simulation models is discussed with a view to the predictive merit of the model. Finally a general simulation model of a multi-processor is presented, and results based on its use are analyzed and compared with those of other models.