ppxscal/embedding_network huggingface dataset:
A laboratory for a computers and programming course
Authors: Henry R. Bauer, Richard L. Oliver, David E. Winkel
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

The computer organization and assembly language course is part of most of computer science undergraduate curricula. With the advance of microcomputers into small business and engineering firms even management information systems and engineering majors are enrolling in this course. The work described here began in 1978 to upgrade this sophomore course in computer fundamentals. The goal was to make the small computer an integral part of the course's laboratory. The task was to create a laboratory providing hands-on computing to reinforce concepts in the areas of 1. computer organization, assembly language programming, and architecture; 2. computer operation; 3. hardware/software interfaces; and 4. operating systems. To accomplish these goals, the three phases of the project were in hardware, software, and curriculum development. Before the project began, the course reflected the outline of curriculum course B2 [1]. The topics covered included the assembly process with one and two pass assemblers; the use of absolute and linking loaders; computer architectural details of register, memory, and CPU organization; addressing schemes; and input/output programming. Although these topics are satisfactory, our methods of teaching them were not. We used the University's main computer, the Xerox Sigma 7, for the laboratory portion of the course. The Sigma 7's operating system shielded the student from the computer architecture. The system posed difficulties of varying degrees in the presentation of most of the topics and prevented any real understanding of input/output programming. Attempts to simulate input/output for the students met with unenthusiastic responses.
Issues of correctness in database concurrency control by locking
Authors: Mihalis Yannakakis
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Our aim in this paper is to show that there is a mathematically inherent reason why existing systems enforce D-serializability (rather than just because of its simplicity): it is because they are based on locking. Our main result is a characterization of the power of locking which states that if a locking policy is safe then it must allow only D-serializable schedules. Furthermore any such schedule can be produced by some safe locking policy. The rest of the paper is organized as follows. In Section 2 we formalize our concepts and describe the model. In Section 3 we characterize D-serializability in semantic terms. In Section 4 we examine when a set of transactions can be let to run safely by themselves without locking or any intervention from the scheduler. Section 5 is concerned with locking policies and in Section 6 we discuss some implications of our results.
Cooperating input and output stack processors
Authors: Cory F. Skutt
Venue: ACM SIGAPL APL Quote Quad (1983)

As a complement to an enhanced input stack processor (ISP), an output stack processor (OSP) has been produced that captures output lines from VSAPL, places them on a stack, and makes them available to an APL application through the shared variable interface. Together, these processors provide three fundamental facilities: execution of system command sequences; error and exception handling; and retrieval of information not available through system variables. This presentation discusses the objectives, challenges, design and applications of these processors. A brief comparison of error-handling capabilities is included.
K-lossless sequential machines of maximum order
Authors: Everald E. Mills
Venue: Proceedings of the ACM annual conference (1973)

A finite state sequential machine is said to be k-lossless, or information lossless of order k, if a knowledge of the initial state and first k output symbols is always sufficient to uniquely determine the first input symbol. For n-state sequential machines, the value of k is such that l &le; k &le;&frac12; n(n - l) + l &equil; kmax. It has been shown that machines of order kmax can be constructed if the output alphabet contains 6 symbols.1 In this paper, it is shown that for binary output machines, the maximum value of k is strictly less than kmax.
The concurrent simulation of nearly identical digital networks
Authors: E. G. Ulrich, T. Baker
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Injecting a single fault into a fault-free digital network creates a &ldquo;bad&rdquo; network which is only slightly dissimilar from the original. Injecting the same stimuli (signals) into both of these networks will produce activity sequences which are often identical, normally almost identical, and rarely substantially different from each other. This similarity between good and bad networks and their activities suggests a method of simulation which avoids the customary duplication of essentially identical good and bad simulations. This method consists of simulating good network activity, and of initiating and performing a concurrent bad network simulation only if bad network activity actually differs from good activity. The run time savings inherent in this method are substantial if hundreds or thousands of bad networks can be simulated in concurrence with a single good network. FANSSIM II is a digital logic simulator under development capable of simulating a 2500 gate network in concurrence with approximately 10,000 single-fault networks. The storage requirements for this simulation are estimated to remain under 450,000 bytes. The effective simulation rate is expected to be above a million signals/dollar, exceeding the real simulation rate of 20,000 signals/dollar for the IBM 360-50 by a factor of 50:1. Some of the techniques and features used are the following: &bull; Fault sources are detected during good network activity and trigger the initiation of concurrent bad network activity. &bull; Fault effects are transmitted piggyback via good signals or separately as independent bad signals. &bull; Fault effects arriving at good gates cause the divergence of bad gates. &bull; Bad gates disappear, or converge, as soon as their inputs and outputs are again in agreement with the associated good gate. &bull; The passage of time is simulated precisely by using assignable rise and fall gate delays. &bull; Feedback, reconvergent fanout, and race detection are handled without special mechanisms. &bull; Economical event handling, desirable here due to accumulation of events of many bad networks, is achieved by using the time mapping6event scheduling technique.
A Utility For The Generation Of A Preliminary Data/Dictionary Directory
Authors: Jon D. Clark
Venue: Proceedings of the 1978 annual conference (1978)

