ppxscal/embedding_network huggingface dataset:
Classification-Based Likelihood Functions for Bayesian Tracking
Authors: Chunhua Shen, Hongdong Li, Michael J. Brooks
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The success of any Bayesian particle filtering based tracker relies heavily on the ability of the likelihood function to discriminate between the state that fits the image well and those that do not. This paper describes a general framework for learning probabilistic models of objects for exploiting these models for tracking objects in image sequences. We use a discriminative classifier to learn models of how they appear in images. In particular, we use a support vector machine (SVM) for training, which is able to extract useful non-linear information, and thus represent more complex characteristics of the tracked object and background. This is a particular advantage when tracking deformable objects and where appearance changes due to the unstable illumination and pose occur. A by-product of the SVM training procedure is the classification function, with which the tracking problem is cast into a binary classification problem. An object detector directly using the classification function is then available. To make the tracker robust, an object detector that directly uses the classification function is combined into the tracker for object verification. This provides the capability for automatic initialisation and recovery from momentary tracking failures. We demonstrate improved robustness in image sequences.
Simulation model of the telemedicine program
Authors: J. Mauricio Lach, Ricardo M. Vázquez
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Telemedicine Program was created to provide medical assistance to people living in extreme poverty conditions in Mexico. Through a satellite connection, a physician located in Mexico City can diagnose the patient who is physically inspected on a mobile unit, equipped with telecommunications gear. The program's performance has brought positive results, and is starting to expand to farther regions. This paper explains how the program's processes were simulated on a specially designed logical-mathematical computer model in order to observe, and analyze the possible results generated when specific information of the model's parameters is introduced. The results shown by the model when different scenarios are being run, can be used as a powerful tool in the decision making process in order to optimize the program's performance by maximizing its utilization and efficiency, looking forward to incrementing its productivity.
Efficient Retrieval of DNA Sequences Using Multi-way Clustering
Authors: Sungmin Joo, Motomichi Toyama
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

A retrieval on large DNA sequence data is very important in bioinformatics. However, it takes much time to search and comparison on large DNA sequence data. In this paper, we propose multi-way clustering for improving both the speed of retrieval and implement them. The result shows that multi-way clustering is a more efficient approach for retrieval of DNA sequence.
Unsupervised band removal leading to improved classification accuracy of hyperspectral images
Authors: R. Ian Faulconbridge, Mark R. Pickering, Michael J. Ryan
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Remotely-sensed images of the earth's surface are used across a wide range of industries and applications including agriculture, mining, defence, geography and geology, to name but a few. Hyperspectral sensors produce these images by providing reflectance data from the earth's surface over a broad range of wavelengths or bands. Some of the bands suffer from a low signal-to noise ratio (SNR) and do not contribute to the subsequent classification of pixels within the hyperspectral image. Users of hyperspectral images typically become familiar with individual images or sensors and often manually omit these bands before classification.We propose a process that automatically determines the spectral bands that may not contribute to classification and removes these bands from the image. Removal of these bands improves the classification performance of a well-researched hyperspectral test image by over 10% whilst reducing the size of the image from a data storage perspective by almost 30%. The process does not rely on prior knowledge of the sensor, the image or the phenomenology causing the SNR problem.In future work, we aim to develop compression algorithms that incorporate this process to achieve satisfactory compression ratios whilst maintaining acceptable classification accuracies.
A Hierarchical Optimization Framework for Autonomic Performance Management of Distributed Computing Systems
Authors: Nagarajan Kandasamy, Sherif Abdelwahed, Mohit Khandekar
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

This paper develops a scalable online optimization framework for the autonomic performance management of distributed computing systems operating in a dynamic environment to satisfy desired quality-ofservice objectives. To efficiently solve the performance management problems of interest in a distributed setting, we develop a hierarchical structure where a highlevel limited-lookahead controller manages interactions between lower-level controllers using forecast operating and environment parameters. We develop the overall control structure, and as a case study, show how to efficiently manage the power consumed by a computer cluster. Using workload traces from the Soccer World Cup 98 web site, we show via simulations that the proposed method is scalable, has low run-time overhead, and adapts quickly to time-varying workload patterns.
Feedback Guided Dynamic Integral Partition
Authors: Sabin Tabirca, Tatiana Tabirca, Lawrence Tianruo Yang, Len Freeman
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

