ppxscal/embedding_network huggingface dataset:
An application of least squares fit mapping to text information retrieval
Authors: Yiming Yang, Christopher G. Chute
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

This paper describes a unique example-based mapping method for document retrieval. We discovered that the knowledge about relevance among queries and documents can be used to obtain empirical connections between query terms and the canonical concepts which are used for indexing the content of documents. These connections do not depend on whether there are shared terms among the queries and documents; therefore, they are especially effective for a mapping from queries to the documents where the concepts are relevant but the terms used by article authors happen to be different from the terms of database users. We employ a Linear Least Squares Fit (LLSF) technique to compute such connections from a collection of queries and documents where the relevance is assigned by humans, and then use these connections in the retrieval of documents where the relevance is unknown. We tested this method on both retrieval and indexing with a set of MEDLINE documents which has been used by other information retrieval systems for evaluations. The effectiveness of the LLSF mapping and the significant improvement over alternative approaches was evident in the tests.
On the Sperner Capacity of the Cyclic Triangle
Authors: Aart Blokhuis
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

Using a single trick it is shown that the Sperner capacity of the cyclic triangle equals log 2.
The Army High Performance Computing Research Center
Authors: Tayfun E. Tezduyar
Venue: IEEE Computational Science Engineering (1994)

The US Army High Performance Computing Research Center (AHPCRC) provides nationwide leadership in high performance computing (HPC) research. Its supercomputing resources are maintained and operated by the Minnesota Supercomputer Center, Inc. AHPCRC researchers are developing novel techniques and advanced algorithms and applying them to physical problems, as well as evaluating and using advanced computing platforms for HPC applications. The Center trains future scientists and engineers by sponsoring computer science educational research at the undergraduate, MS, PhD, and postdoctoral levels. It provides a framework for HPC technology transfer and infrastructure support to Army laboratories by conducting joint research projects between Army scientists and Center researchers; by jointly supervising the staff scientists placed by the Center at the Army laboratories; and by encouraging visits between Army scientists and Center researchers. Finally, the AHPCRC provides a state-of-the-art HPC environment to its academic partners, to Army and Defense Department scientists, and to industrial and international collaborators.
Optimal multiphase complete exchange on circuit-switched hypercube architectures
Authors: David M. Nicol, Shahid H. Bokhari
Venue: Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1994)

The complete-exchange communication primitive on a distributed memory multiprocessor calls for every processor to send a message to every other processor, each such message being unique. For circuit-switched hypercube networks there are two well-known schemes for implementing this primitive. Direct exchange minimizes communication volume but maximizes startup costs, while Standard Exchange minimizes startup costs at the price of higher communication volume. This paper analyzes a hybrid, which can be thought of as a sequence of Direct Echange phases, applied to variable-sized subcubes. This paper examines the problem of determining the optimal subcube dimension sizes di for every phase. We show that optimal performance is achieved using some equi-partition, where |di&minus;dj|&le;1 for all phases i and j. We study the behavior of the optimal partition as a function of machine communication parameters, hypercube dimension, and message size, and show that the optimal partition can be determined with no more than 2d+1 comparisons. Finally we validate the model empirically, and for certain problem instances observe as much as a factor of two improvement over the other methods.
Concurrent Evaluation of Machinability During Product Design
Authors: Satyandra K. Gupta, Dana S. Nau, Guangming Zhang
Venue: Computer (1993)

An approach to evaluating the machinability of a part during the design stage, which performs systematic generation and evaluation of machining alternatives, is discussed. The results of the analysis provide feedback to the designer about problems that might arise with the machining and information to the manufacturing engineer about which machining processes and process parameters are most desirable.
Load testing software using deterministic state testing
Authors: Alberto Avritzer, Brian Larson
Venue: Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis (1993)

In this paper we introduce a new load testing technique called Deterministic Markov State Testing and report on its application. Our approach is called &ldquo;deterministic&rdquo; because the sequence of test case execution is set at planning time, and &ldquo;state testing&rdquo; because each test case certifies a unique software state. There are four main advantages of Deterministic Markov State Testing for system testers: provision of precise software state information for root cause analysis in load test, accommodation for limitations of the system test lab configuration, higher acceleration ratios in system test, and simple management of distributed execution of test cases. System testers using the proposed method have great flexibility in dealing with common system test problems: limited access to the system test environment, unstable software, or changing operational conditions. Because each test case verifies correct execution on a path from the idle state to the software state under test, our method does not require the continuous execution of all test cases. Deterministic Markov State Testing is operational-profile-based, and allows for measurement of software reliability robustness when the operational profile changes.
TCP/IP illustrated (vol. 1): the protocols
Authors: W. Richard Stevens
Venue:  (1993)

