ppxscal/embedding_network huggingface dataset:
Markov Processes on Curves
Authors: Lawrence K. Saul, Mazin G. Rahim
Venue: Machine Learning (2000)

We study the classification problem that arises when two variables&mdash;one continuous (x), one discrete (s)&mdash;evolve jointly in time. We suppose that the vector x traces out a smooth multidimensional curve, to each point of which the variable s attaches a discrete label. The trace of s thus partitions the curve into different segments whose boundaries occur where s changes value. We consider how to learn the mapping between the trace of x and the trace of s from examples of segmented curves. Our approach is to model the conditional random process that generates segments of constant s along the curve of x. We suppose that the variable s evolves stochastically as a function of the arc length traversed by x. Since arc length does not depend on the rate at which a curve is traversed, this gives rise to a family of Markov processes whose predictions are invariant to nonlinear warpings (or reparameterizations) of time. We show how to estimate the parameters of these models&mdash;known as Markov processes on curves (MPCs)&mdash;from labeled and unlabeled data. We then apply these models to two problems in automatic speech recognition, where x are acoustic feature trajectories and s are phonetic alignments.
The stage hypothesis and the s-curve: some contradictory evidence
Authors: Henry C. Lucas,  Jr., Jimmy A. Sutton
Venue: Communications of the ACM (1977)

This paper presents the results of a study testing the s-shaped budget curve of Nolan's stage model of computer development in an organization. Research on the data processing budgets of California counties fails to support the s-shaped curve or the use of budgets as a basis for a stage model. However, the results do not invalidate the concept of a stage model. The analysis suggest an alternative model of budget growth and a separation between models of budgeting growth and growth stages in the development of the computer resource.
Rounding problems in commercial data processing
Authors: Thomas B. Kelley
Venue: Communications of the ACM (1964)

A common requirement in commercial data processing is that the sum of a set of numbers, rounded in a generally understood manner, be equal to the sum of the numbers rounded individually. Four rounding procedures are described to accomplish this. The particular procedure that is appropriate depends upon whether the numbers being accumulated can vary in sign, whether their sum can vary in sign, and whether the last number being summed can be recognized as such prior to its rounding.
Approximate majorization and fair online load balancing
Authors: Ashish Goel, Adam Meyerson, Serge Plotkin
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya [11]. We define &agr;-supermajorization as an approximate form of vector majorization, and show that this definition generalizes and strengthens the prefix measure proposed by Kleinberg, Rabani and Tardos [14] as well as the popular notion of max-min fairness. The paper revisits the problem of online load-balancing for unrelated 1-&infin; machines from the viewpoint of fairness. We prove that a greedy approach is &Ogr;(log n)-supermajorized by all other allocations, where n is the number of jobs. This means the greedy approach is globally &Ogr;(log n)-fair. This may be constrasted with polynomial lower bounds presented in [9] for fair online routing. We also define a machine-centric view of fairness using the related concept of submajorization. We prove that the greedy online algorithm is globally &Ogr;(log m)-balanced, where m is the number of machines.
Practical syntactic error recovery
Authors: Susan L. Graham, Steven P. Rhodes
Venue: Communications of the ACM (1975)

This paper describes a recovery scheme for syntax errors which provides automatically-generated high quality recovery with good diagnostic information at relatively low cost. Previous recovery techniques are summarized and empirical comparisons are made. Suggestions for further research on this topic conclude the paper.
A model for compound type changes encountered in schema evolution
Authors: Barbara Staudt Lerner
Venue: ACM Transactions on Database Systems (TODS) (2000)

Schema evolution is a problem that is faced by long-lived data. When a schema changes, existing persistent data can become inaccessible unless the database system provides mechanisms to access data created with previous versions of the schema. Most existing systems that support schema evolution focus on changes local to individual types within the schema, thereby limiting the changes that the database maintainer can perform. We have developed a model of type changes involving multiple types. The model describes both type changes and their impact on data by defining derivation rules to initialize new data based on the existing data. The derivation rules can describe local and nonlocal changes to types to capture the intent of a large class of type change operations. We have built a system called Tess (Type Evolution Software System) that uses this model to recognize type changes by comparing schemas and then produces a transformer that can update data in a database to correspond to a newer version of the schema.
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
Authors: Turgay Korkmaz, Marwan Krunz
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

