ppxscal/embedding_network huggingface dataset:
A heuristic approach to inductive inference in fact retrieval systems
Authors: C. William Skinner
Venue: Communications of the ACM (1974)

Heuristic procedures are presented which have been developed to perform inferences by generalizing from available information. The procedures make use of a similarity structure which is imposed on the data base using nonnumerical clustering algorithms. They are implemented in a model fact retrieval system which uses a formal query language and a property-list data structure. A program of experiments is described wherein the procedures are used with test data bases which are altered by deleting part of the data and by purposely introducing false data. It is found that the system can infer the correct response under a variety of conditions involving incomplete and inconsistent data.
An &ldquo;independent visual background&rdquo; reduced balance disturbance envoked by visual scene motion: implication for alleviating simulator sickness
Authors: Henry Been-Lirn Duh, Donald E. Parker, Thomas A. Furness
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Simulator sickness (SS) / virtual environment (VE) sickness is expected to become increasingly troublesome as VE technology evolves [20]. Procedures to alleviate SS / VE sickness have been of limited value [12]. This paper investigated a possible procedure to reduce SS and VE sickness. Postural disturbance was evoked by visual scene motion at different frequencies. Differences in disturbance were examined as a function of simultaneous exposure to an &ldquo;independent visual background&rdquo; (IVB). Eight subjects were tested at two scene motion frequencies and three different IVB conditions using a within-subjects design. An expected statistically significant interaction between IVB condition and frequency was observed. For low frequency scene movements, subjects exhibited less balance disturbance when the IVB was presented. We suggest that an IVB may alleviate disturbance when conflicting visual and inertial cues are likely to result in simulator or VE sickness.
Data driven power optimization of sequential circuits
Authors: Q. Wang, S. B. K. Vrudhula
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper we present an efficient technique to reduce the power dissipation in a technology mapped CMOS sequential circuit based on logic and structural transformations. The power reduction is achieved by adding sequential redundancies from low switching activity gates to high switching activity gates such that the switching activities at the output of the connected to gates are significantly reduced. We show that the power reducing transformations result in a circuit that is a valid replacement of the original. The notion of validity used here is that of a delay safe replacement, i.e., the original circuit and the transformed circuit cannot be distinguished by observing the input and output behavior as long as the transformed circuit is clocked a finite number of cycles before applying any useful inputs. The potential transformations are found by direct logic implications applied to the circuit netlist. Therefore the complexity of each individual transformation is polynomial in the size of the circuit, allowing the processing of large designs.
An Atomicity-Generating Protocol for Anonymous Currencies
Authors: L. Jean Camp
Venue: IEEE Transactions on Software Engineering (2001)

Atomicity is necessary for reliable electronic commerce transactions [12], [6], [26]. Anonymity is also an issue of great importance not only to designers of commerce systems, [8], [10], [9], [18], but also to those concerned with the societal effects of information technologies [2], [11], [19], [20], [21], providing atomicity and anonymity is not trivial. Reliable systems, which provide highly atomic transactions, offer limited anonymity [27], [23], [15], [13]. Many anonymous systems [22], [10], [18] do not offer anonymous reliable transactions [28], [26]. Three basic approaches have been used: secure hardware for trusted record-keeping (e.g., [1]), storage of identity information with trustees for conditional anonymity (e.g., [13]), or by providing dispute resolution only with the removal of anonymity [9], [22]. In this work, the problem of anonymous atomic transactions for a generic token currency is solved using distributed trust and with the assumption that any single party may be corrupt. Defined is a transaction to include the provision of information goods or a contract to deliver specified goods, allowing for the highest degree of atomicity. The cryptographic strength of the atomicity guarantee can be made to the user's specification on a per transaction basis. The atomicity-generating protocol includes provision for dispute resolution and anonymous refunds. Also illustrated, is that any electronic token currency can be made reliable with the addition of this atomicity-generating protocol.
An information-theoretic approach to text searching in direct access systems
Authors: Ian J. Barton, Susan E. Creasey, Michael F. Lynch, Michael J. Snell
Venue: Communications of the ACM (1974)