All Information Processing Systems (IPSs) consist of users, data, and algorithms. The algorithms draw upon the store of data to satisfy user requests. In order to process requests, however, a great deal of meta data, or data about data must be employed. The evolving technology of Data Base Management Systems (DBMSs) suggests that this meta data should reside in what is referred to as the Data Dictionary/Directory (DD/D). What is currently lacking both theoretically and in practice is a set of implementation tools or utilities for the generation of a preliminary DD/D and its subsequent maintenance. The purpose of this paper is to suggest a DD/D initialization alternative that is both low cost and effective.
Automatic layout for gate arrays with one layer of metal
Authors: Peter Robinson
Venue: Proceedings of the 20th Design Automation Conference (1983)

Gate arrays with only one layer of metal have some advantages-notably that they are easier to make than arrays with two or three layers of metal and are correspondingly cheaper. These are countered by the increased difficulty of layout, particularly if this is to be achieved automatically by a design automation system. This paper presents an automatic layout system providing placement and routing for the C-series of uncommitted logic arrays from Ferranti; although the techniques and programs are applicable generally to gate arrays with one layer of metal.
A communication structure for a multiprocessor computer with distributed global memory
Authors: Lars Philipson, Bo Nilsson, Bjorn Breidegard
Venue: ACM SIGARCH Computer Architecture News (1983)

An experimental multiprocessor computer was designed and built in order to explore the feasibility of certain internal communication mechanisms. The system consisted of seven processing elements, each containing a part of the global memory connected to a local bus. For each processor the global memory is seen as one single, linearly addressable structure. The processing elements were all connected to a common, global bus, consisting of three separate busses in order to increase the capacity. A bus selection unit was designed, capable of making a unique bus selection for each request, within a fraction of a memory cycle. The experiments have shown that communication structures based on distributed global memory and global bus systems can be used efficiently for medium scale systems.
Beyond videotex: The library of congress pilot project in page image retrieval and transmission digital optical disk
Authors: W. Nugent, J. Harding
Venue: Proceedings of the eighth symposium on Data communications (1983)

This paper arrived late and can be found published in full on pages 257-260 of this Proceedings.
Laval's response to the need for specialists in the computer/manager interface
Authors: Pierre Beaudoin, Lin Gingras
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

Conscious of the increased value and cost of the information included in the manager's decision process, our School of Management in January 1971, committed a work group with the task of studying this phenomenon and looking at the possibility of training managers of information in organizations. This group designed a program in Management Information Systems which became the MBA-MIS program. The first students were enrolled in September 1972. The object of this paper is to introduce the reader to the main characteristics of this program. We will first have a look at the topics constituting its core and around which the different courses are developed. Afterwards, we will examine the pedagogy and describe the potential customer for the program. Finally, we will outline the particular originalities of the program and identify the different job market possibilities, for the graduate in Management Information Systems.
Extending Concurrent Pascal to allow dynamic resource management
Authors: A. Silberschatz, R. B. Kieburtz, A. Bernstein
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

In Concurrent Pascal, the syntactic and semantic definition of the language prevents the inadvertent definition of a program that might violate the integrity of a shared data object. However, the language also does not allow the dynamic allocation of reusable resources among processes, and this restriction seems unnecessarily stringent. This paper proposes the addition to Concurrent Pascal of a new type of program component, to be called a resource manager. By this means, dynamic resource allocation can be accomplished both safely and efficiently. The notion that a process holds access rights to a resource is generalized to the notion that it holds capability rights, but the capability to actually make use of a resource is granted dynamically. The anonymity of dynamically allocatable resources is also guaranteed.
What Employers Look For In Hiring Computer Science Graduates (Panel Discussion)
Authors: M. M. Irvine
Venue: Proceedings of the 1978 annual conference (1978)

