Scaling laws for transverse relaxation times

Simple scaling laws are useful tools in understanding the effect of changing parameters in MRI experiments. In this paper the general scaling behavior of the transverse relaxation times is discussed. We consider the dephasing of spins diffusing around a field inhomogeneity inside a voxel. The strong collision approximation is used to describe the diffusion process. The obtained scaling laws are valid over the whole dynamic range from motional narrowing to static dephasing. The dependence of the relaxation times on the external magnetic field, diffusion coefficients of the surrounding medium, and the characteristic scale of the field inhomogeneity is analyzed. For illustration the generally valid scaling laws are applied to the special case of a capillary, usually used as a model of the myocardial BOLD effect.     

Enzymatic Conversion of Flavonoids using Bacterial Chalcone Isomerase and Enoate Reductase

Flavonoids are a large group of plant secondary metabolites with a variety of biological properties and are therefore of interest to many scientists, as they can lead to industrially interesting intermediates. The anaerobic gut bacterium Eubacterium ramulus can catabolize flavonoids, but until now, the pathway has not been experimentally confirmed. In the present work, a chalcone isomerase (CHI) and an enoate reductase (ERED) could be identified through whole genome sequencing and gene motif search. These two enzymes were successfully cloned and expressed in Escherichia coli in their active form, even under aerobic conditions. The catabolic pathway of E. ramulus was confirmed by biotransformations of flavanones into dihydrochalcones. The engineered E. coli strain that expresses both enzymes was used for the conversion of several flavanones, underlining the applicability of this biocatalytic cascade reaction.     

Quantitative Imaging by Optical Diffraction Tomography

Optical diffraction tomography (ODT) is applied to reconstruct the cross-sectional, complex refractive index distribution of cylindrical objects. Experimental reconstructions showing noticeable image contrast for refractive index variations of about 0.001, and having a spatial resolution of about 2 μm, are obtained for objects with cross-sectional diameters of about 100 μm. The results demonstrate that ODT can be used for quantitative imaging of semitransparent fibers.Presented at the International Commission of Optics Topical Meeting, Kyoto, 1994.     

On the 3-Torsion Part of the Homology of the Chessboard Complex

Let 1 ≤ m ≤ n. We prove various results about the chessboard complex M _m,n , which is the simplicial complex of matchings in the complete bipartite graph K _m,n . First, we demonstrate that there is nonvanishing 3-torsion in [(H)\tilde]_d(\sf M_m,n; \mathbb Z){{\tilde{H}_d({\sf M}_{m,n}; {\mathbb Z})}} whenever \fracm+n-43 ￡ d ￡ m-4{{\frac{m+n-4}{3}\leq d \leq m-4}} and whenever 6 ≤ m < n and d = m − 3. Combining this result with theorems due to Friedman and Hanlon and to Shareshian and Wachs, we characterize all triples (m, n, d ) satisfying [(H)\tilde]_d (\sf M_m,n; \mathbb Z) 1 0{{\tilde{H}_d \left({\sf M}_{m,n}; {\mathbb Z}\right) \neq 0}}. Second, for each k ≥ 0, we show that there is a polynomial f _k (a, b) of degree 3k such that the dimension of [(H)\tilde]_k+a+2b-2 (\sf M_{k+a+3b-1,k+2a+3b-1}; \mathbb Z₃){{\tilde{H}_{k+a+2b-2}}\,\left({{\sf M}_{k+a+3b-1,k+2a+3b-1}}; \mathbb Z_{3}\right)}, viewed as a vector space over \mathbbZ₃{\mathbb{Z}_3}, is at most f _k (a, b) for all a ≥ 0 and b ≥ k + 2. Third, we give a computer-free proof that [(H)\tilde]₂ (\sf M_5,5; \mathbb Z) @ \mathbb Z₃{{\tilde{H}_2 ({\sf M}_{5,5}; \mathbb {Z})\cong \mathbb Z_{3}}}. Several proofs are based on a new long exact sequence relating the homology of a certain subcomplex of M _m,n to the homology of M _m-2,n-1 and M _m-2,n-3.     

