Enhanced Wolf Pack Algorithm (EWPA) and Dense-kUNet Segmentation for Arterial Calcifications in Mammograms

Breast Arterial Calcification(BAC)is a mammographic decision dissimilar to cancer and commonly observed in elderly women.Thus identifying BAC could provide an expense,and be inaccurate.Recently Deep Learning(DL)methods have been introduced for automatic BAC detection and quantification with increased accuracy.Previously,classification with deep learning had reached higher efficiency,but designing the structure of DL proved to be an extremely challenging task due to overfitting models.It also is not able to capture the patterns and irregularities presented in the images.To solve the overfitting problem,an optimal feature set has been formed by Enhanced Wolf Pack Algorithm(EWPA),and their irregularities are identified by Dense-kUNet segmentation.In this paper,Dense-kUNet for segmentation and optimal feature has been introduced for classification(severe,mild,light)that integrates DenseUNet and kU-Net.Longer bound links exist among adjacent modules,allowing relatively rough data to be sent to the following component and assisting the system in finding higher qualities.The major contribution of the work is to design the best features selected by Enhanced Wolf Pack Algorithm(EWPA),and Modified Support Vector Machine(MSVM)based learning for classification.k-Dense-UNet is introduced which combines the procedure of Dense-UNet and kU-Net for image segmentation.Longer bound associations occur among nearby sections,allowing relatively granular data to be sent to the next subsystem and benefiting the system in recognizing smaller characteristics.The proposed techniques and the performance are tested using several types of analysis techniques 826 filled digitized mammography.The proposed method achieved the highest precision,recall,F-measure,and accuracy of 84.4333%,84.5333%,84.4833%,and 86.8667%when compared to other methods on the Digital Database for Screening Mammography(DDSM).

基于EM-KF算法的微地震信号去噪方法

针对微地震信号能量较弱,噪声较强,使微地震弱信号难以提取问题,提出了一种基于EM-KF(Expectation Maximization Kalman Filter)的微地震信号去噪方法。通过建立一个符合微地震信号规律的状态空间模型,并利用EM(Expectation Maximization)算法获取卡尔曼滤波的参数最优解,结合卡尔曼滤波,可以有效地提升微地震信号的信噪比,同时保留有效信号。通过合成和真实数据实验结果表明,与传统的小波滤波和卡尔曼滤波相比,该方法具有更高的效率和更好的精度。

基于IAOA-KELM的储气库注采管柱内腐蚀速率预测

针对储气库注采管柱的内腐蚀速率预测问题,建立了基于阿基米德优化算法(Archimedes Optimization Algorithm,AOA)与核极限学习机(Kernel Extreme Learning Machine,KELM)相结合的模型提高腐蚀速率预测精度。通过引入佳点集、改进密度降低因子、采用黄金正弦算法缩小搜索空间,提高局部开发能力,利用改进阿基米德优化算法(Improved Archimedes Optimization Algorithm,IAOA)优化KELM正则化系数(C)和核函数参数(γ),进而建立IAOA-KELM储气库注采管柱内腐蚀速率预测模型;使用MATLAB软件运用该模型对某注采管柱内腐蚀数据集进行学习与预测,将IAOA-KELM模型与KELM、粒子群优化算法(Particle Swarm Optimization,PSO)-KELM、AOA-KELM结果进行预测误差对比。结果表明,IAOA-KELM模型的预测值与实际值较为拟合,其E RMSE为0.65%,E MAE为0.39%,R 2为99.83%,均优于其他模型。研究表明,IAOA-KELM模型能够更为准确地预测储气库注采管柱内腐蚀速率,为储气库注采管柱的运维及储气库的健康管理提供参考。

Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm

The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.

达雷妥尤单抗治疗患者检出抗-K、抗-Wr^(a)的血清学分析

