{"title":"Learning to Extract Content from News Webpages","authors":"Alex Spengler, P. Gallinari","doi":"10.1109/WAINA.2009.97","DOIUrl":"https://doi.org/10.1109/WAINA.2009.97","url":null,"abstract":"We consider the problem of content extraction from online news webpages. To explore to what extent the syntactic markup and the visual structure of a webpage facilitate the extraction of its content, we compare two state-of-the-art classifiers as first instantiations of a general framework that allows for proper model comparison. To this end, we introduce the publicly available NEWS600 corpus, a set of 604 real world news webpages which have been annotated with 30 semantic labels. An empirical analysis of the two models on this dataset shows that the inclusion of structural information is indeed advantageous.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Requirements and Strategy for Presentation Stage Synchronization of Multi-object Multimedia Applications","authors":"Ting Peng, Kai Du","doi":"10.1109/WAINA.2009.45","DOIUrl":"https://doi.org/10.1109/WAINA.2009.45","url":null,"abstract":"For Multi-object Multimedia Applications(MMAs),synchronization between the media objects is an inevitable problem. Current available literature focus on transmission synchronization and only two media objects are considered. Experiments show that synchronization performance is unacceptable in MMAs without presentation stage synchronization strategy even if local media objects are played. In MMAs, each media object has its own importance and each media object pair has its own synchronization requirements. We analysis these factors in detailand quantitative criteria are given. Accordingly, synchronization performance metrics which considers these factors comprehensively is proposed. In order to ensure reasonable synchronization performance, Versatile Synchronization Strategy(VSS) is proposed.Synchronization operations of important media objectsand media object pairs with strict requirements are scheduled as the priority jobs. Experimental results show that it works well. It is a promising presentation stage synchronization strategy for MMAs.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129585980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CCA: A Calculus of Context-Aware Ambients","authors":"F. Siewe, A. Cau, H. Zedan","doi":"10.1109/WAINA.2009.23","DOIUrl":"https://doi.org/10.1109/WAINA.2009.23","url":null,"abstract":"We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambients and introduces new constructs to enable ambients and processes to be aware of the environment in which they are being executed. This results in a powerful calculus where mobility and context-awareness are first-class citizens. We present the syntax and a formal semantics of the calculus. We show that CCA can encode the pi-calculus, and illustrate the pragmatics of the calculus through a case study of a context-aware hospital bed.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Neander Larsen Brisola, A. Santin, L. Lung, H. B. Ribeiro, Marcelo H. Vithoft
{"title":"A Public Keys Based Architecture for P2P Identification, Content Authenticity and Reputation","authors":"Neander Larsen Brisola, A. Santin, L. Lung, H. B. Ribeiro, Marcelo H. Vithoft","doi":"10.1109/WAINA.2009.139","DOIUrl":"https://doi.org/10.1109/WAINA.2009.139","url":null,"abstract":"In the classic use of P2P, e.g. file sharing, there is no concern about persistent peer identification, peer and content reputation and content authenticity. Security proposals currently found in technical literature try to adapt techniques from client-server architecture to P2P environments, which it is not the most appropriate approach. This work proposes applying public keys to identify peers. It allows creating a persistent identification scheme, without losing anonymity, even in a self-managed environment as P2P. Also, it applies digital signature to provide authenticity to the P2P content and to guarantee non-repudiation in the content transfer. In order to provide credibility to the non-certified content and public keys a reputation mechanism is applied. We have developed a prototype to show the benefits of this approach.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122230249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Derdour Makhlouf, Nacira Ghoualmi Zine, P. Roose, Marc Dalmau
{"title":"An Adaptation System for P2P Multimedia Applications","authors":"Derdour Makhlouf, Nacira Ghoualmi Zine, P. Roose, Marc Dalmau","doi":"10.1109/WAINA.2009.28","DOIUrl":"https://doi.org/10.1109/WAINA.2009.28","url":null,"abstract":"This article proposes an architecture that adapts multimedia flows to the context of the participants in communication in peer-to-peer systems. This architecture allows a pair to play several roles (pair adaptation, Proxy or communicating), the adaptation peer researches adapters, compose them, if it is necessary to have interfaces to adapt, to realize the complex adaptation operations and send them to peer communicating. The peer Proxy supports the execution of the interface if the communicating peers are not able to execute it. This architecture allows recomposing dynamically the adaptive interfaces, so; this facilitates changes in the user's environment and in the adapters. The construction of the interfaces adaptation is dynamic; it applies the Choquet integral on a set of coefficients in order to have a compatible interface to the needs of the communicating. A complete chain of adaptation is implemented using the Java language for creating interface adaptations, the Web service for description and communication profiles such as RDF and HTTP.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122258226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scalable Energy-Aware Dynamic Task Allocation","authors":"A. Bokar, M. Bozyigit, C. Sener","doi":"10.1109/WAINA.2009.46","DOIUrl":"https://doi.org/10.1109/WAINA.2009.46","url":null,"abstract":"Battery energy limitation is one of the main challenges in the mobile ad hoc networks. Several hardware and software based techniques have been proposed in this field. Energy aware task scheduling is one of the software methods where the scheduling policy aims at optimizing the energy. Most of the previous work have achieved significant energy savings for individual mobile nodes but did not consider overall network lifetime and scalability. In this paper, we propose a Scalable Energy Aware Dynamic Task Allocation technique (SEADTA) for prolonging the network lifetime. In our model, the network lifetime is divided into many rounds. At the beginning of each round a new energy aware clustering algorithm is executed in order to arrange the network nodes in a parent-child structure. Based on the proposed technique, selected parents a reused in the remote allocation such that minimum residual energy is maximized at the end of each round. The results of our simulation showed that our proposed scheme makes a significant improvement in the network life time while simultaneously minimizing the energy consumption and time delay for each task.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126816005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Contextualized and Personalized Approach for Mobile Search","authors":"Feng Gui, M. Adjouadi, N. Rishe","doi":"10.1109/WAINA.2009.187","DOIUrl":"https://doi.org/10.1109/WAINA.2009.187","url":null,"abstract":"Mobile search is becoming increasingly important for mobile users as mobile devices are more widely used. Mobile search differs from standard PC-based web search in a number of ways: (1) the user interfaces and I/O are limited by screen real estate and tiny key pads are tiny, (2) limited bandwidth and costly connection time, (3) increased local search due to mobility. These limitations result in more navigational queries in the mobile search. Furthermore, user location, activities, preferences, and interaction history can also improve accuracy in determining relevance for mobile search. In the past, most personalized search algorithms are studied in the context of PC-based web search. Personalized mobile search should however play a bigger role at improving the user experiences. This paper focuses on the personalization strategies which explicitly and implicitly infer user search context from user current environment. We propose an architecture which collects user information (at mobile device and carrier network) and derives user intention in given situations. We show that personalized mobile search perform well for ambiguous queries and localized searches.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115282765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Othman A. Al-Amoudi, M. El-Azhari, M. Woodward, I. Awan
{"title":"An Efficient Routing Mechanism Based on Heading Angle","authors":"Othman A. Al-Amoudi, M. El-Azhari, M. Woodward, I. Awan","doi":"10.1109/WAINA.2009.83","DOIUrl":"https://doi.org/10.1109/WAINA.2009.83","url":null,"abstract":"The aim of this paper is to develop an efficient routing mechanism based on heading angle to establish connections. This can be done by prevent unessential links to be established between each pair of nodes that form the connection between the source and the destination. The unessential links represent the fragile links which could be broken easily according to the arbitrary movement of the nodes. This work enhanced the previous work on heading angle where connections requests are served under FCFS [14] where as the current work restrict the range to consider for routing. We measure the performance of the proposed approach by evaluating it against the enhanced ad-hoc on demand distance vector (EAODV) routing protocol. The simulation results reveal that the proposed approach demonstrates better performance than EAODV for all scenarios using the Random Waypoint mobility model. Numerical result demonstrates the performance. The result show the average values based on 50 simulations runs.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"4 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113964781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Comparison Between the Tunneling Process and Mapping Schemes for IPv4/IPv6 Transition","authors":"Ra'ed AlJa'afreh, J. Mellor, I. Awan","doi":"10.1109/WAINA.2009.209","DOIUrl":"https://doi.org/10.1109/WAINA.2009.209","url":null,"abstract":"A number of transition mechanisms have been developed to support the interoperability between IPv4 and IPv6 during the time of migration from the existing IP version (IPv4) to the new IP version (IPv6). BDMS is one of the IPv4/IPv6 transition mechanisms that has been designed to enable IPv4-only hosts to communicate with IPv6-only hosts and vice versa; while DSTM has been designed to enable IPv6 hosts to communicate with IPv4-only hosts. In this paper, we present the impact of the mapping and translation processes of the BDMS transition mechanism compared with the tunneling process of the DSTM when a variety of traffic loads are used. Our simulation results show that the delay and throughput results of the BDMS are close to the results of the DSTM and direct-link connections when the number of connected nodes is small. This paper shows that the tunneling process in the DSTM has a significant impact on the performance evaluation metrics compared with the BDMS and direct-link connections when large traffic loads are used. All the simulation scenarios in this paper are performed using the OMNeT++ simulator platform.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121729713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Robust Algorithm for Fuzzy Document Clustering","authors":"Lifei Chen, Shengrui Wang, Q. Jiang","doi":"10.1109/WAINA.2009.15","DOIUrl":"https://doi.org/10.1109/WAINA.2009.15","url":null,"abstract":"In many applications of document clustering, a document may include multiple topics and thus may relate to multiple categories at the same time. Most of the existing subspace clustering algorithms can only perform hard clustering on document collections. In this paper, a fuzzy algorithm named R-FPC is introduced for document clustering. The algorithm discovers soft partitions of a data set in the soft subspaces of the data space. Using the proposed R-Greedy initialization method, R-FPC can always generate stable clustering results with competitive accuracy. The experiments are conducted on some widely used corpuses and the results have shown effectiveness and robustness of the proposed methods.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131201946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}