ppxscal/embedding_network huggingface dataset:
Web page classification based on k-nearest neighbor approach
Authors: Oh-Woog Kwon, Jong-Hyeok Lee
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Automatic categorization is the only viable method to deal with the scaling problem of the World Wide Web. In this paper, we propose a Web page classifier based on an adaptation of k-Nearest Neighbor (k-NN) approach. To improve the performance of k-NN approach, we supplement k-NN approach with a feature selection method and a term-weighting scheme using markup tags, and reform document-document similarity measure used in vector space model. In our experiments on a Korean commercial Web directory, our proposed methods in k-NN approach for Web page classification improved the performance of classification.
Meta-scoring: automatically evaluating term weighting schemes in IR without precision-recall
Authors: Rong Jin, Christos Falusos, Alex G. Hauptmann
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper, we present a method that can automatically evaluate performance of different term weighting schemes in information retrieval without resorting to precision-recall based on human relevance judgments. Specifically, the problem is: given two document-term matrixes generated from two different term weighting schemes, can we tell which term weighting scheme will performance better than the other? We propose a meta-scoring function, which takes as input the document-term matrix generated by some term weighting scheme and computes a goodness score from the document-term matrix. In our experiments, we found out that this score is highly correlated with the precision-recall measurement for all the collections and term weighting schema we tried. Thus, we conclude that our meta-scoring function can be a substitute for the precision-recall measurement that needs relevance judgments of human subject. Furthermore, this meta-scoring function is not limited only to text information retrieval can be applied to fields such as image and DNA retrieval.
Building large scale mosiacs from Landsat data
Authors: Lucian Plesea, Joseph Jacob
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper describes the process and tools used for creating a full resolution seamless Landsat mosaic of the continental U.S. at 30 meters per pixel. The 6-band, 150GB image was built from 428 individual Landsat scenes of the Multi-Resolution Land Characteristics (MRLC) dataset. Custom designed software based on SGI ImageVision framework was developed on JPL supercomputers to accomplish this task as a single step operation, with minimal operator input. Novel techniques were used to deal with data storage and access issues. Various color matching algorithms can be used to generate a parameter set, which in turn controls all the details of building the mosaic. Some of the tested algorithms and their results will also be discussed.
A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries
Authors: Ming-Bo Lin
Venue: Journal of VLSI Signal Processing Systems (2000)

In this paper, a parallel dictionary based LZW algorithm called PDLZW algorithm and its hardware architecture for compression and decompression processors are proposed. In this architecture, instead of using a unique fixed-word-width dictionary a hierarchical variable-word-width dictionary set containing several dictionaries of small address space and increasing word widths is used for both compression and decompression algorithms. The results show that the new architecture not only can be easily implemented in VLSI technology because of its high regularity but also has faster compression and decompression rate since it no longer needs to search the dictionary recursively as the conventional implementations do.
Lattice approximation and linear discrepency of totally unimodular matrices
Authors: Benjamin Doerr
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

This paper shows that the lattice approximation problem for totally unimodular matrices A &isin; Rm&times;n can be solved efficiently and optimally via a linear programming approach. The complexity of our algorithm is &Ogr;(log m) times the complexity of finding an extremal point of a polytope in Rn described by 2(m + n) linear constraints. We also consider the worst-case approximability. This quantity is usually called linear discrepancy lindisc(A). For any totally unimodular m &times; n matrix A we show lindisc(A) &le; min{1 - 1/n+1, 1 - 1/m}. This bound is sharp. It proves Spencer's conjecture lindisc(A) &le; (1 - 1/n+1) herdisc(A) for totally unimodular matrices. This seems to be the first time that linear programming is successfully used for a discrepancy problem.
An algorithmic approach to the conversion of decision grid charts into compressed decision tables
Authors: Rik Maes
Venue: Communications of the ACM (1980)

The decision grid chart is investigated as an intermediate form in constructing decision tables; a very natural extension to the basic format is proposed. Five alternative procedures for the conversion of decision grid charts into compressed decision tables are given. All but one avoid the storage of the fully expanded decision table in memory.
Chebyshev interpolation and quadrature formulas of very high degree
Authors: Herbert E. Salzer
Venue: Communications of the ACM (1969)

