ppxscal/embedding_network huggingface dataset:
Advanced placement program in computer science(Panel Session)
Authors: David C. Rine, J. R. Jefferson Wadkins
Venue: ACM SIGCSE Bulletin (1983)

The Advanced Placement Program in Computer Science will be discussed by members of the development group. The presentation will be geared to both high school and college level educators. Steven J. Garland, Chairman The content of the Advanced Placement course and the information that was used to put the course together will be presented. Alternative outlines will be discussed as well as long-range plans for the future. David C. Rine, Chief Reader Suggestions on facilities needed to support the Advanced Placement in Computer Science course, and preparations for teachers of the course, will be presented. Standards, teacher training, and the Advanced Placement Examination will be discussed. J.R. Jefferson Wadkins The role played by the College Board and Educational Testing Service in the development of Advanced Placement courses and examinations, as well as ways in which the College Board and Educational Testing Service assist high schools and colleges with courses and examinations, will be presented. Available materials and information from the College Board and Educational Testing Service will be discussed.
The development of programmer evaluation measures
Authors: Raymond M. Berger, Robert C. Wilson
Venue: Proceedings of the third annual computer personnel research conference (1965)

This is a report of progress on a long-term research program devoted to computer personnel selection and evaluation. The overall program is outlined in Exhibit 1. Phase I deals with the job analysis and job description of computer programmer and analyst positions. Phase II deals with the development of proficiency tests for evaluating the effectiveness of programmers and analysts. Phase III deals with the development of selection tests and procedures that will be predictive of success in programming and analysis as measured by the proficiency tests developed in Phase II. In a paper presented to this group last year, we described the results of a factor-analysis study of the job descriptions of 150 computer programmers and systems analysts. The present paper describes an extension of the earlier study, the development of a Computer Position Profile, and also a further study, the development of a test of Basic Programming Knowledge.
The geometric primitives of APL
Authors: N. D. Thomson
Venue: Proceedings of the international conference on APL: part 1 (1979)

The roles of &fgr;, &THgr;, and @@@@ in describing the symmetries of the square are investigated. This leads to relationships between the results of these functions and the cyclic and dihedral groups of orders 2 and 4. Numerical modelling of these groups is accomplished through the primitives @@@@ and &Tgr; which are thus seen to play an important auxiliary role. Next the behavior of the functions @@@@ and @@@@ applied to permutation vectors is investigated, and parallels are observed between these primitives and the primitives &fgr;, &THgr;, and @@@@. These similarities are heightened by considering the partitioning of all permutations of a given order according to their internal symmetries.
The use of imbedded patterns and canonical forms in a self-improving problem solver
Authors: Alistair D. C. Holden, David L. Johnson
Venue: Proceedings of the 1967 22nd national conference (1967)

The aim of the work reported here was to develop problem-solving programs which would solve non-trivial problems and make use of their experience. In all of the work published previously there is a clearly discernible trade-off between problem-solving power and generality. This deadlock could be broken by the development of (a) programs which can make use of their experience and generalize it, and (b) powerful symbol manipulation languages which can express and execute highly complex processes without detailed programming.
Implementing Remote procedure calls
Authors: Andrew D. Birrell, Bruce Jay Nelson
Venue: ACM SIGOPS Operating Systems Review (1983)

Remote procedure calls (RPC) are a useful paradigm for providing communication across a network between programs written in a high level language. This paper describes a package, written as part of the Cedar project, providing a remote procedure call facility. The paper describes the options that face a designer of such a package, and the decisions we made. We describe the overall structure of our RPC mechanism, our facilities for binding RPC clients, the transport level communication protocol, and some performance measurements. We include descriptions of some optimisations we used to achieve high performance and to minimize the load on server machines that have many clients. Our primary aim in building an RPC package was to make the building of distributed systems easier. Previous protocols were sufficiently hard to use that only members of a select group of communication experts were willing to undertake the construction of distributed systems. We hoped to overcome this by providing a communication paradigm as close as possible to the familiar facilities of our high level languages. To achieve this aim, we concentrated on making remote calls efficient, and on making the semantics of remote calls as close as possible to those of local calls.
Obsolescence Of The Computing Professional: The problem and possible solutions
Authors: Paul Armer
Venue: Proceedings of the 1978 annual conference (1978)

