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

A frequent pattern mining algorithm based on concept lattice

Sensors and Transducers 2013年第9期156卷 351-359页

作者： Changsheng, Zhang Jing, Ruan Haijiang, Xia Hailong, Huang Bingru, Yang School of Computer and Communication Engineering University of Science and Technology Beijing Beijing BJ10 China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing BJ10 China College of Physics and Electronic Information Engineering Wenzhou University Zhejiang ZJ577 China Wenzhou Vocational and Technical College Zhejiang ZJ577 China

The concept lattice is an effective tool for data analysis and rule extraction, it is often well to mine frequent patterns by making use of concept lattice. In this paper, a frequent itemset mining algorithm FPCL based on concept lattice which builds lattice in batches, the algorithm builds lattice down layer by layer through the layer concept nodes and temporary nodes based on hierarchical concept lattice;and seeks up the parent-child relationship upward concept nodes layer by layer, which can be generated the Hasse diagram with the inter-layer connection. In addition, in the process of the generation of each lattice node, we do the dynamic pruning for the concept lattice based on the minimum support degree and relevant properties, and delete a large number of non-frequent, repeat and containing nodes, such that redundant lattice nodes do not generate, thus the space and time complexities of the algorithm are greatly enhanced. The experimental results show that the algorithm has a good performance. © 2013 IFSA.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of 2-layer nonlinear piece in hand method

Cryptanalysis of 2-layer nonlinear piece in hand method

引用

CD-ARES 2013 Workshops: 2nd International Workshop on Modern Cryptography and Security engineering, MoCrySEn 2013 and 3rd International Workshop on Security and Cognitive Informatics for Homeland Defense, SeCIHD 2013

作者： Nie, Xuyun Petzoldt, Albrecht Buchmann, Johannes School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Technische Universität Darmstadt Department of Computer Science Hochschulstraße 10 64289 Darmstadt Germany State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Network and Data Security Key Laboratory of Sichuan Province China

ISBN: (纸本)9783642405877

Piece in Hand method is a security enhancement method for Multivariate Public key Cryptosystems (MPKCs). Since 2004, many types of this method have been proposed. In this paper, we consider the 2-layer nonlinear Piece in Hand method as proposed by Tsuji et al. in 2009. The key point of this method is to introduce an invertible quadratic polynomial map on the plaintext variables to construct perturbation of the original MPKC. Through our analysis, we find that the security of the enhanced scheme is mainly relying on the quadratic polynomials of this auxiliary map. The two examples proposed by Tsuji et al. for this map can not resist the Linearization Equation attack. Given a valid ciphertext, we can easily get a public key which is equivalent to the original MPKC. If there is an algorithm that can recover the plaintext corresponding to a valid ciphertext of the original MPKC, we can construct an algorithm that can recover the plaintext corresponding to a valid ciphertext of the enhanced MPKC. © IFIP International Federation for information Processing 2013.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

A broadcasting multiple blind signature scheme based on quantum GHZ entanglement

引用

International Journal of Modern Physics: Conference Series 2014年第33期ijmpcs卷

作者： Yuan Tian Hong Chen Yan Gao Honglin Zhuang Haigang Lian Zhengping Han Peng Yu Xiangze Kong Xiaojun Wen Key Laboratory of Data Engineering and Knowledge Engineering China (Remin University of China) of Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China China Computer User Association Information Protection Branch Beijing 100089 China School of Computer Science and Engineering Beihang University Beijing 100083 China School of Electronics & Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

Using the correlation of the GHZ triplet states, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature of quantum cryptography.

关键词： Broadcasting multiple blind signature quantum encryption algorithm quantum entanglement quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

A dominating set based approach to identify effective leader group of social network

A dominating set based approach to identify effective leader...

引用

19th International Computing and Combinatorics Conference, COCOON 2013

作者： Kim, Donghyun Li, Deying Asgari, Omid Li, Yingshu Tokuta, Alade O. Dept. of Mathematics and Computer Science North Carolina Central University Durham NC 27707 United States Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Renmin 100872 China Dept. of Computer Science Georgia State University Atlanta GA 30303 United States

ISBN: (纸本)9783642387678

Very recently, the study of social networks has received a huge attention since we can learn and understand many hidden properties of our society. This paper investigates the potential of social network analysis to select an effective leadership group of a society. Based on our real life observation, we establish three essential requirements for an effective leadership group, namely Influenceability, Partisanship, and Bipartisanship. Then, we formulate the problem of finding a minimum size leader group satisfying the three requirements as the minimum connected k-core dominating set problem (MCkCDSP), and show its NP-hardness. In addition, we introduce an extension of MCkCDSP, namely MCkCDSP-C, which assumes the society has a number of communities and requires at least one representative from each community should be in the leadership. At last, we propose an approximation algorithm for a subclass of MCkCDSP with k = 2, and show an α-approximation algorithm of MCkCDSP can be used to obtain an α-approximation algorithm of MCkCDSP-C. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithm for dynamic attribute reduction based on a matrix

Beijing Keji Daxue Xuebao/Journal of University of Science a...

引用

Beijing Keji Daxue Xuebao/Journal of University of Science and technology Beijing 2013年第2期35卷 249-255页

作者： Qian, Wen-Bin Yang, Bing-Ru Xu, Zhang-Yan Li, Hui School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083 China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing 100083 China School of Computer Science and Information Engineering Guangxi Normal University Guilin 541004 China