All the zeros x2m,i, i = 1(1)2m, of the Chebyshev polynomials T2m(x), m = 0(1)n, are found recursively just by taking n2n-1 real square roots. For interpolation or integration of &fnof;(x), given &fnof;(x2m,i), only x2m,i is needed to calculate (a) the (2m - 1)-th degree Lagrange interpolation polynomial, and (b) the definite integral over [-1, 1], either with or without the weight function (1 - x2)-1/2, the former being exact for &fnof;(x) of degree 2m+1 - 1.
Probability Density Estimation Using Adaptive Activation Function Neurons
Authors: Simone Fiori, Paolo Bucciarelli
Venue: Neural Processing Letters (2001)

In this paper we deal with the problem of approximating the probability density function of a signal by means of adaptive activation function neurons. We compare the proposed approach to the one based on a mixture of kernels and show through computer simulations that comparable results may be obtained with limited expense in computational efforts.
A Note on P-Regular Splitting of Hermitian Matrix
Authors: Zhi-Hao Cao
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this note we examine the spectral property of the iteration matrix induced by the P-regular splitting of an invertible Hermitian matrix and point out that a theorem given by Weissler (cf. Theorem A2 in [ SIAM J. Matrix Anal. Appl., 16 (1995), pp. 448--461]) is incorrect.
Remark on further generalization of ALGOL
Authors: Jan V. Garwick
Venue: Communications of the ACM (1964)

The generalized ALGOL described by Nilalus Wirth [1] is in my opinion a major step forward toward the &ldquo;next&rdquo; programming language. In this remark I intend to introduce further generalizations which will make the language still more useful.
Is data distribution necessary in OpenMP?
Authors: Dimitrios S. Nikolopoulos, Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Jesus Labarta, Eduard Ayguade;eacute;
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper investigates the performance implications of data placement in OpenMP programs running on modern ccNUMA multiprocessors. Data locality and minimization of the rate of remote memory accesses are critical for sustaining high performance on these systems. We show that due to the low remote-to-local memory access latency ratio of state-of-the-art ccNUMA architectures, reasonably balanced page placement schemes-such as round-robin or random distribution of pages-incur modest performance losses. We also show that performance leaks stemming from suboptimal page placement schemes can be remedied with a smart user-level page migration engine. The main body of the paper describes how the OpenMP runtime environment can use page migration for implementing implicit data distribution and redistribution schemes without programmer intervention. Our experimental results support the effectiveness of these mechanisms and provide a proof of concept that there is no need to introduce data distribution directives in OpenMP and warrant the portability of the programming model.
Specification of Abstract Data Types in Modula
Authors: George W. Ernst, William F. Ogden
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The programming language MODULA is extended to permit the formal specification of the structure and functional capabilities of modules. This makes true hierarchical programming possible in MODULA by allowing programmers of higher level parts of a system to ignore completely the internal structure of lower level modules and to rely entirely on the specifications of the capabilities of these modules. An example is included to illustrate this technique. We show that our specification mechanisms are sufficiently powerful to support formal verification rules for modules that have disjoint representations for abstract objects.
Evaluating the impact of memory system performance on software prefetching and locality optimizations
Authors: Abdel-Hameed A. Badawy, Aneesh Aggarwal, Donald Yeung, Chau-Wen Tseng
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Software prefetching and locality optimizations are techniques for overcoming the speed gap between processor and memory. In this paper, we evaluate the impact of memory trends on the effectiveness of software prefetching and locality optimizations for three types of applications: regular scientific codes, irregular scientific codes, and pointer-chasing codes. We find for many applications, software prefetching outperforms locality optimizations when there is sufficient memory bandwidth, but locality optimizations outperform software prefetching under bandwidth-limited conditions. The break-even point (for 1 Ghz processors) occurs at roughly 2.5 GBytes/sec on today's memory systems, and will increase on future memory systems. We also study the interactions between software prefetching and locality optimizations when applied in concert. Naively combining the techniques provides robustness to changes in memory bandwidth and latency, but does not yield additional performance gains. We propose and evaluate several algorithms to better integrate software prefetching and locality optimizations, including a modified tiling algorithm, padding for prefetching, and index prefetching.
A programming package for some general modes of arithmetic
Authors: R. A. Brooker
Venue: Communications of the ACM (1964)

