ppxscal/embedding_network huggingface dataset:
Engineering a security kernel for Multics
Authors: Michael D. Schroeder
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

This paper describes a research project to engineer a security kernel for Multics, a general-purpose, remotely accessed, multiuser computer system. The goals are to identify the minimum mechanism that must be correct to guarantee computer enforcement of desired constraints on information access, to simplify the structure of that minimum mechanism to make verification of correctness by auditing possible, and to demonstrate by test implementation that the security kernel so developed is capable of supporting the functionality of Multics completely and efficiently. The paper presents the overall viewpoint and plan for the project and discusses initial strategies being employed to define and structure the security kernel.
Optimization of planning and architectural decisions under conditions of uncertain demand
Authors: Elliott E. Dudnik
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Techniques have been available for some time for determining optimum solutions to certain classes of resource allocation problems. These problems are characterized by a large number of solutions that may satisfy the basic conditions of the problem. The method most often employed to determine the optimum solution to such problems is linear programming. Unfortunately, linear programming techniques are generally not applicable to the type of problems where all constraints are not explicitly defined, e.g., where the demand is estimated or known only with a given probability. Problems of maximization of profits or social benefits in the allocation of available resources or facilities continuously arise in planning and architecture, where the amount of available or potential resources (utilities, housing units, social services, etc.) is explicitly known, but where the demand is not. This paper demonstrates how one may formulate problems with demands that are not precisely known, are projected, or are estimated with some given probability. In addition to the general statement of such problems, several specific applications of the method for both planning and architectural problems are presented. The examples and solutions given involve: 1) the distribution of municipal recreation equipment and facilities among several neighborhood parks each with different demands for the different facilities; 2) the allocation of city services to new communities with various estimated demands. The method presented in this paper also permits the formulation of such problems into the standard linear programming format for solution by computer.
The robot's sense of touch: Some lessons from human taction
Authors: William W. McMillan
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

A consideration of the logical functioning of human taction may suggest methods for solving problems of automated taction. The features of the human tactile system that may be relevant include its spatial resolution, mechanical modification of stimuli, temporal and spatial inhibition, adaptation characteristics, and exploration strategies. Artificial tactile systems would be least likely to gain from lower-level, physiology- coupled features of human taction, but might be significantly advanced if higher-level transformations of sensory input were implemented.
Algorithms for finding diagnosability level and t-diagnosis in a network of processors
Authors: K. V. S. Bhat
Venue: Proceedings of the ACM '82 conference (1982)

In this paper, using a digraph model we present both exact and suboptimum algorithms for finding the maximum level of diagnosis capability offered by a given network of processors. The exact algorithm is based on the Chwa-Hakimi characterization for t-diagnosability and the suboptimum method uses an algorithm for maximum matching in bipartite graphs. Finally, using the notion of syndrome information set, an O(t3) algorithm is presented for t-diagnosis in a large D(N,t,X) system of interconnected processors. Syndrome processing is assumed to be done in a separate fault-free processor.
Design specifications for an information retrieval system management game
Authors: Mary Jane Lee, Gerald J. Lazorick
Venue: Proceedings of the ACM annual conference (1973)

An information retrieval system providing current awareness services is currently being designed within the framework of a management game. This management game, a computerized, non-competitive game, is purported to train the game player in the role of designer and manager of an information retrieval system. A general model of an information retrieval system will be developed which considers the macro components of such a system, i.e., data base, software, hardware, costs, number of users, etc. The game player initially specifies the system configuration and his policy decisions. During the development and operation of the information retrieval system, the player may maintain or modify the current system configuration and policies for the next time period based on periodic statistical output. A cost effectiveness function to evaluate the game player will also be developed which will measure learning interpreted as improvement in decision making skills.
SLIM-the translation of symbolic layouts into mask data
Authors: A. E. Dunlop
Venue: Proceedings of the 17th Design Automation Conference (1980)

A new form of symbolic layout for integrated circuits is coupled with a mask compaction procedure which removes excess space while guaranteeing that all design rules are met. Tradeoffs between X and Y compaction are made based on critical path information. Two types of compaction are used to minimize mask area and computer run-time. Additional procedures reduce mask area by inserting jogs at strategic locations in the layout. A partitioned data base is used to store mask data in a hierarchical manner. The symbolic layout and mask compaction procedures require only 30 to 50 percent of the time traditionally needed to do equivalent hand layouts.
TEXTEDITing using APL/700
Authors: Harvey W. Bingham
Venue: Proceedings of the eighth international conference on APL (1976)

