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.     

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.     

Halomethanes in tri-n-octylamine and squalane mixtures at infinite dilution

The retention behavior of eight halomethanes and four saturated hydrocarbons was measured in gas chromatographic stationary phases consisting in tri-n-octylamine (TOA), squalane (SQ) and six TOA+SQ mixtures, at 55.0, 58.5, 62.5 and 65.0°C. Equlibrium constants for complex formation were extracted from experimental data by using a lattice model developed by Martire. The results may be interpreted in terms of the formation of weak hydrogen-bonded complexes, with sociation constants of about 0.13 L-mol^–1 for haloforms and 0.07 L-mol^–1 for dihalomethanes at 60°C.     

On the spectral norm of algebraic numbers

In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure $ \overline {\mathbb Q} $ of ? in ?. Let $ \widetilde{\overline{\mathbb{Q}}} $ be the completion of $ \overline {\mathbb Q} $ relative to the spectral norm. We prove that $ \widetilde{\overline{\mathbb{Q}}} $ can be identified with the R‐subalgebra of all symmetric functions of C(G), where C(G) denotes the ?‐Banach algebra of all continuous functions defined on the absolute Galois group G = Gal$ {\overline {\mathbb Q}} / {\mathbb Q} $. We prove that any compact, closed to conjugation subset of ? is the pseudo‐orbit of a suitable element of $ \widetilde{\overline{\mathbb{Q}}} $. We also prove that the topological closure of any algebraic number field in $ \widetilde{\overline{\mathbb{Q}}} $ is of the form $\widetilde{\mathbb{Q}[x]}$ with x in $ \widetilde{\overline{\mathbb{Q}}} $.     

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.     

In‐situ synthesis of transparent and conductive carbon nanotube networks

A method for the production of transparent carbon nanotube networks (CNTNs) over transparent substrates was developed. In this method, CNTNs were grown directly in the target surface by applying the catalyst in specific zones of the substrate through lithographic techniques. The networks can be also transferred from the original substrate to other surfaces. The newly grown carbon nanotubes have a very high aspect ratio (>50000). Thus far, networks with an optical transmittance of 94% at 550 nm and a surface resistivity of 3.6 kΩ/sq have been produced. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nash Equilibria in Noncooperative Predator-Prey Games

A noncooperative game governed by a distributed-parameter predator-prey system is considered, assuming that two players control initial conditions for predator and prey, respectively. Existence of a Nash equilibrium is shown under the condition that the desired population profiles and the environmental carrying capacity for the prey are sufficiently small. A conceptual approximation algorithm is proposed and analyzed. Finally, numerical simulations are performed, too.     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).