ppxscal/embedding_network huggingface dataset:
MICA: a probabilistic dependency parser based on tree insertion grammars application note
Authors: Srinivas Bangalore, Pierre Boulllier, Alexis Nasr, Owen Rambow, Benoît Sagot
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

MICA is a dependency parser which returns deep dependency representations, is fast, has state-of-the-art performance, and is freely available.
MusicCommentator: Generating Comments Synchronized with Musical Audio Signals by a Joint Probabilistic Model of Acoustic and Textual Features
Authors: Kazuyoshi Yoshii, Masataka Goto
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

This paper presents a system called MusicCommentator that suggests possible comments on appropriate temporal positions in a musical audio clip. In an online video sharing service, many users can provide free-form text comments for temporal events occurring in clips not for entire clips. To emulate the commenting behavior of users, we propose a joint probabilistic model of audio signals and comments. The system trains the model by using existing clips and users' comments given to those clips. Given a new clip and some of its comments, the model is used to estimate what temporal positions could be commented on and what comments could be added to those positions. It then concatenates possible words by taking language constraints into account. Our experimental results showed that using existing comments in a new clip resulted in improved accuracy for generating suitable comments to it.
L3S at INEX 2008: Retrieving Entities Using Structured Information
Authors: Nick Craswell, Gianluca Demartini, Julien Gaugaz, Tereza Iofciu
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

Entity Ranking is a recently emerging search task in Information Retrieval. In Entity Ranking the goal is not finding documents matching the query words, but instead finding entities which match those requested in the query.In this paper we focus on the Wikipedia corpus, interpreting it as a set of entities and propose algorithms for finding entities based on their structured representation for three different search tasks: entity ranking, list completion, and entity relation search. The main contribution is a methodology for indexing entities using a structured representation. Our approach focuses on creating an index of facts about entities for the different search tasks. More, we use the category structure information for improving the effectiveness of the List Completion task.
Accurate 3D Modelling by Fusion of Potentially Reliable Active Range and Passive Stereo Data
Authors: Yuk Hin Chan, Patrice Delmas, Georgy Gimel'Farb, Robert Valkenburg
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Possibilities of more accurate digital modelling of 3D scenes by fusing 3D range data from an active hand-held laser scene scanner developed in IRL and passive stereo data from stereo pairs of images of the scene collected during the scanning process are discussed. Complementary properties of two data sources allow for improving a 3D model by checking reliability of active range data and using it to adaptively guide passive stereo reconstruction. Experiments show that this avenue of the data fusion offers good prospects of error detection and correction. 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
Bridging the Gap between High-Level Reasoning and Low-Level Control
Authors: Ozan Caldiran, Kadir Haspalamutgil, Abdullah Ok, Can Palaz, Esra Erdem, Volkan Patoglu
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We present a formal framework where a nonmonotonic formalism (the action description language ${\cal C}+$) is used to provide robots with high-level reasoning, such as planning, in the style of cognitive robotics. In particular, we introduce a novel method that bridges the high-level discrete action planning and the low-level continuous behavior by trajectory planning. We show the applicability of this framework on two LEGO MINDSTORMS NXT robots, in an action domain that involves concurrent execution of actions that cannot be serialized.
Text Document Classification and Pattern Recognition
Authors: Qin Wu, Eddie Fuller, Cun-Quan Zhang
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In this extended abstract, a novel approach is proposed for text pattern recognition. Instead of the traditional models which are mainly based on the frequency of keywords for text document classification, we introduce a new graph theory model which is constructed based on both information about frequency and position of keywords. We applied this new idea to the detection of fraudulent emails written by the same person, and plagiarized publications. The results on these case studies show that this new method performs much better than traditional methods.
De-noising by Self-Adaptive Lifting Algorithm Based on Modulus Maximum Analysis
Authors: Wei Wang, Yingtang Zhang, Guoquan Ren
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