It has been said that the &ldquo;half-life&rdquo; of computing knowledge is only five years. That can be rephrased for those unfamiliar with the jargon of physics. First of all, consider an individual just completing his formal education today. (For example, someone who has just obtained a bachelor's degree with a major in data processing.) Then, the assertion is that what he knows today will constitute less than half of what he will need to know to do his data processing job competently five years from today, because half of what he will need to know at that time is not known today. (Or if it is known, it is so new that it hasn't found its way into the curriculum as yet.) The evidence for this assertion is examined, resulting in the conclusion that though the evidence is indirect, a strong case can be made that the &ldquo;half-life&rdquo; of knowledge in data processing is much shorter than an individual's working lifetime. As a result, many professionals in the computer field will have trouble coping with the pace of change.
Intelligent magnetic bubble memories
Authors: Mario Jino, Jane W. S. Liu
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

In this paper, we are concerned with the design of intelligent magnetic bubble memories. It is our intent to explore ways of incorporating the novel bubble chip organizations and bubble movement operations in the design of such memories. In particular, we evaluate the improvements in performance of various file processing algorithms and memory organizations which can be achieved through their use. Retrieval times per word and per page are the parameters used to evaluate the different memory organizations. Performance of hierarchical memory systems using bubble memories are discussed. The unique features of magnetic bubble memories are used in designing algorithms for elementary file processing operations such as sorting and merging and for basic relational algebraic operations.
Evaluation of edge detectors performances with a discrete expression of Canny's criteria
Authors: D. Demigny, F. G. Lorca, L. Kessal
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Three quality criteria have been defined by Canny (1986) to deduce an optimal edge detector in the continuous space domain. In this paper, we give an equivalent for these criteria in the discrete space domain. These new criteria are better in accordance with experimental results than previous one. Furthermore, they are more suitable to compare filters performances. We explain how to compute them. We compare some edge detectors. Finally, we use them to prove the qualities of a new simpler implementation of a second order recursive smoothing filter issued from Canny's theory.
A study of alternative methods for the symbolic calculation of elliptic integrals
Authors: Edward W. Ng, Desanka Polajnar
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This presentation describes the study of several candidate methods for the symbolic integration of a class of irrational expressions R(x,y), where y2 is a polynomial in x and R is a rational function of x and y. Three of these methods came from classical investigations of Legendre, Jacobi, and Weierstrass whereas one came from recent investigations of Carlson. The present paper may be considered a progress report on preliminary algorithmic study and some efforts of implementation on MACSYMA. In this presentation, we describe the study of several candidate methods for the symbolic integration of a class of irrational expressions R(x,y), where y2 is a polynomial in x and R is a rational function of x and y. We shall also summarize some efforts of implementation on MACSYMA.
A microprogram simulator
Authors: Steve Young
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Micro-programming has been defined as an orderly approach to the design of a control section of a computer using control signals arranged in fixed-length words. The control section is the part of a computer which controls the activities of the memories, the central processing unit, the arithmetic unit and the peripheral units. The most elementary operation is called a micro-operation. Such an operation could be a comparison of two registers or a register to register transfer. Some micro-operations have implicit operands which always are used. Others use operands which are expressed explicitly within the control word. Each control word, or micro-instruction, contains one or more micro-operations which are performed in a fixed time interval. The set of micro-instructions required to execute one machine language instruction is called a micro-program. Since many micro-operations can be executed simultaneously, encoded control also allows faster execution of the same algorithms. There are various ways of controlling the sequence of micro-instruction. There are four ways in which a micro-program simulator can assist in developing a read only control memory. First, micro-programs can be debugged before they are manufactured. Secondly, simulation can aid in the resolution of several alternative designs. A third use is in the verification of fault test procedures. Finally, the simulator produces a tested data base which can be used to provide block diagram documentation and to produce input to a machine which manufactures the read only memory.
User Services from an experienced user
Authors: John E. Bennett
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

You, as User Services Professionals, represent the primary source of contact between the University Computer Center and its users, who are primarily students. For a novice user, all you need to do is provide the information he needs to run a simple job, and help if he has problems with the system. A more experienced user expects a lot more from User Services, however. The problem is to provide it in an organized manner, and to know that all aspects of User Services are functioning properly. To aid in this evaluation of your program, I will look at the performance of User Services in three areas. Following this, I present a formal organizational plan which consists of: User Services professionals; student consultants (usually graduate students); faculty; I/O operators (usually undergraduate students); and the Student Chapter of the ACM.
LOCUS a network transparent, high reliability distributed system
Authors: G. Popek, B. Walker, J. Chow, D. Edwards, C. Kline, G. Rudisin, G. Thiel
Venue: ACM SIGOPS Operating Systems Review (1981)

