ppxscal/embedding_network huggingface dataset:
Distributed Processing of Similarity Queries
Authors: Apostolos N. Papadopoulos, Yannis Manolopoulos
Venue: Distributed and Parallel Databases (2001)

Many modern applications in diverse fields demand the efficient manipulation of very large multidimensional datasets. It is evident, that efficient and effective query processing techniques need to be developed, in order to provide acceptable response times in query processing. In this paper, we study the processing of similarity nearest neighbor queries in large distributed multidimensional databases, where objects are represented as vectors in a vector space, and are distributed in a multi-computer environment. The departure from the centralized case embodies a number of advantages and (unfortunately) a number of difficulties that need to be successfully overcome. In this perspective, four query evaluation strategies are presented, namely Concurrent Processing (CP), Selective Processing (SP), Two-Phase Processing (2PP) and Probabilistic Processing (PRP). The proposed techniques are compared analytically and experimentally, in order to discover the advantages of each one, as well as the best cases where each one should be applied. Experimental results are presented, demonstrating the performance of each method under different parameters values. Also, we investigate the impact of derived data that should be maintained in order to process similarity queries efficiently.
Hardware/software co-design of a fuzzy RISC processor
Authors: V. Salapura, M. Gschwind
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper, we show how hardware/software co-evaluation can be applied to instruction set definition. As a case study, we show the definition and evaluation of instruction set extensions for fuzzy processing. These instructions are based on the use of subword parallelism to fully exploit the processor's resources by processing multiple data streams in parallel. The proposed instructions are evaluated in software and hardware to gain a balanced view of the costs and benefits of each instruction. We have found that a simple instruction optimized to perform fuzzy rule evaluation offers the most benefit to improve fuzzy processing performance. The instruction set extensions are added to a RISC processor core based on the MIPS instruction set architecture. The core has been described in VHDL so that hardware implementations can be generated using logic synthesis.
A storage allocation and reference structure
Authors: D. R. Fitzwater
Venue: Communications of the ACM (1964)

A method is proposed and discussed which allows a subscripted-variable capability (in the FORTRAN sense) to be added to AUTOCODER-Type assembly systems.
Analysis of the Effects of Software Reuse on Customer Satisfaction in an RPG Environment
Authors: Giancarlo Succi, Luigi Benedicenti, Tullio Vernazza
Venue: IEEE Transactions on Software Engineering (2001)

This paper reports on an empirical research based on two software products. The research goal is to ascertain the impact of the adoption of a reuse policy on customer satisfaction. The results show that when a systematic reuse policy is implemented, such as the adoption of a domain specific library, 1) reuse is significantly positively correlated with customer satisfaction and 2) there is a significant increase in customer satisfaction. The results have been extended to the underlying populations, supposed normal.
Uniqueness of Some Resolution IV Two-Level Regular Fractional Factorial Designs
Authors: Hegang Chen, Ching-Shui Cheng
Venue: SIAM Journal on Discrete Mathematics (2000)

It is well known that if there exists a resolution IV $2^{n - m}$ design, then $n \leq 2^{n - m - 1}$. A resolution IV $2^{n - m}$ design with $n = 2^{n - m - 1}$ is known to be unique in the sense that all such designs can be obtained from one another by relabeling the factors. By using a projective geometric approach, we show that resolution IV $2^{n - m}$ designs with $n = 2^{n - m - 1} - 1$ and $n = 2^{n - m - 1} - 2$ are also unique.
The MAD definition facility
Authors: Bruce W. Arden, Bernard A. Galler, Robert M. Graham
Venue: Communications of the ACM (1969)

One of the first definition facilities for higher level languages is described. Users of the language can define new operators and/or data types into the MAD language, so that their use appears as if they were predefined. Information is given on how one writes definitions, as well as on much of the motivation behind the form in which definitions are written. Some conclusions are drawn about future definitional facilities.
A technique for testing command and control software
Authors: Marvin L. Watkins
Venue: Communications of the ACM (1982)

A technique for testing embedded-microprocessor command and control programs is described. The continuity inherent in functions computed by programs which monitor natural phenomena is exploited by a simple difference equation-based algorithm to predict a program's next output from its preceding ones. The predicted output is compared with the actual output while indexing through the program's domain. Outputs which cannot be predicted are flagged as potential errors. Data are presented which show that this technique can be a sensitive measure of a program's correctness.
From RS-232 to object request brokers: incremental object-oriented networking projects
Authors: David Janzen
Venue: ACM SIGCSE Bulletin (2001)

