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.

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.

Calculation of Mass Concrete Temperature Containing Cooling Water Pipe Based on Substructure and Iteration Algorithm

Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development.

Optimization of LSTM Ship Trajectory Prediction Based on Hybrid Genetic Algorithm

Accurate prediction of the movement trajectory of sea surface targets holds significant importance in achieving an advantageous position in the sea battle field.This prediction plays a crucial role in ensuring security defense and confrontation,and is essential for effective deployment of military strategy.Accurately predicting the trajectory of sea surface targets using AIS(Automatic Identification System)information is crucial for security defense and confrontation,and holds significant importance for military strategy deployment.In response to the problem of insufficient accuracy in ship trajectory prediction,this study proposes a hybrid genetic algorithm to optimize the Long Short-Term Memory(LSTM)algorithm.The HGA-LSTM algorithm is proposed for ship trajectory prediction.It can converge faster and obtain better parameter solutions,thereby improving the effectiveness of ship trajectory prediction.Compared to traditional LSTM and GA-LSTM algorithms,experimental results demonstrate that this algorithm outperforms them in both single-step and multi-step prediction.

Image encryption algorithm based on multiple chaotic systems and improved Joseph block scrambling

With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and protect intellectual property rights,this study proposes an innovative color image encryption algorithm.Initially,the Mersenne Twister algorithm is utilized to generate high-quality pseudo-random numbers,establishing a robust basis for subsequent operations.Subsequently,two distinct chaotic systems,the autonomous non-Hamiltonian chaotic system and the tentlogistic-cosine chaotic mapping,are employed to produce chaotic random sequences.These chaotic sequences are used to control the encoding and decoding process of the DNA,effectively scrambling the image pixels.Furthermore,the complexity of the encryption process is enhanced through improved Joseph block scrambling.Thorough experimental verification,research,and analysis,the average value of the information entropy test data reaches as high as 7.999.Additionally,the average value of the number of pixels change rate(NPCR)test data is 99.6101%,which closely approaches the ideal value of 99.6094%.This algorithm not only guarantees image quality but also substantially raises the difficulty of decryption.

Scheduling Model and Algorithm of Construction Equipment under Milestone Constraint

The scheduling of construction equipment is a means to realize network planning.With the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain has become very important,and effective coordination of project plans at all levels to optimize the resource management and scheduling of a project is helpful to reduce project duration and cost.In this paper,under the milestone constraint conditions,the scheduling problems of multiple construction devices in the same sequence of operation were described and hypothesized mathematically,and the scheduling models of multiple equipment were established.The Palmer algorithm,CDS algorithm and Gupta algorithm were respectively used to solve the optimal scheduling of construction equipment to achieve the optimization of the construction period.The optimization scheduling of a single construction device and multiple construction devices was solved by using sequencing theory under milestone constraint,and these methods can obtain reasonable results,which has important guiding significance for the scheduling of construction equipment.

Prediction Model of Wax Deposition Rate in Waxy Crude Oil Pipelines by Elman Neural Network Based on Improved Reptile Search Algorithm

A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax deposition in crude oil pipelines.Aiming at the shortcomings of the ENN prediction model,which easily falls into the local minimum value and weak generalization ability in the implementation process,an optimized ENN prediction model based on the IRSA is proposed.The validity of the new model was confirmed by the accurate prediction of two sets of experimental data on wax deposition in crude oil pipelines.The two groups of crude oil wax deposition rate case prediction results showed that the average absolute percentage errors of IRSA-ENN prediction models is 0.5476% and 0.7831%,respectively.Additionally,it shows a higher prediction accuracy compared to the ENN prediction model.In fact,the new model established by using the IRSA to optimize ENN can optimize the initial weights and thresholds in the prediction process,which can overcome the shortcomings of the ENN prediction model,such as weak generalization ability and tendency to fall into the local minimum value,so that it has the advantages of strong implementation and high prediction accuracy.

Multipath Selection Algorithm Based on Dynamic Flow Prediction

Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Defined Network (SDN) to dynamically predict the traffic and comprehensively consider the current and predicted load of the network in order to select the optimal forwarding path and balance the network load. Experiments have demonstrated that the algorithm achieves significant improvement in both system throughput and average packet loss rate for the purpose of improving network quality of service.

Novel method for extraction of ship target with overlaps in SAR image via EM algorithm

