世界各国(或地区)推进RFID的策略

介绍了一些国家和地区发展RFID的政策和推进措施，总结了各国发展RFID的共性。     

一种漂移室定位子性能反常现象的研究

研究了一种漂移室定位子性能的反常现象,它关系到定位子的使用寿命．着重测量了暗电流和随机噪声与时间、高压及温度的关系.     

LZW压缩算法解析及应用设计

ＬＺＷ压缩算法是一种无限压缩算法，它主要是用一种代码来表示数据流中出现的重复串，以达到压缩的目的。     

用Josephson结电子模拟器测量磁通量子2e/h

介绍用Josephson结电子模拟器在政党温度下，模拟测量磁通量子2e/h，用模拟器来研究Josephosn结的特性。该实验可作为普通物理实验中课题设计实验的一个内容。     

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

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

Superconductivity and magnetism in niobium doped YBa2Cu3O7 Related high Tc ceramics

Magnetic characterization has been performed on the members of the cuprateniobate RBa₂Cu₂NbO₈ (R = Pr, Nd, and La) series and R_1.5Ce_0.5Sr₂Cu₂NbO₁₀ (R = Pr, Eu, Nd, and Sm) series. The PrBCNO samples show a signature in the magnetization of a magnetic ordering at 12K. The PrCSCNO sample is nonsuperconducting and shows two distinct orderings at 17K and 53K. No such magnetic phase transition is observed down to 2K in the Nd and La based RBCNO materials or the Nd, Sm, and Eu based RCSCNO materials. Measurements of the lower critical field curve, dc irreversibility line, and critical curent densities are reported for each of the superconducting NdCSCNO, SmCSCNO, and EuCSCNO compounds.     

小型RFCO2激光器的电路保护

本文详细分析研究了小型射频CO2激光器经常出现的故障现象(过压、负载短路故障),并介绍了相应的保护措施,对实际工作有显着指导意义。     

低压铝箔交流腐蚀研究

在３０Ｈｚ频率下，通过铝箔在ＨＣｌ＋Ｈ２ＳＯ４＋ＨＮＯ３＋Ｈ３ＰＯ４体系中的交流腐蚀，研究腐蚀液组成中腐蚀主体及缓蚀剂对铝箔腐蚀的作用，探讨腐蚀过程中电源频率、腐蚀液温度、电流密度及腐蚀时间对铝箔腐蚀的影响。腐蚀液组成的配比恰当，有利于比容的提高。在特定的频率下采用合适的腐蚀液温度、适宜的电流密度和腐蚀时间可以提高铝箔的静电容量。     

离散Hopfield神经网络和联想记忆的开关电流技术实现

研究了离散Ｈｏｐｆｉｅｌｄ神经网络（ＤＨＮＮ）和联想记忆神经网络的开关电流技术实现，利用多权输入跨导，开关电流延迟器（ＳＩＤ）和可编程电流比较器（ＰＣＣ）实现了离散Ｈｏｐｉｅｌｄ神经网络，并提出了利用离散Ｈｏｐｆｉｅｌｄ神经网络实现自联想记忆时相应的开关电流电路，所提出了开关电流神经网络适宜于超大规模集成，能在低电压（如３．３Ｖ）下工作。     

A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion

In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied.