ppxscal/embedding_network huggingface dataset:
On multi-valued perfect codes
Authors: S. Kaneyori, T. Kitahashi, K. Tanaka
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In the present paper necessary conditions for perfect codes are investigated and the following results are obtained from the discussion. (1) There exsists no 4-Hamming-error-correcting 3 -valued perfect code. (2) There are no e(&ge;2)-Lee-error-correcting perfect codes of length 3.
A new solution to the critical section problem
Authors: Howard P. Katseff
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A classical problem in concurrent program control is to provide a mechanism whereby several processes running concurrently can gain exclusive control of a resource. For each process, the section of its program in which it accesses the resource is called its critical section, and the problem is called the critical section problem. A solution to the critical section problem guarantees that no more than one process can be in its critical section at any time. The solution presented here improves on previous solutions by allowing processes to enter their critical sections on a first-come first-served basis.
A simulator to replace wire rules for high speed computer design
Authors: Adrian Hlynka
Venue: Proceedings of the 18th Design Automation Conference (1981)

Signal quality is of great concern on PC boards containing high speed logic. Improper positioning of loads in a network can cause reflection problems. Traditionally engineers have dealt with this by imposing wire rules on the layout process. The use of simulators during layout can be more accurate and less restrictive than wire rules. To make this possible, the simulator must not only simulate reflection noise but determine how to add the minimum amount of etch to solve the reflection problem. A unique algorithm that does this is described here.
A recursive computer architecture for VLSI
Authors: Philip C. Treleaven, Richard P. Hopkins
Venue: ACM SIGARCH Computer Architecture News (1982)

We present a general-purpose computer architecture based on the concept of recursion, suitable for VLSI computer systems built from replicated (LEGO-like) computing elements. The recursive computer architecture is defined by presenting a program organisation, a machine organisation and an experimental machine implementation oriented to VLSI. The program organisation, called recursive control flow, attempts a synthesis of the concepts underlying traditional control flow, data flow and reduction, to exploit the individual strengths of each organisation. The machine organisation is based on replicated general-purpose computing elements, as well as special-purpose computing elements that allow the function of individual computer systems to be specialised. These elements are interconnected to form a larger computer system and cooperate in the concurrent execution of a program. The experimental implementation is being restricted to simple, identical microcomputers each containing a memory, a processor and a communications capability. This future generation of LEGO-like computer systems are termed fifth generation computers [1] by the Japanese.
Discussion on papers of mussio-wahlstrom and seiner
Authors: Charles D. Lothridge
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

As background for this discussion, I would like to talk briefly about some of the aspects of psychological tests that make their use attractive to us, some of the procedures and techniques we usually follow when assessing the appropriateness or usefulness of these instruments as well as some of the cautions we attempt to observe in their development and use. I think this may give us a framework for looking at the two papers we have just heard. One of the reasons for our interest in psychological tests is that we are continuously searching for ways to increase the accuracy of our predictions about individuals, whether they are candidates for a job, candidates for a training course, or candidates for admission to a college or university.
Some computer-aided approaches to housing
Authors: Anthony Schnarsky
Venue: Proceedings of the 8th Design Automation Workshop (1971)

It is happening. The fragmentation in the building industry is beginning to congeal. The mobile home industry has grown from 60,000 units per year in 1947 to over 400,000 units per year in 1970. National Homes Corporation produced 28,000 houses in 1970, a bad year in building. Levitt Technology is building an automated plant to produce houses. The concept of the house as a product of industrialized processes is a reality. I am concerned about the effect of this process on the future texture of our residential environment. The process and its economies are efficient but not a justification for the types of solutions that are beginning to appear.
A simulation study of time-slicing in non-exponential service environment
Authors: William G. Bulgren, Lee-Ho Hwang
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

This paper describes a simulation study of various job scheduling algorithms that are currently being utilized in modern computer systems. The emphasis is to study the effect of non-exponential service distributions on job scheduling efficiency. The statistics of concern are average quantum size, average idle time and average waiting time.
Simulation programming with Ada
Authors: Wilhelm F. Bürger
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

This tutorial session deals with features of ADA which are of interest for formulating simulation problems. A general overview of ADA is given with emphasis on packages and tasking. A simulation package for discrete event simulation will be sketched.
Office automation: Organizational learning and technological change
Authors: Mary Sumner
Venue: ACM SIGOA Newsletter (1984)

