ppxscal/embedding_network huggingface dataset:
Relative effects of central processor and input-output speeds upon throughput on the large computer
Authors: Peter White
Venue: Communications of the ACM (1964)

Presented in this paper is a technique for determining the relative effects of the internal speed of the computer and the speed of the input-output units upon the overall speed of the system. Equations are derived which permit the determination of these effects from hardware usage measurements.
CONVERT: a high level translation definition language for data conversion
Authors: Nan C. Shu, Barron C. Housel, Vincent Y. Lum
Venue: Communications of the ACM (1975)

This paper describes a high level and nonprocedural translation definition language, CONVERT, which provides very powerful and highly flexible data restructuring capabilities. Its design is based on the simple underlying concept of a form which enables the users to visualize the translation processes, and thus makes data translation a much simpler task. &ldquo;CONVERT&rdquo; has been chosen for conveying the purpose of the language and should not be confused with any other language or program bearing the same name.
Modularity and the sequential file update problem
Authors: Michael R. Levy
Venue: Communications of the ACM (1982)

The best-known solution to the sequential file update problem is the balanced-line algorithm. Here, the problem is solved using abstract data types and the resulting Cobol program illustrated. It is suggested that the program's modular decomposition aids in the development of the solution.
Ethernet: distributed packet switching for local computer networks
Authors: Robert M. Metcalfe, David R. Boggs
Venue: Communications of the ACM (1983)

Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can be viewed as either local computer networks or loosely coupled multiprocessors. An Ethernet's shared communication facility, its Ether, is a passive broadcast medium with no central control. Coordination of access to the Ether for packet broadcasts is distributed among the contending transmitting stations using controlled statistical arbitration. Switching of packets to their destinations on the Ether is distributed among the receiving stations using packet address recognition. Design principles and implementation are described, based on experience with an operating Ethernet of 100 nodes along a kilometer of coaxial cable. A model for estimating performance under heavy loads and a packet protocol for error controlled communication are included for completeness.
Is the wolf angry or... just hungry?
Authors: Isabel Machado, Ana Paiva, Rui Prada
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In this paper we will discuss different types of control over synthetic characters in interactive stories. We will argue that, to attain a deeper and more engaging control, in certain conditions, users should be able to inspect, disclose, and modify the characters minds. To illustrate this idea, we will present a collaborative virtual environment called {\it Teatrix}, designed for children to build their own stories - fairy tales. In {\it Teatrix}, virtual actors play roles (such as: villain, hero, etc.) and may be controlled either by children or by the system. {\it Teatrix} allows children to go into the minds of the characters through a special tool named {\it &ldquo;Hot Seating&rdquo;}. {\it Teatrix} is already in use by children ages between 7 and 9 in the context of a Computer integrated Classroom (CiC) scenario installed in a school. The initial evaluations show that the use of the &ldquo;Hot Seatin&rdquo; tool is a fundamental element for children to feel in control of their characters and thus stay in character for their virtual performances.
Building 3-D Human Face Models from Two Photographs
Authors: Qian Chen, Gérard Medioni
Venue: Journal of VLSI Signal Processing Systems (2001)

This paper presents a working system for building 3-D human face models from two photographs. Rather than using expensive 3-D scanners, we show that frontal face models can be faithfully reconstructed from two photographs taken by consumer digital cameras in a totally non-invasive setup. We first rectify the image pair so that corresponding epipolar lines become coincident, by computing a dual point transformation. We then address the correspondence problem by converting it into a maximal surface extraction problem, which is then solved efficiently. The method effectively removes local extrema. Finally, a Euclidean reconstruction is achieved with the help of a novel factorization method for perspective cameras. Most of the computational steps are conducted in projective space. Euclidean information is introduced only at the last stage. This sets apart our system from the traditional ones which begin with metric information by using carefully calibrated cameras. We have collected a bank of face pairs to test our system, and are satisfied with its performance. Results from this image database are demonstrated.
The effects of multiplexing on a computer-communications system
Authors: Charles D. Pack
Venue: Communications of the ACM (1973)

A study is made of the way in which asynchronous time division multiplexing changes the stochastic nature of the arrival process from a user to the computer and, consequently, affects the performance of a time-shared computer-communications system. It is concluded that while, for certain values of system parameters, there is noticeable improvement in the performance of the computer (model), in the sense that time-shared scheduling delays are reduced, these improvements are offset by the transmission delays imposed by multiplexing so that there may be little or no change in the computer-communications system performance. Analytical and simulation results are based on the model of the computer-communications system being an M/D/1 queue (the multiplexor) in tandem with a single exponential server (the computer). Analytical results include a general description of the output process of an M/D/1 queue and the conditions under which this output process is approximately Poisson.
Use of the LRU stack depth distribution for simulation of paging behavior
Authors: Rollins Turner, Bill Strecker
Venue: Communications of the ACM (1977)

