A multigrid accelerated hybrid unstructured mesh method for 3D compressible turbulent flow

 A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation. The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest. Sponsored by The Research Council of Norway, project number 125676/410 Dedicated to the memory of Prof. Mike Crisfield, a respected colleague     

Sequential testing of sorted and transformed data as an efficient way to implement long GLRTs

It is often required to detect a long weak signal in Gaussian noise, and frequently, the exact form of that signal is parameterized but not known. A bank of matched filters provides an appropriate detector. However, in some practical applications, there are very many matched filters, and most are quite long. The consequent computational needs may render the classical bank-of-filters approach infeasibly expensive. One example, and our original motivation, is the detection of chirp gravitational waves by an Earth-based interferometer. In this paper, we provide a computational approach to this problem via sequential testing. Since the sequential tests to be used are not for constant signals, we develop the theory in terms of average sample number (ASN) for this case. Specifically, we propose two easily calculable expressions for the ASN: one a bound and the other an approximation. The sequential approach does yield moderate computational savings, but we find that by preprocessing the data using short/medium fast Fourier transforms (FFTs) and an appropriate sorting of these FFT outputs such that the most informative samples are entered to a sequential test first, quite high numerical efficiency can be realized. The idea is simple but appears to be quite successful: Examples are presented in which the computational load is reduced by several orders of magnitude. The FFT is an example of an energy-agglomerating transform, but of course, there are many others. The point here is that the transform need not match the sought signal exactly in the sense that all energy becomes confined to a single sample; it is enough that the energy becomes concentrated, and the more concentrated the better.     

Control system design on a power-split CVT for high-power agricultural tractors

The problem considered in this paper is the design and tuning of the control system of a power-split continuously variable transmission (CVT) used in high-power tractors. Power-split CVTs are characterized by the combination of a traditional mechanical transmission and by a continuously-variable transmission. This guarantees, at the same time, smooth variations of the transmission-ratio and high efficiency of the overall transmission system. The control architecture of an hydrostatic power-split CVT is constituted by three main parts: 1) servo-controller on the current of the valve which drives the hydraulic transmission; 2) a servo-controller on the hydraulic transmission-ratio; and 3) a synchronizer which coordinates the hydraulic and the mechanical parts of the CVT. In this work, these three controllers are fully developed, including: design, implementation, and evaluation on an experimental system.     

On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

构建高扩展性的县级广电宽带数据网络

提出在县市级广电宽带数据网络的建设过程中,要着眼业务发展,突出高扩展性,构建基于标准、扩展灵活的主干网,实现网络建设的可持续性发展,并结合实际,从核心设备、端口、中继带宽、网络业务4个方面对扩展能力进行了阐述.     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.