In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
Characterizing the complex two-phase hydrodynamics in structured packed columns requires a power- ful modeling tool. The traditional two-dimensional model exhibits limitations when one attempts to model the de- tailed...Characterizing the complex two-phase hydrodynamics in structured packed columns requires a power- ful modeling tool. The traditional two-dimensional model exhibits limitations when one attempts to model the de- tailed two-phase flow inside the columns. The present paper presents a three-dimensional computational fluid dy- namics （CFD） model to simulate the two-phase flow in a representative unit of the column. The unit consists of an CFD calculations on column packed with Flexipak 1Y were implemented within the volume of fluid （VOF） mathe- matical framework. The CFD model was validated by comparing the calculated thickness of liquid film with the available experimental data. Special attention was given to quantitative analysis of the effects of gravity on the hy- drodynamics. Fluctuations in the liquid mass flow rate and the calculated pressure drop loss were found to be quali- tatively in agreement with the experimental observations.展开更多
To address the issue of premature convergence and slow convergence rate in three-dimensional (3D) route planning of unmanned aerial vehicle (UAV) low-altitude penetration,a novel route planning method was proposed.Fir...To address the issue of premature convergence and slow convergence rate in three-dimensional (3D) route planning of unmanned aerial vehicle (UAV) low-altitude penetration,a novel route planning method was proposed.First and foremost,a coevolutionary multi-agent genetic algorithm (CE-MAGA) was formed by introducing coevolutionary mechanism to multi-agent genetic algorithm (MAGA),an efficient global optimization algorithm.A dynamic route representation form was also adopted to improve the flight route accuracy.Moreover,an efficient constraint handling method was used to simplify the treatment of multi-constraint and reduce the time-cost of planning computation.Simulation and corresponding analysis show that the planning results of CE-MAGA have better performance on terrain following,terrain avoidance,threat avoidance (TF/TA2) and lower route costs than other existing algorithms.In addition,feasible flight routes can be acquired within 2 s,and the convergence rate of the whole evolutionary process is very fast.展开更多
Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating t...Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.展开更多
Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shami...Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.展开更多
Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-F...Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.展开更多
Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used....Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.展开更多
In order to solve the problem that the global navigation satellite system（GNSS） receivers can hardly detect the GNSS spoofing when they are deceived by a spoofer,a model-based approach for the identification of the ...In order to solve the problem that the global navigation satellite system（GNSS） receivers can hardly detect the GNSS spoofing when they are deceived by a spoofer,a model-based approach for the identification of the GNSS spoofing is proposed.First,a Hammerstein model is applied to model the spoofer/GNSS transmitter and the wireless channel.Then,a novel method based on the uncultivated wolf pack algorithm（UWPA） is proposed to estimate the model parameters.Taking the estimated model parameters as a feature vector,the identification of the spoofing is realized by comparing the Euclidean distance between the feature vectors.Simulations verify the effectiveness and the robustness of the proposed method.The results show that,compared with the other identification algorithms,such as least square（LS）,the iterative method and the bat-inspired algorithm（BA）,although the UWPA has a little more time-eomplexity than the LS and the BA algorithm,it has better estimation precision of the model parameters and higher identification rate of the GNSS spoofing,even for relative low signal-to-noise ratios.展开更多
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金Supported by the Major State Basic Research Development Program of China(2011CB706501)the National Natural Science Foundation of China(51276157)
文摘Characterizing the complex two-phase hydrodynamics in structured packed columns requires a power- ful modeling tool. The traditional two-dimensional model exhibits limitations when one attempts to model the de- tailed two-phase flow inside the columns. The present paper presents a three-dimensional computational fluid dy- namics （CFD） model to simulate the two-phase flow in a representative unit of the column. The unit consists of an CFD calculations on column packed with Flexipak 1Y were implemented within the volume of fluid （VOF） mathe- matical framework. The CFD model was validated by comparing the calculated thickness of liquid film with the available experimental data. Special attention was given to quantitative analysis of the effects of gravity on the hy- drodynamics. Fluctuations in the liquid mass flow rate and the calculated pressure drop loss were found to be quali- tatively in agreement with the experimental observations.
基金Project(60925011) supported by the National Natural Science Foundation for Distinguished Young Scholars of ChinaProject(9140A06040510BQXXXX) supported by Advanced Research Foundation of General Armament Department,China
文摘To address the issue of premature convergence and slow convergence rate in three-dimensional (3D) route planning of unmanned aerial vehicle (UAV) low-altitude penetration,a novel route planning method was proposed.First and foremost,a coevolutionary multi-agent genetic algorithm (CE-MAGA) was formed by introducing coevolutionary mechanism to multi-agent genetic algorithm (MAGA),an efficient global optimization algorithm.A dynamic route representation form was also adopted to improve the flight route accuracy.Moreover,an efficient constraint handling method was used to simplify the treatment of multi-constraint and reduce the time-cost of planning computation.Simulation and corresponding analysis show that the planning results of CE-MAGA have better performance on terrain following,terrain avoidance,threat avoidance (TF/TA2) and lower route costs than other existing algorithms.In addition,feasible flight routes can be acquired within 2 s,and the convergence rate of the whole evolutionary process is very fast.
文摘Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.
基金the National Natural Science Foundation of China(Grant No.61972103)the Natural Science Foundation of Guangdong Province of China(Grant No.2023A1515011207)+3 种基金the Special Project in Key Area of General University in Guangdong Province of China(Grant No.2020ZDZX3064)the Characteristic Innovation Project of General University in Guangdong Province of China(Grant No.2022KTSCX051)the Postgraduate Education Innovation Project of Guangdong Ocean University of China(Grant No.202263)the Foundation of Guangdong Provincial Engineering and Technology Research Center of Far Sea Fisheries Management and Fishing of South China Sea.
文摘Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.
基金Supported by the National Natural Science Foundation of China(No.61106033)
文摘Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.
文摘Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.
基金The National Natural Science Foundation of China(No.61271214,61471152)the Postdoctoral Science Foundation of Jiangsu Province(No.1402023C)the Natural Science Foundation of Zhejiang Province(No.LZ14F010003)
文摘In order to solve the problem that the global navigation satellite system（GNSS） receivers can hardly detect the GNSS spoofing when they are deceived by a spoofer,a model-based approach for the identification of the GNSS spoofing is proposed.First,a Hammerstein model is applied to model the spoofer/GNSS transmitter and the wireless channel.Then,a novel method based on the uncultivated wolf pack algorithm（UWPA） is proposed to estimate the model parameters.Taking the estimated model parameters as a feature vector,the identification of the spoofing is realized by comparing the Euclidean distance between the feature vectors.Simulations verify the effectiveness and the robustness of the proposed method.The results show that,compared with the other identification algorithms,such as least square（LS）,the iterative method and the bat-inspired algorithm（BA）,although the UWPA has a little more time-eomplexity than the LS and the BA algorithm,it has better estimation precision of the model parameters and higher identification rate of the GNSS spoofing,even for relative low signal-to-noise ratios.
