A New Hybrid Algorithm and Its Numerical Realization for a Quasi-nonexpansive Mapping

The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also included to explain the effectiveness of the proposed methods. The results of this paper are interesting extensions of those known results.

A quasi-physical algorithm for solving the linear separation problem in n-dimensional space

A quasi physical algorithm was proposed for solving the linear separation problem of point set in n dimensional space.The original idea of the quasi physical algorithm is to find an equivalent physical world for the primitive mathematical problem and to observe the vivid images of the motion of matter in it so as to be inspired to obtain an algorithm for solving the mathematical problem. In this work, the electrostatics with two kinds of matter is found to be the equivalent physical world. As a result,the proposed algorithm is evidently more efficient and robust than the famous LMS algorithm and ETL algorithm. The efficiency of the quasi physical algorithm is about 10-50 times of the LMS algorithm’s for representative instances. A typical Boolean valued instance shows that it is hard for ETL algorithm but very easy for the quasi physical algorithm.In this instance, point set A and B is {000, 010, 011, 111} and {001,100}, respectively.

EXISTENCE AND ALGORITHM OF SOLUTIONS FOR GENERAL MULTIVALUED MIXED IMPLICIT QUASI-VARIATIONAL INEQUALITIES

A new class of general multivalued mixed implicit quasi-variational inequalities in a real Hilbert space was introduced, which includes the known class of generalized mixed implicit quasi-variational inequalities as a special case , introduced and studied by Ding Xie-ping . The auxiliary variational principle technique was applied to solve this class of general multivalued mixed implicit quasi-variational inequalities. Firstly, a new auxiliary variational inequality with a proper convex , lower semicontinuous , binary functional was defined and a suitable functional was chosen so that its unique minimum point is equivalent to the solution of such an auxiliary variational inequality . Secondly , this auxiliary variational inequality was utilized to construct a new iterative algorithm for computing approximate solutions to general multivalued mixed implicit quasi-variational inequalities . Here , the equivalence guarantees that the algorithm can generate a sequence of approximate solutions. Finally, the existence of solutions and convergence of approximate solutions for general multivalued mixed implicit quasi-variational inequalities are proved. Moreover, the new convergerce criteria for the algorithm were provided. Therefore, the results give an affirmative answer to the open question raised by M. A . Noor, and extend and improve the earlier and recent results for various variational inequalities and complementarity problems including the corresponding results for mixed variational inequalities, mixed quasi-variational inequalities and quasi-complementarity problems involving the single-valued and set- valued mappings in the recent literature .

Heuristic Quasi-physical Algorithm for Protein Structure Prediction

A three-dimensional off-lattice protein model with two species of monomers, hydrophobic and hydrophilic, is studied. Enligh- tened by the law of reciprocity among things in the physical world, a heuristic quasi-physical algorithm for protein structure prediction problem is put forward. First, by elaborately simulating the movement of the smooth elastic balls in the physical world, the algorithm finds low energy configurations for a given monomer chain. An ＂off-trap＂ strategy is then proposed to get out of local minima. Experimental results show promising performance. For all chains with lengths 13≤n ≤55, the proposed algorithm finds states with lower energy than the putative ground states reported in literatures. Furthermore, for chain lengths n = 21, 34, and 55, the algorithm finds new low energy configurations different from those given in literatures.

Stability and Robustness Analysis of an Adaptive Algorithm for Quasi-periodic Disturbances Rejection

Winding and web transport systems are subjected to quasi-periodic disturbances of the web tension due to the eccentricity and the non-circularity of the reel and rolls. The disturbances induced by the non-circularity and eccentricity of the rolls are quasi-periodic with a frequency that varies with their rotation speed. An adaptive method of rejection of these disturbances is proposed in this paper. It is based on a phase-locked loop structure that estimates simutaneously the phase and magnitude of the perturbation and then cancels it. This algorithm can be plugged in an existing industrial controller. The stability and robustness of the algorithm are also discussed. The ability of the algorithm to reject quasi-periodic disturbances with slowly varying frequencies is shown through simulation results.

Existence and Algorithm of Solutions for Generalized Mixed Implicit Quasi-Variational-Like Inequalities

By applying the auxiliary variational principle technique, the existence of solutions for a new class of generalized mixed implicit quasi-variational-like inequalities and the convergence criteria of a new iterative algorithm to compute approximate solutions are proved in Hilbert spaces. The obtained result is a improvement over and generalization of the main theorem proposed by Ding.

PREDICTOR-CORRECTOR ALGORITHMS FOR SOLVING GENERALIZED MIXED IMPLICIT QUASI-EQUILIBRIUM PROBLEMS

A new class of generalized mixed implicit quasi-equilibrium problems （GMIQEP） with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings

基于最大对比度的联合相位误差校正方法

