ppxscal/embedding_network huggingface dataset:
Weighted voting for replicated data
Authors: David K. Gifford
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of rvotes to read a file, and a write quorum of wvotes to write a file, such that r+w is greater than the total number of votes assigned to the file. This ensures that there is a non-null intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing r, w, and the file's voting configuration. The algorithm guarantees serial consistency, admits temporary copies in a natural way by the introduction of copies with no votes, and has been implemented in the context of an application system called Violet.
On the uses of models in education
Authors: Jürgen Kirbach, Joachim W. Schmidt
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Some preliminary observations may demonstrate some of man's motivation for using models: Generally science is concerned with causal systems, which are systems the states of which do not depend on future inputs to the system. It is this class of systems which is pretty well understood (differential equations, automata, deterministic or not). The purpose for engaging in science about causal systems is - besides pure curiosity - mainly to aid man's desire to behave in a goal-directed manner. Since a modern society has a need for goal-directed behavior of its members, e.g. in problem solving, there is also the need to teach people the associated structures. They need - to get to know existing models (knowledge), - to learn the way models are used (methods), - to get to know the tools for modelling (theories), and - to be able to use strategies for developing them (science). The introduction may give the impression that we favor a very loose use of the term &ldquo;model&rdquo;. This is not so, however. On the contrary since this term is so loosely used presently, it should find a refinement by explication which can be done by examining the associated structures further. That this may not be a waste of effort may have been demonstrated by the central role models play for man's goal-directed behavior.
Analytic modelling of &ldquo;working set like&rdquo; replacement algorithms
Authors: William T. Marshall, C. Thomas Nute
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

Although a large amount of theoretical work has been performed in the analysis of the pure working set replacement algorithm, little has been done applying these results to the approximations that have been implemented. This paper presents a general technique for the analysis of these implementations by analytic methods. Extensive simulations are reported which validate the analytic model and show significant simplifications that can be made with little loss of accuracy. The problem of choosing memory policy parameter values is examined and related in a simple way to the choice of a working set window size.
Handwritten Kanji Recognition Using Combined Complementary Classifiers in a Cascade Arrangement
Authors: Takahiko Kawatani
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In classifier combination, the degree of recognition accuracy improvement depends not only on how classifiers are combined, but also on how much they complement each other. From this viewpoint, a complementary classifier that is combined with an existent classifier should use features that make it easy to recognize patterns misrecognized by the existing classifier. As such features, I propose using common difference principal components and difference principal components in a complementary classifier. I also propose combining complementary classifiers in cascade. In each complementary classifier, the common difference principal components and the difference principal components are obtained to make it easy to recognize patterns misrecognized in the preceding combined classifier. These ideas were applied to handwritten Kanji recognition. Experiments showed that the recognition rate increased from 97.35% to 98.00% after a single complementary classifier was combined and to 98.23% after four were combined.
Text/Graphics Separation Using Agent-Based Pyramid Operations
Authors: Chew Lim Tan, Bo Yuan, Weihua Huang, Qian Wang, Zheng Zhang
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a document image analysis system using multiple agents working on a pyramid structure to separate text from graphics in the image. Text strings appear as different groupings of connected components at different resolution of the images. As such, the pyramid structure, which is a multi-resolution image representation, provides a natural means of identifying and grouping of character strings in the document at different levels of resolution. The pyramid structure is also amenable to parallel processing, where multiple agents in the system can individually and concurrently look for groups of connected components at appropriate levels. The agent-based pyramid operations do not require expensive feature analysis among different connected components to detect text strings as found in other existing works.
The semi-custom revolution: How to thrive or survive
Authors: Anthony Zingale
Venue: Proceedings of the 21st Design Automation Conference (1984)

