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

International Conference on Parallel Processing (ICPP)

作者： Binbin Li Yuan He Wenyuan Liu School of Information Science and Engineering YanShan University China TNLIST Tsinghua University China The Key Laboratory for Computer Virtual Technology System Integration of HeBei Province China

ISBN: (纸本)9781467375887

Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and accuracy of estimation, numerous probability-based approaches have been proposed, most of which follow a similar way of minimizing the number of required time slots from tags to reader. The overall execution time of the estimator, however, is not necessarily minimized. The estimation accuracy of those approaches also largely depends on the repeated rounds, leading to a dilemma of choosing efficiency or accuracy. In this paper, we propose BFCE, a Bloom Filter based Cardinality Estimator, which only needs a constant number of time slots to meet desired estimation accuracy, regardless of the actual tag cardinality. The overall communication overhead is also significantly cut down, as the reader only needs to broadcast a constant number of messages for parameter setting. Results from extensive simulations under various tag IDs distributions shows that BFCE is accurate and highly efficient. In terms of the overall execution time, BFCE is 30 times faster than ZOE and 2 times faster than SRC in average, the two state-of-the-arts estimation approaches.

关键词： Estimation Radiofrequency identification Servers Probabilistic logic Protocols Approximation methods Error probability

来源：评论

学校读者我要写书评

暂无评论

A novel approach for mining important nodes in directed-weighted complex software network

引用

Journal of Computational information Systems 2015年第8期11卷 3059-3071页

作者： Ren, Jiadong Wu, Hongfei Yin, Tengteng Bai, Lan Zhang, Bing College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Hebei Institute of Foreign Languages Qinhuangdao China

If the software system is abstracted as a software network, its quality largely depends on the topology structure. A tiny fraction key function nodes play a critical role in improving the stability, reliability and robustness of complex software network. How to identify the top-k key nodes accurately and effectively becomes more and more significant both in theoretical and practical. In this paper, a novel approach based on semi-global information of mining top-k key nodes in directed-weighted complex software network is proposed. Firstly, we map the function and relationship of function calling or dependency to a directed function dependency network (DFDN). Secondly, an algorithm DFS-WEIGHT based on Depth-First-Search strategy is used to transform a DFDN into a directed-weighted function dependency network (DWFDN). Thirdly, we treat function nodes of DWFDN as two different roles - the caller or callee. Callers with high ability of accumulating vulnerabilities and callees with high ability of propagating vulnerabilities are considered as key nodes. Then, two metrics SABAC and SABPR are defined to measure the importance of callers and callees respectively. Finally, a Software network key Node miNing (SN-KNN) algorithm is proposed to mine most important callers and callees. Experimental results indicate that the algorithm SN-KNN is effective in mining key nodes. ©, 2015, Binary information Press. All right reserved.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

An efficient approach to mine maximal continuous frequent patterns from software function call sequence

引用

Journal of Computational information Systems 2015年第8期11卷 3073-3085页

作者： He, Haitao Yin, Tengteng Wu, Hongfei Bai, Lan Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Hebei Institute of Foreign Languages Qinhuangdao China

Certain characteristics of software are often hidden in its structure and can only be discovered when the software is executed dynamically. So mining important patterns from dynamic call graph of software plays an important role in analyzing software security. However the general sequential pattern mining algorithms may lead to poor performance due to the lack of consideration on the continuous property of software function call sequence. In this paper, combining with the characteristics of software itself, function call sequence is modeled firstly. The sequence represents the call relationship among functions of software. Then a novel structure called Nitem-List is put forward. The structure stores both the next item and the support information which is heuristic information for pruning the search space about a pattern. On the basis of that, an efficient algorithm called Maximal Continuous Frequent Pattern Miner (MCFP-Miner) and an update algorithm UMCFP-Miner are proposed. After constructing the initial Nitem-Lists from a mined database, MCFP-Miner can mine continuous frequent patterns from these Nitem-Lists. In UMCFP-Miner, a tighter bound for pruning is proposed. Finally, extensive experiments on various databases show that algorithm MCFP-Miner and UMCFP-Miner have better efficiency. ©, 2015, Binary information Press. All right reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

key-insulated aggregate signature

引用

Frontiers of computer Science 2014年第5期8卷 837-846页

作者： Huiyan ZHAO Jia YU Shaoxia DUAN Xiangguo CHENG Rong HAO College of Information Engineering Qingdao University Qingdao 266071 China Shandong Provincial Key Laboratory of Computer Network Jinan 250014 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China

In order to minimize the damage caused by key exposure in aggregate signatures, a key-insulated aggregate signature scheme is proposed in this paper. We give the def- inition and the security model of the key-insulated aggregate signature. We also construct a concrete key-insulated aggre- gate signature scheme that meets our definition. Our scheme has the properties of efficient verification and short signature length. We prove the security of our scheme in the random oracle model under the computation Diffie-Hellman assump- tion.

关键词： aggregate signature key-insulated aggregatesignature provable security bilinear pairings

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Mobile Telemedicine System Based on Body Area network

Design and Implementation of Mobile Telemedicine System Base...

引用

2015 International Conference on computer Science and information Engineering(CSIE 2015)

作者： Yun-xia ZHANG Ying-long WANG Ming-lei SHU Meng ZHAO School of Information Science and Engineering Shandong Normal University Shandong Key Laboratory of Computer Network Shandong Computer Science Center(National Super Computing Center in Jinan)