针对高分辨率逆合成孔径雷达(ISAR)成像过程中,因目标转动所引入的转动相位误差无法被忽略,以及由于转动相位误差使得传统平动相位误差校正方法性能严重下降的问题,提出了一种基于最大对比度的联合相位误差校正的方法,可同时校正残余的平动相位误差和转动相位误差,进一步提高成像的质量。首先利用传统的运动补偿方法对回波信号进行处理,其次根据最大对比度准则,将相位误差校正问题转化为最大对比度优化问题,最后利用改进的拟牛顿算法进行求解。该方法能使高分辨率ISAR进行精准成像,且所得图像聚焦效果良好。通过对仿真数据和实测数据的处理,验证了文中方法的有效性。

基于准Z源变换的无线充电系统电磁屏蔽研究

在无线电能传输系统中,线圈结构参数对系统的传输效率以及漏磁影响很大,且对于传统桥式逆变电路,其提供的电压只能是母线电压以下,极大限制了输出功率能力以及调压能力。以有源磁屏蔽结构为基础,提出了一种基于准Z源逆变的有源屏蔽线圈结构,通过多目标粒子群算法分析了在低漏磁和高传输效率的双目标下的线圈结构参数;根据得到的线圈参数,研制了一套基于准Z源逆变的有源屏蔽线圈结构的无线充电系统。经MATLAB/Simulink仿真表明,在输出功率恒定为3.7 kW时,系统传输效率能够达到98.5%,优化后的漏磁相比于优化前下降了55.1%。

改进细菌觅食算法的永磁同步电机参数辨识

应用群智能算法对永磁同步电机(PMSM)进行参数辨识后期容易进入局部最优,从而导致辨识误差大,为此提出一种融合小生境技术的改进细菌觅食算法(MBFA)。通过构建目标追踪函数,利用电机电流、电压和转速等直接测量的信号实现对电机d轴电感、q轴电感、定子电阻和永磁体磁链的快速、准确辨识;辨识过程中通过引入格型准则对目标解空间进行拟蒙特卡罗采样提高算法的全局搜索能力;基于小生境技术进行在线多种群协同搜索策略提高算法的搜索效率和寻优精度;最后通过引入一种种群实时监测和动态更新机制保证了算法在整个寻优过程的鲁棒性。仿真和实验结果表明,所提算法在参数辨识的快速性、准确性、稳定性方面均表现优越,辨识结果能够满足对永磁同步电机进行建模和仿真的精度要求。

基于射线追踪方法的电离层点对点传播问题研究

短波通信和电离层斜向探测本质上都属于点对点传播问题,即固定收发站之间的传播问题,而点对点传播问题的本质是在发射点搜索出合适的仰角和方位角来实现射线的自动导引。射线追踪一直是研究高频波传播现象的工具,基于射线追踪的自导引技术可以实现点对点传播,但不同电离层模型对点对点传播的轨迹和精度会有影响。本文将基于数值射线追踪,利用牛顿自导引技术构建点对点传播模型,研究在分段准抛物(quasi parabolic segments,QPS)电离层模型以及国际参考电离层(International Reference Ionosphere,IRI)模型这两种不同电离层模型下点对点传播算法的稳健性和精确性问题。结果表明,在两种模型下本文算法均有较高的稳健性,但是QPS电离层模型下具有更快的运行速度,而IRI模型下有更高的精确性。

应用L_(p)拟范数稀疏约束的纵横波速比直接反演

纵横波速比(vP/vS)是识别气藏、描述储层特征和判别岩性的重要解释工具。目前主要是通过反射系数近似方程反演得到纵、横波速度,再进一步计算纵横波速比,但是这种间接计算方法会产生累积误差。为了直接从叠前地震数据反演纵横波速比,文中提出了一种新的广义弹性阻抗方程,再进一步推导出一个与纵横波速比、纵波速度、密度相关的纵波反射系数近似方程。为了得到精度较高的反演结果,基于推导出的反射系数近似方程,提出一种基于Lp拟范数稀疏约束的叠前地震反演方法,并通过交替方向乘子算法求解。将提出的直接反演方法应用于理论模型和实际数据,并与间接反演方法相对比,结果表明该直接反演方法的反演结果精度较高,对含气储层的边界刻画更清晰。

基于柱面波展开的准远场快速测量方法研究

为解决常规暗室环境不满足大口径天线的测量需求、测试系统复杂以及测试效率低等问题,文中对天线测量中的高效测量方法进行了研究,重点研究了准远场快速测量方法,提出了一种基于柱面波展开理论的准远场变换算法。该算法适宜在准远场距离下对一维电尺寸大而另一维电尺寸小的天线进行测量,提高了此类天线的测试效率和现有暗室的测试能力。为了验证所提出的方法,利用电磁仿真软件设计了三个均匀分布的线性阵列。仿真和实物测试结果验证了所提出方法的正确性。

华氏经济优化新理论的实证案例

