Incidence of apparent restricted diffusion in three different models of cerebral infarction

High speed magnetic resonance imaging (MRI) and short diffusion times are used to investigate the appearance of restricted diffusion in three different models of cerebral infarction. The models are: the middle cerebral artery occlusion (MCAO) model in the rat, the carotid occlusion model in the gerbil, and the Rose Bengal microvascular occlusion model in the rat. All three were investigated for 16 b-values equally spaced between 10 and 1510 s/mm² using two distinct experiments. In the ct (constant time) experiment, the diffusion time was held constant at 11.7 ms while the b-value was varied with the gradient strength. In the cg (constant gradient) experiment, the gradient strength was held constant and the b-value increased by varying the diffusion time from 4.4 to 11.7 ms. A monoexponential decay of the signal intensity with b-value in the ct experiment accompanied by nonmonoexponential (NME) decay in the cg experiment is indicative of restricted diffusion. As this phenomenon is detectable only at short diffusion times, it cannot be due to restriction by impermeable membranes, and we have thus termed this apparent restriction. For the MCAO model and the carotid occlusion model, apparent restriction was found both inside the infarct territory and in some regions outside it. No definite evidence for restriction was found for the Rose Bengal model, which was, however, only studied from 24 h post-insult.     

Breather trapping and breather transmission in a DNA model with an interface

We study the dynamics of moving discrete breathers in an interfaced piecewise DNA molecule. This is a DNA chain in which all the base pairs are identical and there exists an interface such that the base pairs dipole moments at each side are oriented in opposite directions. The Hamiltonian of the Peyrard-Bishop model is augmented with a term that includes the dipole-dipole coupling between base pairs. Numerical simulations show the existence of two dynamical regimes. If the translational kinetic energy of a moving breather launched towards the interface is below a critical value, it is trapped in a region around the interface collecting vibrational energy. For an energy larger than the critical value, the breather is transmitted and continues travelling along the double strand with lower velocity. Reflection phenomena never occur. The same study has been carried out when a single dipole is oriented in opposite direction to the other ones. When moving breathers collide with the single inverted dipole, the same effects appear. These results emphasize the importance of this simple type of local inhomogeneity as it creates a mechanism for the trapping of energy. Finally, the simulations show that, under favorable conditions, several launched moving breathers can be trapped successively at the interface region producing an accumulation of vibrational energy. Moreover, an additional colliding moving breather can produce a saturation of energy and a moving breather with all the accumulated energy is transmitted to the chain.     

构造相应于有限维非退化可解李代数的顶点代数

设g是带有非退化不变对称双线性型的有限维可解李代数，该文首先应用g的仿射李代数g的表示理论，构造出一类水平为l的限制g-模Vg（l，0）．然后应用顶点算子的局部理论在hom（Vg（l，0），Vg（l，0）（（x）））中找到一类顶点代数Lvg（l，0）．建立了LVg（l，0）到Vg（l，0）的映射，最后证明了这类映射是顶点代数同构．     

具有三角分解李代数的积分元和中心扩张

本文将应用广义限制李代数的概念来研究具有三角分解李代数的积分元和中心扩张的关系.对于给定的广义限制普遍包络代数,我们确定了它的积分元并且提供了一种计算dim H2(L,F)的方法.     

深海远程正交频分复用水声通信簇约束的分布式 压缩感知信道估计*

在深海远程正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)水声通信中,信道时延较长,导致信道频率选择性衰落严重,传统的压缩感知信道估计算法性能大幅下降。为此,本文利用深海远程信道在一定时间内具有相关性并呈较稳定簇状分布的特点,在分布式压缩感知信道估计中引入簇区域信息,进行簇约束的多数据块联合稀疏信道估计,提出一种簇约束的分布式压缩感知信道估计方法,并在深海开展了定点远程水声通信实验进行验证,实验结果表明,与传统的分布式压缩感知信道估计算法相比,本方法的能够降低50%左右的误码率。     

The annular twist mapping of the restricted three-body problem

This paper presents a new derivation of the twist mapping in the planar restricted problem. It differs from other treatments in the use of a novel canonical transformation which allows for the utilization of symplectic reduction techniques.     

限制pre-李代数

研究限制pre-李代数的结构,给出了限制pre-李代数和可限制pre-李代数的定义,得到了限制pre-李代数的p-映射性质和可限制pre-李代数的性质,还讨论了带有半单元的限制pre-李代数及拟环面限制pre-李代数和分解唯一性定理.     

Monte Carlo Simulations of Observation Time-Dependent Self-Diffusion in Porous Media Models

Observation time-dependent self-diffusion coefficients can be used to obtain microstructural information of porous media. This paper presents two different kinds of Monte Carlo simulations of the self diffusion process of fluids like water in porous systems, a lattice-free method and a lattice-based method. The results for simple porous media model geometries agree well with each other and with published analytical as well as semi-analytical equations. The use of these equations, which are important for the interpretation of Pulsed Field Gradient-Nuclear Magnetic Resonance (PFG-NMR) time-dependent diffusion data with respect to properties of porous media, is discussed.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

A comparison of neighbor search algorithms for large rigid molecules

Fast determination of neighboring atoms is an essential step in molecular dynamics simulations or Monte Carlo computations, and there exists a variety of algorithms to efficiently compute neighbor lists. However, most of these algorithms are general, and not specifically designed for a given type of application. As a result, although their average performance is satisfactory, they might be inappropriate in some specific application domains. In this article, we study the case of detecting neighbors between large rigid molecules, which has applications in, e.g., rigid body molecular docking, Monte Carlo simulations of molecular self-assembly or diffusion, and rigid body molecular dynamics simulations. More precisely, we compare the traditional grid-based algorithm to a series of hierarchy-based algorithms that use bounding volumes to rapidly eliminate large groups of irrelevant pairs of atoms during the neighbor search. We compare the performance of these algorithms based on several parameters: the size of the molecules, the average distance between them, the cutoff distance, as well as the type of bounding volume used in the culling hierarchy (AABB, OBB, wrapped, or layered spheres). We demonstrate that for relatively large systems (> 100,000 atoms) the algorithm based on the hierarchy of wrapped spheres shows the best results and the traditional grid-based algorithm gives the worst timings. For small systems, however, the grid-based algorithm and the one based on the wrapped sphere hierarchy are beneficial.