ppxscal/embedding_network huggingface dataset:
Multilabel Random Walker Image Segmentation Using Prior Models
Authors: Leo Grady
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in practice. However, this algorithm requires user-specified labels and produces a segmentation where each segment is connected to a labeled pixel. We show that incorporation of a nonparametric probability density model allows for an extended random walkers algorithm that can locate disconnected objects and does not require user-specified labels. Finally, we show that this formulation leads to a deep connection with the popular graph cuts method of [8, 24].
1-link shortest paths in weighted regions
Authors: Ovidiu Daescu, James D. Palmer
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximate an optimal solution within a user specified precision. The theoretical foundation of the method is a result stating that an optimal solution goes through a vertex of the subdivision. This result provides a way to discretize the problem with respect to vertices of interest which in turn leads to efficient algorithms.
eyeView: focus+context views for large group video conferences
Authors: Tracy Jenkin, Jesse McGeachie, David Fono, Roel Vertegaal
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper, we describe the design of eyeView, a video conferencing system that uses participant looking behavior to determine the size of online video conferencing windows. The system uses an elastic windowing algorithm that enlarges the image of the person most looked at by others, while maintaining a contextual view of other remote participants. eyeView measures interest by gauging whom participants look at using an eye tracker embedded in the display. Users can enter side conversations by looking at each other, and pressing the space bar. Cocktail-party filtering is aided by attenuating audio sources outside the social network constituted by glances between participants. By allocating both screen and audio real estate according to the joint attention of participants, eyeView supports smooth allocation of focus on the speaker, while maintaining awareness of the group.
Designing a Configuration Monitoring and Reporting Environment
Authors: Xev Gittler, Ken Beer
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

The Configuration Monitoring and Reporting Environment (CMRE) is a tool designed to collect and report on the many configuration details of systems within an enterprise. It is designed to gather information on systems about which initially very little is known. CMRE needs few prerequisites in order to do its job. CMRE is modular, flexible and runs on many different platforms. It is written in a combination of Perl, Korn shell and PHP and uses proprietary as well as open-source software. CMRE currently collects data on thousands of UNIX and Windows systems at Deutsche Bank world wide. This paper will describe the conditions that led to the need for such a tool, its design and limitations as well as the difficulties found along the way. This paper will also touch upon our performance monitoring tool (PMRE), whose data we use to help us understand our systems environment.
A faster parameterized algorithm for set packing
Authors: Ioannis Koutis
Venue: Information Processing Letters (2005)

We present an efficient parameterized algorithm for the (k,t)-set packing problem, in which we are looking for a collection of k disjoint sets whose union consists of t elements. The complexity of the algorithm is O(2O(t)nN logN). For the special case of sets of bounded size, this improves the O((ck)kn) algorithm of Jia et al. [J. Algorithms 50 (1) (2004) 106].
The HPCVL Working Template: A Tool for High-Performance Programming
Authors: Gang Liu, Hartmut L. Schmider, Ken E. Edgecombe
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The HPCVL Working Template is a set of scripts and libraries that facilitates programming for high-performance machines. This is achieved by providing three main functionalities: (1) the maintenance of multiple versions with only a single original source, (2) an automatic relative debugger that is suitable to use one version of the code (often the serial one) to check the correctness of another (for instance, the parallel one), and (3) a scheme for simple CPU timing, for example to determine the sections of the serial code worthwhile parallelizing, or to find the scaling properties of the parallel one. In this paper, we demonstrate the practical application of the working template by means of a simple example.
Performance assessment on ambient intelligent applications through ontologies
Authors: Isaac Lera, Carlos Juiz, Ramon Puigjaner, Christian Kurz, Günter Haring, Joachim Zottl
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This paper brings together the performance assessment of ambient intelligence architectures systems with ontology engineering. Thus, firstly appropriate description methods for distributed intelligent applications are summarized. Derived from the system characterization, typical software performance engineering techniques are based on the augmented description of the model regarding performance annotations. However, these annotations are only related with the syntactical view of the software architecture. In the next generation of performance assessment tools for ambient intelligent systems, the description of the system would be capable of reasoning and acquiring knowledge about performance. Having an appropriate architectural description including performance aspects, any possible design options for intelligent distributed applications can be evaluated according to their performance impact. Therefore, we propose the use of an ontology with performance-related information not only to possible evaluate the architecture through the common off-line procedure but also the first step to build a broker that assesses the performance of the system during its execution.
Supporting application development in the semantic web
Authors: Daniel Oberle, Steffen Staab, Rudi Studer, Raphael Volz
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

