ppxscal/embedding_network huggingface dataset:
Making the difference in semantic web service composition
Authors: Freddy Lécue, Alexandre Delteil
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. In this paper we propose a mean of performing automated Web service composition by exploiting semantic matchmaking between Web service parameters (i.e., outputs and inputs) to enable their connection and interaction. The key idea is that the matchmaking enables, at run time, finding semantic compatibilities among independently defined Web service descriptions. To this end, our approach extends existing methods in order to explain misconnections between Web services. From this we generate Web service compositions that realize the goal, satisfying and optimizing the semantic connections between Web services. Moreover a process of relaxing the hard constraints is introduced in case the composition process failed. Our system is implemented and interacting with Web services dedicated on a Telecom scenario. The preliminary evaluation results showed high efficiency and effectiveness of the proposed approach.
Neighbor discovery in wireless networks and the coupon collector's problem
Authors: Sudarshan Vasudevan, Donald Towsley, Dennis Goeckel, Ramin Khalili
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algorithm in a synchronous system, proposed in an earlier work. When nodes do not have a collision detection mechanism, we show that this algorithm reduces to the classical {\em Coupon Collector's Problem}. Consequently, we show that each node discovers all its $n$ neighbors in an expected time equal to $ne (\ln n + c)$, for some constant $c$. When nodes have a collision detection mechanism, we propose an algorithm based on receiver status feedback which yields a $\ln n$ improvement over the ALOHA-like algorithm. Our algorithms do not require nodes to have any estimate of the number of neighbors. In particular, we show that not knowing $n$ results in no more than a factor of two slowdown in the algorithm performance. In the absence of node synchronization, we develop asynchronous neighbor discovery algorithms that are only a factor of two slower than their synchronous counterparts. We show that our algorithms can achieve neighbor discovery despite allowing nodes to begin execution at different time instants. Furthermore, our algorithms allow each node to detect when to terminate the neighbor discovery phase.
Generation and Maintenance of Semantic Metadata for Personal Multimedia Document Management
Authors: Annett Mitschick, Klaus Meissner
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

Personal multimedia document management benefits from Semantic Web technologies. However, an ontology-based document management system has to meet a number of challenges regarding flexibility, soundness, and controllability of the semantic data model. This paper presents an integrated approach for ontology-based multimedia document management, which covers the process of automated modeling of semantic descriptions for multimedia objects and allows for the domain-specific customization of the used ontology. Furthermore, the proposed approach addresses the problems of data validation and consolidation to ensure semantic descriptions of proper quality. We demonstrate the practicability of our concept by a prototypical implementation of a service platform for personal information management applications.
Corrective models for speech recognition of inflected languages
Authors: Izhak Shafran, Keith Hall
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper presents a corrective model for speech recognition of inflected languages. The model, based on a discriminative framework, incorporates word n-grams features as well as factored morphological features, providing error reduction over the model based solely on word n-gram features. Experiments on a large vocabulary task, namely the Czech portion of the MALACH corpus, demonstrate performance gain of about 1.1--1.5% absolute in word error rate, wherein morphological features contribute about a third of the improvement. A simple feature selection mechanism based on X2 statistics is shown to be effective in reducing the number of features by about 70% without any loss in performance, making it feasible to explore yet larger feature spaces.
Design and analysis of a lightweight certificate revocation mechanism for VANET
Authors: Jason J. Haas, Yih-Chun Hu, Kenneth P. Laberteaux
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

In this paper, we propose a lightweight mechanism for revoking security certificates appropriate for the limited bandwidth and hardware cost constraints of a VANET. A Certificate Authority (CA) issues certificates to trusted nodes, i.e., vehicles. If the CA looses trust in a node (e.g., due to evidence of malfunction or malicious behavior), the CA must promptly revoke the certificates of the distrusted node. To distribute revocation information quickly even during incremental deployment, we propose CAs use Certificate Revocation Lists (CRLs). The CRL should be composed in a secure manner, and it should be exchanged in a way such that the CRL is both quickly and widely distributed. Laberteaux et al. proposed a mechanism for the quick distribution of CRL updates that also covers a wide area by using car-to-car (C2C) communication. However, this revocation process, which involves both the CA and VANET nodes, must conform to the aforementioned bandwidth and hardware restrictions. In this paper, we present mechanisms that achieve the goals of reduced CRL size, a computationally efficient mechanism for determining if a certificate is on the CRL, and a lightweight mechanism for exchanging CRL updates. Additionally, we present a formal proof of the security of our mechanism for reducing the size of CRLs.
Relationship between non-projective edges, their level types, and well-nestedness
Authors: Jiří Havelka
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit with empirical linguistic data. We present a reformulation of this constraint using properties of non-projective edges and show its formal relationship to level types of non-projective edges; we also derive a simple O(n2) algorithm for checking well-nestedness.
Securing VANETs: industry approaches and current research directions
Authors: Adrian Perrig
Venue: Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking (2009)

Security plays a critical role in Vehicular Ad-Hoc Networks (VANETs). In the absence of secure mechanisms, malicious parties could inject bogus information, at best robbing VANETs of their safety benefits or at worst causing accidents. Unfortunately, VANETs pose unique new research challenges, preventing the use of existing network security mechanisms. Industry has proposed security mechanisms to safeguard VANET operations. In this talk, we will discuss the properties and limitations of these mechanisms and present remaining research challenges. We will then present promising proposed research mechanisms to secure VANETs beyond current industry standards, such as the application of advanced cryptographic techniques to provide anonymity, the use of trusted computing technologies such as the Trusted Computing Group's (TCG's) Trusted Platform Module (TPM), or the use of location verification. We conclude the talk with remaining open research challenges, as well as opportunities and directions for addressing these challenges.
Development of Estimation System for Concentrate Situation Using Acceleration Sensor
Authors: Masashi Okubo, Aya Fujimura
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Recently, to discipline to increase powers of concentration is popular. One of the reason, it is difficult to concentrate something in these days because of a flood of information. However we discipline our concentration by using the how-to books and the portable games, we cannot evaluate the training effect on the practical life. In this paper, we propose an evaluation system for user's powers of concentration in which the method for the estimate user's sitting situation is utilized. This system is constructed by two kinds of method, one is the method which estimates the sitting situation and the other is the evaluation method for user's powers of concentration situation. These methods use user's motion that is obtained from the acceleration sensor that is fixed on the chair. And we prepare the three kinds of Graphical User Interface (GUI) which presents the concentration situation to the user.
Bayesian Tracking of Linear Structures in Aerial Images
Authors: Rui Gao, Walter F. Bischof
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