De-noising by the traditional wavelet transform, the result is affected by the choosing of wavelet base. Because the wavelet base is fixed in the traditional wavelet transform, either the smoothness or singularity of the signal can’t be fitted quite well. To overcome the limitation, a new self-adaptive lifting scheme based on modulus maximum analysis is presented. Modulus maximum sequence of the large scale wavelet coefficients can locate the point of the signal with big singularity precisely. According to the position of the point with big singularity, proper neighborhood is fixed, and prediction operator can be chosen self-adaptively. In this way, the prediction operator is fitted to the local feature of the signal. The simulation and engineering application showed that the proposed method could overcome the de-noising disadvantage of traditional wavelet transform. It not only can filter noise from original signal effectively but also can hold local characteristics of original signal in the de-noised signals．
Please touch the exhibits!: using NFC-based interaction for exploring a museum
Authors: Magdalena Blöckner, Svetlana Danti, Jennifer Forrai, Gregor Broll, Alexander De Luca
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Museums often use mobile devices and applications to let visitors explore their exhibits and interact with them in order to make the user experience more immersive and enjoyable. This paper presents a mobile museum guide based on the physical interaction with a dynamic NFC-display, consisting of a grid of NFC-tags and a projected GUI. Visitors can browse tours on the public display, download them onto their mobile devices and use them for the exploration of the museum. The paper presents the design of the museum guide, a first prototype and a preliminary evaluation of its usability and the interaction with a dynamic NFC-display.
Partial Solution and Entropy
Authors: Tadao Takaoka
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

If the given problem instance is partially solved, we want to minimize our effort to solve the problem using that information. In this paper we introduce the measure of entropy H(S) for uncertainty in partially solved input data S(X) = (X 1, ..., X k ), where X is the entire data set, and each X i is already solved. We use the entropy measure to analyze three example problems, sorting, shortest paths and minimum spanning trees. For sorting X i is an ascending run, and for shortest paths, X i is an acyclic part in the given graph. For minimum spanning trees, X i is interpreted as a partially obtained minimum spanning tree for a subgraph. The entropy measure, H(S), is defined by regarding p i = |X i |/|X| as a probability measure, that is, $H(S)=-n\Sigma_{i=1}^{k}p_i\log p_i$, where $n=\Sigma_{i=1}^k|X_i|$. Then we show that we can sort the input data S(X) in O(H(S)) time, and solve the shortest path problem in O(m + H(S)) time where m is the number of edges of the graph. Finally we show that the minimum spanning tree is computed in O(m + H(S)) time.
Optimised to Fail: Card Readers for Online Banking
Authors: Saar Drimer, Steven J. Murdoch, Ross Anderson
Venue: Financial Cryptography and Data Security: 13th International Conference, FC 2009, Accra Beach, Barbados, February 23-26, 2009. Revised Selected Papers (2009)

The Chip Authentication Programme (CAP) has been introduced by banks in Europe to deal with the soaring losses due to online banking fraud. A handheld reader is used together with the customer's debit card to generate one-time codes for both login and transaction authentication. The CAP protocol is not public, and was rolled out without any public scrutiny. We reverse engineered the UK variant of card readers and smart cards and here provide the first public description of the protocol. We found numerous weaknesses that are due to design errors such as reusing authentication tokens, overloading data semantics, and failing to ensure freshness of responses. The overall strategic error was excessive optimisation. There are also policy implications. The move from signature to PIN for authorising point-of-sale transactions shifted liability from banks to customers; CAP introduces the same problem for online banking. It may also expose customers to physical harm.
Stitching Planning in Laparoscopic Surgery: Towards Robot-assisted Suturing
Authors: Florent Nageotte, Philippe Zanne, Christophe Doignon, Michel De Mathelin
Venue: International Journal of Robotics Research (2009)

The work presented in this paper addresses the problem of the stitching task in laparoscopic surgery using a circular needle and a conventional four-degree-of-freedom needle holder. This task is particularly difficult for surgeons because of the kinematic constraints generated by the fulcrum in the abdominal wall of the patient. In order to assist the surgeons during suturing, we propose to compute possible paths for the needle through the tissues, which limit tissues deformation as much as possible while driving the needle towards the desired target. We propose a kinematic analysis and geometric modeling of the stitching task from which useful information can be obtained to assist the surgeon. The description of the task with appropriate state variables allows us to propose a simple practical method for computing optimal paths. Simulations show that the obtained paths are satisfactory even under difficult configurations and short computation times make the technique useful for intra-operative planning. The use of the stitching planning is shown for manual as well as for robot-assisted interventions in in vitro experiments.
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
Authors: Sun-Yuan Hsieh, Chang-De Wu
Venue: The Journal of Supercomputing (2009)

