Versatile Near-Infrared Super-Resolution Imaging of Amyloid Fibrils with the Fluorogenic Probe CRANAD-2

CRANAD-2 is a fluorogenic curcumin derivative used for near-infrared detection and imaging in vivo of amyloid aggregates, which are involved in neurodegenerative diseases. We explore the performance of CRANAD-2 in two super-resolution imaging techniques, namely stimulated emission depletion (STED) and single-molecule localization microscopy (SMLM), with markedly different fluorophore requirements. By conveniently adapting the concentration of CRANAD-2, which transiently binds to amyloid fibrils, we show that it performs well in both techniques, achieving a resolution in the range of 45–55 nm. Correlation of SMLM with atomic force microscopy (AFM) validates the resolution of fine features in the reconstructed super-resolved image. The good performance and versatility of CRANAD-2 provides a powerful tool for near-infrared nanoscopic imaging of amyloids in vitro and in vivo.     

Biodistribution study of free and microencapsulated 6‐methylcoumarin in Wistar rats by HPLC

A sensitive, specific and reproducible HPLC method has been developed and validated for the quantitative determination of 6‐methylcoumarin (6MC) in plasma and other tissues in Wistar rats. A C₁₈ column was used with UV detection at 321 nm and a gradient system consisting of methanol‐deionized water was used as mobile phase. The retention time for 6MC was 14.921 min and no interfering peaks were observed for any of the matrices. Linear relationships (r² > 0.997) were obtained between the peak height ratios and the corresponding biological sample concentrations over the range 0.4–12.8 µg/mL. Precision and accuracy were evaluated; the coefficient of variation and the relative error for all of the organs were <2 and 7%, respectively. The limit of quantitation was 0.20 µg/mL for the heart and 0.30 µg/mL for the other tissues evaluated. This HPLC method was successfully used in the determination of 6MC in the biodistribution study after administration of 200 mg/kg of both 6MC‐free and 6MC‐loaded polymeric microparticles. In this study, extensive 6MC was found, in both free and microencapsulated forms, in all the organs tested. The 6MC‐free showed a range of between 1.7 and 11.5 µg/g, while the microencapsulated 6MC showed concentrations of between 6.35 and 17.7 µg/g, suggesting that 6MC improved absorption rate. Copyright © 2014 John Wiley & Sons, Ltd.     

Isolation of Bisphenol A-Tolerating/degrading Shewanella haliotis Strain MH137742 from an Estuarine Environment

Applied Biochemistry and Biotechnology - The human exposure to bisphenol A (BPA) occurs frequently. Once, this compound was one of the highest volume chemicals produced worldwide and used as a...     

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.     

On an Application of Newton's Method to Nonlinear Operators with w-Conditioned Second Derivative

We present a new approach to study the convergence of Newton's method in Banach spaces, which relax the conditions appearing in the usual studies. The approach is based on the bound required for the second derivative of the operator involved. An application to a nonlinear integral equation is presented.     

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.