ppxscal/embedding_network huggingface dataset:
Automating introductory computer science courses
Authors: Jurg Nievergelt, Edward M. Reingold
Venue: ACM SIGCSE Bulletin (1973)

This paper describes a project we have recently started for automating introductory computer science courses. Why should these courses be automated? At the University of Illinois there are currently about 2000 students per semester taking various introductory programming courses: engineers, social scientists, teachers, physical scientists, computer science majors, etc., each group having its own particular needs. These courses are taught in sections of about 100 students each, with an additional hour of discussion in groups of about 20 students. In our experience it is very difficult to organize these courses in such a way that students both learn something and are happy with the material presented. The main difficulty seems to come from the fact that a beginning programmer needs a lot of individual help, and this cannot be provided in large sections. We are now convinced that these courses cannot be improved within the current setup, and since enrollments in these courses are increasing, the situation is bound to grow worse unless something new is tried. We assume that the situation we have described is typical of many large universities.
The test language dilemma
Authors: F. Liguori
Venue: Proceedings of the 1971 26th annual conference (1971)

Accompanying the spreading popularity of Automatic Test Equipment (ATE), there has been a proliferation of test languages. These languages attempt to bridge the communications gap between the hardware (test equipment) oriented engineer, who must devise the procedure for testing a Unit Under Test (UUT), and the ATE system which generally is controlled by a computer-like control system. As various test languages evolved from machine-orientation through assembly languages, translators and compilers, each ATE manufacturer developed his own standards for his &ldquo;ideal&rdquo; language. Most have pursued the development of an ATE language and associated processor under the following delusions: The perfect test programming language will provide an easy bridge between engineer and computer, and Having built this bridge, all of the problems plaguing test program production will vanish.
Testing isomorphism of cone graphs(Extended Abstract)
Authors: Christoph M. Hoffmann
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We give algorithms to decide graph isomorphism in a subclass of graphs which we call cone graphs. A cone graph is an undirected graph for which there exists a vertex r which uniquely determines a breadth-first search (BFS) tree. Equivalently, all shortest paths from r to any other graph vertex are unique. Our algorithms may be used either nondeterministically or probabilistically. Used as probabilistic algorithms, they return always a correct answer, but with an expected running time only.
Self-checking alternating logic: Sequential circuit design
Authors: Scott E. Woodard, Gernot Metze
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

There has been considerable study of the tradeoff between improved reliability and additional hardware. An alternative is to trade speed for improved reliability, as in alternating logic, which is based on the successive execution of a function and its dual. In addition to doubling time, this approach involves an increase in hardware which, however, is generally modest compared to the usual hardware redundancy approaches. This paper will explore recent advances in the design of sequential circuits using self-checking alternating logic.
A multiple processor system for real time control tasks
Authors: Pauline Markenscoff
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

The performance of a special purpose multiple processor system with a shared bus for the transmission of output data is studied. A finite population queueing model with Poisson arrivals and services is developed and analyzed. The number of states is found to increase factorially with the number of customers. In the special case of equal arrival and service rates, the model reduces to a simpler one, whose solution is obtained by a recursive technique that reduces significantly the computation time. Under certain conditions, the simplified model provides a good approximation to the throughput predicted by the general model.
An M.S. program in computer science
Authors: M. A. Helkanoff
Venue: ACM SIGCSE Bulletin (1973)

The present paper describes and discusses a proposed M.S. program in Computer Science prepared by the author for the New Curriculum Committee in Computer Science. Although the paper includes many suggestions and comments made by members of the committee, it still does not necessarily represent a final version of the proposed program, and, indeed, one of the motivations for including it at this SIGCSE symposium is to elicit further comments and suggestions.
Information Logistics and Wearable Computing
Authors: Kerstin Heuwinkel, Wolfgang Deiters, Thomas Königsmann, Thorsten Löffeler
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper, we introduce the information logistics concept and demonstrate its relevance for the field of wearable computing. Information logistics is an innovative technology based on the idea that the right information gets to the recipient, e.g. journalist at the right time. The objective is a need- and user-oriented information supply according to just-in-time principles.The Smart-Wear project is a first step towards a personalized, wearable information broker based on the information logistics concept. In this paper, we want to illustrate the complexity of such a project aiming to deliver "information skin-deep". We therefore present the underlying idea as well as the system architecture. We furthermore summarize the experiences and results of the customer study as user acceptance proves to be one of the major tasks of wearable computing due the impact such technologies have on the users.
Simulation of commercial job stream in a multiprogramming scheduling environment
Authors: Gerald N. Pitts, Barry L. Bateman
Venue: Proceedings of the ACM annual conference (1973)

