Model-driven CT reconstruction algorithm for nano-resolution x-ray phase contrast imaging

The low-density imaging performance of a zone plate-based nano-resolution hard x-ray computed tomography(CT)system can be significantly improved by incorporating a grating-based Lau interferometer. Due to the diffraction, however,the acquired nano-resolution phase signal may suffer splitting problem, which impedes the direct reconstruction of phase contrast CT(nPCT) images. To overcome, a new model-driven nPCT image reconstruction algorithm is developed in this study. In it, the diffraction procedure is mathematically modeled into a matrix B, from which the projections without signal splitting can be generated invertedly. Furthermore, a penalized weighted least-square model with total variation(PWLSTV) is employed to denoise these projections, from which nPCT images with high accuracy are directly reconstructed.Numerical experiments demonstrate that this new algorithm is able to work with phase projections having any splitting distances. Moreover, results also reveal that nPCT images of higher signal-to-noise-ratio(SNR) could be reconstructed from projections having larger splitting distances. In summary, a novel model-driven nPCT image reconstruction algorithm with high accuracy and robustness is verified for the Lau interferometer-based hard x-ray nano-resolution phase contrast imaging.

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.

Inversion of Seabed Geotechnical Properties in the Arctic Chukchi Deep Sea Basin Based on Time Domain Adaptive Search Matching Algorithm

The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.

Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.

An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

Winter Wheat Yield Estimation Based on Sparrow Search Algorithm Combined with Random Forest:A Case Study in Henan Province,China

Precise and timely prediction of crop yields is crucial for food security and the development of agricultural policies.However,crop yield is influenced by multiple factors within complex growth environments.Previous research has paid relatively little attention to the interference of environmental factors and drought on the growth of winter wheat.Therefore,there is an urgent need for more effective methods to explore the inherent relationship between these factors and crop yield,making precise yield prediction increasingly important.This study was based on four type of indicators including meteorological,crop growth status,environmental,and drought index,from October 2003 to June 2019 in Henan Province as the basic data for predicting winter wheat yield.Using the sparrow search al-gorithm combined with random forest(SSA-RF)under different input indicators,accuracy of winter wheat yield estimation was calcu-lated.The estimation accuracy of SSA-RF was compared with partial least squares regression(PLSR),extreme gradient boosting(XG-Boost),and random forest(RF)models.Finally,the determined optimal yield estimation method was used to predict winter wheat yield in three typical years.Following are the findings:1)the SSA-RF demonstrates superior performance in estimating winter wheat yield compared to other algorithms.The best yield estimation method is achieved by four types indicators’composition with SSA-RF)(R^(2)=0.805,RRMSE=9.9%.2)Crops growth status and environmental indicators play significant roles in wheat yield estimation,accounting for 46%and 22%of the yield importance among all indicators,respectively.3)Selecting indicators from October to April of the follow-ing year yielded the highest accuracy in winter wheat yield estimation,with an R^(2)of 0.826 and an RMSE of 9.0%.Yield estimates can be completed two months before the winter wheat harvest in June.4)The predicted performance will be slightly affected by severe drought.Compared with severe drought year(2011)(R^(2)=0.680)and normal year(2017)(R^(2)=0.790),the SSA-RF model has higher prediction accuracy for wet year(2018)(R^(2)=0.820).This study could provide an innovative approach for remote sensing estimation of winter wheat yield.yield.

A Compensation Algorithm for Large Element Characterizing the Damage Evolution Process and Its Application to Structure Collisions

When simulating the process from elastic–plastic deformation,damage to failure in a metal structure collision,it is necessary to use the large shell element due to the calculation efficiency,but this would affect the accuracy of damage evolution simulation.The compensation algorithm adjusting failure strain according to element size is usually used in the damage model to deal with the problem.In this paper,a new nonlinear compensation algorithm between failure strain and element size was proposed,which was incorporated in the damage model GISSMO(Generalized incremental stress state dependent damage model)to characterize ductile fracture.And associated material parameters were calibrated based on tensile experiments of aluminum alloy specimens with notches.Simulation and experimental results show that the new compensation algorithm significantly reduces the dependence of element size compared with the constant failure strain model and the damage model with the linear compensation algorithm.During the axial splitting process of a circular tubular structure,the new compensation algorithm keeps the failure prediction errors low over the stress states ranging from shear to biaxial tension,and achieves the objective prediction of the damage evolution process.This study demonstrates how the compensation algorithm resolves the contradiction between large element size and fracture prediction accuracy,and this facilitates the use of the damage model in ductile fracture prediction for engineering structures.

New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem

In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.

基于离散混合蛙跳算法的地震应急物资调度

建立震后应急物资调度数学模型。该模型根据各灾区的受灾情况评估其救援紧急程度,并设计一种需求拆分供应的运输机制,提高车辆的利用效率。为求解该模型,提出一种多源信息学习的离散混合蛙跳算法。所提算法引入多种信息源以扩展算法的搜索方向,降低种群的同化速度。同时,让子组最差个体学习种群中的有效信息,提高算法的收敛精度。实验结果表明,所提算法能够搜索到精度更优的调度方案,对问题规模具有良好的可扩展性。

