ppxscal/embedding_network huggingface dataset:
Software-fault detector for microprocessors
Authors: Kozo Itano, Tetsuo Ida
Venue: ACM SIGSMALL Newsletter (1981)

For the realization of the means to develop more reliable software for the microcomputers especially in real time environments, we design a hardware tool called &ldquo;software-fault detector&rdquo; which detects software faults such as misaccess to an element beyond the range of an array. The implementation of the mechanism for such address range checks is generally difficult in microprocessor environment, since internal registers are not readily visible to external logics. We introduce an &ldquo;incremental&rdquo; key-lock protection scheme into the fixed microcomputer architecture of the INTEL 8080 because of its popularity and simplicity. In this scheme, a &ldquo;lock&rdquo; is a protection code associated with the storage cell, and a &ldquo;key&rdquo; is associated with access capability such as address. In each memory access to a cell, a check is made whether a key matched against the lock of the addressed cell. In this paper, we present the details of the scheme and its analysis. Further, we present an actual hardware design of the software fault detector. Our design methodology is to realize a dector by the use of identical microprocessor 8080s, as an independent one-board module which could be connected to the memory bus of the host system.
Automatic nested dissection
Authors: Donald J. Rose, Gregory F. Whitten
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Nested dissection is an ordering technique used to order the sparse symmetric positive definite systems of linear equations arising from discretizations to elliptic boundary value problems yielding regular n &times; n grids. By taking a recursive view of nested dissection we develop an ordering strategy which is particularly simple and efficient when n &equil; 2@&minus;1. A FORTRAN IV subroutine of our algorithm is included and some experiments are presented.
Newton's method: a great algebraic algorithm
Authors: John D. Lipson
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The analytic concepts of approximation, convergence, differentiation, and Taylor series expansion are applied and interpreted in the context of an abstract power series domain. Newton's method is then shown to be applicable to solving for a power series root of a polynomial with power series coefficients, resulting in fast algorithms for a variety of power series manipulation problems. Sample applications of a FORMAC implementation of Newton's method as an algebraic algorithm are presented.
A 3-space partition and its applications
Authors: F. Frances Yao
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Let S be a set of n points in three-dimensional space. It is shown that one can always find three planes that divide S into eight open regions, of which no seven together contain more than &agr; n points where &agr; is a constant < 1. This result gives rise to a data structure, what we call an octant-tree, for representing any point set in 3-space. Efficient solutions to various data retrieval problems are readily available with this structure. For example, using octant-trees, one can answer in sublinear time T (n) @@@@O(n0.98) 1) half-space queries: find all points of S that lie to one side of a plane P; 2) polytope queries: find all points that lie inside (outside) a polytope; and 3) circular queries in E2: given a planar set S, find all points that lie within (without) a circle of radius r and center c for any r and c. An octant-tree for n points occupies O(n) space and can be constructed with O(n4) preprocessing time.
An endogenous priority model for load control in combined batch - interactive computer systems
Authors: Carl E. Landwehr
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

A relatively high level analytical model for computer systems serving both batch and interactive users is presented. The model is unusual in its employment of an endogenous priority scheme to represent a class of strategies for controlling service to the two types of customers. Numerical methods developed by V. L. Wallace are used to generate steady state probability distributions for the infinite state Markov chain formed by the model. Data from the Michigan Terminal System, which includes a load controlling mechanism of the type modelled, is used to validate the model. Finally, additional parameter studies indicate that the model reflects the dynamic behavior of such system in a reasonable way.
A course on the Relationship of Formal Language Theory to Automata
Authors: Robert M. Aiken
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

