ppxscal/embedding_network huggingface dataset:
How to Approximate the Inner-product: Fast Dynamic Algorithms for Euclidean Similarity
Authors: Omer Egecioglu
Venue:  (1999)

We develop dynamic dimensionality reduction based on the approximation of the standard inner-product. This results in a family of fast algorithms for checking similarity of objects whose feature representations are large dimensional real vectors, a common situtiton in various multimedia databases. The method uses the power symmetric functions of the components of the vectors, which are powers of the p-norms of the vectors for p = 1, 2,.., m. The number m of such norms used is a parameter of the algorithm whose simplest instance gives a first-order approximation implied by the Cauchy-Schwarz inequality. We show how to compute fixed coefficients that work as universal weights based on the moments of the probability density function assumed for the distribution of the components of the input vectors in the data set. If the distribution of the components of the vectors is not known we show how the method can be adapted to work dynamically by incremental adjustment of the parameters.
Nystroms Method vs. Founier Tupe Methods for the Numerical Solution of Integral Equations
Authors: Trummer,  M, R. red
Venue:  (1984)

It is shown that Nystrom''s method and Fourier type methods produce the same approximation to a solution of an integral equation at the collocation points for Nystrom''s method. The quadrature rule for numerical integration must have these collocation points as abscissa.
Bounded Timestamps in Process Networks
Authors: Manhoi Choy, Ambuj K. Singh
Venue:  (1993)

The reusability of these timestamps is investigated in the setting of a message-passing system and a simple implementation is presented for bounded timestamps.
Improving Polymorphism in Common Object Models
Authors: Challa Siva, Kafura Dennis
Venue:  (1998)

Most common object models of distributed object systems lack support for ''polymorphism'' (an abstraction mechanism that represents a quality or state of being able to assume different forms). This lack of support restricts the development of new components and limits reuse of existing components that use these advanced features. In this paper, the Interoperable Common Object Model (ICOM), which focuses on a subset of object-oriented languages, specifically statically typed languages, is presented. The ICOM model is an attempt to elevate common object models closer to the object models of statically typed object-oriented languages by including support for polymorphism. Specific features of the ICOM object model include: remote inheritance, method overloading, and parameterized types.
TRANSIENT ANALYSIS OF INTERCONNECT NETWORKS CHARACTERIZED BY MEASURED SCATTERING-PARAMETER DATA
Authors: Jimmy S Wang, Wayne W Dai
Venue:  (1995)

This paper describes a novel approach for incorporating the interconnects characterized by the measured scattering-parameter (S-parameter) data into an S-parameter macromodel based simulator. This approach first converts the measured S-parameter data into frequency-dependent parasitic functions: R(f), L(f), C(f), and G(f), which are later used to compute the moments of the S-parameter for the construction of the macromodel. Benefiting from the weak frequency dependency nature of the R(f), L(f), C(f), and G(f) functions, this method allows the moments to be calculated in a much more accurate fashion than those obtained from fitting the S-parameter directly. This method also has several added advantages such as: the moments produced are independent of the approximation order and insensitive to measurement errors, furthermore, they observe power conservation rule for passive systems. The simulation results show very good agreements with the results produced by the direct convolution approach.
Indexing Multispectral Images for Content-Based Retrieval
Authors: Julio Barros, James French, Worthy Martin, Patrick Kelly, James M. White
Venue:  (1994)

This paper discusses our view of image databases, content-based retrieval, and our experiences with an experimental system. We present a methodology in which efficient representation and indexing are the basis for retrieval of images by content as well as associated external information. In the example system images are indexed and accessed based on properties of the individual regions in the image. Regions in each image are indexed by their spectral characteristics, as well as by their shape descriptors and position information. The goal of the system is to reduce the number of images that need to be inspected by a user by quickly excluding substantial parts of the database. The system avoids exhaustive searching through the image database when a query is submitted.
REINAS: REAL-TIME ENVIRONMENTAL INFORMATION NETWORK AND ANALYSIS SYSTEM: PHASE IV.1-EXPERIMENTATION
Authors: P. E. Mantey, D. D.E. Long, J. J. Garcia-Luna, A. T. Pang, H. G. Kolsky, B. R. Gritton, W. A. Nuss
Venue:  (1994)