TEXTEDIT is an APL application workspace for word processing that exploits the interactivity of Burroughs APL/700. Its purpose is to rapidly produce and maintain &ldquo;typewriter-style&rdquo; documentation of superior quality to normal manual typing. This is achieved by capturing draft text as typed, displaying it in finished format, accepting revisions easily, and filing draft or final text for subsequent updating or display. TEXTEDIT has been used for over four years by a variety of users, many with no knowledge of APL.
Implementation aspects of the symbol hardware compiler
Authors: T. A. Laliotis
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

One of the most outstanding features of the SYMBOL computer is its high level hardware compiler. This paper presents some aspects of the hardware implementation including the network characteristics of the communication scheme between compiler, system supervisor, and Memory Controller, the functional breakdown into distinct sections for implementation, the support hardware (registers, tables, etc.,), the Name Table structure, and some of the linking techniques for the structured output of the compiler.
Role of the business college in the education and training of computer systems analysts for public sector jobs
Authors: Fred G. Harold
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

This project was undertaken in an attempt to determine whether the present curriculum in those business schools which offer courses in computer-based systems concepts can provide educational preparation appropriate for government careers in automatic data processing systems development. For the purposes of this paper, the context in which the term &ldquo;systems analyst&rdquo; will be used will be restricted to computer-related tasks. This does not eliminate those individuals engaged in what is variously called &ldquo;applications analysis&rdquo;, &ldquo;information analysis&rdquo;, &ldquo;systems coordination&rdquo;, etc. from the scope of the study, so long as their work leads to a computer-based systems proposal (and, in most instances, eventual implementation). The study is further limited to the functions of systems development for what are generally classified as &ldquo;business&rdquo; applications&mdash;whether they occur in business per se or in government. Business applications are those characterized by the manipulation of large data volumes and the traditional file-handling processes of creation, maintenance, retrieval, formatting, reporting, summarization, and sorting&mdash;with only a minimal amount of complex mathematical computation.
A wire routing scheme for double-layer cell arrays
Authors: Guy Dupenloup
Venue: Proceedings of the 21st Design Automation Conference (1984)

A channel model for routing double-layer cell arrays is presented. A switch-box is defined as an overlapping area of a horizontal channel and a vertical channel. Along the sides of switch-boxes, dynamic terminals are generated by the loose router and moved by the final router. A channel router, that is an extension of the &ldquo;Dogleg Channel Router&rdquo; introduced by D.N. Deutsch in 1976, is described.
The design of a multi-microprocessor based simulation computer - II
Authors: John Craig Comfort
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

This paper presents further results in development of a discrete event simulation computer based on a network of micro processors. The network is being designed by identifying simulation tasks which may be performed in parallel with other computation required by the simulation, and then assigning those subtasks to attached processing elements in the network. The tasks of priority queue processing and state accounting are considered in this paper. A three attached processor simulation computer has been designed, using two processors for the event set and the third for state statistics accumulation. In a simulation model of this system, a forty to fifty percent reduction in the execution of a benchmark simulation program is easily achieved. (The benchmark program itself uses an adaptive scheduling algorithm). Further observations and suggestions for future research are presented.
Low bit rate model-assisted H.261-compatible coding of video
Authors: A. Eleftheriadis, A. Jacquin
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

We describe a method of object-selective quantizer control in a standard coding system based on MC DCT-CCITT Recommendation H.261. The approach is based on two novel algorithms, namely buffer rate modulation and buffer size modulation. By forcing the rate control algorithm to transfer a relatively small fraction-about 10-15% on average-of the total available bit rate from the coding of the non-facial to that of the facial area, in head-and-shoulders videoteleconferencing sequences, images with better-rendered facial features are obtained, i.e. blocky artifacts in the facial area are less pronounced and eye contact and lip-sync are preserved. The improvement was found to be perceptually significant on video sequences coded at the rate of 64 kbps, with 48 kbps allocated for the input (color) video signal in QCIF format.
An algorithm for automatic line routing on Schematic Drawings
Authors: R. J. Brennan
Venue: Proceedings of the 12th Design Automation Conference (1975)

An algorithm has been developed to produce automated line routing for Schematic Drawings. Aesthetics, elimination of manual interventions, reliability and consistency of results were among the primary goals of this development.
An algorithm for control memory minimization
Authors: M. Tsuchiya, T. Jacobson
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