The purpose of this study is to describe the process of office technology growth within sixteen companies. This growth process involves not only the expansion of office technologies and applications but also the process of organizational learning. In this study, the evolution of office automation is depicted using an analysis of technology benchmarks, applications portfolio, organizational strategies for systems development and operations support, and planning and control activities. The analysis of firms experiencing office technology growth reveals certain stage characteristics similar to those reported in previous research by Nolan and Zisman. Office technologies, initially introduced to mechanize tasks, rapidly proliferate and drive a process of experimentation monitored by analysts representing a central MIS organization. At initial phases the role of data processing is in establishing guidelines for technology acquisition and in establishing standards for an information technology architecture which will support office applications on both centralized and decentralized systems. After gaining experience in designing office applications, organizations in more mature stages of development decentralize the responsibility for systems development, while maintaining centralized control over hardware operations and systems support.
SIGBDP 8 (Panel Discussion): Performance measurement
Venue: Proceedings of the 1975 annual conference (1975)

Three people active in the field of measurement of computer performance will share their views of what measurement is doing to us. Is it improving the quality of life or anything else? Is it causing more problems than solutions? The panelists will explore who should be doing monitoring, what should really be measured, and for what purpose.
Influence of Word Length on Handwriting Recognition
Authors: F. Grandidier, R. Sabourin, A. El-Yacoubi, M. Gilloux, C. Y. Suen
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Two strategies can be considered in handwriting recognition: phrase or word approaches. In this paper we want to demonstrate the superiority of the phrase one, especially in city name recognition. The performances of an HMM-based off-line system using an analytic approach with explicit segmentation are evaluated on 2 databases: (i) city names in full and (ii) city names in single words. A difference between their performances is observed, principally caused by the dissimilarity of word lengths between the databases. After generating other data sets and lexicons, experiments were performed yielding results which lead us to conclude that word length in the data set as well as in lexicons, significantly influences recognition performance, and also that is preferable to perform city name recognition based on phrase approach than word recognition.
The rendezvous and monitor concepts: Is there an efficiency difference?
Authors: W. Eventoff, D. Harvey, R. J. Price
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

The efficiency of Ada's rendezvous concept is compared with Concurrent Pascal's monitor concept. The differences between the two approaches, as well as a number of issues relating to their implementation, are presented. The results indicate that a concurrent programming language should provide both types of concepts.
An improved hands-on approach to teaching systems programming and the impact of structured programming
Authors: Roger T. Cooper, Malcolm G. Lane
Venue: ACM SIGCSE Bulletin (1976)

The use of the hands-on approach for teaching systems programming presented at the 1974 SIGCSE Conference has proved to be even more successful in the past two years. The reasons for the increased success are given. An approach of using structured assembler language concepts as an integral part of the systems programming course is introduced and discussed. Specific examples of the use of several structured programming macros are presented.
Graph pebbling with many free pebbles can be difficult
Authors: David A. Carlson, John E. Savage
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

The pebble game on directed acyclic graphs can be used to model the space-time tradeoff behavior of a straight-line algorithm (SLA). In this game, the maximum number of pebbles used at any one time corresponds to the number of temporary registers available and is called space. The number of moves made to reach the outputs of the graph, or the time, corresponds to the number of operations required by the SLA. In this paper, it is shown that there exist infinite families of constructible graphs on N nodes which possess an extreme time-space tradeoff. For a particular set of graphs, if space is restricted to fall in the range of &THgr;(log N) to &THgr;((@@@@N/log N)), then the pebbling time necessary is superpolynomial in N. This result is obtained by deriving a lower bound on time when extra space is restricted, and then diagonalizing over the amount of this space. An extension of this argument shows that the minimum space requirement for such constructible graph families can grow as any slowly increasing function of N.
The graph model of behavior simulator
Authors: Rami R. Razouk, Gerald Estrin
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

This paper describes an interactive simulator developed at UCLA as part of the SARA system. This simulator, in conjunction with other design tools of the SARA system, allows the user to model the behavior of the system being designed at various levels of detail. The models which drive the simulator are control graphs and associated data graphs. The simulator uses the control graph to express synchronization of sequences of events. Initiation of any control node triggers the simulator to call on the data graph model to provide interpretation of a process at a desired level of abstraction. The simulator gives the user the capability to examine, or modify, the state of the control and data graphs during a simulation.
Integrating databases with programming environments
Authors: Murray R. Berkowitz
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

