基于级联PPMgLN晶体的双倍/三倍频双波长激光器

本文演示了紧凑的绿色和近红外双色连续波激光光源,其发射波长分别为516 nm和775 nm。设计并制造了级联的周期性极化掺镁铌酸锂晶体,用于同时转换通信波长的二次谐波(SHG)和三次谐波(THG),可以在相同温度下获得绿色和近红外激光的输出。通过建立一个单程激光测量系统,在2 W泵浦功率下获得516 nm的0.15 mW绿光和775 nm的1.19 mW的光,晶体温度控制在30.8 ℃。实验结果将为单激光器泵浦的紧凑型双波长共线激光器提供重要的案例。     

一种通过梯形PPMgLN波导倍频实现带宽可调谐光源的理论研究

本文设计了一种梯形的周期极化掺镁铌酸锂(PPMgLN)波导,并通过在传播方向上引入温度梯度来拓宽其倍频(SHG)过程的泵浦光源可接收带宽。通过有限差分的光束传输法,计算波导的有效折射率,并进行波导尺寸的设计。结果表明,通过改变梯形波导不同位置的温度,使其形成一个温度梯度,可拓宽泵浦光源的波长可接收带宽。本文所设计的PPMgLN波导最大泵浦光源可接收带宽为C波段,即1 530~1 565 nm,该波导可倍频C波段,得到输出波段带宽为765~782.5 nm,温度调谐范围为30~150 ℃。     

Dielectric loss and electromagnetic absorption performance study of 1T/2H-MoS2/Mo2S3 nanocomposites with different ratios

High dielectric loss materials have an important application in electromagnetic (EM) absorption fields. In this paper, the ternary nanocomposites: 1T/2H-MoS₂/Mo₂S₃ with heterogeneous interfaces are synthesized by hydrothermal method. XRD, XPS, FTIR, SEM, and TEM measurements are applied to study the structure, morphology, and composition. The frequency spectra of complex permittivity (ε_r-f) are measured in 2–18 GHz by vector network analyzer. The results show that the nanocomposites have higher dielectric loss angle tangents than the reported 2H-MoS₂ absorbers. Based on the ε_r-f spectra, the reflection loss-frequency curves ($RL-f$) are simulated at given thicknesses. An effective absorption bandwidth of 5.2 GHz (12.8–18 GHz) and a $RL$ peak of −29.49 dB are achieved in a thin thickness of 1.62 mm, which are comparable to the reported 2H-MoS₂ absorbers with complex composition, showing that the 1T/2H-MoS₂/Mo₂S₃ nanocomposites have great application potential as an EM wave absorber in the K_u band.     

一种非正交对称条带束流位置监测器设计

介绍了一种条带束流位置监测器(BPM)的设计与仿真方法。在国家同步辐射实验室"太赫兹近场高通量材料物性测试系统"工程项目中,针对波荡器出口处真空室非正交对称性的问题,设计了矩形真空室和跑道形真空室下的两种非正交对称性条带BPM,并与传统的圆形真空室下条带BPM进行对比。基于边界元法,利用MATLAB软件分别对三种真空室下的条带BPM进行建模和仿真。仿真结果表明:相对于传统的圆形真空室下条带BPM,矩形和跑道形真空室下条带BPM灵敏度提高了30%,阻抗匹配误差相对降低了20%,束流位置拟合误差降低了80%。考虑加工精度,矩形真空室下的条带BPM更适用于该工程。     

Digital image correlation in experimental mechanics and image registration in computer vision: Similarities,differences and complements

Digital image correlation and image registration or matching are among the most widely used techniques in the fields of experimental mechanics and computer vision, respectively. Despite their applications in separate fields, both techniques primarily involve detecting the same physical points in two or more images. In this paper, a brief technical comparison of the two techniques is reviewed, and their similarities and differences as well as complements are presented. It is shown that some concepts from the image registration or matching technique can be applied to the digital image correlation technique to substantially enhance its performance, which can help broaden the applications of digital image correlation in scientific research and engineering practice.     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.