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

2012 International Conference on computer science and Electronics Engineering, ICCSEE 2012

作者： Fu, Xuan Liu, Hao Fan, Yaoqun Zhao, Xinchao School of Science Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769546476

This paper introduces difference mutation idea for diversified search to elitist search-based immune optimization algorithm for function optimization. The idea of difference mutation is merged into the process of clonal selection and hupermutation algorithm, so that the new solutions have the tendency to get close to the global optimal solution. The introduction of differential algorithm idea greatly accelerates the convergence speed and makes the search algorithm produces better performance under a fixed number of steps. In short, the performance of the immune algorithm is greatly improved by introduction of differential algorithm. © 2012 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Image retargeting quality assessment

Image retargeting quality assessment

引用

32nd Annual Conference on European Association for computer Graphics, EUROGRAPHICS 2011

作者： Liu, Yong-Jin Luo, Xi Xuan, Yu-Ming Chen, Wen-Feng Fu, Xiao-Lan TNList Department of Computer Science and Technology Tsinghua University China State Key Lab. of Brain and Cognitive Science Institute of Psychology Chinese Academy of Sciences China

Content-aware image retargeting is a technique that can flexibly display images with different aspect ratios and simultaneously preserve salient regions in images. Recently many image retargeting techniques have been proposed. To compare image quality by different retargeting methods fast and reliably, an objective metric simulating the human vision system (HVS) is presented in this paper. Different from traditional objective assessment methods that work in bottom-up manner (i.e., assembling pixel-level features in a local-to-global way), in this paper we propose to use a reverse order (top-down manner) that organizes image features from global to local viewpoints, leading to a new objective assessment metric for retargeted images. A scale-space matching method is designed to facilitate extraction of global geometric structures from retargeted images. By traversing the scale space from coarse to fine levels, local pixel correspondence is also established. The objective assessment metric is then based on both global geometric structures and local pixel correspondence. To evaluate color images, CIE lab.color space is utilized. Experimental results are obtained to measure the performance of objective assessments with the proposed metric. The results show good consistency between the proposed objective metric and subjective assessment by human observers. © 2011 The Author(s).

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

View-space meta-ball approximation by depth-independent accumulative fields 16

View-space meta-ball approximation by depth-independent accu...

引用

2016 SIGGRAPH ASIA Technical Briefs, SA 2016

作者： Xu, Tian-Chen Wu, En-Hua University of Macau China Faculty of Science and Technology University of Macau China State Key Lab. of CS Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450345415

This paper presents a novel approach to fast rendering realistic meta-balls in view space. Meta-ball rendering is widely used in computer graphics to represent liquid drops, and especially important to particle-based fluid dynamics for the rendering on the final stage. Traditionally, meta-balls are procedurally modeled in object space according to implicit surface extraction and rendered as meshes. Instead of such consuming geometry-based methods, our algorithm is executed at screen-space level, and it utilizes the features of GPU, which demands low overheads and thus is much faster. Compared with other screen-space methods of particle rendering, our method obeys the basic principle of implicit surface. Consequently, real-time meta-ball rendering can be achieved very efficiently in a significantly high quality. © 2016 ACM.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Mining frequent itemsets using node-sets of a prefix-tree

Mining frequent itemsets using node-sets of a prefix-tree

引用

23rd International Conference on Database and Expert systems Applications, DEXA 2012

作者： Qu, Jun-Feng Liu, Mengchi State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9783642325991

Frequent itemsets are important information about databases, and efficiently mining frequent itemsets is a core problem in data mining area. The divide-and-conquer strategy is very applicable to the problem. Most algorithms adopting the strategy construct a very large number of conditional databases when mining frequent itemsets. Representations of conditional databases and methods of constructing them greatly influence the performance of such algorithms. In this study, we propose a node-set structure for representing a conditional database, and develop a novel node-set-based algorithm, NS, for mining frequent itemsets. During a mining process, all the node-sets derive from a prefix-tree storing the complete frequent itemset information about the mined database. Compared with previous conditional database representations, node-sets are compact and contiguous on which NS can be performed fast. Constructing conditional databases involves counting for items. In NS, the counting procedure and the construction procedure are blended, which saves the time for scanning conditional databases, and further, the major operations of constructing conditional databases are very simple comparisons. Experimental data show that NS outperforms several famous algorithms including FPgrowth* and LCM, ones of the fastest algorithms, for various databases. © 2012 Springer-Verlag.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Program slicing based web-service generation and composition

Program slicing based web-service generation and composition

引用

5th IEEE International Symposium on Service-Oriented system Engineering, SOSE 2010

作者： Fu, Wei Zhang, Yingzhou Han, Wei Fan, Xiaowei Yang, Geng College of Computer Nanjing Univ. of Posts and Telecomm. Nanjing 210003 China State Key Lab. of Networking and Switching Technology Beijing Univ. of Posts and Telecomm. Beijing 100876 China State Key Lab. of Novel Software Technology Nanjing Univ. Nanjing 210093 China

ISBN: (纸本)9780769540818

As the development of web services, much attention has been drawn to web service because of its convenience and platform-independence. However, how to discover, generate and compose services has become an open issue recently. This paper proposes a method based on program slicing to realize the generation and composition of web services. It gives the method about how to generate a WSDL file and a SOAP message from source codes as well as a theory of function dependence graph. The results of experiments show that our methods of web service generation and composition are feasible and effective. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for frequent itemset mining using Patricia* structures