The Real-Time Environmental Information Network and Analysis System (REINAS) is a continuing engineering research and development program with the goal of designing, developing and testing an operational prototype system for data acquisition, data management, and visualization. This system is to support the real-time utilization of advanced instrumentation in environmental science. Advances in continuous time measurements and improved spatial resolution allow the monitoring and understanding environmental phenomena in much greater detail than has previously been possible. The system is also designed to support the retrospective use of integrated environmental data sets. The project is a multi-year effort of the Baskin Center for Computer Engineering and Information Sciences of the University of California, Santa Cruz (UCSC), in cooperation with environmental scientists from the Naval Postgraduate School (NPS), and Monterey Bay Aquarium Research Institute (MBARI). The REINAS system has been designed for regional real-time environmental monitoring and analysis. It is a modern system, integrated into the Internet, for conducting interactive real-time coastal air/ocean science. The database design of REINAS is independent of specific database technology and is designed to support operational scientific needs throughput the entire scientific data life-cycle. During the Spring 1994 final selections of the technologies to be used in the prototype system were made, and detailed architecture of REINAS and experimentation with subsystems for data collection, data management, processing, and visualization were started. On September 13 and 14, 1994, a major site review was held at UCSC and NPS for our Office of Naval Research and DOD sponsors. This report documents the status of REINAS as it was presented at this review. It represents the mid-point of Phase IV -- the Experimentation and System Verification Phase. (not available electronically)
THE PERFORMANCE OF WEAK-CONSISTENCY REPLICATION PROTOCOLS
Authors: Richard A. Golding, Darrell D. E. Long
Venue:  (1992)

Weak-consistency replication protocols can be used to build wide-area services that are scalable, fault-tolerant, and useful for mobile computer systems. We have developed the *timestamped anti-entropy* protocol, which provides reliable eventual delivery with a variety of message orderings. Pairs of replicas periodically exchange update messages; in this way updates eventually propagate to all replicas. In this paper we present a detailed analysis of the fault tolerance and the consistency provided by this protocol. The protocol is extremely robust in the face of site and network failure, and it scales well to large numbers of replicas.
A Molecular Database Systems Technology
Authors: Don S. Batory
Venue:  (1987)

We present a very simple formalism based on parameterized types and a rule-based algebra to survey and identify the storage structure and query processing algorithm building blocks of database management systems. We demonstrate building block reusability by showing how different combinations of a few blocks yield the structures and algorithms of three different systems, namely System R (centralized), R* (distributed), and GRACE (database machine). We believe that codifying knowledge of DBMS implementations is an important step toward a technology that assembles DBMSs rapidly and cheaply from libraries of prewritten components.
Control of inductive bias in supervised learning using evolutionary computation: a wrapper-based approach
Authors: William H. Hsu
Venue: Data mining: opportunities and challenges (2003)

In this chapter, I discuss the problem of feature subset selection for supervised inductive learning approaches to knowledge discovery in databases (KDD), and examine this and related problems in the context of controlling inductive bias. I survey several combinatorial search and optimization approaches to this problem, focusing on data-driven, validation-based techniques. In particular, I present a wrapper approach that uses genetic algorithms for the search component, using a validation criterion based upon model accuracy and problem complexity, as the fitness measure. Next, I focus on design and configuration of high-level optimization systems (wrappers) for relevance determination and constructive induction, and on integrating these wrappers with elicited knowledge on attribute relevance and synthesis. I then discuss the relationship between this model selection criterion and those from the minimum description length (MDL) family of learning criteria. I then present results on several synthetic problems on task-decomposable machine learning and on two large-scale commercial data-mining and decision-support projects: crop condition monitoring, and loss prediction for insurance pricing. Finally, I report experiments using the Machine Learning in Java (MLJ) and Data to Knowledge (D2K) Java-based visual programming systems for data mining and information visualization, and several commercial and research tools. Test set accuracy using a genetic wrapper is significantly higher than that of decision tree inducers alone and is comparable to that of the best extant search-space based wrappers.
Language Acquisition and Data Compression
Authors: Jason Hutchens, Michael Alder
Venue:  (1997)

Statistical data compression requires a stochastic language model which must rapidly adapt to new data as it is encountered. A grammatical inference engine is introduced which satisfies this requirement; it is able to discover structure in arbitrary data using nothing more than the predictions of a simple trigram model. We show that compression may be used as an alternative to perplexity for language model evaluation, and that the information processing techniques employed by our system may reflect what happens in the human brain.
Register Deprivation Measurements
Authors: Manuel E. Benitez, Jack W. Davidson
Venue:  (1993)

