ppxscal/embedding_network huggingface dataset:
Writer Adaptation of Online Handwriting Models
Authors: Scott D. Connell, Anil K. Jain
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Writer-adaptation is the process of converting a writer-independent handwriting recognition system, which models the characteristics of a large group of writers, into a writer-dependent system, which is tuned for a particular writer. Adaptation has the potential of increasing recognition accuracies, provided adequate models can be constructed for a particular writer. The limited amount of data that a writer typically provides makes the role of writer-independent models crucial in the adaptation process. Our approach to writer-adaptation makes use of writer-independent writing style models (called lexemes), to identify the styles present in a particular writer's training data. These models are then retrained using the writer's data. We demonstrate the feasibility of this approach using hidden Markov models trained on a combination of discretely and cursively written lowercase characters. Our results show an average reduction in error rate of 16.3% for lowercase characters as compared against representing each of the writer's character classes with a single model.
Proof of the equivalent realizability of a time-bounded arbiter and a runt-free inertial delay
Authors: B. I. Strom
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper proves that, given a reliable time-bounded arbiter, it is possible to realize a reliable (i.e. runt-free) inertial delay, and vice-versa. It therefore shows that the time-bounded arbiter and the inertial delay are equally realizable. Consequently all theoretical limitations which apply to one will apply, in some form, to the other as well.
Statistical validation of a trace-driven simulator
Authors: M. Schatzoff, C. C. Tillman
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

A common problem encountered in computer system simulation is that of validating that the simulator can produce, with a reasonable degree of accuracy, the same information that can be obtained from the modelled system. This is basically a statistical problem because there are usually limitations with respect to the number of controlled tests which can be carried out, and assessment of the fidelity of the model is a function of the signal to noise ratio. That is, the magnitude of error which can be tolerated depends upon the size of the effect to be predicted. In this paper, we describe by example how techniques of statistical design and analysis of experiments have been used to validate the modeling of the dispatching algorithm of a time sharing system. The examples are based on a detailed, trace-driven simulator of CP-67. They show that identical factorial experiments involving parameters of this algorithm, when carried out on both the simulator and on the actual system, produced statistically comparable effects.
An associative/parallel processor for partial match retrieval using superimposed codes
Authors: Sudhir R. Ahuja, Charles S. Roberts
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper presents the design and implementation of special hardware for effective use of the method of superimposed codes. It is shown that the method of superimposed codes is particularly well suited to easy design and implementation of fast and modular hardware. The implementation has shown that a performance gain of two orders of magnitude over conventional software implementations is obtained by using the special hardware. This makes the method of superimposed codes extremely attractive for data base system requiring partial match retrieval. We also demonstrate that the associative memory design is easily adaptable to large scale integration which would make such an approach very cost effective and lead to even further gains in performance.
A simulation model of a wheat elevator system using SLAM
Authors: Thomas R. Harris, Behrokh Khoshnevis
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper shows that simulation can be used as an analytical tool for agricultural marketing and the potential of the SLAM simulation language to model such systems. This analysis shows the effects upon the elevator complex from two different harvest season scenarios. The model also has the versatility of being able to derive the effects of different decision strategies on the elevator complex without designing a totally different model. The effects of elevator breakdowns, building of more elevator storage facilities, smaller and larger dumping areas, and different initial elevator inventory levels can be easily investigated. Also, different elevator systems (country, terminal, and export) can be developed from the existing model.
MUG1 - an incremental compiler-compiler
Authors: Harald Ganzinger, Knut Ripken, Reinhard Wilhelm
Venue: Proceedings of the 1976 annual conference (1976)

MUG1 is a compiler generating system developed and implemented at the Technical University of Munich. The structure of the system and the concepts used in the compiler description are presented. Special emphasis is laid on the use of MUG1 as a tool for the incremental design of programming languages and the construction of their compilers in parallel.
Isolated word recognition based upon source coding techniques
Authors: Andres Buzo, Horacio Martinez, Carlos Rivera, Aron Jazcilevich
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper arrived late and can be found, published in full, on pages 268-270 of the Proceedings.
Preliminary experience with a configuration control system for modular programs
Authors: J. Estublier, S. Ghoul, S. Krakowiak
Venue: Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1984)

