ppxscal/embedding_network huggingface dataset:
RDFKB: efficient support for RDF inference queries and knowledge management
Authors: James P. McGlothlin, Latifur R. Khan
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

RDFKB (Resource Description Framework Knowledge Base) is a relational database system for RDF datasets which supports inference and knowledge management. Significant research has addressed improving the performance of queries against RDF datasets. Generally, this research has not addressed queries against inferred knowledge. Solutions which do support inference queries have done so as part of query processing. Ontologies define the rules that govern inference for RDF datasets. These inference rules can be applied to RDF datasets to derive additional facts through methods such as subsumption, symmetry and transitive closure. We propose a framework that supports inference at data storage time rather than as part of query processing. The dataset is increased to include all knowledge whether explicitly specified or derived through inference with a negligible overhead. Queries against inferred data are simplified, and performance is increased.
Motivation and Context-Based Multi-Robot Architecture for Dynamic Task, Role and Behavior Selections
Authors: Dong-Hyun Lee, Jong-Hwan Kim
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

This paper proposes a multi-robot coordination architecture for dynamic task, role and behavior selections. The proposed architecture employs the motivation of task, the utility of role, a probabilistic behavior selection and a team strategy for efficient multi-robot coordination. Multiple robots in a team can coordinate with each other by selecting appropriate task, role and behavior in adversarial and dynamic environment. The effectiveness of the proposed architecture is demonstrated in dynamic environment robot soccer by carrying out computer simulation and real environment.
Change detection in rainfall and temperature patterns over India
Authors: Shivam Tripathi, Rao S. Govindaraju
Venue: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data (2009)

The changes in rainfall and temperature patterns over India were detected using Mann-Kendall trend test, Bayesian change point analysis, and a hidden Markov model. A regionalization method was developed to identify homogeneous regions that experience similar weather states. The regionalization helped in finding contiguous regions with strong change signals. The data were investigated at different temporal and spatial resolution to explore the nature of changes. The study found that all India summer monsoon is stable, but the winter or the north-east monsoon is gradually intensifying. It also detected an abrupt drop in the winter and spring temperature over north-central India and a gradual increase in the summer temperature over the peninsular India. Robustness of the detected changes were evaluated using recent reanalysis datasets.
Re-photography and Environment Monitoring Using a Social Sensor Network
Authors: Paul Chippendale, Michele Zanin, Claudio Andreatta
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This paper presents a technology capable of enabling the creation of a diffuse, calibrated vision-sensor network from the wealth of socially generated geo-referenced imagery, freely available on the Internet. Through the implementation of an accurate image registration system, based on image processing, terrain modelling and subsequent correlation, we will demonstrate how images taken by the public can potentially be used as a mean to gather environmental information from a unique, ground-level viewpoint normally denied non-terrestrial sensors (consider vertical or overhanging cliffs). Moreover, we will also show this registration technology can be used to synthesize new views using sections of photos taken from a variety of places and times.
The Secret Art of Computer Programming
Authors: Annabelle K. Mciver
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