The development of register deprivation measurements was motivated by the desire to study the effect that register demand has on code improvement and register allocation strategies. In addition to the obvious application of testing the spill mechanism used by the compiler''s register allocator, the register deprivation strategy can be used to determine the relationship between the number of allocable registers and the effectiveness of a code improver as a whole or its optimization phases individually, enhance the coverage of validation suites, evaluate the register demands of benchmark suites and help machine designers determine the optimal number of registers needed to support existing compiler technologies. This paper contains a description of register deprivation techniques, presents some of their most useful applications, and discusses issues that must be addressed in order to incorporate this technique into a compiler. Also included are register deprivation measurement results obtained using a modest set of benchmarks that provide interesting and somewhat unexpected insights pertaining to optimizations, benchmark programs and architectures.
Minimizing Row Displacement Dispatch Tables
Authors: Karel Driesen, Urs Holzle
Venue:  (1995)

Row displacement dispatch tables implement message dispatching for dynamically-typed languages with a run time overhead of one memory indirection plus an equality test. The technique is similar to virtual function table lookup, which is, however, restricted to statically typed languages like C++. We show how to reduce the space requirements of dispatch tables to approximately the same size as virtual function tables. The scheme is then generalized for multiple inheritance. Experiments on a number of class libraries from five different languages demonstrate that the technique is effective for a broad range of programs. Finally, we discuss optimizations of the row displacement algorithm that allow dispatch table construction of these large samples to take place in a few seconds.
High Performance Access to Radio Astronomy Data: A Case Study
Authors: John F. Karpovich, James C. French, Andrew S. Grimshaw
Venue:  (1994)

Scientific applications often manipulate very large sets of persistent data. Over the past decade, advances in disk storage device performance have consistently been outpaced by advances in the performance of the rest of the computer system. As a result, many scientific applications have become I/O-bound, i.e. their run-times are dominated by the time spent performing I/O operations. Consequently, the performance of I/O operations has become critical for high performance in these applications. The ELFS approach is designed to address the issue of high performance I/O by treating files as typed objects. Typed file objects can exploit knowledge about the file structure and type of data. Typed file objects can selectively apply techniques such as prefetching, parallel asynchronous file access, and caching to improve performance. Also, by typing objects, the interface to the user can be improved in two ways. First, the interface can be made easier to use by presenting file operations in a more natural manner to the user. Second, the interface can allow the user to provide an "oracle" about access patterns, that can allow the file object to improve performance. By combining these concepts with the object-oriented paradigm, the goal of the ELFS methodology is to create flexible, extensible file classes that are easy to use while achieving high performance. In this paper we present the ELFS approach and our experiences with the design and implementation of two file classes: a two dimensional dense matrix file class and a multidimensional range searching file class.
On Spline Basis Selection for Solving Differential Equations
Authors: Uri Ascher, S. Pruess, Robert D. Russell
Venue:  (1981)

The suitability of B-splines as a basis for piecewise polynomial solution representation for solving differential equations is challenged. Two alternative local solution representations are considered in the context of collocating ordinary differential equations: ``Hermite-type'''' and ``monomial''''. Both are much easier and shorter to implement and somewhat more efficient than B-splines. .br A new condition number estimate for the B-splines and Hermite-type representations is presented. One choice of the Hermite-type representation is experimentally determined to produce roundoff errors at most as large as those for B-splines. The monomial representation is shown to have a much smaller condition number than the other ones, and correspondingly produces smaller roundoff errors, especially for extremely nonuniform meshes. The operation counts for the two local representations considered are about the same, the Hermite-type representation being slightly cheaper. It is concluded that both representations are preferable, and the monomial representation is particularly recommended.
FLECS: A Tool for Rapid Prototyping of Mechanisms in Success/Failure Based Languages
Authors: Mark W. Bailey, Janalee O''Bagy
Venue:  (1990)

Our goal is to provide a prototyping tool that facilitates the addition of new language mechanisms in success/failure based languages. By this, we mean languages that have success and failure of expressions, generators, and backtracking. We have designed an interpreter, called FLECS, for a subset of Icon, a language which exhibits the above features. FLECS is written in Scheme using a technique called continuation-passing-style (CPS). This approach allows us to extend, modify, and experiment with new language mechanisms which range from datatyping issues to general control structures. In this report, we provide an overview of the base semantics that FLECS implements, fol lowed by a brief description of the CPS implementation technique. FLECS''s capability is then demonstrated by augmenting the base language with a general control abstraction that has been shown to be powerful in the context of traditional procedural languages. In conclusion, the seman tics of this control abstraction in the presence of success and failure is discussed.
Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems
Authors: Almut Burchard, Jorg Liebeherr, Yingfeng Oh, Sang H. Son
Venue:  (1994)

