ppxscal/embedding_network huggingface dataset:
Complex information processing: a language for class description and its processor
Authors: E. C. Milliken,  Jr.
Venue: Proceedings of the 1965 20th national conference (1965)

IN THE PAST SEVERAL YEARS, several papers1,2 have been written that have developed a description language that can be used to describe classes of objects. A class is a grouping of a number of objects such as all integral numbers, all five card poker hands, or all sentences generated by the rules of a given context free grammar. This description language is useful because all objects in a given class can be described using only one class description; also, many different classes can be described using this one description language. We shall use the word concept to mean the class description. Note that a concept describes a class of objects. This paper takes the description language and presents a computer program for reading in an object and a number of concepts; the program then finds whether or not this object belongs to one of the given classes described by a concept. The program was implemented by breaking the language into a series of rules (1), and then writing procedures (i.e. - individual computer sub-programs that are called from the main program) that break down a given string of symbols (the object and the concepts) according to these rules. The answers are of the following form: &ldquo;yes, object included in (insert class name) class&rdquo;; &ldquo;no, object not included in given classes.&rdquo; The objective of this paper is to: (1) - give a review of the Banerji formalism; (2) - formalize an example that will show how the language is used; and (3) - describe the computer program.
Access and communication controls in an accounting information system
Authors: Avi Rushinek
Venue: Proceedings of the eighth symposium on Data communications (1983)

This paper involves the exploration of two very important security controls in a computerized accounting information system: (1) access controls, and (2) communication controls. The various specific access and communication controls are examined, analyzing their roles in an accounting information system's computer network. The growing use of computers in the accounting information systems of the business environment, along with the presence of growing computer fraud, necessitate managements to implement stricter access and communication controls.
Computer chess: Master level play in 1981?
Authors: Ben Mittman, Tony Marsland, Monroe Newborn, Kathe Spracklen, Ken Thompson
Venue: Proceedings of the ACM '81 conference (1981)

Two papers will be presented and a general discussion period will then follow. The panel members are all members of the ACM Computer Chess Committee. The first paper, which appears elsewhere in the Proceedings, is the work of Tony Marsland. It is entitled &ldquo;A survey of enhancements to the alpha-beta algorithm.&rdquo; The paper reviews move ordering and search reduction techniques which improve the effectiveness of the alpha-beta algorithm when used in a chess program. A critical review of these search modifications is provided, and a recursive formula to estimate the search time is proposed, one which reflects the characteristics of the strongly ordered trees produced through improved use of the alpha-beta algorithm.
Graphics standards for three-dimensional modelling
Authors: Malcolm Sabin
Venue: ACM SIGGRAPH Computer Graphics (1982)

Much effort has been spent in defining a standard call interface for a library of routines with display primitives embedded in a three-dimensional space. This paper argues that this is now an inappropriate target. There is too much diversity in the three-dimensional things we want to draw and in the kinds of picture we want to draw of them for any single standard to be both broadly acceptable and specifically useful. If the decision is made to go for a set of specialized standards for wire frame and for rendered graphics for data presentation, for sculptured surfaces and for object models, it becomes apparent that far more can be gained from a higher level standard, at the data presentation or object modelling level. In the object modelling community, at least, there is indeed work toward such a standard based on the IGES proposals. This has very few concepts in common with the graphics standard effort, and it is not clear at present what contribution the graphics community has to make in this area. The suggestion made here is that there may well be a number of paragraphs or sections common to more than one of the graphics-related and higher level standards. One such is the coordinate transformation (the dreaded 4 &times; 4 matrix). Its definition and its use both for modelling and viewing concepts are suggested which resolve some of the black art associated with transformation in the past. These could become the conceptual basis for a short simple standard in this area.
Efficient interprocessor communication for MIMD multiprocessor systems
Authors: Michel Dubois, Faye A. Briggs
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Several interprocessor communication mechanisms for multiprocessor systems have been proposed. An efficient communication scheme must facilitate high throughput and good response time. We introduce such an efficient scheme, describe the hardware involved, and evaluate its performance. The method is based on a compile-time tagging of shared data and on using different paths for &ldquo;shared&rdquo; (S-) and &ldquo;private&rdquo; (P-) data. The S-data accesses a shared cache on a word-by-word basis; the P-references are made to a local memory under a demand paging system. The resulting design avoids most shortcomings of other communication methods and supports multiprogrammed multiprocessor systems.
How to reuse a "write - once " memory (Preliminary Version)
Authors: Ronald L. Rivest, Adi Shamir
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Storage media such as digital optical disks, PROMS, or paper tape consist of a number of -&-ldquo;write-once-&-rdquo; bit positions (wits); each wit initially contains a -&-ldquo;0-&-rdquo; that may later be irreversibly overwritten with a -&-ldquo;I-&-rdquo;. We demonstrate that such -&-ldquo;write-once memories-&-rdquo; (woms) can be -&-ldquo;rewritten-&-rdquo; to a surprising degree. For example, only 3 wits suffice to represent any 2-bit value in a way that can later be updated to represent any other 2-bit value. For large k, 1.29... k wits suffice to represent a k-bit value in a way that can be similarly updated. Most surprising, allowing t writes of a k-bit value requires only t + o(t) wits, for any fixed k. For fixed t, approximately k.t/log(t) wits are required as k -&-rarr; @@@@. An n-wit WOM is shown to have a -&-ldquo;capacity-&-rdquo; (i.e. k.t when writing a k-bit value t times) of up to n.log(n) bits.
A bit slice architecture for microprogrammable machines
Authors: Michael Andrews
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