"Classical" program development by refinement [12,2,3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corresponding specification. Until recently the method has not extended to security-style properties, principally because classical refinement semantics is inadequate in security contexts [7].The Shadow semantics introduced by Morgan [13] is an abstraction of probabilistic program semantics [11], and is rich enough to distinguish between refinements that do preserve noninterference security properties and those that don't. In this paper we give a formal development of Private Information Retrieval [4]; in doing so we extend the general theory of secure refinement by introducing a new kind of security annotation for programs.
Audio Bubbles: Employing Non-speech Audio to Support Tourist Wayfinding
Authors: David Mcgookin, Stephen Brewster, Pablo Priego
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

We introduce the concept of Audio Bubbles - virtual spheres filled with audio that are geocentered on physical landmarks, providing navigational homing information for a user to more easily locate the landmark. We argue that the way in which tourists navigate is not well supported by traditional visual maps, and that Audio Bubbles better support the serendipitous discovery and homing behaviours exhibited in such tourist activities. We present a study comparing Audio Bubbles to a visual map in a real world navigation task. Navigation with Audio Bubbles appeared to be faster and was preferred by most of the participants. We discuss the findings and outline our future development plans.
Software-Agents for On-Demand Authoring of Mobile Augmented Reality Applications
Authors: Rafael Radkowski
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

The paper presents an concept for the automatic authoring of augmented reality (AR) applications. The approach is based on software agents that provide different functions and content on demand for an AR application. Autonomous software agents encapsulate the specific functions of an AR application. It is distinguished between two kinds of software agents: So called provider-agents and user-agents. The user agent is configured by a human user, the provider-agent provides the functionality of an AR application. By communication and cooperation, provider and user agents form an AR application. The AR-based concept has been tested with the agent platform JADE.
A New Approach to Hybrid Condition Attribute Reduction Based on Rough Set
Authors: Jianwei Gao, Wu He
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

We focus on hybrid condition attribute reduction based on rough set. Generally, the process of attribute reduction from a large information system is time consuming. Since its computational complexity increases exponentially with the number of input variables and in multiplication with the size of data patterns, we develop a new approach to attribute reduction by using rough set to deal with the problem. In contrast to traditional attribute reduction, we take advantage of the reduction of the scale of the boundary region of the elementary sets induced by decision attributes. Finally, a example is presented to examine the approach and is derived a sound result.
Cross-Layer Service Discovery Using Multi-Path for Wireless Environments
Authors: Moon Jeong Kim, Young Ik Eom
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Efficient service discovery mechanism is a crucial feature for the usability of a wireless ad-hoc network. A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. We propose an efficient service discovery mechanism using link/node non-disjoint multi-path source routing protocol for pervasive environments. Multi-path routing techniques can operate more quickly and adaptively when route failure occurs. Cross-layer technique can reduce the number of messages because nodes perform to search a service and to find the route at once. Our scheme has advantages of not only multi-path routing protocol but also cross-layer service discovery. This scheme provides faster route recovery and lower route maintenance overhead by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.
The Evaluation Method of Water Resources Utilazation Sustainbility: A Case Study of Tianjin
Authors: Xuehua Zhang, Zhang Yang, Yuan Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Correct evaluation water resources sustainability of a city or an area is one of the most important way to understand the development potential of it. The paper introduced the concept of social adaptive ability, established a social index system and evaluation method of water resources scarcity, and took Tianjin as a case to evaluate water resources sustainability of it from 1998 to 2006. The results showed that during this period Tianjin was in an extreme shortage of water resources, but due to the social adaptive ability support, the condition of water scarcity had been improved a lot.
Open text semantic parsing using FrameNet and WordNet
Authors: Lei Shi, Rada Mihalcea
Venue: Demonstration Papers at HLT-NAACL 2004 on XX (2004)

This paper describes a rule-based semantic parser that relies on a frame dataset (FrameNet), and a semantic network (WordNet), to identify semantic relations between words in open text, as well as shallow semantic features associated with concepts in the text. Parsing semantic structures allows semantic units and constituents to be accessed and processed in a more meaningful way than syntactic parsing, moving the automation of understanding natural language text to a higher level.
Intelligent Biometric System using PCA and R-LDA
Authors: Anupam Shukla, Joydip Dhar, Chandra Prakash, Dhirender Sharma, Rishi Kumar Anand, Sourabh Sharma
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The paper presents a novel biometric authentication approach using Principal Component Analysis (PCA), Regularized-Linear Discriminant Analysis (R-LDA) and supervised neural networks. Low dimensional feature vectors of human face images are required to drive neural networks effectively. After histogram equalization process each image is presented to PCA or R-LDA for normalization and dimension reduction. The preprocessing steps of PCA or R-LDA produce Low dimensional feature vectors appropriate for training. Neural network has a great deal of nerve cell and can accomplish parallel distributing operation. Back Propagation (BP), Radial Basis Function(RBF) & Learning Vector Quantization (LVQ) are used as classifiers. The analysis of obtained results shown that R-LDA preprocessed feature vectors driven by supervised neural networks are having better recognition performance than PCA. While among supervised neural networks RBF gave most matched output during testing.
Understanding the Search Interfaces of the Deep Web Based on Domain Model
Authors: XiaoJie Yuan, HuiBin Zhang, ZongYun Yang, YanLong Wen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The web has been rapidly deepened by many searchable databases online recently. Those databases can be accessed through form-based search interfaces that allow users to specify query conditions. For integrating Web databases, the very first challenge is to understand the search interface. Such a search interface can be considered as an interface schema with multiple attributes, however, the interface is created autonomously and its schema is not defined in HTML which makes the schema extraction of an interface a challenge task. In this paper, we propose a novel approach to automatic extraction of the logic attributes from search interfaces. First, we define a domain model for each deep web domain as a global schema to guide the extraction process of the interface schema; second, we group the labels belonging to the same attribute of an interface, and produce a label tree of the interface; third, we find the related label of each element if it has one; last, we merge the results of the former two steps to complete the schema extraction. The last three steps are implemented based on the domain model. Our experiments show the promise of this approach-it achieves above 96.87% accuracy for extracting query attributes.
Control structures for software agents
Authors: Hongjun Song
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Control Structure is one of the most important issues which has to be addressed while designing and developing a software agent system. Based on the research and development of several agent systems, this thesis describes new agent architectures and a number of general principles. 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
The Identified Model of the Strength of Competition-Cooperation Relationship between Enterprises
Authors: Li Gang, Du Zhi-tao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The competition relationship between enterprises is not necessarily mutually exclusive with their cooperation one, but unified. Competition is the same as Cooperation in essence but different from each other in the expression of external form, which is the different relationship strength under different external constraints and internal force between enterprises. The Strength of Competition-Cooperation Relationship (SCCR) is a spectrum from the closest integration relationship to the most competitive hostile relationship; between the two extremes there are super-strong cooperation, strong cooperation, weak cooperation, weak correlation, weak competition, strong competition and super-strong competition in sequence. In this study, the authors construct the indicator system of SCCR judgment from the following five dimensions: Commitment validity, Strength of interaction, Strength of resource reliance (competition), Emotional depth Benefit degree, and build a SCCR identified model based on AHP (analytic hierarchy process ) and FCE (fuzzy comprehensive evaluation).
Formal Validation of OFEPSP+ with AVISPA
Authors: Jorge L. Hernandez-Ardieta, Ana I. Gonzalez-Tablas, Benjamin Ramos
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Formal validation of security protocols is of utmost importance before they gain market or academic acceptance. In particular, the results obtained from the formal validation of the improved Optimistic Fair Exchange Protocol based on Signature Policies (OFEPSP+) are presented. OFEPSP+ ensures that no party gains an unfair advantage over the other during the protocol execution, while substantially reducing the probability of a successful attack on the protocol due to a compromise of the signature creation environment. We have used the Automated Validation of Internet Security Protocols and Applications (AVISPA) and the Security Protocol ANimator for AVISPA (SPAN), two powerful automated reasoning technique tools to formally specify and validate security protocols for the Internet.
Fixed in time and "time in motion": mobility of vision through a SenseCam lens
Authors: Siân E. Lindley, Richard Harper, Dave Randall, Maxine Glancy, Nicola Smyth
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

SenseCam is an automatic wearable camera, often seen as a tool for the creation of digital memories. In this paper, we report findings from a field trial in which SenseCams were worn by household members over the course of a week. In interviews with these users, it became apparent that the way in which SenseCam images were played back, the manner of which might be described as a stilted movie, affected the values that were realised within them. The time-lapse nature of the image stream led participants to romanticise the mundane and find sentimentality in unexpected places, and was particularly effective at portraying personality and play. In so doing, SenseCam images enlivened the visual recording of everyday scenes. These values influenced what the participants sought to capture and view, and have implications for technologies that might support lifelogging or the development of user-generated content.
Multimodal Interaction: Intuitive, Robust, and Preferred?
Authors: Anja B. Naumann, Ina Wechsung, Jörn Hurtienne
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We investigated if and under which conditions multimodal interfaces (touch, speech, motion control) fulfil the expectation of being superior to unimodal interfaces. The results show that the possibility of multimodal interaction with a handheld mobile device turned out to be more intuitive, more robust, and more preferred than the interaction with the individual modalities speech and motion control. However, it was not clearly superior to touch.
On the power of top-down branching heuristics
Authors: Matti Järvisalo, Tommi Junttila
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying the style of branching and (ii) enforcing dynamic restrictions on the decision heuristics. Considering DPLL both with and without clause learning, we present a relative efficiency hierarchy for refinements of DPLL resulting from combinations of decision heuristics (top-down restricted, justification restricted, and unrestricted heuristics) and branching styles (typical DPLL-style and ATPG-style branching). An an example, for DPLL without clause learning, we establish a strict hierarchy, with the ATPG-style, justification restricted branching variant as the weakest system.
Performance confidence estimation for automatic summarization
Authors: Annie Louis, Ani Nenkova
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We address the task of automatically predicting if summarization system performance will be good or bad based on features derived directly from either single- or multi-document inputs. Our labelled corpus for the task is composed of data from large scale evaluations completed over the span of several years. The variation of data between years allows for a comprehensive analysis of the robustness of features, but poses a challenge for building a combined corpus which can be used for training and testing. Still, we find that the problem can be mitigated by appropriately normalizing for differences within each year. We examine different formulations of the classification task which considerably influence performance. The best results are 84% prediction accuracy for single- and 74% for multi-document summarization.
Synchronization of Regular Automata
Authors: Didier Caucal
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages. When the synchronizing automaton is unambiguous, the class of its synchronized languages forms an effective boolean algebra lying between the classes of regular languages and unambiguous context-free languages. We additionally provide sufficient conditions for such classes to be closed under concatenation and its iteration. 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
Reference analysis for Birnbaum-Saunders distribution
Authors: Ancha Xu, Yincai Tang
Venue: Computational Statistics Data Analysis (2010)

In this paper we consider the Bayesian estimators for the unknown parameters of the Birnbaum-Saunders distribution under the reference prior. The Bayesian estimators cannot be obtained in closed forms. An approximate Bayesian approach is proposed using the idea of Lindley and Gibbs sampling procedure is also used to obtain the Bayesian estimators. These results are compared using Monte Carlo simulations with the maximum likelihood method and another approximate Bayesian approach Laplace's approximation. Two real data sets are analyzed for illustrative purposes.
A Flexibility-Based Damage Identification Method Using Ambient Modal Data
Authors: Q. W. Yang, C. H. Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Structural damage identification using ambient vibration modes has become a very important research area in recent years. The main issue surrounding the use of ambient vibration modes is the mass normalization of the measured mode shapes. This paper presents a promising approach that extends the flexibility sensitivity technique to tackle the ambient vibration case. By introducing the mass normalization factors, manipulating the flexibility sensitivity equation, the unknown damage parameters and mass normalization factors can be computed simultaneously by the least-square technique. The effectiveness of the proposed method is illustrated using simulated data with measurement noise on a steel truss structure. The results show the good efficiency and stability of the proposed method on the identification of damage on more than one element. It has been shown that the proposed procedure is simple to implement and may be useful for structural damage identification under ambient vibration case.
The Scope, Scale and Agglomeration Economies of China's Provincial Electronic Information Manufacturing Industry
Authors: Lei Ping, Zhao Lianrong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Based on panel data of China’s provincial electronic information manufacturing industry since 2002, this paper discussed the Marshallian externalities, relatives industries convergence externalities and Jacobs externalities, found that at the provincial level, there are strong scale economies and Jacobs externalities, however, there are Marshallian externalities and relatives industries convergence externalities which should be strong in high technology industries, that is to say there are no economic advantages in China’s electronic information manufacturing industry agglomeration provincially, farther research in industry structure reveals that China’s electronic information industry mainly controlled by FDI and strongly influenced by global market, low local embeddedness is the main reason of industry structure appearance.