A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to de...A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.展开更多
In this paper,the control of complex delayed networks with different nodes is proposed.Firstly,the stabilization of coupled networks with time delay is investigated.By constructing a Lyapunov function,a linear feedbac...In this paper,the control of complex delayed networks with different nodes is proposed.Firstly,the stabilization of coupled networks with time delay is investigated.By constructing a Lyapunov function,a linear feedback controller design procedure for the networks is converted to the problem of solving a set of linear matrix inequalities.Then the results are extended to networks with both delayed dynamical nodes and delayed couplings.It is shown that the stabilization of complex networks is determined by the dynamics of each uncoupled node,coupling matrix and feedback gain matrix of networks.Two examples are simulated.In the first example,a network with 10 nodes consisting of Lorenz systems and systems proposed by Zhang in 2009 is given.It is found that the network states are divergent without control,and convergent under designed linear feedback controllers.In the second example,a larger network with 100 nodes consisting of delayed Chen systems and delayed Lorenz systems is given.The proposed method is also effective for large scale networks.展开更多
A Boolean function /(x1,x2,…,xn) is said to be elusive, if every decision tree algorithm computing / must examine all n variables in the worst case. In 1988, A.C.C. Yao introduced a question: Is any nontrivial monoto...A Boolean function /(x1,x2,…,xn) is said to be elusive, if every decision tree algorithm computing / must examine all n variables in the worst case. In 1988, A.C.C. Yao introduced a question: Is any nontrivial monotone Boolean function that is invariant under the transitive act of group Cm × Cn elusive? The positive answer to this question supports the famous Rivest-Vuillemin conjecture on decision tree complexity. In this paper, we shall partly answer this question.展开更多
This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The ma...This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.展开更多
Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed： one uses the contour integral representation and conformal real〉 ping, and the other is based on a version of the mu...Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed： one uses the contour integral representation and conformal real〉 ping, and the other is based on a version of the multipole representation of the Fermi-Dirac function that uses only simple poles. Both representations have logarithmic computational complexity. They are of great interest for electronic structure calculations.展开更多
基金Project(61101185)supported by the National Natural Science Foundation of China
文摘A fast algorithm based on the grayscale distribution of infrared target and the weighted kernel function was proposed for the moving target detection(MTD) in dynamic scene of image series. This algorithm is used to deal with issues like the large computational complexity, the fluctuation of grayscale, and the noise in infrared images. Four characteristic points were selected by analyzing the grayscale distribution in infrared image, of which the series was quickly matched with an affine transformation model. The image was then divided into 32×32 squares and the gray-weighted kernel(GWK) for each square was calculated. At last, the MTD was carried out according to the variation of the four GWKs. The results indicate that the MTD can be achieved in real time using the algorithm with the fluctuations of grayscale and noise can be effectively suppressed. The detection probability is greater than 90% with the false alarm rate lower than 5% when the calculation time is less than 40 ms.
基金Supported by National Natural Science Foundation of China (No.61004015)Research Fund for the Doctoral Program of Higher Education of China (No.20090032120034)
文摘In this paper,the control of complex delayed networks with different nodes is proposed.Firstly,the stabilization of coupled networks with time delay is investigated.By constructing a Lyapunov function,a linear feedback controller design procedure for the networks is converted to the problem of solving a set of linear matrix inequalities.Then the results are extended to networks with both delayed dynamical nodes and delayed couplings.It is shown that the stabilization of complex networks is determined by the dynamics of each uncoupled node,coupling matrix and feedback gain matrix of networks.Two examples are simulated.In the first example,a network with 10 nodes consisting of Lorenz systems and systems proposed by Zhang in 2009 is given.It is found that the network states are divergent without control,and convergent under designed linear feedback controllers.In the second example,a larger network with 100 nodes consisting of delayed Chen systems and delayed Lorenz systems is given.The proposed method is also effective for large scale networks.
基金Supported by the National Natural Science Foundation of China (10171095) Foundation of Chinese Academy of Science (J2001), and Foundation of GSCAS
文摘A Boolean function /(x1,x2,…,xn) is said to be elusive, if every decision tree algorithm computing / must examine all n variables in the worst case. In 1988, A.C.C. Yao introduced a question: Is any nontrivial monotone Boolean function that is invariant under the transitive act of group Cm × Cn elusive? The positive answer to this question supports the famous Rivest-Vuillemin conjecture on decision tree complexity. In this paper, we shall partly answer this question.
基金supported by the Natural Science Foundation of Hubei Province under Grant No.2008CDZ047
文摘This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.
基金supported by the Department of Energy (No.DE-FG02-03ER25587)the Office of Naval Research(No.N00014-01-1-0674)an Alfred P.Sloan Research Fellowship and a startup grant from University of Texas at Austin
文摘Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed： one uses the contour integral representation and conformal real〉 ping, and the other is based on a version of the multipole representation of the Fermi-Dirac function that uses only simple poles. Both representations have logarithmic computational complexity. They are of great interest for electronic structure calculations.