Routing a mix of conventional,plug-in hybrid,and electric vehicles

We introduce an electric vehicle routing problem combining conventional, plug-in hybrid, and electric vehicles. Electric vehicles are constrained in their service range by their battery capacity, and may require time-consuming recharging operations at some specific locations. Plug-in hybrid vehicles have two engines, an internal combustion engine and an electric engine using a built-in rechargeable battery. These vehicles can avoid visits to recharging stations by switching to fossil fuel. However, this flexibility comes at the price of a generally higher consumption rate and utility cost.To solve this complex problem variant, we design a sophisticated metaheuristic which combines a genetic algorithm with local and large neighborhood search. All route evaluations, within the approach, are based on a layered optimization algorithm which combines labeling techniques and greedy evaluation policies to insert recharging stations visits in a fixed trip and select the fuel types. The metaheuristic is finally hybridized with an integer programming solver, over a set partitioning formulation, so as to recombine high-quality routes from the search history into better solutions. Extensive experimental analyses are conducted, highlighting the good performance of the algorithm and the contribution of each of its main components. Finally, we investigate the impact of fuel and energy cost on fleet composition decisions. Our experiments show that a careful use of a mixed fleet can significantly reduce operational costs in a large variety of price scenarios, in comparison with the use of a fleet composed of a single vehicle class.     

Finiteness of the number of solutions of Plateau’s problem for polygonal boundary curves II

In this article, the author proves that a simple closed polygon can bound only finitely many immersed minimal surfaces of disc-type if it meets the following two requirements: firstly it has to bound only minimal surfaces without boundary branch points, and secondly its total curvature, i.e. the sum of the exterior angles at its N + 3 vertices, has to be smaller than 6π.      

Five-torsion in the homology of the matching complex on 14 vertices

J.L. Andersen proved that there is 5-torsion in the bottom nonvanishing homology group of the simplicial complex of graphs of degree at most two on seven vertices. We use this result to demonstrate that there is 5-torsion also in the bottom nonvanishing homology group of the matching complex on 14 vertices. Combining our observation with results due to Bouc and to Shareshian and Wachs, we conclude that the case n=14 is exceptional; for all other n, the torsion subgroup of the bottom nonvanishing homology group has exponent three or is zero. The possibility remains that there is other torsion than 3-torsion in higher-degree homology groups of when n≥13 and n≠14. Research of J. Jonsson was supported by European Graduate Program “Combinatorics, Geometry, and Computation”, DFG-GRK 588/2.     

LP formulations of the shortest path tree problem

Based on a pair of primal-dual LP formulations of the shortest path tree problem, the first algorithmic approach to reoptimizing the shortest paths subject to changes in the edge weights was proposed by S. Pallottino and M.G. Scutellá in 2003. We shall here focus solely on their introductory sections, propose some simplifications of the models considered, and finally relate the resulting models to the presentation of single-source shortest path problems in textbooks treating this subject with but limited or no reference to LP.Received: April 2004, Revised: August 2004, MSC classification: 90C05, 90C35, 90B10 Dedicated to the memory of Stefano Pallottino     

Exact sequences for the homology of the matching complex

Building on work by Bouc and by Shareshian and Wachs, we provide a toolbox of long exact sequences for the reduced simplicial homology of the matching complex Mn, which is the simplicial complex of matchings in the complete graph Kn. Combining these sequences in different ways, we prove several results about the 3-torsion part of the homology of Mn. First, we demonstrate that there is nonvanishing 3-torsion in whenever , where . By results due to Bouc and to Shareshian and Wachs, is a nontrivial elementary 3-group for almost all n and the bottom nonvanishing homology group of Mn for all n≠2. Second, we prove that is a nontrivial 3-group whenever . Third, for each k?0, we show that there is a polynomial fk(r) of degree 3k such that the dimension of , viewed as a vector space over Z₃, is at most fk(r) for all r?k+2.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .