ppxscal/embedding_network huggingface dataset:
Application of an Improved A* Algorithm in Route Planning
Authors: Wen Cao, Hui Shi, Shulong Zhu, Baoshan Zhu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The A* algorithm is a kind of heuristic algorithm which has been used widely in route planning, and the heuristic function plays an important part in the algorithm. Through the analysis of the problems in A* algorithm, the paper makes some improvement for A* algorithm as bellow: one is that the cost function takes the distance and direction as two heuristic elements, and the paper solves the problem that they have different units by normalization; another is the paper uses an k-d tree structure in the implementation of the A* algorithm, loads the nodes information dynamically, and reduces consumption of the memory. The experimental results show that the efficiency of A* algorithm has been improved greatly.
On Low Distortion Embeddings of Statistical Distance Measures into Low Dimensional Spaces
Authors: Arnab Bhattacharya, Purushottam Kar, Manjish Pal
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

In this paper, we investigate various statistical distance measures from the point of view of discovering low distortion embeddings into low dimensional spaces. More specifically, we consider the Mahalanobis distance measure, the Bhattacharyya class of divergences and the Kullback-Leibler divergence. We present a dimensionality reduction method based on the Johnson-Lindenstrauss Lemma for the Mahalanobis measure that achieves arbitrarily low distortion. By using the Johnson-Lindenstrauss Lemma again, we further demonstrate that the Bhattacharyya distance admits dimensionality reduction with arbitrarily low additive error. We also examine the question of embeddability into metric spaces for these distance measures due to the availability of efficient indexing schemes on metric spaces. We provide explicit constructions of point sets under the Bhattacharyya and the Kullback-Leibler divergences whose embeddings into any metric space incur arbitrarily large distortions. To the best of our knowledge, this is the first investigation into these distance measures from the point of view of dimensionality reduction and embeddability into metric spaces.
Multimodal Shopping Lists
Authors: Jhilmil Jain, Riddhiman Ghosh, Mohamed Dekhil
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

In this paper we present a prototype for creating shopping lists using multiple input devices such as desktop, smart phones, landline or cell phones and in multimodal formats such as structured text, audio, still images, video, unstructured text and annotated media. The prototype was used by 10 participants in a two week longitudinal study. The goal was to analyze the process that users go through in order to create and manage shopping related projects. Based on these findings, we recommend desirable features for personal information management systems specifically designed for managing collaborative shopping lists.
Study on Algorithm and Communication Protocol of Differential GPS Positioning Based on Pseudorange
Authors: Xu Yinglei, Li Qunzhan, Xie Shaofeng, Zhang Liyan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper presents a method of GPS differential positioning based on pseudorange. Both the generation and encoding of differential data based on pseudorange and differential data transmission protocol based on Interne are mainly discussed in the paper. An improved communication protocol is proposed which can decrease the transmission quantity without changing the differential positioning accuracy. The comparison between original data and coding data and the improved coding data are tested by instantiations. Experimental results show the modified coding method decrease the transmitted data amounts compared with the point positioning. When there are more than 9 satellites, the transmission quality acquired by this advanced communication protocol is only 70 percent of the RTCM protocol and the accuracy of the differential position is greatly improved.
Mining Violations to Relax Relational Database Constraints
Authors: Mirjana Mazuran, Elisa Quintarelli, Rosalba Rossato, Letizia Tanca
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Frequent constraint violations on the data stored in a database may suggest that the represented reality is changing, and thus the database does not reflect it anymore. It is thus desirable to devise methods and tools to support (semi-)automatic schema changes, in order for the schema to mirror the new situation. In this work we propose a methodology and the RELACS tool, based on data mining, to maintain the domain and tuple integrity constraints specified at design time, in order to adjust them to the evolutions of the modeled reality that may occur during the database life. The approach we propose allows to isolate frequent and meaningful constraint violations and, consequently, to extract novel rules that can be used to update or relax the no longer up-to-date integrity constraints.
Product Configuration Based on CBR and CSP
Authors: Yan-hong Qin, Guang-xing Wei
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

As an effective method to associate customer need with customized product, customer-driven product configuration is essential to achieve mass customization. Based on analyzing the character and drawbacks of various product configuration methods, a configuration approach based on case-based reasoning (CBR) and constraint satisfaction problem (CSP) is proposed to configure product. First, the product configuration problem is denoted as CSP and the matching cases are retrieved by CBR to offer the CSP initialized solution. Then, the min-conflicts repair algorithm is applied to solve CSP and realize the adaptation of case at the same time.
Mining the Temporal Dimension of the Information Propagation
Authors: Michele Berlingerio, Michele Coscia, Fosca Giannotti
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possible related topics, the study of the information propagation in a network attracted the interest of many researchers, also from the industrial world. However, only a few answers to the questions "How does the information propagates over a network, why and how fast?" have been discovered so far. On the other hand, these answers are of large interest, since they help in the tasks of finding experts in a network, assessing viral marketing strategies, identifying fast or slow paths of the information inside a collaborative network. In this paper we study the problem of finding frequent patterns in a network with the help of two different techniques: TAS (Temporally Annotated Sequences) mining, aimed at extracting sequential patterns where each transition between two events is annotated with a typical transition time that emerges from input data, and Graph Mining, which is helpful for locally analyzing the nodes of the networks with their properties. Finally we show preliminary results done in the direction of mining the information propagation over a network, performed on two well known email datasets, that show the power of the combination of these two approaches.
Visual Search Strategies of Tag Clouds - Results from an Eyetracking Study
Authors: Johann Schrammel, Stephanie Deutsch, Manfred Tscheligi
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Tag clouds have become a frequently used interaction technique in the web in the past couple of years. Research has shown the influence of variables such as tag size and location on the perception of tag clouds. However, several questions remain unclear. First, little is know on how tag clouds are perceived visually and which search strategies users apply when looking for tags in a tag cloud. Second, there are variables, especially tag location, were prior work comes to conflicting results. Third, several approaches to present tag clouds with the tags semantically clustered have been proposed recently. However, it remains unclear which effects these new approaches have on the perception of tag clouds. In this paper we report the results of an extensive study on the perception of tag clouds using eye tracking technology that allows answering these questions.
Collective Content as a Facilitator of Community Interaction: A User Study of Four Close-Knit Communities
Authors: Thomas Olsson, Hannu Toivola, Minna Wäljas, Kaisa Väänänen-Vainio-Mattila, Jaakko Lehikoinen
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Social online services offer communities means for creating and using media content together. The content is jointly used for maintaining relationships and constructing common memories and experiences. Thus, it is very collective by nature. However, few studies have focused on the ways in which communities interact with such collective content. We conducted a field study on how four communities create, share, and use content together in order to understand the role of content as part of the social interaction. As the main result, we present the snowball effect of interaction. It is based on the reciprocity of participating and giving feedback. We also found that the creation of light content plays a role in maintaining the active interaction with content.
Optic Flow Using Multi-scale Anchor Points
Authors: Pieter Dorst, Bart Janssen, Luc Florack, Bart M. Haar Romeny
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We introduce a new method to determine the flow field of an image sequence using multi-scale anchor points. These anchor points manifest themselves in the scale-space representation of an image. The novelty of our method lies largely in the fact that the relation between the scale-space anchor points and the flow field is formulated in terms of soft constraints in a variational method. This leads to an algorithm for the computation of the flow field that differs fundamentally from previously proposed ones based on hard constraints. We show a significant performance increase when our method is applied to the Yosemite image sequence, a standard and well-established benchmark sequence in optic flow research. 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
Cross-document event coreference: annotations, experiments, and observations
Authors: Amit Bagga, Breck Baldwin
Venue: Proceedings of the Workshop on Coreference and its Applications (1999)

We have developed cross document event tracking technology that extends our earlier efforts in cross document person coreference. The software takes class of events, like "resignations" and clusters documents that mention resignations into equivalence classes. Documents belong to the same equivalence class if they mention the same "resignation" event, i.e. resignations involving the same person, time, and organization. Other events evaluated include "elections" and "espionage" events. Results range from 45--90% F-measure scores and we present a brief interannotator study for the "elections" data set.
A Novel Efficient Method for Conflicts Set Generation for Model-Based Diagnosis
Authors: Amir Fijany, Anthony Barrett, Farrokh Vatan
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