目的 通过对1例使用达雷妥尤单抗患者的抗-K、抗-Wr^(a)标本特点进行分析,以研究合理的血清学检测途径。方法 选取盐水法、凝聚胺、卡式抗人球蛋白方法、二硫苏糖醇(Dithiothreitol, DTT)处理、胰蛋白酶处理、木瓜蛋白酶处理等方法,对患者血浆、酸放散液进行意外抗体筛查和鉴定。用K抗原阴性红细胞吸收患者血清后热放散。分析抗体性质,持续检测效价。排除达雷妥尤单抗干扰后进行交叉配血。结果 患者血浆在盐水、凝聚胺介质中检出抗-K、抗-Wr^(a),患者自身放散液中应为达雷妥尤单抗。木瓜酶不能排除达雷妥尤单抗干扰;DTT、胰蛋白酶处理红细胞后可排除达雷妥尤单抗干扰。但DTT处理破坏K抗原,漏检Kell系统IgG抗体;胰蛋白酶处理不影响K抗原,可检出达雷妥尤单抗治疗患者血清中的Kell系统IgG抗体(抗-k)。该患者抗-K为IgM,盐水法效价4,39 d后减弱至盐水法室温不凝集;抗-Wr^(a)为IgG,凝聚胺法效价4,39 d后减弱为1;76 d后抗-K、抗-Wr^(a)均测不出。选择K、Wr^(a)抗原阴性的红细胞输注,安全有效。结论 DTT处理红细胞可排除达雷妥尤单抗干扰,但要注意Kell系统抗体的漏检。为避免达雷妥尤单抗掩盖同种抗体,可联合使用DTT处理、凝聚胺法、胰蛋白酶处理等多种方法。

Rao Algorithms-Based Structure Optimization for Heterogeneous Wireless Sensor Networks

The structural optimization of wireless sensor networks is a critical issue because it impacts energy consumption and hence the network’s lifetime.Many studies have been conducted for homogeneous networks,but few have been performed for heterogeneouswireless sensor networks.This paper utilizes Rao algorithms to optimize the structure of heterogeneous wireless sensor networks according to node locations and their initial energies.The proposed algorithms lack algorithm-specific parameters and metaphorical connotations.The proposed algorithms examine the search space based on the relations of the population with the best,worst,and randomly assigned solutions.The proposed algorithms can be evaluated using any routing protocol,however,we have chosen the well-known routing protocols in the literature:Low Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Gathering in Sensor Information Systems(PEAGSIS),Partitioned-based Energy-efficient LEACH(PE-LEACH),and the Power-Efficient Gathering in Sensor Information Systems Neural Network(PEAGSIS-NN)recent routing protocol.We compare our optimized method with the Jaya,the Particle Swarm Optimization-based Energy Efficient Clustering(PSO-EEC)protocol,and the hybrid Harmony Search Algorithm and PSO(HSA-PSO)algorithms.The efficiencies of our proposed algorithms are evaluated by conducting experiments in terms of the network lifetime(first dead node,half dead nodes,and last dead node),energy consumption,packets to cluster head,and packets to the base station.The experimental results were compared with those obtained using the Jaya optimization algorithm.The proposed algorithms exhibited the best performance.The proposed approach successfully prolongs the network lifetime by 71% for the PEAGSIS protocol,51% for the LEACH protocol,10% for the PE-LEACH protocol,and 73% for the PEGSIS-NN protocol;Moreover,it enhances other criteria such as energy conservation,fitness convergence,packets to cluster head,and packets to the base station.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

基于信息熵和Canopy-K-Means算法的货车驾驶风格识别

为识别货车的激进驾驶行为,保障货车行车安全,提出1种基于信息熵和Canopy-K-Means算法的货车驾驶风格识别方法。首先,从货车自然驾驶数据中提取出604个驾驶片段,根据信息熵理论计算各个驾驶片段的速度熵值、横向加速度熵值和纵向加速度熵值,构成货车驾驶风格表征指标集;其次,针对K-Means算法的聚类数量主观选取、初始聚类中心随机选取的问题,使用Canopy算法改进K-Means算法(Canopy-K-Means算法);最后,分别使用K-Means算法和Canopy-K-Means算法对货车驾驶风格进行识别。研究结果显示,Canopy-K-Means算法的轮廓系数和Calinski-Harabasz指数均大于K-Means算法,表现出更优的聚类性能。根据Canopy-K-Means算法,可将货车驾驶风格分为沉稳型、常规型和激进型3类,其中激进型货车驾驶风格的指标熵值和极差均较大,存在较高的安全隐患,需要引起相关部门的高度重视。

