掺镱双包层高功率光纤激光器输出特性研究

对线形腔掺镱双包层高功率光纤激光器的输出特性进行了研究 ,通过求解速率方程 ,得到了激光器泵浦阈值功率、输出光功率和斜率效率的表达式。分析了光纤长度、腔镜反射率和泵浦波长等因素对激光器阈值功率、输出光功率和斜率效率的影响 ,为高功率光纤激光器的优化设计提供了理论依据     

Methods of Verifying Continuous Automatic Belt Weighers: State and Prospects

The basic methods of verifying continuous automatic belt weighers are described. A comparative analysis of these methods on the basis of experimental studies is made and ways of implementing the results in industry are recommended.     

马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

储层泥浆侵入深度预测方法研究

泥浆侵入半径的确定尚缺乏严格的验证标准.以油水两相渗流理论和离子扩散方程为基础,结合储集层特点,研究了不同储层参数下泥浆滤液对地层的侵入特性.数值模拟侵入时间选取10 d和20 d.数值模拟结果表明,侵入半径在渗透率不变的情况下随孔隙度的增大而减小,在孔隙度不变的情况下随渗透率的增大而增大;当渗透率和孔隙度都发生变化时,泥浆侵入半径一般随孔隙度的增加呈幂函数增加.依据这种关系对测井资料约束处理,得到的泥浆侵入半径较客观地反映了地层的真实情况.     

循环伏安法在润滑油检测中的应用

介绍了循环伏安法的产生背景、原理。应用该技术可以快速、方便地对润滑油中抗氧剂、总酸（碱）值进行测定，并且可以对不同厂家润滑油的抗氧剂包进行区别。该技术还可以有效地评价润滑油的使用寿命和设备工作状况。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

Organic Nanoparticles: Preparation,Self‐Assembly,and Properties

The strong tendency of organic nanoparticles to rapidly self‐assemble into highly aligned superlattices at room temperature when solution‐cast from dispersions or spray‐coated directly onto various substrates is described. The nanoparticle dispersions are stable for years. The novel precipitation process used is believed to result in molecular distances and alignments in the nanoparticles that are not normally possible. Functional organic light‐emitting diodes (OLEDs)—which have the same host–dopant emissive‐material composition—with process‐tunable electroluminescence have been built with these nanoparticles, indicating the presence of novel nanostructures. For example, only changing the conditions of the precipitation process changes the OLED emission from green light to yellow.     

Pathogenicity of three species of entomopathogenic nematodes to some major stored-product insect pests

Entomopathogenic nematodes (Nematoda: Heterorhabditidae and Steinernematidae) are commonly used biological control agents of insects in cryptic habitats, but their potential for suppressing stored-product insects in these habitats has not been explored previously. Here, we provide data from the first step in a program to evaluate entomopathogenic nematodes in the genus Steinernema as biological control agents of stored-product pests by determining their pathogenicity to some of the major stored-product pest species. When evaluated against larvae, pupae and adults of six pest species (Plodia interpunctella, Ephestia kuehniella, Oryzaephilus surinamensis, Tenebrio molitor, Tribolium castaneum, and Trogoderma variabile), and the adults of two additional pest species (Sitophilus oryzae and Rhyzopertha dominica), Steinernema riobrave was either the most pathogenic or of similar pathogenicity compared to S. carpocapsae and S. feltiae. A dose of 10 infective juveniles of S. riobrave caused 80% or higher mortality against larvae of P. interpunctella, E. kuehniella, T. castaneum, and O. surinamensis, pupae of T. castaneum and T. molitor, and adults of T. molitor and the two moth species. All stages of Trogoderma variabile exhibited 70% or higher mortality. Adults of S. oryzae and R. dominica exhibited low susceptibility with 15% and 35% mortality, respectively. On the basis of these results, S. riobrave was selected for further evaluation under more field-like conditions.