ppxscal/embedding_network huggingface dataset:
Improving image retrieval performance with negative relevance feedback
Authors: T. V. Ashwin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Learning user perception of an image is a challenging issue in interactive content-based image retrieval (CBIR) systems. These systems employ relevance feedback mechanism to learn user perception in terms of a set of model-parameters and in turn iteratively improve the retrieval performance. Since the quantity of user feedback is expected to be small, learning the user's perception essentially involves parameter estimation with very few training points. We propose a novel, and more efficient method for relevance feedback. Contrary to existing geometric model-based relevance feedback methods, the proposed technique explicitly uses information about irrelevant data points to estimate the parameters of the model. This algorithm iteratively updates the parameters of the similarity metric so as to fit the relevant examples while excluding the irrelevant ones. This is achieved by modifying the weights associated with the relevant examples. Experiments on image and synthetic datasets demonstrate the retrieval effectiveness of the proposed approach.
The condition number of certain matrices and applications
Authors: P. J. S. G. Ferreira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper addresses the problem of estimating the eigenvalues and condition numbers of matrices of the form R=r(t/sub i/-t/sub j/). We begin by mentioning some of the problems in which such matrices occur, and to which the results obtained in this paper may be applied. Examples of such problems include (i) approximation by sums of irregular translates (ii) the missing data problem and incomplete sampling series. Then we describe the method for estimating the eigenvalues and the condition number. Some open issues are also discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Patterns for Integrating and Exploiting Some Non-Functional Properties in Hierarchical Software Components
Authors: Herve Chang, Philippe Collet
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Providing powerful and fine-grained capabilities for the analysis and management of non-functional properties is a major challenge for component-based software systems. In this paper, we propose integration patterns for non- functional properties of hierarchical software components. These patterns are based on a classification of low-level non-functional properties, which takes into account their nature and lifecycle. They make explicit the implementa- tion of these properties in relation with components and can be used to develop some forms of compositional reasoning. The proposals are exploited in non-functional contract ne- gotiation by enabling a negotiation process to be precisely propagated down the component hierarchy.
Fast consistency checking for the Solaris file system
Authors: J. Kent Peacock, Ashvin Kamaraju, Sanjay Agrawal
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Our Netra NFS group at Sun set out to solve the challenging problem of providing remote Network File System (NFS) service with high performance and availability. An NFS server must guarantee the permanence of changes to the file system before acknowledging an NFS request. Thus, the server's underlying local file system must perform update operations synchronously to stable storage with potentially high latency. Our solution to this problem involves using the Solaris Unix File System (UFS), derived from the Berkeley Fast File System (FFS), in conjunction with nonvolatile RAM (NVRAM) as fast stable storage. We evaluated the system using the LADDIS benchmark and as a result, developed a cacheing technique for block-mapping information that gave us a 23% increase in measured server throughput in our standard RAID-5 server configuration. With recent increases in disk capacity and RAID technology, filesystem sizes have reached a point not imagined by the FFS designers, requiring an approach to checking file-system consistency that does not grow proportionately with file-system size. We examined several log-based solutions to providing fast crash recovery, but none could use the NVRAM effectively and meet our performance requirements. As an alternative, we developed an approach that uses UFS but maintains file-system working-set information, so that the consistency checker needs to examine only the active portions of a file system. This approach met our performance goals and also reduced file-system consistency-checking times to between 3% and 25% of those in the original UFS implementation.
Use of Walsh transforms in estimation of depths of idealized sources from total-field magnetic anomalies
Authors: Ranjit K. Shaw, B. N. P. Agarwal, B. K. Nandi
Venue: Computers Geosciences (2007)

