𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fast Algorithm for the Deconvolution of Spin-Spin Splittings

✍ Scribed by F. Delrioportilla; R. Freeman

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
383 KB
Volume
108
Category
Article
ISSN
1064-1858

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Deconvolution and Measurement of Spin–Sp
Deconvolution and Measurement of Spin–Spin Splittings by Modified J Doubling in the Frequency Domain
✍ Acely Garza-GarcΔ±́a; Gioconda Ponzanelli-VelΓ‘zquez; Federico del RΔ±&a πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 163 KB

A new implementation of J doubling in the frequency domain is proposed. This modified J doubling uses novel sets of delta functions [..., +1, -1, +1, +1, -1, +1, ...] for in-phase multiplets and [..., -1, -1, -1, +1, +1, +1, ...] for antiphase multiplets. The convolution process together with the co

An algorithm for the generation of nucle
An algorithm for the generation of nuclear spin species and nuclear spin statistical weights
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 438 KB

## Abstract This article develops a set of algorithms for the computer generation of nuclear spin species and nuclear spin statistical weights potentially useful in molecular spectroscopy. These algorithms generate the nuclear spin species from group structures known as generalized character cycle

A comparison of conventional spin-echo a
A comparison of conventional spin-echo and fast spin-echo in the detection of multiple sclerosis
✍ Wayne B. Patola; Bruce A. Coulter; Patricia M. Chipperfield; Sattam S. Lingawi πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 389 KB

## Abstract Fast spin‐echo (FSE) pulse sequences enable T2‐weighted imaging in a fraction of the time required for T2‐weighted conventional spin‐echo (CSE) imaging. Due to concerns that the altered contrast characteristics of FSE may interfere with the visualization of multiple sclerosis (MS) lesio

A Fast Algorithm for the Optimal Alignme
A Fast Algorithm for the Optimal Alignment of Three Strings
✍ Lloyd Allison πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg