Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

REST API技术及在移动通信网络管理中的应用

介绍了目前最炙手可热的REST架构风格，该风格顺应Web2.0的兴起，完美的匹配了云计算时代来临的可扩展要求，在各种应用场景中都得到了充分的表现。根据其技术特点，分析了该风格的API在移动通信网络管理中的应用，从网管系统内部、网管系统之间以及网管系统与上层APP应用之间等多方面对是否适用于REST风格以及如何在合适的位置使用REST API进行了分析。     

高性能调度技术中应用程序调度模型设计--地理空间信息网格调度技术的研究

地理空间信息网格调度技术，要比传统的高性能计算中的调度技术复杂，原因是如果将全部网格资源作为一个应用程序的调度和执行目标，必将导致通信延迟、成本昂贵、执行低效等。为此，综合考虑应用程序特性、机器特性等，研究设计了地理空间信息网格高性能调度技术中的应用程序调度模型，包括地理空间信息网格应用程序分析；资源特性分析；应用程序分解；性能预测；资源调度；机器选择；任务映射；任务调度；任务调度器和调度器管理模块。以实现为不同的应用程序匹配不同的计算资源，提高计算资源的利用率和应用程序的执行效率。     

AGE method simulations of a turbulent far‐wake compared to spectral DNS

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This paper demonstrates that a good compromise is possible with the advected grid explicit (AGE) method. Starting from the same initial field as a previous spectral DNS, AGE method simulations of a planar turbulent wake were carried out as DNS, and then at three levels of reduced resolution. The latter cases were in a sense large‐eddy simulations (LES), although no specific sub‐grid‐scale model was used. Results for the two DNS methods, including variances and power spectra, were very similar, but the AGE simulation required much less computational effort. Small‐scale information was lost in the reduced resolution runs, but large‐scale mean and instantaneous properties were reproduced quite well, with further large reductions in computational effort. Quality of results becomes more sensitive to the value chosen for one of the AGE method parameters as resolution is reduced, from which it is inferred that the numerical stability procedure controlled by the parameter is acting in part as a sub‐grid‐scale model. Copyright © 2002 John Wiley & Sons, Ltd.     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

Computations of two passing‐by high‐speed trains by a relaxation overset‐grid algorithm

This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd.     

A time‐accurate pseudo‐compressibility approach based on an unstructured hybrid finite volume technique applied to unsteady turbulent premixed flame propagation

A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 John Wiley & Sons, Ltd.     

A virtual boundary method with improved computational efficiency using a multi‐grid method

The flow around spherical, solid objects is considered. The boundary conditions on the solid boundaries have been applied by replacing the boundary with a surface force distribution on the surface, such that the required boundary conditions are satisfied. The velocity on the boundary is determined by extrapolation from the flow field. The source terms are determined iteratively, as part of the solution. They are then averaged and are smoothed out to nearby computational grid points. A multi‐grid scheme has been used to enhance the computational efficiency of the solution of the force equations. The method has been evaluated for flow around both moving and stationary spherical objects at very low and intermediate Reynolds numbers. The results shows a second order accuracy of the method both at creeping flow and at Re=100. The multi‐grid scheme is shown to enhance the convergence rate up to a factor 10 as compared to single grid approach. Copyright © 2004 John Wiley & Sons, Ltd.     

A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

一种简易云雾室的制作

本文利用自制云雾室把微观粒子的运动转化为宏观现象，从而供实验观察和研究。