ppxscal/embedding_network huggingface dataset:
A Polynomial Algorithm for Submap Isomorphism
Authors: Guillaume Damiand, Colin Higuera, Jean-Christophe Janodet, Émilie Samuel, Christine Solnon
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

In this paper, we address the problem of searching for a pattern in a plane graph, i.e., a planar drawing of a planar graph. To do that, we propose to model plane graphs with 2-dimensional combinatorial maps, which provide nice data structures for modelling the topology of a subdivision of a plane into nodes, edges and faces. We define submap isomorphism, we give a polynomial algorithm for this problem, and we show how this problem may be used to search for a pattern in a plane graph. First experimental results show the validity of this approach to efficiently search for patterns in images.
The First Two W's: Fostering Multicultural Awareness in Children
Authors: Noah Falstein, Nicolle Ruetz
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Online games and virtual worlds are playing an increasingly important role in many children's daily lives, while internet access continues to expand world wide. The confluence of these two trends is creating more opportunities to reach children of different cultural backgrounds throughout the world; to teach them in fun and engaging ways about cultural diversity, inspiring openness and acceptance of other ways of life. This goal lies along a path beset by many hurdles, but these can be overcome by significant technical, pedagogical, and business opportunities to create a positive social impact.
Applications and explanations of Zipf's law
Authors: David M. W. Powers
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

Recently I have been intrigued by the reappearance of an old friend, George Kingsley Zipf, in a number of not entirely expected places. The law named for him is ubiquitous, but Zipf did not actually discover the law so much as provide a plausible explanation. Others have proposed modifications to Zipf's Law, and closer examination uncovers systematic deviations from its normative form. We demonstrate how Zipf's analysis can be extended to include some of these phenomena.
An Efficient ID-Based Authenticated Key Exchange Protocol
Authors: Xuexian Hu, Wenfen Liu, Jianhui Zhang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

It's well known that the ID-based authenticated key exchange protocol is surprisingly difficult to design and prove, since it is difficult for simulator to fully support the SessionKeyReveal query without static private key. The purported security of many ID-based protocols is either based on heuristic security arguments or the protocols are proven secure in a restricted model. In this paper, we propose an efficient ID-based authenticated key exchange protocol, called EIDAKE, which is provably secure in the currently strongest AKE security model, the eCK model. The protocol achieves the efficiency of the most efficient ID-based AKE protocol in terms of exponentiation. Moreover, our protocol enjoys a simple and intuitive reduction.
A simple and effective hierarchical phrase reordering model
Authors: Michel Galley, Christopher D. Manning
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

While phrase-based statistical machine translation systems currently deliver state-of-the-art performance, they remain weak on word order changes. Current phrase reordering models can properly handle swaps between adjacent phrases, but they typically lack the ability to perform the kind of long-distance re-orderings possible with syntax-based systems. In this paper, we present a novel hierarchical phrase reordering model aimed at improving non-local reorderings, which seamlessly integrates with a standard phrase-based system with little loss of computational efficiency. We show that this model can successfully handle the key examples often used to motivate syntax-based systems, such as the rotation of a prepositional phrase around a noun phrase. We contrast our model with reordering models commonly used in phrase-based systems, and show that our approach provides statistically significant BLEU point gains for two language pairs: Chinese-English (+0.53 on MT05 and +0.71 on MT08) and Arabic-English (+0.55 on MT05).
Key Technology Research on Data Conversion between B-Rep Based CAD and VR Model
Authors: Xianguang Luo, Aiping Li, Xuemei Liu, Jun Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Too many polygon faces were produced if complicated cad model converts to virtual reality model while making use of the current data interface, it failed to meet with the real time requirement in virtual reality environment. In order to decreasing the number of the polygon faces at a proper precision of geometry model, the method was introduced to get the points data at the boundaries in the B-rep based cad model and realizing the algorithm from multi-loop plane regions to single loop regions; surface triangulation was realized by getting the points data and their turns in the uv parameter region of the surface. The algorithm has good effect in practice.
Learning graph walk based similarity measures for parsed text
Authors: Einat Minkov, William W. Cohen
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between them. We show that graph walks, combined with existing techniques of supervised learning, can be used to derive a task-specific word similarity measure in this graph. We also propose a new path-constrained graph walk method, in which the graph walk process is guided by high-level knowledge about meaningful edge sequences (paths). Empirical evaluation on the task of named entity coordinate term extraction shows that this framework is preferable to vector-based models for small-sized corpora. It is also shown that the path-constrained graph walk algorithm yields both performance and scalability gains.
Batik KR Semantic Network: Visualizations of Creative Process and Design Knowledge for the Malaysian Batik Designers' Community
Authors: Ariza Nordin, Nor Laila Noor, Ahmad Zainuddin
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)

