ppxscal/embedding_network huggingface dataset:
Self-adjusting output data compression: an efficient BIST technique for RAMs
Authors: V. N. Yarmolik, S. Hellebrand, H.-J. Wunderlich
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

After write operations, BIST schemes for RAMS relying on signature analysis must compress the entire memory contents to update the reference signature. This paper introduces a new scheme for output data compression which avoids this overhead while retaining the benefits of signature analysis. The proposed technique is based on a new memory characteristic derived as the modulo-2 sum of all addresses pointing to non-zero cells. This characteristic can be adjusted concurrently with write operations by simple EXOR-operations on the initial characteristic and on the addresses affected by the change.
On-the-fly garbage collection: an exercise in cooperation
Authors: Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, E. F. M. Steffens
Venue: Communications of the ACM (1978)

As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted to the computation proper. Exclusion and synchronization constraints have been kept as weak as could be achieved; the severe complexities engendered by doing so are illustrated.
Optimizing search by showing results in context
Authors: Susan Dumais, Edward Cutrell, Hao Chen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We developed and evaluated seven interfaces for integrating semantic category information with Web search results. List interfaces were based on the familiar ranked-listing of search results, sometimes augmented with a category name for each result. Category interfaces also showed page titles and/or category names, but re-organized the search results so that items in the same category were grouped together visually. Our user studies show that all Category interfaces were more effective than List interfaces even when lists were augmented with category names for each result. The best category performance was obtained when both category names and individual page titles were presented. Either alone is better than a list presentation, but both together provide the most effective means for allowing users to quickly examining search results. These results provide a better understanding of the perceptual and cognitive factors underlying the advantage of category groupings and provide some practical guidance to Web search interface designers.
Extending the infomation theory approach to converting limited-entry decision tables to computer programs
Authors: Keith Shwayder
Venue: Communications of the ACM (1974)

This paper modifies an earlier algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. The algorithms considered in this paper perform limited search and, accordingly, do not necessarily result in globally optimal solutions. However, the greater search effort needed to obtain a globally optimal solution for complex decision tables is usually not justified by sufficient savings in execution time. There is an analogy between the problem of converting decision tables into efficient flowcharts and the well-understood problem in information theory of noiseless coding. The results of the noiseless coding literature are used to explore the limitations of algorithms used to solve the decision table problem. The analogy between the two problems is also used to develop improvements to the information algorithm in extending the depth of search under certain conditions and in proposing additional conditions to be added to the decision table. Finally, the information algorithm is compared with an algorithm proposed in a recent paper by Verhelst.
The use of an interactive information storage and retrieval system in medical research
Authors: Henry C. Lucas,  Jr.
Venue: Communications of the ACM (1978)

This paper presents the results of a study of the use of an interactive computerized storage and retrieval system. A monitor built into the computer system provided usage data for the study. Additional data on user reactions were gathered from a questionnaire. The results show the important role played by frequently chosen laboratory reference leaders in influencing the use of this system. The implications of the study for the design of similar systems are discussed.
Applying an update method to a set of receivers
Authors: Marc Andries, Luca Cabibbo, Jan Paredaens, Jan van den Bussche
Venue: ACM Transactions on Database Systems (TODS) (2001)

In the context of object databases, we study the application of an update method to a collection of receivers rather than to a single one. The obvious strategy of applying the update to the receivers one after the other, in some arbitrary order, brings up the problem of order independence. On a very general level, we investigate how update behavior can be analyzed in terms of certain schema annotations, called colorings. We are able to characterize those colorings that always describe order-independedent updates. We also consider a more specific model of update methods implemented in the relational algebra. Order-independence of such algebraic methods is undecidable in general, but decidable if the expressions used are positive. Finally, we consider an alternative parallel strategy for set-oriented applications of algebraic update methods and compare and relate it to the sequential strategy.
A simplified recombination scheme for the Fibonacci buddy system
Authors: Ben Cranston, Rick Thomas
Venue: Communications of the ACM (1975)

A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented.
Flexible abbreviation of words in a computer language
Authors: R. G. Loomis, J. Rubin
Venue: Communications of the ACM (1963)

An increasing number of computer programs are designed to accept and translate a symbolic, English-like language which facilitates communication between the user and the computer. A common feature of such programs is a pre-determined vocabulary of expressions for specifying the input to the program. This note describes a generalized technique for permitting flexible abbreviation of such expressions in order to further simplify the task of writing source programs.
Lessons learned from employing multiple perspectives in a collaborative virtual environment for visualizing scientific data
Authors: Kyoung S. Park, Abhinav Kapoor, Jason Leigh
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

