Robust Space-Time Adaptive Track-Before-Detect Algorithm Based on Persymmetry and Symmetric Spectrum

Underwater monopulse space-time adaptive track-before-detect method,which combines space-time adaptive detector(STAD)and the track-before-detect algorithm based on dynamic programming(DP-TBD),denoted as STAD-DP-TBD,can effectively detect low-speed weak targets.However,due to the complexity and variability of the underwater environment,it is difficult to obtain sufficient secondary data,resulting in a serious decline in the detection and tracking performance,and leading to poor robustness of the algorithm.In this paper,based on the adaptive matched filter(AMF)test and the RAO test,underwater monopulse AMF-DP-TBD algorithm and RAO-DP-TBD algorithm which incorporate persymmetry and symmetric spectrum,denoted as PSAMF-DP-TBD and PS-RAO-DP-TBD,are proposed and compared with the AMF-DP-TBD algorithm and RAO-DP-TBD algorithm based on persymmetry array,denoted as P-AMF-DP-TBD and P-RAO-DP-TBD.The simulation results show that the four methods can work normally with sufficient secondary data and slightly insufficient secondary data,but when the secondary data is severely insufficient,the P-AMF-DP-TBD and P-RAO-DP-TBD algorithms has failed while the PSAMF-DP-TBD and PS-RAO-DP-TBD algorithms still have good detection and tracking capabilities.

Adaptive Fault Estimation for Dynamics of High Speed Train Based on Robust UKF Algorithm

This paper proposes an adaptive unscented Kalman filter algorithm(ARUKF)to implement fault estimation for the dynamics of high⁃speed train(HST)with measurement uncertainty and time⁃varying noise with unknown statistics.Firstly,regarding the actuator and sensor fault as the auxiliary variables of the dynamics of HST,an augmented system is established,and the fault estimation problem for dynamics of HST is formulated as the state estimation of the augmented system.Then,considering the measurement uncertainties,a robust lower bound is proposed to modify the update of the UKF to decrease the influence of measurement uncertainty on the filtering accuracy.Further,considering the unknown time⁃varying noise of the dynamics of HST,an adaptive UKF algorithm based on moving window is proposed to estimate the time⁃varying noise so that accurate concurrent actuator and sensor fault estimations of dynamics of HST is implemented.Finally,a five-car model of HST is given to show the effectiveness of this method.

A robust sparse representation algorithm based on adaptive joint dictionary

Sparse representation based on dictionary construction and learning methods have aroused interests in the field of face recognition.Aiming at the shortcomings of face feature dictionary not‘clean’and noise interference dictionary not‘representative’in sparse representation classification model,a new method named as robust sparse representation is proposed based on adaptive joint dictionary(RSR-AJD).First,a fast lowrank subspace recovery algorithm based on LogDet function(Fast LRSR-LogDet)is proposed for accurate low-rank facial intrinsic dictionary representing the similar structure of human face and low computational complexity.Then,the Iteratively Reweighted Robust Principal Component Analysis(IRRPCA)algorithm is used to get a more precise occlusion dictionary for depicting the possible discontinuous interference information attached to human face such as glasses occlusion or scarf occlusion etc.Finally,the above Fast LRSR-LogDet algorithm and IRRPCA algorithm are adopted to construct the adaptive joint dictionary,which includes the low-rank facial intrinsic dictionary,the occlusion dictionary and the remaining intra-class variant dictionary for robust sparse coding.Experiments conducted on four popular databases(AR,Extended Yale B,LFW,and Pubfig)verify the robustness and effectiveness of the authors’method.

Structural plane recognition from three-dimensional laser scanning points using an improved region-growing algorithm based on the robust randomized Hough transform

The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.

Robustα-Fe_(2)O_(3)/Epoxy Resin Superhydrophobic Coatings for Anti-icing Property

α-Fe_(2)O_(3)/epoxy resin composite superhydrophobic coating was prepared withα-Fe_(2)O_(3) nanoparticles and epoxy resin by spin coating method.The coating without epoxy resin has higher contact angle(CA)and lower ice adhesion strength(IAS),but the mechanical properties are poor.Theα-Fe_(2)O_(3)/epoxy resin composite superhydrophobic coating exhibits good mechanical durability.In addition,compared with the bare aluminum substrate,the Ecorr of the composite coating is positive and the Jcorr is lower.The inhibition efficiency of the composite coating is as high as 99.98%in 3.5 wt%NaCl solution.The difference in the microstructure caused by the two preparation methods leads to the changes in mechanical properties and corrosion resistance of composite superhydrophobic coating.

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.