Objects in actual decision tables are often changed dynamically. Aiming at this problem, the concept of a simplified decision table is introduced firstly, and a large number of repeated objects are deleted. A simplified matrix based on the positive region is constructed, which can reduce the searching space. What's more, it is theoretically analyzed that the definition of attribute reduction based on the simplified matrix is equal to that based on the unsimplified matrix. The proposed method scans only once the simplified matrix and it can be effectively utilized to the old attribute reduction. On this condition, an efficient algorithm for dynamic attribute reduction based on a matrix was designed. Finally, an example and its experimental comparison were employed to illustrate the efficiency and feasibility of the proposed algorithm.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

A novel image retrieval method based on mutual information descriptors 1

引用

9th International Conference on Intelligent Computing, ICIC 2013

作者： Hou, Gang Zhang, Ke Zhang, Xiaoxue Kong, Jun Zhang, Ming College of Communication Engineering Jilin University Changchun China College of Humanities and Sciences Northeast Normal University Changchun China School of Computer Science and Information Technology Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (数字)9783642394829

ISBN: (纸本)9783642394812

In this paper, we propose a novel image retrieval method based on mutual information descriptors (MIDs). Under the physiological property of human eyes and human visual perception theory, MIDs are extracted to encode the internal correlation relationship among multiple image feature spaces, characterizing image contents with mutual information features based on the low-level image features, such as color, shape etc., then, the mutual information features fusion strategy is used to imitate the information transfer process in nervous system. When using the MIDs proposed to image retrieval, we can get many advantages such as low dimensionality, a certain robustness of geometric distortions and noise, and describing the human visual retrieval mechanism effectively. Experimental results show that MIDs have high indexing and retrieving performance compared with existing methods for content-based image retrieval (CBIR). © 2013 Springer-Verlag.

关键词： Vision

来源：评论

学校读者我要写书评

暂无评论

JUFE at INEX 2011 Snippet Retrieval Track

JUFE at INEX 2011 Snippet Retrieval Track

引用

Lecture Notes in Computer Science

作者： Liu, Dexi Wan, Changxuan Liao, Guoqiong Zhong, Minjuan Liu, Xiping School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9783642357336

jiangxi University of Finance and Economics (JUFE) submitted 8 runs to the Snippet Retrieval Track at INEX *** report describes an XML snippet retrieval method based on Average Topic Generalization (ATG) model used by JUFE. The basic idea of the ATG is that different element in an XML document plays different role and hence should has distinguishing importance. The ATG model sets a weight automatically to each element according to its tag or path in the XML document. Then, the BM25EW model based on the ATG is proposed to retrieve and rank the relevant elements in an XML document collection. All windows in the most relevant elements are scored and those windows with higher scores are extracted as snippets. By comparing with the runs under different strategies, the performance are discussed and analyzed in detail. © Springer-Verlag Berlin Heidelberg 2012.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Summarizing Large-Scale database Schema Using Community Detection

引用

Journal of Computer Science & technology 2012年第3期27卷 515-526页

作者：王雪周烜王珊 School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China

Schema summarization on large-scale databases is a challenge. In a typical large database schema, a great proportion of the tables are closely connected through a few high degree tables. It is thus difficult to separate these tables into clusters that represent different topics. Moreover, as a schema can be very big, the schema summary needs to be structured into multiple levels, to further improve the usability. In this paper, we introduce a new schema summarization approach utilizing the techniques of community detection in social networks. Our approach contains three steps. First, we use a community detection algorithm to divide a database schema into subject groups, each representing a specific subject. Second, we cluster the subject groups into abstract domains to form a multi-level navigation structure. Third, we discover representative tables in each cluster to label the schema summary. We evaluate our approach on Freebase, a real world large-scale database. The results show that our approach can identify subject groups precisely. The generated abstract schema layers are very helpful for users to explore database.

关键词： schema summarization large scale community detection

来源：评论

学校读者我要写书评

暂无评论

Research on XML element search results clustering

Research on XML element search results clustering

引用

6th International Conference on Management of e-Commerce and e-Government, ICMeCG 2012

作者： Zhong, Min-Juan Wan, Chang-Xuan Liu, De-Xi Jiao, Xian-Pei School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9781467329439

Clustering XML search results is an effective way to improve performance. However, the key problem is how to measure similarity between XML documents. This paper studies XML search results clustering based on element granularity and proposes one similarity measurement method. The method firstly uses latent semantic indexing technology(LSI) to obtain term semantics and then combines the XML element node content and semantic structure properties(CASS). To evaluate clustering performance, two new performance evaluation methodologies, namely R-ClusterRatio and R-DocuRatio are introduced. It is motivated by the observations of relevant documents distribution and the fact that the experiment data collection, IEEE CS corpus, do not provide classification information. Experiment results show that proposed similarity method combining term semantics with content and structure semantics integration(LSI-CASS) is feasible, and it produces better clustering quality than LSI-CAS. © 2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction of Proxy Signatures from Certificateless Signatures

A Generic Construction of Proxy Signatures from Certificatel...

引用

International Conference on Advanced information Networking and Applications (AINA)

作者： Lei Zhang Qianhong Wu Bo Qin Josep Domingo-Ferrer Peng Zeng Jianwei Liu Ruiying Du Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University China Department of Maths School of Science Xi'an University of Technology China School of Electronic and Information Engineering Beijing University of Aeronautics and Astronautics China

The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificate less public key cryptography eliminates the complicated certificates in traditional public key cryptosystems without suffering from the key escrow problem in identity-based public key cryptography. In this paper, we reveal the relationship between the two important primitives of proxy signatures and certificate less signatures and present a generic conversion from the latter to the former. Following the generic transformation, we propose an efficient proxy signature scheme with a recent certificate less signature scheme.

关键词： Artificial intelligence Bismuth Games Public key cryptography Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：