TCP/IP Illustrated, Volume 1 is a complete and detailed guide to the entire TCP/IP protocol suite - with an important difference from other books on the subject. Rather than just describing what the RFCs say the protocol suite should do, this unique book uses a popular diagnostic tool so you may actually watch the protocols in action.By forcing various conditions to occur - such as connection establishment, timeout and retransmission, and fragmentation - and then displaying the results, TCP/IP Illustrated gives you a much greater understanding of these concepts than words alone could provide. Whether you are new to TCP/IP or you have read other books on the subject, you will come away with an increased understanding of how and why TCP/IP works the way it does, as well as enhanced skill at developing aplications that run over TCP/IP.
Some Extensions and Embeddings of Near Polygons
Authors: Hans Cuypers, Thomas Meixner
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

Let (P, L, &ast;) be a near polygon having s + 1 points per line, s > 1, and suppose k is a field. Let Vk be the k-vector space with basis \{v_p \ \vert \ p \in P\}. Then the subspace generated by the vectors v_l = \sum_{p*l}v_p, where l &isin; L, has codimension at least 2 in Vk.This observation is used in two ways. First we derive the existence of certain diagram geometries with flag transitive automorphism group, and secondly, we show that any finite near polygon with 3 points per line can be embedded in an affine GF(3)-space.
Identifying Faces Using Multiple Retrievals
Authors: Jian Kang Wu, Arcot Desai Narasimhalu
Venue: IEEE MultiMedia (1994)

During a police investigation, officers often have to sort through hundreds of photographs to identify a suspect. To aid this task, we at the Institute of Systems Science developed and implemented a flexible database system that can retrieve faces using personal information, fuzzy and free-text descriptors, and classification trees.
Overview of the first TREC conference
Authors: Donna Harman
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

The first Text REtrieval Conference (TREC-1) was held in early November 1992 and was attended by about 100 people working in the 25 participating groups. The goal of the conference was to bring research groups together to discuss their work on a new large test collection. There was a large variety of retrieval techniques reported on, including methods using automatic thesaurii, sophisticated term weighting, natural language techniques, relevance feedback, and advanced pattern matching. As results had been run through a common evaluation package, groups were able to compare the effectiveness of different techniques, and discuss how differences among the sytems affected performance.
A critical review of the notion of algorithm in computer science
Authors: Karl M. Fant
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

We first review the development of the notion of the algorithm as a fundamental paradigm of mathematics. We then suggest a definition of computer science that distinguishes it from all other sciences and from mathematics. Finally we argue that the conceptual concerns of computer science are quite different from the conceptual concerns of mathematics and that the notion of the algorithm is and has been an inappropriate and ineffective paradigm for computer science.
Report of the Workshop on Semantic Heterogeneity and Interpolation in multidatabase Systems
Authors: Pam Drew, Roger King, Dennis McLeod, Marek Rusinkiewicz, Avi Silberschatz
Venue: ACM SIGMOD Record (1993)

This report presents a review of the problems that were discussed during the Workshop on Semantic Heterogeneity and Interoperability in Multidatabase Systems. The workshop participants discussed the importance of interoperation in the U S WEST information processing environment and the progress that has been achieved in three major research areas: resolution of semantic heterogeneity among cooperating heterogeneous systems, transaction management in such environments, and software architecture for interoperation. The workshop provided researchers with necessary feedback from the industrial perspective and helped in identifying the major issues that need further research. The following problems concerning the applicability of the methods proposed for data processing in the heterogeneous, autonomous information systems have been identified: (i) many of the assumptions made in the research community are too restrictive to make the results directly applicable to existing environments; (ii) performance ramifications of various heterogeneous architectures need to be understood; (iii) the prototype systems need to be put to the test with real data, schemas, and transaction streams to verify their utility.
Helping computer scientists in Romania
Authors: Irina Athanasiu
Venue: ACM SIGMOD Record (1993)

