Enhancing signal-to-noise ratio and resolution in low-field NMR relaxation measurements using post-acquisition digital filters

The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T₁) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T₁ signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T₁, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T₁ method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples.     

Covariant Sectors with Infinite Dimension¶and Positivity of the Energy

Let ? be a local conformal net of von Neumann algebras on S ¹ and ρ a M?bius covariant representation of ?, possibly with infinite dimension. If ρ has finite index, ρ has automatically positive energy. If ρ has infinite index, we show the spectrum of the energy always to contain the positive real line, but, as seen by an example, it may contain negative values. We then consider nets with Haag duality on ℝ, or equivalently sectors with non-solitonic extension to the dual net; we give a criterion for irreducible sectors to have positive energy, namely this is the case iff there exists an unbounded M?bius covariant left inverse. As a consequence the class of sectors with positive energy is stable under composition, conjugation and direct integral decomposition. Received: 21 April 1997 / Accepted: 23 September 1997     

Identity principles for commuting holomorphic self-maps of the unit disc

Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g.     

Heisenberg-limited Measurements and Sub-Planck Structures in Phase Space

It is shown how sub-Planck phase-space structures can be used to achieve Heisenberg-limited sensitivity in weak force measurements. Nonclassical states of harmonic oscillators, such as superpositions of coherent states, are shown to be useful for the measurement of weak forces that cause translations or rotations in phase space, which is done by entangling the quantum oscillator with a two-level system. This method is closely related to the Loschmidt echo techniques employed in nuclear magnetic resonance experiments. Implementations of this strategy in cavity QED and ion traps are described.     

Multiple image encryption using an aperture-modulated optical system

A multiple image cryptosystem based on different apertures in an optical set-up under a holographic arrangement is proposed. The system is a security architecture that uses different pupil aperture mask in the encoding lens to encrypt different images. Based on this approach multiple encryption is achieved by changing the pupil aperture arrangement of the optical system among exposures. In addition to the classical speckle phase mask, the geometrical parameters characterizing the apertures are introduced to increase the system security. Even when an illegal user steals the speckle phase mask, the system cannot be broken into without the correct pupil geometrical parameters. The experimental set-up is based on a volume photorefractive BSO crystal as storing device. Information retrieval is done via a phase conjugation operation. We also have to stress that the multiple storage under this scheme, is only possible with the help of the aperture mask. Simulation and experimental results are further introduced to verify the proposed method.     

Affine Arithmetic: Concepts and Applications

Affine arithmetic is a model for self-validated numerical computation that keeps track of first-order correlations between computed and input quantities. We explain the main concepts in affine arithmetic and how it handles the dependency problem in standard interval arithmetic. We also describe some of its applications.     

Collaborative distributed decision making for large scale disaster relief operations: Drawing analogies from robust natural systems

One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

The first ruthenium-alkyne-dihydride reported is now recognized as an intermediate in the homogeneous hydrogenation of diphenylacetylene: Crystal structure of (μ-H)2Ru3(CO)9(μ3-η2-∥-C2Ph2)

The title complex (complex1) was the first alkyne-substituted triruthenium dihydrido cluster to be reported and was characterized by spectroscopy as a triangular cluster with the alkyne parallel to a Ru-Ru edge. Recently, we have found that1 is a key intermediate in the homogeneous hydrogenation of diphenylacetylene catalyzed by tetrahedral Ru₄ and FeRu₃ clusters. Since the discovery of1, a great number of complexes with alkynes parallel to a cluster edge have been reported; at present this is the more common bonding mode for alkynes on trinuclear clusters. The structural features of1 allow a comparison with those of other ruthenium-containing derivatives and help to draw suggestions of the role of1 in hydrogenation catalysis.