ppxscal/embedding_network huggingface dataset:
Region-based retrieval of biomedical images
Authors: James Z. Wang
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

Searching digital biomedical images is a challenges problem. Prevalent retrieval techniques involve human-supplied text annotations to describe image contents. Biomedical images, such as pathology slides, usually have higher resolution than general-purpose pictures, making it additionally difficut to index. Precise object segmentation is also extremely difficult and is still an open problem. We are developing a multiresolution region-based retreival system for high-resolution biomedical image databases. The system, based on wavelets, the IRM (Integrated Region Matching) distance, and image classification, is highly robust to inacurate image segmentation and various visual alterations. Tested on a database of more than 70,000 pathology image fragments, the system has demonstrated high accuracy and fast speed.
Automatic error bounds on real zeros of rational functions
Authors: Robert H. Dargel, Frank R. Loscalzo, Thomas H. Witt
Venue: Communications of the ACM (1966)

A procedure for implementing an interval arithmetic version of the Newton-Raphson method is proposed. The procedure requires only a starting interval over which the zeros of a given rational function are to be located. The method automatically provides bounds for roundoff error.
Some new upper bounds on the generation of prime numbers
Authors: Harry G. Mairson
Venue: Communications of the ACM (1977)

Given an integer N, what is the computational complexity of finding all the primes less than N? A modified sieve of Eratosthenes using doubly linked lists yields an algorithm of OA(N) arithmetic complexity. This upper bound is shown to be equivalent to the theoretical lower bound for sieve methods without preprocessing. Use of preprocessing techniques involving space-time and additive-multiplicative tradeoffs reduces this upper bound to OA(N/log logN) and the bit complexity to OB(N logN log log logN). A storage requirement is described using OB(N logN/log logN) bits as well.
Automatic data compression
Authors: B. A. Marron, P. A. D. de Maine
Venue: Communications of the ACM (1967)

The &ldquo;information explosion&rdquo; noted in recent years makes it essential that storage requirements for all information be kept to a minimum. A fully automatic and rapid three-part compressor which can be used with &ldquo;any&rdquo; body of information to greatly reduce slow external storage requirements and to increase the rate of information transmission through a computer is described in this paper. The system will also automatically decode the compressed information on an item-by-item basis when it is required. The three component compressors, which can be used separately to accomplish their specific tasks, are discussed: NUPAK for the automatic compression of numerical data, ANPAK for the automatic compression of &ldquo;any&rdquo; information, and IOPAK for further compression of information to be stored on tape or cards.
String operations in query languages
Authors: Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

We study relational calculi with support for string operations. While SQL restricts the ability to mix string pattern-matching and relational operations, prior proposals for embedding SQL in a compositional calculus were based on adding the operation of concatenation to first-order logic. These latter proposals yield compositional query languages extending SQL, but are unfortunately computationally complete. The unbounded expressive power in turn implies strong limits on the ability to perform optimization and static analysis of properties such as query safety in these languages. In contrast, we look at compositional extensions of relational calculus that have nice expressiveness, decidability, and safety properties, while capturing string-matching queries used in SQL. We start with an extension based on the string ordering and LIKE predicates. This extension shares some of the attractive properties of relational calculus (e.g. effective syntax for safe queries, low data complexity), but lacks the full power of regular-expression pattern-matching. When we extend this basic model to include string length comparison, we get a natural string language with great expressiveness, but one which includes queries with high (albeit bounded) data complexity. We thus explore the space between these two languages. We consider two intermediate languages: the first extends our base language with functions that trim/add leading characters, and the other extends it by adding the full power of regular-expression pattern-matching. We show that both these extensions inherit many of the attractive properties of the basic model: they both have corresponding algebras expressing safe queries, and low complexity of query evaluation.
Using page residency to select the working set parameter
Authors: Barton G. Prieve
Venue: Communications of the ACM (1973)

Denning's method for selecting the working set parameter, which uses interreference intervals, is examined. Several omissions in his model are noted, and new assumptions are introduced to overcome these omissions. Using this modified model, Denning's results on page residency are rederived and reconsidered for selecting the working set parameter.
Profile-guided optimization across process boundaries
Authors: Erik Johansson, Sven-Olof Nyström
Venue: ACM SIGPLAN Notices (2000)

We describe a profile-driven compiler optimization technique for inter-process optimization, which dynamically inlines the effects of sending messages. Profiling is used to find optimization opportunities, and to dynamically trigger recompilation and optimization at run-time. We apply the optimization technique on the concurrent programming language ERLANG, letting recompilation take place in a separate ERLANG process, and taking advantage of the facilities provided by ERLANG to dynamically replace code at run-time. We have implemented a prototype inter-process profiler and optimizer, that can handle small programs. Measurements on synthetic benchmarks show encouraging speedups of up to 1.8 times.
Exploring Reflection: Designing Light Reflectors for Uniform Illumination
Authors: Gary W. De Young
Venue: SIAM Review (2000)

Many students first learn of the law of reflection when they are told about the reflective properties of conics. Typically students are exposed to a curve or surface, and then its reflective properties are derived or verified. In this paper we explore reflection by starting from a desired property of an unknown reflector and proceeding to find a reflector with those properties. This is done in the context of finding a reflector that produces uniform illumination of nearby objects. The reflectors considered are those whose analysis can be reduced to studying curves in two dimensions.
A short method for measuring error in a least-squares power series
Authors: S. M. Robinson, G. W. Struble
Venue: Communications of the ACM (1960)

When fitting a curve to a set of points by means of a least-squares powers series, it is frequently desirable to obtain also a measure of the total error of the curve. Such error is most often measured by the size of the residual sum of squares and, while it is not infrequent for computer programs to provide this error sum along with the coefficients of the power series, in every case we have so far found this sum has been obtained by evaluating the series at every data point. This procedure requires that either the data be read through the machine a second time after the determination of the coefficients or that every data point be stored in the memory of the computer.
Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Authors: Horst D. Simon, Hongyuan Zha
Venue: SIAM Journal on Scientific Computing (1999)

Low-rank approximation of large and/or sparse matrices is important in many applications, and the singular value decomposition (SVD) gives the best low-rank approximations with respect to unitarily-invariant norms. In this paper we show that good low-rank approximations can be directly obtained from the Lanczos bidiagonalization process applied to the given matrix without computing any SVD. We also demonstrate that a so-called one-sided reorthogonalization process can be used to maintain an adequate level of orthogonality among the Lanczos vectors and produce accurate low-rank approximations. This technique reduces the computational cost of the Lanczos bidiagonalization process. We illustrate the efficiency and applicability of our algorithm using numerical examples from several applications areas.
On a parallel Lehmer-Euclid GCD algorithm
Authors: Sidi Mohammed Sedjelmaci
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

A new version of Euclid's GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms since it can be achieved in &Ogr;&isin;(n/log n) time using at most n1+&isin; processors on CRCW PRAM.
Using Python to Query MySQL over the Net
Authors: Mihai Bisca
Venue: Linux Journal (2001)

Use Python to upgrade your site's search.
Embedded Checker Architectures for Cyclic and Low-Cost Arithmetic Codes
Authors: Albrecht P. Stroele, Steffen Tarnick
Venue: Journal of Electronic Testing: Theory and Applications (2000)

Code checkers that monitor the outputs of a system can detect both permanent and transient faults. We present two novel architectures of embedded self-testing checkers for low-cost and cyclic arithmetic codes, one based on code word generators and adders, the other based on code word accumulators. In these schemes, the code checker receives all possible code words but one, irrespective of the number of different code words that are produced by the circuit under check (CUC). So any code checker can be employed that is self-testing for all or a particular subset of code words, and the structure of the code checker need not be tailored to the set of code words produced by the CUC. The proposed code word generators and accumulators are built from simple standard hardware structures, counters and end-around-carry adders. They can also be utilized in an off-line BIST environment as pattern generators and test response compactors.
Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
Authors: M. Anwarul Hasan
Venue: IEEE Transactions on Computers (2000)

Many cryptographic systems use multiplication in the finite field GF($2^n$) for their underlying computations. In the recent past, a number of look-up table-based algorithms have been proposed for the software implementation of GF($2^n$) multiplication. Look-up table-based algorithms can provide speed advantages, but they either require a large memory space or do not fully utilize the resources of the processor on which the software is executed. In this work, an algorithm for GF($2^n$) multiplication is proposed which can alleviate this problem. In each iteration of the proposed algorithm, a group of bits of one of the input operands are examined and two look-up tables are accessed. The group size determines the table sizes, but does not affect the utilization of the processor resources. It can be used for both software and hardware realizations and is particularly suitable for implementations in memory constrained environment, such as smart cards and embedded cryptosystems.
Distributed rendering for scalable displays
Authors: Greg Humphreys, Ian Buck, Matthew Eldridge, Pat Hanrahan
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We describe a novel distributed graphics system that allows an application to render to a large tiled display. Our system, called WireGL, uses a cluster of off-the-shelf PCs connected with a high-speed network. WireGL allows an unmodified existing application to achieve scalable output resolution on such a display. This paper presents an efficient sorting algorithm which minimizes the network traffic for a scalable display. We will demonstrate that for most applications, our system provides scalable output resolution with minimal performance impact.
A tool to evaluate universal Web accessibility
Authors: Leonard R. Kasday
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

