As an essential tool for realistic description of the current or future debris environment,the Space Debris Environment Engineering Model(SDEEM)has been developed to provide support for risk assessment of spacecraft.I...As an essential tool for realistic description of the current or future debris environment,the Space Debris Environment Engineering Model(SDEEM)has been developed to provide support for risk assessment of spacecraft.In contrast with SDEEM2015,SDEEM2019,the latest version,extends the orbital range from the Low Earth Orbit(LEO)to Geosynchronous Orbit(GEO)for the years 1958-2050.In this paper,improved modeling algorithms used by SDEEM2019 in propagating simulation,spatial density distribution,and spacecraft flux evaluation are presented.The debris fluxes of SDEEM2019 are compared with those of three typical models,i.e.,SDEEM2015,Orbital Debris Engineering Model 3.1(ORDEM 3.1),and Meteoroid and Space Debris Terrestrial Environment Reference(MASTER-8),in terms of two assessment modes.Three orbital cases,including the Geostationary Transfer Orbit(GTO),Sun-Synchronous Orbit(SSO)and International Space Station(ISS)orbit,are selected for the spacecraft assessment mode,and the LEO region is selected for the spatial density assessment mode.The analysis indicates that compared with previous algorithms,the variable step-size orbital propagating algorithm based on semi-major axis control is more precise,the spatial density algorithm based on the second zonal harmonic of the non-spherical Earth gravity(J_(2))is more applicable,and the result of the position-centered spacecraft flux algorithm is more convergent.The comparison shows that SDEEM2019 and MASTER-8 have consistent trends due to similar modeling processes,while the differences between SDEEM2019 and ORDEM 3.1 are mainly caused by different modeling approaches for uncatalogued debris.展开更多
In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model ...In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model which performs control.As a frst step,the main geometric and mathematical tools used in subspace identifcation are briefly presented.In the second step,the problem of analyzing ill-conditioning matrices in the subspace identifcation method is considered.To illustrate this situation,a simulation study of an example is introduced to show the ill-conditioning in subspace identifcation.Algorithms numerical subspace state space system identifcation(N4SID)and multivariable output error state space model identifcation(MOESP)are considered to study,the parameters estimation while using the induction motor model,in simulation(Matlab environment).Finally,we show the inadequacy of the oblique projection and validate the efectiveness of the orthogonal projection approach which is needed in ill-conditioning;a real application dealing with induction motor parameters estimation has been experimented.The obtained results proved that the algorithm based on orthogonal projection MOESP,overcomes the situation of ill-conditioning in the Hankel s block,and thereby improving the estimation of parameters.展开更多
Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task ow...Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task owing to the curse of dimensionality. This paper presents a new algorithm to reduce the size of a design space to a smaller region of interest allowing a more accurate surrogate model to be generated. The framework requires a set of models of different physical or numerical fidelities. The low-fidelity （LF） model provides physics-based approximation of the high-fidelity （HF） model at a fraction of the computational cost. It is also instrumental in identifying the small region of interest in the design space that encloses the high-fidelity optimum. A surrogate model is then constructed to match the low-fidelity model to the high-fidelity model in the identified region of interest. The optimization process is managed by an update strategy to prevent convergence to false optima. The algorithm is applied on mathematical problems and a two-dimen-sional aerodynamic shape optimization problem in a variable-fidelity context. Results obtained are in excellent agreement with high-fidelity results, even with lower-fidelity flow solvers, while showing up to 39% time savings.展开更多
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.展开更多
A novel gravity assist space pruning(GASP)algorithm based on image tools is proposed for solving interplanetary trajectory optimization problem.Compared with traditional GASP algorithm,the concept of image is introduc...A novel gravity assist space pruning(GASP)algorithm based on image tools is proposed for solving interplanetary trajectory optimization problem.Compared with traditional GASP algorithm,the concept of image is introduced to avoid missing interesting solutions with appropriate number of function evaluations.Image tools allow us to evaluate the objective function in regions in place of points and provide an effective way to evaluate the forward and backward constraints for the multi-gravity assist trajectory optimization problem.Since the interesting solutions of the interplanetary trajectory optimization problem are often clustered in a small portion of the search space rather than being overall evenly distributed,the regionwise evaluations with image tools make the little large interval with the proper Lipschitzian tolerances sampling effective.The detailed steps of the proposed method are presented and two examples including Earth Venus Mars(EVM)transfer and Earth Venus Venus Earth Jupiter Saturn(EVVEJS)transfer are given.Finally,a comparison with solutions given by the literature demonstrates the effectiveness of the proposed method.展开更多
Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the com...Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the computer routine is explained in details. Finally the potential projection map of Mg44Rh7 along [001] direction is shown as an illustration. All operations are carried out in real space, so we call the calculation method as the real space method.展开更多
An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained ...An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.展开更多
In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array ...In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.展开更多
The previously developed single-sweep parabolized Navier-Stokes （SSPNS） space marching code for ideal gas flows has been extended to compute chemically nonequilibrium flows. In the code, the strongly coupled set of ...The previously developed single-sweep parabolized Navier-Stokes （SSPNS） space marching code for ideal gas flows has been extended to compute chemically nonequilibrium flows. In the code, the strongly coupled set of gas dynamics, species conservation, and turbulence equations is integrated with the implicit lower-upper symmetric GaussSeidel （LU-SGS） method in the streamwise direction in a space marching manner. The AUSMPW＋ scheme is used to calculate the inviscid fluxes in the crossflow direction, while the conventional central scheme for the viscous fluxes. The k-g two-equation turbulence model is used. The revised SSPNS code is validated by computing the Burrows-Kurkov non-premixed H2/air supersonic combustion flows, premixed H2/air hypersonic combustion flows in a three-dimensional duct with a 15° compression ramp, as well as the hypersonic laminar chemically nonequilibrium air flows around two 10° half-angle cones. The results of these calculations are in good agreement with those of experiments, NASA UPS or Prabhu＇s PNS codes. It can be concluded that the SSPNS code is highly efficient for steady supersonic/ hypersonic chemically reaction flows when there is no large streamwise separation.展开更多
A high-precision nominal flight profile,involving controllers′intentions is critical for 4Dtrajectory estimation in modern automatic air traffic control systems.We proposed a novel method to effectively improve the a...A high-precision nominal flight profile,involving controllers′intentions is critical for 4Dtrajectory estimation in modern automatic air traffic control systems.We proposed a novel method to effectively improve the accuracy of the nominal flight profile,including the nominal altitude profile and the speed profile.First,considering the characteristics of trajectory data,we developed an improved K-means algorithm.The approach was to measure the similarity between different altitude profiles by integrating the space warp edit distance algorithm,thereby to acquire several fitted nominal flight altitude profiles.This approach breaks the constraints of traditional K-means algorithms.Second,to eliminate the influence of meteorological factors,we introduced historical gridded binary data to determine the en-route wind speed and temperature via inverse distance weighted interpolation.Finally,we facilitated the true airspeed determined by speed triangle relationships and the calibrated airspeed determined by aircraft data model to extract a more accurate nominal speed profile from each cluster,therefore we could describe the airspeed profiles above and below the airspeed transition altitude,respectively.Our experimental results showed that the proposed method could obtain a highly accurate nominal flight profile,which reflects the actual aircraft flight status.展开更多
Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optic...Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.展开更多
The sensor space high resolution Weighted Subspace Fitting (WSF) algorithm is expanded into beam space in this paper. Beam space WSF algorithm uses beam outputs of array which can be regarded as the outputs of an virt...The sensor space high resolution Weighted Subspace Fitting (WSF) algorithm is expanded into beam space in this paper. Beam space WSF algorithm uses beam outputs of array which can be regarded as the outputs of an virtual array having the same number of elements as the beam number to estimate target directions. In most underwater acoustic systems, the number of beams used for determining the direction of arrival is usually considerably less than that of the sensors, so the computation burdensome is decedent. Computer simulation results show that the beam space WSF algorithm retains the super performance of the sensor space WSF algorithm when applied to the beam outputs of some practical acoustic-receiving array.展开更多
This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algo...This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously-existing approaches.The analysis of the running time as well as the storage for the new algorithm is also theoretically made.The algorithm is optimal in the worst case for even d.展开更多
The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific f...The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific flows by matching them against a set of dynamic rules. This basic process accelerates the processing of data, so that instead of processing singular packets repeatedly, corresponding actions are performed on corresponding flows of packets. In this paper, first, we address limitations on a typical packet classification algorithm like Tuple Space Search (TSS). Then, we present a set of different scenarios to parallelize it on different parallel processing platforms, including Graphics Processing Units (GPUs), clusters of Central Processing Units (CPUs), and hybrid clusters. Experimental results show that the hybrid cluster provides the best platform for parallelizing packet classification algorithms, which promises the average throughput rate of 4.2 Million packets per second (Mpps). That is, the hybrid cluster produced by the integration of Compute Unified Device Architecture (CUDA), Message Passing Interface (MPI), and OpenMP programming model could classify 0.24 million packets per second more than the GPU cluster scheme. Such a packet classifier satisfies the required processing speed in the programmable network systems that would be used to communicate big medical data.展开更多
False data injection attacks(FDIAs)can manipulate measurement data from Supervisory Control and Data Acquisition(SCADA)system and threat state estimation in smart grids.Blind FDIAs(BFDIAs)enhance traditional FDIAs,whi...False data injection attacks(FDIAs)can manipulate measurement data from Supervisory Control and Data Acquisition(SCADA)system and threat state estimation in smart grids.Blind FDIAs(BFDIAs)enhance traditional FDIAs,which eliminate the limitation of grasping measurement Jacobian matrix H in advance,but when there are outliers in measurement data,attack performance is degraded.In this paper,improved BFDIAs are proposed.In off-line phase,lowdimensional measurement matrix without outliers calculated by Linear Local Tangent Space Alignment algorithm(LLTSA)is sent into Continuous Deep Belief Network(CDBN)as training data to learn their probability distribution.In on-line phase,real-time low-dimensional measurement matrix with outliers are sent into the trained model as inputs,and outputs are reconstructed by the probability distribution in off-line phase,which eliminates the influence of outliers indirectly.Simulations are implemented on PJM 5-bus and IEEE 14-bus systems to verify the performance of proposed strategy compared with PCA-based BFDIAs.展开更多
The quadratic transformation method is proposed to estimate the trabecular spac- ing （Tb.Sp）, an important index for osteoporosis diagnosis. The performance of this algorithm was investigated by scatter model, two-d...The quadratic transformation method is proposed to estimate the trabecular spac- ing （Tb.Sp）, an important index for osteoporosis diagnosis. The performance of this algorithm was investigated by scatter model, two-dimension finite difference time domain （2D-FDTD） simulation and in vitro experiments of bovine cancellous bone specimens. Comparing with the other four methods autoregressive cepstrum （AR）, adaptive filter- autoregressive cepstral （AFAR）, inverse filter-autoregressive eepstrum （InvAR）, and simplified inverse filter tracking （SIFT）, quadratic transformation is much more stable and accurate. The results demonstrated that quadratic transformation is a great algorithm for Tb.SD estimation.展开更多
文摘As an essential tool for realistic description of the current or future debris environment,the Space Debris Environment Engineering Model(SDEEM)has been developed to provide support for risk assessment of spacecraft.In contrast with SDEEM2015,SDEEM2019,the latest version,extends the orbital range from the Low Earth Orbit(LEO)to Geosynchronous Orbit(GEO)for the years 1958-2050.In this paper,improved modeling algorithms used by SDEEM2019 in propagating simulation,spatial density distribution,and spacecraft flux evaluation are presented.The debris fluxes of SDEEM2019 are compared with those of three typical models,i.e.,SDEEM2015,Orbital Debris Engineering Model 3.1(ORDEM 3.1),and Meteoroid and Space Debris Terrestrial Environment Reference(MASTER-8),in terms of two assessment modes.Three orbital cases,including the Geostationary Transfer Orbit(GTO),Sun-Synchronous Orbit(SSO)and International Space Station(ISS)orbit,are selected for the spacecraft assessment mode,and the LEO region is selected for the spatial density assessment mode.The analysis indicates that compared with previous algorithms,the variable step-size orbital propagating algorithm based on semi-major axis control is more precise,the spatial density algorithm based on the second zonal harmonic of the non-spherical Earth gravity(J_(2))is more applicable,and the result of the position-centered spacecraft flux algorithm is more convergent.The comparison shows that SDEEM2019 and MASTER-8 have consistent trends due to similar modeling processes,while the differences between SDEEM2019 and ORDEM 3.1 are mainly caused by different modeling approaches for uncatalogued debris.
基金supported by the Ministry of Higher Education and Scientific Research of Tunisia
文摘In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model which performs control.As a frst step,the main geometric and mathematical tools used in subspace identifcation are briefly presented.In the second step,the problem of analyzing ill-conditioning matrices in the subspace identifcation method is considered.To illustrate this situation,a simulation study of an example is introduced to show the ill-conditioning in subspace identifcation.Algorithms numerical subspace state space system identifcation(N4SID)and multivariable output error state space model identifcation(MOESP)are considered to study,the parameters estimation while using the induction motor model,in simulation(Matlab environment).Finally,we show the inadequacy of the oblique projection and validate the efectiveness of the orthogonal projection approach which is needed in ill-conditioning;a real application dealing with induction motor parameters estimation has been experimented.The obtained results proved that the algorithm based on orthogonal projection MOESP,overcomes the situation of ill-conditioning in the Hankel s block,and thereby improving the estimation of parameters.
文摘Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task owing to the curse of dimensionality. This paper presents a new algorithm to reduce the size of a design space to a smaller region of interest allowing a more accurate surrogate model to be generated. The framework requires a set of models of different physical or numerical fidelities. The low-fidelity （LF） model provides physics-based approximation of the high-fidelity （HF） model at a fraction of the computational cost. It is also instrumental in identifying the small region of interest in the design space that encloses the high-fidelity optimum. A surrogate model is then constructed to match the low-fidelity model to the high-fidelity model in the identified region of interest. The optimization process is managed by an update strategy to prevent convergence to false optima. The algorithm is applied on mathematical problems and a two-dimen-sional aerodynamic shape optimization problem in a variable-fidelity context. Results obtained are in excellent agreement with high-fidelity results, even with lower-fidelity flow solvers, while showing up to 39% time savings.
文摘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.
基金supported by the National High Technology Research and Development Program (863)of China (2012AA121602)the National Natural Science Foundation of China(11078001)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education of China (20133218120037)the Fundamental Research Funds for the Central Universities under Grant(NS2014091)
文摘A novel gravity assist space pruning(GASP)algorithm based on image tools is proposed for solving interplanetary trajectory optimization problem.Compared with traditional GASP algorithm,the concept of image is introduced to avoid missing interesting solutions with appropriate number of function evaluations.Image tools allow us to evaluate the objective function in regions in place of points and provide an effective way to evaluate the forward and backward constraints for the multi-gravity assist trajectory optimization problem.Since the interesting solutions of the interplanetary trajectory optimization problem are often clustered in a small portion of the search space rather than being overall evenly distributed,the regionwise evaluations with image tools make the little large interval with the proper Lipschitzian tolerances sampling effective.The detailed steps of the proposed method are presented and two examples including Earth Venus Mars(EVM)transfer and Earth Venus Venus Earth Jupiter Saturn(EVVEJS)transfer are given.Finally,a comparison with solutions given by the literature demonstrates the effectiveness of the proposed method.
文摘Making use of this expression to calculate the phase grating in high resolution image simulation can greatly reduce the calculating time. In this paper, the derivation of the expression is introduced, and then the computer routine is explained in details. Finally the potential projection map of Mg44Rh7 along [001] direction is shown as an illustration. All operations are carried out in real space, so we call the calculation method as the real space method.
基金Supported by the National Natural Science Foundation of China(61271373,61571043)111 Project of China(B14010)
文摘An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.
基金supported by the National Natural Science Foundation of China (No. 61302141)
文摘In this paper, a novel algorithm is presented for direction of arrival（DOA） estimation and array self-calibration in the presence of unknown mutual coupling. In order to highlight the relationship between the array output and mutual coupling coefficients, we present a novel model of the array output with the unknown mutual coupling coefficients. Based on this model, we use the space alternating generalized expectation-maximization（SAGE） algorithm to jointly estimate the DOA parameters and the mutual coupling coefficients. Unlike many existing counterparts, our method requires neither calibration sources nor initial calibration information. At the same time,our proposed method inherits the characteristics of good convergence and high estimation precision of the SAGE algorithm. By numerical experiments we demonstrate that our proposed method outperforms the existing method for DOA estimation and mutual coupling calibration.
基金supported by the National Natural Science Foundation of China (51176003)
文摘The previously developed single-sweep parabolized Navier-Stokes （SSPNS） space marching code for ideal gas flows has been extended to compute chemically nonequilibrium flows. In the code, the strongly coupled set of gas dynamics, species conservation, and turbulence equations is integrated with the implicit lower-upper symmetric GaussSeidel （LU-SGS） method in the streamwise direction in a space marching manner. The AUSMPW＋ scheme is used to calculate the inviscid fluxes in the crossflow direction, while the conventional central scheme for the viscous fluxes. The k-g two-equation turbulence model is used. The revised SSPNS code is validated by computing the Burrows-Kurkov non-premixed H2/air supersonic combustion flows, premixed H2/air hypersonic combustion flows in a three-dimensional duct with a 15° compression ramp, as well as the hypersonic laminar chemically nonequilibrium air flows around two 10° half-angle cones. The results of these calculations are in good agreement with those of experiments, NASA UPS or Prabhu＇s PNS codes. It can be concluded that the SSPNS code is highly efficient for steady supersonic/ hypersonic chemically reaction flows when there is no large streamwise separation.
基金supported by the National Natural Science Foundation of China(Nos.61174180,U1433125)the Jiangsu Province Science Foundation (No.BK20141413)the Chinese Postdoctoral Science Foundation (No.2014M550291)
文摘A high-precision nominal flight profile,involving controllers′intentions is critical for 4Dtrajectory estimation in modern automatic air traffic control systems.We proposed a novel method to effectively improve the accuracy of the nominal flight profile,including the nominal altitude profile and the speed profile.First,considering the characteristics of trajectory data,we developed an improved K-means algorithm.The approach was to measure the similarity between different altitude profiles by integrating the space warp edit distance algorithm,thereby to acquire several fitted nominal flight altitude profiles.This approach breaks the constraints of traditional K-means algorithms.Second,to eliminate the influence of meteorological factors,we introduced historical gridded binary data to determine the en-route wind speed and temperature via inverse distance weighted interpolation.Finally,we facilitated the true airspeed determined by speed triangle relationships and the calibrated airspeed determined by aircraft data model to extract a more accurate nominal speed profile from each cluster,therefore we could describe the airspeed profiles above and below the airspeed transition altitude,respectively.Our experimental results showed that the proposed method could obtain a highly accurate nominal flight profile,which reflects the actual aircraft flight status.
文摘Satellite constellation design for space optical systems is essentially a multiple-objective optimization problem. In this work, to tackle this challenge, we first categorize the performance metrics of the space optical system by taking into account the system tasks（i.e., target detection and tracking）. We then propose a new non-dominated sorting genetic algorithm（NSGA） to maximize the system surveillance performance. Pareto optimal sets are employed to deal with the conflicts due to the presence of multiple cost functions. Simulation results verify the validity and the improved performance of the proposed technique over benchmark methods.
基金National Natural Science Foundation of China !(69802010)
文摘The sensor space high resolution Weighted Subspace Fitting (WSF) algorithm is expanded into beam space in this paper. Beam space WSF algorithm uses beam outputs of array which can be regarded as the outputs of an virtual array having the same number of elements as the beam number to estimate target directions. In most underwater acoustic systems, the number of beams used for determining the direction of arrival is usually considerably less than that of the sensors, so the computation burdensome is decedent. Computer simulation results show that the beam space WSF algorithm retains the super performance of the sensor space WSF algorithm when applied to the beam outputs of some practical acoustic-receiving array.
基金This work is supported by the National Natural Science Foundation of China.
文摘This paper presents a new and simple scheme to describe the convex hull in R^d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously-existing approaches.The analysis of the running time as well as the storage for the new algorithm is also theoretically made.The algorithm is optimal in the worst case for even d.
文摘The network switches in the data plane of Software Defined Networking (SDN) are empowered by an elementary process, in which enormous number of packets which resemble big volumes of data are classified into specific flows by matching them against a set of dynamic rules. This basic process accelerates the processing of data, so that instead of processing singular packets repeatedly, corresponding actions are performed on corresponding flows of packets. In this paper, first, we address limitations on a typical packet classification algorithm like Tuple Space Search (TSS). Then, we present a set of different scenarios to parallelize it on different parallel processing platforms, including Graphics Processing Units (GPUs), clusters of Central Processing Units (CPUs), and hybrid clusters. Experimental results show that the hybrid cluster provides the best platform for parallelizing packet classification algorithms, which promises the average throughput rate of 4.2 Million packets per second (Mpps). That is, the hybrid cluster produced by the integration of Compute Unified Device Architecture (CUDA), Message Passing Interface (MPI), and OpenMP programming model could classify 0.24 million packets per second more than the GPU cluster scheme. Such a packet classifier satisfies the required processing speed in the programmable network systems that would be used to communicate big medical data.
基金supported by the Funds of the National Key Research and Development Program of China(Grant No.2020YFE0201100)the Funds of National Science of China(Grant nos.61973062,61973068)the Fundamental Research Funds for the Central Universities(Grant nos.N2004010,N2104021,N182008004).
文摘False data injection attacks(FDIAs)can manipulate measurement data from Supervisory Control and Data Acquisition(SCADA)system and threat state estimation in smart grids.Blind FDIAs(BFDIAs)enhance traditional FDIAs,which eliminate the limitation of grasping measurement Jacobian matrix H in advance,but when there are outliers in measurement data,attack performance is degraded.In this paper,improved BFDIAs are proposed.In off-line phase,lowdimensional measurement matrix without outliers calculated by Linear Local Tangent Space Alignment algorithm(LLTSA)is sent into Continuous Deep Belief Network(CDBN)as training data to learn their probability distribution.In on-line phase,real-time low-dimensional measurement matrix with outliers are sent into the trained model as inputs,and outputs are reconstructed by the probability distribution in off-line phase,which eliminates the influence of outliers indirectly.Simulations are implemented on PJM 5-bus and IEEE 14-bus systems to verify the performance of proposed strategy compared with PCA-based BFDIAs.
基金supported by NSFC(11174060,11304043,11327405)the Ph.D.Programs Foundation of the Ministry of Education of China(20130071110020)the Key Science and Technology Program of Shanghai(13441901900)
文摘The quadratic transformation method is proposed to estimate the trabecular spac- ing （Tb.Sp）, an important index for osteoporosis diagnosis. The performance of this algorithm was investigated by scatter model, two-dimension finite difference time domain （2D-FDTD） simulation and in vitro experiments of bovine cancellous bone specimens. Comparing with the other four methods autoregressive cepstrum （AR）, adaptive filter- autoregressive cepstral （AFAR）, inverse filter-autoregressive eepstrum （InvAR）, and simplified inverse filter tracking （SIFT）, quadratic transformation is much more stable and accurate. The results demonstrated that quadratic transformation is a great algorithm for Tb.SD estimation.
