ppxscal/embedding_network huggingface dataset:
The N. mPc system description facility
Authors: Charles W. Rose, Larry A. Rogers, Ralph V. Straubs
Venue: Proceedings of the 16th Design Automation Conference (1979)

N. mPc [1], an interactive environment for the design and evaluation o f microprocessor-based systems, has been developed and implemented at Case Western Reserve University. N.mPc contains five separate tools which work together to produce a functional register transfer level simulation of multiple processor, heterogeneous target systems. A system block diagram is shown in Figure 1. A meta assembler, metaMicro [2], allows the user to specify the Format, mnemonics, and associated bit patterns of the target instruction set. It maps mnemonics into bit strings, and outputs the instructions in a control/memory allocation graph which is machine independent.
Prototype Learning Algorithms for Nearest Neighbor Classifier with Application to Handwritten Character Recognition
Authors: Cheng-Lin Liu, Masaki Nakagawa
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper reviews some prototype learning algorithms for nearest neighbor (NN) classifier design and evaluates their performances in handwritten character recognition. The algorithms include the well-known LVQ and those that globally optimize an objective function, as well as some newly derived variants. Experimental results of handwritten numeral recognition and Chinese character recognition show that the global optimization algorithms generally outperform LVQ. Particularly, the generalized LVQ of Sato98 and a new algorithm MAXP2 yield best results.
SIGCAS (Panel Session)
Authors: Barry W. Boehm, Harry D. Huskey, Alan B. Kamman, Michael R. Lackner
Venue: Proceedings of the 1976 annual conference (1976)

There is great potential impact of computers on any nation. Well-used, computers can increase the utility of human and material resources. Poorly-used, they provide a further drain on already strained resources. It is therefore imperative that developing nations learn from our mistakes and do not repeat them. This panel will discuss, and hopefully encourage others to discuss, the problems of introducing and applying computers in developing nations, the solutions which appear to be feasible, and the contributions we may make to these solutions.
A combination of field and current access techniques for efficient and cost-effective bubble memories
Authors: Mokhtar Boshra Riad
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

Bubbles have several attractive characteristics which could lead to major use of bubble memories in future computer systems. Being block-organized memories, fundamental improvements will be necessary to reduce the mean access time and increase the data transfer rate. Organizations of permal-loy bar memories are presented, in which two basic techniques are available for providing bubble propagation: 1. Field-access (simple structure and slow propagation). 2. Current-access (complex structure and fast propagation). All classical organizations are based on field-access technique whose limited frequency imposes many restrictions on maximum chip capacity and performance.A family of new organizations is proposed, based on a combination of the two techniques: field-access for &ldquo;storage register&rdquo; and current-access for &ldquo;access register&rdquo; shifting. Access register bits are themselves part of storage registers, avoiding use of transfer gates and useless data alignment in access registers. Multiple access registers are permitted in the chip to give simultaneous access to many bits. Start-stop capability and bidirectional shifting of bubbles are exploited in the new organizations.
Extensibility - a new approach for designing machine independent microprogramming languages
Authors: David J. DeWitt
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

This paper describes a new technique for designing high level machine independent microprogramming languages. In Section 1.0 we will discuss some design considerations for microprogramming languages and will review the previous efforts in the area of microprogramming languages. In Section 2.0, we will discuss extensible languages - what they are and why they are useful. Then in Section 3.0, we will show why an extensible microprogramming language resolves most of the difficulties inherent in designing a language for microprogramming. This section will also include a description of the language EMPL - our extensible microprogramming language. We will define its syntax, give some examples of how its extensible features can be used and finally will demonstrate the feasibility of constructing such a compiler.
New file management in P-STAT (abstract only)
Authors: Roald Buhler
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

In January of 1981, the Center for the Study of Youth Development initiated an on-line catalog of the holdings of its specialized library consisting of 10,000 monographs, journals, vertical file materials, etc. The present paper discusses the reactions of the end-user or patron population to the resource. The background of the library automation project -- including issues of cost-effectiveness, increased power, and user utility--is discussed in order to establish the initial goals of this activity. Then, attention is given to how the project was implemented; this includes a comparison of preliminary goals with what ultimately was delivered. The transition from a COM catalog to the on-line catalog required training of patrons (some of whom had little or no experience with a computer terminal), and only half of the Center staff participated in the initial training sessions. Preliminary patron behavior is reviewed, and an attempt to informally analyze both positive and negative experiences is offered. The initial experiences are summarized in a discussion of the problems and prospects of the user interface of the "query" portion of the on-line catalog software.
HDLC reliability and the FRBS method to improve it
Authors: J. Selga, J. Rivera
Venue: Proceedings of the seventh symposium on Data communications (1981)

