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

Laplacian coordinates-based motion transition for data-driven motion synthesis

IET Image Processing 2012年第9期6卷 1331-1337页

作者： Yi, P. Zhang, Q. Wei, X. School of Mechanical and Engineering Dalian University of Technology Dalian 116024 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

As a fundamental technique in data-driven (or example-based) methods, motion blending has been employed to produce new motion clip from two or more clips or introduced as a medium to improve the final result of other method, for example, motion graphs. As methods of motion blending always require the system or users to classify the motion samples, it is difficult to accomplish motion blending automatically and to preserve local details, such as angular accelerations of joints of original motions. In this study, the authors developed a framework based on Laplacian coordinates to produce transitions between two motion clips, emphasising on preserving local details, without any need of motion classification. At first, multidimensional Laplacian coordinates are introduced to present local details of joints' angle. Then an error function is deduced to measure how much result motions differ from original ones in local details. By minimising such error function, new motions can then finally generated, which can preserve local details of input motion clips as much as possible. The following experiments show the effectiveness of the authors' framework. © The Institution of Engineering and Technology 2012.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Accelerating GPGPU architecture simulation 13

Accelerating GPGPU architecture simulation

引用

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

作者： Zhibin Yu Lieven Eeckhout Nilanjan Goswami Tao Li Lizy John Hai Jin Chengzhong Xu Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China ELIS Department Ghent University Ghent Belgium Intelligent Design of Efficient Architectures Lab University of Florida Gainesville USA Department of Electrical and Computer Engineering University of Texas at Austin Austin USA Service Computing Technologies and System Lab/Cluster and Grid Computing Lab HUST Wuhan China Department of Electrical and Computer Engineering Wayne State University Detroit USA

ISBN: (纸本)9781450319003

Recently, graphics processing units (GPUs) have opened up new opportunities for speeding up general-purpose parallel applications due to their massive computational power and up to hundreds of thousands of threads enabled by programming models such as CUDA. However, due to the serial nature of existing micro-architecture simulators, these massively parallel architectures and workloads need to be simulated sequentially. As a result, simulating GPGPU architectures with typical benchmarks and input data sets is extremely time-consuming. This paper addresses the GPGPU architecture simulation challenge by generating miniature, yet representative GPGPU kernels. We first summarize the static characteristics of an existing GPGPU kernel in a profile, and analyze its dynamic behavior using the novel concept of the divergence flow statistics graph (DFSG). We subsequently use a GPGPU kernel synthesizing framework to generate a miniature proxy of the original kernel, which can reduce simulation time significantly. The key idea is to reduce the number of simulated instructions by decreasing per-thread iteration counts of loops. Our experimental results show that our approach can accelerate GPGPU architecture simulation by a factor of 88X on average and up to 589X with an average IPC relative error of 5.6%.

关键词： micro-architecture simulation performance general purpose graphics processing unit (GPGPU)

来源：评论

学校读者我要写书评

暂无评论

Enhanced hybrid search algorithm for protein structure prediction using the 3D-HP lattice model

引用

Journal of molecular modeling 2013年第9期19卷 3883-91页

作者： Changjun Zhou Caixia Hou Qiang Zhang Xiaopeng Wei Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian China. zhou-chang231@***

The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A RGB image encryption algorithm based on DNA encoding and chaos map

引用

Computers and Electrical Engineering 2012年第5期38卷 1240-1248页

作者： Lili Liu Qiang Zhang Xiaopeng Wei Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

In this paper, a RGB image encryption algorithm based on DNA encoding combined with chaotic map is proposed aiming at characteristics of RGB image. The algorithm firstly carries out DNA encoding for R, G, B components of RGB image; then realizes the addition of R, G, B by DNA addition and carries out complement operation by using the DNA sequence matrix controlled by Logistic; three gray images are got after decoding; finally gets the encrypted RGB images by reconstructing R, G, B components which use image pixels disturbed by Logistic chaotic sequence. Simulation result shows that the proposed algorithm has a large secret key space and strong secret key sensitivity. Meanwhile, it can resist exhaustive attack, statistical attack, and thus it is suitable for RGB image encryption.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research of DNA sequences sets based on the improved genetic algorithm

引用

Journal of Computational and Theoretical Nanoscience 2012年第7期9卷 969-973页

作者： Xia, Xue Zhang, Qiang Wang, Bin Zhao, Yuxia Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

With the continuous development of biotechnology, DNA computing will bring rapid development to the mathematics, computer science and other fields. As the foundation and the core issue of DNA computing, DNA encoding can be divided into two aspects, one is the quality optimization and the other is set design. The main research methods are theoretical analysis and algorithm design. In this paper, the traditional genetic algorithm is improved in the initialization, selection and mutation operations. We use fixed probability selection and adaptive multi-bits mutation operations in the improved genetic algorithm (IGA). The IGA is used in the DNA code set design under the combinatorial constraints satisfied the Hamming distance and Reverse Hamming distance constraint. The experimental shows our results are better than the earlier results in the literature. © 2012 American Scientific Publishers All rights reserved.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Comparison of wavelet, contourlet and dual-tree complex wavelet for palmprint recognition

引用

ICIC Express Letters, Part B: Applications 2012年第8期6卷 2005-2010页