In this article we introduce a new iterative method for integral partition called the Feedback Guided Dynamic Integral Partition (FGDIP) algorithm. The problem to study is the partition of a definite integral into p identical subintegrals. The method generates iteratively a sequence of integral bounds by re-balancing the previous integral partition to achieve a better one. A simple convergence condition is also proposed. Experimental results show that the proposed method FGDIP achieves better performance than the classical Newton's method.
Quality meshing of implicit solvation models of biomolecular structures
Authors: Yongjie Zhang, Guoliang Xu, Chandrajit Bajaj
Venue: Computer Aided Geometric Design (2006)

This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Protein Data Bank (PDB). First, a smooth volumetric electron density map is constructed from atomic data using weighted Gaussian isotropic kernel functions and a two-level clustering technique. This enables the selection of a smooth implicit solvation surface approximation to the Lee-Richards molecular surface. Next, a modified dual contouring method is used to extract triangular meshes for the surface, and tetrahedral meshes for the volume inside or outside the molecule within a bounding sphere/box of influence. Finally, geometric flow techniques are used to improve the surface and volume mesh quality. Several examples are presented, including generated meshes for biomolecules that have been successfully used in finite element simulations involving solvation energetics and binding rate constants.
Viewpoint Dependency in Visual Object Recognition Does Not Necessarily Imply Viewer-Centered Representation
Authors: Moshe Bar
Venue: Journal of Cognitive Neuroscience (2001)

The nature of visual object representation in the brain is the subject of a prolonged debate. One set of theories asserts that objects are represented by their structural description and the representation is "object-centered." Theories from the other side of the debate suggest that humans store multiple "snapshots" for each object, depicting it as seen under various conditions, and the representation is therefore "viewer-centered." The principal tool that has been used to support and criticize each of these hypotheses is subjects' performance in recognizing objects under novel viewing conditions. For example, if subjects take more time in recognizing an object from an unfamiliar viewpoint, it is common to claim that the representation of that object is viewpoint-dependent and therefore viewer-centered. It is suggested here, however, that performance cost in recognition of objects under novel conditions may be misleading when studying the nature of object representation. Specifically, it is argued that viewpoint-dependent performance is not necessarily an indication of viewer-centered representation. An account for the neural basis of perceptual priming is first provided. In light of this account, it is conceivable that viewpoint dependency reflects the utilization of neural paths with different levels of sensitivity en route to the same representation, rather than the existence of viewpoint-specific representations. New experimental paradigms are required to study the validity of the viewer-centered approach.
Accelerating Color Space Conversion Using Extended Subwords and the Matrix Register File
Authors: Asadollah Shahbahrami, Ben Juurlink, Stamatis Vassiliadis
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Color space conversion is an important kernel in multimedia codecs such as JPEG and MPEG. When implemented using SIMD instructions, however, the performance improvement is often limited due to two reasons. First, corresponding color space components are stored at non-unit strides and, second, intermediate results can be larger than 8 bits. In this paper we show that extended subwords and the Matrix Register File (MRF) can be employed to mitigate these limitations. These techniques avoid rearrangement instructions and increase the number of subwords that are processed in parallel. Experimental results have been obtained by extending the SimpleScalar toolset. The results show that extended subwords and the MRF yield a speedup of up to 2.45x and 1.78x over MMX for the RGB-to-YCbCr and YCbCr-to-RGB kernels, respectively. Compared to C implementations, speedups of up to 10.09x and 6.74x, respectively, are obtained. Additionally, the results show that the speedup over MMX is higher for low issue rates. This means that extended subwords and the MRF are suitable techniques for embedded multimedia systems where high issue rates and out-of-order execution are too expensive. The results also show that using more registers improves performance substantially.
A Model for Service-Oriented Communication Systems
Authors: Bernd Reuther, Dirk Henrici
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Like most software products, protocols are continuously enhanced and new protocols are developed. But especially new protocols of the transport layer can not be utilized widely easily. Even if the new protocols are made available, it is still necessary to adapt many applications or the protocols are not used by the majority of applications otherwise. The current situation is that only very limited enhancements of protocols are possible without changing applications. The proposed solution is to let applications use communications services only instead of protocols. A model for service-oriented communications systems that follows the concepts of service-oriented architectures is introduced. The model enables choosing and configuring protocols autonomously with regard to environmental and temporal conditions.
Absolute minimum of mean-square functional in plasma optimal stabilization
Authors: S. V. Pogojev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