In view that some international bodies in the field of Telecontrol systems propose reliability requirements for line protocols which are not fulfilled by standard HDLC,here a detailed analysis of the reliability of HDLC is given and the statistical properties of sequences using the Bit Insertion Mechanism are analyzed. The final result is a proposal of a method,the Four Redundancy Bit Sequence method: (FRBS),which seems able to be added without much trouble before and after the HDLC layer to yield a protocol with the desired characteristics.
Reliability techniques applicable to message processors
Authors: W. C. Carter
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Computing systems execute algorithms incorrectly because of errors introduced by hardware failures, program fallacies or total system flaws. For further references, the articles in the bibliography, and their references, refer to almost all the original articles about reliability techniques. System flaws can be the result of incorrect total problem analysis or human control error. Such flaws will not be considered further here because of their sensitivity to particular application environments. Reliability can be considerably increased by eliminating as far as possible program and circuit z design, and by facilitating the repair of faulty components. In order to eliminate redesign the circuits and programs should be tested against their functional specifications. Many special techniques have been evolved to do this, and proper system design automation support is very necessary.
Fast algorithms under the extended riemann hypothesis: A concrete estimate
Authors: Eric Bach
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Several results in theoretical computer science use the following theorem: For a positive integer q, let Z-&-bull;q denote the multiplicative group of all integers x, 0-&-lt;x-&-lt;q, that are relatively prime to q. Let G be a proper subgroup of Z-&-bull;q. Then, assuming the Extended Riemann Hypothesis, there is a constant C such that if q is sufficiently large, Z-&-bull;q-&-minus;G contains a positive integer N-&-le;C (logeq)2. We show that for q-&-ge;106, one may take C-&-equil;60. As an application, we discuss a deterministic polynomial-time primality test. Miller proved that such algorithms must exist if the ERH is true, but we are unable to specify one without the concrete information given above. We eliminate this difficulty, and show how to implement a fast primality test.
Combining tags with error codes
Authors: Richard H. Gumpertz
Venue: ACM SIGARCH Computer Architecture News (1983)

Many computer systems include extra bits in each word of storage to allow detection (and possibly correction) of memory failures. These same bits can be used to implement tag-checking without sacrificing their normal error-handling properties. The tagging facility so provided can be used to detect a variety of hardware and software errors that might otherwise go undetected. Because no extra storage is required, the cost of adding such tagging can be small even though the benefit derived can be large.
Response time distributions for a multi-class queue with feedback
Authors: Simon S. Lam, A. Udaya Shankar
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

A single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin the end of the queue for more service. The number of rounds of service required by a customer is a random variable with a general distribution. Our main contribution is characterization of response time distributions for the customer classes. Our results generalize in some respects previous analyses of processor-sharing models. They also represent initial efforts to understand response time behavior along paths with loops in local balanced queueing networks.
A concurrent computer architecture and a ring based implementation
Authors: Edward P. Farrell, Noordin Ghani, Philip C. Treleaven
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

A multi-instruction-multi-data stream computer architecture is presented which is aimed at supporting highly concurrent general-purpose computation. The proposed machine is organised as a set of autonomous resources, each having direct access to a common intercommunication medium which is implemented as a rotating ring. The machine language is based on a generalised concept of control which provides an alternative to the data flow organisation for highly concurrent programming. The progress of a concurrent computation is characterised by the flow of packets of work through resources via the ring. This information flow is organised in such a way as to optimise concurrent operation of the resources and to simplify allocation and intercommunication. Initial simulation results are presented to show the feasibility of the architecture.
A Radar Reflectance Model for Terrain Analysis Using Shape from Shading
Authors: Richard C. Wilson, Edwin R. Hancock
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes work aimed at developing a practical shape-from-shading process for terrain analysis from radar imagery. The paper commences by providing an analysis of the radar reflectance properties of terrain structures. By using ground truth elevation data, we provide an empirical study of the radar reflectance characteristics for large-scale terrain features. The main conclusion of this study are twofold. Firstly, we show that radar has a strong backscatter component. Secondly, we show that the radar noise has a tail which extends to large reflectance values. Based on these observations we develop a semi-empirical shape-from-shading algorithm. We illustrate the effectiveness of the algorithm in extracting surface orientation information from radar images of a mountainous area of terrain in North Wales.
GMSS graphic modelling and simulation system
Authors: R. R. Willis
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

