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

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

来源：评论

学校读者我要写书评

暂无评论

引用

2011 7th International Conference on Computational Intelligence and Security, CIS 2011

作者： Zuo, Yanfei Liu, Guohua Yue, Xiaoli Wang, Wei Wu, Honghua School of Computer Science and Technology Donghua University Shanghai China State Key Lab. for Novel Software Technology Nanjing University Nanjing China School of Mechanical Engineering Donghua University Shanghai China

ISBN: (纸本)9780769545844

Similarity matching is one of the most important operations for data mining over time series. But previous works mainly focus on certain data. With the development of the internet of things and sensor networks, uncertain time series are emerging from various sources, which is a new challenge for data processing. In this paper, a novel similarity matching algorithm over uncertain time series is proposed based on a simple model representing the uncertain time series. According to the certainty of the query time series and the database, similarity matching is classified to three types. Then a certain time series is extracted to represent the original uncertain time series. Finally, a similarity search algorithm for certain time series is adopted. Experimental evaluation shows that our algorithm has high efficiency for similarity matching over uncertain time series. © 2011 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Modeling aspect-oriented software architecture based on ACME

Modeling aspect-oriented software architecture based on ACME

引用

6th International Conference on computer science and Education, ICCSE 2011

作者： Rong, Mei Liu, Changlin Zhang, Guangquan Shenzhen Tourism College Jinan University Shenzhen 518053 China School of Computer Science and Technology Soochow University Suzhou 215006 China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781424497188

The crosscutting phenomena has been found at architectural level. Using aspects, AOP effectively solves the code tangling problem produced by the crosscutting phenomena at code level. This paper presents an approach to aspect-oriented software architecture design by introducing the concept of aspects into the process of software architecture design. We describe the regular architectural structure with the basic design elements of ACME, and represent the architectural aspects with the proposed extension of ACME. The example of an Online Bookstore system has been used to illustrate our proposal. © 2011 IEEE.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Dual-swarm PSO for dynamic optimization problems

A Cooperative Dual-swarm PSO for dynamic optimization proble...

引用

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Zheng, Xiangwei Liu, Hong School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Lab. for Distributed Computer Software Novel Technology Jinan 250014 China

ISBN: (纸本)9781424499533

Many practical applications are dynamic over time, which require optimization algorithms not only to converge to optimum as soon as possible but also to track the changing optimum. In this paper, a Cooperative Dual-swarm PSO (CDPSO) is proposed to deal with dynamic optimization problems. CDPSO adopts dual-swarm structure to keep swarm diversity and track the changing optimum. Fractional Global Best Formation technique is employed to construct artificial global bests which are potential to be better. Also an adaptive mutation operator is designed to maintain particle diversity. The experiments demonstrate that the proposed algorithm is effective and stable in dynamic environment. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective evaluation based Cooperative Character Modeling system

A Multi-Objective evaluation based Cooperative Character Mod...

引用

International Conference on computer Supported Cooperative Work in Design

ISBN: (纸本)9781457703874

Character Modeling is becoming more and more difficult in animation industry today. Lots of designers are usually involved to cooperatively accomplish a character by computer networks or the Internet. This paper presents a Multi-Objective evaluation based Cooperative Character Modeling system(MOCMS), which can evolve various character models to generate creative ones based on multi-objective evaluations. The objectives are designed to embody different personalities, including qualitative and quantitative aspects. The former are given by different cooperative designers while the latter are calculated automatically by computers. This can incorporate qualitative and quantitative evaluation in a formal manner. Case study demonstrates that the proposed method can evolve character models according to the designers' intentions and shorten design time. © 2011 IEEE.

关键词： Character Modeling Cooperative evaluation Interactive design Multi-objective

来源：评论

学校读者我要写书评

暂无评论

Color-mood-aware clothing re-texturing

Color-mood-aware clothing re-texturing

引用

12th International Conference on computer-Aided Design and computer Graphics, CAD/Graphics 2011

作者： Shen, Jianbing Sun, Hanqiu Mao, Xiaoyang Guo, Yanwen Jin, Xiaogang Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing 100081 China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong University of Yamanashi Japan National Key Lab. for Novel Software Technology Nanjing University China State Key Lab. of CAD and CG Zhejiang University Hangzhou 310027 China

ISBN: (纸本)9780769544977

In this paper, we present a novel color-mood-aware technique to re-texture clothing in a photograph. An efficient classification algorithm is developed to classify clothing textures using color mood scheme. To re-texture the clothing, our approach first computes the gradient maps for the cloth region to be replaced and then calculates the texture distortion coordinates on the projected cloth region according to the gradient maps. After the user selects a target clothing texture from the classified clothing texture database, the lighting and shading effects on the original photograph is transferred using the HSV color space. Experimental results show that the proposed approach successfully re-textures the clothes in photographs while preserving the geometry and lighting features. © 2011 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Distributed power and rate allocation with fairness for cognitive radios in wireless ad hoc networks

Distributed power and rate allocation with fairness for cogn...

引用

54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