本文是我们研究小组在文献[1,2]中关于华罗庚经济最优化理论新探索的继续,研究目前最新的2017年中国投入产出模型的稳定性分析、产品排序与分类、预测与调整和结构优化等问题;并将2007年、2012年、2017年三个年度投入产出模型的产品排序与分类进行对比分析.所得结果展示出三个年度、跨越15年的产品等级排序和分类的令人吃惊的相似性,再次显示出前文理论的可靠性.

融合非线性收敛因子与变异准反射学习的哈里斯鹰优化算法

针对哈里斯鹰优化算法(Harris Hawks optimization,HHO)易早熟收敛、寻优精度低、收敛速度慢等问题,提出一种融合非线性收敛因子与变异准反射学习的哈里斯鹰优化算法(improved Harris Hawks optimization,IHHO)。首先,初始化阶段引入Circle混沌映射,提高初始化种群多样性和种群位置质量;其次,引入Sigmoid非线性收敛因子,平衡全局探索和局部开发能力;最后,针对HHO算法易陷入局部最优问题,提出变异准反射学习(quasi-reflection-based learning,QRBL)策略,提高种群活力,进一步提高算法局部收敛能力。仿真实验采用13个标准测试函数和1个经典工程问题对改进算法进行测试,结果表明改进算法收敛精度、收敛速度均有较大提高,适用于解决实际问题。

二维矩形Strip Packing问题的算法研究与改进

二维矩形Strip Packing问题的约束条件及目标函数与基本型二维矩形Packing问题类似,都是在有限的矩形容器中,有效地摆放各个矩形块,以最大化容器利用率为目标。为了解决这一NP-hard问题,该文在邓见凯、王磊提出的拟人型全局优化算法的基础上进行了深入的算法研究与改进。针对Strip Packing问题特点,提出了QHG(Quasi-Human Group)算法,其核心改进涵盖了多个方面,包括扩充初始点集合、删除和替换评价标准以及扩大邻域空间搜索范围。和单个局部极小值点的迭代相比,对局部极小值点集合进行迭代所生成布局优度更高,跳坑策略用于跳出局部极小值点,将搜索引向有希望的区域,优美度枚举有望进一步提高布局优度。通过这些措施,QHG算法更好地模拟人类决策过程,提高了全局搜索的效率。为评估QHG算法性能,对8组标准问题实例(C组、N组、NT组、CX组、NP组、ZDF组、2sp组、bwmv组)进行了大量实验。实验结果表明,QHG算法生成的布局优度优于当前国际文献中的几种较先进算法,展现了其在Strip Packing问题上的卓越性能。

基于HHO-QRNN模型的大坝变形预测方法

为有效利用大坝位移数据集中的真实信息,提高预测模型精准度,缩减建模分析训练时间,提出基于卡尔曼滤波算法、完全噪声辅助聚合经验模态分解和准循环神经网络的大坝位移预测方法。首先,模型采用卡尔曼滤波算法对原始输入数据进行处理,提取行有效信息,消除观测噪声影响;其次,设计一种信号分解算法,从累计位移值提取出趋势项、周期项和随机项数据集,以分离不同诱发因素对于大坝位移量的影响;最后,提出一种基于改进哈里斯鹰算法优化准循环神经网络的位移预测算法,对不同数据集分别采用此算法建模预测,将预测结果对应叠加得到最终预测结果。以某水库大坝的历史位移观测数据集为例,将所提模型与其他传统预测模型进行对比分析,结果表明,该模型预测精度和训练速度等方面均有显著提升,验证了其可行性和先进性。

海洋跨介质通信自组网络设计与实现

世界各国在海洋资源开发、环境监测、搜索救援、协同巡查等领域的活动日益增频繁,加剧了对海洋跨介质通信的需求。设计了一种基于海上浮标的海洋分布式跨介质通信网络,融合水声、无线电、卫星通信等多种通信手段于一体,通过无线电自组网实现局部立体海域的通信覆盖,为水下用户提供互联互通以及与陆网联通的通用接口。重点研究了跨介质通信网络体系,设计了面向海洋复杂环境的网络通信协议及路由算法,并搭建原型网络,开展网络覆盖范围、吞吐率等关键指标的海试验证。经测试,该网络能够实现局部立体海域的准实时通信,由3节点组成的跨介质通信网络能够提供3kbps半径6.6km的吞吐量及海面覆盖范围。

基于改进鹈鹕优化算法的土壤污染预测

针对传统污染扩散模型结构复杂、无法验证等问题,提出一种基于多策略改进鹈鹕优化算法的土壤污染扩散模型。引入拟蒙特卡罗序列优化鹈鹕优化算法初始种群位置,提出一种非线性收敛的e指数余弦因子改进位置更新方式,结合t-分布变异扰动策略提升算法局部寻优能力。利用改进的鹈鹕优化算法优化高斯扩散模型,构建土壤污染扩散模型。选取某地为研究区域,所构建的土壤污染扩散模型的平均绝对误差与均方根误差最低,验证该模型可以有效应用于土壤污染预测。