An approximate fast-mapping approach to the surface NMR forward problem

2020 ◽  
Vol 221 (2) ◽  
pp. 928-937
Author(s):  
Denys Grombacher ◽  
Mason Andrew Kass ◽  
Esben Auken ◽  
Jakob Juul Larsen

SUMMARY A surface nuclear magnetic resonance (NMR) forward model based on the full-Bloch equation improves the accuracy of the forward response given an arbitrary excitation pulse and a wider range of relaxation conditions. However, the full-Bloch solution imposes a significant slowdown in inversion times compared to the traditional forward model. We present a fast-mapping approach capable of dramatic increases in inversion speeds with minimal sacrifices in forward response accuracy. We show that the look-up tables used to calculate the transverse magnetization and the full surface NMR forward response are smoothly varying functions of the underlying T2* and T2 values. We exploit this smoothness to form a polynomial representation of the look-up tables and surface NMR forward responses, where a fast-mapping approximation of each are reduced to a simple matrix multiplication. Accurate approximations with less than 1 per cent error can be produced using 21 coefficient representations of the look-up tables for each B1 value and for the signal expected from a particular depth layer for a particular pulse moment. In essence, the proposed fast-mapping approach front-loads all expensive calculations and stores the results in a compressed form as a coefficient matrix containing less than a half a million elements. This allows all subsequent inversions to be performed at greatly improved speeds.

1991 ◽  
Vol 15 (3) ◽  
pp. 235-256 ◽  
Author(s):  
X. Cyril ◽  
J. Angeles ◽  
A. Misra

In this paper the formulation and simulation of the dynamical equations of multibody mechanical systems comprising of both rigid and flexible-links are accomplished in two steps: in the first step, each link is considered as an unconstrained body and hence, its Euler-Lagrange (EL) equations are derived disregarding the kinematic couplings; in the second step, the individual-link equations, along with the associated constraint forces, are assembled to obtain the constrained dynamical equations of the multibody system. These constraint forces are then efficiently eliminated by simple matrix multiplication of the said equations by the transpose of the natural orthogonal complement of kinematic velocity constraints to obtain the independent dynamical equations. The equations of motion are solved for the generalized accelerations using the Cholesky decomposition method and integrated using Gear’s method for stiff differential equations. Finally, the dynamical behaviour of the Shuttle Remote Manipulator when performing a typical manoeuvre is determined using the above approach.


Author(s):  
P. Raghu ◽  
K. Sriram

Grid computing is a special type of parallel computing, which allows us to unite pools of servers, storage systems, and networks into a single large virtual super computer. Grid computing has the advantages of solving complex problems in a shorter time and also makes better use of the existing hardware. It can take advantage of underutilized resources to meet business requirements while minimizing additional costs. There are many Grid setup tools available. In this paper, Globus Toolkit, an open source tool for grid enabled applications, is considered. Initially grid is established between two systems running Linux, using Globus Toolkit. A simple matrix multiplication program, which is capable of running both in grid and stand alone systems, is developed. The application is executed in single system varying the order of the matrices. The same application is split into two sub jobs and run on two grid machines with different orders. Finally the results of the execution are compares and the results are presented in graphs. The work can be extended further to find the type of parallelizing suitable for the application developed. Similarly, FP tree algorithm is taken and the data sets are fed into different machine and in stand alone system. A suitable load balancing mechanism for grid application is discussed. The sections in the paper are arranged as following; Introduction to Grid, Grid setup using Globus toolkit, splitting of the matrix application, FP tree algorithm, performance results, future works, conclusion and references.


2005 ◽  
Vol 15 (04) ◽  
pp. 367-378 ◽  
Author(s):  
RAIMI RUFAI ◽  
MUSLIM BOZYIGIT ◽  
JARALLA ALGHAMDI ◽  
MOATAZ AHMED

While multithreaded programming is an effective way to exploit concurrency, multithreaded programs are notoriously hard to program, debug and tune for performance. In this paper, we present OpenMP shared memory programming as a viable alternative and a much simpler way to write multithreaded programs. We show through empirical results obtained by running, on a single processor machine, a simple matrix multiplication program written in OpenMP C that the drop in performance compared with the single threaded version even on a uniprocessor machine may be negligible. However, this is well compensated for by the increased programmer productivity resulting from the ease of programming, debugging, tuning and the relative ease of OpenMP skill acquisition.


2019 ◽  
Vol 218 (3) ◽  
pp. 1892-1902 ◽  
Author(s):  
Denys Grombacher ◽  
Gianluca Fiandaca ◽  
Esben Auken

Author(s):  
Adama Diene ◽  
Shaima Abdullah Thabet ◽  
Yahya Yusuf

An oil and vinegar scheme is a signature scheme based on multivariate quadratic polynomials over finite fields. The system of polynomials contains $n$ variables, divided into two groups: $v$ vinegar variables and $o$ oil variables. The scheme is called balanced (OV) or unbalanced (UOV), depending on whether $v = 0$ or not, respectively. These schemes are very fast and require modest computational resources, which make them ideal for low-cost devices such as smart cards. However, the OV scheme has been already proven to be insecure and the UOV scheme has been proven to be very vulnerable for many parameter choices. In this paper, we propose a new multivariate public key signature whose central map consists of a set of polynomials obtained from the multiplication of block matrices. Our construction is motivated by the design of the Simple Matrix Scheme for Encryption and the UOV scheme. We show that it is secure against the Separation Method, which can be used to attack the UOV scheme, and against the Rank Attack, which is one of the deadliest attacks against multivariate public-key cryptosystems. Some theoretical results on matrices with polynomial entries are also given, to support the construction of the scheme.


PsycCRITIQUES ◽  
2012 ◽  
Vol 57 (49) ◽  
Author(s):  
Richard W. Bloom
Keyword(s):  

2014 ◽  
Author(s):  
Marc N. Coutanche ◽  
Sharon L. Thompson-Schill
Keyword(s):  

2020 ◽  
Vol 64 (1-4) ◽  
pp. 621-629
Author(s):  
Yingsong Zhao ◽  
Cherdpong Jomdecha ◽  
Shejuan Xie ◽  
Zhenmao Chen ◽  
Pan Qi ◽  
...  

In this paper, the conventional database type fast forward solver for efficient simulation of eddy current testing (ECT) signals is upgraded by using an advanced multi-media finite element (MME) at the crack edge for treating inversion of complex shaped crack. Because the analysis domain is limited at the crack region, the fast forward solver can significantly improve the numerical accuracy and efficiency once the coefficient matrices of the MME can be properly calculated. Instead of the Gauss point classification, a new scheme to calculate the coefficient matrix of the MME is proposed and implemented to upgrade the ECT fast forward solver. To verify its efficiency and the feasibility for reconstruction of complex shaped crack, several cracks were reconstructed through inverse analysis using the new MME scheme. The numerical results proved that the upgraded fast forward solver can give better accuracy for simulating ECT signals, and consequently gives better crack profile reconstruction.


Sign in / Sign up

Export Citation Format

Share Document