The Semantic Web augments the current WWW by giving information a well-defined meaning, better enabling computers and people to work in cooperation. This is done by adding machine understandable content to Web resources. Such added content is called metadata, whose semantics is provided by referring to an ontology---a domain's conceptualization agreed upon by a community. The Semantic Web relies on the complex interaction of several technologies involving ontologies. Therefore, sophisticated Semantic Web applications typically comprise more than one software module. Instead of coming up with proprietary solutions, developers should be able to rely on a generic infrastructure for application development in this context. We call such an infrastructure Application Server for the Semantic Web whose design and development are based on existing Application Servers. However, we apply and augment their underlying concepts for use in the Semantic Web and integrate semantic technology within the server itself. The article discusses requirements and design issues of such a server, presents our implementation KAON SERVER and demonstrates its usefulness by a detailed scenario.
Inclusion-exclusion formulas from independent complexes
Authors: Dominique Attali, Herbert Edelsbrunner
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We exhibit abstract simplicial complexes that correspond to minimal inclusion-exclusion formulas. They include the dual complex, as defined in [2], and are characterized by the independence of their simplices and by geometric realizations with the same underlying space as the dual complex.
Enhanced Model-Based Clustering, Density Estimation,and Discriminant Analysis Software: MCLUST
Authors: Chris Fraley, Adrian E. Raftery
Venue: Journal of Classification (2003)

MCLUST is a software package for model-based clustering, density estimation and discriminant analysis interfaced to the S-PLUS commercial software and the R language. It implements parameterized Gaussian hierarchical clustering algorithms and the EM algorithm for parameterized Gaussian mixture models with the possible addition of a Poisson noise term. Also included are functions that combine hierarchical clustering, EM and the Bayesian Information Criterion (BIC) in comprehensive strategies for clustering, density estimation, and discriminant analysis. MCLUST provides functionality for displaying and visualizing clustering and classification results. A web page with related links can be found at http://www.stat.washington.edu/mclust.
An Integration of Online and Pseudo-Online Information for Cursive Word Recognition
Authors: Tal Steinherz, Ehud Rivlin, Nathan Intrator, Predrag Neskovic
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

In this paper, we present a novel method to extract stroke order independent information from online data. This information, which we term pseudo-online, conveys relevant information on the offline representation of the word. Based on this information, a combination of classification decisions from online and pseudo-online cursive word recognizers is performed to improve the recognition of online cursive words. One of the most valuable aspects of this approach with respect to similar methods that combine online and offline classifiers for word recognition is that the pseudo-online representation is similar to the online signal and, hence, word recognition is based on a single engine. Results demonstrate that the pseudo-online representation is useful as the combination of classifiers perform better than those based solely on pure online information.
Comparison of QoS Performance between IPv6 QoS Management Model and IntServ and DiffServ QoS Models
Authors: El-Bahlul Fgee, Jason D. Kenney, William J. Phillips, William Robertson, S. Sivakumar
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

An increasing number of emerging Internet applications require better than best effort quality of service (QoS) that is offered by the current Internet. Applications such as voice over IP (VoIP), video on demand (VoD) and e-commerce applications need end-to-end QoS guarantees defined in terms of throughput, delay and loss rate [1]. However, QoS guarantee for these services require adding QoS algorithms that perform a number of resource management functions such as admission control, resource reservation and traffic monitoring. These functions can significantly increase the complexity and affect the scalability of the network. In this paper, three QoS schemes, integrated services (IntServ) [2], differentiated services (DiffServ) [3] and IPv6 QoS management, are compared with respect to QoS guarantee requirements. Also, the scalability and complexity issues are discussed for each one of them. The IPv6 QoS management model [4] performs well during the simulation. It is also simple and scalable when it is implemented.
Estimation of FM signal parameters in impulse noise environments
Authors: Igor Djurović, LJubiša Stanković, Johann F. Böhme
Venue: Signal Processing (2005)