This paper describes some preliminary experience gathered during the implementation and early use of a program composition and version control system. This system has been designed and implemented as a part of the Adele research project, a programming environment for the production of modular programs (Estublier 83). This project has four main components: a) a program editor, interpreter and debugger; b) a parameterized code generator; c) a user interface; d) a program base, the subject of this paper. The current version of this environment has been developed on a Multics system. The program base, including the system composition and version control mechanisms, has been used for six months, notably for its own development and maintenance.
Time-space tradeoffs for some algebraic problems
Authors: Joseph Ja'Ja'
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We study the time-space relationship of several algebraic problems such as matrix multiplication and matrix inversion. Several results relating the algebraic properties of a set of functions to the structure of the graph of any straight-line program, that computes this set, are shown. Some of our results are the following. Multiplying m &times; n by n &times; p matrices with space S requires at least time T &ge; &Ohgr;(mnp/S). Inverting an n &times; n matrix with space S requires at least time T &ge; &Ohgr;(n4/S).
Control of design data in the integrated ship design system
Authors: Peter R. Bono
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The Navy's Integrated Ship Design System (ISDS) is being designed as a collection of application program modules (for preliminary design) which communicate with a centralized set of data files. These files use the existing COMRADE Data Management System which was designed specifically for integrated systems. Apart from providing an environment in which to operate the engineering application modules, ISDS's main role is to manage the creation, flow and archiving of the ship design data and to control access to this data. Consequently, a major concern during the lengthy and complex ship design process is assuring the integrity of the design data as it grows and is revised over time. Planning for control of the design data requires a clear understanding of the design process and the interrelationships between the design tasks. Requirements are stated, problem areas are identified, and possible approaches for implementation are suggested.
A sensible approach to academic project management
Authors: Lois J. Secrist
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

User Services management and programmers share many common goals and interests. And although the viewpoints may differ, these common interests permit teamwork between management and programmers in meeting the functional objectives of User Services. Examples of these shared interests abound. For instance, management wants to increase the staff's programming expertise so that jobs can be completed more easily, and more complex programming can be handled. The programmers also want to increase their knowledge of programming technology and allied fields&mdash;both for enhanced marketability of their skills on their present job and elsewhere, and for the sheer enjoyment of having new experiences in programming. Again, management wants to get programming projects finished in an orderly and expeditious way, while programmers want to avoid being bogged down in a long, drawn-out, problem-ridden assignments. Looking for these shared interests and building on them, management can develop the kind of academic programming teamwork which will provide a real sense of accomplishment for everyone concerned.
A large-scale optical character recognition system simulation
Authors: David P. Himmel, David Peasner
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A simulation is described which provides a vehicle for the synthesis and subsequent performance analysis of optical character recognition (OCR) algorithms aimed at solving some of the most difficult problems encountered in OCR. The simulation treats the problems of linking complex interactive algorithms together and processing large real-world data files under economic constraints. The simulation is written in Fortran V and is installed on University Computing Company's Dallas 1108 facility. It is comprised of a main program, four major subroutines, 29 supporting routines, and the system library routines. It presently requires 104,500 words of memory (418,000 bytes). Results of the computer simulation on real-world handprint character data are presented.
The use of static column ram as a memory hierarchy
Authors: James R. Goodman, Men-chow Chiang
Venue: ACM SIGARCH Computer Architecture News (1984)

The Static Column RAM devices recently introduced offer the potential for implementing a direct-mapped cache on-chip with only a small increase in complexity over that needed for a conventional dynamic RAM memory system. Trace-driven simulation shows that such a cache can only be marginally effective if used in the obvious way. However it can be effective in satisfying the requests from a processor containing an on-chip cache. The SCRAM cache is more effective if the processor cache handles both instructions and data.
Extending APL &ldquo;optional arguments&rdquo;
Authors: Richard L. Naugle, Joseph B. Schlam
Venue: ACM SIGAPL APL Quote Quad (1982)

