A trajectory-based recruitment strategy of social sensors for participatory sensing

Participatory sensing, a promising sensing paradigm, enables people to collect and share sensor data on phenomena of interest using mobile devices across many applications, such as smart transportation and air quality monitoring. This article presents a framework of participatory sensing and then focuses on a key technical challenge: developing a trajectory-based recruitment strategy of social sensors in order to enable service providers to identify well suited participants for data sensing based on temporal availability, trust, and energy. To devise a basic recruitment strategy, the Dynamic Tensor Analysis algorithm is initially adopted to learn the time-series tensor of trajectory so that the users' trajectory can be predicted. To guarantee reliable sensing data collection and communication, the trust and energy factors are taken into account jointly in our multi-objective recruitment strategy. In particular, friend-like social sensors are also defined to deal with an emergency during participatory sensing. An illustrative example and experiment are conducted on a university campus to evaluate and demonstrate the feasibility and extensibility of the proposed recruitment strategy

Launching an efficient participatory sensing campaign: A smart mobile device-based approach

PublishedJournal Article© 2015 ACM. Participatory sensing is a promising sensing paradigm that enables collection, processing, dissemination and analysis of the phenomena of interest by ordinary citizens through their handheld sensing devices. Participatory sensing has huge potential in many applications, such as smart transportation and air quality monitoring. However, participants may submit low-quality, misleading, inaccurate, or even malicious data if a participatory sensing campaign is not launched effectively. Therefore, it has become a significant issue to establish an efficient participatory sensing campaign for improving the data quality. This article proposes a novel five-tier framework of participatory sensing and addresses several technical challenges in this proposed framework including: (1) optimized deployment of data collection points (DC-points); and (2) efficient recruitment strategy of participants. Toward this end, the deployment of DC-points is formulated as an optimization problem with maximum utilization of sensor and then a Wise-Dynamic DC-points Deployment (WD3) algorithm is designed for high-quality sensing. Furthermore, to guarantee the reliable sensing data collection and communication, a trajectory-based strategy for participant recruitment is proposed to enable campaign organizers to identify well-suited participants for data sensing based on a joint consideration of temporal availability, trust, and energy. Extensive experiments and performance analysis of the proposed framework and associated algorithms are conducted. The results demonstrate that the proposed algorithm can achieve a good sensing coverage with a smaller number of DC-points, and the participants that are termed as social sensors are easily selected, to evaluate the feasibility and extensibility of the proposed recruitment strategies

MobiFuzzyTrust: An efficient fuzzy trust inference mechanism in mobile social networks

PublishedJournal Article© 2014 IEEE. Mobile social networks (MSNs) facilitate connections between mobile users and allow them to find other potential users who have similar interests through mobile devices, communicate with them, and benefit from their information. As MSNs are distributed public virtual social spaces, the available information may not be trustworthy to all. Therefore, mobile users are often at risk since they may not have any prior knowledge about others who are socially connected. To address this problem, trust inference plays a critical role for establishing social links between mobile users in MSNs. Taking into account the nonsemantical representation of trust between users of the existing trust models in social networks, this paper proposes a new fuzzy inference mechanism, namely MobiFuzzyTrust, for inferring trust semantically from one mobile user to another that may not be directly connected in the trust graph of MSNs. First, a mobile context including an intersection of prestige of users, location, time, and social context is constructed. Second, a mobile context aware trust model is devised to evaluate the trust value between two mobile users efficiently. Finally, the fuzzy linguistic technique is used to express the trust between two mobile users and enhance the human's understanding of trust. Real-world mobile dataset is adopted to evaluate the performance of the MobiFuzzyTrust inference mechanism. The experimental results demonstrate that MobiFuzzyTrust can efficiently infer trust with a high precision.This work was partly supported by the National Nature Science Foundation of China under grant 61201219 and the EU FP7 CLIMBER project under Grant Agreement No. PIRSES-GA-2012-318939

An efficient approach to generating location-sensitive recommendations in ad-hoc social network environments