A simple algorithm based on discrete chirp Fourier transform (DCFT) is used for the chirp signal parameters estimation in impulse noise environments. A modification of the DCFT is introduced in order to produce accurate estimates in this case. This modification, called the robust DCFT, produces highly accurate results in impulse noise environments, while for the Gaussian noise it is only slightly worse than the standard one. Generalization to the parametric estimation of polynomial phase signals is given. It is based on the robust form of the integrated generalized ambiguity function (IGAF). We applied the IGAF-based procedure on the signal filtered by using the robust filter designed in the frequency domain.
Development of a Clinical Data Warehouse
Authors: Panagiotis Chountas, Vassilis Kodogiannis
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

There is increasing worldwide awareness that bionics and artificial intelligence will play an important role in microbial analysis. An intelligent data-warehouse system consisting of anodour generation mechanism, rapid volatile delivery and recovery system, and a classifier system based on Neural Networks and Genetic Algorithms have been applied as part of a microbial analysis. The microbiological warehouse environment has, also adopted the concept of fusion of multiple classifiers dedicated to specific feature parameters. The experimental results confirm the soundness of the presented methods.
Singular Value Decomposition Based Image Matching
Authors: Feng Zhao, Wen Gao
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a simple and effective method for matching two uncalibrated images. Corner points are firstly extracted as interest points in the two images. Each interest point is assigned one dominant orientation. The initial set of point matches is then obtained by singular value decomposition of a correspondence strength matrix. A new expression of this matrix is introduced to handle more complicated imaging conditions. Each element of this matrix is the similarity measure between two interest points. The new similarity measure is invariant to image rotation by taking into account the dominant orientation of the two interest points. The epipolar geometry constraint is finally imposed to reject the false matches. Experimental results on real images show this approach to be effective for general image matching.
Modeling Dynamic Scenes with Active Appearance
Authors: Gianfranco Doretto
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of active appearance models. We formulate the problem variationally, and propose a framework where a model complexity cost dictates the "modeling responsibility" of each of the factors: appearance, shape and motion. We render the learning problem well-posed by reverting to a physical and a dynamic prior, and use the finite element method to compute a numerical solution. We illustrate our model to learn and simulate the shape, appearance, and motion of scenes that exhibit some form of temporal regularity, intended in a statistical sense.
FBI's Virtual Case File Living in Limbo
Authors: Benjamin Alfonsi
Venue: IEEE Security and Privacy (2005)

The US National Academy of Sciences' in-depth study of the FBI's Trilogy project outlines factors that contributed to the failure of the Trilogy program and its accompanying application software, Virtual Case File.Whatever the FBI decides to do to revamp its IT infrastructure, security measures will be a key consideration.
The First International Trading Agent Competition: Autonomous Bidding Agents
Authors: Peter Stone, Amy Greenwald
Venue: Electronic Commerce Research (2005)

This article summarizes the bidding algorithms developed for the on-line Trading Agent Competition held in July, 2000 in Boston. At its heart, the article describes 12 of the 22 agent strategies in terms of (i) bidding strategy, (ii) allocation strategy, (iii) special approaches, and (iv) team motivations. The common and distinctive features of these agent strategies are highlighted. In addition, experimental results are presented that give some insights as to why the top-scoring agents' strategies were most effective.
Memory Accesses Management During High Level Synthesis
Authors: Gwenole Corre, Eric Senn, Pierre Bomel, Nathalie Julien, Eric Martin
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

