ppxscal/embedding_network huggingface dataset:
Accommodating disparities in secondary school backgrounds in the university environment
Authors: Jane M. Fritz
Venue: ACM SIGCSE Bulletin (1984)

Exposure to computers in high school has become a widespread phenomenon, with several schools actually offering an integrated computer curriculum throughout grades K-12. Because of the urgency of needs and the quickness with which these programs are implemented, as well as the lack of a well-tried standard to follow, the students coming out of these programs have every manner of experience. The resulting differences in the background of entering university students has created a need for an enriched introductory course. However, assessing the preparedness of students for such a course presents its own difficulties. This paper describes a placement test being used at the University of New Brunswick to evaluate the knowledge of incoming students to determine those who have been adequately prepared for an enriched course. The placement test, including an initial analysis of the placement test as a predictor, is discussed.
Simulation experiments of a tree organized multicomputer
Authors: J. Archer Harris, David R. Smith
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

The paper describes the results of simulation experiments of a tree organized multicomputer now being constructed in the Department of Computer Science at Stony Brook. First the structure of the multicomputer is introduced. This is based on, (i) separate local memories, (ii) a tree organization mirrored on that of social structures, and (iii) a distributed file system. The simulation studies were designed to illuminate the performance of the multicomputer when cooperating on the solution of selected single computational tasks. The results showed (i) the potential for an order of magnitude increase in the number of cooperating processors before performance saturation effects make themselves felt, (ii) a high frequency of processor resets relative to the completion time of the composite job, and (iii) a lower utilization of processors near the root of the tree relative to those near the leaves. The implications of these results for the design of the hardware and software of this multicomputer are discussed in a conclusion.
TENEX, a paged time sharing system for the PDP-10
Authors: Daniel G. Bobrow, Jerry D. Burchfiel, Daniel L. Murphy, Raymond S. Tomlinson
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper appears in the March, 1972, issue of the Communications of the ACM. Its abstract is reproduced below. TENEX is a new time sharing system implemented on a DEC PDP-10 augmented by special paging hardware developed at BBN. This report specified a set of goals which are important for any time sharing system. It describes how the TENEX design and implementation achieve these goals. These include specifications for a powerful multiprocess large memory virtual machine, intimate terminal interaction, comprehensive uniform file and I/O capabilities, and clean flexible system structure. Although the implementation described here required some compromise to achieve a system operational within six months of hardware checkout, TENEX has met its major goals and provided reliable service at several sites and through the ARPA network.
Computer science for liberal arts colleges a report of a workshop held at Wheaton College, Wheaton, Illinois july 12-14, 1972
Authors: R. Waldo Roth
Venue: ACM SIGCSE Bulletin (1973)

In response to interest expressed at the second SIGCSE symposium in St. Louis in March, 1972, on the subject of computer science education appropriate for the liberal arts college, a workshop was held at the campus of Wheaton College, Wheaton, Illinois, July 12-14, 1972. The object of the workshop was to involve representatives from liberal arts colleges in a discussion of computer science curricula that would be relevant for such schools. In the past most of the work on computer science curricula has been done by representatives from large universities, and there has been some question as to whether such a committee could deal effectively with the problems of limited resources and talent that characterize computer science in most liberal arts colleges.
A self routing Benes network
Authors: David Nassimi, Sartaj Sahni
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for an N input/output self routing network is O(log N). This network is capable of performing a large class of permutations. If the switches are set externally, then all permutations can be performed.
PRO - an automatic string placement program for polycell layout
Authors: G. Persky
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper describes an automatic string placement program used to reorder cells in polycell rows such that channel routing in the adjacent channels (a) is not blocked by cyclic constraints, and (b) needs fewer routing tracks. The program utilizes cell reflections and pairwise neighbor exchanges, simultaneously monitoring both the channels immediately above and below the row being reordered. Reductions of 25% in the number of required routing tracks are commonly obtained.
A portable APL translator
Authors: A. Andronico, G. Leoni, E. Luciani
Venue: Proceedings of seventh international conference on APL (1975)