This paper explores the concept of multiple perspectives to enhance collaboration by allowing remote participants to tailor their views, user-interfaces and roles to their particular needs and expertise. It describes a preliminary design study conducted on users of a collaborative CAVE-based virtual reality tool for visualizing occanographic data. Results will focus on the patterns of activity within this environment, in particular the manner in which participants transition between individual and group work during the course of a collaborative session.
The denotational semantics of programming languages
Authors: R. D. Tennent
Venue: Communications of the ACM (1976)

This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey. The application of the theory to formal language specification is demonstrated and other applications are surveyed. The first language considered, LOOP, is very elementary and its definition merely introduces the notation and methodology of the approach. Then the semantic concepts of environments, stores, and continuations are introduced to model classes of programming language features and the underlying mathematical theory of computation due to Scott is motivated and outlined. Finally, the paper presents a formal definition of the language GEDANKEN.
Parallel Solutions of Simple Indexed Recurrence Equations
Authors: Yosi Ben-Asher, Gadi Haber
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

We define a new type of recurrence equations called ¿Simple Indexed Recurrences¿ (SIR). In this type of equations, ordinary recurrences are generalized to $X[g(i)] = op_i(X[f(i)],X[g(i)])$, where $f,g:\{1\ldots n\}\mapsto \{1\ldots m\}$, $op_i(x,y)$ is a binary associative operator and $g$ is distinct, i.e., $\forall i\ne j \; \; g(i)\ne g(j)$. This enables us to model certain sequential loops as a sequence of SIR equations. A parallel algorithm that solves a set of SIR equations will, in fact, parallelize sequential loops of the above type. Such a parallel SIR algorithm must be efficient enough to compete with the $O(n)$ work complexity of the original loop. We show why efficient parallel algorithms for the related problems of List Ranking and Tree Contraction, which require $O(n)$ work, cannot be applied to solving SIR. We instead use repeated iterations of pointer jumping to compute the final values of $X[]$ in ${\frac {n} {p}} \cdot \log p$ steps and $n \cdot \log p$ work, with $p$ processors. A sequence of experiments was performed to test the effect of synchronous and asynchronous executions on the actual performance of the algorithm. These experiments show that pointer jumping requires $O(n)$ work in most practical cases of SIR loops.An efficient solution is given for the special case where we know how to compute the inverse of $op_i$, and finally, useful applications of SIR to the well-known Livermore Loops benchmark are presented.
A 1.5 V, 8 mW, 8 b, 15 Msps BiCMOS A/D Converter
Authors: Michio Yotsuyanagi, Hiroshi Hasegawa, Masaharu Satoh
Venue: Analog Integrated Circuits and Signal Processing (2000)

A 1.5 V 8 mW BiCMOS video A/D converter has been developed by using a BiCMOS pumping comparator. Combining Bipolar high-speed and good-matching characteristics with CMOS switched capacitor techniques, this A/D converter is suitable for use in battery-operated multimedia terminals.
The notions of consistency and predicate locks in a database system
Authors: K. P. Eswaran, J. N. Gray, R. A. Lorie, I. L. Traiger
Venue: Communications of the ACM (1976)

In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which satisfies the consistency condition is suggested.
Use of collaborative multimedia in computer science classes
Authors: Mark Guzdial
Venue: ACM SIGCSE Bulletin (2001)