Selecting an appropriate set of laboratory experiences and projects for a Data Communications and Computer Networks course can be difficult due to the broad and deep nature of the topics. Emphasis may be placed on many networking aspects including design, evaluation, efficiency, security, protocols, tools, and applications. This paper presents a set of projects that attempt to integrate software engineering and systems administration topics. The projects emphasize network application programming. Particular attention will be given to a sequence of incremental projects using an object-oriented approach including the use of the Unified Modeling Language (UML) and a design pattern.
Capacitance to Frequency Converter Suitable for Sensor Applications Using Telemetry
Authors: S. Chatzandroulis, D. Tsoukalas
Venue: Analog Integrated Circuits and Signal Processing (2001)

Inductively powered telemetric systems are beginning to gain interest in all fields where remote sensing is needed. In such systems power consumption, miniaturization and packaging pose the greatest design problems [1]. In this paper we present a capacitance to frequency converter suitable for working with an already presented telemetric system [2]. The system uses passive telemetry to transfer power to the transponder and pressure data to a remote base unit. Such telemetric systems are becoming ever more important in the biomedical field as the interest for in vivo measurements of different biological parameters both of humans and animals is increasing.
Performance of a cooperative algorithm for power control in cellular systems with a time-varying link gain matrix
Authors: Chi Wan Sung, Wing Shing Wong
Venue: Wireless Networks (2000)

A new version of the Cooperative Algorithm is proposed for distributed power control in time&dash;varying cellular environment. Unlike other approaches which assume a fixed link gain matrix, we consider a time&dash;varying model for shadow fading. We consider the performance of three schemes, namely, instantaneous SIR balancing, slow path loss compensation and the Cooperative Algorithm. Analytical results are obtained for the case where there are two cochannel users. We have shown that the sequence of signal&dash;to&dash;interference ratio &lpar;SIR&rpar; converges in distribution. The outage probability in steady state is obtained. It is shown that when the power control sampling period is small, the performance of the Cooperative Algorithm approaches that of instantaneous SIR balancing. For more than two users, a detailed simulation is performed.
A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
Authors: Edmond Chow
Venue: SIAM Journal on Scientific Computing (1999)

Parallel algorithms for computing sparse approximations to the inverse of a sparse matrix either use a prescribed sparsity pattern for the approximate inverse or attempt to generate a good pattern as part of the algorithm. This paper demonstrates that, for PDE problems, the patterns of powers of sparsified matrices (PSMs) can be used a priori as effective approximate inverse patterns, and that the additional effort of adaptive sparsity pattern calculations may not be required. PSM patterns are related to various other approximate inverse sparsity patterns through matrix graph theory and heuristics concerning the PDE's Green's function. A parallel implementation shows that PSM-patterned approximate inverses are significantly faster to construct than approximate inverses constructed adaptively, while often giving preconditioners of comparable quality.
Backtrack programming techniques
Authors: James R. Bitner, Edward M. Reingold
Venue: Communications of the ACM (1975)

The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.
Java virtual machine support for object serialization
Authors: Fabian Breg, Constantine D. Polychronopoulos
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

Distributed computing has become increasingly popular in the high performance community. Java's Remote Method Invocation (RMI) provides a simple, yet powerful method for implementing parallel algorithms. The performance of RMI has been less than adequate, however, and object serialization is often identified as a major performance inhibitor. We believe that object serialization is best performed in the Java Virtual Machine (JVM), where information regarding object layout and hardware communication resources are readily available. We implement a subset of Java's object serialization protocol in native code, using the Java Native Interface (JNI) and JVM internals. Experiments show that our approach is up to eight times faster than Java's original object serialization protocol for array objects. Also for linked data structures, our approach obtains a moderate speedup and better scalability. Evaluation of our object serialization implementation in an RMI framework indicates that a higher throughput can be obtained. Parallel applications, written using RMI, obtain better speedups and scalability when this more efficient object serialization is used.
A simple technique for coding differential equations
Authors: P. Sefton, R. Vaillancourt
Venue: Communications of the ACM (1960)

A computer program that will solve an arbitrary system of first-order differential equations according to some conventional numerical method may be considered to have two distinct parts. The main program performs all of the operations of input-output, initialization, choice of step-size, and actual solution of the equations. This part of the program is independent of the functional equations relating the derivatives to the variables. A subsidiary program evaluates the derivatives according to the given functional relationships, and this subprogram or subroutine has to be written for each new system of equations [1].
AGENDA: an attribute grammar driven enviornment for the design automation of digital systems
Authors: G. Economakos, G. Papakonstantinou, P. Tsanakas
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Attribute grammars have been used extensively in every phase of traditional compiler construction. Recently, it has been shown that they can also be effectively adopted to handle scheduling algorithms in high-level synthesis. Their main advantages are modularity and declarative notation in the development of design automation environments. In this paper, past results are further elaborated and more scheduling techniques are presented and implemented in a flexible environment for the design automation of digital systems. This novel approach can be proven valuable for fast evaluation of new algorithms and techniques in the field.
A procedure for inverting large symmetric matrices
Authors: William R. Busing, Henri A. Levy
Venue: Communications of the ACM (1962)