a portable system for translating APL programs into programs in an assembler language is presented; the translation is performed in two steps; in the first step the APL program is translated into a program in an intermediate language which can be used as a documentation of the program itself; the second step consists in defining the intermediate language in terms of pre-defined routines in the assembler language. The implementation of the system has been performed by means of the macro-processor STAGE-2.
Automatic programming and compilers I: External language KLIPA for digital computer URAL-2
Authors: M. Greniewski, W. Turski
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE KLIPA Digitalizing Translator of Address Parameters is an assembling and readdressing program which replaces inscriptions by their numerical values. KLIPA is used for automatic performance of the following: (1) Assembling of separate pieces of a program together. (2) Selecting and including desired standard and library subroutines into the main program. (3)Assembling of sections of the main program. (4)Calling proper sections of the program. (5)Transfer to and from the auxiliary storage.
Extending a facility training program to include a minority skills training program
Authors: Mel D. Ray
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

The Stanford Linear Accelerator Center (SLAC) is a laboratory performing basic research in high-energy physics, operated by Stanford University under contract to the Atomic Energy Commission. The major computer system at SLAC is an IBM 360 Model 91 operating under the multiple-variable tasking option of IBM's operating system. The goal of the Computer Facility is to provide the best possible service for a wide range of users with diverse requirements. Because of the large size of the Computer Facility and the varied requirements of the users, a staff of 45 individuals, including 3 managers, 16 professionals, and 24 technicians and clerks is needed to support the operation. This paper is an exposition of how this facility has developed a training program for computer operations personnel with particular emphasis on the employment of unskilled individuals from a minority group.
Computer literacy objectives for junior high school students
Venue: Proceedings of the ACM 1980 annual conference (1980)

While ten years ago computer literacy was an unknown phrase, it now has an accepted place in the vocabulary of both educators and computer scientists. The concept of computer literacy has grown rapidly and many related issues remain unresolved. For instance: what do various types of people need to know about computers? How should they be instructed in computer awareness and computer based problem solving? How should computer education be offered to students and others? The Minnesota Educational Computing Consortium (MECC) recently received funding from the National Science Foundation to design, develop, test and evaluate an integrated set of twenty-five student learning modules for science, mathematics and social studies courses in secondary schools. The central theme of these learning packages will be the computer&mdash;how it works, how it is used, its impact on the individual and society, and the implications of its use for the future. The project presumes that abilities, skills, attitudes, and cognitive learning are all aspects of a person's computer literacy; the learning packages will be based on a set of learning objectives that reflect these areas. The materials will be written for students entering junior high school, however, they could be used at other secondary school levels as well. The initial period of the project consists of planning and the specification of objectives.
Functional simulation and fault diagnosis
Authors: Miroslaw Malek, Ajoy K. Bose
Venue: Proceedings of the 15th Design Automation Conference (1978)

Some aspects of the application of functional simulation to fault diagnosis are discussed. A technique for functional simulation that preserves a high level of accuracy is described. Applicability of this method to fault simulation and diagnosis is shown by presenting an approach to diagnostic testing and giving an algorithm for test point placement. The compatibility of the functional simulation technique and the partitioning of the system for diagnosis is indicated.
Analysis simulation of an advanced inertial stabilization concept
Authors: James L. Baumann, Mark D. Dixon, Dallas W. Russell
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The Internal Bearing Stabilized Sighting Unit (IBSSU) is an innovative concept in precision stabilization for high resolution electro-optical sensors mounted in high disturbance vehicle environments. It is an inertially stabilized platform supported by &ldquo;soft mount&rdquo; isolators to reduce the effects of vehicle vibration and gunfire on the performance of the sensors. The unit was analyzed and a simulation program written to aid in the evaluation of this advanced inertial stabilization concept. IBSSU is described and the equations of motion showing the coupling between translational and angular motion are listed. The simulation program is used to compute the platform response to disturbance inputs. IBSSU laboratory test data are used to validate the model.
A survey of introductory and advanced programming courses
Authors: Andries van Dam, Charles M. Strauss, Clement McGowan, Jean Morse
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

In the process of establishing equitable and practical computer time allocations for our computer science courses this fall, we compared our seemingly high request with standards in other universities. Twenty-three private and state universities were chosen for the comparison and a questionnaire (appendix 1) was designed to elicit information about large introductory programming courses and more specialized systems programming/software engineering courses. The scope of the 25 item questionnaire covers course organization (size of class, number of meetings a week), course content (proficiency expected, languages used, size of programs written), and course budget (computer dollar allocation/ student, equipment and operating system used).
An automatic tutor for introductory programming students
Authors: Ronald L. Danielson, Jurg Nievergelt
Venue: ACM SIGCSE Bulletin (1975)

