ppxscal/embedding_network huggingface dataset:
Computer science by TV
Authors: William J. Eccles, Brian G. Gordon
Venue: ACM SIGCSE Bulletin (1976)

Our use of television to teach the first computer science course for computer science majors is an attempt to make sure that the students get the right education. In our case it is not an attempt to enable one instructor to handle a large number of students but rather to handle small groups of students spread throughout the state. As a result of some shortage of computer science faculty, teaching beginners is often considered of lesser importance than other duties. For example, at one college in our state, an instructor with a little programming experience was hired to teach the beginners in computer science. This instructor felt he was well-enough equipped to handle the course. He covered the entire text and taught two languages, Fortran and PL/I. Our experience shows we can't cover two-thirds of that text, and then only in one language. Ours is the first computer science course which our majors take. It presumes no programming experience. It has two goals, to introduce the student to the fundamentals of computer science through a study of algorithms and programming, and to start the student well into PL/I. The course is taught as a one-semester four-credit course which meets five times per week. We made half-hour video tapes under excellent production conditions to cover the material of the course.
A simulation model for assessment of large-scale power system reliability
Authors: John H. Blackstone,  Jr., Gary L. Hogg, Alton D. Patton
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper describes research on the applicability of Monte Carlo simulation to the study of large scale power system reliability. Reliability in this context refers to the ability of the system to meet demand for electricity over time. A generalized program capable of modeling any pool of generators was developed using a modified version of the GASP-IV simulation language. The logic of this program is described and the results of two applications of the program are presented.
A &ldquo;core + modules&rdquo; approach to Fortran standardization
Authors: Walt Brainerd
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The ANSI FORTRAN standards committee X3J3 has adopted a &ldquo;core + modules&rdquo; approach to specifying the next revision of the standard. The motivation for and the projected benefits of this approach are discussed.
A data flow architecture with a paged memory system
Authors: L. J. Caluwaerts, J. Debacker, J. A. Peperstraete
Venue: ACM SIGARCH Computer Architecture News (1982)

During the last ten years, data flow has become an exciting research area and several architectures have been proposed and built. They differ mostly in the way they handle data structures and how they provide mechanisms for token labeling or colouring in order to make data flow graphs reentrant. The paper presents a data flow architecture with a paged memory system to hold both data flow programs and data structures. The token labeling mechanism is coupled with the memory management system in order to provide for each token a unique memory location. The instruction format allows instructions with multiple operands and multiple destinations for each result. Data structures are held in memory while pointers to the structures are circulating as tokens. The proposed architecture is able to execute data flow programs at the level of single instructions or at a higher level.
Multisource illumination shadowing
Authors: K. S. Andonian, S. Toida
Venue: Proceedings of the 15th Design Automation Conference (1978)

Shadow projections from multilight sources in computer-generated 3-D scences are performed in the new transformed space called stereo space with reduced computation. The new transformation has particular applications to raster-scan shading algorithms.
Computer architecture courses in electrical engineering departments
Authors: M. E. Sloan
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper traces the history of computer architecture courses in electrical engineering departments. Previously unpublished data from the Fall 1972 COSINE survey are given to show current computer architecture course offerings and texts. Computer architecture courses offered in 1972-73 are analyzed, compared with ACM and COSINE recommendations, and classified into five categories: introductory computer engineering courses with a computer architecture flavor, software-oriented computer organization courses, hardware-oriented computer organization courses, case study courses, and topical seminars. Future trends in computer architecture education are predicted.
Capacity degradation of packet radio fading channels
Authors: J. Schwarz daSilva, S. Mahmoud
Venue: Proceedings of the sixth symposium on Data communications (1979)

A mathematical model is developed to determine the probability of successful transmission of a packet over a fading land mobile data channel. The model is further extended to packet radio channels and the throughput degradation of three random access schemes is analyzed. A relationship between throughput degradation and distance from the base station is finally derived and numerical results presented.
Horn clauses and database dependencies (Extended Abstract)
Authors: Ronald Fagin
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