We developed a scheme to compute the depths of four idealized magnetized sources, viz., a monopole, a line of monopoles, a dipole and a line of dipoles from the Walsh spectra of the total-field magnetic anomalies. The sequency numbers, l"m"a"x corresponding to the peaks of the differential energy density spectra over these sources are practically independent of the shape of the observed anomaly and are linearly dependent on the source depths. For each model, we derived a quantitative relation between the depth and the sequency number l"m"a"x. Analyses of simulated data over idealized isolated sources reveal that (i) a profile length of about 8 times the source depth provides accurate value in computed depth; (ii) data spacing of less than one-fourth the source depth has no significant error in depth computation and (iii) the technique is capable of tolerating random error to the tune of 10% of the peak amplitude of the simulated anomaly. We compared the results of depth estimations from Walsh and Fourier spectra. Analysis of total-field magnetic anomalies over a buried water supply pipe has demonstrated the applicability of the proposed method.
A strategic model for information markets
Authors: Evdokia Nikolova, Rahul Sami
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Information markets, which are designed specifically to aggregate traders' information, are becoming increasingly popular as a means for predicting future events. Recent research in information markets has resulted in two new designs, market scoring rules and dynamic parimutuel markets. We develop an analytic method to guide the design and strategic analysis of information markets. Our central contribution is a new abstract betting game, the projection game, that serves as a useful model for information markets. We demonstrate that this game can serve as a strategic model of dynamic parimutuel markets, and also captures the essence of the strategies in market scoring rules. The projection game is tractable to analyze, and has an attractive geometric visualization that makes the strategic moves and interactions more transparent. We use it to prove several strategic properties about the dynamic parimutuel market. We also prove that a special form of the projection game is strategically equivalent to the spherical scoring rule, and it is strategically similar to other scoring rules. Finally, we illustrate two applications of the model to analysis of complex strategic scenarios: we analyze the precision of a market in which traders have inertia, and a market in which a trader can profit by manipulating another trader's beliefs.
A uniform job monitoring service in multiple job universes
Authors: Miroslav Ruda, Aleš Křenek, Miloš Mulač, Jan Pospíšil, Zdeněk Šustr
Venue: Proceedings of the 2007 workshop on Grid monitoring (2007)

We describe an ongoing work of extending the gLite Logging and Bookkeeping (L&B) service to be able to track additional types of jobs, with the vision of being able to uniformly follow jobs on the Grid, even when they pass between different middleware domains. Details are given on the simpler case of PBS jobs, which prove the cababilityof L&B to deal with additional job types,as well as started more complex and challenging work on Condor jobs, where theimpact of eventual success is larger.
A general framework of feature extraction: application to speaker recognition
Authors: Chi-Shi Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Extracting a good feature set is important to pattern recognition. A new formulation of integrating the feature extraction into the model training is proposed. The intraframe weighting, the interframe weighting and the feature reduction schemes can be obtained from this new formulation. According to the dependence of the class model parameters, three types of feature extraction are derived. Some experiments for the speaker recognition application are given to show the effectiveness of the new proposed feature extraction method.
Extended Time Constraints for Sequence Mining
Authors: Celine Fiot, Anne Laurent, Maguelonne Teisseire
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Many applications require techniques for temporal knowledge discovery. Some of those approaches can handle time constraints between events. In particular some work has been done to mine generalized sequential patterns. However, such constraints are often too crisp or need a very precise assessment to avoid erroneous information. Therefore, in this paper we propose to soften temporal constraints used for generalized sequential pattern mining. To handle these constraints while data mining, we design an algorithm based on sequence graphs. Moreover, as these relaxed constraints may extract more generalized patterns, we propose temporal accuracy measure for helping the analysis of the numerous discovered patterns.
Data Structure Estimation for RDF Oriented Repository Building
Authors: Martin Rimnac
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Mechanisms for accessing and training the data repository using a binary matrix formalism are presented. The repository is designed for a data storage through corresponding instances of simple attribute functional dependencies, which can be seen as similar to the binary predicate formalism being used by the RDF semantic web format. Two mechanisms for querying a repository, the generalisation and the specialisation, are given. Furthermore, the incremental repository training mechanism is described: The extensional functional dependency system is used as a generalised view on the stored data; the algorithm is inspired by the functional dependency discovery approach.
Phase transitions of PP-complete satisfiability problems
Authors: Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
Venue: Discrete Applied Mathematics (2007)