The selection of computing equipment for application to commercial uses is a giant financial step for any company. Justification may sometimes be only the salesmanship of a particular vendor. Many times this has provided a disasterous effect because the machine in reality was unable to handle a specific job stream efficiently. It is far too expensive to try all possible combinations of job stream inputs to check a computer's ability to handle each. Simulation provides a feasible method for trying all combinations of job stream on a particular machine before it is purchased or leased. The purpose of this simulation model was to generate job streams consisting of programs possessing characteristics which are typical of those programs existing in a varied business type application. If specific job stream input is known then the model is able to give a &ldquo;feel&rdquo; for plausibility of a particular machine without running the risk of purchasing the machine in doubt.
Undergraduate education in computing science some immediate problems
Authors: J. Tartar, J. P. Penny
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

The combination of a large number of students and a rapidly developing discipline imposes considerable responsibilities on those charged with providing curricula in computer or computing science. Rather than philosophize about the nature of the discipline itself in this paper, we intend to discuss at a pragmatic level the problems we see at the present time in our own case, and the steps we are taking to resolve them.
A Software Quality Improvement Program
Authors: Donald A. Woodmancy
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

In late 1976, the NCR Corporation undertook a large scale Quality Improvement Program for a major set of systems software. That software set included some 103 separate products totaling 1.3 million source lines. It included several operating systems, several compilers, peripheral software, data utilities and telecommunications handlers. This paper will describe that effort and its results. The research and planning that were done to define the program will be described. The means by which the program was implemented will be discussed in detail. Finally, some results of the program will be identified.
Panel on multimedia computer mail&mdash;technical issues and future standards
Authors: Debra P. Deutsch, Harry C. Forsdick, J. J. Garcia Luna Aceves, Najah Naffah, Andrew Poggio, Jonathan B. Postel, James E. White
Venue: Proceedings of the eighth symposium on Data communications (1983)

A computer-based message system (CBMS) consists of computer facilities that expedite the creation, management, and nonreal time distribution of messages. These systems are increasingly being used for formal and informal communication, supporting the distribution of textual messages. However, nontext media such as voice and graphics are very important for human interaction, and are becoming more and more important in computer system applications. As a result, there is a growing need for the support of media other than text in CBMS. Before standards for multimedia CBMS can be implemented, there are many technical issues that must be addressed. These range from the design of new mechanisms for the distribution of multimedia mail, to the design of tools needed for editing nontext media. This panel will be discussing issues encountered in the development of multimedia CBMS and an outlook for standards for multimedia computer mail.
The hunting of the Snark
Authors: Philip R Chastney
Venue: Proceedings of the international conference on APL (1982)

Consideration of the formal semantics of APL particularised to consideration of the unusual properties of the null expression. It was something of a surprise to discover that these properties had already been fully documented 100 years ago by Lewis Carroll (Cal). Since that opus is not normally a part of the lore of APL, this paper attempts to re-interpret the original findings in 20th century terminology. APL has a number of objects which are, in some sense, null or empty - two empty vectors, multitudinous other empty arrays, undefined objects and local variables with names but no values. There is at least one other null entity. It has no name, and it has no value. Worse yet, it is denoted by the empty string, and is therefore not easily seen.
Simulation vs. optimization in physical distribution planning
Authors: James H. Bookbinder
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The design of a physical distribution system requires decisions on the number, sizes and locations of warehouses. For each warehouse, one must also address the related issues of which products should be stocked there and which customers it should serve. This paper reviews and critiques the two major approaches for physical distribution planning, namely simulation models and optimization models. These are discussed in light of the various management activities in physical distribution planning and operations. Strengths and weaknesses of the two model types are summarized, and ways suggested in which they may be usefully employed together.
Computing personnel turnover: A review of the literature
Authors: Theodore C. Willoughby
Venue: Proceedings of the 1977 annual conference (1977)

