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

Cooperative Co-evolutionary Artificial Bee Colony Algorithm Based on Hierarchical Communication Model

Chinese Journal of Electronics 2016年第3期25卷 570-576页

作者： HU Chunyu LIU Hong ZHANG Peng School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology

Canonical Artificial bee colony(ABC) algorithm with a single species is insufficient to extend the diversity of solutions and may be trapped into the local optimal solution. This paper proposes a new co-evolutionary ABC algorithm(HABC) based on Hierarchical communication model(HCM). HCM combines advantages of global and local communication pattern. With adjustment strategies on species and groups, HCM can reduce the computational complexity dynamically. Performance tests show that the HABC algorithm exhibit good performance on accuracy, robustness and convergence speed. Compared with ABC and Integrated co-evolution algorithm(IABC),HABC performs better in solving complex multimodal functions.

关键词： Artificial bee colony(ABC) algorithm Multi-species co-evolution Hierarchical communication model(HCM) Dynamical adjustment

来源：评论

学校读者我要写书评

暂无评论

Bayesian multi-hypothesis Wyner-Ziv video coding

引用

Journal of Information Hiding and Multimedia Signal Processing 2017年第2期8卷 478-485页

作者： Meng, Li Li Zong, Jing Xiu Sun, Gui Na Cheng, Jie Zhang, Jia Zhao, Meng Chen Department of Information Science and Engineering Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University No.88 Wenhua East Road Jinan250014 China

The performance of distributed video coding (DVC) relies heavily on the quality of the side information (SI), and better performance can be expected if multiple SIs are employed. In this paper, we consider the scenario with two SIs, which are obtained by forward and backward predictions respectively. In this case, a couple of ad hoc approaches have been proposed to approximate the conditional probability density function (pdf) of a Wyner-Ziv-coded frame given the two SIs. However, the optimal conditional pdf and the relative performances of these ad hoc approaches with respect to the optimal solution have not been studied. In this paper, using Bayes’ formula, we derive the closed-form expression of the conditional pdf. Experimental results show that the Bayesian solution has similar performance to previous methods. Moreover, simulation results reveal that when better SIs are available, the Bayesian solution could outperform other methods. This analysis sheds some lights on developing future DVC schemes. © 2017 ISSN.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Eunomia: Scaling Concurrent Search Trees under Contention Using HTM

引用

ACM SIGPLAN Notices 2017年第8期52卷 385-399页

作者： Wang, Xin Zhang, Weihua Wang, Zhaoguo Wei, Ziyun Chen, Haibo Zhao, Wenyun Software School Fudan University China Shanghai Key Laboratory of Data Science Fudan University School of Computer Science Fudan University China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Computer Science Department New York University United States

While hardware transactional memory (HTM) has recently been adopted to construct efficient concurrent search tree structures, such designs fail to deliver scalable performance under contention. In this paper, we first conduct a detailed analysis on an HTM-based concurrent B+Tree, which uncovers several reasons for excessive HTM aborts induced by both false and true conflicts under contention. Based on the analysis, we advocate Eunomia, a design pattern for search trees which contains several principles to reduce HTM aborts, including splitting HTM regions with version-based concurrency control to reduce HTM working sets, partitioned data layout to reduce false conflicts, proactively detecting and avoiding true conflicts, and adaptive concurrency control. To validate their effectiveness, we apply such designs to construct a scalable concurrent B+Tree using HTM. Evaluation using key-value store benchmarks on a 20-core HTM-capable multi-core machine shows that Eunomia leads to 5X-11X speedup under high contention, while incurring small overhead under low contention. © 2017 ACM.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Bilevel genetic algorithm with clustering for large scale traveling salesman problems

Bilevel genetic algorithm with clustering for large scale tr...

引用

2016 International Conference on Information System and Artificial Intelligence, ISAI 2016

作者： Tan, Yan-Yan Tan, Li-Zhuang Yun, Guo-Xiao Zheng, Wei School of Information Science and Engineering Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University Jinan China

ISBN: (纸本)9781509015856

The Traveling Salesman Problem (TSP) belongs to the class of NP-hard optimization problems. Its solving procedure is complicated, especially for large scale problems. In order to solve the large scale TSPs efficiently, this paper presents a bilevel genetic algorithm with clustering (BLGAC). BLGA-C uses a clustering method to divide a large scale TSP into several subproblems, each subproblem corresponds to a cluster. K-Means clustering method is adopted in this paper. In the lower level, a genetic algorithm is used to find the shortest hamiltonian cycle for each cluster. All these clusters can be handled parallelly. Then, we need to select two nearest vertices between two clusters, and determine which edges will be deleted from the shortest hamiltonian cycle for each cluster, and which edges will be linked for combining two adjacent clusters into one. Repeat this procedure until all clusters are joined into one whole tour. Different combing sequences among clusters will result in different travelling tours, searching for the shortest is our purpose. Therefore, in the higher level, a modified genetic algorithm is designed for integral optimization with the objective of shortest the whole traveling tour. At last in this paper, we trial run a set of experiments on benchmark instances for testing the performance of the proposed BLGAC. Experimental results demonstrate its effective and efficient performance. © 2016 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient mining Algorithm of frequent itemsets for uncertain data streams 9

Efficient mining Algorithm of frequent itemsets for uncertai...

引用

9th International Symposium on Computational Intelligence and Design, ISCID 2016

作者： Qianqian, Wang Fang-Ai, Liu School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China

ISBN: (纸本)9781509035588