In the least squares method for simultaneous adjustment of several parameters, the coefficients of the normal equations are the elements of a symmetric positive-definite matrix. In order to solve the normal equations and evaluate the precision measures of the resulting parameters, inversion of this matrix of coefficients is required. Many available procedures for matrix inversion do not take advantage of the symmetry. Thus, when programmed for a high-speed computer, all n2 elements must be stored and manipulated, whereas only n(n + 1)/2 of them are independent. In order to allow a computer of given memory capacity to handle a large matrix, the following procedure for inverting a symmetric matrix has been devised.1
Ten Mini-Languages: A Study of Topical Issues in Programming Languages
Authors: Henry F. Ledgard
Venue: ACM Computing Surveys (CSUR) (1971)

The proliferation of programming languages has raised many issues of language design, definition, and implementation. This paper presents a series of ten mini-languages, each of which exposes salient features found in existing programming languages. The value of the mini-languages lies in their brevity of description and the isolation of important linguistic features: in particular, the notions of assignment, transfer of control, functions, parameter passing, type checking, data structures, string manipulation, and input/output. The mini-languages may serve a variety of uses: notably, as a pedagogical tool for teaching programming languages, as a subject of study for the design of programming languages, and as a set of test cases for methods of language implementation or formal definition.
Configurable Algorithms for Complete Exchange in 2D Meshes
Authors: Young-Joo Suh, Sudhakar Yalamanchili
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

The interprocessor complete exchange communication pattern can be found in many important parallel algorithms. In this paper, we present algorithms for complete exchange on 2D mesh-connected multiprocessors. The unique feature of the proposed algorithms is that they are configurable where the time for message startups can be traded against larger message sizes. At one extreme, the algorithm minimizes the number of message startups at the expense of an increased amount of time spent in message transmission. At the other extreme, the time spent in message transmission is reduced at the expense of an increased number of message startups. The structure of the algorithms is such that intermediate solutions are feasible, i.e., the number of message startups can be increased slightly and the message transmission time is correspondingly reduced. The ability to configure these algorithms enables the algorithm characteristics to be matched with machine characteristics based on specific overheads for message initiation and link speeds to minimize overall execution time. In effect, the algorithms can be configured to strike the right balance between direct and message combining approaches on a specific architecture for a given problem size. We believe these algorithms are distinguished by this ability and contribute to efficient portable implementations of complete exchange algorithms.
Maple's evaluation process as constraint contextual rewriting
Authors: Alessandro Armando, Clemens Ballarin
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

Maple's evaluator, together with a feature that is usually known as the assume facility, is a combination of modules with specialised resoaning capabilities. These modules are identified, their interfaces are specified, and their interplay is reconstructed as Constraint Contextual Rewriting (CCR), a powerful form of conditional rewriting that incorporates the services provided by a decision procedure. Finally we show how Maple's evaluation process can be strengthened by borrowing ideas from CCR.
The shape of things to come?
Authors: Richard F. Rashid
Venue: ACM SIGSOFT Software Engineering Notes (2000)

The future of software engineering isn't what it used to be. The nature of the software we write, the reasons we write it and the way we write it and maintain it have changed rapidly and dramatically over the last few years. And software development is likely change even faster over the next decade. In this talk I will reflect on how commercial software has evolved and what it might look like in the not-to-distant future.
Integrated Person Tracking Using Stereo, Color, and Pattern Detection
Authors: T. Darrell, G. Gordon, M. Harville, J. Woodfill
Venue: International Journal of Computer Vision (2000)

We present an approach to real-time person tracking in crowded and/or unknown environments using integration of multiple visual modalities. We combine stereo, color, and face detection modules into a single robust system, and show an initial application in an interactive, face-responsive display. Dense, real-time stereo processing is used to isolate users from other objects and people in the background. Skin-hue classification identifies and tracks likely body parts within the silhouette of a user. Face pattern detection discriminates and localizes the face within the identified body parts. Faces and bodies of users are tracked over several temporal scales: short-term (user stays within the field of view), medium-term (user exits/reenters within minutes), and long term (user returns after hours or days). Short-term tracking is performed using simple region position and size correspondences, while medium and long-term tracking are based on statistics of user appearance. We discuss the failure modes of each individual module, describe our integration method, and report results with the complete system in trials with thousands of users.
A computer aided engineering system for memory BIST
Authors: Chauchin Su, Shih-Ching Hsiao, Hau-Zen Zhau, Chung-Len Lee
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