In the last year or so, a number of generalizations of these dependencies have appeared: Nicolas's mutual dependencies [Ni], which say that a relation is the join of three of its projections; Rissanen's and Aho, Beeri, and Ullman's join dependencies ([Ri], [ABU]), which generalize further to an arbitrary number of projections; Paradaens' transitive dependencies [Pa], which generalize both FDs and MVDs; Sagiv and Walecka's subset dependencies [SW] which generalize embedded MVDs; and Sadri and Ullman's template dependencies [SU], which generalize embedded join dependencies. The purpose of this paper is to help bring order to the chaos by presenting certain mathematical properties shared by all of these dependencies. In Section 2, we introduce the concept of &ldquo;faithfulness&rdquo; (with respect to direct product), and show that IDs and EIDs are faithful, whereas slight variations are not necessarily faithful. In Section 3, we discuss &ldquo;Armstrong relations&rdquo;, which were known to exist in certain special cases (such as when the only sentences of interest were functional, multivalued, and join dependencies).In Section 4, we discuss finite Armstrong relations.In Section 5, we present some more counterexamples about the existence of Armstrong relations. In Section 6, we discuss projections of classes of relations. Although Zaiddan [Za] showed that projections of FD classes are not necessarily FD classes, it turns out that projections of FD classes (and, even more, of ID classes) are ID classes. In Section 7, we discuss certain extensions of our results.
Universal games of incomplete information
Authors: John H. Reif
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We consider two-person games of incomplete information in which certain portions of positions are private to each player and cannot be viewed by the opponent. We present various games of incomplete information which are universal for all reasonable games. The problem of determining the outcome of these universal games from a given initial position is shown to be complete in doubly-exponential time. We also define &ldquo;private alternating Turing machines&rdquo; which are alternating Turing machines with certain tapes and portions of states private to universal states. The time and space complexity of these machines is characterized in terms of the time complexity of deterministic Turing machines, with single and double exponential jumps. We also consider blindfold games, which are restricted games in which the second player is not allowed to modify the common position. We show various blindfold games to have exponential space complete outcome problems and to be universal for reasonable blindfold games. We define &ldquo;blind alternating Turing machines&rdquo; which are private alternating Turing machines with the restriction that the universal states cannot modify the public tapes and public portion of states. A single exponential jump characterizes the relation between the space complexity of deterministic Turing machines.
SIGCAS (Panel Session)
Authors: Robert P. Abbott, Wayne Bouchet, Roland Eppley,  Jr. Randolph Lively
Venue: Proceedings of the 1976 annual conference (1976)

During the last decade electronic funds transfer systems (EFTS) technologies have developed from armchair discussions of &ldquo;checkless/cashless&rdquo; societies to the less glamorous, but more concrete implementation of specific technologies such as credit verification systems, automatic tellers, and electronic transfer of credit card drafts. The panel will discuss the problems and prospects of EFTS from a variety of viewpoints.
Process backup in producer-consumer systems
Authors: David L. Russell
Venue: ACM SIGOPS Operating Systems Review (1977)

System state restoration after detection of an error is discussed for producer-consumer systems, with emphasis on the control of the domino effect. Recovery primitives MARK, RESTORE, and PURGE are proposed that, in conjunction with the use of SEND-RECEIVE interprocess communication primitives, allow bounds to be placed on the amount of unnecessary restoration that can occur as a result of system state restoration.
A network computer for distributed software research
Authors: Thomas W. Christopher, Philip J. Hatcher
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The implementation of a network computer supporting a reconfigurable tree of processes and using off-the-shelf microcomputers is described.
Adaptable user interfaces for portable, interactive computing software systems
Authors: R. Evans, N. J. Fiddian, W. A. Gray
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