In this paper, we investigate the problem of topology aggregation (TA) for scalable, QoS-based routing in hierarchical networks. TA is the process of summarizing the topological information of a subset of network elements. This summary is flooded throughout the network and used by various nodes to determine appropriate routes for connection requests. A key issue in the design of a TA scheme is the appropriate balance between compaction and the corresponding routing performance. The contributions of this paper are twofold. First, we introduce a source-oriented approach to TA, hich provides better performance than existing approaches. The intuition behind this approach is that the advertised topology-state information is used by source nodes to determine tentative routes for connection requests. Accordingly, only information relevant to source nodes needs to be advertised. We integrate the source-oriented approach into three new TA schemes that provide different trade-offs between compaction and accuracy. Second, we extend our source-oriented approach to multi-QoS-based TA. A key issue here is the determination of appropriate values for the multiple QoS parameters associated with a logical link. Two new approaches to computing these values are introduced. Extensive simulations are used to evaluate the performance of out proposed schemes.
A system for interprocess communication in a resource sharing computer network
Authors: David C. Walden
Venue: Communications of the ACM (1972)

A system of communication between processes in a time-sharing system is described and the communication system is extended so that it may be used between processes distributed throughout a computer network. The hypothetical application of the system to an existing network is discussed.
An interactive graphic display for region partitioning by linear programming
Authors: To-Yat Cheung
Venue: Communications of the ACM (1974)

Using linear programming, an interactive graphic display system has been implemented to solve the region design problem of partitioning a region into N nonoverlapping subregions in such a way that their areas are in specified proportions and that the total cost of servicing them is a minimum. In a conversational manner, a user can easily obtain different partitionings by specifying and modifying the boundary, the service centers' locations, the area proportions, and the cost functions. Examples are included.
Discovery and Segmentation of Activities in Video
Authors: Matthew Brand, Vera Kettnaker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Hidden Markov models (HMMs) have become the workhorses of the monitoring and event recognition literature because they bring to time-series analysis the utility of density estimation and the convenience of dynamic time warping. Once trained, the internals of these models are considered opaque; there is no effort to interpret the hidden states. We show that by minimizing the entropy of the joint distribution, an HMM's internal state machine can be made to organize observed activity into meaningful states. This has uses in video monitoring and annotation, low bit-rate coding of scene activity, and detection of anomalous behavior. We demonstrate with models of office activity and outdoor traffic, showing how the framework learns principal modes of activity and patterns of activity change. We then show how this framework can be adapted to infer hidden state from extremely ambiguous images, in particular, inferring 3D body orientation and pose from sequences of low-resolution silhouettes.
Modeling and evaluation of hardware/software designs
Authors: Neal K. Tibrewala, JoAnn M. Paul, Donald E. Thomas
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

We introduce the foundation of a system modeling environment targeted at capturing the anticipated interactions of hardware and software behaviors &mdash; not just their co-execution. Key to our approach is the separation of external and internal design testbenches. We use a frequency interleaved scheduling foundation ideally suited to our approach because it allows unrestricted hardware and software modeling, a mix of untimed and timed software, and a layered approach using software schedulers and protocols to resolve software to resource time budgets. We illustrate our approach by discussing how architectural corner cases that arise due to interacting hardware and software behaviors can be a meaningful digital modeling concept. In addition to characterizing the response of a system when viewed as a black box, we characterize the response of the design to anticipated design changes. We include examples and simulation results.
A systematic approach to software peripherals for embedded systems
Authors: D. Lioupis, A. Papagiannis, D. Psihogiou
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

The continued growth of microprocessors' performance and the need for better CPU utilization, has led to the introduction of the software peripherals' approach: By this term we refer to software modules that can successfully emulate peripherals that, until now, were traditionally implemented in hardware. Software implementations offer great flexibility in product design and in functional upgrades, while they have high contribution in the cost/performance ratio optimization. We focus on embedded applications, where the cost and the short time to market are the leading issues. In this paper, we study the hardware and software requirements for developing a generic microprocessor with support for software peripherals. Additionally, we present three software peripherals, a Universal Asynchronous Receiver Transmitter, a keypad controller and a dot matrix LCD controller, and we analyze their impact in CPU occupation. Finally, we explore the impact of using a software UART on system power dissipation.
A computational extension of the variate difference method
Authors: Perry A. Scheinok
Venue: Communications of the ACM (1963)