In order to realize remote consultation,remote diagnosis and remote education,and reduce the difficulty and expense for patients seeing a doctor in developing *** this paper,we proposed a mobile telemedicine system is based on a cloud platform to store physiology *** the one hand,it based on Body Area network to collect physiological data;On the other hand it is based on Session Description Protocol and adopts Hole Punching,H.264 video codec,RTP/RTCP real-time transport protocol,which achieves P2 P communication from different *** with traditional telemedicine system,it not only achieves P2 P communication between users and doctors but also can get accurate physiological data of users,such as pressure,blood oxygen,ECG,blood *** avoids inaccurate diagnosis results owing to the subjective feeling of users.

关键词： BAN Mobile telemedicine SIP Cloud platform Hole Punching

来源：评论

学校读者我要写书评

暂无评论

Method of periodic dynamic pattern mining based on complex network

引用

Journal of Computational information Systems 2015年第21期11卷 7849-7856页

作者： Wang, Lei Jiang, Liya Dong, Jun Huang, Guoyan Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Hebei Normal University of Science and Technology Qinhuangdao China

Traditionally, analysis of dynamic network has been focused only on a single snapshot or integrated network obtained over a period of time. However, the temporal feature in dynamic network has been ignored. In this paper, periodic dynamic pattern (PDP) mining method is proposed to discover the dynamic evolution rule of social networks. We define a periodic dynamic pattern based on complex network, and construct matrix of graph (MG) to present the evolution of complex network over time. Moreover, a regular edge pattern searching (REPS) algorithm based on MG is designed. It is used to select frequent and regular edge existence sequence (EES) in MG with progressive scan. To improve efficiency of the algorithm, sequences according with frequency threshold and REP should be transformed to decimal integer. Then, depth-first search method is used to mine PDP, which owns the same REP in dynamic network. So, we can predict future network evolution and control its behavior. Experimental results demonstrate that our method is an effective periodic dynamic pattern mining. Copyright © 2015 Binary information Press.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

ICRA: An improved community detection algorithm on signed social networks

引用

Journal of Computational information Systems 2015年第11期11卷 4091-4099页

作者： Hu, Xinzhuan Guo, Jingfeng Zhao, Yue Liu, Yuanying School of Economics and Management Yanshan University Qinhuangdao China College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The study on signed social networks community detection has been paid more and more attention. Research shows that two-phase signed social networks community detection algorithm can not correctly divide the network. To solve the problem, we propose a new algorithm: ICRA (Improved Clustering Re-clustering Algorithm). In the process of community division, the assignment of vertices with negative edges shall be determined by comparing the value of network positive density with community positive density. Our algorithm solves the problems existing in CRA, including network division failure and wrong division starting from different vertices. ©, 2015, Binary information Press. All right reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Frequent jump pattern mining based on complex network

引用

Journal of Computational information Systems 2015年第17期11卷 6451-6458页

Many researchers are devoted to find frequent pattern in static network. Due to these frequent patterns are usually defined as frequent existence patterns which satisfy given support threshold in network. However, the temporal feature in dynamic network is ignored. In this paper, frequent jump pattern (FJP) is proposed, it not only represents frequent pattern but also can show regular behavior in evolving social network. Furthermore, jump patterns are robust against noise in the analysis of dynamical process. We construct matrix of directed graph (MDG) to present the evolution of complex directed network over time. Moreover, a frequent jump pattern searching algorithm (FJPSA) based on MDG is proposed to find dynamic evolution rule of social network. FJP mining is a technique which can be used in many application fields, such as explaining biological evolution and mining customer behavior regularity in social network. Experimental results demonstrate that our method could effectively mining FJP-graph. © 2015, by Binary information Press

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Statistical error analysis of HTL algorithm via LTO and RO stability hypothesis

引用

Journal of information and Computational Science 2014年第16期11卷 5765-5773页

作者： Wu, Jianzhang Yu, Xiao Gao, Wei School of Computer Science and Engineer Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China School of Continuing Education Southeast University Nanjing China School of Information Yunnan Normal University Kunming China

There are abundant parameters to estimate if training and testing samples are drawn from the different probability distribution in supervised machine learning algorithm setting. Hypothesis transfer learning is a trick to get over this limitation in practical engineering, and the source hypotheses trained on a source domain can only be utilized. In this paper, we define the LTO and RO stability hypothesis for hypothesis transfer learning algorithm, and the statistical error is bounded in terms of these stability hypotheses.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

Physiological-Signal-Based key Negotiation Protocols for Body Sensor networks: A Survey

Physiological-Signal-Based Key Negotiation Protocols for Bod...

引用

International Symposium on Autonomous Decentralized Systems (ISADAS)

作者： Huawei Zhao Ruzhi Xu Minglei Shu Jiankun Hu Department of Internet Finance Shandong Prov Key Laboratory of Computer Network Shandong Computer Science Center Jinan China Shandong Prov Key Laboratory of Computer Network Shandong Computer Science Center Jinan China Department of Internet Finance Qilu University of Technology Jinan China School of Engineering and Information Technology UNSW Canberra Australia

ISBN: (纸本)9781479982622

Body sensor networks (BSNs) are deployed around the human body to measure and process physiological signals in real time, which have wide application prospects in intelligent healthcare. Physiological signals measured and processed by BSNs involve individual privacy, thus security mechanisms must be developed to secure BSNs, and therein adoption of key negotiation protocols is fundamental. Due to stringently limited operation resources, BSNs require these protocols to be low-energy and highly efficient. Recent development has discovered that certain physiological signals can be used for efficiently negotiating common keys among biosensor nodes. These signals and fuzzy technology are used to design lightweight key negotiation protocols, and many solutions have been proposed. In this paper, we explore and classify these solutions, and evaluate their performance by analyzing their merits and demerits. Finally, we present open research issues that should be solved in the future.

关键词： Protocols Physiology Biosensors Receivers Synchronization Error correction codes Noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：