Robustness Study and Superior Method Development and Validation for Analytical Assay Method of Atropine Sulfate in Pharmaceutical Ophthalmic Solution

Background: The robustness is a measurement of an analytical chemical method and its ability to contain unaffected by little with deliberate variation of analytical chemical method parameters. The analytical chemical method variation parameters are based on pH variability of buffer solution of mobile phase, organic ratio composition changes, stationary phase (column) manufacture, brand name and lot number variation;flow rate variation and temperature variation of chromatographic system. The analytical chemical method for assay of Atropine Sulfate conducted for robustness evaluation. The typical variation considered for mobile phase organic ratio change, change of pH, change of temperature, change of flow rate, change of column etc. Purpose: The aim of this study is to develop a cost effective, short run time and robust analytical chemical method for the assay quantification of Atropine in Pharmaceutical Ophthalmic Solution. This will help to make analytical decisions quickly for research and development scientists as well as will help with quality control product release for patient consumption. This analytical method will help to meet the market demand through quick quality control test of Atropine Ophthalmic Solution and it is very easy for maintaining (GDP) good documentation practices within the shortest period of time. Method: HPLC method has been selected for developing superior method to Compendial method. Both the compendial HPLC method and developed HPLC method was run into the same HPLC system to prove the superiority of developed method. Sensitivity, precision, reproducibility, accuracy parameters were considered for superiority of method. Mobile phase ratio change, pH of buffer solution, change of stationary phase temperature, change of flow rate and change of column were taken into consideration for robustness study of the developed method. Results: The limit of quantitation (LOQ) of developed method was much low than the compendial method. The % RSD for the six sample assay of developed method was 0.4% where the % RSD of the compendial method was 1.2%. The reproducibility between two analysts was 100.4% for developed method on the contrary the compendial method was 98.4%.

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.

Synergistic Swarm Optimization Algorithm

This research paper presents a novel optimization method called the Synergistic Swarm Optimization Algorithm(SSOA).The SSOA combines the principles of swarmintelligence and synergistic cooperation to search for optimal solutions efficiently.A synergistic cooperation mechanism is employed,where particles exchange information and learn from each other to improve their search behaviors.This cooperation enhances the exploitation of promising regions in the search space while maintaining exploration capabilities.Furthermore,adaptive mechanisms,such as dynamic parameter adjustment and diversification strategies,are incorporated to balance exploration and exploitation.By leveraging the collaborative nature of swarm intelligence and integrating synergistic cooperation,the SSOAmethod aims to achieve superior convergence speed and solution quality performance compared to other optimization algorithms.The effectiveness of the proposed SSOA is investigated in solving the 23 benchmark functions and various engineering design problems.The experimental results highlight the effectiveness and potential of the SSOA method in addressing challenging optimization problems,making it a promising tool for a wide range of applications in engineering and beyond.Matlab codes of SSOA are available at:https://www.mathworks.com/matlabcentral/fileexchange/153466-synergistic-swarm-optimization-algorithm.

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).

An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

Robust optical mode converter based on topological waveguide arrays

Optical mode converters are essential for enhancing the capacity of optical communication systems. However, fabrication errors restrict the further improvement of conventional mode converters. To address this challenge, we have designed an on-chip TE0–TE1mode converter based on topologically protected waveguide arrays. The simulation results demonstrate that the converter exhibits a mode coupling efficiency of 93.5% near 1550 nm and can tolerate a relative fabrication error of 30%. Our design approach can be extended to enhance the robustness for other integrated photonic devices, beneficial for future development of optical network systems.

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.

Nonlinear robust adaptive control for bidirectional stabilization system of all-electric tank with unknown actuator backlash compensation and disturbance estimation

Since backlash nonlinearity is inevitably existing in actuators for bidirectional stabilization system of allelectric tank,it behaves more drastically in high maneuvering environments.In this work,the accurate tracking control for bidirectional stabilization system of moving all-electric tank with actuator backlash and unmodeled disturbance is solved.By utilizing the smooth adaptive backlash inverse model,a nonlinear robust adaptive feedback control scheme is presented.The unknown parameters and unmodelled disturbance are addressed separately through the derived parametric adaptive function and the continuous nonlinear robust term.Because the unknown backlash parameters are updated via adaptive function and the backlash effect can be suppressed successfully by inverse operation,which ensures the system stability.Meanwhile,the system disturbance in the high maneuverable environment can be estimated with the constructed adaptive law online improving the engineering practicality.Finally,Lyapunov-based analysis proves that the developed controller can ensure the tracking error asymptotically converges to zero even with unmodeled disturbance and unknown actuator backlash.Contrast co-simulations and experiments illustrate the advantages of the proposed approach.