This paper describes the second course in a graduate sequence in Computer Science given at the University of Tennessee, Knoxville. The purpose of this sequence is to provide students with a theoretical base in formal language theory for understanding and interpretation of concepts and relationships in programming and automata theory. The explicit purpose of the second course, &ldquo;The Relationship of Formal Language Theory to Automata&rdquo;, is to use the structure of grammars, primarily context-free grammars, to examine various aspects of automata theory. These aspects include deterministic and non-deterministic acceptors, processors with pushdown stores, and finite state machines. The first course in the series employs formal language theory as the vehicle for presenting concepts related to the theory of programming languages; this second course employs the same vehicle for presenting aspects of automata theory. The two courses combined achieve a unity whereby important relationships between programming and automata theory as well as applications stemming from these theories can be derived. This course meets for one and a half hours twice a week for ten weeks. Prerequisites for this course include the first course in this sequence, as well as, an intermediate sequence of courses in machine organization and programming languages plus basic courses in numerical analysis, probability and statistics, and at least two years of calculus.
Simulation modeling in health care facilities
Authors: Kenneth R. Currie, Wafik H. Iskander, Michael Leonard, Cynthia D. Coberly
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Several simulation models have been developed by the authors dealing with specific applications in the health care field at the West Virginia University Hospital, as well as for the entire State of West Virginia. This paper illustrates the diversity of simulation as a decision making tool in the health care field, in areas such as operating room utilization, vertical transportation needs, radiology staffing, and emergency medical squad location and operations.
Two combinatoric operators
Authors: Kenneth E. Iverson
Venue: Proceedings of the eighth international conference on APL (1976)

An operator in APL applies to a function or functions (or a function and a variable) and produces a new function. An operator may be dyadic (as the dot in +.&times;) or monadic (as the slash in +/), and the function produced may be monadic (as in +/) or dyadic (as in +.&times;). This paper treats two operators which are combinatoric in the sense that they are useful in applying functions over certain subsets of the elements of the array argument. The first is a double generalization of the determinant, applying it to functions other than the alternating sum over products, and extending it to non-square matrices. This operator is dyadic and produces a monadic function. The second applies to a single function f to produce a monadic function which yields f outer products on vectors of the form @@@@N, the final result being of a shape specified by the argument. This function yields function tables and makes it easy to produce a variety of useful Boolean matrices, including upper and lower triangles, identity matrices, and checkerboard patterns. The symbolism chosen to represent the operators under discussion is consistent with APL operator syntax, but is not presented as a considered choice. Zero-origin indexing is used throughout.
The Traffic Police Management Training Game
Authors: Gay Doreen Serway, Allen S. Kennedy, Gustave Rath
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The Traffic Police Management Training Game was designed for Northwestern's Traffic Institute with the following basic objectives: (1) to provide police officers of supervisory rank with more insight and experience in traffic problems; (2) to show the importance of intensive analysis and planing; and, (3) to teach certain patrol enforcement concepts. The game requires three ingredients: the game administrators, the game players, and the computerized game model. The game model provides the framework within which the administrator may specify any type of urban model he believes meets his teaching objectives. The game players input decisions on allocation of manpower for patrol enforcement. The game model generates violations, which stochastically result in accidents. The frequency of these violations is assumed to be a function of parameters selected by the administrators and the enforcement applied by the players. If a violation does not result in an accident, the model computes whether or not an available unit detected the violation. The model does not pretend to be realistic, but rather aims to achieve verisimilitude. The object of the game is to achieve some &ldquo;bests allocation based on criteria set up by the administrators. Organizational aspects of the game include: administrator and player briefings, instructions, decision forms, and critiques.
A new technique for satellite broadcast channel communication
Authors: F. Borgonovo, L. Fratta
Venue: Proceedings of the fifth symposium on Data communications (1977)

The goal of this paper is to present a multi-access technique for Satellite Broadcast Channel Communication which extends the features of the Slotted-ALOHA system to higher Channel Utilization and presents a stable behaviour. The Reservation Upon Collision (RUC) Technique consists on a S-ALOHA scheme with a super-imposed reservation technique which automatically operates when collisions occur. The technique is designed to achieve a transmission delay as small as the S-ALOHA for low channel utilization and to perform as a RESERVATION scheme for high channel utilization. The implementation of the RUC-Technique is based upon the knowledge of the origin of the collided packets at each time slot. Simulation results show improved delay-throughput characteristics over S-ALOHA and in particular the suitability of this technique for systems with high channel utilization.
Improved decoding of compressed images received over noisy channels
Authors: T. P. O'Rourke, R. L. Stevenson, Yih-Fang Huang, D. J. , . Jr. Costello
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

This paper presents an image communication system with improved decoding of compressed image information. A convolutional code protects the compressed image information from channel noise while a Reed-Solomon outer code gives additional protection to the critical image header information. A post-processor detects uncorrected channel errors in the reconstructed image and feeds error location information to a list-based iterative trellis decoder. This list-based decoder provides significant improvement in image quality. Experimental results are given for varying channel SNR and for varying bit rate.
An APL approach to interactive display terminal graphics
Authors: W. H. Niehoff, A. L. Jones
Venue: Proceedings of the fourth international conference on APL (1972)