劈离式供肝儿童肝移植门静脉并发症的诊断与治疗

目的探讨劈离式供肝儿童肝移植门静脉并发症的诊断及治疗策略。方法回顾性分析接受劈离式肝移植的88例儿童受者的临床资料。术中根据受者门静脉内径、发育情况,利用门静脉左右分支处进行吻合或间置供者髂静脉搭桥吻合,围手术期采用规范化的门静脉血流监测,术后按肝素钠桥接华法林的方案进行抗凝治疗。经增强CT或门静脉造影确诊门静脉狭窄或血栓形成后,予切开取栓、全身抗凝、介入下取栓、球囊扩张和(或)支架置入等处理。结果88例受者中共10例患儿确诊门静脉并发症,其中4例门静脉狭窄,确诊时间分别为术后1 d、2个月、8个月、11个月,6例门静脉血栓形成,确诊时间分别为术中、术后2 d、术后3 d(2例)、术后6 d、术后11个月。1例门静脉狭窄者和1例门静脉血栓形成者于围手术期死亡,门静脉并发症相关病死率为2%(2/88)。其余8例患者中,1例行全身抗凝治疗、2例行门静脉切开取栓术、1例行介入下球囊扩张、4例行介入下球囊扩张及支架置入,术后均长期随访,未再出现门静脉相关症状,复查门静脉血流参数正常。结论规范化的术中及术后门静脉血流监测有助于早期发现门静脉并发症,及时采取术中门静脉切开取栓,术后介入下球囊扩张、支架置入等手段可有效治疗门静脉并发症,减少门静脉并发症导致的移植物丢失和受者死亡。

基于CSSA-BPNN模型的胶结充填体动态抗压强度预测

充填采矿法二步骤回采时胶结充填体稳定性受爆破扰动而降低。为快速准确地获得充填体动态抗压强度,利用分离式霍普金森压杆(SHPB)进行了40组不同应变率的单轴冲击实验,以灰砂比、充填体密度、养护龄期和平均应变率作为输入参数,充填体动态抗压强度作为输出参数,建立了一种基于Logistic混沌麻雀搜索算法(CSSA)优化BP神经网络(BPNN)的预测模型,并与传统BPNN和麻雀搜索算法优化的BPNN进行了对比分析。结果表明:CSSA-BPNN模型的平均相对误差为4.11%,预测值与实测值之间拟合的相关系数均在0.96以上,模型预测精度高。CSSA-BPNN模型的均方根误差为0.395 0 MPa,平均绝对误差为0.359 2 MPa,决定系数为0.995 2,均优于另外两种预测模型。实现了对充填体动态抗压强度的准确预测,可大幅减小物理实验量,为矿山胶结充填体的强度设计提供了一种新方法。

面向电力线通信的基于Mitchell算法的OFDM同步检测方法

为了提高电力线通信系统中OFDM定时同步的准确度,文章基于低压电力线宽带载波通信互联互通技术规范下的物理层通信协议,提出了一种基于Mitchell算法的电力线载波通信符号定时算法。与理论本地互相关同步算法相比,文章的算法不需要进行乘法运算,易于硬件实现。与简化的单比特量化算法相比,该算法同步检测结果更加准确,峰值旁瓣更小,在低信噪比条件下符号定时更加准确。

面向复杂物流配送场景的车辆路径规划多任务辅助进化算法

在现代社会中,复杂物流配送场景的车辆路径规划问题(Vehicle routing problem,VRP)一般带有时间窗约束且需要提供同时取送货的服务.这种复杂物流配送场景的车辆路径规划问题是NP-难问题.当其规模逐渐增大时,一般的数学规划方法难以求解,通常使用启发式方法在限定时间内求得较优解.然而,传统的启发式方法从原大规模问题直接开始搜索,无法利用先前相关的优化知识,导致收敛速度较慢.因此,提出面向复杂物流配送场景的车辆路径规划多任务辅助进化算法(Multitask-based assisted evolutionary algorithm,MBEA),通过使用迁移优化方法加快算法收敛速度,其主要思想是通过构造多个简单且相似的子任务用于辅助优化原大规模问题.首先从原大规模问题中随机选择一部分客户订单用于构建多个不同的相似优化子任务,然后使用进化多任务(Evolutional multitasking,EMT)方法用于生成原大规模问题和优化子任务的候选解.由于优化子任务相对简单且与原大规模问题相似,其搜索得到的路径特征可以通过任务之间的知识迁移辅助优化原大规模问题,从而加快其求解速度.最后,提出的算法在京东物流公司快递取送货数据集上进行验证,其路径规划效果优于当前最新提出的路径规划算法.

改进蚁群算法的送餐机器人路径规划

蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。