Social recommendation has been popular and successful in various urban sustainable applications such as online sharing, products recommendation and shopping services. These applications allow users to form several implicit social networks through their daily social interactions. The users in such social networks can rate some interesting items and give comments. The majority of the existing studies have investigated the rating prediction and recommendation of items based on user-item bipartite graph and user-user social graph, so called social recommendation. However, the spatial factor was not considered in their recommendation mechanisms. With the rapid development of the service of location-based social networks, the spatial information gradually affects the quality and correlation of rating and recommendation of items. This paper proposes spatial social union (SSU), an approach of similarity measurement between two users that integrates the interconnection among users, items and locations. The SSU-aware location-sensitive recommendation algorithm is then devised. We evaluate and compare the proposed approach with the existing rating prediction and item recommendation algorithms subject to a real-life data set. Experimental results show that the proposed SSU-aware recommendation algorithm is more effective in recommending items with the better consideration of user's preference and location.This work was supported by the National Natural Science Foundation of China under Grant 61372187. G. Min’s work was partly supported by the EU FP7 CLIMBER project under Grant Agreement No. PIRSES-GA-2012-318939. L. T. Yang is the corresponding author

A tensor-based approach for big data representation and dimensionality reduction

PublishedJournal Article© 2013 IEEE. Variety and veracity are two distinct characteristics of large-scale and heterogeneous data. It has been a great challenge to efficiently represent and process big data with a unified scheme. In this paper, a unified tensor model is proposed to represent the unstructured, semistructured, and structured data. With tensor extension operator, various types of data are represented as subtensors and then are merged to a unified tensor. In order to extract the core tensor which is small but contains valuable information, an incremental high order singular value decomposition (IHOSVD) method is presented. By recursively applying the incremental matrix decomposition algorithm, IHOSVD is able to update the orthogonal bases and compute the new core tensor. Analyzes in terms of time complexity, memory usage, and approximation accuracy of the proposed method are provided in this paper. A case study illustrates that approximate data reconstructed from the core set containing 18% elements can guarantee 93% accuracy in general. Theoretical analyzes and experimental results demonstrate that the proposed unified tensor model and IHOSVD method are efficient for big data representation and dimensionality reduction

An optimized computational model for multi-community-cloud social collaboration

PublishedCommunity Cloud Computing is an emerging and promising computing model for a specific community with common concerns, such as security, compliance and jurisdiction. It utilizes the spare resources of networked computers to provide the facilities so that the community gains services from the cloud. The effective collaboration among the community clouds offers a powerful computing capacity for complex tasks containing the subtasks that need data exchange. Selecting the best group of community clouds that are the most economy-efficient, communication-efficient, secured, and trusted to accomplish a complex task is very challenging. To address this problem, we first formulate a computational model for multi-community-cloud collaboration, namely MG3. The proposed model is then optimized from four aspects: minimizing the sum of access cost and monetary cost, maximizing the security-level agreement and trust among the community clouds. Furthermore, an efficient and comprehensive selection algorithm is devised to extract the best group of community clouds in MG3. Finally, the extensive simulation experiments and performance analysis of the proposed algorithm are conducted. The results demonstrate that the proposed algorithm outperforms the minimal set coverings based algorithm and the random algorithm. Moreover, the proposed comprehensive community clouds selection algorithm can guarantee good global performance in terms of access cost, monetary cost, security level and trust between user and community clouds

Incremental Entity Summarization with Formal Concept Analysis

This is the author's accepted manuscript; the final version is available from IEEE via the DOI in this record.Knowledge graph describes entities by numerous RDF data (subject-predicate-object triples), which has been widely applied in various fields, such as artificial intelligence, Semantic Web, entity summarization. With time elapses, the continuously increasing RDF descriptions of entity lead to information overload and further cause people confused. With this backdrop, automatic entity summarization has received much attention in recent years, aiming to select the most concise and most typical facts that depict an entity in brief from lengthy RDF data. As new descriptions of entity are continually coming, creating a compact summary of entity quickly from a lengthy knowledge graph is challenging. To address this problem, this paper firstly formulates the problem and proposes a novel approach of Incremental Entity Summarization by leveraging Formal Concept Analysis (FCA), called IES-FCA. Additionally, we not only prove the rationality of our suggested method mathematically, but also carry out extensive experiments using two real-world datasets. The experimental results demonstrate that the proposed method IES-FCA can save about 8.7% of time consumption for all entities than the non-incremental entity summarization approach KAFCA at best. As for the effectiveness, IES-FCA outperforms the state-of-the-art algorithms in terms of F1-measure, MAP, and NDCG.National Natural Science Foundation of ChinaFundamental Research Funds for the Central Universitie

Recessive Inheritance of Congenital Hydrocephalus With Other Structural Brain Abnormalities Caused by Compound Heterozygous Mutations in ATP1A3