As a Professor in the Computer Science Department of the Polytechnical Institute of Bucharest, Romania, I would like to bring to your attention the effort of a group of professionals, researchers, students and professors around the world. This effort, called &ldquo;Free UNIX for Romania&rdquo;, has been initiated and coordinated by Marius Hancu, an advisor at the Parallel Architectures Group, Center de Recherche Informatique de Montreal, Montreal, Canada.
Cooperative shared memory: software and hardware for scalable multiprocessors
Authors: Mark D. Hill, James R. Larus, Steven K. Reinhardt, David A. Wood
Venue: ACM Transactions on Computer Systems (TOCS) (1993)

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware designers which cases are common (so they can build simple hardware to optimize them). Cooperative shared memory, our approach to shared-memory design, addresses this problem. Our initial implementation of cooperative shared memory uses a simple programming model, called Check-In/Check-Out (CICO), in conjunction with even simpler hardware, called Dir1SW. In CICO, programs bracket uses of shared data with a check_in directive terminating the expected use of the data. A cooperative prefetch directive helps hide communication latency. Dir1SW is a minimal directory protocol that adds little complexity to message-passing hardware, but efficiently supports programs written within the CICO model.
Use of Common Time Base for Checkpointing and Rollback Recovery in a Distributed System
Authors: Parameswaran Ramanathan, Kang G. Shin
Venue: IEEE Transactions on Software Engineering (1993)

An approach to checkpointing and rollback recovery in a distributed computing system using a common time base is proposed. A common time base is established in the system using a hardware clock synchronization algorithm. This common time base is coupled with the idea of pseudo-recovery points to develop a checkpointing algorithm that has the following advantages: reduced wait for commitment for establishing recovery lines, fewer messages to be exchanged, and less memory requirement. These advantages are assessed quantitatively by developing a probabilistic model.
The enable construct for exception handling in Fortran 90
Authors: CORPORATE IFIP Working Group 2.5
Venue: ACM SIGNUM Newsletter (1993)

It is apparent that a good mechanism for handling computing exceptions is essential for the construction of robust and maintainable Fortran 90 code. Ideally such code would execute rapidly when all is well and not fail in situations such as when data is near the arithmetic limits or there is insufficient memory for an automatic array. A language feature is needed that permits transfer of control when necessary from straightforward fast code to slower code that uses an alternative algorithm.
The Descent Monomials and a Basis for the Diagonally Symmetric Polynomials
Authors: E. E. Allen
Venue: Journal of Algebraic Combinatorics: An International Journal (1994)

Let R(X) &equals; Q&lsqb;x1, x2, &hellip;, xn&rsqb; be the ring of polynomials in the variables X &equals; &lcub;x1, x2, &hellip;, xn&rcub; and R&ast;(X) denote the quotient of R(X) by the ideal generated by the elementary symmetric functions. Given a &sigma; &isin; Sn, we let g_\sigma (X)=\prod _{\sigma_1 \gt {\sigma_{i+1}}} (x_{\sigma_1}x_{\sigma_2}\ldots x_{\sigma_i}). In the late 1970s I. Gessel conjectured that these monomials, called the descent monomials, are a basis for R&ast;(X). Actually, this result was known to Steinberg &lsqb;10&rsqb;. A. Garsia showed how it could be derived from the theory of Stanley-Reisner Rings &lsqb;3&rsqb;. Now let R(X, Y) denote the ring of polynomials in the variables X &equals; &lcub;x1, x2, &hellip;, xn&rcub; and Y &equals; &lcub;y1, y2, &hellip;, yn&rcub;. The diagonal action of &sigma; &isin; Sn on polynomial P(X, Y) is defined as \sigma P(X, Y)= P({x_{\sigma_1}, x_{\sigma_2},\ldots , x_{\sigma_n}, y_{\sigma_1}, y_{\sigma_2},\ldots ,y_{\sigma_n}}). Let R&rho;(X, Y) be the subring of R(X, Y) which is invariant under the diagonal action. Let R&rho;&ast;(X, Y) denote the quotient of R&rho;(X, Y) by the ideal generated by the elementary symmetric functions in X and the elementary symmetric functions in Y. Recently, A. Garsia in &lsqb;4&rsqb; and V. Reiner in &lsqb;8&rsqb; showed that a collection of polynomials closely related to the descent monomials are a basis for R&rho;&ast;(X, Y). In this paper, the author gives elementary proofs of both theorems by constructing algorithms that show how to expand elements of R&ast;(X) and R&rho;&ast;(X, Y) in terms of their respective bases.
Regeneration with Virtual Copies for Distributed Computing Systems
Authors: Nabil R. Adam, Rajiv Tewari
Venue: IEEE Transactions on Software Engineering (1993)