作者： Wei, Xiaopeng Liu, Jianyang Zhang, Jianxin Zhang, Qiang Key Lab of Advanced Design and Intelligent Computing Ministry of Education Dalian University Economic Technological Development Zone No. 10 Xuefu Ave Dalian 116622 China

Many multi-resolution analysis methods have been proposed for palmprint recognition due to the fact that there are three types of lines in human palm. In this pa- per, we make a systematic comparison of discrete wavelet transform (DWT), contourlet transform (CT) and dual-tree complex wavelet transform (DT-CWT) for palmprint recognition to find a better palmprint multi-resolution representation. In each method, the detail palmprint images or subbands are divided into several non-overlapping blocks, and the energy of each block is computed as recognition feature. The three methods are tested on the public PolyU Palmprint Database with various resolution levels and block numbers. Experiment results show that the best equal error rates achieved by DWT, CT and DT-CWT are 2.46%, 1.61% and 1.50%, respectively, which are mainly obtained by using smaller size non-overlapping blocks. The directional information can significantly improve the recognition accuracy, and the shift invariance property makes little contribution to the improvement of the recognition performance because the palmprint images for feature extraction have been preprocessed and normalized. © 2012 ICIC International.

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

A novel image encryption algorithm based on DNA subsequence operation

The Scientific World Journal

引用

The Scientific World Journal 2012年第1期2012卷 286741页

作者： Zhang, Qiang Xue, Xianglian Wei, Xiaopeng Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education of Dalian University Dalian 116622 China

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. © 2012 Qiang Zhang et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison of wavelet, contourlet and dual-tree complex wavelet for palmprint recognition

引用

ICIC Express Letters 2012年第8期6卷 2005-2010页

作者： Wei, Xiaopeng Liu, Jianyang Zhang, Jianxin Zhang, Qiang Key Lab of Advanced Design and Intelligent Computing Ministry of Education Dalian University No. 10 Xuefu Ave Economic Technological Development Zone Dalian 116622 China

Many multi-resolution analysis methods have been proposed for palmprint recognition due to the fact that there are three types of lines in human palm. In this paper. we make a systematic comparison of discrete wavelet transform (DWT), contourlet transform (CT) and dual-tree complex wavelet transform (DT-CWT) for palmprint recognition to find a better palmprint multi-resolution representation. In each method, the detail palmprint images or subbands are divided into several non-overlapping blocks, and the energy of each block is computed as recognition feature. The three methods are tested on the public PolyU Palmprint Database with various resolution levels and block numbers. Experiment results show that the best equal error rates achieved by DWT. CT and DT-CWT are 2.46%, 1.61% and 1.50%. respectively, which are mainly obtained by using smaller size non-overlapping blocks. The directional information can significantly improve the recognition accuracy, and the shift invariance property makes little contribution to the improvement of the recognition performance because the palmprint images for feature extraction have been preprocessed and normalized. © 2012 ICIC International.

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Plant growth simulation algorithm for solving indeterminate equation

引用

ICIC Express Letters, Part B: Applications 2012年第4期3卷 969-974页

作者： Li, Tong Zhang, Cuihong Su, Weiling Management College Hangzhou Dianzi University Xiasha Higher Education Zone Hangzhou 310018 China Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University No. 10 Xuefu Ave.Economic Technological Development Zone Dalian 116622 China

Based on Plant Growth Simulation Algorithm (PGSA), an intelligence optimization algorithm for solving Indeterminate equation is proposed herein. In this algorithm, the initial plant growth point is obtained after three times fractals of L-system, the solution space of Diophantine equation is looked as plant growth environment, and then the plant system evolution style based on growth regulation and the probability growth model based on plant phototropism theory are established. By solving typical questions, the algorithm PGSA shows its high accuracy for searching and strong stability for solutions. This algorithm herein tries to change the present research situation "one solution to one equation" for solving Indeterminate equation. © 2012 ICIC International.

关键词： Indeterminate equation Intelligence algorithm Plant growth simulation algorithm (pgsa) Plant phototropism

来源：评论

学校读者我要写书评

暂无评论

Research on fractional order controller based on best rational approximation approach

引用

Journal of Convergence Information Technology 2012年第4期7卷 50-58页

作者： Zhao, Huimin Nie, Bing Li, Wen Deng, Wu Software Institute Dalian Jiaotong University Dalian 116028 China Key Laboratory of Numerical Simulation in the Sichuan Provincial College Neijiang Normal University Neijiang 641112 China Artificial Intelligence Key Laboratory of Sichuan Province Sichuan University of Science and Engineering Zigong 643000 China State Key Laboratory of Power Transmission Equipment and System Security and New Technology College of Electrical Engineering Chongqing University Chongqing 400044 China Key Laboratory of advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

Introduce the basic concept of best rational approximation and constructing procedure of the best rational approximation function in Laplace domain. By an illustrative example the design method of FOC based on best rational approximation is discussed. The performance comparison of transfer functions between the FOC obtained by best rational approximation method and conventional PID shows that it is effective to apply the method in design of FOC, which can guarantee maximum absolute error of amplitude frequency characteristic of approximation function in a given error tolerance.

关键词： Rational functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：