@article {455,
	title = {Campsna: A cloud assisted mobile peer to peer social network architecture},
	journal = {Journal of Digital Information Management},
	volume = {12},
	year = {2014},
	note = {Export Date: 10 July 2014},
	month = {2014},
	pages = {126 - 132},
	abstract = {In 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.},
	keywords = {Data exchange, Mobile Cloud, Mobile peer to peer Network, Network Architecture, Social Network},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451\&partnerID=40\&md5=eeaa0a8cdbbd54b68c6c7fb395d21692},
	author = {Liu, Y.-N. and Tang, H. and Zhao, G.-F.}
}
@article {40,
	title = {Extracting information from coarser-grained data in XML documents},
	journal = {Journal of Digital Information Management},
	volume = {4},
	year = {2006},
	note = {Export Date: 10 July 2014},
	month = {2006},
	pages = {117 - 123},
	abstract = {XML 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.},
	keywords = {Data exchange, Finite state transducers, XML database, Xtractor wrapper},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649098973\&partnerID=40\&md5=e3df331dc7e1172e6d94226eecc4f744},
	author = {Badr, Y.}
}
@article {46,
	title = {A new persistent labelling scheme for XML},
	journal = {Journal of Digital Information Management},
	volume = {4},
	year = {2006},
	note = {Cited By (since 1996):1Export Date: 10 July 2014},
	month = {2006},
	pages = {112 - 116},
	abstract = {With 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.},
	keywords = {Data exchange, Labeling scheme, XML database, XML standards},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649170430\&partnerID=40\&md5=b06e66fe740929637d6b20adf7fe0e9e},
	author = {Gabillon, A. and Fansi, M.}
}