Two types of APL arguments are defined&mdash;positional and optional. APL currently provides limited &ldquo;optional argument&rdquo; capabilities by optionally specifying the axis on which to operate for some primitives. Other current APL optional argument capabilities, defined as global keywords, and optional argument capabilities requiring an expansion of APL, defined as local keywords, are introduced and compared. When the values passed to a function do not change frequently between calls, local keywords are shown to increase the relevance, power and simplicity of APL.
The optimal choice of window sizes for working set dispatching
Authors: Greg Henderson, Juan Rodriguez-Rosell
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

The concept of varying window size in a working set dispatcher to control working set size and number of page faults is examined. A space-time cost equation is developed and used to compare fixed window size to variable window size for different types of secondary storage based on the simulated execution of real programs. A general approach is indicated for studying the relative merit of the two dispatching algorithms and their interaction with different hardware configurations.
Minicomputer selection and implementation
Authors: Spotswood D. Stoddard
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

Technological advances in large-scale integrated circuits have caused mini and micro computer usage to multiply in the last few years. This behooves academic to treat the mini/micro phenomenon adequately. The same multiplication process, however, makes choosing a minicomputer all the more difficult. The problem is compounded by the hardware and electronics knowledge required to attain the best price advantage. This paper describes how one academic computer department selected and implemented a minicomputer on a restricted budget. It is written primarily for the reader without extensive knowledge of hardware electronics. This article is a description of the experiences of one academic computer department1 in buying, installing, and using an academic minicomputer. It is directed primarily to those having little or no expertise in electronics or computer hardware design. This description is in response to a number of inquiries of &ldquo;What did you do?&rdquo; It is a step-by-step description and, as such, is quite specific to our particular system, with which we have been well pleased. It is offered as a guide of experience both to those who might obtain a similar system and as a case to others as well.
Automatic Quality Control of Industrial Products for Irrigation
Authors: A. Anzalone, G. Gugliotta, A. Machi, G. Sardisco
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes the analysis method we used in the E.C. ESPRIT technology transfer project VIPLAST_2 for the detection of defects in industrial plastic components for automatic drop irrigation. The analysis process verifies that the design rules of prism-shaped drippers are met before they are soldered at a regular distance within a drop pipe and afterwards it points out missing or misplaced holes drilled on the pipe surface overlapping the dripper. Our method faces problems arising from the visual features of the object material, such as highly reflective surface and absence of texture, and handles variable lighting conditions and unstable object positioning namely overturning, jitter and rotation. Experimental results on the industrial production lines are given. They show the reliability of our method, obtaining a very high rate of detected defects and a low rate of false alarms. The company real time inspection requirements are also met.
Minicomputer software development using a maxicomputer
Authors: M. W. Blake-Knox, G. C. Morris
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

This paper examines some of the problems of developing software for minicomputers (or microcomputers). Practical solutions to these problems, involving the use of maxicomputers, are described both generally and by a specific example. Areas examined include source program input and editing, compilation and assembly, loading and finally debugging. In addition, performance measurement of application software is discussed.
Problem oriented protocol design
Authors: David M. Nicol, Paul F. Reynolds,  Jr.
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The prevention of deadlock in certain types of distributed simulation systems requires special synchronization protocols. These protocols often create an excessive amount of performance-degrading communication; yet a protocol with the minimum amount of communication may not lead to the fastest network finishing time. We propose a protocol that attempts to balance the network's need for auxiliary synchronization information with the cost of providing that information. Using an empirical study we demonstrate the efficiency of this protocol. Also, we show that the synchronization requirements at different interfaces may vary; an integral part of our proposal assigns a protocol to an interface according to the interface's synchronization needs.
A comparison of the code space and execution time required for FORTRAN assignment statements on six computer architectures
Authors: Richard A. Belgard, Victor B. Schneider
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

A method is presented for deriving lower and upper bounds for memory space and execution time of compiled FORTRAN assignment statements. Formulas, in terms of variable references, are presented. The method is applied to six hypothetical computer architectures, standardized to eliminate variations resulting from addressing strategies and varying opcode lengths. The results are presented in tabular form.
Ada '82 - status, use and application techniques
Venue: Proceedings of the ACM '82 conference (1982)