Background: ATP1A3 encodes the α3 subunit of the Na+/K+ ATPase, a fundamental ion-transporting enzyme. Primarily expressed in neurons, ATP1A3 is mutated in several autosomal dominant neurological diseases. To our knowledge, damaging recessive genotypes in ATP1A3 have never been associated with any human disease. Atp1a3 deficiency in zebrafish results in hydrocephalus; however, no known association exists between ATP1A3 and human congenital hydrocephalus (CH). / Methods: We utilized whole-exome sequencing (WES), bioinformatics, and computational modeling to identify and characterize novel ATP1A3 mutations in a patient with CH. We performed immunohistochemical studies using mouse embryonic brain tissues to characterize Atp1a3 expression during brain development. / Results: We identified two germline mutations in ATP1A3 (p. Arg19Cys and p.Arg463Cys), each of which was inherited from one of the patient’s unaffected parents, in a single patient with severe obstructive CH due to aqueductal stenosis, along with open schizencephaly, type 1 Chiari malformation, and dysgenesis of the corpus callosum. Both mutations are predicted to be highly deleterious and impair protein stability. Immunohistochemical studies demonstrate robust Atp1a3 expression in neural stem cells (NSCs), differentiated neurons, and choroid plexus of the mouse embryonic brain. / Conclusion: These data provide the first evidence of a recessive human phenotype associated with mutations in ATP1A3, and implicate impaired Na+/K+ ATPase function in the pathogenesis of CH

The actin-myosin regulatory MRCK kinases: regulation, biological functions and associations with human cancer

The contractile actin-myosin cytoskeleton provides much of the force required for numerous cellular activities such as motility, adhesion, cytokinesis and changes in morphology. Key elements that respond to various signal pathways are the myosin II regulatory light chains (MLC), which participate in actin-myosin contraction by modulating the ATPase activity and consequent contractile force generation mediated by myosin heavy chain heads. Considerable effort has focussed on the role of MLC kinases, and yet the contributions of the myotonic dystrophy-related Cdc42-binding kinases (MRCK) proteins in MLC phosphorylation and cytoskeleton regulation have not been well characterized. In contrast to the closely related ROCK1 and ROCK2 kinases that are regulated by the RhoA and RhoC GTPases, there is relatively little information about the CDC42-regulated MRCKα, MRCKβ and MRCKγ members of the AGC (PKA, PKG and PKC) kinase family. As well as differences in upstream activation pathways, MRCK and ROCK kinases apparently differ in the way that they spatially regulate MLC phosphorylation, which ultimately affects their influence on the organization and dynamics of the actin-myosin cytoskeleton. In this review, we will summarize the MRCK protein structures, expression patterns, small molecule inhibitors, biological functions and associations with human diseases such as cancer

Identification of Methanoculleus spp. as active methanogens during anoxic incubations of swine manure storage tank samples

Methane emissions represent a major environmental concern associated with manure management in the livestock industry. A more thorough understanding of how microbial communities function in manure storage tanks is a prerequisite for mitigating methane emissions. Identifying the microorganisms that are metabolically active is an important first step. Methanogenic archaea are major contributors to methanogenesis in stored swine manure, and we investigated active methanogenic populations by DNA stable isotope probing (DNA-SIP). Following a preincubation of manure samples under anoxic conditions to induce substrate starvation, [U-¹³C] acetate was added as a labeled substrate. Fingerprint analysis of density-fractionated DNA, using length-heterogeneity analysis of PCR-amplified mcrA genes (encoding the alpha subunit of methyl coenzyme M reductase), showed that the incorporation of ¹³C into DNA was detectable at in situ acetate concentrations (~7g/liter). Fingerprints of DNA retrieved from heavy fractions of the ¹³C treatment were primarily enriched in a 483-bp amplicon and, to a lesser extent, in a 481-bp amplicon. Analyses based on clone libraries of the mcrA and 16S rRNA genes revealed that both of these heavy DNA amplicons corresponded to Methanoculleus spp. Our results demonstrate that uncultivated methanogenic archaea related to Methanoculleus spp. were major contributors to acetate-C assimilation during the anoxic incubation of swine manure storage tank samples. Carbon assimilation and dissimilation rate estimations suggested that Methanoculleus spp. were also major contributors to methane emissions and that the hydrogenotrophic pathway predominated during methanogenesis