Two families of probability distributions were needed for use by a virtual memory simulation model: headway between page fault distributions, and working set size distributions. All members of both families can be derived from the LRU stack depth distribution. Simple expressions for the computation of both kinds of distributions are given. Finally, examples are given of both families of distributions as computed from a published stack depth distribution.
Polygonal path approximation with angle constraints
Authors: Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present efficient geometric algorithms for several problems of approximating an n-vertex polygonal path with angle constraints in the d-D space for any fixed d &gne; 2, improving significantly the corresponding graph- theoretic solutions based on known techniques (e.g., by (nearly) a factor of n for d = 2, 3). As a key step in our solutions, we formulate and solve an interesting problem called off-line ball exclusion search (OLBES), that may be of interest on its own.
The Random Weighted Interval Packing Problem: the Intermediate Density Case
Authors: Wansoo T. Rhee, Michel Talagrand
Venue: Mathematics of Operations Research (2000)

In this problem, we are givenN uniformly distributed random intervals of [0, 1]. For each random interval,I , we are given a weightX I. These weights are independent, independent of the intervals, and satisfyP( X I=t)= t a , wherea>0. Apacking of the family is adisjoint set I of these intervals. Itscost isCI=| RI| + ? I?I X I| I|, whereRI is the part of [0, 1] that is not covered by I. We are interested in the optimal (=minimal) costW Namong all packings of the random family. We consider the case 1
A more general algorithm for computing closed semiring costs between vertices of a directed graph
Authors: John G. Fletcher
Venue: Communications of the ACM (1980)

This note describes a generalization of an algorithm given by Aho, Hopcroft, and Ullman [1], originally derived from the work of Kleene [2] and McNaughton and Yamada [3]. The algorithm is used to compute the total cost of all paths between each pair of vertices in a directed graph when the cost of each edge is known. The cost of a path is defined as the product of the costs of the edges forming it, and the total cost of a set of paths is the sum of their individual costs. If there are n vertices labeled 1 through n and E[i, j] is the cost of the edge from vertex i to vertex j (or is zero when there is no such edge), then the total cost T[i, j] of all paths from i to j is the solution of the equation T[i, j] = &dgr;[i, j] + &sum;nk-1 E[i, k]&middot;T[k, j], (1) where &dgr;[i, i] = 1 (the cost of the path of no edges from i to i) and &dgr;[i, j] = 0 if i &ne; j. To assure that T [i, j] is always well-defined, costs are required to be elements from an algebraic structure called a closed semiring.
Class discovery in gene expression data
Authors: Amir Ben-Dor, Nir Friedman, Zohar Yakhini
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Recent studies (Alizadeh et al, [1]; Bittner et al,[5]; Golub et al, [11]) demonstrate the discovery of putative disease subtypes from gene expression data. The underlying computational problem is to partition the set of sample tissues into statistically meaningful classes. In this paper we present a novel approach to class discovery and develop automatic analysis methods. Our approach is based on statistically scoring candidate partitions according to the overabundance of genes that separate the different classes. Indeed, in biological datasets, an overabundance of genes separating known classes is typically observed. we measure overabundance against a stochastic null model. This allows for highlighting subtle, yet meaningful, partitions that are supported on a small subset of the genes. Using simulated annealing we explore the space of all possible partitions of the set of samples, seeking partitions with statistically significant overabundance of differentially expressed genes. We demonstrate the performance of our methods on synthetic data, where we recover planted partitions. Finally, we turn to tumor expression datasets, and show that we find several highly pronounced partitions.
Human-Computer Interaction in the Control of Dynamic Systems
Authors: William B. Rouse
Venue: ACM Computing Surveys (CSUR) (1981)

Modes of human-computer interaction in the control of dynamic systems are discussed, and the problem of allocating tasks between human and computer considered. Models of human performance in a variety of tasks associated with the control of dynamic systems are reviewed. These models are evaluated in the context of a design example involving human-computer interaction in aircraft operations. Other examples include power plants, chemical plants, and ships.
Document image retrieval without OCRing using a video scanning system
Authors: Ercan E. Kuruoglu, Vern T. Tan
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

