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

Differently implicational α-universal triple I restriction method of (1, 2, 2) type

Journal of Systems Engineering and Electronics 2012年第4期23卷 560-573页

作者： Yiming Tang Fuji Ren Yanxiang Chen Information and Communication Engineering Postdoctoral Research Station Hefei University of TechnologyHefei 230009P.R.China State Key Laboratory of Virtual Reality Technology and Systems Beihang UniversityBeijing 100191P.R.China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of TechnologyHefei 230009P.R.China Institute of Technology and Science The University of TokushimaMinami Josanjima770-8506Japan

From the viewpoints of both fuzzy system and fuzzy reasoning, a new fuzzy reasoning method which contains the α- triple I restriction method as its particular case is proposed. The previous α-triple I restriction principles are improved, and then the optimal restriction solutions of this new method are achieved, especially for seven familiar implications. As its special case, the corresponding results of α-triple I restriction method are obtained and improved. Lastly, it is found by examples that this new method is more reasonable than the α-triple I restriction method.

关键词： fuzzy reasoning fuzzy system triple I method triple Irestriction method compositional rule of inference method.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive facial expression recognition based on a weighted component and global features

Adaptive facial expression recognition based on a weighted c...

引用

4th International Conference on Digital Home, ICDH 2012

作者： Li, Rui Hu, Min Wang, XiaoHua Xu, Liangfeng Huang, Zhong Chen, Xing AnHui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China School of Computer and Information Hefei University of Technology Hefei China

ISBN: (纸本)9781467313483

An adaptive facial expression recognition method based on component and global features is presented in this paper. The facial component features are highlighted for purpose of improving facial expression percent correct rate. Firstly, eyebrows, eyes, nose and mouth are divided from a facial expression image and then the component features would be gotten from these organ images which are processed by Gabor wavelets. The weighted adaptive algorithm would be used to calculate the component feature weights, the weighted component features fuse with the global feature to get a feature fusion matrix. Finally, Weighted Principal Component Analysis (WPCA) and Fisher Linear Discriminant (FLD) methods are used to reduce dimensions and classify facial expression. Experimental results show that the algorithm proposed in this paper has much more accurate recognition rate compared with the global Gabor wavelets, PCA and FLD integrated algorithm. © 2012 IEEE.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

A MMSM-based Hybrid Method for Chinese MicroBlog Word Segmentation 2

A MMSM-based Hybrid Method for Chinese MicroBlog Word Segmen...

引用

2nd CIPS-SIGHAN Joint Conference on Chinese Language Processing, CLP 2012

作者： Sun, Xiao Li, Chengcheng Tang, Chenyi Ye, Jiaqi AnHui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Anhui Hefei230009 China School of Computer Science and Engineering Dalian University of Technology Liaoning Dalian116023 China

After years of researches, Chinese word segmentation has achieved quite high precisions for formal style text. However, the performance of segmentation is not so satisfying for MicroBlog corpora. In this paper we describe a scheme for Chinese word segmentation for, MicroBlog which integrates the character-based and word-based information in the directed graph generated by MMSM model. Word-level information is effective for analysis of known words, while character-level information is useful for analysis of unknown words. A multi-chain unequal states CRF model is proposed. The proposed multi-chain unequal states CRF has two state chains with unequal states which can recognize the POS tag simultaneously. The hybrid model was effective and adopted in real-world system. © 2021 CLP 2012 - 2nd CIPS-SIGHAN Joint Conference on Chinese Language Processing. All Rights Reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A rigid structure matching-based noise data processing approach for human motion capture

A rigid structure matching-based noise data processing appro...

引用

International Workshop on Digital Media and Digital Content Management, DMDCM 2011

作者： Wei, Xiaopeng Xiao, Boxiang Zhang, Qiang Liu, Rui Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian China School of Mechanical Engineering Dalian University of Technology Dalian China

ISBN: (纸本)9780769544137

A noise data processing algorithm based on rigid structure matching for human motion capture (MoCap) is presented in this paper. The noise model is related to parts of human body, but not to trajectories of markers as most used in traditional approaches. Three issues are addressed in this method: rigid structure matching, semantic restriction and noise reduction, and they are three steps of data processing. First, human body is divided into seven main parts: head, chest, waist, hands and legs, and all parts' candidate parts are generated by algorithm of rigid structure matching from motion data. Missing markers can be automatically reconstructed by existing markers on a same rigid structure. Subsequently, one group of parts with most possibility is determined as initial processed data by semantic restriction. Finally, an impulse noise model is found based on the analysis of data, and the noise has been filtered. At the end, the main conclusions of this research are drawn, and the advantages and limitations of this approach are discussed respectively. The algorithm presented can be easily implemented and performed, and the processed motion data can be expediently used in human body animation. The efficiency of the method is illustrated by the experiments. © 2011 IEEE.

关键词： Rigid structures

来源：评论

学校读者我要写书评

暂无评论

Robotic global path-planning based modified genetic algorithm and A* algorithm

Robotic global path-planning based modified genetic algorith...

引用

3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011

作者： Zeng, Cen Zhang, Qiang Wei, Xiaopeng Dalian University of Technology Dalian Liaoning116024 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

ISBN: (纸本)9780769542966

Global path planning for mobile robot using genetic algorithm and A* algorithm is investigated in this paper. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then Dijkstra algorithm is utilized for finding a feasible collision-free path, finally the global optimal path of mobile robots is obtained based on the hybrid algorithm of A* algorithm and genetic algorithm. Experimental results indicate that the proposed algorithm has better performance than Dijkstra algorithm in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning. © 2011 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimization Conceptual Design of Product Structure Based on Variable Length Gene Expression

引用

Chinese Journal of Mechanical Engineering 2011年第1期24卷 42-49页

作者： WEI Xiaopeng ZHAO Tingting JU Zhenhe ZHANG Shi LI Xiaoxiao School of Management Dalian University of Technology Dalian 116023 China Key Laboratory of Advanced Design and Intelligent Computing of Ministry of Education Dalian University Dalian 116622 China New Energy Center Shenyang Institute of Engineering Shenyang 110136 China Liaoning Solar Energy R＆D Co. Ltd. Shenyang 110136 China Institute of Systems Engineering Northeastern University Shenyang 110004 China

It is a complicated problem for the bottom-to-top adaptive conceptual design of complicated products between structure and function. Reliable theories demand to be found in order to determine whether the structure accords with the requirement of design. For the requirement generally is dynamic variety as time passes, new requirements will come, and some initial requirements can no longer be used. The number of product requirements, the gene length expressing requirements, the structure of the product, and the correlation matrix are varied with individuation of customer requirements of the product. By researching on the calculation mechanisms of dynamic variety, the approaches of gene expression and variable length gene expression are proposed. According to the diversity of structure selection in conceptual design and mutual relations between structure and function as well as structure and structure, the correlation matrixes between structure and function as well as structure and structure are defined. By the approach of making the sum of the elements of correlation matrix maximum, the mathematical models of multi-object optimization for structure design are provided based on variable requirements. An improved genetic algorithm called segment genetic algorithm is proposed based on optimization preservation simple genetic algorithm. The models of multi-object optimization are calculated by the segment genetic algorithm and hybrid genetic algorithm. An example for the conceptual design of a washing machine is given to show that the proposed method is able to realize the optimization structure design fitting for variable requirements. In addition, the proposed approach can provide good Pareto optimization solutions, and the individuation customer requirements for structures of products are able to be resolved effectively.

关键词： gene expression multi-object optimization conceptual design genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：