The interpretation of aerial images is difficult, especially for low-resolution images. Although solutions have been worked on for many years, performance of these systems is still not sufficient to be useful in practical applications. One potential solution is to create systems composed of many specialized modules. We introduce one such module, a Bayesian tracker for linear structures, such as pipelines and access roads. We show that the tracker can be used successfully to detect these structures in low-resolution images.
Parallel Hidden Hierarchical Fields for Multi-scale Reconstruction
Authors: Ying Liu, Paul Fieguth
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

In any problem involving images having scale-dependent structures, a key issue is the modeling of these multi-scale characteristics. Because multi-scale phenomena frequently possess nonstationary, piece-wise multi-model behaviour, the classic hidden Markov method can not perform well in modeling such complex images. In this paper we provide a new modeling approach to extend previous hierarchical methods, with multiple hidden fields, to perform reconstruction in more complex, nonstationary contexts.
The Future of Formal Methods and GALS Design
Authors: Kenneth S. Stevens, Daniel Gebhardt, Junbok You, Yang Xu, Vikas Vij, Shomit Das, Krishnaji Desai
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The System-on-Chip era has arrived, and it arrived quickly. Modular composition of components through a shared interconnect is now becoming the standard, rather than the exotic. Asynchronous interconnect fabrics and globally asynchronous locally synchronous (GALS) design has been shown to be potentially advantageous. However, the arduous road to developing asynchronous on-chip communication and interfaces to clocked cores is still nascent. This road of converting to asynchronous networks, and potentially the core intellectual property block as well, will be rocky. Asynchronous circuit design has been employed since the 1950's. However, it is doubtful that its present form will be what we will see 10 years hence. This treatise is intended to provoke debate as it projects what technologies will look like in the future, and discusses, among other aspects, the role of formal verification, education, the CAD industry, and the ever present tradeoff between greed and fear.
On Gautschi's conjecture for generalized Gauss-Radau and Gauss-Lobatto formulae
Authors: Hédi Joulak, Bernhard Beckermann
Venue: Journal of Computational and Applied Mathematics (2009)