The use of a bit slice architecture offers an attractive alternative to the design of microprogrammable computing architectures. By bit slice we mean typically a LSI chip containing either a 2 bit, 4 bit where n is very small. This paper describes these particular architectures to design in horizontal microprogramming. Hardware design implementations for both fixed point and floating point arithmetic algorithms are proposed. Experiences with these numerical hardware are discussed, along with problems encountered.
Computers in precollege education (Panel Discussion): What do teachers want or need?
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

What are the major problems involving computers in precollege education? This question will be discussed by a panel of precollege teachers who are seriously interested in instructional uses of computers. They will present their wants and needs. Topics to be covered include software, hardware, courseware, inservice training, administrative support, and loneliness. The panel will discuss both teaching about computers and teaching using computers. There will be time for input from the audience.
A multi-level approach to information system modeling
Authors: Jan A. Aitken, Keith B. Johnston
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper presents a top-down hierarchical approach to the simulation modeling of computer-based information systems. The modeling approach defines a series of progressively more detailed system models. The models range from a highest-level functional model, which can be defined in the earliest stages of system design, through several intermediate level models representing more detailed views of a system and yielding progressively more detailed predictions of system timing and resource requirements, to a lowest-level model which captures implementation-dependent details of system hardware, software, and database characteristics.
The NYU Ada translator and interpreter
Authors: Robert B. K. Dewar, Gerald A. Fisher,  Jr., Edmond Schonberg, Robert Froehlich, Stephen Bryant, Clinton F. Goss, Michael Burke
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

The NYU-Ada project is engaged in the design and implementation of a translator-interpreter for the Ada language. The objectives of this project are twofold: a) to provide an executable semantic model for the full Ada language, that can be used for teaching, and serve as a starting point for the design of an efficient Ada compiler; b) to serve as a testing ground for the software methodology that has emerged from our experience with the very-high level language SETL. In accordance with these objectives, the NYU-Ada system is written in a particularly high-level, abstract SETL style that emphasizes clarity of design and user interface over speed and efficiency. A number of unusual design features of the translator and interpreter follow from this emphasis. Some of these features are described below. We also discuss the question of semantic specification of programming languages, and the general methodology of &ldquo;Software Prototyping&rdquo; of which the NYU-Ada system is a sizeable example.
Dynamic graphics using quasi parallelism
Authors: Kenneth M. Kahn, Carl Hewitt
Venue: ACM SIGGRAPH Computer Graphics (1978)

Dynamic computer graphics is best represented as several processes operating in parallel. Full parallel processing, however, entails much complex mechanism making it difficult to write simple, intuitive programs for generating computer animation. What is presented in this paper is a simple means of attaining the appearance of parallelism and the ability to program the graphics in a conceptually parallel fashion without the complexity of a more general parallel mechanism. Each entity on the display screen can be independently programmed to move, turn, change size, color or shape and to interact with other entities. The scheme presented herein begins with the notion of a quantum of time, or tick, within which there are no ordering constraints on events. Each entity or actor decides what it must do upon the next tick. Ticks are a powerful means of controlling parallel processes but are usually at too low a conceptual level for user convenience. Higher-level operations built upon the tick mechanism are presented, most notably the ability to instruct any entity or group of entities to gradually change or move at a rate that is itself changeable by the same operation. To illustrate these ideas a simple celestial mechanics simulation is presented. Upon each tick the velocities and positions of the objects are updated by the gravitational and propulsive forces acting upon them. Ticks are only one product of an object-oriented programming style. For the best control and the most modularity, graphics programming should be object oriented. Each object displayed, and its parts, should be independently programable. Instead of being passive data, objects should be responsible for the changes in their position or appearance. Instead of a global controller, each object should interact with the others.
Interactive wiring system
Authors: F. D. Skinner
Venue: Proceedings of the 17th Design Automation Conference (1980)