In this paper, we propose a technique for efficient document retrieval from digital libraries containing document images which are token based compressed. The query image is captured from a paper document by the video scanning tool of a multimedia system. The technique we propose uses the layout information supplied by the relative positions of the character tokens on the page of a &ldquo;query&rdquo; paper document to retrieve the original document in the image database. This technique avoids OCRing the query document and the documents in the database; moreover avoids decompressing the token based compressed documents in the database, therefore achieving important time and computational gains.
Parallel Processor Configuration Design with Processing/Transmission Costs
Authors: Saravut Chacranoon, Thomas G. Robertazzi, Serge Luryi
Venue: IEEE Transactions on Computers (2000)

A computer configuration design problem where the objective is to configure a parallel processor to do processing in a cost effective manner is examined. The application envisioned is a specialized on-line service that rents time on its machine. The combinatorial optimization problem involved is examined analytically and a heuristic algorithm for its solution is provided. Lessons learned in this work appear in the conclusion.
Scheduling Messages with Earliest Deadline Techniques
Authors: Marco Di Natale, Antonio Meschi
Venue: Real-Time Systems (2001)

This paper discusses the applicability of earliest deadline scheduling techniques to local area networks. The focus is on controller area networks (the only standard that allows direct implementation) although a comparison is tried with other possible implementations on different network topologies (and contention resolution methods). Message scheduling follows the well-known EDF algorithm. The paper discusses the limitations and the problems in the implementation of the algorithm on standard controller area network protocols. Then, it presents a short study on the comparative effectiveness of other contention resolution methods modeled on the standards Token-ring and Carrier Sense Multiple Access-Collision Detection CSMA-CD (all implementing the earliest deadline scheduling policy.) Finally, the paper shows how to compute an optimal packet size with respect to the guaranteeability of the real-time properties, exploiting the trade-off between preemptability and efficiency.
A 48-bit pseudo-random generator
Authors: Heidi G. Kuehn
Venue: Communications of the ACM (1961)

A new 48-bit pseudo-random number generator, suitable for several computers, was tested statistically for randomness to determine its adequacy for use in Monte Carlo programs. Frequency tests, distributions of certain low-order moments, runs up and down, and runs above and below the mean were applied to one-half million generated numbers lying within the interval (0, 1) and to three sets of integers obtained from specified bits within the generated numbers. These tests substantiated the randomness of all numbers except for the set of integers coming from the least significant bits.
Note on stochastic matrices
Authors: Arnold I. Dumey
Venue: Communications of the ACM (1963)

A formula for numerical integration is prepared, which involves an exponential term. This formula is compared to two standard integration methods, and it is shown that for a large class of differential equations, the exponential formula has superior stability properties for large step sizes. Thus this formula may be used with a large step size to decrease the total computing time for a solution significantly, particularly in those engineering problems where high accuracy is not needed.
A stable and efficient buyer coalition formation scheme for e-marketplaces
Authors: Junichi Yamamoto, Katia Sycara
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Buyer coalitions are beneficial in e-marketplaces because they allow buyers to take advantage of volume discounts. However, existing buyer coalition formation schemes do not provide buyers with any means to declare and match their preferences or to calculate the division of the surplus in a stable manner. Concepts and algorithms for coalition formation have been investigated in game theory and multi-agent systems research, but because of the computational complexity, they cannot deal with thousands of buyers which could join a coalition in practice. In this paper, we propose a new buyer coalition formation scheme GroupBuyAuction. At GroupBuyAuction, buyers form a group based on a category of items. A buyer can post an OR-asking for multiple items within a category. An OR-asking is a list of items indicating that the buyer would buy any one of the items in the list with some particular reservation price. Sellers bid volume discount prices. The group leader agent splits the group into sub groups (coalitions), selects a winning seller for each coalition, and calculates surplus division among buyers. We prove that this scheme guarantees the stability in surplus division within each coalition in terms of the core in game theory. Simulation results show that, under most conditions, our scheme increases buyers' utility, and allows more buyers to obtain items compared to traditional group buying schemes, such as those used at existing commercial WWW sites.
Word 2000 in a nutshell: a power user's quick reference
Authors: Walter Glenn
Venue:  (2000)

Word 2000 in a Nutshell is a clear, concise, and complete reference to the world's most popular word-processing program. This book is the first choice of the Word power user who needs help completing a specific task or understanding a command. It's also an invaluable resource that uncovers Word 2000's undocumented features and shares powerful time-saving tips. The book's organization offers several ways to find information quickly. Part One is a thorough overview of the Word interface that serves as a roadmap for the rest of the book. This section also empowers users with an under-the-hood perspective on Word and shows how customizable Word really is. Part Two is a detailed reference to every command in Word's menu bar, from the File menu right across to the Help menu. Each entry is illuminated with straightforward explanations, clear instructions, and tips on making the most of Word's features. Part Three takes up some of Word's advanced features, with chapters on collaborating, creating a template, using VBA, and more. Specific topics covered in the book include: Understanding Word's global architectureCustomizing toolbars, menus, shortcuts, and context menusCreating and using templatesMastering fields and formsMaking the most of Word's HTML capabilityDiscovering the power of master documentsGetting started with Word macros
WebStickers: using physical tokens to access, manage and share bookmarks to the Web
Authors: Peter Ljungstrand, Johan Redström, Lars Erik Holmquist
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