Recently, Gautschi introduced so-called generalized Gauss-Radau and Gauss-Lobatto formulae which are quadrature formulae of Gaussian type involving not only the values but also the derivatives of the function at the endpoints. In the present note we show the positivity of the corresponding weights; this positivity has been conjectured already by Gautschi. As a consequence, we establish several convergence theorems for these quadrature formulae.
The Application on Intrusion Detection Based on K-means Cluster Algorithm
Authors: Meng Jianliang, Shang Haikun, Bian Ling
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Internet security has been one of the most important problems in the world. Anomaly detection is the basic method to defend new attack in Intrusion Detection. Network intrusion detection is the process of monitoring the events occurring in a computing system or network and analyzing them for signs of intrusions, defined as attempts to compromise the confidentiality. A wide variety of data mining techniques have been applied to intrusion detections. In data mining, clustering is the most important unsupervised learning process used to find the structures or patterns in a collection of unlabeled data. We use the K-means algorithm to cluster and analyze the data in this paper. Computer simulations show that this method can detect unknown intrusions efficiently in the real network connections.
Security Policy Implementation Strategies for Common Carrier Monitoring Service Providers
Authors: Carl A. Gunter
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

There are increasing capabilities and demands for the remote monitoring of homes and their occupants. There are a variety of options for the architecture of such monitoring systems entailing trade-offs between privacy, security, cost, manageability and other factors. This paper considers the virtues of building Monitoring Service Providers (MSPs) based on the concept of acommon carrier. The goal is to provide policy to support monitoring with limited risk to the monitored parties, the users of their data, and the MSP. We argue that advances in distributed computing, cryptography, and trusted computing provide enabling contributions to building practical Common Carrier MSPs (CCMSPs). We illustrate this with discussions of applications in the areas of assisted living and electrical power metering. 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
Streaming for large scale NLP: language modeling
Authors: Amit Goyal, Hal Daumé,  III, Suresh Venkatasubramanian
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

In this paper, we explore a streaming algorithm paradigm to handle large amounts of data for NLP problems. We present an efficient low-memory method for constructing high-order approximate n-gram frequency counts. The method is based on a deterministic streaming algorithm which efficiently computes approximate frequency counts over a stream of data while employing a small memory footprint. We show that this method easily scales to billion-word monolingual corpora using a conventional (8 GB RAM) desktop machine. Statistical machine translation experimental results corroborate that the resulting high-n approximate small language model is as effective as models obtained from other count pruning methods.
The partial migration of game state and dynamic server selection to reduce latency
Authors: Paul B. Beskow, Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz
Venue: Multimedia Tools and Applications (2009)

Massively multi-player online games (MMOGs) have stringent latency requirements and must support large numbers of concurrent players. To handle these conflicting requirements, it is common to divide the virtual environment into virtual regions. As MMOGs are world-spanning games, it is plausible to disperse these regions on geographically distributed servers. Core selection can then be applied to locate an optimal server for placing a region, based on player latencies. Functionality for migrating objects supports this objective, with a distributed name server ensuring that references to the moved objects are maintained. As a result we anticipate a decrease in the aggregate latency for the affected players. The core selection relies on a set of servers and measurements of the interacting players latencies. Measuring these latencies by actively probing the network is not scalable for a large number of players. We therefore explore the use of latency estimation techniques to gather this information.
Considering Cost in Usability Evaluation of Mobile Applications: Who, Where and When
Authors: Georgios Fiotakis, Dimitrios Raptis, Nikolaos Avouris
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