0-k膨胀计数回归模型的参数估计与统计检验

0-k膨胀计数回归模型的参数估计与统计检验一直是数据分析的热点问题.借助隐变量重新设定0-k膨胀回归模型,并采用EM算法和Fisher信息矩阵给出参数的点估计和区间估计;基于Wald统计量和LR统计量对0-k膨胀分布是否会退化的现象进行统计检验;以0-k膨胀泊松回归模型为例进行实际应用.研究结果显示,采用EM算法进行参数估计时收敛速度较快且估计结果稳健,不同的0-k膨胀泊松分布对原始数据的拟合效果不同,若将k设定为非膨胀数值可能会导致拟合结果出现偏差.

Product quality prediction based on RBF optimized by firefly algorithm

With the development of information technology,a large number of product quality data in the entire manufacturing process is accumulated,but it is not explored and used effectively.The traditional product quality prediction models have many disadvantages,such as high complexity and low accuracy.To overcome the above problems,we propose an optimized data equalization method to pre-process dataset and design a simple but effective product quality prediction model:radial basis function model optimized by the firefly algorithm with Levy flight mechanism(RBFFALM).First,the new data equalization method is introduced to pre-process the dataset,which reduces the dimension of the data,removes redundant features,and improves the data distribution.Then the RBFFALFM is used to predict product quality.Comprehensive expe riments conducted on real-world product quality datasets validate that the new model RBFFALFM combining with the new data pre-processing method outperforms other previous me thods on predicting product quality.

回火对E101T1-K3C熔敷金属显微组织和力学性能的影响

采用E101T1-K3C低合金高强钢药芯焊丝对EH620钢进行焊接。焊接接头分别在460℃、580℃进行保温1 h回火热处理,应用金相显微镜、材料试验机、冲击试验机、扫描电子显微镜等对试样进行分析与测量。结果表明:焊态下熔敷金属显微组织为条状铁素体+少量贝氏体+第二相颗粒,熔合区显微组织为片状铁素体+马氏体+第二相颗粒。焊接接头经过460℃×1 h焊后回火处理后,焊缝区的显微组织为铁素体+少量贝氏体+第二相颗粒,熔合区组织为铁素体+回火屈氏体+第二相颗粒。焊接接头经过580℃×1 h回火处理后,焊缝及熔合区显微组织均为铁素体+回火索氏体+第二相颗粒;熔敷金属屈服强度由725 MPa下降589 MPa,-40℃冲击吸收能量KV2由71 J提高到114 J;维氏硬度值在焊接接头焊缝及热影响区的分布趋向一致,焊接接头具有理想的力学性能。

Path Planning for AUVs Based on Improved APF-AC Algorithm

With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater environments.However,nowadays AUVs generally have drawbacks such as weak endurance,low intelligence,and poor detection ability.The research and implementation of path-planning methods are the premise of AUVs to achieve actual tasks.To improve the underwater operation ability of the AUV,this paper studies the typical problems of path-planning for the ant colony algorithm and the artificial potential field algorithm.In response to the limitations of a single algorithm,an optimization scheme is proposed to improve the artificial potential field ant colony(APF-AC)algorithm.Compared with traditional ant colony and comparative algorithms,the APF-AC reduced the path length by 1.57%and 0.63%(in the simple environment),8.92%and 3.46%(in the complex environment).The iteration time has been reduced by approximately 28.48%and 18.05%(in the simple environment),18.53%and 9.24%(in the complex environment).Finally,the improved APF-AC algorithm has been validated on the AUV platform,and the experiment is consistent with the simulation.Improved APF-AC algorithm can effectively reduce the underwater operation time and overall power consumption of the AUV,and shows a higher safety.

