检索结果-南通市图书馆

Variable solution structure can be helpful in evolutionary optimization

Science China(Information Sciences) 2015年第11期58卷 145-161页

作者： QIAN Chao YU Yang ZHOU Zhi-Hua National Key Laboratory for Novel Software Technology Nanjing University Collaborative Innovation Center of Novel Software Technology and Industrialization

Evolutionary algorithms are a family of powerful heuristic optimization algorithms where various representations have been used for solutions. Previous empirical studies have shown that for achieving a better efficiency of evolutionary optimization, it is often helpful to adopt rich representations(e.g., trees and graphs)rather than ordinary representations(e.g., binary coding). Such a recognition, however, has little theoretical justifications. In this paper, we present a running time analysis on genetic programming. In contrast to previous theoretical efforts focused on simple synthetic problems, we study two classical combinatorial problems, the maximum matching and the minimum spanning tree problems. Our theoretical analysis shows that evolving tree-structured solutions is much more efficient than evolving binary vector encoded solutions, which is also verified by experiments. The analysis discloses that variable solution structure might be helpful in evolutionary optimization when the solution complexity can be well controlled.

关键词： evolutionary algorithms genetic programming maximum matching minimum spanning tree running time computational complexity

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Fast algorithms of public key cryptosystem based on Chebyshev polynomials over finite field

引用

The Journal of China Universities of Posts and Telecommunications 2011年第2期18卷 86-93页

作者： LI Zhi-hui CUI Yi-dong XU Hui-min Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beij ing 100876 China School of Information and Communication engineering Beijing University of Posts and Telecommunications Beijing 100876 China

The computation of Chebyshev polynomial over finite field is a dominating operation for a public key cryptosystem.Two generic algorithms with running time of have been presented for this computation：the matrix algorithm and the characteristic polynomial algorithm,which are feasible but not optimized.In this paper,these two algorithms are modified in procedure to get faster execution speed.The complexity of modified algorithms is still,but the number of required operations is reduced,so the execution speed is improved.Besides,a new algorithm relevant with eigenvalues of matrix in representation of Chebyshev polynomials is also presented,which can further reduce the running time of that computation if certain conditions are satisfied.Software implementations of these algorithms are realized,and the running time comparison is given.Finally an efficient scheme for the computation of Chebyshev polynomial over finite field is presented.

关键词： Chebyshev polynomial algorithm running time square root

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The Elaboration of Flow Resistance Model for a Bag Filter Serving a 200 MW Power Plant

引用

Fluid Dynamics & Materials Processing 2020年第4期16卷 827-835页

作者： Yukun Lv Jiaxi Yang North China Electric Power University Baoding071003China

On the basis of a macro flow resistance method and the Darcy Theory,a mathematical model is elaborated to characterize the flow resistance of a bag filter serving a coal-fired power plant.The development of the theoretical model is supported through acquisition of relevant data obtained by scanning the micro structure of the bag filter by means of an electron microscope.The influence of the running time and boiler load on the flow resistance and the impact of the flow resistance on the efficiency of the induced draft fan are analyzed by comparing the results of on-site operation tests.We show that the initial operation time and the table operation time are linearly related to the flow resistance of the bag filter;with the increase of boiler load,the flow resistance of the bag filter rises approximately as a quadratic function;with the rise of resistance,the power consumption of the induced draft fan increases while the efficiency of the induced draft fan decreases.

关键词： Macro flow resistance method Darcy Theory bag filter running time boiler load

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Newton Power Flow for Study Purpose

A Newton Power Flow for Study Purpose

引用

2012 International Conference on Future Energy,Environment,and Materials

作者： Yubin Yao Benhua Gu Hong Zhao Zhengyu Xue Marine Engineering College Dalian Maritime University

The Newton power flow program which employing sparse matrix techniques needs less computer storage and running time, but makes it harder by modifying the program to adapt to further study such as power system security and continuation power flow. To meet study purpose a less complicated but fast Newton power flow algorithm is presented. A great deal of unnecessary computation is exempted in the algorithm simply by adding some selection actions in the procedure of the Jacobian matrix formation and that of Gauss elimination. The presented method needs a little more running time than the one using sparse matrix techniques, but it is much fast than the one without sparse matrix techniques and can satisfy the needs for study purpose. Experimental results validate the practicability of the presented method.

关键词： Newton power flow running time sparsity Jacobian matrix Gauss elimination

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Two modifications of GNSS receiver system in simulation with Matlab

Two modifications of GNSS receiver system in simulation with...

引用

2013年教育技术与管理科学国际会议

作者： Sichao Li Yuepeng Yan Jinhai Li Dept. of Electronics System Tech. Institute of Microelectronics of CAS

Simulation with Matlab is a basic method in design of GNSS(global navigation satellite system) receiver. Based on the theoretic analysis of spreading code generator and carrier generator in GNSS, this paper proposed modified generators of both code and carrier in Matlab after considering the characteristic of Matlab. Under the condition of different cycles of spreading code and carrier, the modified generating methods had been tested. The results show that, compared with traditional ones, the speed of modified spreading code generator raises by more than 50 times, and the speed of modified carrier generator raises by more than 110 times.

关键词： receiver of GNSS simulation with Matlab running time spreading code generator carrier generator

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：