In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,wh...The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.展开更多
Reliable Cluster Head(CH)selectionbased routing protocols are necessary for increasing the packet transmission efficiency with optimal path discovery that never introduces degradation over the transmission reliability...Reliable Cluster Head(CH)selectionbased routing protocols are necessary for increasing the packet transmission efficiency with optimal path discovery that never introduces degradation over the transmission reliability.In this paper,Hybrid Golden Jackal,and Improved Whale Optimization Algorithm(HGJIWOA)is proposed as an effective and optimal routing protocol that guarantees efficient routing of data packets in the established between the CHs and the movable sink.This HGJIWOA included the phases of Dynamic Lens-Imaging Learning Strategy and Novel Update Rules for determining the reliable route essential for data packets broadcasting attained through fitness measure estimation-based CH selection.The process of CH selection achieved using Golden Jackal Optimization Algorithm(GJOA)completely depends on the factors of maintainability,consistency,trust,delay,and energy.The adopted GJOA algorithm play a dominant role in determining the optimal path of routing depending on the parameter of reduced delay and minimal distance.It further utilized Improved Whale Optimisation Algorithm(IWOA)for forwarding the data from chosen CHs to the BS via optimized route depending on the parameters of energy and distance.It also included a reliable route maintenance process that aids in deciding the selected route through which data need to be transmitted or re-routed.The simulation outcomes of the proposed HGJIWOA mechanism with different sensor nodes confirmed an improved mean throughput of 18.21%,sustained residual energy of 19.64%with minimized end-to-end delay of 21.82%,better than the competitive CH selection approaches.展开更多
Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ...Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.展开更多
With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state s...With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state secret algorithm GuoMi algorithm.The original Hyperledger Fabric only supports internationally common encryption algorithms,so it is particularly necessary to enhance support for the national encryption standard.Traditional identity authentication,access control,and security audit technologies have single-point failures,and data can be easily tampered with,leading to trust issues.To address these problems,this paper proposes an optimized and application research plan for Hyperledger Fabric.We study the optimization model of cryptographic components in Hyperledger Fabric,and based on Fabric's pluggable mechanism,we enhance the Fabric architecture with the national encryption standard.In addition,we research key technologies involved in the secure application protocol based on the blockchain.We propose a blockchain-based identity authentication protocol,detailing the design of an identity authentication scheme based on blockchain certificates and Fabric CA,and use a dual-signature method to further improve its security and reliability.Then,we propose a flexible,dynamically configurable real-time access control and security audit mechanism based on blockchain,further enhancing the security of the system.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper propo...With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper proposes an improved fluid flow algorithm,aiming to enhance the computational efficiency of hydraulic fracturing simulations while ensuring computational accuracy.The algorithm optimizes the aperture law and iteration criteria,focusing on improving the domain volume and crack pressure update strategy,thereby enabling precise capture of dynamic borehole pressure variations during injection tests.The effectiveness of the algorithm is verified through three flow-solid coupling cases.The study also analyzes the effects of borehole size,domain volume,and crack pressure update strategy on fracturing behavior.Furthermore,the performance of the improved algorithm in terms of crack propagation rate,micro-crack formation,and fluid pressure distribution was further evaluated.The results indicate that while large-size boreholes delay crack initiation,the cracks propagate more rapidly once formed.Additionally,the optimized domain volume calculation and crack pressure update strategy significantly shorten the pressure propagation stage,promote crack propagation,and improve computational efficiency.展开更多
The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward...The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward-looking information of key wind farms in a cluster under different weather conditions is an effective method to improve the accuracy of ultrashort-term cluster power forecasting.To this end,this paper proposes a refined modeling method for ultrashort-term wind power cluster forecasting based on a convergent cross-mapping algorithm.From the perspective of causality,key meteorological forecasting factors under different cluster power fluctuation processes were screened,and refined training modeling was performed for different fluctuation processes.First,a wind process description index system and classification model at the wind power cluster level are established to realize the classification of typical fluctuation processes.A meteorological-cluster power causal relationship evaluation model based on the convergent cross-mapping algorithm is pro-posed to screen meteorological forecasting factors under multiple types of typical fluctuation processes.Finally,a refined modeling meth-od for a variety of different typical fluctuation processes is proposed,and the strong causal meteorological forecasting factors of each scenario are used as inputs to realize high-precision modeling and forecasting of ultra-short-term wind cluster power.An example anal-ysis shows that the short-term wind power cluster power forecasting accuracy of the proposed method can reach 88.55%,which is 1.57-7.32%higher than that of traditional methods.展开更多
Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulner...Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic pathfinding.The A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic function.The 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications.展开更多
A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major cha...A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm(CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm(MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.展开更多
Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems wit...Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems with hundreds of antennas at the base station. This paper aims to address the minimum mean square error(MMSE) detection in uplink massive MIMO systems utilizing the symmetric complex bi-conjugate gradients(SCBiCG) and the Lanczos method. Both the proposed methods can avoid the large scale matrix inversion which is necessary for MMSE, thus, reducing the computational complexity by an order of magnitude with respect to the number of user equipment. To enable the proposed methods for soft-output detection, we also derive an approximating calculation scheme for the log-likelihood ratios(LLRs), which further reduces the complexity. We compare the proposed methods with existing exact and approximate detection methods. Simulation results demonstrate that the proposed methods can achieve near-optimal performance of MMSE detection with relatively low computational complexity.展开更多
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 ...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.展开更多
A low complexity MP3 decoder based on Broadcom embedded platform was proposed. C code level optimization algorithms on inverse quantization, stereo decoding and alias reduction based on PC were proposed to further re...A low complexity MP3 decoder based on Broadcom embedded platform was proposed. C code level optimization algorithms on inverse quantization, stereo decoding and alias reduction based on PC were proposed to further reduce the amount of memory usage and the computational complex ity. Furthermore, the executable file of the optimized MP3 decoder was generated under the Linux environment, and transplanted to the set top box based on Broadcom embedded platform. Experi ment results showed that the total time for decoding was reduced on the embedded platform, and the goal of real time and fluent playing of audio files was fulfilled, which demonstrated the effectiveness of the proposed MP3 decoder. The proposed MP3 decoder could be applied in fields such xs the set top box based on Broadcom embedded platform and other portable devices.展开更多
With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and...With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory.展开更多
Real-time intelligent lithology identification while drilling is vital to realizing downhole closed-loop drilling. The complex and changeable geological environment in the drilling makes lithology identification face ...Real-time intelligent lithology identification while drilling is vital to realizing downhole closed-loop drilling. The complex and changeable geological environment in the drilling makes lithology identification face many challenges. This paper studies the problems of difficult feature information extraction,low precision of thin-layer identification and limited applicability of the model in intelligent lithologic identification. The author tries to improve the comprehensive performance of the lithology identification model from three aspects: data feature extraction, class balance, and model design. A new real-time intelligent lithology identification model of dynamic felling strategy weighted random forest algorithm(DFW-RF) is proposed. According to the feature selection results, gamma ray and 2 MHz phase resistivity are the logging while drilling(LWD) parameters that significantly influence lithology identification. The comprehensive performance of the DFW-RF lithology identification model has been verified in the application of 3 wells in different areas. By comparing the prediction results of five typical lithology identification algorithms, the DFW-RF model has a higher lithology identification accuracy rate and F1 score. This model improves the identification accuracy of thin-layer lithology and is effective and feasible in different geological environments. The DFW-RF model plays a truly efficient role in the realtime intelligent identification of lithologic information in closed-loop drilling and has greater applicability, which is worthy of being widely used in logging interpretation.展开更多
Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves...Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves selecting suitable meta-atoms to achieve target functionalities such as phase retardation,amplitude modulation,and polarization conversion.Conventional design processes often involve extensive parameter sweeping,a laborious and computationally intensive task heavily reliant on designer expertise and judgement.Here,we present an efficient genetic algorithm assisted meta-atom optimization method for high-performance metasurface optics,which is compatible to both single-and multiobjective device design tasks.We first employ the method for a single-objective design task and implement a high-efficiency Pancharatnam-Berry phase based metalens with an average focusing efficiency exceeding 80%in the visible spectrum.We then employ the method for a dual-objective metasurface design task and construct an efficient spin-multiplexed structural beam generator.The device is capable of generating zeroth-order and first-order Bessel beams respectively under right-handed and left-handed circular polarized illumination,with associated generation efficiencies surpassing 88%.Finally,we implement a wavelength and spin co-multiplexed four-channel metahologram capable of projecting two spin-multiplexed holographic images under each operational wavelength,with efficiencies over 50%.Our work offers a streamlined and easy-to-implement approach to meta-atom design and optimization,empowering designers to create diverse high-performance and multifunctional metasurface optics.展开更多
Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for t...Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources.展开更多
To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant co...To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant colony optimization(ACO)algorithm is proposed.The XGBoost algorithm was used to train and test three additives,T534(alkyl diphenylamine),T308(isooctyl acid thiophospholipid octadecylamine),and T306(trimethylphenol phosphate),separately,in order to screen for the optimal combination of spectral bands for each additive.The ACO algorithm was used to optimize the parameters of the XGBoost algorithm to improve the identification accuracy.During this process,the support vector machine(SVM)and hybrid bat algorithms(HBA)were included as a comparison,generating four models:ACO-XGBoost,ACO-SVM,HBA-XGboost,and HBA-SVM.The results showed that all four models could identify the three additives efficiently,with the ACO-XGBoost model achieving 100%recognition of all three additives.In addition,the generalizability of the ACO-XGBoost model was further demonstrated by predicting a lubricating oil containing the three additives prepared in our laboratory and a collected sample of commercial oil currently in use。展开更多
X-ray fluorescence(XRF)sensor-based ore sorting enables efficient beneficiation of heterogeneous ores,while intraparticle heterogeneity can cause significant grade detection errors,leading to misclassifications and hi...X-ray fluorescence(XRF)sensor-based ore sorting enables efficient beneficiation of heterogeneous ores,while intraparticle heterogeneity can cause significant grade detection errors,leading to misclassifications and hindering widespread technology adoption.Accurate classification models are crucial to determine if actual grade exceeds the sorting threshold using localized XRF signals.Previous studies mainly used linear regression(LR)algorithms including simple linear regression(SLR),multivariable linear regression(MLR),and multivariable linear regression with interaction(MLRI)but often fell short attaining satisfactory results.This study employed the particle swarm optimization support vector machine(PSO-SVM)algorithm for sorting porphyritic copper ore pebble.Lab-scale results showed PSO-SVM out-performed LR and raw data(RD)models and the significant interaction effects among input features was observed.Despite poor input data quality,PSO-SVM demonstrated exceptional capabilities.Lab-scale sorting achieved 93.0%accuracy,0.24%grade increase,84.94%recovery rate,57.02%discard rate,and a remarkable 39.62 yuan/t net smelter return(NSR)increase compared to no sorting.These improvements were achieved by the PSO-SVM model with optimized input combinations and highest data quality(T=10,T is XRF testing times).The unsuitability of LR methods for XRF sensor-based sorting of investigated sample is illustrated.Input element selection and mineral association analysis elucidate element importance and influence mechanisms.展开更多
A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filte...A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.展开更多
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
基金Supported by the EDD of China(No.80912020104)the Science and Technology Commission of Shanghai Municipality(No.22ZR1427700 and No.23692106900).
文摘The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.
文摘Reliable Cluster Head(CH)selectionbased routing protocols are necessary for increasing the packet transmission efficiency with optimal path discovery that never introduces degradation over the transmission reliability.In this paper,Hybrid Golden Jackal,and Improved Whale Optimization Algorithm(HGJIWOA)is proposed as an effective and optimal routing protocol that guarantees efficient routing of data packets in the established between the CHs and the movable sink.This HGJIWOA included the phases of Dynamic Lens-Imaging Learning Strategy and Novel Update Rules for determining the reliable route essential for data packets broadcasting attained through fitness measure estimation-based CH selection.The process of CH selection achieved using Golden Jackal Optimization Algorithm(GJOA)completely depends on the factors of maintainability,consistency,trust,delay,and energy.The adopted GJOA algorithm play a dominant role in determining the optimal path of routing depending on the parameter of reduced delay and minimal distance.It further utilized Improved Whale Optimisation Algorithm(IWOA)for forwarding the data from chosen CHs to the BS via optimized route depending on the parameters of energy and distance.It also included a reliable route maintenance process that aids in deciding the selected route through which data need to be transmitted or re-routed.The simulation outcomes of the proposed HGJIWOA mechanism with different sensor nodes confirmed an improved mean throughput of 18.21%,sustained residual energy of 19.64%with minimized end-to-end delay of 21.82%,better than the competitive CH selection approaches.
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62025110 and 62101308).
文摘Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.
基金supported by Fujian Provincial Social Science Foundation Public Security Theory Research Project(FJ2023TWGA004)Education and Scientific Research Special Project of Fujian Provincial Department of Finance(Research on the Application of Blockchain Technology in Prison Law Enforcement Management),under National Key R&D Program of China(2020YFB1005500)。
文摘With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state secret algorithm GuoMi algorithm.The original Hyperledger Fabric only supports internationally common encryption algorithms,so it is particularly necessary to enhance support for the national encryption standard.Traditional identity authentication,access control,and security audit technologies have single-point failures,and data can be easily tampered with,leading to trust issues.To address these problems,this paper proposes an optimized and application research plan for Hyperledger Fabric.We study the optimization model of cryptographic components in Hyperledger Fabric,and based on Fabric's pluggable mechanism,we enhance the Fabric architecture with the national encryption standard.In addition,we research key technologies involved in the secure application protocol based on the blockchain.We propose a blockchain-based identity authentication protocol,detailing the design of an identity authentication scheme based on blockchain certificates and Fabric CA,and use a dual-signature method to further improve its security and reliability.Then,we propose a flexible,dynamically configurable real-time access control and security audit mechanism based on blockchain,further enhancing the security of the system.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
基金supported by the National Natural Science Foundation of China(Nos.52164001,52064006,52004072 and 52364004)the Science and Technology Support Project of Guizhou(Nos.[2020]4Y044,[2021]N404 and[2021]N511)+1 种基金the Guizhou Provincial Science and Technology Foundation(No.GCC[2022]005-1),Talents of Guizhou University(No.201901)the Special Research Funds of Guizhou University(Nos.201903,202011,and 202012).
文摘With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper proposes an improved fluid flow algorithm,aiming to enhance the computational efficiency of hydraulic fracturing simulations while ensuring computational accuracy.The algorithm optimizes the aperture law and iteration criteria,focusing on improving the domain volume and crack pressure update strategy,thereby enabling precise capture of dynamic borehole pressure variations during injection tests.The effectiveness of the algorithm is verified through three flow-solid coupling cases.The study also analyzes the effects of borehole size,domain volume,and crack pressure update strategy on fracturing behavior.Furthermore,the performance of the improved algorithm in terms of crack propagation rate,micro-crack formation,and fluid pressure distribution was further evaluated.The results indicate that while large-size boreholes delay crack initiation,the cracks propagate more rapidly once formed.Additionally,the optimized domain volume calculation and crack pressure update strategy significantly shorten the pressure propagation stage,promote crack propagation,and improve computational efficiency.
基金funded by the State Grid Science and Technology Project“Research on Key Technologies for Prediction and Early Warning of Large-Scale Offshore Wind Power Ramp Events Based on Meteorological Data Enhancement”(4000-202318098A-1-1-ZN).
文摘The development of wind power clusters has scaled in terms of both scale and coverage,and the impact of weather fluctuations on cluster output changes has become increasingly complex.Accurately identifying the forward-looking information of key wind farms in a cluster under different weather conditions is an effective method to improve the accuracy of ultrashort-term cluster power forecasting.To this end,this paper proposes a refined modeling method for ultrashort-term wind power cluster forecasting based on a convergent cross-mapping algorithm.From the perspective of causality,key meteorological forecasting factors under different cluster power fluctuation processes were screened,and refined training modeling was performed for different fluctuation processes.First,a wind process description index system and classification model at the wind power cluster level are established to realize the classification of typical fluctuation processes.A meteorological-cluster power causal relationship evaluation model based on the convergent cross-mapping algorithm is pro-posed to screen meteorological forecasting factors under multiple types of typical fluctuation processes.Finally,a refined modeling meth-od for a variety of different typical fluctuation processes is proposed,and the strong causal meteorological forecasting factors of each scenario are used as inputs to realize high-precision modeling and forecasting of ultra-short-term wind cluster power.An example anal-ysis shows that the short-term wind power cluster power forecasting accuracy of the proposed method can reach 88.55%,which is 1.57-7.32%higher than that of traditional methods.
基金supported by the fundings from 2024 Young Talents Program for Science and Technology Thinking Tanks(No.XMSB20240711041)2024 Student Research Program on Dynamic Simulation and Force-on-Force Exercise of Nuclear Security in 3D Interactive Environment Using Reinforcement Learning,Natural Science Foundation of Top Talent of SZTU(No.GDRC202407)+2 种基金Shenzhen Science and Technology Program(No.KCXFZ20240903092603005)Shenzhen Science and Technology Program(No.JCYJ20241202124703004)Shenzhen Science and Technology Program(No.KJZD20230923114117032)。
文摘Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection systems.Adversarial path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical infrastructures.However,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability assessment.This paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability assessment.Within this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic pathfinding.The A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the goal.An admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic function.The 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and Dijkstra algorithms for optimal path identification.Comparative results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high efficiency.Finally,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications.
文摘A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access(OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm(CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm(MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.
基金supported by Chinas 863 Project NO.2015AA01A706the National S&T Major Project NO.2014ZX03001011+1 种基金the Science and Technology Program of Beijing NO.D151100000115003the Scientific and Technological Cooperation Projects NO.2015DFT10160B
文摘Massive MIMO is a promising technology to improve spectral efficiency, cell coverage, and system capacity for 5G. However, these benefits take place at great cost of computational complexity, especially in systems with hundreds of antennas at the base station. This paper aims to address the minimum mean square error(MMSE) detection in uplink massive MIMO systems utilizing the symmetric complex bi-conjugate gradients(SCBiCG) and the Lanczos method. Both the proposed methods can avoid the large scale matrix inversion which is necessary for MMSE, thus, reducing the computational complexity by an order of magnitude with respect to the number of user equipment. To enable the proposed methods for soft-output detection, we also derive an approximating calculation scheme for the log-likelihood ratios(LLRs), which further reduces the complexity. We compare the proposed methods with existing exact and approximate detection methods. Simulation results demonstrate that the proposed methods can achieve near-optimal performance of MMSE detection with relatively low computational complexity.
基金supported by the 2021 Open Project Fund of Science and Technology on Electromechanical Dynamic Control Laboratory,grant number 212-C-J-F-QT-2022-0020China Postdoctoral Science Foundation,grant number 2021M701713+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province,grant number KYCX23_0511the Jiangsu Funding Program for Excellent Postdoctoral Talent,grant number 20220ZB245。
文摘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.
基金Supported by the National Natural Science Foundation of China(60772066)
文摘A low complexity MP3 decoder based on Broadcom embedded platform was proposed. C code level optimization algorithms on inverse quantization, stereo decoding and alias reduction based on PC were proposed to further reduce the amount of memory usage and the computational complex ity. Furthermore, the executable file of the optimized MP3 decoder was generated under the Linux environment, and transplanted to the set top box based on Broadcom embedded platform. Experi ment results showed that the total time for decoding was reduced on the embedded platform, and the goal of real time and fluent playing of audio files was fulfilled, which demonstrated the effectiveness of the proposed MP3 decoder. The proposed MP3 decoder could be applied in fields such xs the set top box based on Broadcom embedded platform and other portable devices.
基金supported in part by the NSF of China (61471131, 61771149, 61501126)NSF of Guangdong Province 2016A030310337+1 种基金the open research fund of National Mobile Communications Research Laboratory, Southeast University (No. 2018D02)the Guangdong Province Universities and Colleges Pearl River Scholar Funded Scheme (2017-ZJ022)
文摘With the development of manufacture technology, the multi-level cell(MLC)technique dramatically increases the storage density of NAND flash memory. As the result,cell-to-cell interference(CCI) becomes more serious and hence causes an increase in the raw bit error rate of data stored in the cells.Recently, low-density parity-check(LDPC)codes have appeared to be a promising solution to combat the interference of MLC NAND flash memory. However, the decoding complexity of the sum-product algorithm(SPA) is extremely high. In this paper, to improve the accuracy of the log likelihood ratio(LLR) information of each bit in each NAND flash memory cell, we adopt a non-uniform detection(N-UD) which uses the average maximum mutual information to determine the value of the soft-decision reference voltages.Furthermore, with an aim to reduce the decoding complexity and improve the decoding performance, we propose a modified soft reliabilitybased iterative majority-logic decoding(MSRBI-MLGD) algorithm, which uses a non-uniform quantizer based on power function to decode LDPC codes. Simulation results show that our design can offer a desirable trade-off between the performance and complexity for high-column-weight LDPC-coded MLC NAND flash memory.
基金financially supported by the National Natural Science Foundation of China(No.52174001)the National Natural Science Foundation of China(No.52004064)+1 种基金the Hainan Province Science and Technology Special Fund “Research on Real-time Intelligent Sensing Technology for Closed-loop Drilling of Oil and Gas Reservoirs in Deepwater Drilling”(ZDYF2023GXJS012)Heilongjiang Provincial Government and Daqing Oilfield's first batch of the scientific and technological key project “Research on the Construction Technology of Gulong Shale Oil Big Data Analysis System”(DQYT-2022-JS-750)。
文摘Real-time intelligent lithology identification while drilling is vital to realizing downhole closed-loop drilling. The complex and changeable geological environment in the drilling makes lithology identification face many challenges. This paper studies the problems of difficult feature information extraction,low precision of thin-layer identification and limited applicability of the model in intelligent lithologic identification. The author tries to improve the comprehensive performance of the lithology identification model from three aspects: data feature extraction, class balance, and model design. A new real-time intelligent lithology identification model of dynamic felling strategy weighted random forest algorithm(DFW-RF) is proposed. According to the feature selection results, gamma ray and 2 MHz phase resistivity are the logging while drilling(LWD) parameters that significantly influence lithology identification. The comprehensive performance of the DFW-RF lithology identification model has been verified in the application of 3 wells in different areas. By comparing the prediction results of five typical lithology identification algorithms, the DFW-RF model has a higher lithology identification accuracy rate and F1 score. This model improves the identification accuracy of thin-layer lithology and is effective and feasible in different geological environments. The DFW-RF model plays a truly efficient role in the realtime intelligent identification of lithologic information in closed-loop drilling and has greater applicability, which is worthy of being widely used in logging interpretation.
基金support from the National Science Foundation of China(Grant Nos.62075078 and 62135004)the Knowledge Innovation Program of Wuhan-Shuguang Project(Grant No.2022010801020095).
文摘Metasurfaces,composed of planar arrays of intricately designed meta-atom structures,possess remarkable capabilities in controlling electromagnetic waves in various ways.A critical aspect of metasurface design involves selecting suitable meta-atoms to achieve target functionalities such as phase retardation,amplitude modulation,and polarization conversion.Conventional design processes often involve extensive parameter sweeping,a laborious and computationally intensive task heavily reliant on designer expertise and judgement.Here,we present an efficient genetic algorithm assisted meta-atom optimization method for high-performance metasurface optics,which is compatible to both single-and multiobjective device design tasks.We first employ the method for a single-objective design task and implement a high-efficiency Pancharatnam-Berry phase based metalens with an average focusing efficiency exceeding 80%in the visible spectrum.We then employ the method for a dual-objective metasurface design task and construct an efficient spin-multiplexed structural beam generator.The device is capable of generating zeroth-order and first-order Bessel beams respectively under right-handed and left-handed circular polarized illumination,with associated generation efficiencies surpassing 88%.Finally,we implement a wavelength and spin co-multiplexed four-channel metahologram capable of projecting two spin-multiplexed holographic images under each operational wavelength,with efficiencies over 50%.Our work offers a streamlined and easy-to-implement approach to meta-atom design and optimization,empowering designers to create diverse high-performance and multifunctional metasurface optics.
基金the National Natural Science Foundation of China(Grant No.62101579).
文摘Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources.
基金the Beijing Natural Science Foundation(Grant No.2232066)the Open Project Foundation of State Key Laboratory of Solid Lubrication(Grant LSL-2212).
文摘To address the problem of identifying multiple types of additives in lubricating oil,a method based on midinfrared spectral band selection using the eXtreme Gradient Boosting(XGBoost)algorithm combined with the ant colony optimization(ACO)algorithm is proposed.The XGBoost algorithm was used to train and test three additives,T534(alkyl diphenylamine),T308(isooctyl acid thiophospholipid octadecylamine),and T306(trimethylphenol phosphate),separately,in order to screen for the optimal combination of spectral bands for each additive.The ACO algorithm was used to optimize the parameters of the XGBoost algorithm to improve the identification accuracy.During this process,the support vector machine(SVM)and hybrid bat algorithms(HBA)were included as a comparison,generating four models:ACO-XGBoost,ACO-SVM,HBA-XGboost,and HBA-SVM.The results showed that all four models could identify the three additives efficiently,with the ACO-XGBoost model achieving 100%recognition of all three additives.In addition,the generalizability of the ACO-XGBoost model was further demonstrated by predicting a lubricating oil containing the three additives prepared in our laboratory and a collected sample of commercial oil currently in use。
基金supported by State Key Laboratory of Mineral Processing (No.BGRIMM-KJSKL-2022-16)China Postdoctoral Science Foundation (No.2021M700387)+1 种基金National Natural Science Foundation of China (No.G2021105015L)Ministry of Science and Technology of the People’s Republic of China (No.2022YFC2904502)。
文摘X-ray fluorescence(XRF)sensor-based ore sorting enables efficient beneficiation of heterogeneous ores,while intraparticle heterogeneity can cause significant grade detection errors,leading to misclassifications and hindering widespread technology adoption.Accurate classification models are crucial to determine if actual grade exceeds the sorting threshold using localized XRF signals.Previous studies mainly used linear regression(LR)algorithms including simple linear regression(SLR),multivariable linear regression(MLR),and multivariable linear regression with interaction(MLRI)but often fell short attaining satisfactory results.This study employed the particle swarm optimization support vector machine(PSO-SVM)algorithm for sorting porphyritic copper ore pebble.Lab-scale results showed PSO-SVM out-performed LR and raw data(RD)models and the significant interaction effects among input features was observed.Despite poor input data quality,PSO-SVM demonstrated exceptional capabilities.Lab-scale sorting achieved 93.0%accuracy,0.24%grade increase,84.94%recovery rate,57.02%discard rate,and a remarkable 39.62 yuan/t net smelter return(NSR)increase compared to no sorting.These improvements were achieved by the PSO-SVM model with optimized input combinations and highest data quality(T=10,T is XRF testing times).The unsuitability of LR methods for XRF sensor-based sorting of investigated sample is illustrated.Input element selection and mineral association analysis elucidate element importance and influence mechanisms.
基金supported by National Natural Science Foundation of China (Nos.62265010,62061024)Gansu Province Science and Technology Plan (No.23YFGA0062)Gansu Province Innovation Fund (No.2022A-215)。
文摘A wireless sensor network mobile target tracking algorithm(ISO-EKF)based on improved snake optimization algorithm(ISO)is proposed to address the difficulty of estimating initial values when using extended Kalman filtering to solve the state of nonlinear mobile target tracking.First,the steps of extended Kalman filtering(EKF)are introduced.Second,the ISO is used to adjust the parameters of the EKF in real time to adapt to the current motion state of the mobile target.Finally,the effectiveness of the algorithm is demonstrated through filtering and tracking using the constant velocity circular motion model(CM).Under the specified conditions,the position and velocity mean square error curves are compared among the snake optimizer(SO)-EKF algorithm,EKF algorithm,and the proposed algorithm.The comparison shows that the proposed algorithm reduces the root mean square error of position by 52%and 41%compared to the SOEKF algorithm and EKF algorithm,respectively.