The quality of synthetic aperture radar(SAR)image degrades in the case of multiple imaging projection planes(IPPs)and multiple overlapping ship targets,and then the performance of target classification and recognition can be influenced.For addressing this issue,a method for extracting ship targets with overlaps via the expectation maximization(EM)algorithm is pro-posed.First,the scatterers of ship targets are obtained via the target detection technique.Then,the EM algorithm is applied to extract the scatterers of a single ship target with a single IPP.Afterwards,a novel image amplitude estimation approach is pro-posed,with which the radar image of a single target with a sin-gle IPP can be generated.The proposed method can accom-plish IPP selection and targets separation in the image domain,which can improve the image quality and reserve the target information most possibly.Results of simulated and real mea-sured data demonstrate the effectiveness of the proposed method.

CPG Human Motion Phase Recognition Algorithm for a Hip Exoskeleton with VSA Actuator

Due to the dynamic stiffness characteristics of human joints, it is easy to cause impact and disturbance on normal movements during exoskeleton assistance. This not only brings strict requirements for exoskeleton control design, but also makes it difficult to improve assistive level. The Variable Stiffness Actuator (VSA), as a physical variable stiffness mechanism, has the characteristics of dynamic stiffness adjustment and high stiffness control bandwidth, which is in line with the stiffness matching experiment. However, there are still few works exploring the assistive human stiffness matching experiment based on VSA. Therefore, this paper designs a hip exoskeleton based on VSA actuator and studies CPG human motion phase recognition algorithm. Firstly, this paper puts forward the requirements of variable stiffness experimental design and the output torque and variable stiffness dynamic response standards based on human lower limb motion parameters. Plate springs are used as elastic elements to establish the mechanical principle of variable stiffness, and a small variable stiffness actuator is designed based on the plate spring. Then the corresponding theoretical dynamic model is established and analyzed. Starting from the CPG phase recognition algorithm, this paper uses perturbation theory to expand the first-order CPG unit, obtains the phase convergence equation and verifies the phase convergence when using hip joint angle as the input signal with the same frequency, and then expands the second-order CPG unit under the premise of circular limit cycle and analyzes the frequency convergence criterion. Afterwards, this paper extracts the plate spring modal from Abaqus and generates the neutral file of the flexible body model to import into Adams, and conducts torque-stiffness one-way loading and reciprocating loading experiments on the variable stiffness mechanism. After that, Simulink is used to verify the validity of the criterion. Finally, based on the above criterions, the signal mean value is removed using feedback structure to complete the phase recognition algorithm for the human hip joint angle signal, and the convergence is verified using actual human walking data on flat ground.

基于IPOA的太阳电池模型参数辨识

太阳电池模型参数的准确辨识对光伏组件功率预测和最大功率点追踪有较大影响,必须保证较高的辨识精度。传统的智能算法能做到一定程度上的参数辨识,但均存在精度不足、收敛速度慢、易陷入局部最优等问题。针对此类问题,提出基于改进鹈鹕优化算法(IPOA)的太阳电池模型参数辨识方法。该算法中种群个体联系紧密,通过随机性的互相学习进行位置更新,在工程应用领域有着较传统算法更好的效果。同时,针对该算法特点,引入基于Jaya算法的位置更新策略,使种群的候选解更趋向最优解;改进了递减因子,使模型在迭代中后期寻优效果更好。增加了莱维飞行策略,有效提高了算法精度。在不同的太阳辐照度条件下,IPOA都有较好效果,辨识结果与实际曲线拟合度高,表明IPOA能在不同环境中对太阳电池模型参数进行准确有效辨识。

基于IPSO-MCKD的汽车变速箱轴承故障诊断

针对车辆在城区运行过程中频繁启停造成变速箱滚动轴承故障易发的问题,在轴承故障诊断中引入最大相关峭度反卷积(Maximum Correlation Kurtosis Deconvolution,MCKD)的方法,为了避免过于依赖人工选择MCKD算法中滤波器系数和移位数,提出了一种参数自适应的最大相关峭度反卷积的故障诊断方法。该方法以输入信号的包络谱中最大相关峭度为目标函数,采用改进后的粒子群优化(Improved Particle Swarm Optimization,IPSO)算法优化MCKD中的滤波器系数和位移数,最后通过对故障信号的包络谱进行分析,提取轴承的故障特征。仿真和试验的结果表明,该方法可以有效降低环境中的噪声干扰,准确从强噪声中提取故障特征,实现故障诊断。

The improved artificial bee colony algorithm for mixed additive and multiplicative random error model and the bootstrap method for its precision estimation

