Optimization of magnetic field design for Hall thrusters based on a genetic algorithm

Magnetic field design is essential for the operation of Hall thrusters.This study focuses on utilizing a genetic algorithm to optimize the magnetic field configuration of SPT70.A 2D hybrid PIC-DSMC and channel-wall erosion model are employed to analyze the plume divergence angle and wall erosion rate,while a Farady probe measurement and laser profilometry system are set up to verify the simulation results.The results demonstrate that the genetic algorithm contributes to reducing the divergence angle of the thruster plumes and alleviating the impact of high-energy particles on the discharge channel wall,reducing the erosion by 5.5%and 2.7%,respectively.Further analysis indicates that the change from a divergent magnetic field to a convergent magnetic field,combined with the upstream shift of the ionization region,contributes to the improving the operation of the Hall thruster.

Research on Total Electric Field Prediction Method of Ultra-High Voltage Direct Current Transmission Line Based on Stacking Algorithm

Ultra-high voltage(UHV)transmission lines are an important part of China’s power grid and are often surrounded by a complex electromagnetic environment.The ground total electric field is considered a main electromagnetic environment indicator of UHV transmission lines and is currently employed for reliable long-term operation of the power grid.Yet,the accurate prediction of the ground total electric field remains a technical challenge.In this work,we collected the total electric field data from the Ningdong-Zhejiang±800 kV UHVDC transmission project,as of the Ling Shao line,and perform an outlier analysis of the total electric field data.We show that the Local Outlier Factor(LOF)elimination algorithm has a small average difference and overcomes the performance of Density-Based Spatial Clustering of Applications with Noise(DBSCAN)and Isolated Forest elimination algorithms.Moreover,the Stacking algorithm has been found to have superior prediction accuracy than a variety of similar prediction algorithms,including the traditional finite element.The low prediction error of the Stacking algorithm highlights the superior ability to accurately forecast the ground total electric field of UHVDC transmission lines.

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.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

Analytical computation of magnetic field in coil-dominated superconducting quadrupole magnets based on racetrack coils

Currently,three types of superconducting quadrupole magnets are used in particle accelerators:cos 2θ,CCT,and serpentine.However,all three coil configurations have complex spatial geometries,which make magnet manufacturing and strain-sensitive superconductor applications difficult.Compared with the three existing quadrupole coils,the racetrack quadrupole coil has a simple shape and manufacturing process,but there have been few theoretical studies.In this paper,the two-dimensional and three-dimensional analytical expressions for the magnetic field in coil-dominated racetrack superconducting quadrupole magnets are presented.The analytical expressions of the field harmonics and gradient are fully resolved and depend only on the geometric parameters of the coil and current density.Then,a genetic algorithm is applied to obtain a solution for the coil geometry parameters with field harmonics on the order of 10^(-4).Finally,considering the practical engineering needs of the accelerator interaction region,electromagnetic design examples of racetrack quadrupole magnets with high gradients,large apertures,and small apertures are described,and the application prospects of racetrack quadrupole coils are analyzed.

Structure-preserving algorithms for guiding center dynamics based on the slow manifold of classical Pauli particle

The classical Pauli particle(CPP) serves as a slow manifold, substituting the conventional guiding center dynamics. Based on the CPP, we utilize the averaged vector field(AVF) method in the computations of drift orbits. Demonstrating significantly higher efficiency, this advanced method is capable of accomplishing the simulation in less than one-third of the time of directly computing the guiding center motion. In contrast to the CPP-based Boris algorithm, this approach inherits the advantages of the AVF method, yielding stable trajectories even achieved with a tenfold time step and reducing the energy error by two orders of magnitude. By comparing these two CPP algorithms with the traditional RK4 method, the numerical results indicate a remarkable performance in terms of both the computational efficiency and error elimination. Moreover, we verify the properties of slow manifold integrators and successfully observe the bounce on both sides of the limiting slow manifold with deliberately chosen perturbed initial conditions. To evaluate the practical value of the methods, we conduct simulations in non-axisymmetric perturbation magnetic fields as part of the experiments,demonstrating that our CPP-based AVF method can handle simulations under complex magnetic field configurations with high accuracy, which the CPP-based Boris algorithm lacks. Through numerical experiments, we demonstrate that the CPP can replace guiding center dynamics in using energy-preserving algorithms for computations, providing a new, efficient, as well as stable approach for applying structure-preserving algorithms in plasma simulations.