The central problem to be investigated in this paper is plasma optimal stabilization in tokamaks. Mathematical methods of stabilizing control design based on modern optimization theory are applied. Easy-to-find estimation of linear mean-square functional without need of direct solving the optimization problem is obtained. Particular problem of synthesis in the case of harmonic determinate disturbances is investigated. 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
XML Document Correction: Incremental Approach Activated by Schema Validation
Authors: Beatrice Bouchou, Ahmed Cheriat, Myrian Halfeld Ferrari, Agata Savary
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Updating XML documents submitted to schema constraints requires incremental validation, i.e. checking the parts of the document concerned by the updates. We propose to correct subtrees for which re-validation fails: if the validator fails at node p, a correction routine is called in order to compute corrections of the subtree rooted at p, within a given threshold. Then validation continues. In the correction process, we limit ourselves to single typed tree language. The correction routine uses tree edit distance matrices. Different correction versions are proposed to the user.
Microsoft Visual Studio 2005 Unleashed (Unleashed)
Authors: Lars Powers, Mike Snell
Venue:  (2006)

Microsoft Visual Studio 2005 Unleashed isï¾ a deep dive into the Visual Studio 2005ï¾ tool. Specifically, it will provide you withï¾ solid guidance and education that will allow you to squeeze the ultimate productivity and use out of the Visual Studio 2005 development environment. This book folds in real-world development experience with detailed information about the IDE to make you more productive and ease transition from other development environments (including prior versions of Visual Studio). This book will also help youï¾ increase team collaboration and project visibility with Visual Studio Team Systemsï¾ and it willï¾ give youï¾ straight, to-the-point answers to common developer questions about the IDE.Chapters include: Code Viewers, Explorers, and Browsers Refactoring Code 8 Writing ASP .NET Applications Defining Standards and Practices Introduction to Visual Studio Team System Work Item Trackingï¾ Unit and Load Testing
Documenting life: videography and common sense
Authors: B. Barry, G. Davenport
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper introduces a model for producing common sense metadata during video capture and describes how this technique can have a positive impact on content capture, representation, and presentation. Metadata entered into the system at the moment of capture is used to generate suggestions designed to help the videographer decide what to shoot, how to compose a shot and how to index their video material to best support their communication requirements. An approach and first experiments using a common sense database and reasoning techniques to support a partnership between the camera and videographer during video capture are presented.
Adaptive subspace selection using subband decompositions for sensor array processing
Authors: J. S. Goldstein, M. A. Ingram, E. J. Holder, R. N. Smith
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper considers the steady state behavior of adaptive processors. The use of a time-varying, minimum mean-square error searching, tree-structured filterbank is introduced to select the best subspace, in a least squares sense, for the adaptive processor with a predetermined number of adaptive coefficients. With the realistic assumption that the quantity of adaptive coefficients is the major computational restriction on the adaptive processor, it is shown that the time-varying filterbank allows the processor to achieve a lower minimum mean-square error than that which could be realized otherwise. The simple transform-domain least mean-square algorithms may be utilized to improve the dynamic behavior of the adaptive processor. These ideas are extended to the multidimensional filter case, and an example is presented via simulation for sensor array processing utilizing the generalized sidelobe canceller.
Game Analysis in Water Resources Optimal Allocation
Authors: Wang Yu-Peng, Xie Jian-Cang, Chen Lintao, Kong Ker, Thian Yew-Gan
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

To implement the regional water resources optimal deployment, reasonable and efficient utilization of water resources for implementing the sustainable development of regional economy and society, a twostage dynamic game model for water resources optimal allocation is set with the objective of maximization the overall value of water resources. Water rights, public interests, water market and the water price in market which are determined by the dealers' decisions are all taken into account. The solution which satisfies both the administrator's resources allocation mandate and the consumers' private objectives is solved in the case of sub-game perfect Nash equilibrium. An example is given to illustrate the idea with the purpose to provide useful decision support for the modern management of water resources in China.
Learning Systems in Higher Education
Authors: Larissa Zaitseva, Jekaterina Bule
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The paper studies the problem of learning process organizing in higher education institutions. Different computer-based learning systems types are described. Architecture of the most popular of them is shown. Learning objects concept is outlined. Various learning objects tasks types are considered. The system and electronic textbook developed and used at Riga Technical University are reviewed.
MODL: A Bayes optimal discretization method for continuous attributes
Authors: Marc Boullé
Venue: Machine Learning (2006)