The Interactive Wiring System (IWS) is a highly interactive graphic application originally developed for the embedding of overflow wires on cards, boards and other high-level packages. It has since been expanded to support component placement, I/O assignment and service net manipulation. The programs were developed for IBM's internal use and are not marketed by IBM. An overview of how IWS interfaces with the IBM Design Automation System (EDS - Engineering Design System) is followed by a brief description of the IWS model. Representative functions are described as seen by the IWS user. Examples of how IWS has impacted the design process at various IBM locations are included. A separate section briefly addresses the display technology implications of some of the graphical display techniques used by IWS. The paper concludes with a brief description of changes being considered to enhance the flexibility of the IWS model for highlevel packages and to allow support of chip-level packages.
A featural approach to command names
Authors: Jarrett Rosenberg
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A variety of aspects of command names have been studied, such as suggestiveness, memorability, and the use of icons. A single framework for these disparate studies is desirable, and it is proposed that the concept of featural analysis prevalent in linguistics and psycholinguistics be adopted as an approach to command name design. Examples of the breadth of application of this approach are given for the naming issues of suggestiveness, learning and memory, congruence and hierarchicalness, universal commands, the relationships of names to the command language syntax, and the use of non-words as names.
Performance analysis of an access method suitable for the integration of voice and data
Authors: J. P. Behr, U. Killat
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

This contribution describes a new type of an integrated system's architecture which reconciles the diverging needs of both, stream traffic of 64 kbit/s and bursty traffic of low and high data rates. The total capacity of a unidirectional bus is subdivided into a high-speed channel and a certain number of time slots for stream traffic. The capacity of the high-speed channel can dynamically be adjusted according to the amount of time slots required for stream traffic. Due to the dynamic creation and deletion of time slots, the subsystem for 64-kbit/s channels is almost blocking-free. The same mechanism is used to control access to the high-speed channel, and to determine the fraction of the total capacity dedicated to the high-speed channel. The performance of the proposed access mechanism has been investigated by means of system modelling and simulation. The results show that besides its ability to accommodate 64-kbit/s channels it compares quite favourably with other LAN concepts like CSMA/CD.
SIGIR/SIGARCH non-numeric processing and computer architecture (Panel Session)
Authors: P. Bruce Berra
Venue: Proceedings of the 1975 annual conference (1975)

In recent years increased emphasis has been given to the solution of non-numeric processing problems using novel computer architectures. These architectures have included associative memories and processors distributed logic devices front end and back end organizations and computers developed solely for handling data. In this session the panelists will discuss various aspects of computer architecture and/or non-numeric processing, present some problem areas and indicate some directions for future research. The form of the session will include short presentations by the panelists, discussion among the panelists, and discussion between the panelists end the audience.
Generalization of Manin's conditional algorithm
Authors: Horst G. Zimmer
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In a lecture [16] delivered at the conference on &ldquo;Utilisation des calculateurs en math&eacute;matiques pures&rdquo; in France, we developed some ideas regarding the implementation of Manin's conditional algorithm [7] for computing the rank and a basis of the group of rational points on an elliptic curve C over the rationals &Oslash;. The aim of the present paper is to discuss to which extent this algorithm can be generalized to elliptic curves C defined over an arbitrary finite-algebraic number field K. Furthermore, certain problems concerning the implementation of the generalized algorithm will be treated. Some results obtained in this connection seem to be also per se of interest. In an appendix we shall give complete proofs of the assertions made in sections 1,4, and 6.
A logarithmic poisson execution time model for software reliability measurement
Authors: J. D. Musa, K. Okumoto
Venue: Proceedings of the 7th international conference on Software engineering (1984)

A new software reliability model is developed that predicts expected failures (and hence related reliability quantities) as well or better than existing software reliability models, and is simpler than any of the models that approach it in predictive validity. The model incorporates both execution time and calendar time components, each of which is derived. The model is evaluated, using actual data, and compared with other models.
Autonomous systems intelligence
Authors: John L. Anderson
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