Data-model coupling driven stress field measurements

This paper presents a method for measuring stress fields within the framework of coupled data models,aimed at determining stress fields in isotropic material structures exhibiting localized deterioration behavior without relying on constitutive equations in the deteriorated region.This approach contributes to advancing the field of intrinsic equation-free mechanics.The methodology combines measured strain fields with data-model coupling driven algorithms.The gradient and Canny operators are utilized to process the strain field data,enabling the determination of the deterioration region's location.Meanwhile,an adaptive model building method is proposed for constructing coupling driven models.To address the issue of unknown datasets during computation,a dataset updating strategy based on a differential evolutionary algorithm is introduced.The resulting optimal dataset is then used to generate stress field results.Validation against finite element method calculations demonstrates the accuracy of the proposed method in obtaining full-field stresses in specimens with local degradation behavior.

A data-adaptive network design for the regional gravity field modelling using spherical radial basis functions

A high-precision regional gravity field model is significant in various geodesy applications.In the field of modelling regional gravity fields,the spherical radial basis functions(SRBFs)approach has recently gained widespread attention,while the modelling precision is primarily influenced by the base function network.In this study,we propose a method for constructing a data-adaptive network of SRBFs using a modified Hierarchical Density-Based Spatial Clustering of Applications with Noise(HDBSCAN)algorithm,and the performance of the algorithm is verified by the observed gravity data in the Auvergne area.Furthermore,the turning point method is used to optimize the bandwidth of the basis function spectrum,which satisfies the demand for both high-precision gravity field and quasi-geoid modelling simultaneously.Numerical experimental results indicate that our algorithm has an accuracy of about 1.58 mGal in constructing the gravity field model and about 0.03 m in the regional quasi-geoid model.Compared to the existing methods,the number of SRBFs used for modelling has been reduced by 15.8%,and the time cost to determine the centre positions of SRBFs has been saved by 12.5%.Hence,the modified HDBSCAN algorithm presented here is a suitable design method for constructing the SRBF data adaptive network.

MarkNeRF:Watermarking for Neural Radiance Field

This paper presents a novel watermarking scheme designed to address the copyright protection challenges encountered with Neural radiation field(NeRF)models.We employ an embedding network to integrate the watermark into the images within the training set.Then,theNeRFmodel is utilized for 3Dmodeling.For copyright verification,a secret image is generated by inputting a confidential viewpoint into NeRF.On this basis,design an extraction network to extract embedded watermark images fromconfidential viewpoints.In the event of suspicion regarding the unauthorized usage of NeRF in a black-box scenario,the verifier can extract the watermark from the confidential viewpoint to authenticate the model’s copyright.The experimental results demonstrate not only the production of visually appealing watermarks but also robust resistance against various types of noise attacks,thereby substantiating the effectiveness of our approach in safeguarding NeRF.

RWNeRF:Robust Watermarking Scheme for Neural Radiance Fields Based on Invertible Neural Networks

As neural radiance fields continue to advance in 3D content representation,the copyright issues surrounding 3D models oriented towards implicit representation become increasingly pressing.In response to this challenge,this paper treats the embedding and extraction of neural radiance field watermarks as inverse problems of image transformations and proposes a scheme for protecting neural radiance field copyrights using invertible neural network watermarking.Leveraging 2D image watermarking technology for 3D scene protection,the scheme embeds watermarks within the training images of neural radiance fields through the forward process in invertible neural networks and extracts them from images rendered by neural radiance fields through the reverse process,thereby ensuring copyright protection for both the neural radiance fields and associated 3D scenes.However,challenges such as information loss during rendering processes and deliberate tampering necessitate the design of an image quality enhancement module to increase the scheme’s robustness.This module restores distorted images through neural network processing before watermark extraction.Additionally,embedding watermarks in each training image enables watermark information extraction from multiple viewpoints.Our proposed watermarking method achieves a PSNR(Peak Signal-to-Noise Ratio)value exceeding 37 dB for images containing watermarks and 22 dB for recovered watermarked images,as evaluated on the Lego,Hotdog,and Chair datasets,respectively.These results demonstrate the efficacy of our scheme in enhancing copyright protection.