Constructing high-toughness polyimide binder with robust polarity and ion-conductive mechanisms ensuring long-term operational stability of silicon-based anodes

Silicon-based materials have demonstrated remarkable potential in high-energy-density batteries owing to their high theoretical capacity.However,the significant volume expansion of silicon seriously hinders its utilization as a lithium-ion anode.Herein,a functionalized high-toughness polyimide(PDMI) is synthesized by copolymerizing the 4,4'-Oxydiphthalic anhydride(ODPA) with 4,4'-oxydianiline(ODA),2,3-diaminobenzoic acid(DABA),and 1,3-bis(3-aminopropyl)-tetramethyl disiloxane(DMS).The combination of rigid benzene rings and flexible oxygen groups(-O-) in the PDMI molecular chain via a rigidness/softness coupling mechanism contributes to high toughness.The plentiful polar carboxyl(-COOH) groups establish robust bonding strength.Rapid ionic transport is achieved by incorporating the flexible siloxane segment(Si-O-Si),which imparts high molecular chain motility and augments free volume holes to facilitate lithium-ion transport(9.8 × 10^(-10) cm^(2) s^(-1) vs.16 × 10^(-10) cm^(2) s~(-1)).As expected,the SiO_x@PDMI-1.5 electrode delivers brilliant long-term cycle performance with a remarkable capacity retention of 85% over 500 cycles at 1.3 A g^(-1).The well-designed functionalized polyimide also significantly enhances the electrochemical properties of Si nanoparticles electrode.Meanwhile,the assembled SiO_x@PDMI-1.5/NCM811 full cell delivers a high retention of 80% after 100 cycles.The perspective of the binder design strategy based on polyimide modification delivers a novel path toward high-capacity electrodes for high-energy-density batteries.

Robust optimal dispatch strategy of integrated energy system considering CHP-P2G-CCS

Integrated energy systems(IESs)can improve energy efficiency and reduce carbon emissions,essential for achieving peak carbon emissions and carbon neutrality.This study investigated the characteristics of the CHP model considering P2G and carbon capture systems,and a two-stage robust optimization model of the electricity-heat-gascold integrated energy system was developed.First,a CHP model considering the P2G and carbon capture system was established,and the electric-thermal coupling characteristics and P2G capacity constraints of the model were derived,which proved that the model could weaken the electric-thermal coupling characteristics,increase the electric power regulation range,and reduce carbon emissions.Subsequently,a two-stage robust optimal scheduling model of an IES was constructed,in which the objective function in the day-ahead scheduling stage was to minimize the start-up and shutdown costs.The objective function in the real-time scheduling stage was to minimize the equipment operating costs,carbon emission costs,wind curtailment,and solar curtailment costs,considering multiple uncertainties.Finally,after the objective function is linearized with a ψ-piecewise method,the model is solved based on the C&CG algorithm.Simulation results show that the proposed model can effectively absorb renewable energy and reduce the total cost of the system.

Intelligent Solution System for Cloud Security Based on Equity Distribution:Model and Algorithms

In the cloud environment,ensuring a high level of data security is in high demand.Data planning storage optimization is part of the whole security process in the cloud environment.It enables data security by avoiding the risk of data loss and data overlapping.The development of data flow scheduling approaches in the cloud environment taking security parameters into account is insufficient.In our work,we propose a data scheduling model for the cloud environment.Themodel is made up of three parts that together help dispatch user data flow to the appropriate cloudVMs.The first component is the Collector Agent whichmust periodically collect information on the state of the network links.The second one is the monitoring agent which must then analyze,classify,and make a decision on the state of the link and finally transmit this information to the scheduler.The third one is the scheduler who must consider previous information to transfer user data,including fair distribution and reliable paths.It should be noted that each part of the proposedmodel requires the development of its algorithms.In this article,we are interested in the development of data transfer algorithms,including fairness distribution with the consideration of a stable link state.These algorithms are based on the grouping of transmitted files and the iterative method.The proposed algorithms showthe performances to obtain an approximate solution to the studied problem which is an NP-hard(Non-Polynomial solution)problem.The experimental results show that the best algorithm is the half-grouped minimum excluding(HME),with a percentage of 91.3%,an average deviation of 0.042,and an execution time of 0.001 s.

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.

STRONGLY CONVERGENT INERTIAL FORWARD-BACKWARD-FORWARD ALGORITHM WITHOUT ON-LINE RULE FOR VARIATIONAL INEQUALITIES

This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.