This paper presents a procedure for determining the minimum number of microinstructions of a given bit length B required to code a microprogram. The procedure is applied to different values of B to determine the optimal method of implementing the microprogram in the control memory of a digital computer. The algorithm is essentially one of exhaustive evaluation, but a number of theorems are presented which reduce the computational effort involved. The algorithm is iterative in nature and seems to lend itself to implementation on a microprogrammed computer. An example is given to illustrate the algorithm.
The use of broadcast techniques on the universe network
Authors: A. Gillian Waters, Christopher J. Adams, Ian M. Leslie, Roger M. Needham
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

The Universe network is being used to explore broadcasting techniques in a highly integrated computer communications experiment connecting local area networks via a broadcast satellite channel. The broadcast protocol which has been devised within the Project provides a versatile framework in which different types of broadcast applications can be carried out. The requirements and definition of this protocol are described, and details are given of how the broadcast satellite channel is used and the implementation of the protocols in the system which provides satellite access from each site. Experimental use of the protocol is also described, in particular its use for file distribution. The paper also aims to show how the protocols could be used for more advanced applications.
Test generation for LSI: A case study
Authors: Magdy S. Abadir, Hassan K. Reghbati
Venue: Proceedings of the 21st Design Automation Conference (1984)

A new automatic test generation approach for LSI circuits has been presented in the companion papers [1,2]. In this paper we generate tests for a typical LSI circuit using the new approach. The goal of this study is to gain insight into the problems involved in using the test generation procedures. A formal model C for a 1-bit microprocessor slice is defined which has all the main features of commercially available bit slices such as the Am2901. The circuit C is modeled as a network of interconnected functional modules. The functions of the individual modules are described using binary decision diagrams, or equivalently using experiments derived from the diagrams. Using our test generation technique, we derive tests for the circuit C capable of detecting various faults covered by our fault model [1]. It is shown that backtracking is rarely needed while generating tests for C. Also, we show that generating a multiple vector test is not required for any of the faults considered in the study. The length of the circuit's test sequence is significantly reduced using the fault collapsing method. A discussion of how to model some of the features of LSI circuits that are not included in the circuit C is presented. A comparison between the length of the test generated by our method and other manually-generated ones is also presented.
Computation of coherent optical flow by using multiple constraints
Authors: M. Tistarelli
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The optical flow constitutes one of the most widely adopted representations to define and characterize the evolution of image features over time. In order to compute the velocity field, it is necessary to define a set of constraints on the temporal change of image features. We consider the implications in using multiple constraints arising from multiple data points. The first step is the analysis of differential constraints and how they can be applied, locally, to compute the image velocity. This analysis allows to relate each constraint to a particular gray level pattern. This approach is extended to multiple image points, allowing also the characterization of the temporal behaviour of the image features and to detect erroneous measurements due to occlusions, depth discontinuities or shadows. Several experiments are presented from real image sequences.
Computer generated images for medical applications
Authors: Alexander Sunguroff, Donald Greenberg
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Two computer graphics systems for the presentation of biomedical information for diagnosis and treatment planning are described. Both systems presented utilize computer tomographic (CT) data as input. One of the systems produces three-dimensional surface representations of organs and anatomical features found within the body. The other system is a radiation treatment planning aid which uses tomographic data in its computations.
World view from a satellite
Authors: Philip R. Westlake
Venue: ACM SIGAPL APL Quote Quad (1981)

A world map data base is processed by an APL program, called SATMAP, to represent the view of the earth seen from a satellite at any altitude, latitude, and longitude. The data base is processed by line segments characterized in terms of maximum and minimum latitudes and longitudes. This permits a more cost effective searching of the data base against a line-segment-visibility criterion than would be possible testing each point separately for visibility. The resultant view can then be presented on a suitable graphics and/or printer terminal such as a Tektronix 4015.
A programming language family for the navy AADC
Authors: James S. Miller
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

The U.S. Navy is sponsoring the development of a modern-technology computer system known as the All-Applications Digital Computer (AADC). Originally intended for avionics purposes alone, the promising success of the program so far has led to a broadening of its objectives. The impact of the operational system will occur over the 1975-1985 time period. If the costs of the hardware prove to be as low as predicted, not only will new applications be likely users of AADCs, but some degree of retrofitting may be expected as well.
Elementary first integrals of differential equations
Authors: M. J. Prelle, M. F. Singer
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