Designing batik, a decorative textile is guided by insights acquired from the confluence of design and heritage knowledge accompanied by cultural and aesthetic constraints, resulting in the preservation of the designer's and regional identity embedded in the design artifact. Insights and inspiration are gained from stories, non-textual references of images and photographs from repositories of knowledge such as books and the Web, objects of nature, environmental phenomena, fashion trend and human events. In addition evaluating existing products may lead to the possibility of inspired innovation or repetition of successful design solutions. With surplus on inspirational data available today, batik designers requires knowledge visualization to gain insights for designing task. Reporting a qualitative approach, this paper described our findings as the Batik Knowledge Repository (KR) semantic network to enable knowledge visualization of creative process (task) and design (domain) knowledge for batik textile designers' community.
New Method for Suppressing Lift-Off Effects Based on Hough Transform
Authors: Wen-long Zhu, Han-xin Shen, Wen-xiang Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A major problem for crack or electromagnetic property measurement in eddy current detection technique is the lift-off effect. The nonzero value of lift-off distance tends to smear out the discontinuity in the detected signal, causing errors detection. The paper shows the test results of lift-off effect in normalized impedance plane. Curves are transformed to Hough plane by Hough transform and consequently the lift-off effect is suppressed effectively. The method is convenient to distinguish different electromagnetic characteristic of material which can be used to detect crack or other flaws in material.
Prying Data out of a Social Network
Authors: Joseph Bonneau, Jonathan Anderson, George Danezis
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Preventing adversaries from compiling significant amounts of user data is a major challenge for social network operators. We examine the difficulty of collecting profile and graph information from the popular social networking website Facebook and report two major findings. First, we describe several novel ways in which data can be extracted by third parties. Second, we demonstrate the efficiency of these methods on crawled data. Our findings highlight how the current protection of personal data is inconsistent with user's expectations of privacy.
Effect of Database Server Arrangement to the Performance of Load Balancing Systems
Authors: Jian-Bo Chen, Tsang-Long Pao, Kun-Dah Lee
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Load balancing architectures can be used to solve overloading problems on web sites. Recently, most of the contents of web pages are retrieved from a database. Thus, the arrangement of the database server in a load balancing architecture is one of the most important factors that impact the overall performance. In this paper, we analyze the performance of load balancing architectures with a centralized database arrangement and a decentralized database arrangement. With a series of experiments, we can find the most appropriate arrangement for the database server. The experimental results show that when the number of client requests is small, using the decentralized arrangement results in a lower average response time because no network communications are needed. But when the number of client requests is large, using the centralized database architecture can achieve higher performance because the database server can share the load of web servers.
Topic-Based Hard Clustering of Documents Using Generative Models
Authors: Giovanni Ponti, Andrea Tagarelli
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In this paper, we describe a framework for clustering documents according to their mixtures of topics. The proposed framework combines the expressiveness of generative models for document representation with a properly chosen information-theoretic distance measure to group the documents via an agglomerative hierarchical clustering scheme. The clustering solution obtained at each level of the dendrogram reflects an organization of the documents into sets of topics, while being produced without the effort needed for a soft/fuzzy clustering method. Experimental results obtained on large, real-world collections of documents evidence the effectiveness of our approach in detecting non-overlapping clusters that contain documents sharing similar mixtures of topics.
Design of an Assistance System for Elderly Based on Analyses of Needs and Acceptance
Authors: Stefan Lutherdt, Carsten Stiller, Katrin Lienert, Sabine Spittel, Fred Roß, Christoph Ament, Hartmut Witte
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The changing demography requires new kinds of support for elderly people. The project WEITBLICK aims to give seniors assistance to gather information about several services and their providers, relaying the access to such services and offer them in an individualized manner. To determine the requirements of elderly users a broad analysis will be performed in four stages. To fulfill the aims of the project the system has two principles incorporated: the service relay can be triggered by the users' former activities or by the users actively themselves. The base for both is a database with user and service profiles.
A finite-state turn-taking model for spoken dialog systems
Authors: Antoine Raux, Maxine Eskenazi
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

