Quantitative genetic models of sexual selection

Summary Quantitative genetic models of sexual selection have disporven some of the central tenets of both the handicap mechanism and the sexy son hypothesis. These results suggest that the good genes approach to sexual selection may generally lead to erroneous results.Runaway sexual selection seems possible under a wide variety of circumstances. Quantittive genetic models have revealed runaway processes for sexually selected attributes expressed in both sexes and for attributes of parental care. Furthermore, the runaway could occur simultaneously in a series of populations that straddle an environmental gradient. While the models support the feasibility of runaway processes, empirical studies are needed to evaluate whether runaways actually happen. Estimates of critical genetic parameters are particularly needed, as well as measures of natural and sexual selection acting on the same population.The models also show that sexual selection has tremendous potential to produce population differentiation, particularly in epigamic traits. Differentiation is promoted by indeterminancy of evolutionary outcome, transient differences among populations during the final slow approach to equilibrium, sampling drift among equilibrium populations, and the tendency of sexual selection to amplify geographic variation arising from spatial differences in natural selection. Recent work with two- and three-locus models of sexual selection has produced results that parallel the results of the polygenic models^36–38,58. Thus the feature of indeterminate equilibria (outcome dependent on initial conditions) is common to both types of model.     

The Young-Householder algorithm and the least squares multidimensional scaling of squared distances

It is shown that replacement of the zero diagonal elements of the symmetric data matrix of approximate squared distances by certain other quantities in the Young-Householder algorithm will yield a least squares fit to squared distances instead of to scalar products. Iterative algorithms for obtaining these replacement diagonal elements are described and relationships with the ELEGANT algorithm (de Leeuw 1975; Takane 1977) are discussed. In large residual situations a penalty function approach, motivated by the ELEGANT algorithm, is adopted. Empirical comparisons of the algorithms are given.An early version of this paper was presented at the Multidimensional Data Analysis Workshop, Pembroke College, Cambridge, July 1985. I want to thank Jan de Leeuw and Yoshio Takane for bringing the ELEGANT algorithm to my attention and for clarifying its rationale and notation. My thanks go also to Stephen du Toit for help with the ALSCAL computations reported in Section 7.     

基于SSA-LSTM-GF的混凝土坝变形预测方法

针对混凝土坝变形分析预测的复杂性,应用相空间重构思想和融合建模理念,提出了一种基于SSA-LSTM-GF的混凝土坝变形分析预测方法。SSA-LSTM-GF方法利用奇异谱分析法(SSA)将变形实测数据序列分解为趋势分量、周期分量和剩余分量,并将剩余分量视为噪声分量予以剔除;采用长短期记忆神经网络(LSTM)模型和高斯拟合(GF)算法分别进行周期分量和趋势分量的分析预测,并将二者结果进行叠加重构,得到最终预测结果。实例验证结果表明,SSA可以达到较好的数据分解和消噪效果,LSTM模型针对周期分量的预测性能优越,GF算法能够很好地实现趋势分量的拟合预测和部分信息的挖掘提取,LSTM模型和GF算法的成果重构效果良好,SSA-LSTM-GF方法具有一定的可行性和应用价值。     

应用禁忌粒子群算法的车间调度及其并行化实现

为了解决批量生产、制造、装配等车间调度问题,基于Hadoop集群,提出应用禁忌粒子群算法的车间调度及其并行化实现.以某装载机制造车间最小化完成时间为目标,通过使用禁忌粒子群算法对车间调度问题进行求解.结果表明：在车间批量大的情况下,禁忌粒子群算法可得出有效的调度方案,避免算法陷入局部最优解.与现有的智能算法相比,禁忌粒子群算法更有利于实现全局最优解.     

一种磁流变弹性体执行器的联合优化方法研究