As computing moves from desktop to outdoor everyday life activities, usability evaluation must take into account new aspects, related with mobility and space. In this paper the effectiveness of established usability evaluation methods is examined through an extensive case study. The usability of an educational mobile museum application was tested using three different methods: inspection by experts, use in lab setting and use in the field. Results indicate that each method uncovers different types of problems at different cost. We believe that a combination of these methods may be worthwhile since their produced results seem to be complementary.
Gaussian Weak Classifiers Based on Haar-Like Features with Four Rectangles for Real-time Face Detection
Authors: Sri-Kaushik Pavani, David Delgado Gomez, Alejandro F. Frangi
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper proposes Gaussian weak classifiers (GWCs) for use in real-time face detection systems. GWCs are based on Haar-like features (HFs) with four rectangles (HF4s), which constitute the majority of the HFs used to train a face detector. To label an image as face or clutter (non-face), GWC uses the responses of the two HF2s in a HF4 to compute a Mahalanobis distance which is later compared to a threshold to make decisions. For a fixed accuracy on the face class, GWCs can classify clutter images with more accuracy than the existing weak classifier types. Our experiments compare the accuracy and speed of the face detectors built with four different weak classifier types: GWCs, Viola Jones's, Rasolzadeh et al.'s and Mita et al.'s. On the standard MIT+CMU image database, the GWC-based face detector provided 40% less false positives and required 32% less time for the scanning process when compared to the detector that used Viola Jones's weak classifiers. When compared to detectors that used Rasolzadeh et al.'s and Mita et al.'s weak classifiers, the GWC-based detector produced 11% and 9% fewer false positives. Simultaneously, it required 37% and 42% less time for the scanning process. 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
Exploiting Temporal Authors Interests via Temporal-Author-Topic Modeling
Authors: Ali Daud, Juanzi Li, Lizhu Zhou, Faqir Muhammad
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

This paper addresses the problem of discovering temporal authors interests. Traditionally some approaches used stylistic features or graph connectivity and ignored semantics-based intrinsic structure of words present between documents, while previous topic modeling approaches considered semantics without time factor, which is against the spirits of writing. We present Temporal-Author-Topic (TAT) approach which can simultaneously model authors interests and time of documents. In TAT mixture distribution over topics is influenced by both co-occurrences of words and timestamps of the documents. Consequently, topics occurrence and correlations change over time, while the meaning of particular topic almost remains unchanged. By using proposed approach we can discover topically related authors for different time periods and show how authors interests and relationships change over time. Experimental results on research papers dataset show the effectiveness of proposed approach and dominance over Author-Topic (AT) model, due to not changing the meaning of particular topic overtime.
Pareto-optimal solutions in fuzzy multi-objective linear programming
Authors: Mariano Jiménez, Amelia Bilbao
Venue: Fuzzy Sets and Systems (2009)

The problem of solving multi-objective linear-programming problems, by assuming that the decision maker has fuzzy goals for each of the objective functions, is addressed. Several methods have been proposed in the literature in order to obtain fuzzy-efficient solutions to fuzzy multi-objective programming problems. In this paper we show that, in the case that one of our goals is fully achieved, a fuzzy-efficient solution may not be Pareto-optimal and therefore we propose a general procedure to obtain a non-dominated solution, which is also fuzzy-efficient. Two numerical examples illustrate our procedure.
The Effectiveness of Interactivity in Computer-Based Instructional Diagrams
Authors: Lisa Whitman
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

This study investigates if interaction between a student and instructional diagrams displayed on a computer can be effective in significantly improving understanding of the concepts the diagrams represent over viewing animated or static instructional diagrams. Participants viewed either interactive, animated, or static versions of multimedia tutorials that taught how a simple mechanical system, a lock, worked and how a complex mechanical system, an automobile clutch, worked. Participants were tested on recall and comprehension to determine which presentation style; static, animated, or interactive; greater impacts learning, and whether that impact is mediated by the complexity of the mechanical system. Participants who studied from interactive multimedia presentations demonstrating how simple and complex mechanical systems work performed significantly better on comprehension tests for both mechanical systems than those who studied from static or animated presentations. However, all participants performed similarly on recall tests. Research on the effectiveness of computer learning environments and how to optimize their potential for effective instruction through improved multimedia design is important as computers are increasingly being used for training and education. 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