This paper introduces the Finite-State Turn-Taking Machine (FSTTM), a new model to control the turn-taking behavior of conversational agents. Based on a non-deterministic finite-state machine, the FSTTM uses a cost matrix and decision theoretic principles to select a turn-taking action at any time. We show how the model can be applied to the problem of end-of-turn detection. Evaluation results on a deployed spoken dialog system show that the FSTTM provides significantly higher responsiveness than previous approaches.
Private Capacities in Mechanism Design
Authors: Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The protocol can be regarded as an algorithm augmented with a suitable payment rule and the desired condition is termed truthfulness, meaning that it is never convenient for an agent to report false information.Motivated by the applications, we extend the usual one-parameter and multi-parameter settings by considering agents with private capacities: each agent can misreport her cost for "executing" a single unit of work and the maximum amount of work that each agent can actually execute (i.e., the capacity of the agent). We show that truthfulness in this setting is equivalent to a simple condition on the underlying algorithm. By applying this result to various problems considered in the literature (e.g., makespan minimization on related machines) we show that only some of the existing approaches to the case "without capacities" can be adapted to the case with private capacities. This poses new interesting algorithmic challenges.
On the Explorative Behavior of MAX---MIN Ant System
Authors: Daniela Favaretto, Elena Moretti, Paola Pellegrini
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

