辐射型漏泄同轴电缆的设计

总结了漏泄同轴电缆的理论研究现状。围绕使用频带和耦合损耗这两个重要电气参数，讨论辐射型漏泄同轴电缆的设计方法。基于周期性槽孔结构的空间谐波的分析，讨论了抑制高次谐波以拓展使用频带的方法。利用时域有限差分方法和Matlab软件计算耦合损耗。     

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.     

泥页岩井壁稳定研究及在临盘地区的应用

从岩石力学和物理化学两个主要因素简要分析了井壁失稳的机理，指出泥页岩井壁失稳是由力学与化学两方面因素共同作用的结果。钻井液与泥页岩存在化学势差，并改变了井壁附近的孔隙压力，降低岩石强度。借助于井壁处有效应力的变化,将泥页岩与钻井液相互作用时页岩水化所产生的力学效应与纯力学效应结合起来，计算出任意井斜方位井眼围岩应力状态，利用测井资料求出有关岩石力学参数和Mohr Couloumb准则，计算得出防塌的临界钻井液密度。     

横泉水库供水发电洞工程地质分析与评价

通过大量野外工程地质勘察与测试工作，在此基础上给出了横泉水库供水发电洞的工程地质分析与评价，从而使该水库的施工有了充分的理论依据。     

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

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

稳压并抑制谐波的新型电源

由于电网谐波污染严重，对谐波的抑制已成为供电部门的重要任务。文章介绍一种既能稳压又能抑制谐波的新型电源，它采用串联型有源电力滤波的方法，通过瞬态电压补偿后可得到纯净的三相正弦平衡电压。     

含氮金刚石结构中Jahn-Teller畸变效应的计算

研究了由J.Bourgoin和M.Lannoo提出的半导体内Jahn-Teller畸变效应的计算理论。应用Bourgoin和Lannoo的方法研究了含中心氮杂质金刚石结构的Jahn-Teller畸变问题,计算了34C+N簇团的T2模耦合沿%111&晶向的Jahn-Teller畸变效应,结果与实验相符。     

溶胶-凝胶法制备Na_2WO_4~-Mn/SiO_2催化剂及其甲烷氧化偶联反应性能的研究

采用溶胶-凝胶法制备了一系列5%Na2WO4-2%Mn/SiO2催化剂;用XRD、XPS、BET、O2-TPD和CO2-TPD等方法对催化剂进行了表征,并考察了对甲烷氧化偶联反应的催化性能。结果表明,与常规浸渍法相比,采用溶胶-凝胶法制备的Na2WO4-Mn/SiO2催化剂中W和Mn的原子浓度在催化剂表面和体相分布较为接近,而且两种制备方法所得的催化剂具有相似的催化性能,Na2WO4与α-方石英之间的相互作用,催化剂释放晶格氧的能力,碱性强弱是影响甲烷氧化偶联活性的关键因素。     

FF现场总线的网段负载能力的设计及计算

从生产安全运行的管理要求；电压压降和电流的限制及信号的衰减；网络运行时间的要求；系统设计的影响；备用能力的考虑等各个方面，结合上海赛科聚苯乙烯项目的具体设计，分析隔爆条件下FF现场总线的H1网段负载能力的设计，以供大家探讨。     

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.