This paper discusses an automatic tutor of programming, implemented on the PLATO IV CAI system [1] as a part of an automated instructional system for computer science being developed at the University of Illinois [8]. This tutor exposes the introductory student to structured programming concepts and top-down problem solution techniques by means of example. The student develops (on-line, using an approach based on stepwise refinement [11]) a solution to a single, relatively complex programming problem (symbolic differentiation of a polynomial). Student and tutor engage in an interactive dialogue during this problem-solving process, the tutor providing hints regarding solution steps, and comments about program structure and efficiency. A small sample of the types of responses the tutor might make is presented
The heuristic synthesis of applications-oriented microcode
Authors: A. M. Abd-alla, D. C. Karlgaard
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper describes an algorithm for the synthesis of applications-oriented microcode for a dynamically microprogrammable computer. The need for such an algorithm is expressed by Reigel, Faber, and Fisher as an integral step in the solution of the tuning problem, or the problem of modifying a system architecture in order to optimally solve a given problem. This modification of architecture takes place through synthesis of microprograms that are stored in writable control storage. Writable control storage permits each class of user application programs to execute with a specialized instruction set, or architecture. A synthesis algorithm provides a method for generation of these specialized architectures. The required synthesis algorithm should be autonomous, should not require apriori knowledge of user application, and should be adaptable to day-by-day changes in user problems. Current attempts at tuning architectures can be considered as manual tuning. Heuristic tuning is suggested as an automization of the manual tuning process. Several phases of heuristic tuning are summarized. The architecture synthesis phase is considered in depth and an algorithm for microprogram synthesis is given. Several examples of the synthesis algorithm are presented and the expected execution improvements are shown.
Social science computing (Paper Session): Tools for policy making and education
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This session is concerned with two distinct but related areas of social science computing: the education of social scientists in computing techniques, and the construction and use of aggregate models by social scientists for guiding national economic policies. Two papers are presented that describe recently developed application systems designed to perform the above tasks. For perspective, each paper is followed by a brief background presentation of the subject area by an expert in the field including a discussion and critique of the work presented.
Counterparts of variance reduction techniques for Quasi-Monte Carlo integration
Authors: Bennett L. Fox
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Quasi-Monte Carlo integration, when applicable, has an order of magnitude smaller error bound than standard Monte Carlo. For the former we consider analogs of variance reduction techniques for the latter and discuss their effectiveness. The results are applicable to stochastic programming and stochastic networks, for example. A May 1983 technical report by the same title is available from the author.
Simulation of waiting line systems with queue length dependent parameters
Authors: Irwin Greenberg, Susan Heimrath
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A queueing system is simulated in which the arrival and service rates are functions of the number of customers in the system. This type of system has been suggested as being more representative of real queueing situations than is the usual &ldquo;simple&rdquo; queue with constant arrival and service rates. A modification of the &ldquo;time of next event&rdquo; simulation method is required since an arrival to the queue changes the distribution of residual service time of the customer being served and the departure of a customer changes the distribution of the time of the next arrival. The primary purpose of the simulation is to examine the statistical problems involved in estimating the system parameters.
The computer science laboratory
Authors: Richard H. Eckhouse,  Jr.
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

Laboratory facilities as part of Computer Science departments can easily be categorized as either sufficient, or non-existent. There is no middle ground, either you are a &ldquo;have&rdquo; or you are a ldquo;have-not&rdquo;. What is the reason for this apparent split? Is it economic considerations, lack of justification, poor planning, supplemental sources, or just a quirk of fate? The answer seems to be a combination of all of these reasons and forces us to ask the more important question, &ldquo;Does Computer Science require laboratory facilities?&rdquo; I think the answer is clearly yes and not only do I hope to show what the need is, but I also hope to show one way of developing a laboratory to meet this need. In fact, I shall conclude this paper with a discussion of the situation at the University of Massachusetts showing how we are attempting to develop the laboratory along with our department.
A new look at fault tolerant network routing
Authors: Danny Dolev, Joe Halpern, Barbara Simons, Ray Strong
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing &rgr; for the network (a fixed path between each pair of nodes) must be chosen without any knowledge of which components might become faulty. Choosing a good routing corresponds to bounding the diameter of the surviving route graph R(G,&rgr;)/F, where two nonfaulty nodes are joined by an edge if there are no faults on the route between them. We prove a number of results concerning the diameter of surviving route graphs. We show that if &rgr; is a minimal length routing, then the diameter of R(G,&rgr;)/F can be on the order of the number of nodes of G, even if F consists of only a single node. However, if G is the n-dimensional cube, the diameter of R(G,&rgr;)/F&le;3 for any minimal length routing &rgr; and any set of faults F with |F|<n. We also show that if F consists only of edges and does not disconnect G, then the diameter of R(G,&rgr;)/F is &le; 3|F|+1, while if F consists only of nodes and does not disconnect G, then the diameter of R(G,&rgr;)/F is &le; the sum of the degrees of the nodes in F, where in both cases &rgr; is an arbitrary minimal length routing. We conclude with one of the most important contributions of this paper: a list of interesting and apparently difficult open problems.
A study of queueing networks with deterministic service and applications to computer networks
Authors: J. Labetoulle, G. Pujolle
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

