ppxscal/embedding_network huggingface dataset:
An Optimized Image Retrieval Method Based on Hierarchal Clustering and Genetic Algorithm
Authors: Huang Min, Sun Bo, Xi Jianqing
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Image search on web is very familiar to various users, and improving the efficiency and accuracy of image search has become more and more a hotpot in this research field. For different commercial image engines use different retrieval techniques respectively, the coverage area and accuracy of each individual search engine await development. An improved method based on multi-optimization techniques of image retrieval is presented in the paper. On the base of relevance feed-back principle, the method does some work of the vectorization and weights adjusting to the images generated by commercial image engines, and then adopts hierarchal clustering and genetic algorithm techniques to optimize the results further. Finally, by developing a prototype of image retrieval engine based on the method presented and doing some tests, the advancing in accuracy of image retrievals of the method has been proved.
Stochastic Reasoning with Models of Agent Behavior
Authors: Gerardo I. Simari
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

There is a constant need to reason about diverse cultures all over the world. For example, a health care organization anxious about the spread of diarrhea (or any other disease) in Kenya might wish to understand socio-economic-cultural-environmental aspects of Kenyan society that cause the diseases to spread extensively in some parts of the country and not in others. In most cases, the spread of diseases is not due to biological factors alone, but to social behaviors, environmental factors, and economic and educational aspects of the disease-stricken community. The problem we are tackling is that of how to best reason about actions using models of the behaviors of such agents (where "agent" means any entity).
Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts
Authors: A. M. Bruckstein, D. Shaked
Venue: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII (2009)