The semicustom IC market, has exploded during the past few years (figure 1). Comprised of both gate arrays and standard cells, the market spans the range of IC technologies including bipolar, CMOS and linear. To meet the needs of the system engineers who implement semicustom designs, CAE tools have become increasingly important and more focused with respect to rapid, right-the-first-time product development. Panelists will discuss their company's semicustom design automation solution in relation to the semicustom silicon vendor and the users of various semicustom designs and technologies. The session will close with a discussion on the future of CAE tools and the evolution of the semicustom market into standard cells and full-custom design.
Planar 3D Object Detection by Using the Generalized Hough Transform
Authors: N Guil, J. R. Cózar, E. L. Zapata
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this work we propose a new method to detect arbitrary planar shapes from a previous template and calculate the parameters that define the transformations between the new image and the template. The image contains a perspective projection of the template subjected to two angles transformation, called tilt and pan, a displacement a rotation and a scaling. The method uncouples parameter calculation to improve computational requirements by comparing invariant information from the template and the image. The Generalized Hough Transform is used to compare this information and to vote into a parameter space.
Induction as the basis for program verification
Authors: Charles Reynolds, Raymond Yeh
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

We will consider the inductive mechanisms in five techniques for verifying iterative/recursive program structures: inductive assertion, predicate transformers, subgoal induction, computation induction, structural induction. We will discover that all five techniques can be justified by a single theorem about inductive proof techniques. We will also show that all five techniques face the problem of finding properties that will carry an induction. Such properties are called inductive sets. We will see that the inductive sets of the five techniques are easily related to one another and that a program proof by any of the techniques can be easily converted to a proof by any of the other techniques. Our conclusion is that computer programs simply are inductive definitions of the functions they compute. Induction is the only method by which they can be proved. The problems of induction are therefore unavoidable.
The design of a user-programmable digital interface (Recent Results)
Authors: James W. Gault, Alice C. Parker
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

An interface for digital computers and peripherals is described in this paper. The design process is traced, beginning with the definition of the problem environment, and the derivation of primitive interfacing functions. The functions are associated with four functional classes; data input/output, data storage, data manipulation, and control. Interface capabilities range from control over the synchronization of input and output pulse data to control over the data word widths acceptable. System limitations include technical, timing, and synchronization problems. The interface is modular, generalized, and user programmable. The control is contained in two levels: a user microprogram, and a read only nanoprogram.
An architecture for a VHSIC computer
Authors: L. L. Kinney, W. Y. Yueh, W. L. Heimerdinger, R. R. Ramseyer, J. W. Thomas
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

A large effort is currently underway to develop very high-speed integrated circuits (VHSIC).1 In the following sections, the technology limitations imposed by a VHSIC technology are discussed, a computer structure implied by these limitations is proposed, and the throughput for this computer system is estimated.
A study on the implementation of three-valued logic
Authors: H. T. Mouftah
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A system of three-valued algebra, based on operators previously defined, is presented. COS/MOS integrated circuits are applied to realize the three-valued operators. An approach to avoid the use of diodes in COS/MOS integrated circuit technology is given and a method for reduction of logical circuitry is discussed.
Constant time interpretation for shallow-bound variables in the presence of mixed special/local declarations
Authors: Jon L White
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

The semantics of variables in LISP are usually centered around the compiled-code environment; in many shallow-bound systems, local variables are implemented as stack-slots in the compiled environment, but are merely converted to special (or &ldquo;fluid&rdquo;) variables by the interpreter. This paper shows a method for separating local from special bindings when interpreting, such that the time to evaluate a reference to a variable is bounded by a modestly small constant; comparison is made to methods which require a time proportional to the number of variables present in the function being interpreted. Notations: A MacLISP style is used for program examples; thus DEFUN rather than DEFINE, LET often in preference to LAMBDA, and semi-colon for noting commentary. Without loss of generality, we refer to all variable binding, whether from LET, LAMBDA, PROG, or whatever, as &ldquo;lambda binding&rdquo;.
&ldquo;&Dbarbelow;&ebarbelow;termining operational policies for oil flow and tanker loading through simulation&rdquo;
Authors: C. P. Koelling, W. H. Remy
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In this paper the use of simulation in addressing the specific needs of one oil company's tanker scheduling problem is examined. The situation is actually more involved than simply tanker scheduling. The flow of oil from the wells to the storage facility must also be considered. This flow is constrained by governmental regulations and profit considerations. A network-discrete event-continuous simulation model, written in SLAM, was developed to address certain issues of interest to the oil company. These were issues such as a desirable mean time between tanker arrivals and the adequacy of the current storage facility. The latter was also of interest to the government involved, since there were usually tankers waiting to be loaded. The results show that tanker arrival schedule can be developed and that the current storage facility is adequate to meet this company's needs.
An implementation of the stefanelli multi-valued parallel divider array
Authors: J. K. Newton
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Practical circuits are presented to implement the components of a multi-valued parallel divider array originally proposed by Stefanelli. The circuits are based on a non-saturating multi-threshold current mode logic. This technique generates fast, easily integrable structures. Complete circuit details are presented and divider speed is estimated.
REL: A Rapidly Extensible Language system
Authors: F. B. Thompson, P. C. Lockemann, B. Dostert, R. S. Deverill
Venue: Proceedings of the 1969 24th national conference (1969)