Analyzing the behavior of stochastic procedures is generally recognized to be relevant. A possible way for doing so consists in observing the exploration performed. A formalization in this sense is proposed here: A method for studying this aspect regardless the type of approach used is defined and tested. The consequent measure of exploration is applied to MAX---MIN Ant System: The impact of the values of the parameters on the exploration is assessed. The conclusions drawn are put in relation with the indications provided by the average ¿-branching factor.
Fine-Grained Access Control with Object-Sensitive Roles
Authors: Jeffrey Fischer, Daniel Marino, Rupak Majumdar, Todd Millstein
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Role-based access control (RBAC) is a common paradigm to ensure that users have sufficient rights to perform various system operations. In many cases though, traditional RBAC does not easily express application-level security requirements. For instance, in a medical records system it is difficult to express that doctors should only update the records of their own patients. Further, traditional RBAC frameworks like Java's Enterprise Edition rely solely on dynamic checks, which makes application code fragile and difficult to ensure correct.We introduce Object-sensitive RBAC (ORBAC), a generalized RBAC model for object-oriented languages. ORBAC resolves the expressiveness limitations of RBAC by allowing roles to be parameterized by properties of the business objects being manipulated. We formalize and prove sound a dependent type system that statically validates a program's conformance to an ORBAC policy. We have implemented our type system for Java and have used it to validate fine-grained access control in the OpenMRS medical records system.
Visualizing Thermal Traces to Reveal Histories of Human-Object Interactions
Authors: Tomohiro Amemiya
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Traces of human-object interactions remain on objects in the form of thermal information. This paper describes a human memory aid that exploits such traces to create a thermal `lifelog' of one's interactions with the environment, without disrupting ongoing activities and without any special apparatus or wires. The goal of the aid is to build a digitized surrogate memory to assist in recalling personal experiences. A system with an infrared camera that records the thermal traces left by human-object interactions was fabricated. Measurements obtained with this system can help us understand the nature of thermal traces and be used to develop thermal models that can describe the heat transfer process on object surfaces after contact.
Letters: Complex wavelet based texture classification
Authors: Yu-Long Qiao, Chun-Hui Zhao, Chun-Yan Song
Venue: Neurocomputing (2009)

Texture classification plays an important role in image analysis and understanding. The real wavelet based methods are deprived of the significant benefits of the phase information. Thus, the complex wavelet should be taken into account. This paper will combine the phase information and the magnitude information of the complex wavelet coefficient into a real measure to describe the intensity variation of a texture, and then model the measure with the real generalized Gaussian distribution (GGD). The model parameters serve as the texture feature during the classification. The experimental results on two benchmark texture databases demonstrate the superior performance of the new texture feature.
Fabrication and Characterization of Micro Opto-electronic Sensor
Authors: Qing-gang Liu, Zhi-hong Yan, Ling Zhao, Xiao-na Lou, Xiao-tang Hu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Tunneling junction is the basic structure of photoconductive semiconductor switch (PCSS) and single electric transistor (SET). In order to get ultra high speed PCSS, photo lithography and AFM nano oxidation methods are combined to fabricate micro metal (Ti)-insulator (TiOx)-metal (Ti) tunneling junction (MIM) type PCSS. Multi-junctions structure is tried to enhance the PCSS’s photoelectric efficiency. The I-V characteristics, such as effect of TiOx wire width on tunneling and effect of TiOx wire’s number on Tunneling of the tunneling junctions, are studied and analyzed in this paper. The results indicate that there is a clear exponential relationship between tunneling current and bias voltage and that different TiOx wire width and different numbers of TiOx wires induce different tunneling phenomena.
Improved placement for hierarchical FPGAs exploiting local interconnect resources
Authors: Valerij Matrose, Carsten Gremzow
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

The majority of networks subject to routing in almost every FPGA design consist of networks with only 2 to 4 terminals. These usually connect to directly adjacent logic cells. In order to make best use of this circumstance commercial FPGA architecture vendors provide dedicated local routing resources on the inter and intra logic block level. Previous routability-driven placement algorithms try to minimize utilization of global routing resources without taking local routing resources into account. This paper presents a new placement algorithm MPCPlace (Multipass Clustering and Placement) which makes specific use of local routing resources and hence reduces congestion on global routing resources and greatly improves overall routability in FPGA designs. The results obtained with the new placement algorithm will be compared to the SCPlace-Algorithm as well as the commercial Altera Quartus II software for various real world designs. The benchmark results at hand indicate for the new MPCPlace algorithm an average increase in routing resource utilization of up to 12.5% as well as a peak improvement of 10%.
Reconfigurable framework for adaptive OFDM transmission
Authors: Milan Zivkovic, Dominik Auras, Rudolf Mathar
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

Optimal utilization of radio resources (bandwidth, transmit power) in multicarrier based systems becomes very challenging due to coexistence of various wireless standards within the same frequency band. Proposed demonstration, implemented in GNU Radio framework, enables capacity achieving OFDM-based data transmission between two network nodes with optimally configured transmission parameters for given system constraints. Furthermore, a highly reconfigurable framework allows for implementation and evaluation of various transmission strategies for different classes of given requirements and various sets of controllable parameters.
Building Cooling Load Forecasting Model Based on LS-SVM
Authors: Li Xuemei, Lu Jin-hu, Ding Lixing, Xu Gang, Li Jibin
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

A number of different forecasting methods have been proposed for cooling load forecasting including historic method, real-time method, time series analysis, and artificial neural networks (ANN), but accuracy and time efficiency in prediction are a couple of contradictions to be hard to resolve for real-time traffic information prediction. In order to improve time efficiency of prediction, a new hourly cooling load prediction model and method based on Least Square Support Vector Machine (LS-SVM) is proposed in this paper. A comparison of the performance of LSSVM with back propagation neural network (BPNN) is carried out. Experiments results demonstrate that LSSVM can achieve better accuracy and generalization than the BPNN, the LSSVM predictor can reduce significantly both relative mean errors and root mean squared errors of cooling load.
Multilingual speech recognition for information retrieval in Indian context
Authors: N. Udhyakumar, R. Swaminathan, S. K. Ramakrishnan
Venue: Proceedings of the Student Research Workshop at HLT-NAACL 2004 on XX (2004)

This paper analyzes various issues in building a HMM based multilingual speech recognizer for Indian languages. The system is originally designed for Hindi and Tamil languages and adapted to incorporate Indian accented English. Language-specific characteristics in speech recognition frame work are highlighted. The recognizer is embedded in information retrieval applications and hence several issues like handling spontaneous telephony speech in real-time, integrated language identification for interactive response and automatic grapheme to phoneme conversion to handle Out Of Vocabulary words are addressed. Experiments to study relative effectiveness of different algorithms have been performed and the results are investigated.