The star graph is viewed as an attractive alternative to the hypercube. In this paper, we investigate the Hamiltonicity of an n-dimensional star graph. We show that for any n-dimensional star graph (n¿4) with at most 3n¿10 faulty edges in which each node is incident with at least two fault-free edges, there exists a fault-free Hamiltonian cycle. Our result improves on the previously best known result for the case where the number of tolerable faulty edges is bounded by 2n¿7. We also demonstrate that our result is optimal with respect to the worst case scenario, where every other node of a cycle of length 6 is incident with exactly n¿3 faulty noncycle edges.
Bregman Divergences and Multi-dimensional Scaling
Authors: Pei Ling Lai, Colin Fyfe
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

We discuss Bregman divergences and the very close relationship between a class of these divergences and the regular family of exponential distributions before applying them to various topology preserving dimension reducing algorithms. We apply these to multidimensional scaling (MDS) and show the effect of different Bregman divergences. In particular we derive a mapping similar to the Sammon mapping. We apply these methods to face identification.
Measurement and mitigation of BitTorrent leecher attacks
Authors: Prithula Dhungel, Di Wu, Keith W. Ross
Venue: Computer Communications (2009)

In the recent past, anti-P2P companies have successfully curtailed the distribution of targeted content over a number of P2P file-sharing systems, including Kazaa and eDonkey. More recently, anti-P2P companies have begun to attack BitTorrent. In this paper, we analyze the resilience of BitTorrent leechers to two different kinds of attacks: the connection attack and the piece attack. We present the results of both passive and active measurements. Using passive measurements, we performed a detailed analysis of a recent album that is under attack, and identified the behavior of attackers. For our active measurements, we developed a crawler that contacts all the peers in any given swarm, determines whether the swarm is under attack, and identifies the attack peers in the swarm. We used the crawler to analyze 8 top box-office movies. Based on the measurement results, we discovered that BitTorrent architecture is fundamentally resilient to Internet leecher attacks. Finally, we also propose defense mechanisms to further mitigate the attacks and evaluate their effectiveness using trace-driven simulation.
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Authors: Yongxin Tong, Li Zhao, Dan Yu, Shilong Ma, Zhiyuan Cheng, Ke Xu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been proposed and studied. Recently, a novel sequential pattern mining research, called mining repetitive gapped subsequences, has attracted the attention of many researchers. However, the number of repetitive gapped subsequences generated by even these closed mining algorithms may be too large to understand for users, especially when support threshold is low. In this paper, we propose the problem of how to compress repetitive gapped sequential patterns. A novel distance measure of repetitive gapped sequential patterns and an efficient representative pattern checking scheme, ¿-dominate sequential pattern checking are proposed. We also develop an efficient algorithm, CRGSgrow ( Compressing Repetitive Gapped Sequential pattern grow), including an efficient pruning strategy, SyncScan. An empirical study with both real and synthetic data sets clearly shows that the CRGSgrow has good performance.
A Study on Machine Translation of Register-Specific Terms in Tea Classics
Authors: Jiang Xin, Zhao Lixin, Wu Di
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The rich heritage of Chinese tea culture has attracted an increasing number of people in the world, but the translating of such classical and specialized literature proves to be extremely arduous. Machine Translation (MT) is introduced to facilitate the decrypting process. However, when the popular online translation Systran is tried bi-directionally on a high-frequency wordlist from 24 ancient tea documents, the version reveals some defects, especially the recognition of register-specific terms. To address this elementary yet essential problem, a parallel translation corpus is constructed. Statistic method of automatic extraction is used to produce a bilingual inventory of equivalent term pairs. To further improve the efficiency of MT, a descriptive term database is built on the basis of the previous work. It is expected that, with contextual clues taken into the decrypting process, later machine-aided translation of documents in the special sphere could become more standardized, consistent and systematic.
Robust Pose Estimation for Outdoor Mixed Reality with Sensor Fusion
Authors: Zhiying Zhou, Jayashree Karlekar, Daniel Hii, Miriam Schneider, Weiquan Lu, Stephen Wittkopf
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