Using direct access computer files of bibliographic information, an attempt is made to overcome one of the problems often associated with information retrieval, namely, the maintenance and use of large dictionaries, the greater part of which is used only infrequently. A novel method is presented, which maps the hyperbolic frequency distribution of text characteristics onto a rectangular distribution. This is more suited to implementation on storage devices. This method treats text as a string of characters rather than words bounded by spaces, and chooses subsets of strings such that their frequencies of occurrence are more even than those of word types. The members of this subset are then used as index keys for retrieval. The rectangular distribution of key frequencies results in a much simplified file organization and promises considerable cost advantages.
A reflexive, not impulsive agent
Authors: Catherine Pelachaud, Isabella Poggi, Berardina DeCarolis, Fiorella de Rosis
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The aim of our present research is to build an Agent capable of communicative and expressive behavior. The Agent should be able to express its emotions but also to refrain from expressing them: a reflexive, not an impulsive Agent. A Reflexive Agent is an agent who thinks it over before displaying one's emotions, that is, one who, when feeling an emotion, &lquo;decides&rdquo; not to display it immediately. In this paper we present our enriched discourse generator and we give a general overview of the factors that we consider to determine the displaying or not displaying of an emotion.
Application integration framework for a large business process redesign project
Authors: Jon Sholberg, Jim Illback
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Boeing has nearly completed a major program for business process redesign. Given the scale of this project and the large number of existing, heterogeneous systems, it has been essential that a standards-based architecture be implemented. The Common Object Request Broker Architecture (CORBA) standard has worked well as the application integration baseline for this new system
An Evaluation of Automatically Constructed Hypertexts for InformationRetrieval
Authors: Massimo Melucci
Venue: Information Retrieval (1999)

This paper assesses the retrieval effectiveness of automatically constructed inter-document hypertext links in Information Retrieval (IR). The objectives of the experiments described are to obtain evidence concerning the usefulness of querying and browsing automatically constructed IR hypertexts. Links are built by using IR techniques, as these enable rapid, automatic production of hypertexts from a document collection for accessing the collection itself. These tests are carried out in a laboratory environment and through simulation of link browsing. Results of experiments show that browsing has little impact on the retrieval of relevant documents if used in place of querying or relevance feedback methods, though may be practical if used in combination with them.
Tensor calculations on the computer
Authors: John J. Walton
Venue: Communications of the ACM (1966)

A FORMAC program has been written which is capable of calculating various quantities of interest in tensor calculus. Using this code, Christoffel symbols have been calculated for 12 basic orthogonal coordinate systems.
Numerical integration of a differential-difference equation with a decreasing time-lag
Authors: R. E. Bellman, J. D. Buell, R. E. Kalaba
Venue: Communications of the ACM (1965)

Systems in which variable time-lags are present are of common occurrence in biology. Variable flow rates are a common cause of these variable lags. At present no extensive body of knowledge exists concerning the effects which these variable lags can cause. Shown here is a method of reducing some differential-difference equations to ordinary differential equations which can then be studied numerically with ease. Subsequent study will deal with situations in which multiple-lags and lags dependent on the solution itself are present.
Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing Systems
Authors: Guohong Cao, Mukesh Singhal
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. Two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. These two approaches were orthogonal previously until the Prakash-Singhal algorithm [28] combined them. However, we [8] found that this algorithm may result in an inconsistency in some situations and we proved that there does not exist a nonblocking algorithm which forces only a minimum number of processes to take their checkpoints. In this paper, we introduce the concept of ¿mutable checkpoint,¿ which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Mutable checkpoints can be saved anywhere, e.g., the main memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring large amounts of data to the stable storage at MSSs over the wireless network. We present techniques to minimize the number of mutable checkpoints. Simulation results show that the overhead of taking mutable checkpoints is negligible. Based on mutable checkpoints, our nonblocking algorithm avoids the avalanche effect and forces only a minimum number of processes to take their checkpoints on the stable storage.
Video Segmentation by MAP Labeling of Watershed Segments
Authors: Ioannis Patras, R. L. Lagendijk, E. A. Hendriks
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper addresses the problem of spatio-temporal segmentation of video sequences. An initial intensity segmentation method (watershed segmentation) provides a number of initial segments which are subsequently labeled, with a known number of labels, according to motion information. The label field is modeled as a Markov Random Field where the statistical spatial and temporal interactions are expressed on the basis of the initial watershed segments. The labeling criterion is the maximization of the conditional a posteriori probability of the label field given the motion hypotheses, the estimate of the label field of the previous frame, and the image intensities. For the optimization, an iterative motion estimation-labeling algorithm is proposed and experimental results are presented.
Minimal decomposition of indefinite hypergeometric sums
Authors: Sergei A. Abramov, M. Petkovsek
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