磁流变弹性体（magnetorheological elastomer, MRE）执行器作为智能减振应用系统的核心元件,其结构的优化是决定执行器性能上限及系统控制成效的关键。针对目前MRE执行器优化方法及理论研究欠缺的问题,文中面向一款横向隔振的MRE执行器,基于其机械结构和有效磁路,以优越磁控性能、低功耗和快速响应时间为优化目标,提出了一种新的MRE执行器联合参数优化方法。首先,基于MATLAB和COMSOL的联合仿真,将遗传优化算法和电磁有限元分析方法进行有效结合,实现对MRE执行器的优化编程;其次,完成对器件的全局尺寸结构优化设计,使得器件具备优越磁控性能（526.21 mT）、低功耗（44.05 W）及快速响应（5.43 ms）;最后,通过搭建测试系统对优化后装配的MRE执行器进行测试和评估,验证了文中优化方法的可行性和有效性。提出的联合优化方法不仅适用于MRE执行器结构,还可为多领域减/隔振应用的共性MRE器件优化设计提供理论参考。     

基于量子微粒群优化算法的半透明介质光学参数反演

针对半透明介质光学参数估计问题,建立了脉冲激光辐照下半透明介质光学参数反演模型,采用量子微粒群优化(QPSO)算法反演了折射率和吸收系数,分析了测量误差、热物性参数对反演结果的影响,并利用敏感性分析揭示了反演精度与测量误差的关系.计算结果表明：建立的反演模型和采用的QPSO算法可以精确估计折射率和吸收系数,即使人为添加10%的测量误差,反演结果依然具有较强的鲁棒性和准确度.本研究可为半透明介质物性参数获取提供技术参考.     

利用早停可微架构搜索的三维点云模型分类

针对现有三维点云分类网络采用人工设计费时费力的问题,提出早停可微架构搜索(early-stopping differentiable architecture search,ES-DARTS)算法。利用从人工设计网络架构中提取到的先验知识,预定义一个包含高效候选操作的搜索空间,可快速搜索出适用于三维模型分类任务的高性能网络模型;通过追踪网络搜索阶段各候选操作的权重变化,找出跳跃连接操作在双重优化过程中发挥不公平竞争作用的临界点并在此处停止搜索,以保证各候选操作之间的稳定性,解决DARTS算法搜索过程中易出现性能崩溃的问题。提出的算法在ModelNet40数据集上达到了93.2%的识别准确率,比当前人工设计的主流网络具有更高的识别准确率。     

基于掺铕钨酸盐荧光强度比的非接触温度传感

为了突破传统测温技术应用的局限性,利用NaY （WO₄）₂：Eu³⁺玻璃陶瓷（glass ceramics,GC）实现了具有非接触、实时响应、自校准等优势的双模荧光强度比（luminescence intensity ratio,LIR）测温。采用高温熔融淬灭法制备出含NaY （WO₄）₂：Eu³⁺纳米晶的透明GC样品,并进行系列光谱测量和热敏性能分析。结果表明,样品中Eu³⁺的激发态能级⁵D₁和⁵D₀和基态能级⁷F₂和⁷F₀为两对独立的热耦合能级,可分别基于这两对热耦合能级实现性能优异的双模LIR温度传感。该双模LIR测温技术数据可靠、测温范围广、灵敏度高,再结合GC材料优势,是可用于光纤温度传感器的核心技术材料。     

Sylvester矩阵方程的改进IO迭代算法

通过对Sylvester矩阵方程的理论分析,可知IO迭代算法中迭代矩阵的谱半径随内迭代次数的增大而减小,更新了IO迭代算法中内迭代次数的选择方法,并证明了该算法收敛性与初始矩阵无关。Sylvester矩阵在满足一些特定条件下,为了进一步提高收敛速度,可通过选择适当的相关参数,使得IO迭代算法有较好的收敛速度且比Smith算法的迭代次数明显减少。     

PRM蚁群融合算法的AGV路径规划研究

针对AGV运货时需一次性取多件货物的路径规划问题,提出一种PRM算法与蚁群算法相结合的融合算法,将问题拆分为路径的选择与TSP问题分布解决,即先利用PRM算法进行AGV路径规划,再利用蚁群算法决策出取货顺序,生成总的路径。最后采用matlab进行仿真实验,并与A*算法进行对比,结果证明了PRM蚁群融合算法比A*算法得出的路径更短、效率更高。