The views I express are my own and not Bell Labs, and are influenced heavily by my current project responsibilities and those I have had in the past. However, these projects, which are primarily development of large software systems, are quite typical of many other projects both within and external to Bell Laboratories.
Public cryptography outlook
Authors: Miles E. Smid
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Ten years ago last March, the National Bureau of Standards issued its first solicitation for an algorithm to be used in public cryptography. While significant progress has been made in the development of the technology in this field, the public's use of cryptography has proceeded more slowly than some had originally expected. Yet, looking back, it seems surprising that anyone would have thought that public cryptography could have developed any faster than it has. When the DES was published as a standard in January, 1977, the private and non-classified government communities knew little about cryptography and its capabilities. Open publications were primarily academic papers, and consequently the public had a poor understanding of what problems cryptography could solve and what problems were beyond its scope.
On the performance of loosely coupled multiprocessors
Authors: Laxmi N. Bhuyan
Venue: ACM SIGARCH Computer Architecture News (1984)

A Processing Element (PE) essentially consists of a processor and a memory module. A loosely coupled multiprocessor is comprised of a set of such PEs interconnected through an Interconnection Network (IN). The design of the IN is crucial to an efficient communication beween the PEs. This paper presents approximate evaluations of two loosely coupled architectures, each having three types of INs, namely: shared bus, crossbar and a class of Multistage Interconnection Networks (MINS) called Omega network. Probability of Acceptance (PA) of a message is considered as a measure of the performance. For a high rate of internal requests, it is shown that an Omega network performs close to a crossbar while reducing the the cost of interconnection to a large extent.
An adaptive multimicroprocessor array computing structure for radar signal processing applications
Authors: C. V. W. Armstrong, H. M. Ahmed, N. A. Brans, E. Fathi
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper describes an array processor designed for signal processing in radar applications. The processor consists of a large number of microprocessor-based processing elements and is designed to be adaptive in real-time processing requirements. The processing problem has been considered to have a quite specific data organization and data rate which can be exploited in the architectural design. Parallel processing is necessary and a pipelined approach was adopted. A generalized pipeline philosophy is described which leads to a description of the hardware structure. The development of a single level control structure with separate generation of opcodes and addresses is noted.
Tensor and multilinear algebra
Authors: Sylvain H. Baron
Venue: Proceedings of the international conference on APL (1981)

This paper gives APL models of multilinear forms, tensors, symmetric and antisymmetric tensors, change of basis formula, thus providing a coherent treatment of symmetric and exterior algebras. Properties of determinants are derived from exterior algebra identities, and formal computation of coefficients of the characteristic polynomial of a square matrix follows as a natural consequence.
Status of graduate software engineering education
Authors: K. Y. Lee
Venue: Proceedings of the ACM '81 conference (1981)

After a decade of discussion and debate over the need for and methods of software engineering education, some implementations are finally beginning to emerge. Some are carried under the umbrella of computer science or management science, and others are Master's-level software engineering programs designed for working professionals. In this paper we will discuss the current status of graduate-level software engineering programs, with the main emphasis on the latter type, i e., those educating the working professionals.
Rigid body segmentation and shape description from dense optical flow under weak perspective
Authors: J. Weber, J. Malik
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We present an algorithm for identifying and tracking independently moving rigid objects from optical flow. The proposed method uses the fact that each distinct object has a unique epipolar constraint associated with its motion. This is in contrast to using local optical flow information for segmentation. Thus motion discontinuities based on self-occlusion are distinguished from those due to separate objects. The use of epipolar geometry allows for the determination of individual motion parameters for each object as well as the recovery of relative depth for each point on the object. The segmentation problem is formulated as a scene partitioning problem and a statistic-based algorithm which uses only nearest neighbor interactions and a finite number of iterations is developed. A Kalman filter based approach is used for tracking motion parameters with time. The algorithm assumes an affine camera where perspective effects are limited to changes in overall scale. No camera calibration parameters are required.
Data bases for microcomputers: The PEPIN approach
Authors: P. Bouchet, A. Chesnais, J. M. Feuvre, G. Jomier
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