The complexity class PP consists of all decision problems solvable by polynomial-time probabilistic Turing machines. It is well known that PP is a highly intractable complexity class and that PP-complete problems are in all likelihood harder than NP-complete problems. We investigate the existence of phase transitions for a family of PP-complete Boolean satisfiability problems under the fixed clauses-to-variables ratio model. A typical member of this family is the decision problem # 3SAT(>=2^n^/^2): given a 3CNF-formula, is it satisfied by at least the square-root of the total number of possible truth assignments? We provide evidence to the effect that there is a critical ratio r"3","2 at which the asymptotic probability of # 3SAT(>=2^n^/^2) undergoes a phase transition from 1 to 0. We obtain upper and lower bounds for r"3","2 by showing that 0.9227==2^n^/^2) using a natural modification of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Our experimental results suggest that r"3","2~2.5. Moreover, the average number of recursive calls of this modified DPLL procedure reaches a peak around 2.5 as well.
Approximation of the minmax interpolator
Authors: Lei Ying
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We consider approximation of the optimal Yen algorithm (1956) for interpolation from a nonuniformly-spaced grid. Although the Yen interpolator is optimal in many senses, it suffers from severe numerical ill conditioning. We suggest a tradeoff between accuracy in computing the interpolator and accuracy in performing the interpolation. A new interpolator is proposed using Choi's expression (1998) for interpolation error. A strategy is suggested to control the error tradeoff. We also generalize the new interpolator to multiple dimensions. The newly designed sinc-kernel interpolator is compared with the Yen, Choi, and usual sinc interpolator with Jacobian weighting using simulations in both one and two dimensions. We show that the new interpolator is robust. It performs similarly to the Yen algorithm when noise is small and similarly to the Choi algorithm when noise is large.
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job
Authors: S. Bataineh, T. Hsiung, T. G. Robertazzi
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Optimal load allocation for load sharing a divisi ble job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum fin ish time and the optimal data allocation for each pro cessor are obtained. The performance of large sym metric tree networks is examined by aggregating the component links and processors into a single equiv alent processor. This allows an easy examination of large tree networks. In addition it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.
Domain specific embedded compilers
Authors: Daan Leijen, Erik Meijer
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

Domain-specific embedded languages (DSELs) expressed in higher-order, typed (HOT) languages provide a composable framework for domain-specific abstractions. Such a framework is of greater utility than a collection of stand-alone domain-specific languages. Usually, embedded domain specific languages are build on top of a set of domain specific primitive functions that are ultimately implemented using some form of foreign function call. We sketch a general design pattern for embedding client-server style services into Haskell using a domain specific embedded compiler for the server's source language. In particular we apply this idea to implement Haskell/DB, a domain specific embedded compiler that dynamically generates of SQL queries from monad comprehensions, which are then executed on an arbitrary ODBC database server.
The covariance structure of multifractional Brownian motion, with application to long range dependence
Authors: A. Ayache
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Multifractional Brownian motion (mBm) was introduced to overcome certain limitations of the classical fractional Brownian motion (fBm). The major difference between the two processes is that, contrarily to fBm, the almost sure Holder exponent of mBm is allowed to vary along the trajectory, a useful feature when one needs to model processes whose regularity evolves in time, such as Internet traffic or images. Various properties of mBm have been studied in the literature, related to its dimensions or the statistical estimation of its pointwise Holder regularity. However, the covariance structure of mBm has not been investigated so far. We present in this work an explicit formula for this covariance. Since mBm is a zero mean Gaussian process, this provides a full characterization of its stochastic properties. We report on some applications, including the synthesis problem and the long term structure: in particular, we show that the increments of mBm exhibit long range dependence under general conditions.
Interpolated array minimum variance beamforming for correlated interference rejection
Authors: A. Zeira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Signal cancellation causes the performance of conventional adaptive beamformers to severely deteriorate in environments containing interference sources that are correlated with the signal. We propose an algorithm which overcomes the signal cancellation problem for wideband signals. The proposed algorithm applies array manifold interpolation to perform frequency domain averaging, which reduces the correlation between the signals and the interference sources. In contrast to other algorithms that apply frequency averaging, the algorithm proposed does not require any preliminary estimation or prior information on the interference environment.
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
Authors: Brigitte Pientka
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper sketches a foundation for programming with higher-order abstract syntax and explicit substitutions based on contextual modal type theory [Aleksandar Nanevski, Frank Pfenning, and Brigitte Pientka. Contextual modal type theory. submitted, 2005]. Contextual modal types not only allows us to cleanly separate the representation of data objects from computation, but allow us to recurse over data objects with free variables. In this paper, we extend these ideas even further by adding first-class contexts and substitutions so that a program can pass and access code with free variables and an explicit environment, and link them in a type-safe manner. We sketch the static and operational semantics of this language, and give several examples which illustrate these features.
Arla: a free AFS client
Authors: Assar Westerlund, Johan Danielsson
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

