全固态多波长飞秒脉冲激光系统

利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点.     

高压电场作用下乙醇-水溶液体系变化红外光谱分析

本文报道了用红外光谱分析电磁场作用下乙醇 水溶液体系变化情况。分析结果表明 :当乙醇溶液受到 2 0kV·cm- 1 的交变电磁场处理 (5 0Hz)时 ,分子之间的氢键缔合先增大后减少 ;高乙醇含量溶液受到同样强度电场较长时间处理时 ,有乙醇发生氧化反应 ,从红外谱中可看到νCO 峰及ν(OH) (H2 O) 峰的出现 ;经处理后的溶液自然放置 7天再测定 ,其红外谱图基本保持不变。文中对各出现变化的峰进行了分析 ,并对其机理进行了推导     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

High Voltage Pulse Power and the Technics for the Capacitor Power-Storage Type

Lower hybrid wave （LHW）, electro cyclotron （EC） and neutral beam injection （NBI） etc. are the important methods of auxiliary heating. They would be devoted to the HL-2A tokamak step by step. In order to satisfy the debug of each system and the need of the experiment, the system should be equipped with high voltage pulse power （HVPP） according to the requirement.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Unusual current‐voltage characteristics of single crystalline and bicrystalline La0.7Ca0.3MnO3 films

The current‐voltage characteristics of single crystalline and bicrystalline La_0.7Ca_0.3MnO₃ films were measured and analyzed. Several epitaxial films, as well as 45° [001]‐tilt grain boundaries, display current‐voltage characteristics which are asymmetric with respect to polarity reversal of the bias current. One epitaxial film has a polarity dependent resistance of ～340kΩ and of ～670kΩ in forward and in reverse direction, respectively.     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

吴消元法在精确求解电力系统潮流方程中的应用

应用吴消元法求得算例系统潮流方程的全部精确解，得到了其他方法难以得到的完整的Py、Qy曲线，包括低压运行曲线，并通过平衡点稳定性分析，得到节点电压状态参数空间中平衡点稳定与不稳定的区域分界．阐述了系统受大扰动后过渡到低电压运行状态的可行性，为电压失稳机理的探明提供了依据．     

高压沿面放电烟气脱硫技术动态实验研究

本文针对高压沿面放电活化气体的烟气脱硫技术,在静态实验研究的基础上进行了实验室冷态动态的实验研究。设计了便于反应和测量的动态实验装置。实验解释了电子束法脱硫技术中导致氨气泄漏的部分原因,验证了高压沿面放电脱硫技术可以在较低的运行电压下,达到提高脱硫效率,减少氨气泄漏的作用。     

单循环赛赛程安排的一个图论方法

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案