GMSS is a simulation modelling system providing a tool kit of functions to support the automation needs of simulation analysis. The goal of GMSS is to put simulation modelling into the hands of the decision maker.
Retraction: A new approach to motion-planning
Authors: Colm ó'Dúnlaing, Micha Sharir, Chee K. Yap
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

The two-dimensional Movers' Problem may be stated as follows: Given a set of polygonal obstacles in the plane, and a two-dimensional robot system B, determine whether one can move B from a given placement to another without touching any obstacle, and plan such a motion when one exists. Efficient algorithms are presented for the two special cases in which B is either a disc or a straightline segment, running respectively in time 0(n log n) and 0(n2 log n). To solve the problem for a disc one uses the planar Voronoi diagram determined by the obstacles; in the case of a line-segment one generalizes the notion of Voronoi diagram to the 3-dimensional configuration space of the moving segment.
A microprogrammed implementation of an architecture simulation language
Authors: William C. Hopkins, Gary Davidian
Venue: ACM SIGMICRO Newsletter (1977)

A &ldquo;Machine Representation Language&rdquo; (MRL), a tool for the evaluation and simulation of the instruction sets of computers, was designed for research in computer architecture. A novel hypothetical machine to perform the simulation uses an acyclic directed graph as its machine language. MRL requires an expandable associative memory and a recursive execution environment; the research requires extensive instrumentation of the simulation. A microprogrammed implementation satisfying these requirements was completed on the Burroughs B1700 within an academic semester. Comparisons of implementation techniques and performance between the microprogrammed system and a developmental system using Snobol-4 show the utility and efficiency of the approach.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

GPSS (General Purpose Simulation System) is a simulation programming language whose use greatly eases the task of building computer models for discrete-event simulations. GPSS is easier to learn than the statement-oriented simulation languages such as GASP [8] and SIMSCRIPT [9]. It is less flexible than the statement oriented languages, however, even though it can be interfaced with FORTRAN subroutines (for examples, see [2] and [6]), and PL/1 procedures. A thorough-going comparison of GPSS and SIMSCRIPT has been presented in [5]. The GPSS tutorial will present a basic set of GPSS &ldquo;building blocks,&rdquo; then illustrate their use in the context of a simple one-line, one-server queuing system.
Human-computer interface considerations in the design of personal computer software
Authors: Sundaresan Jayaraman, Mary Jane Lee, Milos Konopasek
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper examines some aspects of the design considerations of the human-computer interface as related to personal computers. It is shown that the success of a popular personal computer software product, visiCalc, may be attributed to a thoughtful reconciliation of these design factors with the hardware constraints. The trends of advancement in personal computer software for management-science- engineering problem-solving and decision-making are exemplified by discussing the microcomputer implementation of the Question Answering System on mathematical models and related data bases.
Perspectives: Computers, tools, and people
Authors: David N. Smith
Venue: Proceedings of the ACM '81 conference (1981)

Mankind has used tools since prehistory. Although the technology of tools has long been of interest and much has been written on the subject, the development and effect of tools on people and society is not as widely studied. This talk examines, using historic analogy, what effects tools can have on people, their work, and on society. Various tools and technologies from the stone age through modern time are examined. Some parallels with the computer age are drawn.
Computability concepts for programming language semantics
Authors: Herbert Egli, Robert L. Constable
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

This paper is about mathematical problems in programming language semantics and their influence on recursive function theory. We define a notion of computability on continuous higher types (for all types) and show its equivalence to effective operators. This result shows that our computable operators can model mathematically (i.e. extensionally) everything that can be done in an operational semantics. These new recursion theoretic concepts which are appropriate to semantics also allow us to construct Scott models for the &lgr;-calculus which contain all and only computable elements. Depending on the choice of the initial cpo, our general theory yields a theory for either strictly determinate or else arbitrary non-deterministic objects (parallelism). The formal theory is developed in part II of this paper. Part I gives motivation and comparison with related work.
The futures of database management
Authors: Gordon C. Everest
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