In this paper we present a new efficient algorithmic method for generating the conflicts set for model-based diagnosis. Our new method combines the strength of the two different approaches proposed in the literature, that is, the Fault Detection and Isolation (FDI), which is based on automatic control theory and statistical decision theory, and the other one, known as DX, which is based on artificial intelligence techniques. The first building block in our method is a new efficient algorithm for generation of the complete set of Analytical redundancy Relations (ARRs) for the system in an implicit form. For the diagnosis, our method first performs (similar to DX approaches) a system simulation to calculate the expected values of the measurements. Any discrepancy, i.e., the difference between expected and actual value of measurement, would trigger our diagnosis process. To this end, only those ARRs which involve the measurement with discrepancy are checked for consistency which lead a to a significant reduction in the number of consistency checks usually performed by DX approaches. We demonstrate the efficiency of our new method by its application to several synthetic systems and compare it with that of GDE.
The Evaluation of Pharmaceutical Package Designs for the Elderly People
Authors: Akira Izumiya, Michiko Ohkura, Fumito Tsuchiya
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

In recent years, many medical accidents have been caused by the confusing designs of pharmaceutical packages and displays. For osteoporosis treatment, a common disorder of elderly females, improving display visibility and operability is especially important. However, since the osteoporosis drugs to be taken once a week are sold in various package designs, differences of viewability, understandability, and operability must be clarified from the differences of package design. We performed experiments as follows.
Configurable Design of Multimodal Non Visual Interfaces for 3D VE's
Authors: Fabio Felice, Giovanni Attolico, Arcangelo Distante
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

3D virtual environments (VE) require an advanced user interface to fully express their information contents. New I/O devices enable the use of multiple sensorial channels (vision, hearing, touch, etc.) to increase the naturalness and the efficiency of complex interactions. Haptic and acoustic interfaces extend the effective experience of virtual reality to visually impaired users. For these users, a multimodal rendering that matches the subjective characteristics and the personal abilities of individuals is mandatory to provide a complete and correct perception of the virtual scene. User feedbacks are critical since the design phase. This paper proposes an approach for the design of haptic/acoustic user interface to makes up the lack of visual feedback in blind users interaction. It increases the flexibility of the interface development by decoupling the multimodal rendering design from the VE geometric structure. An authoring tool allows experts of the knowledge domain (even without specific skills about the VE) to design the haptic/acoustic rendering of virtual objects.
An Adaptive Edge-Detection Method Based on the Canny Operator
Authors: Li Er-sen, Zhu Shu-long, Zhu Bao-shan, Zhao Yong, Xia Chao-gui, Song Li-hua
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

On the basis of analyzing the conventional Canny algorithm, this paper advanced an adaptive edge-detection method based on the canny operator. This method not only keeps the Canny’s good performance in good detection, good localization and only one response to a single edge, but also improves the capability of restraining the fake edge and the automaticity of edge-detection based on the Otsu’s thresholding method. Through experiments, it is demonstrated that the adaptive edge-detection method in this paper is very effective.
Do graphical overviews facilitate or hinder comprehension in hypertext?
Authors: Ladislao Salmerón, Thierry Baccino, Jose J. Cañas, Rafael I. Madrid, Inmaculada Fajardo
Venue: Computers Education (2009)

Educational hypertexts usually include graphical overviews, conveying the structure of the text schematically with the aim of fostering comprehension. Despite the claims about their relevance, there is currently no consensus on the impact that hypertext overviews have on the reader's comprehension. In the present paper we have explored how hypertext overviews might affect comprehension with regard to (a) the time at which students read the overview and (b) the hypertext difficulty. The results from two eye-tracking studies revealed that reading a graphical overview at the beginning of the hypertext is related to an improvement in the participant's comprehension of quite difficult hypertexts, whereas reading an overview at the end of the hypertext is linked to a decrease in the student's comprehension of easier hypertexts. These findings are interpreted in light of the Assimilation Theory and the Active Processing model. Finally, the key educational and hypertext design implications of the results are discussed.
Proceedings of the 7th International EAMT workshop on MT and other Language Technology Tools, Improving MT through other Language Technology Tools: Resources and Tools for Building MT
Venue: ACL Workshops (2003)

There is an ever-growing need for tools for translation, and Europe is envisaging a particular challenge with the enlargement of the European Union which will add 10--12 new languages.
Green IT For Dummies
Authors: Carol Baroudi, Jeffrey Hill, Arnold Reinhold
Venue: For Dummies (2009)