Optimal scheduling of real-time tasks on multiprocessor systems is known to be computationally intractable for large task sets. Any practical scheduling algorithm for assigning real-time tasks to a multiprocessor system presents a trade-off between its computational complexity and its performance. The performance of a scheduling algorithm is measured in terms of the additional number of processors required to arrive at a schedule without deadline violations as compared to an optimal algorithm. In this study, new schedulability conditions are presented for homogeneous multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The conditions are used to develop new strategies for assigning real-time tasks to processors. The performance of the new strategies is shown to be significantly better than suggested by the existing literature. Under the (realistic) assumption that the load of each real-time task is small compared to the processing speed of each processor, it is shown that all processors can be almost fully utilized. Task assignment strategies are proposed for scenarios where the task set is known a priori (off-line schemes), and where the real-time task set can change dynamically (on-line schemes).
A Prological Definition of HASL, a Purely Functional Language with Unification Based Expressions
Authors: Harvey Abramson
Venue:  (1983)

We present a definition in Prolog of a new purely functional (applicative) language HASL ({\em HA}rvey''s {\em S}tatic {\em L}anguage). HASL is a descendant of Turner''s SASL and differs from the latter in several significant points: it includes Abramson''s unification based conditional binding constructs; it restricts each clause in a definition of a HASL function to have the same arity, thereby complicating somewhat the compilation of clauses to combinators, but simplifying considerably the HASL reduction machine; and it includes the single element domain \{fail\} as a component of the domain of HASL data structures. It is intended to use HASL to express the functional dependencies in a translator writing system based on denotational semantics, and to study the feasibility of using HASL as a functional sublanguage of Prolog or some other logic programming language. Regarding this latter application we suggest that since a reduction mechanism exists for HASL, it may be easier to combine it with a logic programming language than it was for Robinson and Siebert to combine LISP and LOGIC into LOGLISP: in that case a fairly complex mechanism had to be invented to reduce uninterpreted LOGIC terms to LISP values. .br The defnition is divided into four parts. The first part defines the lexical structure of the language by means of a simple Definite Clause Grammar which relates character strings to ``token'''' strings. The second part defines the syntactic structure of the language by means of a more complex Definite Clause Grammar and relates token strings to a parse tree. The third part is semantic in nature and translates the parse tree definitions and expressions to a variable-tree string of combinators and global names The fourth part of the definition consists of a set of Prolog predicates which specifies how strings of combinators and global names are reduced to ``values'''', ie., integers, truth values, characters, lists, functions fail, and has an operational flavour: one can think of this fourth part as the definition of a normal order reduction machine.
Face Recognition: the Problem of compensating for Changes in Illumination Direction
Authors: Y. Adini, Y. Moses, S. Ullman
Venue:  (1993)

Recognizing faces is a difficult problem due to the generally similar shape of faces combined with the considerable variability in images of the same face under different viewing conditions. In this report we consider image variation due to mainly illumination conditions.
An Efficient Uniform-Cost Normalized Edit Distance Algorithm
Authors: Abdullah N. Arslan, Omer Egecioglu
Venue:  (1999)

A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m <= n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given edit sequence is the ratio of the total weight of the sequence to its length, and the minimum of this ratio over all edit sequences is the normalized edit distance between X and Y. Experimental results suggest that for some applications normalized edit distance is better as a similarity measure than ordinary edit distance, which ignores the length of the sequences. Existing algorithms for the computation of normalized edit distance with provable bounds on the complexity require O(mn^2) operations in the worst-case. In this paper we develop an O(mnlogn) worst-case algorithm for the normalized edit distance problem for uniform weights. In this case the weight of each edit operation is constant within the same type, except substitutions can have different costs depending on whether they are matching or non-matching.
On Similarity to Prototypes in 3D Object Recognition
Authors: S. Duvdevani-Bar, S. Edelman
Venue:  (1995)

A representational scheme under which the ranking between represented dissimilarities is isomorphic to the ranking between the corresponding shape dissimilarities can support perfect shape classification, because it preserves the clustering of shapes according to the natural kinds prevailing in the external world. We discuss the computational requirements of rank-preserving representation, and examine its plausibility within a prototype-based framework of shape vision.