We introduce a new approach to take into account the memory architecture and the memory mapping in behavioral synthesis. We formalize the memory mapping as a set of constraints for the synthesis, and defined a Memory Constraint Graph and an accessibility criterion to be used in the scheduling step. We present a new strategy for implementing signals (ageing vectors). We formalize the maturing process and explain how it may generate memory conflicts over several iterations of the algorithm. The final Compatibility Graph indicates the set of valid mappings for every signal. Several experiments are performed with our HLS tool GAUT. Our scheduling algorithm exhibits a relatively low complexity that permits to tackle complex designs in a reasonable time.
A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows
Authors: Guilherme Bastos Alvarenga, Geraldo Robson Mateus
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. Results from exact methods have been improved exploring parallel implementations and modern branch-and-cut techniques. However, 23 out of the 56 high order instances from Solomon's test set still remain unsolved. Additionally, in many cases a prohibitive time is needed to find the exact solution. Many efficient heuristic methods have been developed to make possible a good solution in a reasonable amount of time. Using travel distance as the main objective, this paper proposes a robust heuristic approach for the VRPTW using an efficient genetic algorithm and a set partitioning formulation. The tests were produced using both, real numbers and truncated data type, making it possible to compare the results with previous heuristic and exact methods published. Furthermore, computational results show that the proposed heuristic approach outperforms all previous known heuristic methods in the literature, in terms of the minimal travel distance.
Varying Retrieval Categoricity Using Hyperbolic Geometry
Authors: Júlia Góth, Adrienn Skrop
Venue: Information Retrieval (2005)

The paper proposes a Vector Space Model over the Cayley-Klein Hyperbolic Geometry (referred to as Hyperbolic Information Retrieval = HIR) using a similarity measure derived from the hyperbolic distance. It is shown that the proposed model is equivalent with the classical Vector Space Model using Cosine measure with normalized weighting scheme. It is also shown that the categoricity of the new retrieval system can be varied by only modifying the radius of the hyperbolic space and without using a different weighting scheme and similarity measure, which is not the case in the VSM, where the same effect can only be obtained by both changing the weighting scheme and similarity measure at the expense of a more costly computation. Experiments are also reported to demonstrate and support the ideas, and they show that categoricity in HIR can be varied more than O(n) faster, where n is the number of index terms, than in the VSM.
TotalRank: ranking without damping
Authors: Paolo Boldi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor α that spreads part of the rank. The choice of α is eminently empirical, but most applications use α = 0.85; nonetheless, the selection of α is critical, and some believe that link farms may use this choice adversarially. Recent results [1] prove that the PageRank of a page is a rational function of α, and that this function can be approximated quite efficiently: this fact can be used to define a new form of ranking, TotalRank, that averages PageRanks over all possible α's. We show how this rank can be computed efficiently, and provide some preliminary experimental results on its quality and comparisons with PageRank.
The formation of neural codes in the hippocampus: trace conditioning as a prototypical paradigm for studying the random recoding hypothesis
Authors: W. B. Levy, A. Sanyal, X. Wu, P. Rodriguez, D. W. Sullivan
Venue: Biological Cybernetics (2005)

The trace version of classical conditioning is used as a prototypical hippocampal-dependent task to study the recoding sequence prediction theory of hippocampal function. This theory conjectures that the hippocampus is a random recoder of sequences and that, once formed, the neuronal codes are suitable for prediction. As such, a trace conditioning paradigm, which requires a timely prediction, seems by far the simplest of the behaviorally-relevant paradigms for studying hippocampal recoding. Parameters that affect the formation of these random codes include the temporal aspects of the behavioral/cognitive paradigm and certain basic characteristics of hippocampal region CA3 anatomy and physiology such as connectivity and activity. Here we describe some of the dynamics of code formation and describe how biological and paradigmatic parameters affect the neural codes that are formed. In addition to a backward cascade of coding neurons, we point out, for the first time, a higher-order dynamic growing out of the backward cascade&#x2014;a particular forward and backward stabilization of codes as training progresses. We also observe that there is a performance compromise involved in the setting of activity levels due to the existence of three behavioral failure modes. Each of these behavioral failure modes exists in the computational model and, presumably, natural selection produced the compromise performance observed by psychologists. Thus, examining the parametric sensitivities of the codes and their dynamic formation gives insight into the constraints on natural computation and into the computational compromises ensuing from these constraints.