The efficiency and quality of nearly all computer system developments are severely impacted by the lack of integrated, high-quality software tools and computing environments to support developers and managers through all phases of the software life cycle. The concept underlying &ldquo;programming environments&rdquo; is the development of an integrated computer system specifically for software engineering and management, to improve software development productivity and product quality, and to aid in software maintenance after delivery. The characteristics of programming environments, their nature and expected benefits, are briefly described. The role of a central, integrated database as the foundation of a comprehensive pogramming environment is examined. The key issues in the design of a database for a programming environment are discussed. Examples illustrate relative advantages and disadvantages of different approaches to the problem.
Shape-extraction for curves using geometry-driven diffusion and functional optimization
Authors: E. J. Pauwels, P. Fiddelaers, L. J. Van Gool
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

In this paper we show how both geometry-driven diffusion and optimization of the Mumford-Shah functional can be used to develop a type of curve-evolution that is able to preserve salient features of closed curves (such as corners and straight line segments), while simultaneously suppressing noise and irrelevant details. The idea is to characterize the curve by means of its angle-function (i.e. the angle between the tangent and a fixed axis) and to apply the appropriate dynamics to this one-dimensional representation. We show how constrained evolution equations can be used to keep the corresponding curve closed at all times.
ARTSPEAK: A graphics language for artists
Authors: Caroline Wardle
Venue: ACM SIGGRAPH Computer Graphics (1976)

There is increasing interest in the use of computer graphics by artists. Graphics languages can be divided into several types, a common type being subroutine packages embedded in a high-level language. FORTRAN-coded EXPLOR (1) and ALGOL-coded PICTURES (2) fall into this category. Another approach is to implement a set of procedures designed for a particular application, an example of this being PDL-Picture Description Language(3,4) which is intended for the computer artist. However, there are few high-level languages designed to facilitate the production of computer art, a recent exception being ESP3 (5) which combines line drawing with pattern recognition. ARTSPEAK (6) was designed to simplify programming for the inexperienced (and probably mathematically-naive) user. The language is simple but has all the characteristics of a high-level language. It contains a powerful curve generating feature which encourages &ldquo;free-hand&rdquo; drawings as well as geometric drawings.
Large arrays and files
Authors: Roland Pesch
Venue: Proceedings of the international conference on APL (1982)

Current APL file systems force explicit iteration on each filed item and are difficult to use. A file system in which files are addressed as APL variables is described. It is made up of four components, each useful in its own right. Two have already been implemented: enclosed arrays and the shared variable processor. Two are proposed in the paper: storage outside the workspace of large enclosed values, and a simple auxiliary processor to store by name, and later initialize, values of variables shared with it.
Queueing analysis of a canonical model of real-time multiprocessors
Authors: C. M Krishna, K. G Shin
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

Multiprocessors are beginning to be regarded increasingly favorably as candidates for controllers in critical real-time control applications such as aircraft. Their considerable tolerance of component failures together with their great potential for high throughput are contributory factors. In this paper, we present first a logical classification of multiprocessor structures with control applications in mind. We point out that one important subclass has hitherto been neglected by the analysts. This is a class of systems with a common memory, minimal interprocessor communication and perfect processor symmetry. The performance characteristic of the greatest importance in real-time applications is the response time distribution. Indeed, we have shown in a separate paper [2] how it is possible to characterize rigorously and objectively the performance of a real-time multiprocessor given the application and the multiprocessor response time distribution and component failure characteristics. We therefore present here a computation of the response time distribution for a canonical model of real-time multiprocessor. To do so, we approximate the multiprocessor by a blocking model and present a means for efficient analysis. Two separate models are derived: one created from the system's point of view, and the other from the point of view of an incoming task. The former model is analyzed along largely conventional lines. For the latter model, an artificial server is used, and the system is transformed into a queueing network.
Hierarchical decomposition and simulation of manufacturing cells
Authors: Charles J. Antonelli, Richard A. Volz, Trevor N. Mudge
Venue: Proceedings of the 16th conference on Winter simulation (1984)

