Based on the study of Walsh transformation,the zooming template of a two dimensional superimposure filter is decomposed and simplified,and it is real time implemented with FPGA.This method is simple and effective.Th...Based on the study of Walsh transformation,the zooming template of a two dimensional superimposure filter is decomposed and simplified,and it is real time implemented with FPGA.This method is simple and effective.The quality of the image is very good.展开更多
Let A∈N,B∈Z with gcd(A,B)=1,B{-1,0,1}. For the binary recurrence (Lucas sequence) of the form u 0=0, u 1=1, u n+2 =Au n+1 +Bu n, let N 1(A,B,k) be the number of the terms n of |u n|=k, where k∈N. In this paper, usi...Let A∈N,B∈Z with gcd(A,B)=1,B{-1,0,1}. For the binary recurrence (Lucas sequence) of the form u 0=0, u 1=1, u n+2 =Au n+1 +Bu n, let N 1(A,B,k) be the number of the terms n of |u n|=k, where k∈N. In this paper, using a new result of Bilu, Hanrot and Voutier on primitive divisors, we proved that N 1(A,B,k)≤1 except N 1(1,-2,1)=5[n=1,2,3,5,13], N 1(1,-3,1)=3, N 1(1,-5,1)=3,N 1(1,B,1)=2(B{-2,-3,-5}), N 1(12,-55,1)=2, N 1(12,-377,1)=2, N 1(A,B,1)=2(A 2+B=±1, A>1), N 1(1,-2,3)=2, N 1(A,B,A)=2(A 2+2B=±1,A>1. For Lehmer sequence, we got a similar result. In addition, we also obtained some applications of the above results to some Diophantime equations.展开更多
The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, wher...The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, where a new term associating with the current measurement information(CMI) was introduced into the expression of the sampled particles. Through the repeated use of the least squares estimate, the CMI can be integrated into the sampling stage in an iterative manner, conducing to the greatly improved sampling quality. By running the IIDF, an iterated PF(IPF) can be obtained. Subsequently, a parallel resampling(PR) was proposed for the purpose of parallel implementation of IPF, whose main idea was the same as systematic resampling(SR) but performed differently. The PR directly used the integral part of the product of the particle weight and particle number as the number of times that a particle was replicated, and it simultaneously eliminated the particles with the smallest weights, which are the two key differences from the SR. The detailed implementation procedures on the graphics processing unit of IPF based on the PR were presented at last. The performance of the IPF, PR and their parallel implementations are illustrated via one-dimensional numerical simulation and practical application of passive radar target tracking.展开更多
A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. ...A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. Let Then, C0 is said to he an equilibrium SCDC of G. In this paper, we show that if G is an outer planar graph, δ(C0)≤2, otherwiseδ(C0) ≤4.展开更多
基金Supported by National Nine-Five Project(No. 0 3 0 3 )
文摘Based on the study of Walsh transformation,the zooming template of a two dimensional superimposure filter is decomposed and simplified,and it is real time implemented with FPGA.This method is simple and effective.The quality of the image is very good.
文摘Let A∈N,B∈Z with gcd(A,B)=1,B{-1,0,1}. For the binary recurrence (Lucas sequence) of the form u 0=0, u 1=1, u n+2 =Au n+1 +Bu n, let N 1(A,B,k) be the number of the terms n of |u n|=k, where k∈N. In this paper, using a new result of Bilu, Hanrot and Voutier on primitive divisors, we proved that N 1(A,B,k)≤1 except N 1(1,-2,1)=5[n=1,2,3,5,13], N 1(1,-3,1)=3, N 1(1,-5,1)=3,N 1(1,B,1)=2(B{-2,-3,-5}), N 1(12,-55,1)=2, N 1(12,-377,1)=2, N 1(A,B,1)=2(A 2+B=±1, A>1), N 1(1,-2,3)=2, N 1(A,B,A)=2(A 2+2B=±1,A>1. For Lehmer sequence, we got a similar result. In addition, we also obtained some applications of the above results to some Diophantime equations.
基金Project(61372136) supported by the National Natural Science Foundation of China
文摘The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, where a new term associating with the current measurement information(CMI) was introduced into the expression of the sampled particles. Through the repeated use of the least squares estimate, the CMI can be integrated into the sampling stage in an iterative manner, conducing to the greatly improved sampling quality. By running the IIDF, an iterated PF(IPF) can be obtained. Subsequently, a parallel resampling(PR) was proposed for the purpose of parallel implementation of IPF, whose main idea was the same as systematic resampling(SR) but performed differently. The PR directly used the integral part of the product of the particle weight and particle number as the number of times that a particle was replicated, and it simultaneously eliminated the particles with the smallest weights, which are the two key differences from the SR. The detailed implementation procedures on the graphics processing unit of IPF based on the PR were presented at last. The performance of the IPF, PR and their parallel implementations are illustrated via one-dimensional numerical simulation and practical application of passive radar target tracking.
基金Supported by the National Natural Science Foundation of China (69973001)
文摘A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. Let Then, C0 is said to he an equilibrium SCDC of G. In this paper, we show that if G is an outer planar graph, δ(C0)≤2, otherwiseδ(C0) ≤4.
