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.     

Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.     

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

设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)的方法.     

Interruptible Exact Sampling in the Passive Case

We establish, for various scenarios, whether or not interruptible exact stationary sampling is possible when a finite-state Markov chain can only be viewed passively. In particular, we prove that such sampling is not possible using a single copy of the chain. Such sampling is possible when enough copies of the chain are available, and we provide an algorithm that terminates with probability one.     

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

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

A lattice boltzmann model for compressible perfect gas

A new lattice Boltzmann model for compressible perfect gas is proposed. The numerical example shows that it can be used to simulate shock wave and contact discontinuity. The results are comparable with those obtained by traditional methods. The ratio of specific heats γ may be chosen according to the requirement of problems. The project supported by the National Natural Science Foundation of China     

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.     

Modified classification of non-self-adjoint second-order difference equations

This paper is concerned with the classification of non-self-adjoint second-order difference equations. The relationship between the number of summable solutions of non-self-adjoint difference equations and that of the discrete linear Hamiltonian system is discussed. A classification for non-self-adjoint second-order difference equations is established, which is independent of the choice of the rotated half plane and the fixed point.