To solve the complex weight matrix derivative problem when using the weighted least squares method to estimate the parameters of the mixed additive and multiplicative random error model(MAM error model),we use an improved artificial bee colony algorithm without derivative and the bootstrap method to estimate the parameters and evaluate the accuracy of MAM error model.The improved artificial bee colony algorithm can update individuals in multiple dimensions and improve the cooperation ability between individuals by constructing a new search equation based on the idea of quasi-affine transformation.The experimental results show that based on the weighted least squares criterion,the algorithm can get the results consistent with the weighted least squares method without multiple formula derivation.The parameter estimation and accuracy evaluation method based on the bootstrap method can get better parameter estimation and more reasonable accuracy information than existing methods,which provides a new idea for the theory of parameter estimation and accuracy evaluation of the MAM error model.

基于区块链的Gossip协议优化研究

Gossip网络协议具有高效性和扩展性,广泛应用于区块链分布式系统的底层通信协议。针对联盟链中Gossip网络协议的冗余现象造成的传播效率下降,提出了Stack Gossip算法。该算法将收到的节点信息记录在信息栈中,避免向一个节点重复发送消息。实验发现,Stack Gossip算法不适用于大规模网络中节点数量过多的情况。为此,进一步提出Influence Gossip算法,其核心思路是节点通过评估邻居节点的信息影响力来选择通信的对等节点,在一定程度上避免了传统Gossip网络协议节点间传播的随机性。实验结果表明,与Random Gossip算法相比,Influence Gossip和Stack Gossip算法传播效率和产生的冗余有明显改进。

A greedy path planning algorithm based on pre-path-planning and real-time-conflict for multiple automated guided vehicles in large-scale outdoor scenarios

With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.

基于ADE优化的IPMSM全速域无传感器控制

为了实现内置式永磁同步电机(IPMSM)全速域的无传感器控制和切换速域的平滑过渡,提出了一种基于自适应差分进化(ADE)算法优化的复合控制方法。分别在零低速域、中高速域采用旋转高频电压注入法和滑模观测器法来对电机转速和转子位置进行估算,并在切换速域采用基于ADE算法的权重系数优化法来实现上述两种控制方法的平滑切换,从而实现IPMSM全速域无传感器控制。仿真结果表明:提出的复合控制方法能够实现电机全速域的无感控制和切换速域的平滑过渡,且具有良好的稳定性。

基于IPSO-RBF神经网络的西北内陆河流域突发水污染风险评估

突发水污染事故会破坏环境、危害健康,开展西北内陆河流域突发水污染风险评估对于维护西部脆弱生态安全尤为重要。该文针对西北内陆河流域突发水污染问题,利用PSR模型遴选18个因素建立突发水污染风险评价指标体系,基于径向基神经网络模型(RBF)构建突发水污染风险评价模型。为进一步保证模型精度,采用改进惯性权重因子和学习因子的粒子群算法(IPSO)对神经网络模型参数进行优化,建立IPSO-RBF神经网络西北内陆河突发水污染风险评价模型,并运用该模型对石羊河流域武威段2017-2022年突发水污染进行风险等级评价。结果显示,石羊河流域武威段突发水污染2017-2019年风险等级为Ⅱ级,2020-2022年风险等级为Ⅲ级,结果与熵权-TOPSIS法一致,与流域治理情况相符。该研究成果有利于提升石羊河流域突发水污染的防控水平与应急处置能力,对于西北内陆河流域水资源管理以及祁连山生态保护具有重要意义。

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).

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.

Ship Weather Routing Based on Hybrid Genetic Algorithm Under Complicated Sea Conditions

Considering the effects of increased economic globalization and global warming,developing methods for reducing shipping costs and greenhouse gas emissions in ocean transportation has become crucial.Owing to its key role in modern navigation technology,ship weather routing is the research focus of several scholars in this field.This study presents a hybrid genetic algorithm for the design of an optimal ship route for safe transoceanic navigation under complicated sea conditions.On the basis of the basic genetic algorithm,simulated annealing algorithm is introduced to enhance its local search ability and avoid premature convergence,with the ship’s voyage time and fuel consumption as optimization goals.Then,a mathematical model of ship weather routing is developed based on the grid system.A measure of fitness calibration is proposed,which can change the selection pressure of the algorithm as the population evolves.In addition,a hybrid crossover operator is proposed to enhance the ability to find the optimal solution and accelerate the convergence speed of the algorithm.Finally,a multi-population technique is applied to improve the robustness of the algorithm using different evolutionary strategies.