With the rapid development of computer technology, web services has been widely used. In these applications, the uncertain data is in the form of streams. In view of this kind of situation, present a new generalized data structure, that is, PSUF - tree, to store uncertain data streams, all itemsets in recent window are contained in global PStree in a condensed format, establish a header table in which contains dynamic array of expected value whose header table saved the same itemsets. Based on PSUF-tree, present a new mining algorithm for frequent itemsets, that is, PSUF-streaming algorithm, frequent itemsets could be mined by traversing the dynamic array, the maintaining of PSUF-tree just handles the header table corresponds to the oldest batch of itemsets in window. The experimental results show that PSUF-streaming algorithm has good efficiency and scalability, and reduce memory usage to some extent. © 2016 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Correction to: A whitelist and blacklist-based co-evolutionary strategy for defensing against multifarious trust attacks

引用

Applied Intelligence 2018年第7期48卷 1891-1891页

作者： Shujuan Ji Haiyan Ma Yongquan Liang Hofung Leung Chunjin Zhang Shandong Provincial Key Laboratory of Wisdom Mine Information Technology Shandong University of Science and Technology Qingdao China Shandong Provincial Key Laboratory of Novel Distributed Computer Software Technology Shandong Normal University Jinan China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China Center of Network Shandong University of Science and Technology Qingdao China

The article A whitelist and blacklist-based co-evolutionary strategy for defensing against multifarious trust attacks, written by Shujuan Ji, Haiyan Ma, Yongquan Liang, Hofung Leung and Chunjin Zhang, was originally p...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model of assessment of trustworthy user based on fuzzy theory under cloud environment 6

Model of assessment of trustworthy user based on fuzzy theor...

引用

2016 6th International Workshop on computer Science and Engineering, WCSE 2016

作者： Chang, Liang Zhang, Yong-Sheng School of Information Science and Engineering Shandong Normal University Jinan250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250014 China

ISBN: (纸本)9789811100086

To solve the two problems that users are independent of each other, it does not form indirect trust relationship between user and cloud service providers, and the traditional method of quantitative measures user's granularity so small. This paper introduces model of assessment of trustworthy user based on fuzzy theory. This model divides the range of trustworthy area based on fuzzy theory in mathematical thought in moderate granularity, and introduces the impact factor that is the neighboring access interval, solves the problem of establishing between user and service providers that is indirect trust. Finally, this paper mines the important influence factors through the simulated experiment, proves this model can measure trustworthy user in directly.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

An attention-based syntax-tree and tree-LSTM model for sentence summarization

引用

International Journal of Performability Engineering 2017年第5期13卷 775-782页

作者： Liu, Wenfeng Liu, Peiyu Yang, Yuzhen Gao, Yaling Yi, Jing School of Information Science and Engineering Shandong Normal University Jinan250014 China Department of Computer and Information Engineering Heze University Heze274015 China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan250014 China Ruipu Peony Industrial Technology Development Co. Ltd 274015 China School of Computer Science and Technology Shandong Jianzhu University Jinan250101 China

Generative Summarization is of great importance in understanding large-scale textual data. In this work, we propose an attention-based Tree-LSTM model for sentence summarization, which utilizes an attention-based syntactic structure as auxiliary information. Thereinto, block-alignment is used to align the input and output syntax blocks, while inter-alignment is used for alignment of words within that of block pairs. To some extent, block-alignment can prevent structural deviations on the long sentences and inter-alignment is capable of increasing the flexibility of the generation in the blocks. This model can be easily trained to end-to-end mode and deal with any length of the input sentences. Compared with several relatively strong baselines, our model has achieved the state-of-art on DUC-2004 shared task. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Identity-based aggregate signcryption in the standard model from multilinear maps

引用

Frontiers of computer Science 2016年第4期10卷 741-754页

作者： Hao WANG Zhen LIU Zhe LIU Duncan S. WONG School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Labe ratory for Novel Distributed Computer Software Technology Jinan 250014 China Security and Data Sciences Hong Kong Applied Science and Technology Research Institute (ASTRI) Hong Kong China Laboratory of Algorithmics Cryptology and Security (LACS) University of Luxembourg Luxembourg L-1359 Luxembourg

Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by ＂digital signature followed by public key encryption＂. It does this by signing and *** a message in a single step. An aggregate signcryption scheme allows individual signcryption ciphertexts intended for the same recipi- ent to be aggregated into a single （shorter） combined ciphertext without losing any of the security guarantees. We present an aggregate signcryption scheme in the identity-based setting using multilinear maps, and provide a proof of security in the standard model. To the best of our knowledge, our new scheme is the first aggregate signcryption scheme that is secure in the standard model.

关键词： identity-based aggregate signcryption multilinear maps standard model GGH framework

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Content Features and Their Correlation of Web Pages for Spam Detection

引用

China Communications 2015年第3期12卷 84-94页

作者： JI Hua ZHANG Huaxiang Department of computer science Shandong Normal University Shandong Provincial key laboratory for novel distributed computer software technology

In the global information era,people acquire more and more information from the Internet,but the quality of the search results is degraded strongly because of the presence of web *** spam is one of the serious problems for search engines,and many methods have been proposed for spam *** exploit the content features of non-spam in contrast to those of *** content features for non-spam pages always possess lots of statistical regularities; but those for spam pages possess very few statistical regularities,because spam pages are made randomly in order to increase the page *** this paper,we summarize the regularities distributions of content features for non-spam pages,and propose the calculating probability formulae of the entropy and independent n-grams ***,we put forward the calculation formulae of multi features *** them,the notable content features may be used as auxiliary information for spam detection.

关键词： web spam content features feature correlation spam detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：