检索结果-内蒙古大学图书馆

IEEE Symposium on Computers and Communications

作者： Yao Wu Yuncheng Wu Juru Zeng Hong Chen Cuiping Li Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing China

Mobile crowd sensing has the potential to acquire massive data from places and address large-scale societal problems. However, most currently existing crowd sensing systems suffer from insufficient participants. Therefore, incentive design for crowd sensing is essential and urgent. In this paper, different from the auction-based and server-dominant incentives, we design a personalized incentive, PIE, with partiality for neither the server nor the participants with budget constraint. The total payment for all the participants accords to their collective participation level, and the individual reward for each participant depends on individual contribution. We measure the individual contribution and participation level based on Voronoi diagram and Shannon entropy. Both offline and online incentives are proposed with budget constraint. Experimental study shows that our incentives are participation-aware and contribution-dependent, which encourages participants' active join, balanced distribution and flexible reward.

关键词： Sensors Servers Atmospheric measurements Particle measurements Entropy Mobile communication Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Fast & scalable distributed set similarity joins for big data analytics 33

Fast & scalable distributed set similarity joins for big dat...

引用

33rd IEEE International Conference on data engineering, ICDE 2017

作者： Rong, Chuitian Lin, Chunbin Silva, Yasin N. Wang, Jianguo Lu, Wei Du, Xiaoyong Tianjin Polytechnic University China Arizona State University United States University of California San Diego United States Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China

ISBN: (纸本)9781509065431

Set similarity join is an essential operation in big data analytics, e.g., data integration and data cleaning, that finds similar pairs from two collections of sets. To cope with the increasing scale of the data, distributed algorithms are called for to support large-scale set similarity joins. Multiple techniques have been proposed to perform similarity joins using MapReduce in recent years. These techniques, however, usually produce huge amounts of duplicates in order to perform parallel processing successfully as MapReduce is a shared-nothing framework. The large number of duplicates incurs on both large shuffle cost and unnecessary computation cost, which significantly decrease the performance. Moreover, these approaches do not provide a load balancing guarantee, which results in a skewness problem and negatively affects the scalability properties of these techniques. To address these problems, in this paper, we propose a duplicate free framework, called FS-Join, to perform set similarity joins efficiently by utilizing an innovative vertical partitioning technique. FS-Join employs three powerful filtering methods to prune dissimilar string pairs without computing their similarity scores. To further improve the performance and scalability, FS-Join integrates horizontal partitioning. Experimental results on three real datasets show that FS-Join outperforms the state-of-Theart methods by one order of magnitude on average, which demonstrates the good scalability and performance qualities of the proposed technique. © 2017 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A Framework for Personalized Management of Domain Ontologies

A Framework for Personalized Management of Domain Ontologies

引用

International Conference on Computer and Information Science (ACIS)

作者： Runnan Liu Puwei Wang Shixian Zheng Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing China

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user.

关键词： Ontologies Conferences Cognition Semantics Vectors Semantic Web

来源：评论

学校读者我要写书评

暂无评论

SWEE: Approximately searching web service with keywords effectively and efficiently

SWEE: Approximately searching web service with keywords effe...

引用

The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

作者： Zuoyan Qin Peng Li Qing Zhu Chao Tian Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872

ISBN: (纸本)9781424458455;9781424458486;9781424458479;9781424458462

With the wide use of web services over the world, an effective and efficient search engine becomes necessary. In this paper, we analyzed the limitation of search method using traditional UDDI, and make it in LR-sryle and take advantage of approximate string matching. Motivated by the feature of WSDL files which define the interfaces of web services, we make operations defined in WSDL files which compose web services as the base units for searching and organize all information of operations and corresponding components as documents, which will facilitate IRStyle keyword searching. In order to improve the precision of searching, we enable users to specify weights in their queries. By defining our ranking function, we sort all the results and present top n ones to users. We also build inverted indexes on operations and corresponding documents to improve query efficiency. In addition, we carry out simple semantic analysis on WSDL files. to acquire better accuracy. At last, not only have we tested the efficiency of query after introducing approximate string matching, but also have we verified the effectiveness of the query results.

关键词： Web Service Search engines String matching fundamental units Consumers Search methods Searches keyWORD Surgery

来源：评论

学校读者我要写书评

暂无评论

Enable Privacy Preservation and Result Verification for Top-k Query in Two-Tiered Sensor Networks

Enable Privacy Preservation and Result Verification for Top-...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Hui Peng Xiaoying Zhang Hong Chen Yuncheng Wu Yao Wu Juru Zeng Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing China

ISBN: (纸本)9781467379533

Wireless sensor network is an important part of the Internet of Things. Preservation of privacy and integrity in wireless sensor networks is extremely urgent and challenging. This paper proposes an efficient mechanism, called PTK, for define and solve the practical and challenging problem of privacy-preserving and verifiable Top-k query processing in two-tier sensor network. PTK prevents adversaries from gaining sensitive information of both queries issued by users and data collected by sensor nodes while allows the ink to verify whether the results are valid. It offers confidentiality of queries and data by constructing a special code, and also achieves high defense capability against the background analysis attack through the implementation of obfuscation coding mechanism. Moreover, PTK provides integrity verification by the correlation among data. Finally, the experimental results show the high performance of proposed schemes in terms of privacy preservation and query efficiency.

