Lysophosphatidic acid induces astrocyte proliferation in hippocampus slices partially through activating extracellular signal-regulated kinases

The goal of the present study is to test the hypothesis that LPA induces proliferation of astrocytes in hippocampus in vivo via phosphorylation of ERK 1/2. We first characterized the expression of GFAP, a special marker fiber protein of astrocytes, in brain slices after direct injection of LPA into hippocampus by immunohistochemistry, and found that LPA induced a remarkable proliferation of astrocytes. Then double-lablled immunofluorescence was used to detect GFAP and phosphorylation ERK 1/2 (p-ERK 1/2), LPA induced an immediate (10 min) and transient (<30 min) phosphorylation of ERK 1/2, and sequence sustained activation of ERK 1/2 was observed, which last for at least 3 weeks after injection of LPA. Reactions are inhibited by U0126, a specific pharmacological mitogen-activated protein kinase (MEK) inhibitor. Laser confocal scanning was used to study spatial relationship of p-ERK and astrocytes. Amazingly, the early (<7 days) phosphorylation of ERK 1/2 is not expressed in astrocytes but in area where neurons and/or in other cell type(s) occupied, expression of p-ERK 1/2 in astrocytes is not detected until 14 days after LPA injection and lasts for at least 3 weeks. Taken together, these data suggest that LPA play an important role in proliferation of astrocytes through phosphorylation of ERK 1/2 in hippocampus. It provides further proof for the functions of LPA in CNS injury, and may contribute to clinical therapy for relative diseases.     

Preliminary experimental study and simulation of an energy-tunable quasi-monochromatic laser-Compton X/γ-ray source

We propose a slanting collision scheme for Compton scattering of a laser light against a relativistic electron beam. This scheme is suitable to generate an energy-tunable X/γ-ray source. In this paper, we present theoretical study and simulation of the spectral, spatial and temporal characteristics of such a source. We also describe two terms laser-Compton scattering (LCS) experiments at the 100 MeV Linac of Shanghai Institute of Applied Physics, where quasi-monochromatic LCS X-ray energy spectra with peak energies of ～30 keV are observed successfully. These preliminary investigations are carried out to understand the feasibility of developing an energy-tunable quasi-monochromatic X/γ-ray source, the future Shanghai Laser Electron Gamma Source.     

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

In this paper, we generalize the inclusion constrained longest common subsequence (CLCS) problem to the hybrid CLCS problem which is the combination of the sequence inclusion CLCS and the string inclusion CLCS, called the sequential substring constrained longest common subsequence   (SSCLCS) problem. In the SSCLCS problem, we are given two strings A$A$ and B$B$ of lengths m$m$ and n$n$, respectively, formed by alphabet Σ$\Sigma$ and a constraint sequence C$C$ formed by ordered strings (C¹,C²,C³,…,C^l)$(C^1,C^2,C^3,\dots ,C^l)$ with total length r$r$. The problem is that of finding the longest common subsequence D$D$ of A$A$ and B$B$ containing C¹,C²,C³,…,C^l$C^1,C^2,C^3,\dots ,C^l$ as substrings and with the order of the C$C$’s retained. This problem has two variants, depending on whether the strings in C$C$ cannot overlap or may overlap. We propose algorithms with O(mnl+(m+n)(|Σ|+r))$O(mnl+(m+n)(\left|\Sigma \right|+r))$ and O(mnr+(m+n)|Σ|)$O(mnr+(m+n)\left|\Sigma \right|)$ time for the two variants. For the special case with one or two constraints, our algorithm runs in O(mn+(m+n)(|Σ|+r))$O(mn+(m+n)(\left|\Sigma \right|+r))$ or O(mnr+(m+n)|Σ|)$O(mnr+(m+n)\left|\Sigma \right|)$ time, respectively—an order faster than the algorithm proposed by Chen and Chao.     

能量连续可调LCS光源SINAP-III

X/γ探测器在航天等国家战略需求领域具有非常广泛和重要的应用。 然而, X/γ探测器要在其有效能区进行精确的标定后才能发挥作用。 目前我国缺乏sub MeV～MeV能量连续可调、 单色性好的γ源, 而用于航天的X/γ探测器无法完成精确定标, 从而使航天探测的发展出现瓶颈问题。 提出了升级原有的激光康普顿散射(LCS)原理性实验装置的方案, 建立了一个通过改变激光入射角来连续调节散射光子能量、 准单色、 极化、 sub MeV～MeV LCS光源(SINAP-III), 从而开拓LCS光源在我国航天领域（如用于航天的X/γ探测器能量定标和抗辐射加固评估研究）的崭新应用前景, 并为将来建设一个基础和应用研究相结合的多功能的γ源实验平台打下基础。 The X/γ detectors in the field of national stratagem, such as astronautical technology, have very broad and important application. These detectors, however, will play their role properly only after accurate calibrations in effective energy region. For the shortage of continuously adjustable and quasi monochromatic γ source in China, it is impossible for the detector employed in aerospace to achieve an accurate calibration so that development of such detector has encountered a big obstacle (or a bottleneck). Therefore, we propose to upgrade the original LCS device to an adjustable photon energy by changing incident angle of laser beam, monochromatic, and polarized sub MeV~MeV LCS γ source(SIMAP III) , in order to explore the new applications of LCS γ source in aerospace as well as to establish a platform for a multifunctional of γ source.     