In the WebStickers system, where barcode stickers may be attached to physical objects making them act as bookmarks to the worldwide web in a convenient way to the user. Using readily available technology, i.e., standard barcode readers and adhesive stickers, WebStickers enable users to take advantage of their physical environment when organizing and sharing bookmarks. Starting from a user-centered rather than technology-driven point of view, we discuss how the affordances of physical tokens, as well as the context they are placed in, can act as useful cues for users. Since many objects already have barcodes printed on them, they can be used with the WebStickers system without physical modification. In addition, WebStickers meets proposed design criteria for information workspaces.
A large font virtual terminal interface: a software prosthesis for the visually impaired
Authors: Ephraim P. Glinert
Venue: Communications of the ACM (1984)

A large font software interface running under UNIX1 is of great assistance to the severely visually impaired in the interactive use of computers. The interface, which functions as a virtual terminal as far as other processes are concerned, displays all characters (both user and system generated) at user-selectable degrees of magnification, yet is compatible with any standard CRT/keyboard terminal.
Simulating the glast satellite with gismo
Authors: Toby Burnett, Chris Chaput, Heather Arrighi, Jay Norris, Daniel J. Suson
Venue: Computing in Science and Engineering (2000)

A Monte Carlo simulation package plays a significant role in the design of the Gamma Ray Large Area Space Telescope, the successor to the Compton Gamma Ray Observatory.
A new technique for compression and storage of data
Authors: Bruce Hahn
Venue: Communications of the ACM (1974)

The widespread tendency toward storage of large programs and blocks of text has produced a need for efficient methods of compressing and storing data. This paper describes techniques that can, in most cases, decrease storage size by a factor of from two to four. The techniques involve special handling of leading and trailing blanks, and the encoding of other symbols in groups of fixed size as unique fixed point numbers. The efficiency of the system is considered and pertinent statistics are given and compared with statistics for other information coding techniques.
A 1.349 Tflops simulation of black holes in a galactic center on GRAPE-6
Authors: Junichiro Makino, Toshiyuki Fukushige, Masaki Koga
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

As an entry for the 2000 Gordon Bell performance prize, we report the performance achieved on a prototype GRAPE-6 system. GRAPE-6 is a special-purpose computer for astrophysical N-body calculations. The present configuration has 96 custom pipeline processors, each containing six pipeline processors for the calculation of gravitational interactions between particles. Its theoretical peak performance is 2.889 Tflops. The complete GRAPE-6 system will consist of 3072 pipeline chips and will achieve a peak speed of 100 Tflops. The actual performance obtained on the present 96-chip system was 1.349 Tflops, for a simulation of massive black holes embedded in the core of a galaxy with 786,432 stars. For a short benchmark run with 1,400,000 particles, the average speed was 1.640 Tflops.
Analog test design with IDD measurements for the detection of parametric and catastrophic faults
Authors: W. M. Lindermeir, T. J. Vogels, H. E. Graeb
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Earlier approaches dealt with the detection of catastrophic faults based on IDD monitoring. Consideration of the more subtle parametric faults and the ADC quantization noise, however, is essential for high-quality analog testing. The paper presents a new design method for analog test of parametric and catastrophic faults by IDD monitoring. ADC quantization noise is systematically considered throughout the method. Results prove its effectiveness.
Projective Alignment with Regions
Authors: Ronen Basri, David W. Jacobs
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

We have recently proposed an approach to recognition that uses regions to determine the pose of objects while allowing for partial occlusion of the regions. Regions introduce an attractive alternative to existing global and local approaches, since, unlike global features, they can handle occlusion and segmentation errors, and unlike local features they are not as sensitive to sensor errors, and they are easier to match. The region-based approach also uses image information directly, without the construction of intermediate representations, such as algebraic descriptions, which may be difficult to reliably compute. In this paper, we further analyze properties of the method for planar objects undergoing projective transformations. In particular, we prove that three visible regions are sufficient to determine the transformation uniquely and that for a large class of objects, two regions are insufficient for this purpose. However, we show that when several regions are available, the pose of the object can generally be recovered even when some or all regions are significantly occluded. Our analysis is based on investigating the flow patterns of points under projective transformations in the presence of fixed points.