In 1972 I summarized the turnover situation in a section of an article in Computing Surveys (Willoughby, 1972). Since most of those comments still apply, they are repeated here. Until 1970 most observers believed that one of the most critical MIS personnel problems was turnover. Published estimates of annual turnover of systems professionals ranged up to 35%. The individual company figures seen by the author ranged from 15% to 35% with the majority about 20%. Is this very high? A comparison with similar industrial workers brings the MIS turnover situation into perspective. Some of the distinctive aspects of MIS personnel are that they are relatively young, averaging under 30 years of age, have had an opportunity for relatively short years of service, are in an exempt managerial status, are in larger companies, and are more often men than women.
Some properties of a probabilistic model for global wiring
Authors: D. Wallace, L. Hemachandra
Venue: Proceedings of the 18th Design Automation Conference (1981)

A probabilistic model is developed to study the process of automatic global wiring for LSI and VLSI chips. The probability parameter for this model is related to the local utilization rate and the channel supply on each global cell boundary. This theoretical relationship is compared with a real example, which agrees well with the theoretical prediction. Using Monte Carlo methods to obtain numerical solutions from the model, the effects of search region size on global routing probability are studied. There seems to be little gain in going more than one or two global cells beyond the minimum rectangle to find a path, regardless of the length of the connection. This conclusion is supported by the observation that the routing probability does not &ldquo;scale&rdquo; very accurately as the dimensions of the problem are increased.
Report of session on structured programming
Authors: Barbara Liskov
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

The session on structured programming was both interesting and lively, and many aspects of structured programming were discussed. Conspicuous by its absence was a debate on the use of goto's; chairman Bob Freiburghouse requested that this topic be avoided, since it has been thoroughly discussed elsewhere. To provide a common frame of reference for the discussion, Barbara Liskov opened the session with a presentation providing a definition of structured programming. The text of the presentation is given in the next section. The remaining sections contain summaries of the most interesting discussions, organized by topics.
What is a first-year computer science graduate student?
Authors: Stephen W. Smoliar
Venue: ACM SIGCUE Outlook (1976)

This is an informal discussion of several problems we have begun to notice in our graduate degree program. As the birthplace of the ENIAC, the University of Pennsylvania has long been a source of computer related courses in its graduate curriculum. With the growth of the undergraduate computer science curriculum, however, several significant problems have developed. In the first place, many of the courses in our graduate program are being overtaken by courses which are now recognized as part of the undergraduate curriculum. As a consequence, we are now faced with a &ldquo;mixed bag&rdquo; of backgrounds in our graduate student body, ranging from those with no background in computers at all, much like our earliest graduate students, to those who have had a full undergraduate computer science program and seek further education.
The IEEE Software Engineering standards process
Authors: Fletcher J. Buckley
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Software Engineering has emerged as a field in recent years, and those involved increasingly recognize the need for standards. As a result, members of the Institute of Electrical and Electronics Engineers (IEEE) formed a subcommittee to develop these standards. This paper discusses the ongoing standards development, and associated efforts.
Engineering applications I: A digital nonlinear function generator
Authors: R. A. Cowan
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

A NONLINEAR FUNCTION GENERATOR is designed to produce the command information for a digital control system where path control is desired in such a manner that a constant velocity along the path is maintained. Included are an error analysis and the synthesis procedure used to obtain a satisfactory design.
On (un)predictability of formal languages (Extended Abstract)
Authors: A. Ehrenfeucht, G. Rozenberg
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

Formal language theory deals with a variety of classes of languages. Some of these are abstracting features of languages used for communication (as e.g., natural languages, programming languages or languages used in logic), some of them are abstracting features of languages used for description of processes (as e.g. basic classes of L languages) and still others are considered for mathematical reasons. Can we have a criterion for deciding whether a language can serve as a &ldquo;communication language&rdquo; (e.g. for man-to-man or man-to-machine communication) ? Our main result (The Basic Unpredictability Inequality) displays a connection between the &ldquo;rate of unpredictability&rdquo; and the relative number of subpatterns occurring in a language. After establishing this result we investigate (as samples) two classes of languages: regular languages and DOL languages
Criteria for computer performance analysis
Authors: Jozo J. Dujomović
Venue: ACM SIGSIM Simulation Digest (1979)