Presented here is a computational extension of the variate difference method as developed by G. Tintner [1].
Tests on a computer method for constructing school timetables
Authors: J. Csima, C. C. Gotlieb
Venue: Communications of the ACM (1964)

A previously proposed computer method for constructing timetables, based on an iteration involving Boolean matrices, is described. In limited tests the method has successfully produced timetables on every trial. References are given which relate the timetable problem to theorems on matrices of zeros and ones, and to theorems on bipartite graphs. Some problems of applying the method to constructing timetables in real situations are noted.
Estimation of the inverse function for random variate generation
Authors: Stephen C. Hora
Venue: Communications of the ACM (1983)

A regression method for estimating the inverse of a continuous cumulative probability function F(x) is presented. It is assumed that an ordered sample, X1, &hellip;, Xn, of identically and independently distributed random variables is available. A reference distribution F0(x) with known inverse F0-1(p) is used to calculate the quantities Wi = i ln[F0(Xi)/F0(Xi+1)]. These quantities are used to estimate the function &ggr;(p) = pd ln&ge;F0[F-1(p)]&lnsim;/dp from which an estimate of F-1(p) is derived. The method produces an estimate in a form that is convenient for random variate generation. The procedure is illustrated using data from a study of oil and gas lease bidding.
An architecture for action selection in robotic soccer
Authors: Peter Stone, David McAllester
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

CMUnited-99 was the 1999 RoboCup robotic soccer simulator league champion. In the RoboCup-2000 competition, CMUnited-99 was entered again and despite being publicly available for the entire year, it still finished in 4th place. This paper presents some of the key elements behind \attcmunited, one of the three teams that finished ahead of CMUnited-99 in RoboCup-2000 out of thirty four entrants. Playing against CMUnited-99, \attcmunited\ scores an average of about 8 goals per opponent goal. This paper describes some of the key innovations that make this improvement possible.
Expanding the editing function in language data processing
Authors: L. B. Doyle
Venue: Communications of the ACM (1965)

In automatic abstracting, citation indexing, mechanical translation and other such procedures, editing is required whenever the automatic method leaves something to be desired. This paper discusses the economy of editing as a function of the amount of condensation of text in language processing operations, and then contends that editing can be regarded as an opportunity rather than as an unwelcome necessity. &ldquo;Heavy editing,&rdquo; which goes beyond mere correction and improvement of computer output, is exemplified by the use of a concordance in preparing a survey article or lecture. Other opportunities for heavy editing are described, chief among them being interpretation and expansion of computer output in such processes as factor analysis. Applications are described, such as the quick, unbiased evaluation of a large volume of incoming mail or telegrams, yielding summary reports not possible for either humans or computers to produce alone.
On-chip interconnections: impact of adjacent lines on timing
Authors: D. Deschacht, G. Servel
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

As the CMOS technology scales down, the coupling capacitance between adjacent wires plays dominant part in wire load and interference becomes a serious problem for VLSI design. In this paper, we focus on delay increase caused by adjacent lines. This increase in delay due to coupling can have a dramatic impact on IC performance for deep submicron technologies. We propose an analytical expression to compute the delay in the presence of coupling that takes explicitly into account interconnect resistance and capacitance, driver resistance and relative driver strengths.
An approach to multidimensional data array processing by computer
Authors: Mervin E. Muller
Venue: Communications of the ACM (1977)

Some recent work on the development of general-purpose computer-based statistical and data processing capabilities for handling multidimensional arrays of data is presented. Attention is first given to some of the general problems of multidimensional table and array processing. This is followed by a summary of some recent developments in array processing capabilities at the World Bank, in particular, the system identified as WRAPS (World Bank Retrieval and Array Processing System).
Standards: Proposed USA Standard: Data code for calendar date for machine-to-machine data interchange
Authors: E. Lohse
Venue: Communications of the ACM (1968)