In the context of this paper a computing software system consists of a database, an associated user interface which allows users to analyse the data and the routines or programs which implement the analytic functions available through the user interface. It is assumed that the complete system - source code and data - already exists in a form which is as easily portable as possible between different computer environments. For such systems adaptability is the problem of adjusting the user interface and analytic capabilities to suit different user communities when such a system is transferred from one environment to another. This may include adaptation to specific hardware facilities as well as user requirements.In 1977/8 the International Planned Parenthood Federation (IPPF) funded a project at University College Cardiff to implement a portable computing software system originating from the Population Dynamics Group (PDG) at the University of Illinois. This system allowed users to perform population projections under different demographic conditions showing in a graphical presentation how the population of a country varies over selected time spans. The database consisted of population statistics for a number of countries. When implemented at Cardiff it was intended that this system should be used as a demographic training aid by the post graduate diploma students in the David Owen Centre for Population Growth Studies. These students are an international group who are specialists in the field of demography but have little or no computing background.This paper will discuss briefly how this portable system was implemented on a PDP 11 minicomputer at Cardiff and then give a fuller description of the adaptation of the user interface and analytic capabilities to the local community and its computer facilities. General conclusions will be drawn as to how such systems should be written so as to ease the problems of adaptability.
MSI and LSI impact on digital systems testing
Authors: Hubert H. Huang
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Basically, there are two approaches to testing digital networks, namely, functional and structural. There are few available publications dealing with functional testing methods. This is due mainly to the lack of a universal algorithm for testing networks that function differently. Moreover, functional testing usually does not yield a complete test of a given network, therefore it does not have as much academic value as structural testing. In this paper a few functional testing techniques are briefly described. They are heuristic methods used in the computer industry mainly for trouble-shooting purposes. Structural testing has recently been summarized by Professor Susskind. It is the purpose of this paper to show recent testing techniques and to indicate the need for inclusion of self-testing capabilities to chips during the fabrication process.
A micro controlled peripheral processor
Authors: E. T. Barron, R. M. Glorioso
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper discusses the design and construction of a micro controlled mini-computer used as peripheral processor unit for the PDP-11/20 in the Electrical and Computer Engineering Laboratory at the University of Massachusetts at Amherst. The instruction set for this computer is determined by the micro code in a read only memory (ROM) and is therefore flexible: Changing the ROM results in a different set of machine instructions. The instruction set currently implemented while general purpose in nature, has been chosen so that the machine can function as a Graphics Processor Unit (GPU). The GPU can run concurrently with the PDP-11 and process display files in the PDP-11's virtual memory space of 64K1,2.
A systems implementation language for small computers
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper concerns the development of a family of higher level languages which are to serve as the target languages in the decompiling of assembler coded modules of small computer operating systems. The main objective is the design of a machine independent language to serve as the nucleus of these higher level languages, each of which will ultimately have to possess characteristics unique to the operating system for which it was designed. The work involved in the development of the nucleus language is part of a research effort intended to show that debugged assembler coded systems programs for a specific class of byte-oriented machines can be concisely represented in a higher level language and that this higher level representation can be easily moved from one machine in this class to another. It is our primary purpose here to describe the main features of the nucleus language, and, where space permits, to suggest some of the reasons why these features were included.
F.I.S.H.: Factors, interactions, and support for humans
Authors: Russell L. Brand
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Computers make people feel dumb. With the progress in both software engineering and artificial intelligence, people expect that computers should be easy to use. Further, with modern advertising, many people think that computers are easy to use, until they try to use them and fail miserably. Since they know computers are easy to use, are friendly, and the wave of the future, they feel dumb, old-fashioned, and that they are slow learners.
Application of APL for rapid verification of a digital system architecture
Authors: Behrooz Parhami
Venue: Proceedings of seventh international conference on APL (1975)

An instruction set for a special-purpose associative processor, designed for information storage and retrieval applications, is defined in APL/360. These definitions are then used to test the validity of the system's architecture for the proposed applications. This is accomplished by writing and simulating the execution of sample programs on a sample data set and selectively observing the corresponding transformations performed on the data set.
ICAD/PCB: Integrated computer aided design system for printed circuit boards
Authors: Hiroshi Shiraishi, Mitsuo Ishii, Shoichi Kurita, Masaaki Nagamine
Venue: Proceedings of the 19th Design Automation Conference (1982)

