A volatolomic approach using cerumen as biofluid to diagnose bovine intoxication by Stryphnodendron rotundifolium

An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication.     

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.     

Intramolecular Hydroamination of Selenoalkynes to 2-Selenylindoles in the Absence of Catalyst

In this work, a series of 2-chalcogenylindoles was synthesized by an efficient methodology, starting from chalcogenoalkynes, including a previously unreported tellurium indole derivative. For the first time, these 2-substituted chalcogenylindoles were obtained in the absence of metal catalyst or base, under thermal conditions only. In addition, the results described herein represent a methodology with inverse regioselectivity for the chalcogen functionalization of indoles.     

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.     

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.     

Normalization of complex-valued planar vector fields which degenerate along a real curve

Taking as a start point the recent article of Meziani [7], we present several results concerning the normalization of a class of complex vector fields in the plane which degenerate along a real curve. We mainly deal with operators with finite regularity and analyze both the local situation as well as the case of normalization near a circle. Some related questions (e.g., on semi-global solvability and on the normalization of a class of generalized Mizohata operators) are also discussed.     

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.