HT-7װ�õ��ӻ�������ϵͳ�������߸Ľ�

为了提高HT-7装置上等离子体电子回旋辐射(ECE)超外差诊断系统的极向分辨率,根据高斯光学原理,分析了诊断系统天线的改进方案。优化了天线的圆形角锥喇叭尺寸和凸透镜参数以及在装置上的相对位置,使天线接收到的等离子体ECE异常模二次谐波辐射的高斯光束束半径只有30mm左右,能量的高斯光学性质损失不大于13%。     

中强震的前兆地声

本文报道了滦县五级震前卢龙台站和昌黎台站的震前地声记录。从地声源的强度出发,作者对地声传播的可能距离作了初步分析。分析表明,地声一般不是来自震源,而是来自观测站附近的地下。从而说明彼此相距较远的观测站,其接收信号序列是不相关的。但由于震源体与震级成正比的关系,对于较大地震,我们仍可能在较大范围内和较早的时候收到前兆信息。     

数码照相法测量离子交换平面光波导损耗特性

利用数码相机对离子交换平面玻璃光波导传输线进行数字成像,根据传输线上的光强分布拟合出光强传输衰减曲线,计算出波导的传输损耗.对光波导进行退火处理,研究了波导退火前后的传输损耗特性.退火后0阶模式下传输损耗由2.148 9 dB·cm-1降为0.746 0 dB·cm-1.结果表明,波导的传输损耗是随着模阶数的增加而递增,适当的退火处理明显改善了离子交换波导的质量.     

数码照相法测量离子交换平面光波导损耗特性

利用数码相机对离子交换平面玻璃光波导传输线进行数字成像,根据传输线上的光强分布拟合出光强传输衰减曲线,计算出波导的传输损耗.对光波导进行退火处理,研究了波导退火前后的传输损耗特性.退火后0阶模式下传输损耗由2.148 9 dB·cm－1降为0.746 0 dB·cm－1.结果表明,波导的传输损耗是随着模阶数的增加而递增,适当的退火处理明显改善了离子交换波导的质量.     

Boolean Lattices: Ramsey Properties and Embeddings

A subposet Q ^′ of a poset Q is a copy of a poset P if there is a bijection f between elements of P and Q ^′ such that x ≤ y in P iff f(x) ≤ f(y) in Q. For posets P, P ^′, let the poset Ramsey number R(P, P ^′) be the smallest N such that no matter how the elements of the Boolean lattice Q _N are colored red and blue, there is a copy of P with all red elements or a copy of P ^′ with all blue elements. We provide some general bounds on R(P, P ^′) and focus on the situation when P and P ^′ are both Boolean lattices. In addition, we give asymptotically tight bounds for the number of copies of Q _n in Q _N and for a multicolor version of a poset Ramsey number.     

A note on short cycles in a hypercube

How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erd?s about 27 years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still unresolved. Let f(n,C_l) be the largest number of edges in a subgraph of a hypercube Q_n containing no cycle of length l. It is known that f(n,C_l)=o(|E(Q_n)|), when l=4k, k?2 and that . It is an open question to determine f(n,C_l) for l=4k+2, k?2. Here, we give a general upper bound for f(n,C_l) when l=4k+2 and provide a coloring of E(Q_n) by four colors containing no induced monochromatic C₁₀.     

Exact Bounds on the Sizes of Covering Codes

A code c is a covering code of X with radius r if every element of X is within Hamming distance r from at least one codeword from c. The minimum size of such a c is denoted by c _r(X). Answering a question of Hämäläinen et al. [10], we show further connections between Turán theory and constant weight covering codes. Our main tool is the theory of supersaturated hypergraphs. In particular, for n > n ₀(r) we give the exact minimum number of Hamming balls of radius r required to cover a Hamming ball of radius r + 2 in {0, 1}ⁿ. We prove that c _r(B _n(0, r + 2)) = _{1 i r + 1} ( ^{(n + i – 1) / (r + 1) 2}) + n / (r + 1) and that the centers of the covering balls B(x, r) can be obtained by taking all pairs in the parts of an (r + 1)-partition of the n-set and by taking the singletons in one of the parts.     

“神光”装置的激光能量测量

本文叙述了在神光装置中测量激光能量的体吸收能量计的特点,给出了其工作参数。实测了神光装置中激光系统末级输出能量、激光系统前部和中部定点发射能量及激光系统放大的自发辐射能量。并作了分析和讨论。     

单粒子气溶胶的基质辅助激光解吸电离研究

单粒子气溶胶的基质辅助激光解吸/电离飞行时间质谱技术具有快速在线检测环境大气生物气溶胶的潜力.以a-环糊精为分析物,实验研究了吡啶羧酸、2,5-二羟基苯甲酸、芥子酸、阿魏酸四种常用基质材料的效果,考察基质与分析物的摩尔比对分析物单粒子激光质谱信号的影响.实验结果表明阿魏酸做基质时质谱命中率及分析物质谱信号峰检测效率最高,吡啶羧酸做基质时的分析物质谱信号峰激发率最高,信号峰强度最强.吡啶羧酸对分析物摩尔比为100:1时,分析物质谱信号检测效率最高.     

On the editing distance of graphs

An edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs , the editing distance from G to is the smallest number of edge‐operations needed to modify G into a graph from . In this article, we fix a graph H and consider Forb(n, H), the set of all graphs on n vertices that have no induced copy of H. We provide bounds for the maximum over all n‐vertex graphs G of the editing distance from G to Forb(n, H), using an invariant we call the binary chromatic number of the graph H. We give asymptotically tight bounds for that distance when H is self‐complementary and exact results for several small graphs H. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:123–138, 2008