This paper explores some futures of database management. A review of the historical development of database management facilities reveals a dichotomy of systems into host-language database management systems for application programmers, and self-contained database management systems for nonprogramming users. Development trends indicate that future systems will combine facilities to serve both the programming and nonprogramming users, will be functionally more complete, and will offer greater data independence and a simpler user interface. The CODASYL Data Base Task Group proposal is the only possible candidate for a standard yet it still presents some serious weaknesses. With the development of systems based upon Codd's relational data model, IBM could become a dominant force in database management systems in the next decade. Emerging technology includes computer architectures with functionally-distinct, asynchronous processors some using associative processing techniques. A separate database management machine can yield better performance and greater data integrity.
Synchronous path analysis in MOS circuit simulator
Authors: Vishwani D. Agrawal
Venue: Proceedings of the 19th Design Automation Conference (1982)

For verifying the timing performance of synchronous MOS circuits a path analysis facility has been developed in the MOTIS (MOS Timing Simulator) system. This path analysis traces the clock signals to the latches in the circuit, computes the clock skews and then performs a path search analysis between all latches. For the paths between clocked latches, the timing constraints are determined using the clock skews and the operating frequency. The paths that do not satisfy these constraints are identified as problem paths. Such an analysis does not require a prior generation of circuit stimuli that are necessary for simulation. In terms of complexity also, it is simpler than simulation.
First course in computer science, a small survey
Authors: T. Furugori, P. Jalics
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

In many disciplines, the introductory courses are well standardized as to what should be covered, how the subject is to be taught, and how student's performance is to be measured. Such is certainly not the case in Computer Science, where we constantly debate what should be taught, what programming language is to be used, the nature of assignments to be given, etc. We wanted to see how other schools were teaching this first course, so we sent questionnaires to all the Universities listed in the ACM Graduate Assistantship Directory. From the 44 schools responding to the survey, we want to share some interesting facts concerning the manner in which Computer Science is taught.
Introduction to GASP IV
Authors: A. Alan B. Pritsker
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

GASP is a simulation language that provides an organizational structure to build models that can be used to simulate the dynamic performance of systems on a digital computer. The organizational structure of GASP allows the variables that define system performance to be described by equations and logical conditions. System descriptions written in terms of difference or differential equations are referred to as continuous models. System descriptions written in terms of discrete changes based on logical conditions are referred to as discrete models. GASP supports the modeling of continuous and discrete models and a combination of the two. The organizational structure of GASP specifies where and how system equations are written and the procedure for defining logical conditions that affect system variables. In GASP, an event approach is taken that specifies that discrete changes can only occur at event times. By using a defined organizational structure, GASP can perform the time advancement functions required by a simulation model and call specific user-written routines to obtain system performance updates and system performance changes.
The assignment axiom and programming language design
Authors: George T. Ligler
Venue: Proceedings of the 1976 annual conference (1976)

One way to approach software reliability is to design programming languages that satisfy criteria which ensure that undesirable semantic effects cannot occur. The effect of using the assignment rule of Hoare as such a criterion on the design of procedure-oriented, block-structured programming languages is investigated; after details of the Hoare formalism are discussed, language design guidelines derived from formal studies are informally presented and justified.
Internal connection problem in large optimized PLAs
Authors: Samuel Chuquillanqui
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a method to generate a path between any point of an &ldquo;input segment&rdquo; or an &ldquo;output segment&rdquo;, appearing inside a topological optimized PLA, and any point of the vicinity of the corresponding input or output terminal node, located on the periphery of the PLA. This method solves the internal routing problem by considering a number of obstacles constituted by the internal circuit elements (i.e. the transistors, ground lines, ground refresh lines, ...). The routing process is performed inside the PLA planes. Two kind of algorithms are presented. They respectively aim to solve the internal routing either in a double layer model, or in a single layer model. In both cases the shortest path is chosen, and the corresponding connection is placed by avoiding any violation of the design rules of the technology which is used.