We present an algorithm which, given a hypergeometric term T(n), constructs hypergeometric terms T1(n) and T2(n) such that T(n) = T1(n + 1) -T1(n) + T2(n), and T2(n) is minimal in some sense. This solves the decomposition problem for indefinite sums of hypergeometric terms: T1(n + 1) - T1(n) is the &ldquo;summable part&rdquo; and T2(n) the &ldquo;non-summable part&rdquo; of T(n).
Character scanning on the IBM 7070
Authors: A. E. Speckhard
Venue: Communications of the ACM (1960)

One general requirement in the construction of symbol manipulators and automatic programming systems is the need to scan a line of information, usually from left to right, and to break down or subdivided this line into words, phrases or some form of subgrouping. Assuming a natural or free form was allowed in the composition of the line, it will be necessary to examine in sequence each character of the line and, depending on the syntactical rules in force, accumulate characters into a word until a separator is recognized. For example, consider breaking down AX, BX, CX on the basis of the comma.
Hidden lines elimination for a rotating object
Authors: Yutaka Matsushita
Venue: Communications of the ACM (1972)

A method is presented of determining which parts of three-dimensional objects are visible and which are invisible when the objects are rotated about some axis. This paper describes a polygon comparison scheme in which the relationships of two polygons can be classified into tree types, and also discusses how the relationship is changed for each pair of polygons under rotation about some axis. A rotation table is defined for each pair of polygons, which remains fixed as long as rotation is about one axis and provides a means of rapidly determining the visible and hidden line relationship between two polygons. Additional work must be done to extend this approach to simultaneous rotation about several axes.
Evaluating the output of recursive routines using successive queues
Authors: James L. Boettler,  Dr.
Venue: Journal of Computing Sciences in Colleges (2001)

This paper shows a method of evaluating the results of recursive subprograms without using stacks, but using successive queues. In the sense used here, we start with a queue including just one item, namely the call to the recursive routine, using a suitable notation (usually compacted). The queue is then expanded one level into a new queue, using left-to-right evaluation, including a notation which shows which items are fully evaluated and which items yet need to be evaluated via calls back to the subprogram. The development of new queues stops when there are no more calls in the queue; in this case, what remains is the output desired, in left-to-right order. (Sometimes the last queue contains operations which must be completed before the problem is solved.) One reviewer of this paper suggested an alternate title for this paper, which I'll reword as: &ldquo;Evaluating the Output of a Recursive Routine Using Left-to Right Expansion Rules Based on the Recursive Routine.&rdquo; But I prefer my title, as it is simpler, though slightly restrictive for the general cases.
Partially Symmetric Values
Authors: Ori Haimanko
Venue: Mathematics of Operations Research (2000)

We consider spaces of differentiable nonatomic and mixed vector measure games,pNA andpM, with finitely or countably many types of players. Type-symmetric values on these spaces of games are investigated (all Aumann and Shapley conditions except symmetry are assumed, the latter being replaced by a weaker assumption of covariance under automorphisms of the space of players that preserve each type). We show that if the types are uncountable, then type-symmetric values are random path values. In particular, the symmetric values onpM are characterized as mixtures of values defined in Hart (1973).
Fast motion estimation for real-time shape-adaptive MPEG-4 encoding
Authors: Peter Kauff, Klaas Schüür
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper presents a fast motion estimator which can be used for real-time MPEG-4 encoding of arbitrarily shaped video objects. The approach is based on an existing algorithm which has already been applied successfully to format conversion. To exploit it for shape-adaptive coding, the algorithm has been adapted to the special properties of the MPEG-4 standard. With this new tool it becomes possible to encode arbitrarily shaped video objects (CIF, 25 Hz) in real-time with a MPEG-4 software encoder at a Pentium III 500 MHz. The real-time capability has to be paid by a slight loss of coding efficiency (about 0.2 dB in terms of rate-distortion measurements), compared to the MPEG-4 verification model.
From Washington
Authors: Rosalie Steier
Venue: Communications of the ACM (1984)