AFS is a world-wide distributed file system that supports several advantages over NFS, like better administration and availability. Arla is a free AFS-client, today available for a number of systems for which there are not any Transarc clients. Porting it to new systems is not hard. Arla also has some disconnected functionality and supports encryption of the data stream, features that are not present in the Transarc code. Our preliminary measurements of the un-optimized code shows that the performance of Arla is close to that of UFS.
Reading and writing with Wikis: progress and plans
Authors: Clif Kussmaul, Sharon Albert
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper describes an investigation of ways to use wikis to support and improve reading, writing, and related skills. The primary objective is to develop activities that can be adapted to a variety of settings. The paper describes a set of successful activities, and discusses the effects of using a wiki, lessons learned, and future directions.
Design, implementation, and evaluation of a compilation server
Authors: Han B. Lee, Amer Diwan, J. Eliot B. Moss
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

Modern JVM implementations interleave execution with compilation of &ldquo;hot&rdquo; methods to achieve reasonable performance. Since compilation overhead impacts the execution time of the application and induces run-time pauses, we explore offloading compilation onto a compilation server. In this article, we present the design, implementation, and evaluation of a compilation server that compiles and optimizes Java bytecodes on behalf of its clients. We show that the compilation server provides the following benefits for our benchmark programs: (i) lower execution time by reducing the compilation overhead and by enabling more aggressive optimizations; (ii) lower memory allocation by eliminating allocations due to optimizing compilation and the footprint of the optimizing compiler; (iii) lower execution time of the application due to sharing of profile information across different runs of the same application and runs of different applications. We implemented the compilation server in Jikes RVM, and our results indicate that it can reduce running time by an average of 20.5&percnt;, interruptions due to compilation by an average of 81.0&percnt;, and dynamic memory allocation by 8.6&percnt; for our benchmark programs. Simulation results indicate that our current implementation of the compilation server can handle more than 50 concurrent clients while still allowing them to outperform the best performing adaptive configuration.
Recent improvements to IBM's speech recognition system for automatic transcription of broadcast news
Authors: S. S. Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We describe extensions and improvements to IBM's system for automatic transcription of broadcast news. The speech recognizer uses a total of 160 hours of acoustic training data, 80 hours more than for the system described in Chen et al. (1998). In addition to improvements obtained in 1997 we made a number of changes and algorithmic enhancements. Among these were changing the acoustic vocabulary, reducing the number of phonemes, insertion of short pauses, mixture models consisting of non-Gaussian components, pronunciation networks, factor analysis (FACILT) and Bayesian information criteria (BIC) applied to choosing the number of components in a Gaussian mixture model. The models were combined in a single system using NIST's script voting machine known as rover (Fiscus 1997).
Performance Measures of Stream-Oriented Power Consumption for Asymmetrical Communication in Wireless Ad-Hoc Networks
Authors: Constandinos X. Mavromoustakis, Helen D. Karatza
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Power consumption control in mobile ad-hoc networks is one of the most important issues for enabling a guaranteed Quality of Service in end-to-end transmissions. However recent power consumption control techniques have not yet associated the power control of a wireless device with the content delivery. This means that all transmissions are treated in the same way, which is disastrous in the case of delay sensitive contents in end-to-end connections. In this work the packet stream of a delay sensitive content is modeled and associated with the prioritization of the packets and their spatiotemporal delays. Depending on each stream's characteristics at a certain time, a nonlinear communication model is proposed. Adjacent-neighboring nodes with certain transmission power associate their data delay with nodes' capacity measures during data revocation. Following a real time scenario each node has fading characteristics in an entirely asymmetric communication. Performance evaluation results show the efficiency of the proposed model as well as its capabilities under different fading conditions.