While real data often comes in mixed format, discrete and continuous, many supervised induction algorithms require discrete data. Efficient discretization of continuous attributes is an important problem that has effects on speed, accuracy and understandability of the induction models. In this paper, we propose a new discretization method MODL1, founded on a Bayesian approach. We introduce a space of discretization models and a prior distribution defined on this model space. This results in the definition of a Bayes optimal evaluation criterion of discretizations. We then propose a new super-linear optimization algorithm that manages to find near-optimal discretizations. Extensive comparative experiments both on real and synthetic data demonstrate the high inductive performances obtained by the new discretization method.
A Sentence Classification System for Multi Biomedical Literature Summarization
Authors: Yasunori Yamamoto, Toshihisa Takagi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

A PubMed search often returns a long list of queryrelated papers that a researcher cannot cope with in a short time. As a first step to address this issue by summarizing retrieved papers, we developed a system to classify sentences of abstracts obtained from the MEDLINE database into five rhetorical statuses: background, purpose, method, result, or conclusion. We used Support Vector Machine (SVM) classifiers and trained each of them for a different rhetorical status on structured abstracts. A structured abstract is one that has labels indicating rhetorical statuses of the sentences, while an unstructured abstract does not. The classifiers were tested on both structured and unstructured abstracts. The former were randomly obtained from the MEDLINE database and the latter were manually labeled by humans. We compared our method with a previously reported one. In addition, we combined them and evaluated the combined method. Our method outperformed the previously reported one, and the combined method showed even better results. Classified abstracts can be used for multi-document summarization that provides researchers with a way of learning a research topic efficiently and effectively.
Automation of human decision processes for route completion for airspace design analysis
Authors: Lisa A. Schaefer
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses. We were given air traffic routes that had origin, destination, and complete route information inside of the problem design area. Analyst judgment was necessary for completing the routes outside of the design area. We automated the analyst decision processes so that comparisons could be made across scenarios. This process was required for thousands of routes. We analyze design performance measures and show that the resulting distances among the redesigned routes differ from baseline route lengths.
A new concept in defence safety standards: the revised UK defence standard 00-56
Authors: Viv Hamilton
Venue: Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55 (2006)

In January 2005 the UK Ministry of Defence released Issue 3 of Defence Standard 00-56 (MOD 2004). This standard provides a comprehensive structure for safety management and for engineering safety into defence equipment and services. The standard moves away from mandating specific processes and instead takes a goal-based approach that requires suppliers to justify their systems by means of safety cases containing explicit arguments based on compelling evidence. This approach provides greater flexibility, especially for systems using COTS components. It is likely that the introduction of the new standard will pose challenges, as both suppliers and procurers develop new skills in developing and justifying safety claims. In this paper, the background to the revision is explained, including the challenge in producing a goal-based software standard. The structure of the standard is described and contrasting examples of potentially compliant approaches are provided. The consultation that has taken place with industry and the key challenges for both suppliers and procurers are explained.
High-Level Decision Diagram based Fault Models for Targeting FSMs
Authors: Jaan Raik, Raimund Ubar, Taavi Viilukas
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Recently, a number of works have been published on implementing assignment decision diagram models combined with SAT methods to address register-transfer level test pattern generation. Those methods have proven efficient. However, all of them target modules inside the datapath of the circuit. In this paper, we show by experiments that the fault coverage achieved by full datapath tests is often lower than what can be achieved if faults in the control part FSM were additionally considered. We also propose a new type of fault model for targeting faults in FSMs embedded to RTL descriptions. In addition, we present an alternative for traditional assignment decision diagrams, which provides for a more general representation of RTL circuits. We show that our model, called high-level decision diagrams, allows efficient high-level test path activation. According to experiments the proposed approach outperforms state-ofthe- art test pattern generation tools.