Congress is paying careful attention to threats to U.S. high technology from two areas: trademark and patent infringement and proposed foreign violation of U.S. copyright laws. Computer technology is becoming a major victim of the nearly $8 billion counterfeit business threatening the American economy. Some recent product examples include fake Apple computers seized by U.S. Customs and reverse engineered Apples and other microcomputers on sale in Hong Kong for $300, about a third of the price of a genuine product. U.S. firms fear losses large enough to hinder research and development efforts. This would result in erosion of their technological edge.
Video keyframe production by efficient clustering of compressed chromaticity signatures (poster session)
Authors: Mark S. Drew, James Au
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We develop a new low-dimensional video frame feature that is more insensitive to lighting change, motivated by color constancy work in physics-based vision, and apply the feature to keyframe production using hierarchical clustering. The new feature has the further advantage of more expressively capturing image information and as a result produces a very succinct set of keyframes for any video. Because we effectively reduce any video to the same lighting conditions, we can produce a universal basis on which to project video frame features. We carry out clustering efficiently by adapting a hierarchical clustering data structure to temporally-ordered clusters. Using a new multi-stage hierarchical clustering method, we merge clusters based on the ratio of cluster variance to variance of the parent node, merging only adjacent clusters, and then follow with a second round of clustering. The second stage merges clusters incorrectly split in the first round by the greedy hierarchical algorithm, and as well merges non-adjacent clusters to fuse near-repeat shots. The new summarization method produces a very succinct set of keyframes for videos, and results are excellent.
The evolution of user behavior in a computerized conferencing system
Authors: Starr Roxanne Hiltz, Murray Turoff
Venue: Communications of the ACM (1981)

Data from 18-month operational trials of the EIES system indicate that the range of features considered valuable in a computer-based communication system increases with the amount of experience gained by using this medium of communication. Simple message systems alone are not likely to satisfy the communications needs of long term, regular users of computerized communications systems. Among the capabilities which long term, regular users find valuable are group conferences, notebooks for text composition, and self-defined commands.
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Authors: Yu-Lung Lo, Kien A. Hua, Honesty C. Young
Venue: Distributed and Parallel Databases (2001)

Several studies have repeatedly demonstrated that both the performance and scalability of a shared-nothing parallel database system depend on the physical layout of data across the processing nodes of the system. Today, data is allocated in these systems using horizontal partitioning strategies. This approach has a number of drawbacks. If a query involves the partitioning attribute, then typically only a small number of the processing nodes can be used to speedup the execution of this query. On the other hand, if the predicate of a selection query includes an attribute other than the partitioning attribute, then the entire data space must be searched. Again, this results in waste of computing resources. In recent years, several multidimensional data declustering techniques have been proposed to address these problems. However, these schemes are too restrictive (e.g., FX, ECC, etc.), or optimized for a certain type of queries (e.g., DM, HCAM, etc.). In this paper, we introduce a new technique which is flexible, and performs well for general queries. We prove its optimality properties, and present experimental results showing that our scheme outperforms DM and HCAM by a significant margin.
UCSD center for wireless communications "sun, fun and Ph.D.s, too"
Authors: Ramesh R. Rao, Lawrence Larson
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

Founded in 1995 by the University of California, San Diego and Industrial Participants, the Center for Wireless Communications collaborates to identify emerging opportunities, pursue basic research, and transfer relevant technology for subsequent commercialization.
Keyblock: an approach for content-based image retrieval
Authors: Lei Zhu, Aidong Zhang, Aibing Rao, Rohini Srihari
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We propose a new framework termed Keyblock for content-based image retrieval, which is a generalization of the text-based information retrieval technology in the image domain. In this framework, methods for extracting comprehensive image features are provided, which are based on the frequency of representative blocks, termed keyblocks, of the image database. Keyblocks, which are analogous to index terms in text document retrieval, can be constructed by exploiting the vector quantization (VQ) method which has been used for image compression. By comparing the performance of our approach with the existing techniques using color feature and wavelet texture feature, the experimental results demonstrate the effectiveness of the framework in image retrieval.
An optimal insertion algorithm for one-sided height-balanced binary search trees
Authors: Kari-Jouko Räihä, Stuart H. Zweben
Venue: Communications of the ACM (1979)

An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm operates in time O(log n), where n is the number of nodes in the tree. This represents an improvement over the best previously known insertion algorithms of Hirschberg and Kosaraju, which require time O(log2n). Moreover, the O(log n) complexity is optimal. Earlier results have shown that deletion in such a structure can also be performed in O(log n) time. Thus the result of this paper gives a negative answer to the question of whether such trees should be the first examples of their kind, where deletion has a smaller time complexity than insertion. Furthermore, it can now be concluded that insertion, deletion, and retrieval in OSHB trees can be performed in the same time as the corresponding operations for the more general AVL trees, to within a constant factor. However, the insertion and deletion algorithms for OSHB trees appear much more complicated than the corresponding algorithms for AVL trees.