Nature inspired 21 branches sneezewort/Achillea ptarmica plant growth pattern–shaped antenna for Ku‐band applications

This reported paper presents the design and analysis of wideband nature inspired planar antenna of 46 × 18 × 1.6 mm³ size, designed using FR4 (Flame Retardant) substrate. The antenna patch is delineated from the growth pattern of sneezewort plant with supplementary notion of golden ratio in branching and branch width. The total number of branches in each stage follows the Fibonacci series and the branch width is calculated from the golden ratio concept. Starting from one feed line and two branches, the maximum numbers of branches are increased to 20. There has been significant enhancement in the radiation performance of proposed geometry by increasing the number of branches to 21 and by modifying ground with T‐shaped slot. The antenna covers wide impedance bandwidth of 8.2 to 16.5 GHz by possessing stable radiation characteristics.     

Effective solar power harnessing using a few novel solar tree designs and their performance assessment

Solar irradiance being considered as one of the most important alternative sources of energy can be harnessed in the form of electrical power using photovoltaic panels erected under the sun. Optimum conversion of power from solar panels can be obtained by using Maximum Power Point Tracking (MPPT), which involves continuously adjusting the angle of panels according to the change in the angle of falling irradiance. These trackers, however, use some amount of power for operation of MPPT equipment. Various techniques for arranging the solar panels in three dimensions have been suggested for optimizing the output power from them. The inspiration behind arranging the panels are often drawn from the natural trees where the branches and the leaves follow a particular pattern called phyllotaxy which is directly analogous to the Fibonacci number and Golden ratio. In this research work, the power output from two solar tree models based on 3/8 and 2/5 phyllotaxy pattern and solar conventional panel compared under similar irradiance conditions. There are so many phyllotaxy patterns like 1/3, 2/5, 3/8, etc. When the solar panels aligned in different phyllotaxies, then the orientation direction of solar panels are distinct. Each solar panel connected in solar trees is in a different direction, so that they received the maximum amount of sunlight throughout the day as compared to conventional panels which is oriented unidirectional.     

多峰函数优化的黄金分割斐波那契树优化算法

针对多峰函数优化问题，基于斐波那契树优化算法，结合黄金分割思想，提出一种黄金分割斐波那契树优化算法.该算法利用斐波那契树优化算法全局局部交替寻优特性，通过在寻优过程中对优化问题解空间进行黄金分割比例压缩，从而提高算法局部搜索能力与小峰值搜索能力.多峰函数优化的仿真结果表明，该算法多峰优化能力强、速度快、精度高.     

弹性波在准周期镜像固/液声子晶体中的透射

基于准周期Fibonacci序列,构建了准周期镜像结构固液介质声子晶体。利用转移矩阵法,数值研究了弹性波在其中的透射。弹性波正入射时,在奇数序列镜像声子晶体透射谱的带隙内出现多个谐振模,而在偶数序列镜像声子晶体透射谱的带隙内仅有弱透射峰;上、下带边的谐振随序列数的增加而增强。弹性波斜入射时,透射谱向高频区移动;入射角较小时,谐振模也向高频区移动,同时产生了次级禁带;入射角较大时,带隙内的谐振模消失,带隙间的频率间距减小。     

一种基于Fibonacci数的有序线性表查找算法

在设计F ibonacci(菲波那契)查找算法的基础上定义了F ibonacci查找判定树,并利用F ibonacci数的封闭型表达式推导出此种判定树的高度计算公式;证明了在查找成功时,F ibonacci查找的一个优点是总查找长度优于折半查找,F ibonacci查找的另一优点在于访问存放在外存储器上大量的有序表数据时,只需对有序表进行加减运算分割。     

基于斐波那契树辨识算法的区域电网调速系统参数辨识

当前电网中单通道输送功率占比较高,电网出现大功率扰动的概率增大,频率稳定问题重新引起人们的关注。针对目前电力系统频率特性仿真准确度不足的问题,引入具有全局和局部交替寻优特点的斐波那契树优化算法,用于区域电网调速系统参数整体辨识。通过限制树的结构深度、调整全局搜索策略等调整,提高全局寻优能力和收敛速度,使算法适用于参数辨识工作,形成斐波那契树辨识算法。基于实测频率响应曲线,运用该算法对区域电网原动机及调速系统参数进行整体辨识,并进行了多算法对比分析。仿真结果表明,斐波那契树辨识算法应用于此领域具有较好的适用性与优越性。     

一种新的自适应量子遗传算法

现有基于 Bloch 球面坐标的量子进化算法存在收敛速度慢和鲁棒性不稳定的问题。为此,提出基于斐波那契特性更新的自适应量子遗传算法。在最优解的搜索过程中,考虑目标函数在搜索点的变化率,建立自适应因子λ,反映搜索点处目标适应度值相对于相邻两代最佳目标函数值一阶差分的变化,调整λ以改善算法收敛的方向和速度。分析量子旋转门转角步长调整策略,建立基于斐波那契数列特性的转角步长函数Δφ和Δθ的更新规则。应用该算法求解多维复杂函数的极值优化问题,时间复杂度理论分析和仿真结果证明,该算法在收敛速度、效率和稳定鲁棒性等方面均有明显改善。     

组合小波分析与神经网络的船舶缆绳载荷预测

通过对几种改进的二分查找算法的分析和总结,提出了一种基于结点群的更为高效的动态二分查找器。该二分查找器不仅使查找效率得以提高,而且使存储结构得以改进,既实现了动态的实时查找,又便于灵活地进行元素尤其是元素群的插入、删除等操作。另外,实验表明,当在大量数据中查找时,该算法明显优于以前改进的所有二分查找算法。     

高效的线搜索寻优方法

在涉及计算机寻优等许多工程领域,都需要使用多元函数的最优化。线搜索是多元函数的最优化中已知搜索方向求最优步长的关键技术。为了提出一种高效的线搜索算法,对线搜索进行详细研究,提出一种新的线搜索寻优方法——类康托法。主要方法是去除了Fibonacci法中两个试探点必须保留一个的限制,每次把搜索区间三等分,根据试探点的导数值,来决定去除哪两个子区间。通过理论和实例的证明,结果发现类康托法比0.618法和Fibonacci法更高效,计算速度更快。其中最重要的结论是类康托法为这两种方法收敛速度的高阶无穷小。特别是在精度要求很高的时候,类康托法比这两种算法具有更明显的优势。此外,该方法具有较强的适用性,不但能用于凸函数,也能用于凹函数。     

Fast Recognition of Fibonacci Cubes

Fibonacci cubes are induced subgraphs of hypercubes based on Fibonacci strings. They were introduced to represent interconnection networks as an alternative to the hypercube networks. We derive a characterization of Fibonacci cubes founded on the concept of resonance graphs. The characterization is the basis for an algorithm which recognizes these graphs in O(mlog n) time. A. Vesel supported by the Ministry of Science of Slovenia under the grant 0101-P-297.