Several previous studies have proved the effectiveness of the CNN-UM solution of isotropic elastic wave equations. Most crustal rocks of interest to exploration geophysics are either inherently anisotropic or behave a...
详细信息
Several previous studies have proved the effectiveness of the CNN-UM solution of isotropic elastic wave equations. Most crustal rocks of interest to exploration geophysics are either inherently anisotropic or behave as anisotropic materials when probed by seismic waves. This paper describes modeling of wave propagation in transversely isotropic media. Numerical methods which are based on finite-difference (FD) techniques (in time and space) were not efficient when applied to realistic 3D models, because they require enormous computer memory and power. This work investigates the simulation speedup of FD techniques by CNN-UM architecture. Unfortunately the huge number of space- dependent equations and the low computational precision do not make it possible to utilize the huge computing power of the analogue VLSI CNN-UM chips so the FPGA based Falcon emulated digital CNN-UM architecture is used to implement our solution.
In this paper we analyze the performance of multiple relay channels when multiple antennas are deployed only at relays. Specifically, we investigate the simple repetition-coded decode-and-forward protocol and apply tw...
详细信息
In this paper we analyze the performance of multiple relay channels when multiple antennas are deployed only at relays. Specifically, we investigate the simple repetition-coded decode-and-forward protocol and apply two antenna combining techniques at relays, namely maximum ratio combining (MRC) on receive and transmit beamforming (TB). We assume that the total number of antennas at all relays is fixed to N. With a reasonable power constraint at the relays, we show that the antenna combining techniques can exploit the full spatial diversity of the relay channels and can achieve the same diversity multiplexing tradeoff as achieved by more complex space-time distributed coding techniques, such as those proposed by Laneman and Womell (2003).
Balloon based aerobots have much to offer ESA's future planetary exploration programmes, e.g. high resolution mapping, landing site selection, rover guidance, data relay, sample site selection, payload delivery, a...
详细信息
Balloon based aerobots have much to offer ESA's future planetary exploration programmes, e.g. high resolution mapping, landing site selection, rover guidance, data relay, sample site selection, payload delivery, and atmospheric measurement and meteorology. Aerobots could be used in a variety of configurations from uncontrolled free-flying to tethered rover operation, and are able to perform a range of important tasks which other exploration vehicles cannot. In many ways they provide a missing 'piece' of the exploration 'jigsaw', acting as a bridge between the capabilities of in-situ landers and rovers and non-contact orbiters. Technically, a Lighter than Air (LTA) aerobot concept is attractive because it is low risk, low-cost, efficient, and much less complex than Heavier than Air (HTA) vehicles such as fixed wing gliders, and crucially, much of the required technology 'building blocks' currently exist. Smart imaging and localisation is a key enabling technology for remote aerobots. Given the current lack of comprehensive localisation and communications systems, it is important that aerobots are equipped with the ability to determine their location, with respect to a planet's surface. The availability of a variety of terrain feature extraction, point tracking, and image compression algorithms, means that a self-reliant system is now achievable. We have developed a demonstrator imaging and localisation package (ILP) for a Martian balloon. This ILP system incorporates a unique combination of image based relative and absolute localisation techniques. We have demonstrated our ILP using both simulation and a real laboratory based model aerobot. The availability of both simulated and real aerobot data thus providing a comprehensive test and evaluation framework for the ILP functionality. The results from our work are presented in this paper.
The endovascular repair of a traumatic rupture of the thoracic aorta - that would otherwise lead to the death of the patient - is performed by delivering a stent-graft into the vessel at the rupture location. The age ...
详细信息
The endovascular repair of a traumatic rupture of the thoracic aorta - that would otherwise lead to the death of the patient - is performed by delivering a stent-graft into the vessel at the rupture location. The age range of the affected patients is large and the stent-graft will stay in the body for the remaining life. The technique is relatively new, and no experience with regard to long-term effects, and durability exists. To predict long-term complications, such as ruptures or destructive interactions with surrounding tissue during the life of the patient, it is important to understand the - rather intense and constant - movement of the stent- graft during the cardiac cycle. A computed tomography with heart gating (gated CT) acquires sequences that show the region of the stent-graft at different time points. We analyze the motion of stent-grafts with a model based approach. Stent-grafts are represented as sparse sets of axis points extracted from the gated CT, and motion patterns are captured by a minimum description length based group-wise registration of the stent-graft at different time points. No parameterization or a priori definition of the topology is necessary, and highly variable elasticity properties in the data volume can by accounted for by the sparse statistical model, that captures correlations and motion components of the stent-graft. We report results for deformation models and registration accuracy for 5 patients.
Array computers can be useful in the solution of numerical spatio-temporal problems such as the state equation of the CNN or partial differential equations (PDE). IBM has recently introduced the cell broadband engine ...
详细信息
Array computers can be useful in the solution of numerical spatio-temporal problems such as the state equation of the CNN or partial differential equations (PDE). IBM has recently introduced the cell broadband engine (Cell BE) Architecture which contains 8 identical vector processors in an array structure. In the paper the implementation of CNN simulation kernel on the Cell BE is described. The simulation kernel is optimized, according to the special requirements of the Cell BE and can use linear and also nonlinear (piecewise linear) templates. The area/speed/power tradeoffs of our solution and different hardware implementations are also compared.
Minimal surface is extensively employed in many areas. In this paper, we propose a control mesh representation of a class of minimal surfaces, called generalized helicoid minimal surfaces, which contain the right heli...
详细信息
Minimal surface is extensively employed in many areas. In this paper, we propose a control mesh representation of a class of minimal surfaces, called generalized helicoid minimal surfaces, which contain the right helicoid and catenoid as special examples. We firstly construct the Bézier-like basis called AHT Bézier basis in the space spanned by {1, t, sint, cost, sinht, cosht}, t∈[0,α], α∈[0,5π/2]. Then we propose the control mesh representation of the generalized helicoid using the AHT Bézier basis. This kind of representation enables generating the minimal surfaces using the de Casteljau-like algorithm in CAD/CAGD mod- elling systems.
Modifying the knots of a B-spline curve, the shape of the curve will be changed. In this paper, we present the effect of the symmetric alteration of four knots of the B-spline and the NURBS surfaces, i.e., symmetrical...
详细信息
Modifying the knots of a B-spline curve, the shape of the curve will be changed. In this paper, we present the effect of the symmetric alteration of four knots of the B-spline and the NURBS surfaces, i.e., symmetrical alteration of the knots of surface, the extended paths of points of the surface will converge to a point which should be expressed with several control points. This theory can be used in the constrained shape modification of B-spline and NURBS surfaces.
This paper presents the matrix representation for the hyperbolic polynomial B-spline basis and the algebraic hyperbolic Bézier basis in a recursive way, which are both generated over the space Ωn=span{sinht, cos...
详细信息
This paper presents the matrix representation for the hyperbolic polynomial B-spline basis and the algebraic hyperbolic Bézier basis in a recursive way, which are both generated over the space Ωn=span{sinht, cosht, tn-3, , t, 1} in which n is an arbitrary integer larger than or equal to 3. The conversion matrix from the hyperbolic polynomial B-spline basis of arbitrary order to the algebraic hyperbolic Bézier basis of the same order is also given by a recursive approach. As examples, the specific expressions of the matrix representation for the hyperbolic polynomial B-spline basis of order 4 and the algebraic hyperbolic Bézier basis of order 4 are given, and we also construct the conversion matrix between the two bases of order 4 by the method proposed in the paper. The results in this paper are useful for the evaluation and conversion of the curves and surfaces constructed by the two bases.
This paper presents a novel approach to consider optimal multi-degree reduction of Bézier curve with G1-continuity. By minimizing the distances between corresponding control points of the two curves through degre...
详细信息
This paper presents a novel approach to consider optimal multi-degree reduction of Bézier curve with G1-continuity. By minimizing the distances between corresponding control points of the two curves through degree raising, optimal approximation is achieved. In contrast to traditional methods, which typically consider the components of the curve separately, we use geometric information on the curve to generate the degree reduction. So positions and tangents are preserved at the two endpoints. For satisfying the solvability condition, we propose another improved algorithm based on regularization terms. Finally, numerical examples demonstrate the effectiveness of our algorithms.
暂无评论