An interpretive programming package is described for computation with operands which may be real, complex, single or double precision, or real multiple precision. It also performs operations on matrices formed from these elements. A simple language structure is used to describe the computation.
Dynamic segmentation and incremental editing of boundary representations in a collaborative design environment
Authors: Di Wu, Radha Sarma
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Currently boundary representations (b-reps) are a convenient means to exchange solid models between applications in a distributed design environment. There are two widely used approaches that help maintain the consistency of b-reps between applications, e.g., when a b-rep is modified in one application and needs to be updated in the other. One approach involves using a common database of b-reps where consistency is automatically guaranteed. The other approach involves using a repeated transfer of the entire b-rep using ftp-like protocols. The former results in a system that is not truly distributed and the later results in consuming large amounts of network bandwidth and unacceptable latencies. This paper seeks to alleviate the abovementioned disadvantages by introducing a scheme for the incremental exchange of b-reps (i.e., for incrementally updating a pre-edit model to be consistent with the post-edit model) between applications in a collaborative design environment. Note that this work does not focus on techniques that maintain or verify the validity of post-edit models. It is assumed that all edits performed are valid. The essential components of this paper include algorithms to (a) dynamically decompose the pre- and post-edit b-reps into volumetric regions, (b) identify and extract those regions in the post-edit model that have been modified, and (c) dynamically transmit and embed modified regions into a pre-edit b-rep at another site. The domain of objects is restricted to specialized non-manifold objects with manifold volumetric regions. The abovementioned algorithms are based on a cellular model that tracks decomposed regions in a b-rep. Non-regularized Boolean operations are used to introduce decompositions in the cellular model. The conditions for detecting changes in regions are studied. Finally, specialized extracting and embedding operations are defined on cellular models for extracting modified cells from post-edit models and embedding modified cells into the pre-edit models.
Power optimization and management in embedded systems
Authors: Massoud Pedram
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Power-efficient design requires reducing power dissipation in all parts of the design and during all stages of the design process subject to constraints on the system performance and quality of service (QoS). Power-aware high-level language compilers, dynamic power management policies, memory management schemes, bus encoding techniques, and hardware design tools are needed to meet these often-conflicting design requirements. This paper reviews techniques and tools for power-efficient embedded system design, considering the hardware platform, the application software, and the system software. Design examples from an Intel StrongARM based system are provided to illustrate the concepts and the techniques. This paper is not intended as a comprehensive review, rather as a starting point for understanding power-aware design methodologies and techniques targeted toward embedded systems.
AspectJ: the language and support tools
Authors: Erik Hilsdale, Jim Hugunin, Mik Kersten, Gregor Kiczales, Cristina Lopes, Jeffrey Palm
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Complex systems usually contain design units that are logically related to several objects in the system. Some examples include: tracing, propagation of interrupts, multi-object protocols, security enforcement etc. This crosscutting between those design units and the objects is a natural phenomenon. But, using traditional implementation techniques, the source code &mdash; i.e. the classes &mdash; becomes tangled with the implementation of the crosscutting concerns. AspectJ is an aspect-oriented extension to the Java&trade; programming language that enables the clean modularization of crosscutting concerns. Using AspectJ we can encapsulate in program modules (aspects) the implementation of those design units that would otherwise be spread across the classes. This demo illustrates what the AspectJ language can do and it shows the tools that support developing programs with this language. We present an example program, and demonstrate the edit-compile-debug cycle in an IDE that supports AspectJ.
Generating pseudorandom numbers on a two's complement machine such as the IBM 360
Authors: W. J. Hemmerle
Venue: Communications of the ACM (1969)

The familiar multiplicative congruential generator is examined in the context of the type of two's complement arithmetic used in the IBM 360 series. Different sequences of residues are considered and relationships established among them. It is shown that a sequence of positive and negative residues may be produced more simply and econimically than with the conventional approach and yet have twice the period of the latter without loss of desirable statistical properties. Another easily generated sequence involving absolute values is also shown to have twice the period but with the less attractive statistical properties. The statistical properties of these sequences are given and related to previously established criteria.
Occurrences of cycling and other phenomena arising in a class of linear programming models
Authors: Thoddi C. T. Kotiah, David I. Steinberg
Venue: Communications of the ACM (1977)

An investigation into the average queue size for a certain class of queues has resulted in the formulation of linear programming problems which are ill-conditioned in some cases. In attempting to solve these linear programming models, using IBM's MPS package, instances of cycling were encountered. Small perturbations in the input data resulted in problems which did not cycle. This fact, plus several other observed phenomena suggest that the primary reason that cycling is not known to occur more frequently is that round-off errors in the computations perturb the problem sufficiently to prevent cycling (or at least to prevent indefinite cycling). In one case maximizing and minimizing an objective function subject to the same constraint set was attempted, but MPS solved only one of these while giving an indication of infeasibility for the other.
Evolutionary Pursuit and Its Application to Face Recognition
Authors: Chengjun Liu, Harry Wechsler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