A fast algorithm for frequent itemset mining using Patricia*...

引用

14th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2012

ISBN: (纸本)9783642325830

Efficient mining of frequent itemsets from a database plays an essential role in many data mining tasks such as association rule mining. Many algorithms use a prefix-tree to represent a database and mine frequent itemsets by constructing recursively conditional prefix-trees from the prefix-tree. A (conditional) prefix-tree can be stored in various structures. The construction and traversal costs of prefix-trees, or rather their storage structures, take a large proportion in the whole cost for such algorithms. The PatriciaMine algorithm employs a Patricia trie to store a prefix-tree and shows good performance. In this study, we introduce an efficient Patricia*structure for storing a prefix-tree. A Patricia*structure is more compact and contiguous than a corresponding Patricia trie, and thus the construction and traversal costs of the former are less than those of the latter. Previous prefix-tree-based algorithms adopt a similar mining procedure, in which most nodes in a prefix-tree are repeatedly accessed when the prefix-tree is processed. The paper presents a novel mining procedure in which node accesses for a prefix-tree are greatly reduced. We propose the PatriciaMine* algorithm that is the combination of the Patricia*structure with the proposed procedure. Experimental data show that PatriciaMine*outperforms not only PatriciaMine but also several fast algorithms, such as FPgrowth*and dEclat, for various databases. © 2012 Springer-Verlag.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Mining high utility itemsets without candidate generation 12

Mining high utility itemsets without candidate generation

引用

21st ACM International Conference on Information and Knowledge Management, CIKM 2012

作者： Liu, Mengchi Qu, Junfeng State Key Lab. of Software Engineering School of Computer Wuhan University Wuhan 430072 China School of Computer Science Carleton University Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781450311564

High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays a crucial role in many real-life applications and is an important research issue in data mining area. To identify high utility itemsets, most existing algorithms first generate candidate itemsets by overestimating their utilities, and subsequently compute the exact utilities of these candidates. These algorithms incur the problem that a very large number of candidates are generated, but most of the candidates are found out to be not high utility after their exact utilities are computed. In this paper, we propose an algorithm, called HUI-Miner (High Utility Itemset Miner), for high utility itemset mining. HUI-Miner uses a novel structure, called utility-list, to store both the utility information about an itemset and the heuristic information for pruning the search space of HUI-Miner. By avoiding the costly generation and utility computation of numerous candidate itemsets, HUI-Miner can efficiently mine high utility itemsets from the utility-lists constructed from a mined database. We compared HUI-Miner with the state-of-the-art algorithms on various databases, and experimental results show that HUI-Miner outperforms these algorithms in terms of both running time and memory consumption. © 2012 ACM.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Selection methods research based on stochastic ranking for constrained optimization

Selection methods research based on stochastic ranking for c...

引用

2012 International Conference on computer science and Electronics Engineering, ICCSEE 2012

作者： Jiang, Ling Zhao, Wei Li, Bo Qin, Yiwen Zhao, Xinchao School of Science Beijing University of Posts and Telecommunications Beijing 100876 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

ISBN: (纸本)9780769546476

This paper describes some general constrained optimization problem-solving methods at first, and then different ideas of combining particle swarm optimization with stochastic ranking are proposed. Accordingly, three algorithms (SR1, SRe1, SRhs) are constructed together with disturbance idea and their pros and cons are analyzed. Finally, some typical benchmarks are used to confirm their performance and achieve better results. © 2012 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Research on semantic-based Web services registry federation

引用

4th International Conference on Grid and Cooperative Computing - GCC 2005

作者： Li, Bing He, Fei Liu, Wudong He, Keqing Liu, Jin State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China Graduate School of Science and Engineering Waseda University Tokyo 169-8555 Japan

ISBN: (纸本)3540305106

Meta modeling is an effective approach to implement interoperability among distributed and heterogeneous information sources on Web. MMFI (Framework for Metamodel Interoperability) is a set of meta objects and Metamodel constructs to be used in the development a metamodel in actual implementation of information registry and repository. As a scalab.e solution to requirements of semantic interoperation between heterogeneous and autonomous Web services registries, we provide an ontological metamodeling approach to combine MMFI with technologies from the federated information management to create an architecture for Web services registry federation. A software component service registry prototype system implemented based on these methods is introduced. © Springer-Verlag Berlin Heidelberg 2005.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

A New Method for Meet-in-the-Middle Attacks on Reduced AES

引用

China Communications 2011年第2期8卷 21-25页

作者：董晓丽胡予濮韦永壮陈杰 Key Lab. of Computer Networks & Information Security Ministry of EducationXidian University School of Information and Communication Guilin University of Electronic Technology State Key Lab. of Information Security Institute of SoftwareChinese Academy of Sciences

A new 5-round distinguisher of AES with key whitening is presented by using the properties of its round transformation. Based on this distinguisher,we present new meet-in-the-middle attacks on reduced AES considering the key schedule and the time-memory tradeoff approach. New attacks improve the best known meet-in-the-middle attacks on reduced AES presented at *** reduce the time complexity of attacks on 7-round AES-192 and 8-round AES-256 by a factor of at least 28. Moreover,the distinguisher can be exploited to develop the attack on 8-round AES-192.

关键词： AES Rijndael cryptanalysis meet-in-the-middle attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：