Larger, generalized graphics packages, as well as specialized graphic application packagese, have not been especially successful in their penetration into the daily computing habits of computer users. We believe that this has been because of the relatively poor availability of display terminal equipment and limited useability of the programming support. An object lesson is provided by the acceptance of the APL language and its System/360 implementation. Its penetration into the working habits of users has been dramatic. APL/360 GRAPHPAK is an integrated collection of functions, implemented entirely within APL that couples the facilities of APL/360 with economical, commercially available hardware to implement a highly interactive, easy to use graphic display facility. It attempts to employ the same attributes of APL that make APL attractive to yield a similarly pervasive system. This paper will discuss the design philosophy behind GRAPHPAK, its basic functions, its application-oriented functions, and applications which have sprung from these basic facilities. It will attempt to show why this facility has demonstrated that useable, highly interactive, and economical computer graphics is very definitely possible in today's technical environment.
3-D video compositing: towards a compact representation for video sequences
Authors: F. C. M. Martins, J. M. F. Moura
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In order to achieve good quality very low bit rate video coding, new techniques leading to highly compact representations for video sequences must be investigated. We present a novel video codec framework, where video sequences are represented in terms of stochastic nonparametric 3-D object models and motion script estimates. Multi-property object models, carrying both shape and color information, are incrementally built from video and range sequences. Motion estimates are obtained by depth map registration. We refer to this framework as 3-D video compositing, or 3DVC for short. In this paper, we will describe 3DVC in detail, and present experimental results where interframe compression ratios in the range of 10/sup 2/ to 10/sup 3/ have been achieved.
Verbal and graphical language for the AED system: A progress report
Authors: Douglas T. Ross, Clarence G. Feldmann
Venue: Proceedings of the SHARE design automation workshop (1964)

For Computer-Aided Design use of time-sharing a single language which can take either verbal or graphical form is required. This paper describes how a single language processing technique, which is in turn a special application of more general concepts concerning the step-by-step growth and processing of large structures of interrelated elements, can efficiently process both language forms in the same manner. Illustrations of the concepts involved are also drawn from the methods used in the AED-0 Compiler, an efficient ALGOL-60-based compiler used in Computer-Aided Design work, which is available as a public command in the Project MAC CTSS. &ldquo;This paper was prepared for presentation at a special symposium concerning Project MAC, held at MIT May 6, 7, 1964, under the auspices of the MIT Industrial Liaison Program. The paper summarizes much of the material presented by Mr. Ross at the Share Automation Workshop. A non-time-shared version of the AED-0 Compiler described in the paper will be available through Share in the future. "Work reported herein was supported by Project MAC, an M.I.T. research program sponsored by the Advance Research Projects Agency, Department of Defense, under Office of Naval Research Contract Number Nonr-4102(01) and by the Fabrication Branch, Manufacturing Technology Laboratory, Aeronautical Systems Division, United States Air Force under Contract No. AF-33(600)- 42859. Reproduction in whole or in part is permitted for any purpose of the United States Government.&rdquo;
Computer aided graphics in architecture and planning
Authors: Kaiman Lee, Clifford D. Stewart
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Computer-aided graphics is illustrated by the use of ARK 2 system in two and three dimensional graphics manipulation. The ease of using this system is emphasized. ARK 2 is a user-oriented computer-aided design system for architects and planners who have little knowledge of computers.
Functional models for VLSI design
Authors: Roy L. Druian
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper presents expectations, results, and comments on a project that used the N. mPc register transfer simulation package as a functional simulator to develop models for the MC68000 and MC68010. Several models that were developed to help determine both advantages and disadvantages of various levels of functionality are described. It is shown that functional level simulations do indeed serve a valuable purpose in the design cycle as an additional, although by no means the only, tool for system level design verification.
The study of 3D-from-2D using elimination
Authors: R. Werman, A. Shashua
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The paper unifies most of the current literature on 3D geometric invariants from point correspondences across multiple 2D views by using the tool of elimination from algebraic geometry. The technique allows one to predict results by counting parameters and reduces many complicated results obtained in the past (reconstructuon from two and three views, epipolar geometry from seven points, trilinearity of three views, the use of a priori 3D information such as bilateral symmetry, shading and color constancy, and more) into a few lines of reasoning each. The tool of Grobner base computation is used in the elimination process. In the process we obtain several results on N view geometry, and obtain a general result on invariant functions of 4 views and its corresponding quadlinear tensor: 4 views admit minimal sets of 16 invariant functions (of quadlinear forms) with 81 distinct coefficients that can be solved linearly from 6 corresponding points across 4 views. This result has non trivial implications to the understanding of N view geometry. We show a new result on single view invariants based on 6 points and show that certain relationships are impossible. One of the appealing features of the elimination approach is that it is simple to apply and does not require any understanding of the underlying 3D from 2D geometry and algebra.
Yale school of architecture
Authors: Robert Simpson Frew
Venue: Proceedings of the 14th Design Automation Conference (1977)