空间机器人预定义任意时间最优轨迹规划

针对双臂自由漂浮空间机器人(FFSR)在太空抓取任务中的轨迹规划问题,设计了一种FFSR系统的可实现误差预定义时间收敛的新型轨迹规划算法,用布谷鸟搜索算法进行参数优化,以实现末端执行器误差的快速收敛并获得平滑轨迹。首先,导出FFSR的基于姿态误差的运动学模型;然后,将累积危险场避碰算法应用于预定义任意时间轨迹规划,实现高跟踪精度的快速避碰轨迹;最后,利用布谷鸟搜索算法对预定义任意时间参数进行优化,得到机械臂低关节角速度的运动轨迹。仿真结果表明所提算法能够在预定义的时间内实现末端执行器误差快速收敛,而且能够得到更平滑的运动轨迹。

Application Research of an Intelligent Detection Algorithm for Vehicle Trajectory Route Deviation

In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the driver through the mobile phone navigation software, which plays a more auxiliary driving role. This paper presents a method of vehicle trajectory deviation detection. Firstly, the manager customizes the trajectory planning and then uses big data technologies to match the deviation between the trajectory planning and the vehicle trajectory. Finally, it achieves the supervisory function of the manager on the vehicle track route in real-time. The results show that this method could detect the vehicle trajectory deviation quickly and accurately, and has practical application value.

具有时变增益的分布式有限时间二次调频策略

微电网中分布式电源的增加以及敏感负荷的投入,导致仅靠具有渐进收敛特性的传统分布式二次调频策略难以保证系统的动态性能,而常用的有限时间调频策略的收敛上界在不同程度上受到系统初始状态、系统参数等因素的制约。针对这一问题,基于分布式控制原理提出并设计了一种具有时变增益的分布式有限时间调频策略。首先,介绍了传统分布式二次调频策略的工作机理,并利用李雅普诺夫稳定性理论分析了常用有限时间调频策略的局限性。然后,在传统分布式调频策略的基础上,根据其渐进收敛特性将其常数增益改进为具有周期加速收敛特性的时变函数,提出并设计了一种以时变函数为增益的分布式有限时间调频策略,解决了收敛时间受系统初始状态、系统参数制约的问题。最后,通过理论及仿真验证了所提方法在加速频率收敛、提高系统灵活性方面的有效性及优越性。

基于免疫选择和自适应权重的鲸鱼优化定位算法

针对鲸鱼优化算法(WOA)在到达时间差和到达角度混合定位中存在后期迭代种群多样性减小,容易导致局部最优、定位精确度降低的问题,提出一种基于免疫选择和自适应权重的鲸鱼优化算法(IM-WOA).由最大似然估计法得到目标定位函数,为丰富种群多样性引入免疫机制,能够有效产生新的个体,从而避免种群陷入局部最优.通过将自适应惯性权重应用于个体位置的更新公式,实现算法全局探索能力和局部开发能力的平衡和协调,对经典基准函数和目标定位函数进行求解.结果表明,与WOA、AWOA、CSSOA、PIO、CASSA算法相比,IM-WOA算法对绝大多数基准函数的求解具有更高的精度、稳定性和定位精度.

面向车载时间敏感网络的流量调度策略及改进算法研究

本文面向汽车电子电气架构中的时间敏感网络(TSN)流量调度问题开展研究。针对实际应用需求,提出一种车载TSN网络拓扑建立方法。针对网络中多类型信息流调度问题,提出一种基于时间感知整形器(TAS)机制的流量调度策略并建立相应的数学模型,在降低网络总延时的同时,兼顾高优先级信息流的时间敏感性和低优先级信息流的数据完整性。为解决模型中信息流转发过程复杂导致求解效率不稳定和流量调度方案众多导致寻优困难的问题,提出一种改进的遗传算法(IGA),从设置自适应交叉概率公式、引入禁忌搜索变异、多种群联合3个方面进行了优化。实验结果表明,本文所提出的算法在端到端延时优化方面提升了43.47%,在生成方案稳定性方面提升了76.96%,该算法可得到低延时、高可靠的车载TSN流量调度方案。本文的研究成果为智能网联汽车领域的研究和车载网络通信算法的优化提供了思路。

考虑时滞的中药饮片制造过程调度优化

针对中药饮片制造场景下调度求解过程中加工时间不确定以及存在工序间时滞的问题,以最小化最大完工时间为目标,建立考虑时滞的模糊柔性作业车间调度模型,并设计一种改进的遗传算法(IGA)进行求解。使用一种四层编码方法描述带时滞约束的染色体,构建具有模糊加工时间和模糊时滞的作业析取图获取关键路径,使用基于变邻域下降法(VND)的禁忌搜索(TS)增强算法局部搜索能力,再使用一种精英拓展选择策略提高算法迭代效率。以某企业的生产调度数据为例进行仿真实验,结果表明,改进算法在求解中药饮片生产调度问题中具备较好的性能。