While there is a lot of speculation about the benefits of multimedia exploration, research on learning and technology suggests that the creation of media by students has even greater benefit for learning. Students learn through articulating their knowledge in their multimedia documents, reviewing their own work, and receiving comments and critiques on their work. In the research of the Collaborative Software Lab (http://coweb.cc.gatech.edu/csl), we are particularly interested in exploring the creation of media through collaborative technology. By having students work together in creating diverse media, we encourage review and critique, and create opportunities for joint learning. We have been using an environment for collaborative multimedia in several computer science classes, and in this paper, we describe some of the activities that teachers have invented for using the CoWeb.
Applications of symbol manipulation in theoretical physics
Authors: Anthony C. Hearn
Venue: Communications of the ACM (1971)

This paper surveys the applications of symbolic computation techniques to problems in theoretical physics. Particular emphasis is placed on applications in quantum electrodynamics where the most activity has occurred.
A Method of Local Skin Perfusion Detection
Authors: Jan Hálek
Venue: Journal of Medical Systems (2000)

On the epidermal surface there are inhomogeneities which manifest as, among other things, lower local impedance. These regions include Head's zones, sweat glands, and also the so-called acupuncture points. The aim of this paper is to examine the effect of skin perfusion on epidermal impedance at the acupuncture points. When measuring epidermis impedance in the local (acupuncture) points the method of impedance plethysmography was applied. Both the method of four electrode measurement at the constant current and the method of two electrode measurement by means of the different and indifferent electrode as well were engaged. First, we had to uncover the size of the action skin points which was made by means of a different micro-electrode developed by us. The effect of some factors on the reproducibility and comparability of the values measured was evaluated. The attention was focused mainly on the questions of the pressure of the different electrode on the skin surface, magnitude and waveform of the excitating current, and so on. The authors demonstrate the impossibility to measure changes in skin impedance in the acupuncture points, in dependence on the blood perfusion&mdash;which was due to the high serial resistance between the point measured in the acupuncture place when the four-electrode measurement was applied, on the other side.
Computer scientists whose scientific freedom and human rights have been violated: a report of the ACM committee on scientific freedom and human rights
Authors: Jack Minker
Venue: Communications of the ACM (1981)

This report had its genesis before the establishment in February 1980 of the Committee on Scientific Freedom and Human Rights (CSFHR). In 1978 Paul Armer, chairman of the Committee on Computers and Public Policy (CCPP), asked Jack Minker of the University of Maryland to chair a Subcommittee on Human Rights and to prepare a report on the human rights of computer scientists. When CSFHR was formed it was natural to transfer this activity to it since one of the activities of CSFHR, as specified in its charter, is: Gathering data on systematic violations of scientific freedom and human rights and fully publicizing such data.&hellip; Careful attention will be given to assuring the validity of all data.
Managing Medical and Insurance Information Through a Smart-Card-Based Information System
Authors: C. Lambrinoudakis
Venue: Journal of Medical Systems (2000)

The continuously increased mobility of patients and doctors, in conjunction with the existence of medical groups consisting of private doctors, general practitioners, hospitals, medical centers, and insurance companies, pose significant difficulties on the management of patients' medical data. Inevitably this affects the quality of the health care services provided. The evolving smart card technology can be utilized for the implementation of a secure portable electronic medical record, carried by the patient herself/himself. In addition to the medical data, insurance information can be stored in the smart card thus facilitating the creation of an &ldquo;intelligent system&rdquo; supporting the efficient management of patient's data. In this paper we present the main architectural and functional characteristics of such a system. We also highlight how the security features offered by smart cards can be exploited in order to ensure confidentiality and integrity of the medical data stored in the patient cards.
Towards ubiquitous database in mobile commerce
Authors: Kimio Kuramitsu, Ken Sakamura
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

Ubiquitous database places data everywhere. We focus on contactless smartcards combined with a small processor and memory for data storage. Very small DBMS implemented on them can interact through queries on a wireless communication. Ubiquitous database attaches such DBMSs to real world &ldquo;objects&rdquo; physically, and then allows different organizations to share information retrieved directly from physical goods, materials, or persons. We combined the theory with practice in the ticket digitalization project. Through the experience of our project, this paper will discuss how to manage ubiquitous database in the context of mobile commerce applications.
An on-line algorithm for fitting straight lines between data ranges
Authors: Joseph O'Rourke
Venue: Communications of the ACM (1981)

Applications often require fitting straight lines to data that is input incrementally. The case where a data range [&agr;k, &ohgr;k] is received at each tk, t1 < t2 < &hellip; tn, is considered. An algorithm is presented that finds all the straight lines u = mt + b that pierce each data range, i.e., all pairs (m, b) such that &agr;k &le; mtk + b &le; &ohgr;k for k = 1, &hellip; , n. It may be that no single line fits all the ranges, and different alternatives for handling this possibility are considered. The algorithm is on-line, producing the correct partial result after processing the first k ranges for all k < n. For each k, the set of (m, b) pairs constitutes a convex polygon in the m-b parameter space, which can be constructed as the intersection of 2k half-planes. It is shown that the O(n logn) half-plane intersection algorithm of Shamos and Hoey can be improved in this special case to O(n).
An agent-based approach to imagery and geospatial computing
Authors: James J. Nolan, Robert Simon, Arun K. Sood
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper introduces a scalable, flexible agent-based architecture for imagery and geospatial processing. This architecture supports collaboration and reuse by defining a set of fine-grained imagery and geospatial processing agents and a combined knowledge encoding and Agent Communication Language called I-XML. Scalability and reuse are achieved by employing a collaborative communication structure. Agents do not communicate directly; rather, all collaboration and reuse goes through a shared page space that stores I-XML pages. We show how this approach simplifies system design and facilitates collaboration and information sharing among area experts. This architecture has been implemented in the Java environment using Jini middleware for agent communication and mobility, and COTS packages for processing functionality.
Unsupervised and supervised clustering for topic tracking
Authors: Martin Franz, Todd Ward, J. Scott McCarley, Wei-Jing Zhu
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We investigate important differences between two styles of document clustering in the context of Topic Detection and Tracking. Converting a Topic Detection system into a Topic Tracking system exposes fundamental differences between these two tasks that are important to consider in both the design and the evaluation of TDT systems. We also identify features that can be used in systems for both tasks.
Quotients of Poincar&eacute; Polynomials Evaluated at &ndash;1
Authors: Oliver D. Eng
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

For a finite reflection group i>W and parabolic subgroup i>WJ, we establish that the quotient of Poincar&eacute; polynomials \frac{W(t)}{W_J(t)}, when evaluated at i>t&equals;&minus;1, counts the number of cosets of i>WJ in i>W fixed by the longest element. Our case-by-case proof relies on the work of Stembridge (Stembridge, i>Duke Mathematical Journal, 73 (1994), 469&ndash;490) regarding minuscule representations and on the calculations of \frac{W(-1)}{W_J(-1)} of Tan (Tan, i>Communications in Algebra, 22 (1994), 1049&ndash;1061).
Reconciling simplicity and realism in parallel disk models
Authors: Peter Sanders
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

For the design and analysis of algorithms that process huge data sets, a machine model is needed that handles parallel disks. There seems to be a dilemma between simple and flexible use of such a model and accurate modelling of details of the hardware. This paper explains how many aspects of this problem can be resolved. The programming model implements one large logical disk allowing concurrent access to arbitrary sets of variable size blocks. This model can be implemented efficienctly on multiple independent disks even if zones with different speed, communication bottlenecks and failed disks are allowed. These results not only provide useful algorithmic tools but also imply a theoretical justification for studying external memory algorithms using simple abstract models. The algorithmic approach is random redundant placement of data and optimal scheduling of accesses. The analysis generalizes a previous analysis for simple abstract external memory models in several ways (Higher efficiency, variable block sizes, more detailed disk model). As a side effect, an apparently new Chernoff bound for sums of weighted 0-1 random variables is derived.
The evolution of the DECsystem 10
Authors: C. G. Bell, A. Kotok, T. N. Hastings, R. Hill
Venue: Communications of the ACM (1978)

The DECsystem 10, also known as the PDP-10, evolved from the PDP-6 (circa 1963) over five generations of implementations to presently include systems covering a price range of five to one. The origin and evolution of the hardware, operating system, and languages are described in terms of technological change, user requirements, and user developments. The PDP-10's contributions to computing technology include: accelerating the transition from batch oriented to time sharing computing systems; transferring hardware technology within DEC (and elsewhere) to minicomputer design and manufacturing; supporting minicomputer hardware and software development; and serving as a model for single user and timeshared interactive minicomputer/microcomputer systems.
An experiment in automatic verification of programs
Authors: G. M. Weinberg, G. L. Gressett
Venue: Communications of the ACM (1963)

How effective is a compiler at replacing explicit verification, and what is the cost of this technique?
The mobile programming system: STAGE2
Authors: W. M. Waite
Venue: Communications of the ACM (1970)

STAGE2 is the second level of a bootstrap sequence which is easily implemented on any computer. It is a flexible, powerful macro processor designed specifically as a tool for constructing machine-independent software. In this paper the features provided by STAGE2 are summarized, and the implementation techniques which have made it possible to have STAGE2 running on a new machine with less than one man-week of effort are discussed. The approach has been successful on over 15 machines of widely varying characteristics.
Probabilistic pricebots
Authors: Amy R. Greenwald, Jeffrey O. Kephart
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Past research has been concerned with the potential of embedding deterministic pricing algorithms into {\em pricebots}: software agents used by on-line sellers to automatically price Internet goods. In this work, probabilistic pricing algorithms based on {\em no-regret\/} learning are explored, in both high-information and low-information settings. It is shown via simulations that the long-run empirical frequencies of prices in a market of no-regret pricebots can converge to equilibria arbitrarily close to an asymmetric Nash equilibrium; however, instantaneous price distributions need not converge.