We consider packet-switching network as a queueing system with constant service times: that means that the lengths of the packets are equal. We study such a network by isolating a particular path, that we consider as a tandem system of queueing. Two aspects of the question will be examined: 1 - The study of the response time of such a system 2 - The study of the throughput of such a system when introducing the notion of time-out for each packet. The results we obtained show that when neglecting the interferences between paths the response time is independent of the order of the stations. The control policy we examined prove the necessity to have a limited memorisation capacity at each node of a packet-switching network. These results confirm the intuitive options taken in a network like CYCLADES.
Optimum reduction of programmable logic array
Authors: T. C. Hu, Y. S. Kuo
Venue: Proceedings of the 20th Design Automation Conference (1983)

We consider the optimum PLA column folding problem where vertices in the column intersection graph are first partitioned into two parts. Both upper and lower bounds on the size of the folding are given in terms of the number of edges and vertices in the bipartite graph G. Efficient polynomial optimum algorithms are given for the case that G is a tree and other cases. A heuristic algorithm with error bound is given for a general bipartite graph. A new graph model is introduced. We also study one-cut bipartite folding, AND-OR-AND row folding, and the general partitioning problem.
Robotic Wheelchair Observing Its Inside and Outside
Authors: Yoshinori Kuno, Satoru Nakanishi, Teruhisa Murashima, Nobutaka Shimada, Yoshiaki Shirai
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We proposed a robotic wheelchair which can be controlled by turning our face in the direction where we would like to go. Although it can be used easily, there is a problem that unintentional movements of our face may interfere the wheelchair motion. This paper presents our new robotic wheelchair improved by observing its inside and outside, i.e., the user and the environment. It effectively integrates autonomous capabilities and the interface by face direction. It uses the sensor information obtained for autonomous navigation to solve the problem with the control by face direction. Also, if it can understand the user's intentions from observing the face, it chooses an appropriate autonomous navigation function to reduce the user's burden of operation. When the user is off the wheelchair, the user becomes a part of the outside. In this case, it detects the user by recognizing his/her face. Then it can move according to the user's commands indicated by hand gestures. This paper describes our design concept of the robotic wheelchair and shows our experimental system with operational experiments.
Sufficient test sets for path analysis testing strategies
Authors: Steven J. Zeil, Lee J. White
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Many testing methods require the selection of a set of paths over which testing is to be conducted. This paper presents an analysis of the effectiveness of individual paths for testing predicates in linearly domained programs. A measure is derived for the marginal advantage of testing another path after several paths have already been tested. This measure is used to show that any predicate in such programs may be sufficiently tested using at most m+n+1 paths, where m is the number of input values and n is the number of program variables.
An analytic model of CP-67 - VM/370
Authors: Yonathan Bard
Venue: Proceedings of the workshop on virtual computer systems (1973)

The paper describes an analytic model of CP-67 - VM/370 (1, 2). Each user (virtual machine) on the system is in one of four states (see Figure 1): dormant (&ldquo;Console&rdquo;), receiving interactive service (&ldquo;Q1&rdquo;), waiting for batch service (&ldquo;Queue&rdquo;), or receiving batch service (&ldquo;Q2&rdquo;) The users receiving batch service form the multi-programmed set, and are described by a cyclic queuing network of the Gordon-Newell type (3,4,5). The effect of interactive users is treated by assuming that a fixed portion of system resources is dedicated to them. In order to solve this queuing problem for a given multi-programming level it is necessary to have information on the ratio of channel to CPU busy times. Some of the channel requirements are due to paging, and hence it is necessary to have a characterization of the paging rate vs. memory requirements of various programs.