LOCUS is a distributed operating system that provides a very high degree of network transparency while at the same time supporting high performance and automatic replication of storage. By network transparency we mean that at the system call interface there is no need to mention anything network related. Knowledge of the network and code to interact with foreign sites is below this interface and is thus hidden from both users and programs under normal conditions. LOCUS is application code compatible with Unix2, and performance compares favorably with standard, single system Unix. LOCUS runs on a high bandwidth, low delay local network. It is designed to permit both a significant degree of local autonomy for each site in the network while still providing a network-wide, location independent name structure. Atomic file operations and extensive synchronization are supported. Small, slow sites without local mass store can coexist in the same network with much larger and more powerful machines without larger machines being slowed down through forced interaction with slower ones. Graceful operation during network topology changes is supported.
A first course in computer science: What it should be and why.
Authors: Allan Hanson, Kurt Maly
Venue: ACM SIGCSE Bulletin (1975)

We feel that for a long time introductory computer science courses have degenerated into courses more appropriately titled &ldquo;Introduction to the Programming Language X&rdquo; where X has historically been FORTRAN or BASIC and more recently PL/I or APL. In this paper we propose an introductory course which first, and foremost, teaches problem-solving methodology with the final stage of it being translation of an algorithm into a well-structured program. And, second, it achieves this in conjunction with an introduction to the major areas of computer science.
The design, development and operation of an APL-based MIS: The case of a small firm
Authors: Rolland A. Hurtubise, Yves Poulin
Venue: Proceedings of the eighth international conference on APL (1976)

This paper describes the design, development and subsequent operation of a mini-Management Information System (MIS) programmed in APL. The system was produced for a small cosmetics firm. The description includes detailed data base structure and programming considerations, design and development procedures and costs, as well as system operational features. A brief introduction to the MIS concept is also provided.
Simulation for weapons logistics system planning
Authors: William J. Maddocks
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

This study investigates the usefulness of a multi-staged discrete simulation model in combination with an interactive cost model for the development of systems parameters in a naval weapons logistic system environment. The model involves operations at a variety of decision levels and physical stages over the life time of the system. In this initial examination, the content of the storages (pipeline, cycle and safety stocks), the character of the related queues and the level of fulfillment of operational (combat and exercise) needs are the basis for determining the performance rating of the system over its life cycle. Manipulation of storage capacities allows the selection of a &ldquo;best&rdquo; system.
A conceptual framework for the design of Market Simulations
Authors: Girard C. Pessis
Venue: ACM SIGAPL APL Quote Quad (1982)

A conceptual framework for the design of Market Simulations is developed using a systematic modularization concept in APL to allow easy and flexible combination of data entry and computational function. The Framework involves the definition of a Data Bank, an Executive Processor, and a method for defining functional relationships. It combines the power of APL with the ease of application characteristic of specialized simulation languages. Two important features of the conceptual framework are strict adherence to a predefined array syntax for functions representing market components, and a method of modifying simulations involving the use of executable lists. A protocol is developed which employs the syntactical structure of APL, and a demonstration is provided.
In defense of natural language
Authors: Vincent E. Guiliano, Arthur D. Little
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Natural language has evolved to the present point in a way optimally to meet the needs for two-way human communication. This holds both in terms of the general folk argot and the specialized versions of English, German, Japanese, etc. used in scientific, technical and other specialized discourse. Many properties of natural language, such as the frequency distribution of word usage, the use of syntactic nesting, etc. have been much studied in the last twenty years. They seem to serve certain valuable functions in providing a matched communications interface between people, given human's information processing, memory and communicating capabilities. For example, natural language provides adequate redundancy, error detection and correction capabilities, as well as for making best use of limited temporary memory capacity and for enabling communication within limits between individuals with quite different personal memory data bases and cognitive frames of reference.
Some applications of group theoretical programs
Authors: Joachim Neubüser
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