We present a sensor fusion based technique for outdoor augmented reality system for mobile devices using GPS, gyroscope, and geo-referenced 3D models of the urban environment. Geo-spatial interaction not only provides overlays of the existing environment but compliments with other data such as location-specific photos, videos and other information from different time periods enhancing the overall user experience of augmented reality. To provide robust pose estimation of the camera relative to the world coordinates, firstly, GPS and gyroscope are used to obtain the rough estimation. Secondly, model based silhouette tracking and sensor fusion approach is used to refine the rough estimation and to provide seamless media rich augmentation of 3D textured models.
The Application of Multi-serial-interface System in Small-Scale Monitoring Device Based on C8051f020
Authors: Sui Tao, Teng Jingzhong, Li Bing, Du Zuntong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The article introduces the application of multi-serial-interface system in small-scale monitoring device based on c8051f020,which can achieve the combination of serial equipment with a number of different features and requirements, and describes the configuration of the relevant hardware and software in detail.
AssetDivider: a new mediation tool in Australian family law
Authors: Emilia Bellucci
Venue: Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation (2008)

This article describes research in a new theory of decision support in negotiation in family law mediation. AssetDivider was based on the principles of Family_Winner. As a Negotiation Decision Support System Family_Winner takes ratings assigned to items by the parties involved and develops a list of allocations to each party; based on trade-offs inherently present in the dispute. Given advice provided from our industry partners Relationships Australia (Queensland) - RAQ, AssetDivider uses an ideal "percentage split" to guide the development of an allocation list for parties. The system has been tested informally by our contacts at RAQ, and we now look forward to extensive testing and evaluation by mediators at RAQ in the near future. We hope to report on a comprehensive evaluation which will report on the effectiveness of this program in practice.
Shape Classification Using a Flexible Graph Kernel
Authors: François-Xavier Dupé, Luc Brun
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junction or extremity of the branches. This graph is non simple since it can be composed of loops and multiple-edges. Within the shape comparison framework, such a graph is usually transformed into a simpler structure such as a tree or a simple graph hereby loosing major information about the shape. In this paper, we propose a graph kernel combining a kernel between bags of trails and a kernel between faces. The trails are defined within the original complex graph and the kernel between trails is enforced by an edition process. The kernel between bags of faces allows to put an emphasis on the holes of the shapes and hence on their genre. The resulting graph kernel is positive semi-definite on the graph domain.
Exploring Manual Interaction and Social Behaviour Patterns in Intensely Collaborative Teamwork
Authors: Natalie Ruiz, Kelvin Cheng, Markus Rittenbruch
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

This paper presents the results of a comparative study of 4-person collaborative teams working at a traditional table with pen and paper vs. a multi-touch table with digital keyboards and notepads. We compare the social behaviours of `giving' and `taking' during intensely collaborative teamwork, namely the differences between paper-based behaviour, digital-object based behaviour and a mixed condition behaviour where both paper and digital objects were used. Differences in sharing behaviour may be attributed to the degree of ownership afforded by digital objects on a touch display vs. paper objects. Additional visual metaphors to help tabletop users are recommended.
Implementing Human Factors within the Design Process of Advanced Driver Assistance Systems (ADAS)
Authors: Boris van Waterschoot, Mascha van der Voort
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

This paper introduces our research which aims to develop a design approach for ADAS applications in which human factors (including stakeholder feedback and objective performance measures) are explicitly accounted for. Since driving is part of a complex (traffic) system, with a large number of interacting components, ADAS design is confronted with choices for which the influence on the system, and the driving performance in particular, is not immediately manifested. Therefore, providing designers with relevant feedback during the design process, about the consequences of specific choices, will increase the efficiency and safety of driver assistance systems.
Improved Particle Swarm Optimization Based Fault Diagnosis Approach for Power Electronic Devices
Authors: Yan Yang, Ruqing Chen, Jinshou Yu, Ruqing Chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

294 fault states of 12-pulse waveform controlled rectifier circuit are studied. According to the fault voltage waveforms of rectifier, a special fault classification method is proposed. To enhance the performance of particle swarm optimization (PSO), a novel PSO with disturbance (DPSO) is put forward by introducing an evolution speed factor in standard PSO. Simulation results and comparisons with standard PSO show that DPSO enhances the searching efficiency and improves the searching quality effectively. Finally, DPSO is successfully applied in neural network fault diagnosis modeling.