It is not always possible and sometimes not even advantageous to write the solutions of a system of differential equations explicitly in terms of elementary functions. Sometimes, though, it is possible to find elementary functions which are constant on solution curves, that is, elementary first integrals. These first integrals allow one to occasionally deduce properties that an explicit solution would not necessarily reveal.
On-line video computer feedback of teaching performance
Authors: A. J. Surkan, T. Hoover, L. Campbell
Venue: Proceedings of seventh international conference on APL (1975)

A set of interactive APL programs has been developed and used for monitoring and analyzing classroom verbal behavior. During teaching sessions, an observer directly enters at a terminal the changes of state in verbal activity. The data analysis performed by the programs is based on the Flanders Interaction Analysis Category System (FIAC System), a widely known and used classroom observation procedure. Data on ten categories of verbal activities are presented to the program as digits 0 through 9. Results from the program consist of five computed statistics and a frequency matrix displayed both as relative percentages and as absolute values. The complete program is available in APL during teaching sessions for execution in the APL/360, or the VMAPL-SV/370, APL-KRONOS environments. The program results are displayed, magnified in size and positioned on video monitors to provide immediate feedback to an instructor during each class. Data collected during an observation session can also be stored in the APL system as saved-variables for subsequent analyses and may be used for estimating observer reliability. The program package can be accessed by dial-up and can be accommodated in the standard public libraries of most APL systems.
Extending a report generator written in APL
Authors: David Hirschberg
Venue: Proceedings of the international conference on APL (1983)

This paper describes extensions made to an interactive report generator (ADRS2) written in APL, to handle multiple files, and specifically relational data bases, while still preserving its well-tested user interface. The user interface, the implementation and the application area of this extension are discussed. The method can be adapted to other interactive report generators written in APL.
Exploring Edge-Based Input Techniques for Handheld Text Entry
Authors: Jacob O. Wobbrock, Brad A. Myers, Scott E. Hudson
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We are investigating how handheld devices like Palm PDAs and PocketPCs can be used as assistive technologies for computer access by people with motor impairments such as Muscular Dystrophy and Cerebral Palsy. As part of this research, we are developing new input techniques for handheld text entry. People with motor impairments suffer from symptoms that affect their ability to use conventional text entry methods. One symptom is a lack of stability in stylus movements caused by tremor or spasm. In an effort to create a more stable means of text entry, we are researching how to leverage elevated physical edges in our development of new text entry techniques. We present three edge-based techniques: Edge Keyboards, CornerSlide, and EdgeWrite.
A device-independent network graphics system
Authors: Deborah U. Cahn, Albert C. Yen
Venue: ACM SIGGRAPH Computer Graphics (1983)

The design and implementation of a basic graphics system for a heterogeneous network environment is described. The design has been influenced by the SIGGRAPH Core System, GKS, and proposals being considered by the ANSI Technical Committee on Computer Graphics Programming Languages. It permits hierarchical object definition, direct and indirect attribute specification, screen window management and complex styles of interaction. Important parts of the implementation include a device-independent database for graphical objects, a workstation driver which produces device code, and a device kernel which manages the display list. Problems relating to device independence and network partitioning are discussed.
The impact of microcomputers on APL
Authors: Philip A. Van Cleave
Venue: Proceedings of the international conference on APL (1982)

The advent of the Motorola 68000, a 16/32 bit microcomputer, now makes it possible to have a full-featured APL system and not have to sacrifice speed or the multi-megabyte workspace that you have become accustomed to (or, more likely, fantasized about) on your timesharing mainframe. This paper will discuss how the Motorola 68000, and the coming generation of 32-bit microcomputers will affect APL's direction and future, as well as open a vista of applications that previously could not be done in a practical manner using APL. The Computer Company's APL.68000 will be our case in point. The term &ldquo;mainframe&rdquo; when used in this paper will refer to both large IBM 370 class computers as well as minicomputers (HP 3000, DEC 2020, etc.).
Cache memories for PDP-11 family computers
Authors: WILLIAM D. STRECKER
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

This paper gives a summary of the research which led to the design of the cache memory in the DEC PDP-11/70. The concept of cache memory is introduced together with its major organizational parameters: size, associativity, block size, replacement algorithm, and write strategy. Simulation results are given showing how the performance of the cache varies with changes in these parameters. Based on these simulation results the design of the 11/70 cache is justified.