An integrated memory test system is presented. It includes a reconfigurable memory test module, a test algorithm editor, a memory fault simulator, and a test code generator. For a given memory organization, fault list, and test algorithm, the system automatically reports the fault coverage, generates control assembly codes, and produces circuit net list for test pattern generation. The system has been implemented in 9000 lines of C++ program based on the Microsoft Windows graphic user interface. It has been verified on different test algorithms and memory chips.
Triangular walk pattern for the down-hill method of solving a transcendental equation
Authors: Morio Onoe
Venue: Communications of the ACM (1962)

The down-hill method by Ward is a numerical method for determining a complex root of &fnof;(z) = 0 and suitable for machine computation [1]. It is based on a theorem that W(z) = |Re(&fnof;)| + |Im(&fnof;)| (1) has minimum value, actually zero, at and only at a root of &fnof; and seeks to minimize W by non-random walk from a starting point over the complex plane.
Culture and the nuclear-test-ban treaty
Authors: Mary L. Girven
Venue: ACM SIGGROUP Bulletin (2000)

As former Webmaster for the Provisional Technical Secretariat of the Preparatory Commission for the Comprehensive Nuclear-Test-Ban Treaty Organization (CTBTO PrepCom/PTS) in Vienna, Austria, and more recently, as implementer of an on-line scientific meetings database tool for the international organization and co-author of a paper[ ] describing why the database was created as well as how people can use it, I have been in a position to observe and can describe some of the difficulties involved in designing tools for an international/intercultural group. Most of what follows was gleaned from the paper Jerzy Knapik[ ] and I wrote as well as from work that I did supporting CTBTO both as a Sandian[ ] and as a staff member of the PTS.The Comprehensive Nuclear-Test-Ban Treaty (CTBT) was opened for signature on September 24, 1996 at United Nations Headquarters in New York. President Clinton was the first to sign it. Ratification of the Treaty has recently been the subject of heated debates in the U.S. Senate. As of October 5, 1999, the CTBT has been signed by 154 countries and ratified by 51 countries[ ]. The international organization supporting the implementation of this Treaty began operations in March of 1997 in Vienna. I was the organization's first Webmaster from November 1997 until February 1999, and have been supporting it as a Sandian both beforehand and since returning to Sandia National Laboratories (SNL) by working as Webmaster on the U.S. Department of Energy's Nuclear Explosion Monitoring Research and Engineering program's web site.The three main tasks of the international organization revolve around verifying that all countries are abiding by the terms of the Treaty. This includes development and maintenance of the International Monitoring System (IMS), which will gather data from 321 monitoring stations and 16 laboratories working in some 90 countries around the world; the International Data Centre (IDC) which will analyze data received from the IMS and make the raw data and its results available to all States parties; as well as preliminary work for conducting On-Site Inspections (OSI), which can be requested by any State party if a suspicious occurrence cannot be resolved through consultation and clarification.The Treaty calls for countries to promote cooperation among themselves (Paragraph 12 of Article IV of the Comprehensive Nuclear-Test-Ban Treaty):"The States Parties undertake to promote cooperation among themselves to facilitate and participate in the fullest possible exchange relating to technologies used in the verification of this Treaty in order to enable all States Parties to strengthen their national implementation of verification measures and to benefit from the application of such technologies for peaceful purposes."[ ]The role of the International Cooperation Section of the CTBTO PrepCom/PTS is to help countries fulfill this mission. This is not necessarily an easy task because countries have different needs, requirements and national priorities as well as different levels of economic and technological development.
Ancient Babylonian algorithms
Authors: Donald E. Knuth
Venue: Communications of the ACM (1972)

The early origins of mathematics are discussed, emphasizing those aspects which seem to be of greatest interest from the standpoint of computer science. A number of old Babylonian tablets, many of which have never before been translated into English, are quoted.
Manned simulation research in complex control systems
Authors: M. A. Geisler, W. A. Steger
Venue: Communications of the ACM (1961)

Two purposes guide the studies currently in progress in the RAND Logistics Systems Laboratory: one is to aid the Air Force in a substantive management or control problem, such as operations-support control of the ICBM force, or control and allocation of resources to perform the short-term job of procuring, repairing and distributing the Air Force's supply assets; and the second is to improve the RAND use of abstract (primarily, manned computer-assisted) simulations in designing and evaluating alternative, complex control systems.
A first problem for the algorithms course (poster session)
Authors: J. Á. Velázquez-Iturbide
Venue: ACM SIGCSE Bulletin (2001)

I present a problem to be used in the first class of the algorithms course as an introduction to the topic. Two algorithms are given, simple but rich enough to illustrate several issues.