关键词： data privacy Privacy Wireless sensor networks Protocols Query processing Cryptography data models

来源：评论

学校读者我要写书评

暂无评论

Enable Privacy Preservation for k-NN Query in Two-tiered Wireless Sensor Networks

Enable Privacy Preservation for k-NN Query in Two-tiered Wir...

引用

IEEE International Conference on Communications

作者： Hui Peng Xiaoying Zhang Hong Chen Yao Wu Juru Zeng Deying Li Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China

ISBN: (纸本)9781467364300

Wireless sensor network is an important part of the Internet of Things. Preservation of privacy and integrity in wireless sensor networks is extremely urgent and challenging. To address this problem, we propose PPKN, an efficient and privacy-preserving k-NN query protocol in two-tiered wireless sensor networks. Our proposal prevents adversaries from gaining sensitive information of both queries issued by users and data collected by sensor nodes while allows the sink to verify whether results are valid. It offers confidentiality of queries and data by constructing a special code, provides integrity verification by the correlation among data. Moreover, by the implementation of KNQ query framework, PPKN also achieves high efficient in query response and energy consumption. Finally, the theoretical analysis and experiment results show the high performance of PPKN in terms of privacy preservation and query efficiency.

关键词： Wireless sensor networks Energy consumption data privacy Privacy Protocols Cryptography Storage management

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer Science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Factors affecting knowledge transfer from pre-retirees to younger employees

Factors affecting knowledge transfer from pre-retirees to yo...

引用

International Conference on services Systems and services Management, ICSSSM

作者： Changyu Wang Meiyun Zuo Yifan Bo Key Laboratory of Data Engineering and Knowledge Engineering and School of Business Renmin University of China Beijing China

knowledge transfer is an important type of knowledge service. Based on existing studies on knowledge transfer between employees, this paper builds a research model of factors affecting the pre-retiree's intention to transfer knowledge to the younger employee. data collected from 4 leaders and 7 pre-retirees in different industries through face-to-face interview is used to test and improve the model, then we gain a theoretical model which posits that the pre-retiree's knowledge transfer intention is influenced by the pre-retiree's perceptions of younger employees and emotions to organization, the younger employee's attitudes towards pre-retirees, the younger employee's learning intention and ability and work attitudes, communication difference between the pre-retiree and the younger employee. Our results contribute to the improvement of research on pre-retirees' knowledge transfer and have implications for management practices.

关键词： knowledge transfer Interviews Organizations data models Educational institutions Analytical models Cognition

来源：评论

学校读者我要写书评

暂无评论

Vulnerabilities static detection for Web applications with false positive suppression

Vulnerabilities static detection for Web applications with f...

引用

2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010

作者： Huang, Jianjun Liang, Bin Zhong, Jiagui Wang, Qianqian Cai, Jingjing Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Beijing Venustech Cybervision Co. Ltd Beijing 100094 China

ISBN: (纸本)9781424469406

Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural and context-sensitive data flow analysis, mainly concerning the taint propagation and sanitization. This paper also discusses some techniques used in TASA, such as sanitization routines modeling, ASP specific features, alias analysis and path-related routines modeling, to prune false positives. Experiments on four open source applications show that TASA has a rate of false positive of 4.98% and it can avoid certain false warnings owing to the proposed approaches. © 2010 IEEE.

关键词： data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Scientific Value Weights more than Being Open or Toll Access:An analysis of the OA advantage in Nature and Science

引用

Journal of data and Information Science 2021年第4期6卷 62-75页

作者： Howell Y.Wang Shelia X.Wei Cong Cao Xianwen Wang Fred Y.Ye International Joint Informatics Laboratory&Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China Nottingham University Business School China University of Nottingham Ningbo ChinaNingbo315100China WISE Lab. Dalian University of TechnologyDalian 116024China

Purpose:We attempt to find out whether OA or TA really affects the dissemination of scientific ***/methodology/approach:We design the indicators,hot-degree,and R-index to indicate a topic OA or TA ***,according to the OA classification of the Web of Science(WoS),we collect data from the WoS by downloading OA and TA articles,letters,and reviews published in Nature and Science during 2010–*** papers are divided into three broad disciplines,namely biomedicine,physics,and ***,taking a discipline in a journal and using the classical Latent Dirichlet Allocation(LDA)to cluster 100 topics of OA and TA papers respectively,we apply the Pearson correlation coefficient to match the topics of OA and TA,and calculate the hot-degree and R-index of every OA-TA topic ***,characteristics of the discipline can be *** qualitative comparison,we choose some high-quality papers which belong to Nature remarkable papers or Science breakthroughs,and analyze the relations between OA/TA and citation ***:The result shows that OA hot-degree in biomedicine is significantly greater than that of TA,but significantly less than that of TA in *** on the R-index,it is found that OA advantages exist in biomedicine and TA advantages do in ***,the dissemination of average scientific discoveries in all fields is not necessarily affected by OA or ***,OA promotes the spread of important scientific discoveries in high-quality *** limitations:We lost some citations by ignoring other open sources such as arXiv and *** limitation came from that Nature employs some strong measures for access-promoting subscription-based articles,on which the boundary between OA and TA became *** implications:It is useful to select hot topics in a set of publications by the hotdegree *** finding comprehensively reflects the differences of OA and TA in different disciplines,which is a u

关键词： Open access Toll access Scientific discovery Academic dissemination data analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：