负荷功率模型的最优特征选择研究

负荷功率呈现时空多样的变化特性,其影响因素众多,构建负荷功率模型的关键之一是确定模型的输入特征量。文中着重研究短期负荷功率模型的特征选择,旨在从历史负荷、气象、日期等众多特征中选出最优特征集。首先,采用最大信息系数、基于支持向量机的递归特征消除法和随机森林3种不同特征选择方法分别对输入特征集进行选择;然后,根据对比分析结果提出基于遗传算法的最优特征集搜索策略,选定XGBoost预测模型的误差指标作为适应性函数进行迭代优化搜索;最终,确定负荷功率模型的最优特征输入集。采用某地区220 kV变电站母线负荷数据进行算例分析,对比各方法所选特征集作为功率模型输入得到的负荷预测效果,验证了文中方法的有效性和准确性。     

Intelligent temperature control system of quench furnace

1　INTRODUCTIONQuenchfurnaceisakindofkeyequipmentusedtoheattreatlargecomplexcomponentsofaircraftsorrockets ,withheightof 2 4m ,containingtwoheatingroomsandaworkroom ,withsteelboardssetbetweentherooms .Bothheatingroomsareseparatedintosixsections ,eachofwhichcontainsaheatingresistancecontrolledbyapoweradjuster .Workpiecesareputinworkroom .Acentrifugalelectromotorisusedtoblowhotairintoworkroomfromheatingroom .Thede mandofalloyintemperature risingrateandstableve racityatfixedtemperaturepointi…     

人工智能在冷轧带肋钢筋工艺参数优化中的应用

论述了人工智能在冷轧带肋钢筋工艺参数优化中的应用,首先利用神经网络建立起冷轧带肋钢筋工艺参数与产品抗拉强度之间关系的数学模型,然后用遗传算法对工艺参数优化。按优化后的工艺参数在某拉丝加工厂进行了大批量生产试验,产品的合格率达到98%以上,从而为控制冷轧带肋钢筋工艺参数提供了一条行之有效的途径。     

基于人工智能的钛合金热变形工艺参数优化

在深入分析热变形工艺参数对Ti-15-3合金显微组织及成形载荷的影响的基础上,以变形温度、变形程度和变形速率等热变形工艺参数作为设计变量,以显微组织和成形力的最佳综合为目标,建立了该合金热塑性成形工艺参数的多目标优化数学模型。以显微组织参数和成形力的人工神经网络预测模型作为优化算法的知识源,将人工神经网络与修正的遗传算法相结合,对Ti-15-3合金的热塑性成形工艺参数进行优化。结果表明,提出的修正的遗传算法是有效的,采用将其与人工神经网络相结合的方法对钛合金的热塑性成形工艺参数进行优化是可行的。     

基于遗传算法的产品制造的优化调度

研究了企业产品制造的调度问题 ,并建立了调度的最小模型。引入效率函数 ,运用遗传退火进化算法实现了调度决策的优化 ;提出了将遗传退火算法和分派规则相结合的调度策略和动态编码的方法 ,放宽了约束条件 ,提高了搜索效率和速度 ,保证其全局收敛性。     

基于优进策略的遗传算法对重油热解模型参数的估计

针对常规遗传算法全局寻优效率偏低的弱点，提出了一种优进策略，用以改进常规遗传算法。该策略将从繁衍过程中获取进化信息，自适应地改进子代分布，适时引入确定性操作，以提高全局寻优性能。提出的相关技术包括维持种群的多样性、改进交叉算子、增加Powell寻优算子等。实例测试表明这种优进策略效果良好，并已成功地应用于重油热解三集总动力学复杂数学模型的非线性参数估计。     

基于RBF神经网络的遗传算法在织物染色配色中的应用研究

本文提出一种基于RBF神经网络的遗传算法解决织物染色配色问题的模型,该模型以遗传算法为主,通过使用RBF神经网络建立遗传算法的适应度函数来共同解决织物染色配色问题。通过实验表明,使用基于RBF神经网络的遗传算法配色模型可以快速提供满足企业要求的染色配方。     

生物工程及其在化学工业中的应用

生物工程是近年来崛起的一门综合性的高新科学技术，也是当代新技术革命中最为活跃的领域。文章简要地介绍和评述了生物工程的主要内容及其在化学工业中应用的概况及发展趋势。     

A genetic tango attack against the David–Prasad RFID ultra‐lightweight authentication protocol

Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra‐lightweight) RFID environments. One of these proposals is the David–Prasad ultra‐lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.     

Using the genetic algorithm to enhance nonnegative matrix factorization initialization

Nonnegative matrix factorization (NMF) algorithms have been utilized in a wide range of real applications; however, the performance of NMF is highly dependent on three factors including: (1) choosing a problem dependent cost function; (2) using an effective initialization method to start the updating procedure from a near‐optimal point; and (3) determining the rank of factorized matrices prior to decomposition. Due to the nonconvex nature of the NMF cost function, finding an analytical‐based optimal solution is impossible. This paper is aimed at proposing an efficient initialization method to modify the NMF performance. To widely explore the search space for initializing the factorized matrices in NMF, the island genetic algorithm (IGA) is employed as a diverse multiagent search scheme. To adapt IGA for NMF initialization, we present a specific mutation operator. To assess how the proposed IGA initialization method efficiently enhances NMF performance, we have implemented state‐of‐the‐art initialization methods and applied to the Japanese Female Facial Expression dataset to recognize the facial expression states. Experimental results demonstrate the superiority of the proposed approach to the compared methods in terms of relative error and fast convergence.