用于波分复用系统的多峰干涉滤光片

介绍了用于波分复用系统的多峰干涉滤光片的设计原理,提出了滤光片透射峰位置的确定方法,讨论了影响滤光片半宽度和截止度的因素,给出了滤光片的膜厚容差分析结果,表明透射率监控标准偏差在<0.5%范围内,可以得到波形良好的多峰滤光片,最后给出了实验结果.     

一种不等带宽光学梳状滤波器

提出了一种新型—Michelson—三面镜FabryPerot型50GHz不等带宽光学梳状滤波器设计方案,分析和模拟表明:该器件将一路信道间隔为50GHz的输入信号分离成信道间隔为100GHz的奇偶两路输出信号,其中在3dB处,奇数信道带宽大于30GHz用于10Gb/s传输,偶数信道带宽大于60GHz用于40Gb/s传输对于将来的40Gb/s系统,该器件具有优势.     

OADM环网的实验研究

研究了光分插复用器(OADM)的关键技术,重点分析了相关的实现技术,完成了利用OADM构建全光环网的实验研究,给出了重要的实验数据,包括眼图、光谱图、光信噪比、保护与恢复等,并对这些实验数据进行了分析,为光传送网的设计与构建提供了重要的参考依据.     

Multimode optical fiber demultiplexer-star coupler using a single gradient-index-rod lens and a multi-facet grating

An optical fiber multi-function device consisting of a single gradient-index-rod lens and a multi-facet blazed reflection grating is proposed to simultaneously realize functions of wavelength demultiplexing and optical signal distribution in a multimode optical fiber transmission system. We analyzed the demultiplexing characteristics and the tolerance of optical components using the ray trace method. This device can realize not only low loss optical signal distribution but also offers improved demultiplexing characteristics in comparison with the previously proposed demultiplexer-multiposition switch. The following characteristics are expected from the design using commercially available optical components: a working band of 0.64–0.88 μm, channel separation of 34–36 nm, 3 dB bandwidth of 27–28 nm, channel cross-talk of less than - 40 dB and minimum excess insertion loss of 0.9–2.1 dB.     

时分复用倍乘光脉冲重复率的新型光纤耦合器环状连接法分析

提出并详细分析了一种基于时分复用技术倍乘光脉冲重复率的方法：在２×２光纤耦合器的一个输入口与一个输出口间，接入时延为脉冲列半周期奇数倍的一段光纤使之形成环状连接循环耦合，而在另一输出口获得光脉冲。详细分析了该系统中光纤耦合器耦合比、插入损耗、时延光纤长度的要求，偏差的影响及其调节法，给出了理论公式、结果的计算机模拟与实验介绍；与经典的马赫陈德尔干涉仪接法及近年提出的Ｓａｇｎａｃ环接法进行了比较。该方法特别适用于对窄脉冲列进行串接复用实现重复率的多次倍乘，从而得到数千兆赫至上百千兆赫的高重复率光脉冲     

单个波长到多个波长的变换实验

报道一种波长变换的新方法.采用此方法不需要任何泵浦光便能够直接将信号光变换成在特定谱宽内的任意多个任意波长的变换光,这对于将来的波分复用光网络提供了较大的方便.此波长变换的原理是利用色散位移光纤的非线性效应产生超连续光谱(SC)信号,由于这种SC信号携带有变换光信号,对这种连续谱进行滤波便能够得到所需要的任意频率的变换信号.此变换方式具有变换频带宽,偏振不敏感的优点。     

A public-key cryptosystem utilizing cyclotomic fields

While it is well-known that the RSA public-key cryptosystem can be broken if its modulusN can be factored, it is not known whether there are other ways of breaking RSA. This paper presents a public-key scheme which necessarily requires knowledge of the factorization of its modulus in order to be broken. Rabin introduced the first system whose security is equivalent to the difficulty of factoring the modulus. His scheme is based on squaring (cubing) for encryption and extracting square (cube) roots for decryption. This introduces a 14 (19) ambiguity in the decryption. Various schemes which overcome this problem have been introduced for both the quadratic and cubic case. We generalize the ideas of Williams' cubic system to larger prime exponents. The cases of higher prime order introduce a number of problems not encountered in the quadratic and cubic cases, namely the existence of fundamental units in the underlying cyclotomic field, the evaluation of higher power residue symbols, and the increased difficulty of Euclidean division in the field.     

Combinatorial and approximative analyses in a spatially random division process

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for the distributions, we consider a simple model which constructs a fractal-like hierarchical network based on random divisions of rectangles. The stochastic process makes a Markov chain and corresponds to directional random walks with splitting into four particles. We derive a combinatorial analytical form and its continuous approximation for the distribution of rectangle areas, and numerically show a good fitting with the actual distribution in the averaging behavior of the divisions.     

“蜡烛火焰划分”实验的局限成因分析及改进研究

人教版初中化学首个探究性实验"蜡烛及其燃烧"明确指出火焰的划分方法，但在实际教学中肉眼观察法和火柴梗燃烧法对蜡烛火焰的划分存在一定的局限性。采用文献研究法和实验验证法分析其局限性的成因——燃料的析炭能力强弱、材料结构的不同等，并提出相应的改进建议。     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.