The Yale School, like many other Schools of Architecture, places an emphasis on the studio approach to teaching design. All other subjects are taught through the traditional course format including computer aided design. The School has emphasized the need for a diverse approach to design and, consequently, has upheld a number of positions that support this. The resource person in computer aided design is also expected to provide teaching in research methods, systems workshop, as well as a design theory course on methodological issues. The students fall into two types. First is the design student who wants to know enough to operate the state of the art work in computing, and second is the research student who wants to spend all of his or her time developing computer aided design systems.
An automatic migration scheme based on modular microcode and structured firmware sequencing
Authors: C. A. Papachristou, V. R. Immaneni, D. B. Sarma
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

The aim of this work is to construct an automated migration system from software into firmware for functions or algorithms with complex logical structure. The approach is based on an already developed structured microcontrol scheme endowed with compound sequencing capabilities suitable for modular microprogramming. The basic idea is to extract, via compilation techniques, the sequencing structure of the function. This is expressed into complex firmware sequencing constructs such as modular calls and modular loops. Migration is then effected by sequence calls into microcode modules interpreting a target machine architecture on which the function is tested. The migration technique is implemented in a simulated environment consisting of several firmware design tools. The system has the option to produce firmware code suitable for PLA embodiment, thus facilitating function migration into VLSI microcode.
Arcturus: A prototype advanced Ada@@@@ programming environment
Authors: Thomas A. Standish, Richard N. Taylor
Venue: ACM SIGPLAN Notices (1984)

The Arcturus system demonstrates several important principles that will characterize advanced Ada programming support environments. These include conceptual simplicity, tight coupling of tools, and effective command and editing concepts. Arcturus supports interactive program development and permits the combined use of interpretive and compiled execution. Arcturus is not complete however, as practical, mature environments for Ada must also support the development, analysis, testing, and debugging of concurrent programs. These issues are currently being explored. Arcturus, therefore is a platform for experimental exploration of key programming environment issues. This paper focuses primarily on the current system, describing and illustrating some of its components, while issues less fully developed are more briefly described.
Teaching relational database concepts in a university environment
Authors: Sylvia Osborn
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

A relational algebra database system written by students to be used by students is described. Its use in database management courses and as a basis for other student projects is discussed.
Smart Furniture: Improvising Ubiquitous Hot-Spot Environment
Authors: Masaki Ito, Akiko Iwaya, Masato Saito, Kenichi Nakanishi, Kenta Matsumiya, Jin Nakazawa, Nobuhiko Nishio, Kazunori Takashio, Hideyuki Tokuda
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We developed Smart Furniture, which extemporaneously converts the legacy non-smart space into a Smart Hot-spot which consists of computational services. Since the Smart Furniture is equipped with networked computers, sensors and various I/O devices, it can provide various services by alone or by coordinating with other devices. In this paper, the physical structure and middlewares for the Smart Furniture are described. The prototype systems to realize Smart Hot-spot such as a Crossing Window System, an Active Authentication System for Library, a Mobile TV-phone System, and an Environmental Information Monitor System are also introduced.
QCADS-a LSI CAD system for minicomputer
Authors: Hong Xian-long, Yin Ren-kung, Liu Xi-ling
Venue: Proceedings of the 19th Design Automation Conference (1982)

The computer aided design (CAD) technique for LSI is an indispensable tool to develop LSI. Setting up a LSI CAD system with center on CAD database would make CAD technique more effectual. And a LSI CAD system for minicomputer has advantages of lower cost and convenient management. In this paper we are concerned with describing effective LSI CAD system - QCADS for minicomputer. The paper consists of four parts: (1) design objectives and strategy of the system, (2) framework of the system structure, (3) logical structure of database and (4) CAD description language.