The Web Accessibility Visual Evaluator (WAVE) is a tool that, in addition to performing automated checks, helps users perform the human judgments essential for evaluating if a web page is universally accessible to people with and without disabilities. For example, the WAVE (a) inserts the information accessed by people who are blind (e.g. alternative text, structural markup, reading order) into the representation seen by people who are sighted; (b) flags audio content requiring equivalents for people who are deaf; and (c) flags objects requiring continuous motor control that require equivalent discrete access for people with motor disabilities; thus helping the user evaluate whether access by people with and without disabilities is functionally equivalent.
Explorative multilingual text retrieval based on fuzzy multilingual keyword classification
Authors: Rowena Chau, Chung-Hsing Yeh
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

This paper proposes an explorative approach to multilingual text retrieval (MLTR) based on fuzzy multilingual keyword classification. The approach applies fuzzy clustering to obtain a classification of multilingual keywords by concepts. A multilingual concept directory is developed by labeling each concept with native language of the target user and associating it with relevant multilingual documents. The directory works as a searching interface for document browsing. This explorative approach is particularly suitable for casual users to search with Asian languages by avoiding the trouble of query formulation and input in MLTR. For the general application of MLTR, an explorative interface is also advisable when the user has only a vague idea of the domain to be searched.
Universal strong encryption FPGA core implementation
Authors: D. Runje, M. Kovac
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

IDEA is a symmetric block cipher with a 128-bit key proposed to replace DES where a strong encryption is required. Many applications need speed of a hardware encryption implementation while trying to preserve flexibility and low cost of a software implementation. In this paper we have presented one solution of this problem. Our system architecture uses single core module named Round to implement IDEA algorithm. Using the core we were able to implement and test example application in only three days. This "of the shelf" solution for designing cryptographic application using IDEA algorithm significantly reduced design cycle, thus greatly reducing time-to-market and cost of such designs. By increasing the number of the round modules system designer can linearly increase speed of the design. This system design methodology makes it possible to achieve necessary performance, or to preserve area (and reduce costs) when needed unlike other known approaches. We have implemented one round UNICORN architecture in Xilinx FPGA. After implementation the chip has been tested using the standard test vectors and it was capable of performing 2.8Mbps encryption in both ECB and CBC mode.
A reprogramming machine
Authors: William H. Burge
Venue: Communications of the ACM (1966)

In this paper a description is given of a model programming system which is directed by a programming language and has a library for storing the user's items. Rules are given for transforming programs written in the language and for rearranging the items in the library so that they share their common parts. Some speculations are made about how the mechanical detection of common parts or patterns of library items could help a user to solve his problems, and about the relationships between the behavior of the reprogramming machine and human intelligent behavior.
Supporting large-scale distributed simulation using HLA
Authors: Tainchi Lu, Chungnan Lee, Wenyang Hsia, Mingtang Lin
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