Both special purpose programs and more general systems have been implemented for the study of groups. The special programs were in most cases designed for calculations occurring in the investigation of very big finite groups, such as some of the newly discovered simple groups. The general systems in most cases allow a fairly detailed analysis of comparatively small groups only. Of course, general systems can be used to construct examples for teaching and for testing hypotheses, but often the more detailed structure of smaller subgroups of big groups, e.g., their Sylow subgroups, is needed. Another application of such a system, namely, to the classification of crystallographic groups and lattices in 4-dimensional space will be emphasized.
Information retrieval: the relevant response theory of information storage and retrieval
Authors: P. J. Gleason
Venue: Proceedings of the 1965 20th national conference (1965)

THIS SYSTEM of information storage and retrieval was conceived with the user in mind and attempts to demonstrate how each user may contribute to the effectiveness of information searching. Considering the relative nature of information, how soon after its creation it becomes useful and for how long, the designers of information storage and retrieval systems must increasingly look to its users who, in many cases, are the authors of this information. As information and its resultant knowledge increases, their participation in the information recognition process will become more significant and, with this system, indispensable. In the future, the cooperation of these user-authors, especially in the sciences, may effect new insights into the synthesis of knowledge.
PLATO support at a remote site
Authors: Rex A. Thomas
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Instructional methodology is changing. Technical terms like stimulus-response learning, immediate feedback and behaviorial objectives are finally being associated with the lowest levels of cogntive learning. The new emphasis is on cognition which is based on the processes and structure inherent in learning. In order to meet these requirements we subscribed to the University of Illinois' PLATO System and have not regretted that decision. Over the past three years we have found the system to be inexpensive and reliable and the maintenance and consultation support services to be excellent. The technology of PLATO is advanced far beyond the state of the art of lesson design. Our primary problem is the lack of funding to expand the facilities.
Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues
Authors: Raymond Marie
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Equilibrium state distributions are determined for queues with load-dependent Poisson arrivals and service time distributions representable by Cox's generalized method of stages. The solution is obtained by identifying a birth-death process that has the same equilibrium state distribution as the original queue. Special cases of two-stage (C2) and Erlang-k (Ek) service processes permit particularly efficient algorithms for calculating the load - dependent service rates of the birth-death process corresponding to the original queue. Knowing the parameters of the birth-death process, the equilibrium state probabilities can be calculated straight-forwardly. This technique is particularly useful when subsystems are reduced to flow-equivalent servers representing the complementary network.
W-grammar
Authors: Guy de Chastellier, Alain Colmerauer
Venue: Proceedings of the 1969 24th national conference (1969)

A new type of grammars is presented here, called W-grammars. It is shown how they can be used in translation processes. Examples are taken from the fields of algebraic manipulation and computational linguistics.
Simulation applied to a manufacturing expansion problem area
Authors: J. Douglas DeMaire
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This study uses computer simulation to arrive at a specific answer to a critical problem area in a capital intensive manufacturing environment. A Casting Plant is being expanded due to growth in business. The logistics of the operation are such that an existing service facility, an overhead crane, will have added to its present workload, servicing an additional Casting Unit. Management desired to know what magnitude of crane delays would result from increased task interference as a result of the increased workload on the crane. The answer to this question is crucial since certain types of crane delays generate a loss in casting capacity.
Topological sorting as a tool in curriculum planning
Authors: John G. Meinke, Charles R. Bauer
Venue: ACM SIGCSE Bulletin (1976)

Topological sorting provides a partial ordering for a group of data items for which a partial linear ordering exists. Our use of the topological sorting algorithm has been in the logical organization of curriculum content. Curriculum content can vary from organizing a forty minute lecture to planning a four year sequence of courses. Application of topological sorting to the curriculum content results in a logical organization of the concepts, which may or may not be unique. Users of TOPSORT claim a major time savings in the long run. Backtracking to cover prerequisite concepts in teaching is reduced.
System development corporation
Authors: Harold Sackman
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Everyone talks about the computer user, but virtually no one has studied him in a systematic, scientific manner. There is a growing experimental lag between verified knowledge about users and rapidly expanding applications for them. This experimental lag has always existed in computer technology. Technological innovation and aggressive marketing of computer wares have consistently outpaced established knowledge of user performance&mdash;a bias in computer technology largely attributable to current management outlook and practice. With the advent of time-sharing systems, and with the imminence of the much-heralded information utility, the magnitude of this scientific lag may have reached a critical point. If unchecked, particularly in the crucial area of software management, it may become a crippling humanistic lag&mdash;a situation in which both the private and the public use of computers would be characterized by overriding concern for immediate machine efficiency and economy, and by an entrenched neglect of human needs, individual capabilities, and long-range social responsibilities.