We analyze a well known type of puzzle in planar geometry: given a planar shape, it is required to find a cut that divides the shape into two identical parts (up to rotation and translation). Clearly not all shapes can be so dissected and for some shapes that appear in puzzles the cutting curve is quite surprising and difficult to find. In this paper we first analyze the inverse problem of assembling planar shapes from two identical parts having partially `matching' boundaries and then use the insights gained on this topic to derive an efficient algorithm to solve the dissection puzzle in quite general situations.
Managing Service Systems with an Offline Waiting Option and Customer Abandonment
Authors: Vasiliki Kostami, Amy R. Ward
Venue: Manufacturing Service Operations Management (2009)

Many service providers offer customers the choice of either waiting in a line or going offline and returning at a dynamically determined future time. The best-known example is the FASTPASS® system at Disneyland. To operate such a system, the service provider must make an upfront decision on how to allocate service capacity between the two lines. Then, during system operation, he must provide estimates of the waiting times for both lines to each arriving customer. The estimation of offline waiting times is complicated by the fact that some offline customers do not return for service at their appointed time. We show that when demand is large and service is fast, for any fixed-capacity allocation decision, the two-dimensional process tracking the number of customers waiting in a line and offline collapses to one dimension, and we characterize the one-dimensional limit process as a reflected diffusion with linear drift. The analytic tractability of this one-dimensional limit process allows us to solve for the capacity allocation that minimizes average cost when there are costs associated with customer abandonments and queueing. We further show that in this limit regime, a simple scheme based on Little's Law to dynamically estimate in line and offline wait times is effective.
Medical Image Fusion Based on the Structure Similarity Match Measure
Authors: Zhang-Shu Xiao, Chong-Xun Zheng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In recent years, medical image fusion is extensively used to help doctors improve the accuracy of medical diagnosis by combining multimodality images acquired under different imaging conditions into a single one. Most of the previous methods aim at attaining information as many as possible from source images. However, some of the exacted information is not necessary or useful for medical diagnosis. As Marr’s vision stated, human visual system is being adapted for exacting structure features such as lines, edges, contours from the images. In this paper, we try to develop a new image fusion scheme based on structure similarity match measure (SSIM) to exact structure features from the input images to improve the accuracy of diagnosis. The visual experiments and quantitative assessments demonstrate the effectiveness of this method compared to present image fusion schemes.
Terminating Tableau Systems for Hybrid Logic with Difference and Converse
Authors: Mark Kaminski, Gert Smolka
Venue: Journal of Logic, Language and Information (2009)

This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.
A Study of Non-verbal Communication System by Using Pictograms
Authors: Makiko Okita, Yuuki Nakaura, Hidetsugu Suto
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

A communication system which uses pictograms to support interactive on- verbal communication is discussed. At first, a concept of "Pict-script" is introduced. Pict-script is a language using pictograms,and it has following features. (1) It has high flexibility. It can be used for not only consecutive expressions but also diagrammatic expressions. (2) It is usable by not only people with disabilities but also people in general. It can be used for various styles of communication. (3) Its output can indicate the user’s feelings. (4) It promotes communication. (5) A picture is not necessarily correspond to a word. Second, a communication system based on the concept of pict-script is proposed. Moreover, features of proposed system is discussed.
Reconfigurable Multicore Server Processors for Low Power Operation
Authors: Ronald G. Dreslinski, David Fick, David Blaauw, Dennis Sylvester, Trevor Mudge
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

With power becoming a key design constraint, particularly in server machines, emerging architectures need to leverage reconfigurable techniques to provide an energy optimal system. The need for a single chip solution to fit all needs in a warehouse sized server is important for designers. This allows for simpler design, ease of programmability, and part reuse in all segments of the server. A reconfigurable design would allow a single chip to operate efficiently in all aspects of a server providing both single thread performance for tasks requiring it, and efficient parallel processing helping to reduce power consumption. In this paper we explore the possibility of a reconfigurable server part and discuss the benefits and open questions still surrounding these techniques.
Enhancing research into usable privacy and security
Authors: Colin Birge
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

Researchers in technical communication and information design have important contributions to make to the field of usable privacy and security, also called user-centered security or trust user experience (TUX). I give some background on the usable privacy and security research field and literature, and suggest three example problems that may yield interesting results to SIGDOC researchers.
Approach to the Shortest Path with Fuzzy Constraints by Simulated Annealing Algorithm
Authors: Jie Su, Aihua Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

In supply-chain management, the constrained shortest path problem in a network has wide applications. In this paper, the optimality and algorithm of the shortest path with fuzzy constraints (noted as SPFC) is studied. Introducing the fuzzy objective weight of a path into the objective function, an integer fuzzy optimization model is established for the SPFC problem. Then a simulated annealing algorithm is given to solve the problem. And the numerical simulation of example demonstrates the feasibility and effectiveness of the approach.
A Fast Algorithm of the Optimal Smoothing Scheme for Transmitting Stored Video
Authors: Zilei Wang, Hongsheng Xi, Guo Wei
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Minimum changes bandwidth allocation (MCBA) is an optimal video transmission scheme resulting in the minimum number of rate changes with the minimum peak rate, which can reduce renegotiation frequency in statistical multiplexing service. The existing MCBA algorithm with searching frontiers, however, has a high computational complexity, which depressed the applicability of MCBA. In this paper, we design a fast algorithm of MCBA that examines for the bounded point based on the convex envelopes of the overflow and underflow curve. As a result, our algorithm can work out an MCBA scheme in a shorter time because we can find the bounded point with a linear complexity, and calculate each transmission rate within several iterations. The simulation using real video traces confirmed the philosophy and efficiency of our algorithm.
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
Authors: Wonhong Nam, Hyunyoung Kil, Jungjae Lee
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features. In this paper, in particular, we study the Quality of Services (QoS)-driven WSC problem to optimize service quality criteria, e.g., response time and/or throughput. We propose a novel solution based on Learning-based Depth First Search (LDFS). Given a set of web service descriptions including QoS information and a requirement web service, we reduce the QoS-driven WSC problem into a planning problem on a state-transition system. We then find the optimal solution for the problem using a dynamic programming based on LDFS which recently has shown a promising result.
Color Features Performance Comparison for Image Retrieval
Authors: Daniele Borghesani, Costantino Grana, Rita Cucchiara
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This paper proposes a comparison of color features for image retrieval. In particular the UCID image database has been employed to compare the retrieval capabilities of different color descriptors. The set of descriptors comprises global and spatially related features, and the tests show that HSV based global features provide the best performance at varying brightness and contrast settings.
New Wearable Body Sensor for Continuous Diagnosis of Internal Tissue Bleeding
Authors: Gaddi Blumrosen, Cesar A. Gonzalez, Boris Rubinsky
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

Continuous monitoring of internal bleeding in tissue is essential for assessment and treatment of medical conditions. In this study we present a new body sensor for diagnosis of internal tissue bleeding based on contact multi-frequency electromagnetic inductive measurements of the tissue. This contributes to the existing family of body network sensors. This sensor can be used in emergency medicine in the field, in a hospital, or during daily life for patients at risk of bleeding. Unlike other sensors that detect bleeding, this sensor is portable, low cost, non-invasive and does not require galvanic coupling between the electrode and the tissue under measurement. Our study includes description of the new body sensor, criteria for data processing, basic diagnostic algorithms and calibration techniques. We show feasibility of this new sensor with a sensor prototype and diagnosis of an experimental simulation of internal bleeding and hypoperfusion conditions in the brain.
Intelligent speed controller for a Switched Reluctance Motor drive using FPGA
Authors: S. Vijayan, S. Paramasivam
Venue: International Journal of Intelligent Systems Technologies and Applications (2009)

In this paper, an FPGA-based digital speed control scheme is presented to overcome the drawbacks in the previous speed control schemes, proposed for Switched Reluctance Motor (SRM) drives. It is based on discrete control algorithm, and requires simple mathematical models. The real-time experimental results given in this paper show that the closed-loop speed control method proposed could provide accurate speed control upto 6.2 rpm depending on the needed operating speed range, with a step response settling time of 0.25-1.05 s. It can also perform accurately at different operating conditions and over a wide range of speeds. Complete descriptions of the experimental system along with FPGA implementation are presented.
Apply Measurable Risk to Strengthen Security of a Role-Based Delegation Supporting Workflow System
Authors: Weili Han, Qun Ni, Hong Chen
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Workflow systems often use delegation to enhance the flexibility of authorization. However, using delegation also weakens security because users may have difficulties understand and design correct delegation policies. In this paper, we propose the Measurable Risk Adaptive Role-based Delegation (MRARD) framework to address this problem.MRARD employs measurable risk for SSOs (System Security Officers) to provide a complementary protection mechanism in role-based delegation supporting workflow systems. In MRARD, when another enterprise user wants to use a delegated role to execute a task, a fuzzy logic based inference processor will infer the risk level. Based on simple risk adaptive decision policies, a decision module will determine whether the access should be granted under a certain risk mitigation action.
A Federated Authorization Service for Bridging Learning Object Distribution Models
Authors: Jean-Noël Colin, Tien-Dung Le, David Massart
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

In a large federation of commercial learning object repositories, customers might be confronted to different access control procedures put in place by different content providers to enforce their respective distribution models. This paper proposes a federated authorization service that provides a uniform access to learning objects protected by different authorization protocols. This service is based on a learning object broker that mediates different distribution models.
Active algorithm selection
Authors: Feilong Chen, Rong Jin
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Most previous studies on active learning focused on the problem of model selection, i.e., how to identify the optimal classification model from a family of predefined models using a small, carefully selected training set. In this paper, we address the problem of active algorithm selection. The goal of this problem is to efficiently identify the optimal learning algorithm for a given dataset from a set of algorithms using a small training set. In this study, we present a general framework for active algorithm selection by extending the idea of the Hedge algorithm. It employs the worst case analysis to identify the example that can effectively increase the weighted loss function defined in the Hedge algorithm. We further extend the framework by incorporating the correlation information among unlabeled examples to accurately estimate the change in the weighted loss function, and Maximum Entropy Discrimination to automatically determine the combination weights used by the Hedge algorithm. Our empirical study with the datasets of WCCI 2006 performance prediction challenge shows promising performance of the proposed framework for active algorithm selection.
Can You See Me? The Use of a Binary Visibility Metric in Distance Bounding
Authors: Michelle Graham, David Gray
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Wireless networks are becoming more and more commonplace, with ubiquitous computing flourishing in this ever expanding environment. As this occurs, the demand for a reliable method of locating devices has also increased dramatically. Locating devices with no a prioi knowledge is a very large problem, requiring much special equipment. Instead, we focus on the issue of location verification, a smaller aspect of the location issue. Distance bounding is a well respected technique used in this area, however it relies on precise calculations to locate a device. We propose a method of locating a device which does not rely on these calculations. Instead, we employ a binary "yes/no" visibility metric, where neighbouring devices indicate whether they can "see" or communicate directly with the claiming device. We confirm the existence of a direct link through excluding the possibility of a proxied connection being employed. The intersection of the ranges of these devices can then be used to extract a location area, without relying on calculating exact distances through precise timings.
WEBSOM Method - Word Categories in Czech Written Documents
Authors: Roman Mouček, Pavel Mautner
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

We applied well-known WEBSOM method (based on two layer architecture) to categorization of Czech written documents. Our research was focused on the syntactic and semantic relationship within word categories of word category map (WCM). The document classification system was tested on a subset of 100 documents (manual work was necessary) from the corpus of Czech News Agency documents. The result confirmed that WEBSOM method could be hardly evaluated because humans have problems with natural language semantics and determination of semantic domains from word categories.
Globally Optimal Finsler Active Contours
Authors: Christopher Zach, Liang Shan, Marc Niethammer
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

We present a continuous and convex formulation for Finsler active contours using seed regions or utilizing a regional bias term. The utilization of general Finsler metrics instead of Riemannian metrics allows the segmentation boundary to favor appropriate locations (e.g. with strong image discontinuities) and suitable directions (e.g. aligned with dark to bright image gradients). Strong edges are not required everywhere along the desired segmentation boundary due to incorporation of a regional bias. The resulting optimization procedure is simple and efficient, and leads to binary segmentation results regardless of the underlying continuous formulation. We demonstrate the proposed method in several examples.
Neural Networks Based on Information Fusion Using for Avoiding Obstacle Robot
Authors: Guanshan Hu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The paper describes an indoor autonomous wheel robot which could move safely in an obstacle environment. The environment may involve any number of arbitrary shape and size obstacles, and the path may be very complex. We describe an approach to solving the motion-planning for mobile robot control by using neural networks based on information fusion technique. In the article, the physics model of the mobile robot was set up, and the sensors used in the avoiding obstacle of the mobile robot were selected. As the indoor environment information couldn’t be exact by single sensor, we proposed that using a multi-sensor system for the mobile robot avoiding obstacle. At last, we selected multiple ultrasonic sensors and infrared sensors. In order to predigest the calculation, the measurement data are to be classified and selected. The fuzzy neuron network information fusion based on the T-S model is used to avoid obstacle for the mobile robot, which fully utilized the information coming from the sensors. Finally, the experiment with the autonomous robot proved that the method is really feasible and efficient.
3D Ray Tracing Algorithm about Arbitrarily Shaped Particles Based on Triangular Patches
Authors: Wenying Yu, Yanjun Gong
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

An efficient method, which is called particle triangular patch scanning ray tracing algorithm on the basis of convex geometry (PTPSRTACG), is presented to specify an incident ray, its corresponding impinging points on the particle surface and propagating process inside the particle necessary to the ray tracing. It is applicable for a particle of arbitrary shape. This ray tracing method can contribute to scientific visualization and Interactive techniques and virtual reality.
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
Authors: M. Yamamoto, S. Kijima, Y. Matsui
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Bayesian image restoration in statistical mechanics. We study the distribution of Q-Ising on a two-dimensional square lattice over n vertices, that is, we deal with a discrete state space {1,...,Q} n for a positive integer Q. Employing the Q-Ising (having a parameter β) as a prior distribution, and assuming a Gaussian noise (having another parameter ¿), a posterior is obtained from the Bayes' formula. Furthermore, we generalize it: the distribution of noise is not necessarily a Gaussian, but any vertex-independent noise. We first present a Gibbs sampler from our posterior, and also present a perfect sampler by defining a coupling via a monotone update function. Then, we show O(nlogn) mixing time of the Gibbs sampler for the generalized model under a condition that β is sufficiently small (whatever the distribution of noise is). In case of a Gaussian, we obtain another more natural condition for rapid mixing that ¿ is sufficiently larger than β. Thereby, we show that the expected running time of our sampler is O(nlogn).