基于数字图像处理方法的焦距测量技术研究

介绍了基于数字图像处理方法测量透镜焦距的玻罗板分划线快速自动甄别法。该图像处理方法鲁棒性好,采用Canny法进行分划线边缘检测。用重心法计算所有线条的重心,从重心往两边搜索线条,判断选取间隔大的刻划线对,可以提高测量精度。实验数据表明该方法的相对测量不确定度能达到8.5×10-4。为实现以数字图象处理为基础的焦距客观测量提供了一种可行的技术途径。     

GeO2-Bi2O3-MOx(MOx=WO3, BaO)玻璃近红外超宽带发光的研究

用高温熔融法制备了(99.5-χ) GeO₂-χBaO-0.5Bi₂O₃(χ=3, 6, 9mol%)与(99.5-φ)GeO₂-φWO₃-0.5Bi₂O₃(φ=3，6，9mol%)玻璃，测定了样品的发射光谱(800nmLD激发)、吸收光谱、荧光衰减和差热曲线.实验结果表明，在GeO₂-WO₃-Bi₂O₃系统玻璃中，随着WO₃含量的增加，在1260nm处的发光强度增强，荧光半高宽(FWHM)增宽，荧光寿命增长，而且玻璃的吸收边带发生明显的红移；在GeO₂-BaO-Bi₂O₃系统玻璃中，随着BaO含量的增加，玻璃在1290nm处发光强度增强，FWHM增宽，荧光寿命增长，吸收边带也有明显的红移.从吸收边带发生红移的情况，结合发射光谱和荧光衰减曲线特性，我们推断玻璃样品在近红外的宽带发光可能由Bi⁵⁺离子所引起.从荧光特性估算了玻璃的σ_p×τ和σ_p×Δλ值，这些玻璃均具有较小的σ_p×τ和较大的σ_p×Δλ特性，说明GeO₂-Bi₂O₃-MO_x(MO_x=WO₃, BaO) 系统玻璃是研制成近红外(O到S波段)超宽带光纤放大器的良好材料.     

Simple Analog Complementary Metal Oxide Semiconductor Circuit for Generating Motion Signal

We proposed in this study a novel analog complementary metal oxide semiconductor (CMOS) circuit for generating a motion signal when an object moves, which is a simple structure. The proposed unit circuit was constructed using a previously proposed edge detection circuit and a novel proposed circuit for generating a motion signal which accepts an edge signal. The part for generating the motion signal was constructed using six metal oxide semiconductor (MOS) transistors and one capacitor. Results obtained by the simulation program with integrated circuit emphasis (SPICE) and the measured results of a test circuit constructed with discrete MOS transistors and the test circuit fabricated with a 1.2 μm CMOS process showed that the proposed unit circuit can output pulsed current (motion signal) when an object moves on the circuit. It was clarified from the SPICE results that the two-dimensional network constructed with proposed unit circuits can output motion signals. The size of the novel unit circuit is expected to be about 110 × 110μm² obtained by the 1.2 μm CMOS process. It is possible to arrange 90 × 90 unit circuits on a chip which has an area of 1 × 1cm². The aperture ratio is expected to be about 21%, which is twice as large as that of the previously proposed circuit. An integrated circuit for image processing in real time can thus be realized by applying the two-dimensional network constructed with the proposed circuits.     

Exciton spectra of layered PbI<Subscript>2</Subscript> and PbI<Subscript>2</Subscript>:Zr crystals

We have analyzed the surface morphology of single crystal samples of lead diiodide and studied the absorption edge and the temperature variation of their photoluminescence spectra. We have established that the zirconium impurity is uniformly incorporated into the crystal lattice of the samples and promotes appreciable quenching of photoluminescence due to formation of electron traps. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 252–257, March–April, 2007.     

干涉条纹边缘检测方法的比较与改进

研究了干涉条纹边缘检测中的Sobel算子和Laplacian算子,针对二者使干涉条纹变粗和模糊的现象,提出了改进的Laplacian算子。该改进算子先对干涉条纹利用Gauss函数进行平滑,然后再作Laplacian变换。实验结果表明,改进的Laplacian算子克服经典算子的不足,获得清晰的条纹边缘,满足了干涉条纹后续处理要求。     

Coloring plane graphs with independent crossings

We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184–205, 2010     

Characterization of graphs with infinite cyclic edge connectivity

In this paper, we characterize the graphs with infinite cyclic edge connectivity. Then we design an efficient algorithm to determine whether a graph has finite cyclic edge connectivity or infinite cyclic edge connectivity.     

Influence of the capillarity on a creeping film flow down an inclined plane with an edge

Summary In creeping flows of thin films, the capillarity can play a dominant role. In this paper, the creeping film flow down an inclined plane with an edge is considered. The influence of the capillarity on the velocity and the film surface is studied analytically, numerically and experimentally. Received 12 April 1999; accepted for publication 9 May 1999     

Path coupling using stopping times and counting independent sets and colorings in hypergraphs

We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree Δ of a vertex and the minimum size m of an edge satisfy m ≥ 2Δ + 1. We also show that the Glauber dynamics for proper q‐colorings of a hypergraph mixes rapidly if m ≥ 4 and q > Δ, and if m = 3 and q ≥ 1.65Δ. We give related results on the hardness of exact and approximate counting for both problems. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008