Green technology is not only good for the environment; its also good for your bottom line. If your organization is exploring ways to save energy and reduce environmental waste, Green IT For Dummies can help you get there. This guide is packed with cost-saving ways to make your company a leader in green technology. The book is also packed with case studies from organizations that have gone green, so you can benefit from their experience. Youll discover how to: Perform an energy audit to determine your present consumption and identify where to start greening Develop and roll out a green technology project Build support from management and employees Use collaboration tools to limit the need for corporate travel Improve electronic document management Extend hardware life, reduce data center floor space, and improve efficiency Formalize best practices for green IT, understand your companys requirements, and design an infrastructure to meet them Make older desktops and lighting fixtures more efficient with a few small upgrades Lower costs with virtual meetings, teleconferences, and telecommuting options Reduce your organizations energy consumption Youll also learn what to beware of when developing your green plan, and get familiar with all the terms relating to green IT. Green IT For Dummies starts you on the road to saving money while you help save the planet.
Video Object Segmentation Based on Disparity
Authors: Ouyang Xingming, Wei Wei
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

Disparity information enables a multi-layered representation of a video frame. But how to extract object attracting the users' interest is still to be considered. Based on the definition and estimation of image disparity, we propose an approach to segment video objects for video conference. Chrominance, luminance, position and other information are introduced to compute the saliency map, and the edge information is used to obtain the disparity map. Combining with the disparity estimation results, the layer representing the most interested object that contains most of conspicuity values can be easily segmented. The experimental results demonstrate this algorithm is capable of segmenting video object from sequences quite effectively.
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
Authors: Bin Fu, Angsheng Li, Liyu Zhang
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) ${\rm NE}\not\subseteq R^{{\rm NP}}_{n^{o(1)}-T}({\rm TALLY})$; (2)${\rm NE}\not\subseteq R^{SN}_m({\rm SPARSE})$; and (3) ${\rm NE}\not\subseteq {\rm P}^{{\rm NP}}_{n^k-T}/n^k$ for all k ¿ 1. Result (3) extends a previous result by Mocas to nonuniform reductions. We also investigate how different an NE-hard set is from an NP-set. We show that for any NP subset A of a many-one-hard set H for NE, there exists another NP subset A¿ of H such that A¿ ¿ A and A¿ ¿ A is not of sub-exponential density.
On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
Authors: O. P. Ferreira, P. R. Oliveira, R. C. Silva
Venue: Journal of Global Optimization (2009)

The convergence of primal and dual central paths associated to entropy and exponential functions, respectively, for semidefinite programming problem are studied in this paper. It is proved that the primal path converges to the analytic center of the primal optimal set with respect to the entropy function, the dual path converges to a point in the dual optimal set and the primal-dual path associated to this paths converges to a point in the primal-dual optimal set. As an application, the generalized proximal point method with the Kullback-Leibler distance applied to semidefinite programming problems is considered. The convergence of the primal proximal sequence to the analytic center of the primal optimal set with respect to the entropy function is established and the convergence of a particular weighted dual proximal sequence to a point in the dual optimal set is obtained.
Adaptive finite element mesh triangulation using self-organizing neural networks
Authors: H. Jilani, A. Bahreininejad, M. T. Ahmadi
Venue: Advances in Engineering Software (2009)

The finite element method is a computationally intensive method. Effective use of the method requires setting up the computational framework in an appropriate manner, which typically requires expertise. The computational cost of generating the mesh may be much lower, comparable, or in some cases higher than the cost associated with the numeric solver of the partial differential equations, depending on the application and the specific numeric scheme at hand. The aim of this paper is to present a mesh generation approach using the application of self-organizing artificial neural networks through adaptive finite element computations. The problem domain is initially constructed using the self-organizing neural networks. This domain is used as the background mesh which forms the input for finite element analysis and from which adaptive parameters are calculated through adaptivity analysis. Subsequently, self-organizing neural network is used again to adjust the location of randomly selected mesh nodes as is the coordinates of all nodes within a certain neighborhood of the chosen node. The adjustment is a movement of the selected nodes toward a specific input point on the mesh. Thus, based on the results obtained from the adaptivity analysis, the movement of nodal points adjusts the element sizes in a way that the concentration of elements will occur in the regions of high stresses. The methods and experiments developed here are for two-dimensional triangular elements but seem naturally extendible to quadrilateral elements.