DESIGN AND IMPLEMENTATION OF DUAL-FIELD MODULAR INVERSION ALGORITHM

Modular inverse arithmetic plays an important role in elliptic curve cryptography. Based on the analysis of Montgomery modular inversion algorithm, this paper presents a new dual-field modular inversion algorithm, and a novel scalable and unified architecture for Montgomery inverse hardware in finite fields GF(p) and GF(2n) is proposed. Furthermore, this architecture based on the new modular inversion algorithm has been verified by modeling it in Verilog-HDL, and accomplished it under 0.18 μm CMOS technology. The result indicates that our work has better performance and flexibility than other works.

NOVEL APPROACH FOR ROBOT PATH PLANNING BASED ON NUMERICAL ARTIFICIAL POTENTIAL FIELD AND GENETIC ALGORITHM

A novel approach for collision-free path planning of a multiple degree-of-freedom （DOF） articulated robot in a complex environment is proposed. Firstly, based on visual neighbor point （VNP）, a numerical artificial potential field is constructed in Cartesian space, which provides the heuristic information, effective distance to the goal and the motion direction for the motion of the robot joints. Secondly, a genetic algorithm, combined with the heuristic rules, is used in joint space to determine a series of contiguous configurations piecewise from initial configuration until the goal configuration is attained. A simulation shows that the method can not only handle issues on path planning of the articulated robots in environment with complex obstacles, but also improve the efficiency and quality of path planning.

Optimum Location of Field Hospitals for COVID-19: A Nonlinear Binary Metaheuristic Algorithm

Determining the optimum location of facilities is critical in many fields,particularly in healthcare.This study proposes the application of a suitable location model for field hospitals during the novel coronavirus 2019(COVID-19)pandemic.The used model is the most appropriate among the three most common location models utilized to solve healthcare problems(the set covering model,the maximal covering model,and the P-median model).The proposed nonlinear binary constrained model is a slight modification of the maximal covering model with a set of nonlinear constraints.The model is used to determine the optimum location of field hospitals for COVID-19 risk reduction.The designed mathematical model and the solution method are used to deploy field hospitals in eight governorates in Upper Egypt.In this case study,a discrete binary gaining–sharing knowledge-based optimization(DBGSK)algorithm is proposed.The DBGSK algorithm is based on how humans acquire and share knowledge throughout their life.The DBGSK algorithm mainly depends on two junior and senior binary stages.These two stages enable DBGSK to explore and exploit the search space efficiently and effectively,and thus it can solve problems in binary space.

Dynamic self-adaptive ANP algorithm and its application to electric field simulation of aluminum reduction cell

Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.

Secure Image Communication Using Galois Field,Hyper 3D Logistic Map,and B92 Quantum Protocol

In this paper,we propose a novel secure image communication system that integrates quantum key distribution and hyperchaotic encryption techniques to ensure enhanced security for both key distribution and plaintext encryption.Specifically,we leverage the B92 Quantum Key Distribution(QKD)protocol to secure the distribution of encryption keys,which are further processed through Galois Field(GF(28))operations for increased security.The encrypted plaintext is secured using a newly developed Hyper 3D Logistic Map(H3LM),a chaotic system that generates complex and unpredictable sequences,thereby ensuring strong confusion and diffusion in the encryption process.This hybrid approach offers a robust defense against quantum and classical cryptographic attacks,combining the advantages of quantum-level key distribution with the unpredictability of hyperchaos-based encryption.The proposed method demonstrates high sensitivity to key changes and resilience to noise,compression,and cropping attacks,ensuring both secure key transmission and robust image encryption.

Mobile robot path planning method combined improved artificial potential field with optimization algorithm