The advanced computer aided design system, ICAD/PCB, was recently put into operation at Fujitsu. The system provides designers with powerful tools to significantly lower the cost and the time required to design and manufacture printed circuit boards (PCBs). Interactive and automatic facilities to support the entire PCB design process are integrated in the ICAD/PCB system.
Measuring energy consumption in VLSI circuits: A foundation
Authors: Gloria Kissin
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Energy conservation is a key question in today' s society and the proliferation of VLSI circuits encourages an energy conscious approach to their design. Although a single chip at current densities may consume less than one watt of power, assembling larger and larger systems with these chips results in significant energy costs [Me 80]. Moreover, energy consumed by a circuit is dissipated, typically by convection, as heat. The heat dissipated is proportional to the energy consumed. Increased densities in planar technologies and the possibility of 3-dimensional technologies, therefore, increase the need to reduce the amount of heal. produced. The intent of this paper is to lay the ground work for measuring the switching energy consumed in VLSI circuits. Intuitively, switching energy measures the area -&-ldquo;used-&-rdquo; to effect a computation. A wire or gate consumes switching energy when it changes staie from 0 to 1 or from 1 to 0. Some technologies consume more than switching energy. For example, nMOS dissipates DC power [MC 80]. CMOS, however, consumes only switching energy [MC 80]. Switching energy is thus a lower bound on total energy, and is alternately termed -&-ldquo;energy-&-rdquo; throughout this paper. In this paper, two energy models are developed, Model 1, the Uniswitch Model (USM), assumes that a wire or gate in an acyclic circuit can switch at most once. In particular, wire delays are neglected, the affects of different path lengths are neglected (ie. circuits are synchronous [Sa 76]), and all inputs are assumed to arrive together. Model 2, the Multiswitch Model (MSM), is more sensitive to timing issues that can cause wires and gates in an acyclic circuit to switch more than once. The rest of this paper is organized as follows. Section 2 defines the energy models. In section 3, a class of restricted acyclic circuits is defined. Lower and upper bounds for worst case energy are obtained for these circuits. An -&-Ohgr;(area) lower bound is obtained for acyclic monotone circuits. In section 4, average energy bounds are obtained for the restricted circuits.
Active Face and Feature Tracking
Authors: Luis Jordao, Matteo Perrone, Joao Paulo Costeira, José Santos-Victor
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a method for the detection and tracking of human face and facial features. Skin segmentation is learnt from samples of an image. After detecting a moving object , the corresponding area is searched for clusters of pixels with a known distribution. Since we only use the hue (color) component this process is quite insensitive to illumination changes. The face localization procedure looks for areas in the segmented area which resemble a head. Using simple heuristics, the located head is searched and its centroid is fed back to a camera motion control algorithm which tries to keep the face centered in the image using a pan-tilt camera unit. Furthermore the system is capable of tracking, in every frame, the three main features of a human face. Since precise eye location is computationally intensive, an eye and mouth locator using fast morphological and linear filters is developed. This allows for frame-by-frame checking, which reduces the probability of tracking a non basis feature, yielding a higher success ratio. Velocity and robustness are the main advantages of this fast facial feature detector.
Faculty orientation program
Authors: Adrienne Critcher
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

There are two sides of the coin in any aspect of academic services. Benefit is derived by the one being served in learning how to use certain facilities more efficiently and effectively. On the other side of the coin, benefit results for the one who is serving in that it is much easier and more enjoyable to serve an informed client. Our university library has been aware of this fact for some time. Each fall, all new faculty members attend an orientation program in the library that acquaints them with the organization of and services available from the library. But the university computation center clearly rivals the university library in use by faculty in both research and instruction, and computation-center policies and procedures probably vary much more across campuses than do library policies and procedures. We have found this to be especially true as our center is a Honeywell site and most of our users arrive without prior Honeywell experience. Therefore, in the spring of 1978, we began developing a Computation Center Orientation Program for new faculty members to be implemented in the fall, 1978. Our basic plan was to offer separate sessions for the novice users and the experienced users, and, for the first year, to extend the program to include the entire faculty.
APLGOL-2 a structured programming language system for APL
Authors: Robert A. Kelley, John R. Walters
Venue: Proceedings of the sixth international conference on APL (1974)

APLGOL-2 works in conjunction with an APL system to provide structured programming facilities for APL. As a continuation of the original APLGOL work, it contains changes and additions to the APLGOL language. APLGOL procedures may exist in the same workspace as regular APL procedures, and they may be created or modified in the same way as regular APL procedures with approximately equivalent storage requirements and performance.
Alert - a systems management process
Authors: Andrew D. Tidwell
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

This paper describes a systems management technique used by the Information Systems organization at IBM's Santa Teresa Laboratory. Described is the complexity of the user requirements and the management process used to deliver those requirements from the data processing center. Included is a discussion of the concept of service level commitments and management awareness through various reporting and review techniques. This process is called availability management, which is referred to as ALERT.