In the first two sections of this paper we review the design philosophy which gives rise to these features, and sketch the system architecture which reflects them. Within this framework, we have sought to provide languages which are natural for typical users. The third section of this paper outlines one such application language, REL English. The REL system has been implemented at the California Institute of Technology, and will be the conversational system for the Caltech campus this fall. The system hardware consists of an IBM 360/50 computer with 256K bytes of core, a drum, IBM 2314 disks, an IBM 2250 display, 62 IBM 2741 typewriter consoles distributed around the campus, and neighboring colleges. Base languages provided are CITRAN (similar to RAND's JOSS), and REL English. A basic statistical package and a graphics package are also available for building special purpose languages around specific courses and user requirements.
Continuous simulation approximations to queueing networks
Authors: Gordon M. Clark
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Continuous simulations of queueing networks avoid the statistical sampling problems caused by Monte Carlo operations. Also, one may want to simulate a queueing network as part of a larger continuous simulation. The network considered in this paper is nonstationary, has time-dependent exponential service time, and finite queues which block upstream service if they are at capacity. One approach to simulating the network is to define the entire set of Kolmogorov equations and numerically integrate them. This is impractical because the number of equations is quite large even for modest networks. This paper presents two continuous simulation approximations to the exact solution that reduce the number of equations to be integrated to a manageable number. The independence approximation assumes that the probability of a particular system state is approximated by the product of the probabilities each queueing station assumes a particular state. The partition approximation groups states for each queueing station into subsets and uses a weighting factor applied to joint probabilities calculated under the independence assumption. Results from an illustrative example show that partition approximation is more accurate than the independence assumption; however, the independence approximation does very well.
Asynchronous network of specific microprocessors
Authors: François Dromard, Gérard Noguez
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

The present state of the LSI technology enables the integration of sophisticated functions, such as control functions. However, these functions are still simple. A present micro-computer set offers a low parallelism and a low flexibility in interruption handling. Thus, the typical application of micro-computer sets is the development of inexpensive satellite processors. Two techniques become available: -the dynamic microprogramming, - the multiplication of control organs. The efficient use of the dynamic microprogramming supposes the concept of the &ldquo;host machine&rdquo; which can emulate a number of virtual machines (cf B1700). The multiplication of control organs actually needs asynchronous communication procedure and requires specific microprocessors. This paper investigate such a machine. The computer is a collection of specific microprocessors. The communications are handled by an auto-regulating principle. A paged working storage and a communication mechanism are cyclicly shared between the microprocessors. The communication mechanism allows the garbage collecting and the flag locking of the common pages.
A minimization algorithm for ternary switching functions
Authors: T. C. Yang, A. S. Wojcik
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

An algorithm for the minimization of ternary switching functions is described. The algorithm is based on a standard binary switching function simplification method. Systematic methods for finding all prime implicants and a minimal-cost, static-and-dynamic-hazard-free representation for operation-hazard-free ternary switching functions are presented which are suitable for both computer and hand execution. Illustrative examples are also presented.
Effect of program localities on memory management strategies
Authors: Takashi Masuda
Venue: ACM SIGOPS Operating Systems Review (1977)

Programs tend to reference pages unequally and cluster references to certain pages in short time intervals. These properties depend on the tendency of program locality references and program phase transitions. The significant effects on system performances arise from the phase transition behavior. However, the phase transition behavior of programs has been rarely taken into account in the analysis of memory management strategies. This paper investigates the effect of the phase transition behavior on the total system performance. For this purpose, an elaborate simulation model of the multiprogrammed memory management has been developed for a time-sharing environment. The working set strategy and the local LRU strategy are modeled in the simulation system. A simple phase transition model and the simple LRU stack model are used as a program paging behavior model. Both cases are analyzed where (1) locality variations exist and phase transitions occur, and (2) only locality variations exist and phase transitions do not occur. The relations between the phase transition rate and the system performance are found in the above memory management strategies.
Utilizing first-order logic in query processing
Authors: Djamshid Asgari, Lawrence Henschen
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

The purpose of this research is to improve on the current membership algorithms and their applications in relational database model and information retrieval. A new technique proposed which makes up for deficiencies existing methods. This membership algorithm based on full first-order logic, extending Sagiv's prepositional calculus approach. Our technique does not assign one relation name (association) to all database dependencies like the representation of Nicolas. Finally, it may be used to improve relation schema design. Furthermore, we can utilize our technique derive data retrieval programs for answering queries, an idea that has not previously appeared in the literature.
An Insider's Survey on Software Development
Authors: Jean C. Zolnowski, Peter D. Ting
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper presents an overview of the results from &ldquo;An Insider's Survey on Software Development&rdquo;. The purpose of the survey was: to provide a vehicle for the communication of information on the usefulness and effectiveness of methodologies, tools, control mechanisms, metrics, and data collection used by Bell Telephone Laboratories software developers; to evaluate the severity of certain obstacles to project development; and to ascertain feelings on the value of specific software quality issues. The results of the survey emphasize the need for work in the requirements area; the lack of attention given to the importance of maintenance within the software life cycle; and the need for more tools and methodologies, automated data collection, and effective software metrics.
Localized set operations for solid modeling
Authors: Martti Mäntylä, Markku Tamminen
Venue: ACM SIGGRAPH Computer Graphics (1983)

Set operation algorithms form an important component of solid modeling systems. Their efficiency can be enhanced by localizing the search for geometric intersections to the region of overlap using a spatial directory. We present an algorithm that employs a three-dimensional extendible cell (EXCELL) directory to the set operation problem, and demonstrate by practical experiments the efficiency and the local nature of the algorithm.
D-C and transient analysis of networks using a digital computer
Authors: Franklin H. Branin,  Jr.
Venue: Proceedings of the SHARE design automation workshop (1964)

This paper treats the problem of programming a digital computer to formulate and solve the algebraic and differential equations characterizing linear and/or nonlinear networks, certain techniques are described which have been used successfully in an experimental program for analyzing transistor switching circuits. The techniques, predicated on a matrix formulation of network equations, include: (a) derivation of all the necessary topological and parameter matrices from input data which specify the network connections and parameters, (b) solution of the nonlinear d-c problem by an iteration procedure, and (c) solution of the transient problem by numerical integration of the nonlinear differential equations separately from the linear differential equations.
Alternatives to teaching introductory short courses
Authors: John Thorton
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

As the number of new computer users grows, it becomes increasingly difficult to give introductory short courses to everyone. In the past, we have dealt with this by offering more and more sections each semester. When all the sections fill up, we schedule an additional section (and end up, it seems, teaching all the time). Even then, people come to other short courses without the &ldquo;Introduction to Timesharing&rdquo; prerequisite; or they say, &ldquo;I couldn't fit any of your 5 sections into my schedule.&rdquo; To alleviate the pressures of teaching many sections (and to allow our students even more scheduling freedom), we at SUACC have tried several alternatives, such as tutorial programs and more printed material. This paper describes some of the alternatives and combinations of alternatives we have experimented with. Some were successful, some not. While we are still experimenting, we have found a combination which seems to please the students, while saving staff time.
An exact solution method for the general class of closed separable queueing networks
Authors: John Zahorjan
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

In this paper we present a convolution algorithm for the full class of closed, separable queueing networks. In particular, the algorithm represents an alternative method to those already known for the solution of networks with class changes, and is the first efficient algorithm to deal with Lam-type networks [11]. As an application of the algorithm, we study a simple queueing network with disk I/O devices connected to a single CPU through a single channel. The algorithm is then used to develop a simple, accurate approximation for the blocking of disk devices that takes place when a customer using a disk is waiting for or in service at the channel.