The evolution of unmanned and manned spacecraft indicates that significant degrees of autonomous operation for onboard health, fault, or performance management are becoming important. In particular, technology and mission studies of a permanently manned, evolutionary space station have surfaced the need for new computer system concepts incorporating autonomy and perhaps artificial (machine) intelligence. An evolving autonomous system with mixed degrees of autonomy, interdependent autonomous functions, and perhaps disparate artificial intelligences will require orchestration of the behavior of the entire system. An advanced concept of decision control, involving an explicit sequence of goal-directed decisions, is proposed as an executive machine-intelligent process by which the multiple, specialized &ldquo;smart programs&rdquo; or &ldquo;machine intelligences&rdquo; of an autonomous system could be controlled.
TDL: A hardware/microcode test language interpreter
Authors: Gary Staas
Venue: ACM SIGMICRO Newsletter (1984)

TDL is an interpreter for a high level test language used in the development of hardware and microcode. A user can supply commands interactively at a terminal, or from a prepared command file to facilitate automated testing. TDL can communicate to either real hardware or a program simulating the hardware, supplying a uniform interface to both. TDL's features simplify test writing, generating test cases, and calculating test results.
Why Managers Fail(Presentation Abstract)
Authors: James F. Towsen
Venue: Proceedings of the 1978 annual conference (1978)

This practical, common sense presentation will zero in on the statement that MANY managers and supervisors ARE NOT regarded as assets to the organization by their peers and/or subordinates. If many managers and supervisors are not exceptionally good at the management part of their job, then NOW is the time to examine the pitfalls to be avoided. We will look at the manager who cannot COMMUNICATE and who can't MANAGE TIME. This talk will be presented in a manner that is educational, revealing and entertaining providing we can see the humor in our failures.
Teaching software development using a microprocessor laboratory
Authors: Thomas C. Irby
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

This paper describes an attempt to provide realistic software development experience to a group of 15 students at North Texas State University. Each of the students had some previous programming experiences. Most of this experience was with higher level languages, but all students had been exposed to at least a simple assembler language, CARDIAC(1), in previous course work. The course was designed to be more like a laboratory rather than a lecture course. Scheduled lectures were held to present basic concepts, discuss the programming assignments and to provide for class discussion periods. The course grade was based on the quality of the software projects and on the ability of students to interact with others in the class. The software projects were implemented using several Motorola M6800 Microprocessors.
A class of min-cut placement algorithms
Authors: Melvin A. Breuer
Venue: Proceedings of the 14th Design Automation Conference (1977)

In this paper we present a class of min-cut placement algorithms for solving some assignment problems related to the physical implementation of electrical circuits. We discuss the need for abandoning classical objective functions based upon distance, and introduce new objective functions based upon "signals cut." The number of signals cut by a line c is a lower bound on the number of routing tracks which must cross c in routing the circuit. Three specific objective functions are introduced and the relationship between one of these and a classical distance measure based upon half-perimeter is presented. Two min-cut placement algorithms are presented. They are referred to as Ouadrature and Slice/Bisection. The concepts of a block and cut line are introduced. These two entities are the major constructs in developing any new min-cut placement algorithm. Most of the concepts presented have been implemented, and some experimental results are given.
Introduction to the SIMSCRIPT II programming language
Authors: Philip J. Kiviat
Venue: Proceedings of the second conference on Applications of simulations (1968)

SIMSCRIPT II is a new computer programming language designed and implemented at The RAND Corporation1. It has been modeled after SIMSCRIPT2, the simulation programming language introduced by RAND in 1963, but goes far beyond the design goals of that language. The design goals of SIMSCRIPT II were stated in3; briefly, they were to produce a readable, user-oriented language strongly oriented to the efficient debugging and running of large simulation models. In addition, the implementation was to be as computer independent as possible. As it is difficult in a short abstract to describe a complex language adequately, the following strategy has been adopted. Section 1 describes the basic properties of the SIMSCRIPT II language in concise, but hopefully communicative, terms. Section 2 illustrates the language through excerpts taken from a job shop simulation model. Section 3 discusses the present status of the language, its implementation and its use.
Multi-disciplinary programming exercises
Authors: Ronald G. Ragsdale
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Courses in computer science, data processing or other areas that involve the learning of computer programming often require the student to complete programming exercises. These exercises give the students practice in translating some process into a set of computer commands that accomplish the same process. Very often the exercises are relatively &ldquo;content free&rdquo; (write a program to add a set of numbers...) and the objectives attained by the exercises are entirely in the data processing, computer science domain. This paper is based on the assumption that the content of typical programming exercises is an unutilized resource that can be used to facilitate learning in other subject matter areas without jeopardizing the attainment of the programming goals.