Computing a longest common subsequence for a set of strings

The known 2-string LCS problem is generalized to finding a Longest Common Subsequence (LCS) for a set of strings. A new, general approach that systematically enumerates common subsequences is proposed for the solution. Assuming a finite symbol set, it is shown that the presented scheme requires a preprocessing time that grows linearly with the total length of the input strings and a processing time that grows linearly with (K), the number of strings, and () the number of matches among them. The only previous algorithm for the generalized LCS problem takesO(K·|S ₁|·|S ₂|·...|S _k |) execution time, where |S _i | denotes the length of the stringS _i . Since typically is a very small percentage of |S ₁|·|S ₂|·...·|S _k |, the proposed method may be considered to be much more efficient than the straightforward dynamic programming approach.     

Yb~(3+):Y_2O_3超细粉体的低温燃烧法合成及发光性能

以稀土硝酸盐和尿素(摩尔分数为1∶3)为原料,采用低温燃烧法在点火温度为600℃,热处理温度为1 100℃,热处理时间为1 h条件下制备了Yb3+∶Y2O3超细粉体。利用X射线粉末衍射仪(XRD)、扫描电子显微镜(SEM)和荧光光谱仪(FS)对粉体进行了表征。研究了点火温度、燃料用量和热处理温度对粉体性能的影响。实验结果表明:所制备的Yb3+∶Y2O3超细粉体的粒径为15～30 nm,颗粒分散性较好,无明显团聚,且粉体的发光性能良好,发射峰位于976,1 030和1 075 nm,适合于制备Yb3+∶Y2O3透明陶瓷。     

Edit distance with move operations

The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of a string represented by a singly linked list (one character per node) and being able to apply these operations to the pointer associated with a vertex as well as the character associated with the vertex. That is, in O(1) time, not only can characters be inserted or deleted, but substrings can be moved or deleted. We limit our attention to the ability to move substrings and leave substring deletions for future research. Note that O(1) time substring move operation implies O(1) substring exchange operation as well, a form of transformation that has been of interest in molecular biology. We show that this problem is NP-complete, and that a “recursive” sequence of moves can be simulated with at most a constant factor increase by a non-recursive sequence. Although a greedy algorithm is known to have poor (a polynomial factor) worst case performance, we present a polynomial time greedy algorithm for non-recursive moves which on a subclass of instances of a problem of size n achieves an approximation factor to optimal of at most O(logn). The development of this greedy algorithm shows how to reduce moves of substrings to moves of characters, and how to convert moves of characters to only inserts and deletes of characters.     

Yb^3＋：Y2O3超细粉体的低温燃烧法合成及发光性能

以稀土硝酸盐和尿素（摩尔分数为1∶3）为原料,采用低温燃烧法在点火温度为600℃,热处理温度为1 100℃,热处理时间为1 h条件下制备了Yb3＋∶Y2O3超细粉体。利用X射线粉末衍射仪（XRD）、扫描电子显微镜（SEM）和荧光光谱仪（FS）对粉体进行了表征。研究了点火温度、燃料用量和热处理温度对粉体性能的影响。实验结果表明：所制备的Yb3＋∶Y2O3超细粉体的粒径为15～30 nm,颗粒分散性较好,无明显团聚,且粉体的发光性能良好,发射峰位于976,1 030和1 075 nm,适合于制备Yb3＋∶Y2O3透明陶瓷。     

Hardness results for the center and median string problems under the weighted and unweighted edit distances

Given a finite set of strings, the Median String problem consists in finding a string that minimizes the sum of the edit distances to the strings in the set. Approximations of the median string are used in a very broad range of applications where one needs a representative string that summarizes common information to the strings of the set. It is the case in classification, in speech and pattern recognition, and in computational biology. In the latter, Median String is related to the key problem of multiple alignment. In the recent literature, one finds a theorem stating the NP-completeness of the Median String for unbounded alphabets. However, in the above mentioned areas, the alphabet is often finite. Thus, it remains a crucial question whether the Median String problem is NP-complete for bounded and even binary alphabets. In this work, we provide an answer to this question and also give the complexity of the related Center String problem. Moreover, we study the parameterized complexity of both problems with respect to the number of input strings. In addition, we provide an algorithm to compute an optimal center under a weighted edit distance in polynomial time when the number of input strings is fixed.