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.展开更多
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.展开更多
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.展开更多
This paper presents the cooperative strategies for salvo attack of multiple missiles based on the classical proportional navigation（PN） algorithm.The three-dimensional（3-D） guidance laws are developed in a quite s...This paper presents the cooperative strategies for salvo attack of multiple missiles based on the classical proportional navigation（PN） algorithm.The three-dimensional（3-D） guidance laws are developed in a quite simple formulation that consists of a PN component for target capture and a coordination component for simultaneous arrival.The centralized algorithms come into effect when the global information of time-to-go estimation is obtained, whereas the decentralized algorithms have better performance when each missile can only collect information from neighbors.Numerical simulations demonstrate that the proposed coordination algorithms are feasible to perform the cooperative engagement of multiple missiles against both stationary and maneuvering targets.The effectiveness of the 3-D guidance laws is also discussed.展开更多
Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be g...Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.展开更多
The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against ...The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against the stationary target. The framework of a distributed RHC scheme is developed, in which each interceptor missile is assigned its own finite-horizon optimal control problem (FHOCP) and only shares the information with its neighbors. The solution of the local FHOCP is obtained by the constrained particle swarm optimization (PSO) method that is integrated into the distributed RHC framework with enhanced equality and inequality constraints. The numerical simulations show that the proposed guidance approach is feasible to implement the cooperative engagement with satisfied accuracy of target capture. Finally, the computation efficiency of the distributed RHC scheme is discussed in consideration of the PSO parameters, control update period and prediction horizon. (C) 2016 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license.展开更多
A new algorithm for solving the three-dimensional elastic contact problem with friction is presented. The algorithm is a non-interior smoothing algorithm based on an NCP-function. The parametric variational principle ...A new algorithm for solving the three-dimensional elastic contact problem with friction is presented. The algorithm is a non-interior smoothing algorithm based on an NCP-function. The parametric variational principle and parametric quadratic programming method were applied to the analysis of three-dimensional frictional contact problem. The solution of the contact problem was finally reduced to a linear complementarity problem, which was reformulated as a system of nonsmooth equations via an NCP-function. A smoothing approximation to the nonsmooth equations was given by the aggregate function. A Newton method was used to solve the resulting smoothing nonlinear equations. The algorithm presented is easy to understand and implement. The reliability and efficiency of this algorithm are demonstrated both by the numerical experiments of LCP in mathematical way and the examples of contact problems in mechanics.展开更多
Dithering optimization techniques can be divided into the phase-optimized technique and the intensity-optimized technique. The problem with the former is the poor sensitivity to various defocusing amounts, and the pro...Dithering optimization techniques can be divided into the phase-optimized technique and the intensity-optimized technique. The problem with the former is the poor sensitivity to various defocusing amounts, and the problem with the latter is that it cannot enhance phase quality directly nor efficiently. In this paper, we present a multi-objective optimization framework for three-dimensional(3D) measurement by utilizing binary defocusing technique. Moreover, a binary patch optimization technique is used to solve the time-consuming issue of genetic algorithm. It is demonstrated that the presented technique consistently obtains significant phase performance improvement under various defocusing amounts.展开更多
In this study,a Dual Smoothing Ionospheric Gradient Monitor Algorithm(DSIGMA)was developed for Code-Carrier Divergence(CCD)faults of dual-frequency Ground-Based Augmentation Systems(GBAS)based on the Bei Dou Navigatio...In this study,a Dual Smoothing Ionospheric Gradient Monitor Algorithm(DSIGMA)was developed for Code-Carrier Divergence(CCD)faults of dual-frequency Ground-Based Augmentation Systems(GBAS)based on the Bei Dou Navigation Satellite System(BDS).Divergence-Free(DF)combinations of the signals were used to form test statistics for a dualfrequency DSIGMA.First,the single-frequency DSIGMA was reviewed,which supports the GBAS approach service type D(GAST-D)for protection against the effect of large ionospheric gradients.The single-frequency DSIGMA was used to create a novel input scheme for the dual-frequency DSIGMA by introducing DF combinations.The steady states of the test statistics were also analysed.The monitors were characterized using BDS measurement data,whereby standard deviations of 0.0432 and 0.0639 m for the proposed two test statistics were used to calculate the monitor threshold.An extensive simulation was designed to assess the monitor performance by comparing the Probability of Missed Detection(PMD)according to the differential error with the range domain PMD limits under different fault modes.The results showed that the proposed algorithm has a higher integrity performance than the single-frequency monitor.The minimum detectable divergence with the same missed probability is less than 50%that of GAST-D.展开更多
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algor...By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions.展开更多
In order to improve the battle effectiveness of the unmanned aerial vehicle （UAV） under the increasingly complex threat environment, a three-dimension path planning method based on an A ＊ al- gorithm is proposed an...In order to improve the battle effectiveness of the unmanned aerial vehicle （UAV） under the increasingly complex threat environment, a three-dimension path planning method based on an A ＊ al- gorithm is proposed and simulated in this paper which makes the UAV satisfy requirements of different missions. At first, the digital map information is processed vdth an integrated terrain smoothing algorithm, and a safe flight surface which integrates the vehicle dynamic is built and added on the terrain, and then, models of the complicated threats are established and integrated into the digital terrain. At last, an improved A ＊ algorithm is used to plan the three-dimension path on the safe sur- face, and then smooth the path. Simulation results indicate that the approach has a good perform- ance in creating an optimal path in the three-dimension environment and the path planning algorithm is more simple, efficient and easily realized in the engineering field.展开更多
Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficien...Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.展开更多
An improved three-dimensional incompressible smooth particle hydrodynamics(ISPH)model is developed to simulate the impact of regular wave on a horizontal plate.The improvement is the employment of a corrective functio...An improved three-dimensional incompressible smooth particle hydrodynamics(ISPH)model is developed to simulate the impact of regular wave on a horizontal plate.The improvement is the employment of a corrective function to enhance angular momentum conservation in a particle-based calculation.And a new estimation method is proposed to predict the pressure on the horizontal plate.Then,the model simulates the variation characteristics of impact pressures generated by regular wave slamming.The main features of velocity field and pressure field near the plate are presented.The present numerical model can be used to study wave impact load on the horizontal plate.展开更多
A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is onl...A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is only determined by the DNL error of analog-to-digital converter device itself. From the experimental results, this algorithm slightly improves both noise performance and energy resolution, while greatly reduces the testing errors by almost a half compared to their original values. In addition, the reduced-x^2 statistic for evaluating the Gaussian fitting goodness is significantly reduced by almost two orders after smoothing. As a typical verification example,this algorithm is successfully applied in the ground calibration of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope(HXMT-LE) satellite,lending it a powerful, nondestructive and low-cost tool for both calibration and data processing for high-energy particle detector systems.展开更多
The fluctuation of active power output of wind farm has many negative impacts on large-scale wind power integration into power grid. In this paper, flywheel energy storage system (FESS) was connected to AC side of the...The fluctuation of active power output of wind farm has many negative impacts on large-scale wind power integration into power grid. In this paper, flywheel energy storage system (FESS) was connected to AC side of the doubly-fed induction generator (DFIG) wind farm to realize smooth control of wind power output. Based on improved wind power prediction algorithm and wind speed-power curve modeling, a new smooth control strategy with the FESS was proposed. The requirement of power system dispatch for wind power prediction and flywheel rotor speed limit were taken into consideration during the process. While smoothing the wind power fluctuation, FESS can track short-term planned output of wind farm. It was demonstrated by quantitative analysis of simulation results that the proposed control strategy can smooth the active power fluctuation of wind farm effectively and thereby improve power quality of the power grid.展开更多
In this paper we consider the transmission of stored video from a server to a client for medical applications such as, Telemonitoring, to optimize medical quality of service (m-QoS) and to examine how the client buffe...In this paper we consider the transmission of stored video from a server to a client for medical applications such as, Telemonitoring, to optimize medical quality of service (m-QoS) and to examine how the client buffer space can be used efficiently and effectively towards reducing the rate variability of the compressed variable bit rate (VBR) video. Three basic results are presented. First, we show how to obtain the greatest possible reduction in rate variability when sending stored video to client with a given buffer size. Second, how to reduce high peak data rate of compressed VBR video when a patient is moving/walking very fast in hospital. Third, we evaluate the impact of optimal smoothing algorithm on the network parameters such as, peak-to-mean ratio, standard deviation, delay, jitter, average delay and average jitter to optimize the m-QoS. To resolve these all problems we used optimal smoothing algorithm and show its performance over a set of long MPEG-4 encoded video traces. Simulation results show that m-QoS is optimized by minimizing network metrics.展开更多
Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decompos...Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decomposition. The three-dimension nonnegative matrix factorization （NMF3） algorithm, which was concise and easy to implement, was given in this paper. The NMF3 algorithm implementation was based on elements but not on vectors. It could decompose a data array directly without unfolding, which was not similar to that the traditional algorithms do, It has been applied to the simulated data array decomposition and obtained reasonable results. It showed that NMF3 could be introduced for curve resolution in chemometrics.展开更多
Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression num...Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression numerical algorithm in the best m -term approximation with regard to tensor product wavelet-type basis is pro-posed. The algorithm provides the asymptotically optimal approximation for the class of periodic functions with mixed Besov smoothness in the L q norm. Moreover, it depends only on the expansion of function f by tensor pro-duct wavelet-type basis, but neither on q nor on any special features of f.展开更多
The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing...The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent.展开更多
This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By u...This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By using space sparse sampling, great memorial capacity can be saved and reproduced scenes can be controlled. To solve time consuming and complex computations in three-dimensional interpolation algorithm, we have studied a fast and practical algorithm of scattered space lattice and that of 'Warp' algorithm with proper depth. By several simple aspects of three dimensional space interpolation, we succeed in developing some simple and practical algorithms. Some results of simulated experiments with computers have shown that the new method is absolutely feasible.展开更多
基金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.
基金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.
基金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 (Nos.61273349, 61203223)
文摘This paper presents the cooperative strategies for salvo attack of multiple missiles based on the classical proportional navigation（PN） algorithm.The three-dimensional（3-D） guidance laws are developed in a quite simple formulation that consists of a PN component for target capture and a coordination component for simultaneous arrival.The centralized algorithms come into effect when the global information of time-to-go estimation is obtained, whereas the decentralized algorithms have better performance when each missile can only collect information from neighbors.Numerical simulations demonstrate that the proposed coordination algorithms are feasible to perform the cooperative engagement of multiple missiles against both stationary and maneuvering targets.The effectiveness of the 3-D guidance laws is also discussed.
基金State Natural Science Foundation (49874021).Contribution No. 01FE2002, Institute of Geophysics, China Seismological Bureau.
文摘Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.
基金co-supported by the National Natural Science Foundation of China(Nos. 61273349 and 61573043)
文摘The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against the stationary target. The framework of a distributed RHC scheme is developed, in which each interceptor missile is assigned its own finite-horizon optimal control problem (FHOCP) and only shares the information with its neighbors. The solution of the local FHOCP is obtained by the constrained particle swarm optimization (PSO) method that is integrated into the distributed RHC framework with enhanced equality and inequality constraints. The numerical simulations show that the proposed guidance approach is feasible to implement the cooperative engagement with satisfied accuracy of target capture. Finally, the computation efficiency of the distributed RHC scheme is discussed in consideration of the PSO parameters, control update period and prediction horizon. (C) 2016 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license.
文摘A new algorithm for solving the three-dimensional elastic contact problem with friction is presented. The algorithm is a non-interior smoothing algorithm based on an NCP-function. The parametric variational principle and parametric quadratic programming method were applied to the analysis of three-dimensional frictional contact problem. The solution of the contact problem was finally reduced to a linear complementarity problem, which was reformulated as a system of nonsmooth equations via an NCP-function. A smoothing approximation to the nonsmooth equations was given by the aggregate function. A Newton method was used to solve the resulting smoothing nonlinear equations. The algorithm presented is easy to understand and implement. The reliability and efficiency of this algorithm are demonstrated both by the numerical experiments of LCP in mathematical way and the examples of contact problems in mechanics.
基金Project supported by the Zhejiang Provincial Welfare Technology Applied Research Project,China(Grant No.2017C31080)
文摘Dithering optimization techniques can be divided into the phase-optimized technique and the intensity-optimized technique. The problem with the former is the poor sensitivity to various defocusing amounts, and the problem with the latter is that it cannot enhance phase quality directly nor efficiently. In this paper, we present a multi-objective optimization framework for three-dimensional(3D) measurement by utilizing binary defocusing technique. Moreover, a binary patch optimization technique is used to solve the time-consuming issue of genetic algorithm. It is demonstrated that the presented technique consistently obtains significant phase performance improvement under various defocusing amounts.
基金financial support from the National Natural Science Foundation of China(Nos.61871012,U1833125)a project from the Ministry of Industry and Information Technology(Airborne RAIM/ARAIM Technology)+2 种基金Open Fund Project of Intelligent Operation Key Laboratory of Civil Aviation Airport Group(No.KLAGIO20180405)the Young Top Talent Support Program of Beihang Universitythe Beijing Nova Program of Science and Technology(No.Z191100001119134)。
文摘In this study,a Dual Smoothing Ionospheric Gradient Monitor Algorithm(DSIGMA)was developed for Code-Carrier Divergence(CCD)faults of dual-frequency Ground-Based Augmentation Systems(GBAS)based on the Bei Dou Navigation Satellite System(BDS).Divergence-Free(DF)combinations of the signals were used to form test statistics for a dualfrequency DSIGMA.First,the single-frequency DSIGMA was reviewed,which supports the GBAS approach service type D(GAST-D)for protection against the effect of large ionospheric gradients.The single-frequency DSIGMA was used to create a novel input scheme for the dual-frequency DSIGMA by introducing DF combinations.The steady states of the test statistics were also analysed.The monitors were characterized using BDS measurement data,whereby standard deviations of 0.0432 and 0.0639 m for the proposed two test statistics were used to calculate the monitor threshold.An extensive simulation was designed to assess the monitor performance by comparing the Probability of Missed Detection(PMD)according to the differential error with the range domain PMD limits under different fault modes.The results showed that the proposed algorithm has a higher integrity performance than the single-frequency monitor.The minimum detectable divergence with the same missed probability is less than 50%that of GAST-D.
基金Supported by Liu Hui Centre for Applied Mathematics,Nankai University and Tianjin University
文摘By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones(SCLP).The algorithm is globally convergent under suitable assumptions.
文摘In order to improve the battle effectiveness of the unmanned aerial vehicle （UAV） under the increasingly complex threat environment, a three-dimension path planning method based on an A ＊ al- gorithm is proposed and simulated in this paper which makes the UAV satisfy requirements of different missions. At first, the digital map information is processed vdth an integrated terrain smoothing algorithm, and a safe flight surface which integrates the vehicle dynamic is built and added on the terrain, and then, models of the complicated threats are established and integrated into the digital terrain. At last, an improved A ＊ algorithm is used to plan the three-dimension path on the safe sur- face, and then smooth the path. Simulation results indicate that the approach has a good perform- ance in creating an optimal path in the three-dimension environment and the path planning algorithm is more simple, efficient and easily realized in the engineering field.
文摘Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.
基金Supported by the National Science Foundation of China(51109022)the National Science Foundation of Liaoning Province(201202020)the Key Laboratory Foundation of Dalian University of Technoloty(LP12005)
文摘An improved three-dimensional incompressible smooth particle hydrodynamics(ISPH)model is developed to simulate the impact of regular wave on a horizontal plate.The improvement is the employment of a corrective function to enhance angular momentum conservation in a particle-based calculation.And a new estimation method is proposed to predict the pressure on the horizontal plate.Then,the model simulates the variation characteristics of impact pressures generated by regular wave slamming.The main features of velocity field and pressure field near the plate are presented.The present numerical model can be used to study wave impact load on the horizontal plate.
基金supported by the HXMT Projectthe National Natural Science Foundation of China(No.11603027)
文摘A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is only determined by the DNL error of analog-to-digital converter device itself. From the experimental results, this algorithm slightly improves both noise performance and energy resolution, while greatly reduces the testing errors by almost a half compared to their original values. In addition, the reduced-x^2 statistic for evaluating the Gaussian fitting goodness is significantly reduced by almost two orders after smoothing. As a typical verification example,this algorithm is successfully applied in the ground calibration of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope(HXMT-LE) satellite,lending it a powerful, nondestructive and low-cost tool for both calibration and data processing for high-energy particle detector systems.
文摘The fluctuation of active power output of wind farm has many negative impacts on large-scale wind power integration into power grid. In this paper, flywheel energy storage system (FESS) was connected to AC side of the doubly-fed induction generator (DFIG) wind farm to realize smooth control of wind power output. Based on improved wind power prediction algorithm and wind speed-power curve modeling, a new smooth control strategy with the FESS was proposed. The requirement of power system dispatch for wind power prediction and flywheel rotor speed limit were taken into consideration during the process. While smoothing the wind power fluctuation, FESS can track short-term planned output of wind farm. It was demonstrated by quantitative analysis of simulation results that the proposed control strategy can smooth the active power fluctuation of wind farm effectively and thereby improve power quality of the power grid.
文摘In this paper we consider the transmission of stored video from a server to a client for medical applications such as, Telemonitoring, to optimize medical quality of service (m-QoS) and to examine how the client buffer space can be used efficiently and effectively towards reducing the rate variability of the compressed variable bit rate (VBR) video. Three basic results are presented. First, we show how to obtain the greatest possible reduction in rate variability when sending stored video to client with a given buffer size. Second, how to reduce high peak data rate of compressed VBR video when a patient is moving/walking very fast in hospital. Third, we evaluate the impact of optimal smoothing algorithm on the network parameters such as, peak-to-mean ratio, standard deviation, delay, jitter, average delay and average jitter to optimize the m-QoS. To resolve these all problems we used optimal smoothing algorithm and show its performance over a set of long MPEG-4 encoded video traces. Simulation results show that m-QoS is optimized by minimizing network metrics.
文摘Non-negative matrix factorization （NMF） is a technique for dimensionality reduction by placing non-negativity constraints on the matrix. Based on the PARAFAC model, NMF was extended for three-dimension data decomposition. The three-dimension nonnegative matrix factorization （NMF3） algorithm, which was concise and easy to implement, was given in this paper. The NMF3 algorithm implementation was based on elements but not on vectors. It could decompose a data array directly without unfolding, which was not similar to that the traditional algorithms do, It has been applied to the simulated data array decomposition and obtained reasonable results. It showed that NMF3 could be introduced for curve resolution in chemometrics.
基金Supported by National Natural Science Foundation of China (No. 60872161, 10501026, 60675010 and 10626029)Natural Science Foundation of Tianjin (No. 08JCYBJC09600)China Postdoctoral Science Foundation ( No. 20070420708).
文摘Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression numerical algorithm in the best m -term approximation with regard to tensor product wavelet-type basis is pro-posed. The algorithm provides the asymptotically optimal approximation for the class of periodic functions with mixed Besov smoothness in the L q norm. Moreover, it depends only on the expansion of function f by tensor pro-duct wavelet-type basis, but neither on q nor on any special features of f.
基金Supported by LIU Hui Centre for Applied Mathematics of Nankai University and Tianjin University
文摘The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent.
文摘This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By using space sparse sampling, great memorial capacity can be saved and reproduced scenes can be controlled. To solve time consuming and complex computations in three-dimensional interpolation algorithm, we have studied a fast and practical algorithm of scattered space lattice and that of 'Warp' algorithm with proper depth. By several simple aspects of three dimensional space interpolation, we succeed in developing some simple and practical algorithms. Some results of simulated experiments with computers have shown that the new method is absolutely feasible.