To overcome the shortcomings of the traditional artificial potential field method in mobile robot path planning, an improved artificial potential field model （IAPFM） was established, then a new path planning method combining the IAPFM with optimization algorithm （trust region algorithm） is proposed. Attractive force between the robot and the target location, and repulsive force between the robot and the obstacles are both converted to the potential field intensity; and filled potential field is used to guide the robot to go out of the local minimum points ; on this basis, the effect of dynamic obstacles velocity and the robot＇s velocity is consid thers and the IAPFM is established, then both the expressions of the attractive potential field and the repulsive potential field are obtained. The trust region algorithm is used to search the minimum value of the sum of all the potential field inten- sities within the movement scope which the robot can arrive in a sampling period. Connecting of all the points which hare the minimum intensity in every sampling period constitutes the global optimization path. Experiment result shows that the method can meet the real-time requirement, and is able to execute the mobile robot path planning task effectively in the dynamic environment.

THE DECISION OF THE OPTIMAL PARAMETERS IN MARKOV RANDOM FIELDS OF IMAGES BY GENETIC ALGORITHM

This paper introduces the principle of genetic algorithm and the basic method of solving Markov random field parameters.Focusing on the shortcomings in present methods,a new method based on genetic algorithms is proposed to solve the parameters in the Markov random field.The detailed procedure is discussed.On the basis of the parameters solved by genetic algorithms,some experiments on classification of aerial images are given.Experimental results show that the proposed method is effective and the classification results are satisfactory.

Performance comparison of several optimization algorithms in matched field inversion

Optimization efficiencies and mechanisms of simulated annealing, genetic algorithm, differential evolution and downhill simplex differential evolution are compared and analyzed. Simulated annealing and genetic algorithm use a directed random process to search the parameter space for an optimal solution. They include the ability to avoid local minima, but as no gradient information is used, searches may be relatively inefficient. Differential evolution uses information from a distance and azimuth between individuals of a population to search the parameter space, the initial search is effective, but the search speed decreases quickly because differential information between the individuals of population vanishes. Local downhill simplex and global differential evolution methods are developed separately, and combined to produce a hybrid downhill simplex differential evolution algorithm. The hybrid algorithm is sensitive to gradients of the object function and search of the parameter space is effective. These algorithms are applied to the matched field inversion with synthetic data. Optimal values of the parameters, the final values of object function and inversion time is presented and compared.

Genetic algorithm-finite element method inversion of the factors determining the recent tectonic stress field of part of East Asia area

Genetic algorithm finite element method (GA FEM) is applied to the study of tectonic stress field of part of East Asia area. From the observed stress distribution, 2 D elastic plane stress inversion is made to deduce the boundary forces and investigate controlling factors. It is suggested that the continent continent collision is the dominant factor controlling the Chinese tectonic stress field. The ocean continent convergence along the subduction zone is an important factor. There exists tensile boundary force along the marginal sea.

Digital Restoration of Historical Buildings by Integrating 3D PC Reconstruction and GAN Algorithm

Historical architecture is an important carrier of cultural and historical heritage in a country and region,and its protection and restoration work plays a crucial role in the inheritance of cultural heritage.However,the damage and destruction of buildings urgently need to be repaired due to the ancient age of historical buildings and the influence of natural environment and human factors.Therefore,an artificial intelligence repair technology based on three-dimensional(3D)point cloud(PC)reconstruction and generative adversarial networks(GANs)was proposed to improve the precision and efficiency of repair work.First,in-depth research on the principles and algorithms of 3D PC data processing and GANs should be conducted.Second,a digital restoration frameworkwas constructed by combining these two artificial intelligence technologies to achieve precise and efficient restoration of historical buildings through continuous adversarial learning processes.The experimental results showed that the errors in the restoration of palace buildings,defense walls,pagodas,altars,temples,and mausoleums were 0.17,0.12,0.13,0.11,and 0.09,respectively.The technique can significantly reduce the error while maintaining the high-precision repair effect.This technology with artificial intelligence as the core has excellent accuracy and stability in the digital restoration.It provides a new technical means for the digital restoration of historical buildings and has important practical significance for the protection of cultural heritage.