This article describes the design of a Web-based environment to support large-scale distributed simulation using Java and IEEE standard P1516 high level architecture (HLA) framework and rules. Based on the run-time infrastructure (RTI) services within the HLA and Java application programmer's interfaces (APIs) of the RTI, the proposed HLA-based environment provides an architectural foundation to enhance interactivity, portability, and interoperability for Web-based simulations. In addition, the proposed architectural design not only provides a client/server mechanism for simulation on the Web, but also supports a distributed federation execution over the network. A 3-level control mechanism (3LCM) was implemented to HLA-based middleware federateServer, in order to adaptively maintain information consistency and minimize message traffic for distributing information among client hosts and the federateServers. A dynamic filtering strategy (DFS), associated with the data distribution management (DDM) in the HLA RTI, is proposed to minimize false positive updates and enhance the filtering efficiency of subscription regions within an HLA federation. To verify the feasibility of this prototype, a distributed discrete event simulation application in Java was developed and performance of the proposed modeling design and Java RMI's distributed object model presented. From the experimental results, we show that the proposed environment based on HLA using 3LCM and DFS is workable and practical for supporting a large-scale distributed simulation.
An efficient analytical model of coupled on-chip RLC interconnects
Authors: Liang Yin, Lei He
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we present a new decoupled model for two coupled transmission lines with consideration of the inductive effect. It maps two coupled lines into two completely isolated lines with separated drivers and receivers, and has no loss of accuracy during the decoupling procedure. Further, we derive a closed-form time domain response for an isolated transmission line using a one-segment RLC II model. Combining the two models, we have an analytical time-domain solution to two coupled transmission lines. The model gives satisfied results for up to 5000 um-long lines when compared to SPICE simulation over an accurate distributed RLC circuit model, and can be used to model on-chip wires in the layout design, logic synthesis and high level design.
Database techniques for archival of solid models
Authors: David McWherter, Mitchell Peabody, Ali C. Shokoufandeh, William Regli
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper presents techniques for managing solid models in modern relational database management systems. Our goal is to enable support for traditional database operations (sorting, distance metrics, range queries, nearest neighbors, etc) on large databases of solid models. As part of this research, we have developed a number of novel storage and retrieval strategies that extend the state-of-the-art in database research as well as change the way in which solid modeling software developers and design and manufacturing enterprises view CAD-centric data management problems. Past research and current commercial systems for engineering information management and Product Data Management (PDM) have predominantly taken annotation and document-based approaches&mdash;where the solid modeling data itself is simply stored as a related file to other project documents. Research in CAD and engineering databases has produced great advances, such as representation schemas for STEP-based data elements, however existing technologies stop short of enabling content-based and semantic retrieval of solid modeling data of the types now available for other higher-dimensional media (images, audio and video). Our approach encodes solid model BRep information as a Model Signature Graph. We demonstrate how Model Signature Graphs can be used for topological similarity assessment of solid models and enable clustering for data mining of a large design repositories. We believe this work will begin to bridge the solid modeling and database communities, enabling new paradigms for interrogation of CAD datasets.
KSim: a stable and efficient RKC simulator for capturing on-chip inductance effect
Authors: Hao Ji, Anirudh Devgan, Wayne Dai
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

On-chip inductance extraction is difficult due to the global effect of inductance, and simulating the resulting dense partial inductance matrix is even more difficult. Furthermore, it is well known that simply discarding smallest terms to sparsify the inductance matrix can render the partial inductance matrix indefinite and result in an unstable circuit model. Recently a new circuit element, K , has been introduced to capture global effect of inductance by evaluating a corresponding sparse K matrix [1]. However, the reason that K has such local properties is not clear, and the positive semi-definiteness of the corresponding sparse K matrix is not proved. In this paper, we present the physical interpretation of K. Based on the physical interpretation, we explain why the faraway mutual K can be ignored (locality) and prove that after ignoring faraway mutual K ,the resultant K matrix is positive definite (stability). Together with a RKC equivalent circuit model, the locality and stability enables us to simulate RKC circuit directly and efficiently for real circuits. A new circuit simulation tool, KSim, has been developed by incorporating the new circuit element K into Berkeley SPICE. The RKC simulation matches better with the full partial inductance matrix simulation with significant less computing time and memory usage, compared to other proposed methods, such as shift-truncate method [2, 3].
A formal system for information retrieval from files
Authors: David Hsiao, Frank Harary
Venue: Communications of the ACM (1970)

A generalized file structure is provided by which the concepts of keyword, index, record, file, directory, file structure, directory decoding, and record retrieval are defined and from which some of the frequently used file structures such as inverted files, index-sequential files, and multilist files are derived. Two algorithms which retrieve records from the generalized file structure are presented.
Review of traffic scheduler features on general purpose platforms
Authors: Eduardo Magaña, Edurne Izkue, Jesús Villadangos
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

In this study, we review the features of a traffic scheduler running on a general-purpose platform, specfically a PC with a Linux operating system. The traffic scheduler was configured to manage a CBQ (Class Based Queueing) queue discipline, and by means of a series of experiments, we proved that the limitations of the system are due to the accuracy of the clock. After we modified this factor, we reviewed the features of the scheduler again. We were able to prove that the features of the scheduler improve greatly at the expence of a very small increase (around 10%) in the use of the systems's CPU.
Design, development, integration: space shuttle primary flight software system
Authors: William A. Madden, Kyle Y. Rone
Venue: Communications of the ACM (1984)

The development of Space Shuttle software posed unique requirements above and beyond raw size (30 times larger than Saturn V software), complexity, and criticality.
Automatic dimensioning
Authors: Melvin Klerer, Jack May
Venue: Communications of the ACM (1967)

Examples of algorithms that will accomplish automatic storage reservation without the need for explicit array declarations are described.