扫描相机标定脉冲信号位置的确定及噪声处理

 扫描相机标定数据处理中的一个关键问题是如何准确确定脉冲信号的位置，实验数据的信噪比和脉冲信号位置的定义方法都会对标定结果的准确性产生影响。采用了取半高宽的方法来确定扫描相机标定脉冲信号的位置，在信噪比比较高 （大于100） 的情况下，该方法确定标定信号的位置可以达到亚像素水平。对于信噪比比较低 (小于10) 的实验数据，先采用快速傅里叶变换方法对其进行滤波，通过滤波可以极大地抑制噪声信号的影响，然后采用“半高宽法”确定脉冲信号的位置，最后得出可信的标定结果。当扫描相机定在0.3 ns的扫描档时，通过该方法得到的扫描速度为0.214 ps/pixel,扫描不确定度为0.002 9 ps/pixel,拟合线性相关系数为0.999 7。     

NUMERICAL LOCALIZATION OF ELECTROMAGNETIC IMPERFECTIONS FROM A PERTURBATION FORMULA IN THREE DIMENSIONS

This work deals with the numerical localization of small electromagnetic inhomogeneities. The underlying inverse problem considers, in a three-dimensional bounded domain, the time-harmonic Maxwell equations formulated in electric field. Typically, the domain contains a finite number of unknown inhomogeneities of small volume and the inverse problem attempts to localize these inhomogeneities from a finite number of boundary measurements. Our localization approach is based on a recent framework that uses an asymptotic expansion for the perturbations in the tangential boundary trace of the curl of the electric field. We present three numerical localization procedures resulting from the combination of this asymptotic expansion with each of the following inversion algorithms： the Current Projection method, the MUltiple Signal Classification （MUSIC） algorithm, and an Inverse Fourier method. We perform a numerical study of the asymptotic expansion and compare the numerical results obtained from the three localization procedures in different settings.     

平行六边形区域上的快速离散傅立叶变换

In this paper, we propose a fast algorithm for computing the DGFT (Discrete Generalized Fourier Transforms) on hexagon domains [6], based on the geometric properties of the domain. Our fast algorithm (FDGFT) reduces the computation complexity of DGFT from O(N4) to O(N2 log N). In particulary, for N =2^P23^P34^P45^P56^P6, the floating point computation working amount equals to(17/2P2 16p3 135/8p4 2424/25p5 201/2P6)3N^2. Numerical examples are given to access our analysis.     

CAE-based compensation methods of non-uniform pulse laser beam profiles

Applying the pulse laser to speckle methods, non-uniformities of the laser beam profiles and the intensities between each laser pulse have unpleasant consequences on the intensity distribution of the recorded images and following on the assigned fringes of the corresponding subtractive result. This contribution introduces a computer-based technique for compensating this technical and physical problem, so that the fringe quality is improved, even if the homogeneity of the laser beam profiles is on such low level, that the conventional (subtractive) technique fails. The solution is based on algorithms, which refines each intensity distribution and is comparable with the known shading correction.     

一类广义KdV—Burgers型方程的拟谱方法

本文研究一类带三阶粘性项的广义Kdv-Burgers型方程的初值问题。运用拟谱方法，研究了拟谱格式的收敛性、稳定性．给出了数值例子．     

Quantum Bayesian computation

Quantum Bayesian computation is an emerging field that levers the computational gains available from quantum computers. They promise to provide an exponential speed-up in Bayesian computation. Our article adds to the literature in three ways. First, we describe how quantum von Neumann measurement provides quantum versions of popular machine learning algorithms such as Markov chain Monte Carlo and deep learning that are fundamental to Bayesian learning. Second, we describe quantum data encoding methods needed to implement quantum machine learning including the counterparts to traditional feature extraction and kernel embeddings methods. Third, we show how quantum algorithms naturally calculate Bayesian quantities of interest such as posterior distributions and marginal likelihoods. Our goal then is to show how quantum algorithms solve statistical machine learning problems. On the theoretical side, we provide quantum versions of high dimensional regression, Gaussian processes and stochastic gradient descent. On the empirical side, we apply a quantum FFT algorithm to Chicago house price data. Finally, we conclude with directions for future research.     

Finite difference method for 2-D and 3-D nonlinear free surface wave problems

A finite difference method is developed for the numerical modelling of the 2-D and 3-D unsteady potential flow generated by transient disturbances on the free surface, on which the nonlinear boundary conditions are fully satisfied. The unknown function is computed with an iteration scheme processing in a transformed time-invariant space. After the velocity is calculated, the location of the free surface is renewed and so is the value of velocity on it. The boundary-value problem of the governing equation is then solved at the next time step. The present method incorporates the FFT. Consequently, a tri-diagonal equation system is obtained which could be readily solved. The feasibility of this method has been demonstrated by 2-D and 3-D examples corresponding to different initial disturbances. This work is supported by the science foundation of Academia Sinica. The paper had been accepted by the XVIth International Congress of IUTAM, Lyngby, Denmark, August, 1984.     

容量矩阵法在涡方法中的应用

本文将容量矩阵技术与快速Fourier变换相结合求解非矩形域的Poisson方程,再与格子涡方法相结合,发展了一套求解复杂外形的快速涡方法。作为算例,计算了有厚度平板和楔形体的分离流动,得到了满意的结果。特别是在垂直平板绕流中,模拟出了由于剪切层不稳定性引起的小涡结构。     

A spectral element method using the modal basis and its application in solving second‐order nonlinear partial differential equations

We present a high‐order spectral element method (SEM) using modal (or hierarchical) basis for modeling of some nonlinear second‐order partial differential equations in two‐dimensional spatial space. The discretization is based on the conforming spectral element technique in space and the semi‐implicit or the explicit finite difference formula in time. Unlike the nodal SEM, which is based on the Lagrange polynomials associated with the Gauss–Lobatto–Legendre or Chebyshev quadrature nodes, the Lobatto polynomials are used in this paper as modal basis. Using modal bases due to their orthogonal properties enables us to exactly obtain the elemental matrices provided that the element‐wise mapping has the constant Jacobian. The difficulty of implementation of modal approximations for nonlinear problems is treated in this paper by expanding the nonlinear terms in the weak form of differential equations in terms of the Lobatto polynomials on each element using the fast Fourier transform (FFT). Utilization of the Fourier interpolation on equidistant points in the FFT algorithm and the enough polynomial order of approximation of the nonlinear terms can lead to minimize the aliasing error. Also, this approach leads to finding numerical solution of a nonlinear differential equation through solving a system of linear algebraic equations. Numerical results for some famous nonlinear equations illustrate efficiency, stability and convergence properties of the approximation scheme, which is exponential in space and up to third‐order in time. Copyright © 2014 John Wiley & Sons, Ltd.     

Efficient integration for a class of highly oscillatory integrals

This paper presents some quadrature methods for a class of highly oscillatory integrals whose integrands may have singularities at the two endpoints of the interval. One is a Filon-type method based on the asymptotic expansion. The other is a Clenshaw-Curtis-Filon-type method which is based on a special Hermite interpolation polynomial and can be evaluated efficiently in O(N log N) operations, where N + 1 is the number of Clenshaw-Curtis points in the interval of integration. In addition, we derive the corresponding error bound in inverse powers of the frequency ω for the Clenshaw-Curtis-Filon-type method for the class of highly oscillatory integrals. The efficiency and the validity of these methods are testified by both the numerical experiments and the theoretical results.