The Ada language was designed as a language to address embedded systems within the Department of Defense. The interest in this language is evident from the numerous articles, texts and conferences which have addressed this language and its application within the real time embedded systems environment. There have been research efforts directed to the use of Ada. These efforts have been conducted by a variety of individuals and organizations and have resulted in contributions to requirements and design methodologies as well as application areas. Thus, we are seeing several prototype implementations which illustrate the use of Ada in the software lifecycle.
Automating analog circuit diagrams using a list processing language
Authors: Richard C. Jaffe, Joseph P. Young
Venue: Proceedings of the 14th Design Automation Conference (1977)

An interactive method of analog computer circuit diagram generation is described which utilizes symmetric list processing techniques as a basis for its data structure. The resultant program, known as DISPLAY, permits generation, maintenance, and modification of analog circuit diagrams from a graphics terminal, with the added capability of directly generating a set of differential equations which can link to an analysis program known as Equation Verification (EV), to obtain static and dynamic solutions of the time response of the analog circuit elements. The program was developed to aid simulation engineers to maintain up-to-date documentation, storage, and retrieval of schematic information in a list processing formulation which simplifies the programming effort considerably. Examples of the input and graphical output are given, along with typical state equations used as input to the analysis program. DISPLAY is written in Fortran IV, and currently interfaces with a 4012 Tektronix Graphics Display Storage Terminal.
Computer science education and industry: Preventing educational misalignment
Authors: William L. Ziegler
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

The fact that graduates of Computer Science programs are in high demand by industry is no longer news. Traditionally, a student's grade point average was one method which could be used to determine if the student was qualified in his particular field of study. Unfortunately, this is not always true, especially in the rapidly changing field of Computer Science. Even though a student has done well in a particular educational program, this does not guarantee that the educational program itself correlates to the needs of industry. A situation such as this must and can be avoided through mutual procedures between education and industry. Strategies are discussed to eliminate the Computer Sciece/Industry misalignment, concerning faculty, advisory committees, curriculum guidelines, professional organizations, and student activities.
Simulation techniques for large computer centers
Authors: R. E. Paulhamus, H. P. Artis
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

The intent of this workshop is to present a basic methodology for performing simulation studies in production installations. A model computer center is presented to provide a basis for discussing the various problem areas encountered. Available packages and simulation languages are used in the examples. Particular emphasis is placed on the methods for data collection and the trade-offs between purchased packages and internally developed software.
Diagnostic system for distributed software: A relational database approach
Authors: Kiwon Chong, Pei Hsia
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Software errors in distributed systems are difficult to detect, locate and correct. The relational database approach in software diagnostics is an integrated approach encompassing most features in static analysis, dynamic testing, symbolic execution and performance evaluation techniques. Modified syntax analysis of source program and testing run of the instrumented code generate the basis relations (symbol tables, graph models, program fragments, execution histories) from which diagnostic information is retrieved interactively. The basis relations contain necessary information to diagnose the software since data structures, algorithms and execution behavior of the software are included. Implementations of some typical dynamic testing features extended to distributed software are discussed and illustrated.
Software development control based on module interconnection
Authors: Walter F. Tichy
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Constructing large software systems is not merely a matter of programming, but also a matter of communication and coordination. Problems arise because many people work on a joint project and use each other's programs. This paper presents an integrated development and maintenance system that provides a controlling environment to insure the consistency of a software system at the module interconnection level. It assists the programmers with two facilities: Interface control and version control. Interface control establishes consistent interfaces between software modules and maintains this consistency when changes are made. Version control coordinates the generation and integration of the various versions and configurations. Both facilities derive their information from an overall system description formulated in the module interconnection language INTERCOL. A demonstration system is sketched that runs under the UNIX time-sharing system.
HARPA: A hierarchical multi-level hardware description language
Authors: Pedro M. B. Veiga, Mário J. A. Lan&ccedit;a
Venue: Proceedings of the 21st Design Automation Conference (1984)

In this paper, a new hardware description language -HARPA- is presented which was specially designed to permit the description of hierarchically structured digital systems at different levels of abstraction. The system building modules can be represented in terms of their structure, their behavior or a combination of both, as appropriate. A set of data types is provided which is adequate to characterize the data handling entities utilized at the various levels. Conversion mechanisms exist that facilitate the interfacing of blocks. The language is used as input medium for a multi-level simulator for verification of hierarchical designs.