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

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

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

利用声波控制超短脉冲的色散

 声光互作用器件声光可编程色散滤波器（AOPDF）是一种实时的色散补偿器件，它可用于飞秒啁啾脉冲放大系统。通过耦合模理论推导，得到了输出脉冲的群延迟与调制声波的频率、啁啾、带宽等参数的关系，并且对用2.5cm长的LiNbO₃作为声光晶体的AOPDF补偿飞秒光脉冲的色散进行了数值模拟，得到了对中心波长为800 mm的钛宝石飞秒激光色散补偿特性及所需声波的频率和啁啾参数。     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.     

FI代数的滤子

研究FI代数的滤子理论，建立F滤子、P滤子、Q滤子、C滤子之间的联系．     

基于新型长周期光纤光栅的掺铒光纤放大器

报道了基于高频CO₂激光脉冲写入的新型长周期光纤光栅的低噪音掺铒光纤放大器,这种新型长周期光纤光栅是用大约几千Hz的高频CO₂激光脉冲对光纤玻璃热冲击作用而形成的.在铒纤中插入一个长周期光纤光栅,会明显减少掺铒光纤放大器的放大自发辐射(ASE)噪音.报道了两种低噪音掺铒光纤放大器,作为前置放大器和线路放大器,它们的ASE噪音指数分别从4.0 dB减少到3.5 dB和从4.8 dB减少到4.3 dB,并且在作为线放时,其小信号增益从30 dB提高到37 dB,降噪及提高增益效应十分显著.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.