A useful tool in the development of flexible automation is a system description language which can generate complete functional description of a manufacturing cell of arbitrary complexity. We propose a description system based on the concept of hierarchical decomposition utilizing the Ada1 programming language in conjunction with established diagrammatical decomposition methods. Simulation is often an indispensable tool in the development of manufacturing systems. We show how a simulation of the operation of the manufacturing cell can be embedded in its description. Finally, we apply the methodology to a specific instance of a manufacturing cell.
A procedure for checking the topological consistency of a 2-D or 3-D finite element mesh
Authors: Kenneth Preiss
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes procedures for checking the topological consistency of two- or three-dimensional finite element meshes. Two-dimensional meshes may include mixtures of triangles, quadrilaterals and other polygons, with optional side and center nodes. Three dimensional meshes may include tetrahedra and brick-shaped elements, with optional edge, face or center nodes.
Software engineering applied to computer-aided design (CAD) software development
Authors: D. Nash, H. Willman
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper briefly discusses software engineering and its relationship to CAD. We look at: &bull; software engineering and the software life cycle &bull; the characteristics of CAD software &bull; a survey of software engineering use in CAD &bull; recommendations for the use of software tools in CAD &bull; recommendations for the development of new software engineering techniques to aid the CAD developer.
Data base systems for large and small computers
Authors: Ivan Flores
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

There is a big difference between the needs of the large computer installation and the small microcomputer user. The collection of data that both use is called a data base, (DB hereafter). It is unfortunate that &ldquo;data base&rdquo; is used in a different sense by these two classes of users. First I examine DBs for large computers. Then I will talk about the needs of small computer users and how they are met by DB systems on the market. Finally I describe each DB function and give examples to illustrate how they work.
Design and simulation of the distributed loop computer network (DLCN)
Authors: Cecil C. Reames, Ming T. Liu
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The primary goals of this paper are two-fold: 1) to present the design and hardware implementation of the interface transmitter for the Distributed Loop Computer Network (DLCN), using a novel shift-register insertion message transmission mechanism, and 2) to discuss simulation results comparing DLCN with Pierce and Newhall loops, which verify earlier claims as to DLCN's superior performance.
Handling of floating point exceptions
Authors: Thomas W. Eggers, Judson S. Leonard, Mary H. Payne
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

An IEEE subcommittee on the standardization of microprocessor floating point arithmetic has a proposal under discussion. Part of that proposal concerns overflow and underflow exceptions. The proposal calls for a &ldquo;gradual&rdquo; underflow implemented with demoralized numbers. For a sequence of addition/subtraction operations, the gradual underflow works very well: it almost has the effect of a machine with infinite range numbers. But if an addition/subtraction sequence is interrupted by a multiply or divide, things don't work nearly as well, and a fallback to symbolic information is likely. The proposal helps overflow hardly at all.
The operating system and language support features of the BELLMACTM-32 microprocessor.
Authors: Alan D. Berenbaum, Michael W. Condry, Priscilla M. Lu
Venue: ACM SIGARCH Computer Architecture News (1982)

The BELLMAC-32 microprocessor is a 32-bit microprocessor, implemented with CMOS technology, designed to support operating system functions and high level languages efficiently. The architecture was designed with the following objectives in mind: &bull; High performance. &bull; Enhanced operating system support capabilities. &bull; High level language support. &bull; High reliability, availability and maintainability.
An evaluation of expanded function auxiliaries in general dentistry
Authors: Kerry E. Kilpatrick, Richard S. Mackenzie, Allen G. Delaney
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A simulation model of private dental practice has been developed to evaluate the effects of introducing expanded function auxiliary personnel. The model permits the experimental investigation of a variety of staffing patterns and facility configurations. Results of these experiments indicate that a solo practice can expand its patient volume 169% and increase net revenue by 233% by adding expanded function auxiliaries while simultaneously reducing patient waiting time and the time spent at chairside by the dentist. Field validations of the simulation results are described.
A segmented transformed display file for APL GRAPH-II
Authors: Ned Thanhouser
Venue: Proceedings of seventh international conference on APL (1975)

This paper describes additional functions which may be added to APL GRAPH-II to provide the capability for maintaining a segmented file of transformed display code. These functions extend the usefulness of APL GRAPH-II by allowing the programmer to capture the transformed graphic output of his programs. Graphic output is saved and then subsequently may be appended to, displayed, or deleted. This feature permits part of a picture to be changed without the need for re-generation of the whole picture. This results in large savings in computational overhead needed to generate a whole picture, an operation done frequently on storage tube graphic displays.