This paper introduces Evolutionary Pursuit (EP) as a novel and adaptive representation method for image encoding and classification. In analogy to projection pursuit methods, EP seeks to learn an optimal basis for the dual purpose of data compression and pattern classification. The challenge for EP is to increase the generalization ability of the learning machine as a result of seeking the trade-off between minimizing the empirical risk encountered during training and narrowing the confidence interval for reducing the guaranteed risk during future testing on unseen images. Toward that end, EP implements strategies characteristic of genetic algorithms (GAs) for searching the space of possible solutions to determine the optimal basis. EP starts by projecting the original data into a lower dimensional whitened Principal Component Analysis (PCA) space. Directed but random rotations of the basis vectors in this space are then searched by GAs where evolution is driven by a fitness function defined in terms of performance accuracy (¿empirical risk¿) and class separation (¿confidence interval¿). Accuracy indicates the extent to which learning has been successful so far, while separation gives an indication of the expected fitness on future trials. The feasibility of the new method has been successfully tested on face recognition where the large number of possible bases requires some type of greedy search algorithm. The particular face recognition task involves 1,107 FERET frontal face images corresponding to 369 subjects. To assess both accuracy and generalization capability, the data includes for each subject images acquired at different times or under different illumination conditions. The results reported show that EP improves on face recognition performance when compared against PCA (¿Eigenfaces¿) and displays better generalization abilities than the Fisher linear discriminant (¿Fisherfaces¿).
MAGELLAN: multiway hardware-software partitioning and scheduling for latency minimization of hierarchical control-dataflow task graphs
Authors: Karam S. Chatha, Ranga Vemuri
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

The paper presents MAGELLAN, a heuristic technique for mapping hierarchical control-dataflow task graph specifications on heterogeneous architecture templates. The architecture can consist of multiple hardware and software processing elements as specified by the user. The objective of the technique is to minimize the worst case latency of the task graph subject to the area constraints on the architecture. The technique uses an iterative approach consisting of closely linked hardware-software partitioner and scheduler. Both the partitioner and scheduler operate on the task graph in a hierarchical top down manner. The technique optimizes deterministic loop constructs by applying clustering, unrolling and pipelining. The technique considers speculative execution for conditional constructs. The number of actual hardware/software implementations of a function in the task graph are also optimized by the technique. The effectiveness of the technique is demonstrated by a case study of an image compression algorithm.
Extending Ladkin's algebra on non-convex intervals towards an algebra on union-of regions
Authors: Christophe Claramunt
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper proposes an extension of Ladkin's algebra on nonconvex intervals towards the spatial dimension. Based on the concepts of adverbs, we introduce an algebra that qualifies topological relationships between regions composed of simple regions. These adverbs are flexible enough to apply on composite regions with an indefinite number of simple regions. A set of mutually exclusive and complete quantitative and temporal adverbs is also introduced for evolving composite regions. Since adverbs are widely used and understood by common sense reasoning, such an extended algebra provides a flexible method to analyse large spatial configurations.
Binary software components in the undergraduate computer science curriculum
Authors: Allen Parrish, Brandon Dixon, David Cordes
Venue: ACM SIGCSE Bulletin (2001)

At one time, commercial software applications were released as single binary executable files. Discussions of the notion of a "software component" were almost always limited to the context of source code. However, with the proliferation of numerous new technologies, applications are now more typically released as collections of cooperating binary components. While there is significant industrial emphasis on binary component technologies, computer science curricula have not yet standardized upon a corpus of fundamentally sound concepts to support education within this paradigm. In this paper, we describe our efforts to define a fundamental core set of concepts to support this important programming paradigm, as well as our efforts to integrate these concepts into a typical undergraduate computer science curriculum.
A note on optimal doubly-chained trees
Authors: Steve Kennedy
Venue: Communications of the ACM (1972)

This note concerns the recent paper by Hu [2] dealing with doubly-chained trees of the type introduced by Sussenguth [9]. In the second part of the paper, Hu deals with the problem of constructing an optimum weighted doubly-chained tree, under the standard assumption that no key is allowed to prefix another, as found, for example, in Patt [6]. He states that for the weights and elements of Figure 1, the optimum doubly-chained tree with all nodes reachable in less than five steps is the one shown in Figure 2. This tree is obtained from the optimal binary tree constructed in Hu and Tan [3], using the technique found in Knuth [5]. But the doubly-chained tree constructed by this method comes from an artificially restricted class of doubly-chained trees, and is thus not optimal in the sense usually defined in the literature [6-9] and described below. This fact is recognized by Hu [1], but was not explicitly stated in the paper in question.