Practical Application of Out-of-Kilter Algorithm

The algorithm under this name, together with the variants, is a method that solves the problems of optimal flow and costs. Examples of such problems are planning and procurement, scheduling by contractors, distribution and supply systems, transport on the road or rail network, electricity transmission, computer and telecommunications networks, pipe transmission systems (water, oil, …), and the like. The main goal of any business organization is to increase profits and satisfy its customers. Because business is an integral part of our environment, their goals will be limited by certain environmental factors and economic conditions. The out-of-kilter algorithm is used to solve a complex allocation problem involving interactive and conflicting personal choices subject to interactive resource constraints. The paper presents an example of successful use of this algorithm and proposes an extension to the areas of corporate and social planning. Customer demand, warehousing, and factory capacity were used as input for the model. First, we propose a linear programming approach to determine the optimal distribution pattern to reduce overall distribution costs. The proposed model of linear programming is solved by the standard simplex algorithm and the Excel-solver program. It is noticed that the proposed model of linear programming is suitable for finding the optimal distribution pattern and total minimum costs.

基于ikPCA-FABAS-KELM的短期风电功率预测

为了增强在短期风电功率预测领域中传统数据驱动机器学习模型的精度,提出基于ikPCA-FABAS-KELM的短期风电功率预测模型.首先,对主成分分析进行改进,提出可逆核主成分分析(ikPCA),在保证数据特征的同时,降低输入数据的复杂度,以提升模型运行速度;其次,引入萤火虫个体吸引策略对天牛须算法(BAS)进行改进,提出FABAS算法;最后,利用FABAS算法对核极限学习机(KELM)的正则化参数C和核参数γ进行寻优,降低人为因素对模型盲目训练的影响,提高模型预测精度.仿真结果显示,提出的预测模型有效提高了传统模型的预测精度.

A Review of Image Steganography Based on Multiple Hashing Algorithm

Steganography is a technique for hiding secret messages while sending and receiving communications through a cover item.From ancient times to the present,the security of secret or vital information has always been a significant problem.The development of secure communication methods that keep recipient-only data transmissions secret has always been an area of interest.Therefore,several approaches,including steganography,have been developed by researchers over time to enable safe data transit.In this review,we have discussed image steganography based on Discrete Cosine Transform(DCT)algorithm,etc.We have also discussed image steganography based on multiple hashing algorithms like the Rivest–Shamir–Adleman(RSA)method,the Blowfish technique,and the hash-least significant bit(LSB)approach.In this review,a novel method of hiding information in images has been developed with minimal variance in image bits,making our method secure and effective.A cryptography mechanism was also used in this strategy.Before encoding the data and embedding it into a carry image,this review verifies that it has been encrypted.Usually,embedded text in photos conveys crucial signals about the content.This review employs hash table encryption on the message before hiding it within the picture to provide a more secure method of data transport.If the message is ever intercepted by a third party,there are several ways to stop this operation.A second level of security process implementation involves encrypting and decrypting steganography images using different hashing algorithms.

Algorithm Selection Method Based on Coupling Strength for Partitioned Analysis of Structure-Piezoelectric-Circuit Coupling

In this study, we propose an algorithm selection method based on coupling strength for the partitioned analysis ofstructure-piezoelectric-circuit coupling, which includes two types of coupling or inverse and direct piezoelectriccoupling and direct piezoelectric and circuit coupling. In the proposed method, implicit and explicit formulationsare used for strong and weak coupling, respectively. Three feasible partitioned algorithms are generated, namely(1) a strongly coupled algorithm that uses a fully implicit formulation for both types of coupling, (2) a weaklycoupled algorithm that uses a fully explicit formulation for both types of coupling, and (3) a partially stronglycoupled and partially weakly coupled algorithm that uses an implicit formulation and an explicit formulation forthe two types of coupling, respectively.Numerical examples using a piezoelectric energy harvester,which is a typicalstructure-piezoelectric-circuit coupling problem, demonstrate that the proposed method selects the most costeffectivealgorithm.