This proposed USA Standard presents a standard data code for a calendar date for use in the interchange if data from machine-to-machine among data systems.
The inductive approach to verifying cryptographic protocols
Authors: Lawrence C. Paulson
Venue: Journal of Computer Security (1998)

Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as little as a week or two, yielding a proof script that takes a few minutes to run. Protocols are inductively defined as sets of traces. A trace is a list of communication events, perhaps comprising many interleaved protocol runs. Protocol descriptions incorporate attacks and accidental losses. The model spy knows some private keys and can forge messages using components decrypted from previous traffic. Three protocols are analyzed below: Otway-Rees (which uses shared-key encryption), Needham-Schroeder (which uses public-key encryption), and a recursive protocol (Bull and Otway, 1997) (which is of variable length). One can prove that event ev always precedes event ev' or that property P holds provided X remains secret. Properties can be proved from the viewpoint of the various principals: say, if A receives a final message from B then the session key it conveys is good.
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
Authors: Javier Portilla, Eero P. Simoncelli
Venue: International Journal of Computer Vision (2000)

We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We develop an efficient algorithm for synthesizing random images subject to these constraints, by iteratively projecting onto the set of images satisfying each constraint, and we use this to test the perceptual validity of the model. In particular, we demonstrate the necessity of subgroups of the parameter set by showing examples of texture synthesis that fail when those parameters are removed from the set. We also demonstrate the power of our model by successfully synthesizing examples drawn from a diverse collection of artificial and natural textures.
Further comments on Dijkstra's concurrent programming control problem
Authors: Murray A. Eisenberg, Michael R. McGuire
Venue: Communications of the ACM (1972)

E.W. Dijkstra [1] presented an algorithm whereby N mainly independent computers, with a common data store as their sole means of communication, could contend for exclusive control of any given resource (storage, I/O, etc.). To use the resource, a computer had to gain access to the &ldquo;critical section&rdquo; of the algorithm, within which one and only one computer at a time could be executing.
MUSE: a model to understand simple English
Authors: Gordon I. McCalla, Jeffrey R. Sampson
Venue: Communications of the ACM (1972)

MUSE is a computer model for natural language processing, based on a semantic memory network like that of Quillian's TLC. MUSE, from a Model to Understand Simple English, processes English sentences of unrestricted content but somewhat restricted format. The model first applies syntactic analysis to eliminate some interpretations and then employs a simplified semantic intersection procedure to find a valid interpretation of the input. While the semantic processing is similar to TLC's, the syntactic component includes the early use of parse trees and special purpose rules. The &ldquo;relational triple&rdquo; notation used during interpretation of input is compatible with MUSE's memory structures, allowing direct verification of familiar concepts and the addition of new ones. MUSE also has a repertoire of actions, which range from editing and reporting the contents of its own memory to an indirect form of question answering. Examples are presented to demonstrate how the model interprets text, resolves ambiguities, adds information to memory, generalizes from examples, and performs various actions.
Predicative programming Part I
Authors: Eric C. R. Hehner
Venue: Communications of the ACM (1984)

Programs are given a new semantics with the merit that a specification written as a first-order predicate can be refined, step by step, to a program via the rules of Predicate Calculus. The semantics allows a free mixture of predicate and programming notations, and manipulation of programs.
Password authentication with insecure communication
Authors: Leslie Lamport
Venue: Communications of the ACM (1981)

A method of user password authentication is described which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure one-way encryption function and can be implemented with a microcomputer in the user's terminal.
Everyman's information retrieval system
Authors: V. W. Whitley
Venue: Communications of the ACM (1963)

The information retrieval problem whose solution is presented here was posed by a technical library with limited budget and personnel. The solution, however, is quite general and is applicable to many different types of retrieval problems. Further, the method of solution makes it possible for many groups who have previously dismissed an information retrieval program s expensive and difficult (from a programming standpoint) to reconsider their position, for the present solution makes it possible to install an information retrieval program in less than three months, and with relatively little equipment. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Compact representation of contour plots for phone line transmission
Authors: John Adams, John Gary
Venue: Communications of the ACM (1974)

Methods for the compact representation of contour plots are described and tested. These are intended to reduce the cost of transmitting contour plots over phone lines. We feel some of these methods could be used to transmit contour plots over voice grade phone lines.
Design of future systems
Authors: I. Page
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper describes a vision in which future systems consisting of novel hardware and software components are designed and implemented by a single type of professional engineer. That professional has more in common with today's programmer than a hardware designer, although both of these existing bodies of professionals have a strong contribution to make to understanding, defining and bringing about this transformation in product creation.