02134nas a2200217   4500008004100000245007800041210006900119260000900188300001400197490000700211520142600218653001801644653001701662653003201679653002501711653001901736100001501755700001301770700001601783856011701799       2014                        eng d00aCampsna: A cloud assisted mobile peer to peer social network architecture0 aCampsna A cloud assisted mobile peer to peer social network arch  c2014  a126 - 1320 v123 aIn the social network, people with same interest construct a group, where people can share their interesting contents. With the popularity of the mobile devices, mobile users can connect to the internet for services such as downloading videos, music and pictures anywhere at any time, which may cause heavy traffic burden on the core network. The service content (eg. video, picture, music) downloaded and shared in the same social network interest group may always be similar, which may lead to repeated traffic transmitted in a short time period; on the other hand, the size of the service content may be very large for a single user, which will take it along time and spend much money to finish a complete service request or sharing. It is necessary to study how to reduce the requests in internet from the mobile users to reduce the flow on the core network, as well as reducing the economic cost and the service time, which is the main motivation of our research. Based on the universal mobile social network architecture, this paper proposed CAMPSNA: a cloud assisted mobile peer to peer social network architecture. In which, the cloud center is introduced to help the mobile devices offloading complex tasks to the cloud. The end devices in the architecture construct a local mobile peer to peer network to share their existing content based on their social relationships to reduce the burden of the cloud center.10aData exchange10aMobile Cloud10aMobile peer to peer Network10aNetwork Architecture10aSocial Network1 aLiu, Y.-N.1 aTang, H.1 aZhao, G.-F.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451&partnerID=40&md5=eeaa0a8cdbbd54b68c6c7fb395d2169201832nas a2200181   4500008004100000245007000041210006900111260000900180300001400189490000600203520122600209653001801435653002901453653001701482653002101499100001301520856011701533       2006                        eng d00aExtracting information from coarser-grained data in XML documents0 aExtracting information from coarsergrained data in XML documents  c2006  a117 - 1230 v43 aXML is fast emerging as the dominant standard for representing data in the applications centric documents. While there has been a great deal of works recently proposing the extraction of relevant data of natural langujge texts, Most of the underlying works confront with the irregular structure hidden in the text. To this end, a large spectrum of wrappers has been conceived lot- web pages. Unfortunately, they cannot deal with semi-structured data and cannot still take into consideration the natural language processing. In this paper, we present a specification language to write expressive and easy extraction patterns. The specification relies on rectular expression fashion in order to write patterns by non expert users. In addition, we introduce the Xtractor wrapper for coarser-grained data (i.e. paragraphs). The Xtractor hinges on linguistic parsing. of paragraphs and applies technical and natural language dictionaries. Then it employs the extraction patterns against the pre-processed paragraphs in order to locate relevant data. The key idea of our approach consists of translating the extraction patterns to Finite State Transducers (FST) and even using the FST to build the domain specific dictionaries.10aData exchange10aFinite state transducers10aXML database10aXtractor wrapper1 aBadr, Y.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649098973&partnerID=40&md5=e3df331dc7e1172e6d94226eecc4f74401256nas a2200193   4500008004100000245004600041210004400087260000900131300001400140490000600154520068100160653001800841653002000859653001700879653001800896100001700914700001400931856011700945       2006                        eng d00aA new persistent labelling scheme for XML0 anew persistent labelling scheme for XML  c2006  a112 - 1160 v43 aWith the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. The goal of the research reported in this paper is to design a persistent structural labelling scheme, namely a labelling scheme where labels encode ancestor-descendant relationships and sibling relationship between nodes but need not to be changed when the document is updated.10aData exchange10aLabeling scheme10aXML database10aXML standards1 aGabillon, A.1 aFansi, M.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649170430&partnerID=40&md5=b06e66fe740929637d6b20adf7fe0e9e