In this paper we present PEPIN, a relational data base management system implemented on microcomputers, written in PASCAL and developped by the performance evaluation project at INRIA. At the moment, as we work towards a totally distributed system, the base versions of PEPIN are operational and support tasks oriented to office automation applications.
An environment for an operating system
Authors: G. F. Leonard, J. R. Goodroe
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Conventional operating systems are limited in scope and are designed to deal with very specific problems in the utilization of a computer facility. As more sophisticated programming techniques and new applications for computers are developed, it becomes increasingly apparent that operating systems, as currently conceived, do not adequately cope with the resulting problems. In this paper, a new approach to computer facility utilization is proposed which is based on the concept of extending the operations of a computer with software so as to provide a proper environment for an operating system. The organization and functional descriptions of a system, called an -and-ldquo;extensible machine-and-rdquo;, is presented with the advantages it affords over conventional systems being explicitly stated. Criteria for developing such a system are presented and the capabilities of the system are discussed in the light of current problem areas such as parallel processing, real time processing, and intelligence systems.
A study of the effect of attitudes on the learning of computer programming
Authors: A. J. Biamonte
Venue: Proceedings of the third annual computer personnel research conference (1965)

The major purpose of this paper will be to discuss the effects of attitudes on the learning of problem-solving subject matter. But before turning to the reasoning behind the implied relationship, it is important to define operationally what is meant by both problem-solving and attitudes. While the cognitive processes were one of the first aspects of behavior studied by early experimental psychologists, the terms used in discussing different types of cognitive activities (thinking, problem-solving, decision-making and creativity) have still not been clearly disentangled from one another. And, while a definition of terms cannot solve the confusion, it can still identify the point of view considered in this paper. An individual can be considered thinking when through the use of symbols or images he internally represents or &ldquo;constructs a model of&rdquo; the world or some aspect of it, whether that part of the world is immediately present or not (1). Thus, reverie, reminiscence, fantasy, dreaming and remembering are all thinking activities and also more directed efforts, such as reintegrating past experiences to solve a problem, or consciously weighing two courses of action to make a decision.
Dealing with an increasing user/consultant ratio
Authors: Ardoth A. Hassler
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

Use of the computer at The Catholic University of America has been growing at the rate of twenty percent per year for the last five years. While equipment has been enhanced, the Computer Center has had no additional positions. The increased User/Consultant ratio has been dealt with in the following ways: - a &ldquo;help the user help herself&rdquo; philosophy - a schedule for consultation has been developed - students share the consulting load - emphasis is placed on user documentation - reassignment of positions within the Computer Center - increased communication with faculty - a Task Management System for projects - standardization of equipment and software - use of students in software/documentation development This paper will elaborate on how these ideas have helped Academic Services at The Catholic University of America keep pace with growth in the number of users.
Comments on the topic &ldquo;programming, and its implication on programming languages&rdquo;
Authors: J. M. Yohe
Venue: Proceedings of the 1975 annual conference (1975)

If we agree that the purpose of computing is to solve problems of one sort or another, then it seems clear that the purpose of programming is to communicate to computing systems (and usually to other people) the means of solving problems. The vehicle used for this communication is the programming language. In an 'ideal' situation, the problem-poser might devise a method for the solution of his problem, and then state his method in a programming language which would be rich enough to allow full expression and at the same time powerful enough to free him from concern about matters (such as storage allocation) which have no direct bearing on his problem. In practice, the richness and power of available programming languages will influence, to some degree, both the methodology employed and the amount of detail which must be included in the program.
Cache memories: A tutorial and survey of current research directions
Authors: Robert P. Cook, Cathy J. Linn, Joseph L. Linn, Terry M. Walker
Venue: Proceedings of the ACM '82 conference (1982)

The tutorial presents a unified nomenclature for the description of cache memory systems. Using this foundation, examples of existing cache memory systems are detailed and compared. The second presentation discusses a programmable cache memory architecture. In this architecture, intelligence is added to the cache to direct the activity between the cache and the main memory. Also to be described are heuristics for programming the cache which allow the additional power to be exploited. The third presentation deals with innovations involving systems where the cache memory is not used as a simple high speed buffer for main memory. A straight forward example of this appears in IBM's Translation Lookaside Buffer on 370s with dynamic address translation hardware. Other examples are to be described include a cache system for the activation stack of a block structured language, a cache system to store subexpressions for an expression oriented architecture, and a multiprocessor architecture that relies on two levels of cache.