电流并联负反馈放大器实验的研究

用实验的方法，研究电流并联负反馈对放大器性能的改善，提出电流型、并联型负反馈放大器性能参数的测量方法。     

集成对数放大器

对数放大器由于其特殊的性能而在雷达接收机，通信、遥控和激光测距系统中具有十分广泛的用途。详细叙述了对数放大器的性能，特性，介绍了几种主要的对数放大器类型及其工作原理，考查了国外对数放大器的发展情况，介绍了国内集成对数放大器的主要性能指标及其用途。。     

SOI全介质隔离与高频互补双极兼容工艺

ＳＯＩ材料的全介质隔离技术与高频互补双极工艺的结合是研制抗辐照能力强、频带宽、速度高的集成运算放大器的理想途径，从实验的角度提出了一种ＳＯＩ材料全介质隔离与高频互补双极工艺兼容的工艺途径。     

可见光共振腔发光二极管的研究进展

共振腔发光二极管是一种具有优良发光性能的光电器件。概述了对可见光共振腔发光二极管的共振腔结构、反射镜材料体系、基本工作机理和发光特性，并展望了这种器件的发展前景。     

基于CDBA的电流模式多功能滤波器

文章提出了一种由电流差分缓冲放大器（CDBA）实现的两种电流模式多功能双二次滤波器，该滤波器具有可实现多种滤波功能、能独立地调节ω0和Q、灵敏度较低等特点。     

光纤放大器增益饱和对有源光纤环形腔滤波特性的影响

从理论和实验两个方面研究了有源光纤环形腔滤波器输入光功率对光纤放大器增益的影响及由此引起的对有源光纤环形腔滤波特性的影响。在考虑上述影响的情况下 ,对有源光纤环形腔滤波器参数的优化作了讨论     

高精度的光纤衰减系数测试系统的设计

利用常规仪器设备，设计了一套集光、机、电为一体的光纤衰减测量,实现了数字化监测显示，并可与微机接口；采用双光路法，消除了由于光源光强不稳定产生的误差。     

An ASE Reduction Filter Using Cascaded Optical Fiber Grating Couplers in EDFA Repeater

A new configuration for an ASE reduction filter in EDFA repeaters for WDM optical transmission systems using optical fiber grating couplers (FGCs) was proposed and first demonstrated. The filtering characteristics of the proposed filter for amplified single wavelength signal and 2-channel WDM signals using EDFA were identified. It was found that the filter was effective to improve SNR in optical domain by reducing ASE noise. The required FGC characteristics for the filter were theoretically predicted under the condition that the total filter loss did not exceed 3 dB. More than 70% of drop efficiency was required in each FGC for the application of the proposed filter to an 8-channel WDM system using EDFA repeaters.     

清华物理系量子信息研究的新进展

在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004