The authors consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The algorithm combines the advantages of voting-based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. The algorithm extends the feasibility of regeneration to DCS on wide area networks and is able to satisfy user queries as long as there is one current partition in the system. A stochastic availability analysis of the algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms.
Practical C++
Authors: Mark A. Terribile
Venue:  (1993)

Practical C++ provides the essential pieces of C++ programming information needed by beginning-intermediate programmers to execute the most frequently used tasks and functions. Each chapter is a task-oriented module covering a group of related features or tasks full of real-world, practical examples. Practical C++ provides a complete condensed package of easily navigable reference tutorial information on C++.
Automatic recognition of tractability in inference relations
Authors: David A. McAllester
Venue: Journal of the ACM (JACM) (1993)

A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is nontrivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.
Algorithms of numeric deduction of analytical expressions
Authors: Ivan I. Shevchenko, Nikolay N. Vasiliev
Venue: ACM SIGSAM Bulletin (1993)

It is suggested to derive formulae (dependences on symbolic parameters) by means of restoration upon a set of fixed exact numeric values of the parameters. The main tool is Pade interpolation. The problem of distortion of structure of restored expressions and, to some extent, the problem of verification of results are considered. A statistical treatment of these problems is proposed. Probabilities of distortion of structure of elementary expressions are calculated. An algorithm of numeric deduction of expressions containing homogeneous terms and that of expressions depending on a few parameters are suggested.
Bridging the paper and electronic worlds: the paper user interface
Authors: Walter Johnson, Herbert Jellinek, Leigh Klotz,  Jr., Ramana Rao, Stuart K. Card
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Since its invention millenia ago, paper has served as one of our primary communications media. Its inherent physical properties make it easy to use, transport, and store, and cheap to manufacture. Despite these advantages, paper remains a second class citizen in the electronic world. In this paper, we present a new technology for bridging the paper and the electronic worlds. In this new technology, the user interface moves beyond the workstation and onto paper itself. We describe paper user interface technology and its implementation in a particular system called XAX.
Reliability, Reconfiguration, and Spare Allocation Issues in Binary-Tree Architectures Based on Multiple-Level Redundancy
Authors: Yung-Yuan Chen, Shambhu J. Upadhyaya
Venue: IEEE Transactions on Computers (1993)

The locally redundant modular tree (LRMT) schemes offer high yield and reliability for trees of relatively few levels but are less effective for large binary trees due to the imbalance of reliability of different levels. A new multiple-level redundancy tree (MLRT) architecture that combines modular schemes with level-oriented schemes which lead to better yield and reliability is presented. The MLRT structure enhances the wafer yield to significant levels by offering separate layers of protection for random and clustered defects. Unlike most existing techniques, this technique performs a more accurate reliability analysis by taking into account both switch and link failures. A measure called the marginal switch to processing element area ratio (MSR) is introduced to precisely characterize the effect of switch complexity on the reliability of the redundant system. A systematic method for the optimal distribution of spare modules of the MLRT structure is also presented. The analyses show that the MLRT structure offers higher yield and system reliability than LRMT and subtree-oriented fault-tolerance (SOFT) structures do.
Mining association rules between sets of items in large databases
Authors: Rakesh Agrawal, Tomasz Imieliński, Arun Swami
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.
A quality of service architecture
Authors: Andrew Campbell, Geoff Coulson, David Hutchison
Venue: ACM SIGCOMM Computer Communication Review (1994)

For applications relying on the transfer of multimedia, and in particular continuous media, it is essential that quality of service (QoS) is guaranteed system-wide, including end-systems, communications systems and networks. Although researchers have addressed many isolated areas of QoS provision, little attention has so far been paid to the definition of an integrated and coherent framework that incorporates QoS interfaces, management and mechanisms across all architectural layers. To address this deficiency, we are developing a Quality of Service Architecture (QoS-A) which offers a framework to specify and implement the required performance properties of multimedia applications over high-performance ATM-based networks. The QoS-A incorporates the notions of flow, service contract and flow management. Flows characterise the production, transmission and eventual consumption of single media streams, service contracts are binding agreements between users and providers and flow management provides for the monitoring and maintenance of the contracted QoS levels. This paper provides an overview of the QoS-A and focuses particularly on the role of the transport service and protocol in the architecture. We describe a multimedia enhanced transport service (METS), flow management and transport layer service contract. We show how QoS levels contracted at the transport service interface can be assured in the context of our local ATM environment.