作者： Guo, Songtao Zhang, Yunqiang Yang, Yuanyuan State Key Lab. of Power Transmission Equipment and System Security College of Computer Science Chongqing University Chongqing 400044 China Department of Electrical and Computer Engineering Stony Brook University Stony Brook NY 11794 United States

ISBN: (纸本)9781424492688

In this paper, we propose a distributed resource allocation framework for cognitive radio networks by using the orthogonal frequency division multiple access (OFDMA) modulation. We jointly consider the constraints of quality of service (QoS), maximum power, and minimum rates in the network to obtain optimal availab.e subcarrier sets and transmission power. The fairness of resource allocation is guaranteed by incorporating the probability that a subcarrier is occupied into the link capacity expression. We present a distributed subcarrier selection and power allocation algorithm and evaluate the algorithm through simulations. Our results confirm that the proposed algorithm outperforms the existing algorithms in terms of throughput, the number of secondary links admitted, and the fairness of resource allocation. © 2011 IEEE.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

A real-valued quantum genetic niching clustering algorithm and its application to color image segmentation

A real-valued quantum genetic niching clustering algorithm a...

引用

2011 IEEE International conference on Intelligent Computation and Bio-Medical Instrumentation, ICBMI 2011

作者： Chang, Dongxia Zhao, Yao Zheng, Changwen Institute of Information Science Beijing Jiaotong University Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing 100044 China National Key Lab. of Integrated Information System Technology Institute of Software Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9780769546230

This paper proposes a novel genetic clustering algorithm, called a real-valued quantum genetic niching clustering algorithm (RQGN), which is based on the concept and principles of quantum computing, such as the qubits and superposition of states. Our algorithm can automatically clustering a data set into clusters without the need to know the number of clusters in advance. A dynamic identification of the niches is performed at each generation to automatically evolve the optimal number of clusters as well as the cluster centers of the data set. After getting the niches of the population, a Q-gate with adaptive selection of the angle for every niches is introduced as a variation operator to drive individuals toward better solutions. The experimental results show that RQGN algorithm has high performance, effectiveness and flexibility. © 2011 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

On energy-efficient trap coverage in wireless sensor networks

On energy-efficient trap coverage in wireless sensor network...

引用

2011 32nd IEEE Real-Time systems Symposium, RTSS 2011

作者： Li, Junkun Chen, Jiming He, Shibo He, Tian Gu, Yu Sun, Youxian State Key Lab. of Industrial Control Technology Zhejiang University China Computer Science and Engineering University of Minnesota United States Pillar of Information System Technology and Design Singapore University of Technology and Design Singapore Singapore

ISBN: (纸本)9780769545912

In wireless sensor networks (WSNs), trap coverage has recently been proposed to tradeoff between the availab.lity of sensor nodes and sensing performance. It offers an efficient framework to tackle the challenge of limited resources in large scale sensor networks. Currently, existing works only studied the theoretical foundation of how to decide the deployment density of sensors to ensure the desired degree of trap coverage. However, the practical issues such as how to efficiently schedule sensor node to guarantee trap coverage under an arbitrary deployment is still left untouched. In this paper, we formally formulate the Minimum Weight Trap Cover Problem and prove it is an NP-hard problem. To solve the problem, we introduce a bounded approximation algorithm, called Trap Cover Optimization (TCO) to schedule the activation of sensors while satisfying specified trap coverage requirement. The performance of MinimumWeight Trap Coverage we find is proved to be at most O(ρ) times of the optimal solution, where ρ is the density of sensor nodes in the region. To evaluate our design, we perform extensive simulations to demonstrate the effectiveness of our proposed algorithm and show that our algorithm achieves at least 14% better energy efficiency than the state-of-the-art solution. © 2011 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Method for Trust Management in Cloud Computing: Data Coloring by Cloud Watermarking

引用

International Journal of Automation and computing 2011年第3期8卷 280-285页

作者： Yu-Chao Liu Yu-Tao Ma Hai-Su Zhang De-Yi Li Gui-Sheng Chen Department of Computer Science and Technology Tsinghua University Beijing 100084 PRC Institute of Electronic System Engineering Beijing 100141 PRC State Key Lab of Software Engineering Wuhan University Wuhan 430072 PRC School of Command Automation PLA University of Science and Technology Nanjing 210007 PRC

With the development of Internet technology and human computing, the computing environment has changed dramatically over the last three decades. Cloud computing emerges as a paradigm of Internet computing in which dynamical, scalab.e and often virtuMized resources are provided as services. With virtualization technology, cloud computing offers diverse services （such as virtual computing, virtual storage, virtual bandwidth, etc.） for the public by means of multi-tenancy mode. Although users are enjoying the capabilities of super-computing and mass storage supplied by cloud computing, cloud security still remains as a hot spot problem, which is in essence the trust management between data owners and storage service providers. In this paper, we propose a data coloring method based on cloud watermarking to recognize and ensure mutual reputations. The experimental results show that the robustness of reverse cloud generator can guarantee users＇ embedded social reputation identifications. Hence, our work provides a reference solution to the critical problem of cloud security.

关键词： Cloud computing cloud security trust management cloud watermarking data coloring.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：