Hybrid Optimization Algorithm for Handwritten Document Enhancement

The Gannet Optimization Algorithm (GOA) and the Whale Optimization Algorithm (WOA) demonstrate strong performance;however, there remains room for improvement in convergence and practical applications. This study introduces a hybrid optimization algorithm, named the adaptive inertia weight whale optimization algorithm and gannet optimization algorithm (AIWGOA), which addresses challenges in enhancing handwritten documents. The hybrid strategy integrates the strengths of both algorithms, significantly enhancing their capabilities, whereas the adaptive parameter strategy mitigates the need for manual parameter setting. By amalgamating the hybrid strategy and parameter-adaptive approach, the Gannet Optimization Algorithm was refined to yield the AIWGOA. Through a performance analysis of the CEC2013 benchmark, the AIWGOA demonstrates notable advantages across various metrics. Subsequently, an evaluation index was employed to assess the enhanced handwritten documents and images, affirming the superior practical application of the AIWGOA compared with other algorithms.

Representation of an Integer by a Quadratic Form through the Cornacchia Algorithm

Cornachia’s algorithm can be adapted to the case of the equation x2+dy2=nand even to the case of ax2+bxy+cy2=n. For the sake of completeness, we have given modalities without proofs (the proof in the case of the equation x2+y2=n). Starting from a quadratic form with two variables f(x,y)=ax2+bxy+cy2and n an integer. We have shown that a primitive positive solution (u,v)of the equation f(x,y)=nis admissible if it is obtained in the following way: we take α modulo n such that f(α,1)≡0modn, u is the first of the remainders of Euclid’s algorithm associated with n and α that is less than 4cn/| D |) (possibly α itself) and the equation f(x,y)=n. has an integer solution u in y. At the end of our work, it also appears that the Cornacchia algorithm is good for the form n=ax2+bxy+cy2if all the primitive positive integer solutions of the equation f(x,y)=nare admissible, i.e. computable by the algorithmic process.

Multi-Objective Optimization of VBHF in Deep Drawing Based on the Improved QO-Jaya Algorithm

Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method.

RRT Autonomous Detection Algorithm Based on Multiple Pilot Point Bias Strategy and Karto SLAM Algorithm

A Rapid-exploration Random Tree(RRT)autonomous detection algorithm based on the multi-guide-node deflection strategy and Karto Simultaneous Localization and Mapping(SLAM)algorithm was proposed to solve the problems of low efficiency of detecting frontier boundary points and drift distortion in the process of map building in the traditional RRT algorithm in the autonomous detection strategy of mobile robot.Firstly,an RRT global frontier boundary point detection algorithm based on the multi-guide-node deflection strategy was put forward,which introduces the reference value of guide nodes’deflection probability into the random sampling function so that the global search tree can detect frontier boundary points towards the guide nodes according to random probability.After that,a new autonomous detection algorithm for mobile robots was proposed by combining the graph optimization-based Karto SLAM algorithm with the previously improved RRT algorithm.The algorithm simulation platform based on the Gazebo platform was built.The simulation results show that compared with the traditional RRT algorithm,the proposed RRT autonomous detection algorithm can effectively reduce the time of autonomous detection,plan the length of detection trajectory under the condition of high average detection coverage,and complete the task of autonomous detection mapping more efficiently.Finally,with the help of the ROS-based mobile robot experimental platform,the performance of the proposed algorithm was verified in the real environment of different obstacles.The experimental results show that in the actual environment of simple and complex obstacles,the proposed RRT autonomous detection algorithm was superior to the traditional RRT autonomous detection algorithm in the time of detection,length of detection trajectory,and average coverage,thus improving the efficiency and accuracy of autonomous detection.