Computer evaluation, comparison, and selection is essentially a decision process. The decision making is based on a number of worth indicators, including various computer performance indicators. The performance indicators are obtained through the computer performance measurement procedure. Consequently, this procedure should be completely conditioned by the decision process. This paper investigates various aspects of computer performance measurement and evaluation procedure within the context of computer evaluation, comparison and selection process based on the Logic Scoring of Preference method. The set of elementary criteria for performance evaluation is proposed and the corresponding set of performance indicators is defined. The necessary performance measurements are based on the standardized set of synthetic benchmark programs and include three separate measurements: monoprogramming performance measurement, multiprogramming performance measurement, and multiprogramming efficiency measurement. Using the proposed elementary criteria, the measured performance indicators can be transformed into elementary preferences and aggregated with other non-performance elementary preferences obtained through the evaluation process. The applicability of presented elementary criteria is illustrated by numerical examples.
Design of simulation experiments
Authors: William E. Biles
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper describes the application of experimental design techniques to computer simulation. Three principal areas of experimental design are considered: (i) factor screening experiments; (2) experiments of comparison; and (3) response surface methodology.
Application generators: Ideas for programming language extensions
Authors: Ellis Horowitz, Alfons Kemper, Balaji Narasimhan
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The continued development of higher order programming languages has not yielded major productivity improvements in the software development process. One often mentioned mechanism for achieving significant orders of improvement are application generators, such as RAMIS, NOMAD, and FOCUS. These systems have been applied to data intensive business applications with phenomenal success. The purpose of this paper is to present the basic components of application generators and show why they yield such large productivity increases in the EDP environment. We investigate the meaning of nonprocedural programming and show how it exists in current application generators. Then we analyze the possibility of extending application generators so that they may be used for non-edp type applications.
Tree-size bounded alternation(Extended Abstract)
Authors: Walter L. Ruzzo
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

The size of an accepting computation tree of an alternating Turing machine (ATM) is introduced as a complexity measure. Tree-size on ATM's is shown to closely correspond to time on nondeterministic TM's and on nondeterministic auxiliary pushdown automata. The later gives a useful new characterization of the class of languages log-space-reducible to context-free languages. Relationships with parallel-time complexity are also explored. ATM computations using at most space S(n) and tree-size Z(n) (simultaneously) can be simulated in alternating time S(n).log Z(n). Several well-known simulations, e.g., Savitch's theorem, are special cases of this result. It also leads to improved parallel-time bounds for many problems, e.g., context-free language recognition in time 0(log2n) on several parallel models.
An internetwork message structure
Authors: Jonathan B. Postel
Venue: Proceedings of the sixth symposium on Data communications (1979)

The focus of this paper is the provision of computer-aided message services between users of computers in a multinetwork environment. An assembly of interconnected networks is called an internetwork. The task at hand is to provide an internetwork computer message service. It can be expected that a large number of message services will arise with some general aspects of equivalent functionality and some will have a few unusual, possibly unique, features. Certainly there will be many distinct user interface models for the human interaction with message systems. For these reasons the internetwork message system suggested here is based on the assumption of a standard for the internal machine-oriented representation of a message and the assumption that a variety of user interface programs will be available. The proposed system provides for the transmission of messages composed of a rigidly defined and structured set of command information fields and an arbitrarily defined and structured message content. Within the content may be transmitted text, facsimile, graphics, or voice data. This paper is based on a more detailed proposal for an internetwork message system [1].
Towards an APL compiler
Authors: E. A. Ashcroft
Venue: Proceedings of the sixth international conference on APL (1974)

A modification of the APL function - calling mechanism allows the compilation of defined functions in many cases.
Sigma 5 Fortran language processor for the Computer Design Language, FIT version I
Authors: Victoria Gehman Evans
Venue: Proceedings of the ACM annual conference (1973)

The Computer Design Language (CDL) proposed by Dr. Yaohan Chu1 can be used to provide a precise description of digital computer elements and their sequential operations. This thesis presents a Fortran language processor for the CDL with complete documentation. The program has been implemented on the SIGMA 5 Computer with 32K words of core memory and a 3 megabyte random access disk. The processor has three major parts, an Executive main program, a Translator and a Simulator. The Executive program provides the communication link between the processor and the outside world, and synchronizes the operations of the Translator and Simulator. The Translator constructs the tables and Polish string needed to implement the system. The Simulator executes programs on this system.
Presentation graphics
Authors: Jerry Martin
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

With the advent of recent software and hardware developments in the microcomputer area it is now economically feasible to produce many different types of graphics using computers. The source of this capability is in the new presentation graphics software and the decreasing costs of microcomputers, printers, plotters, and good-quality RGB monitors. As members of user support groups we will be called on more and more to provide information in this area. One of the best ways in which to become knowledgeable in presentation graphics is to use the technology in our everyday environment.