太赫兹脉冲焦平面成像技术的发展与应用

作为太赫兹技术中的重要组成部分,太赫兹脉冲焦平面成像一经问世就引起了行业内的广泛关注,人们引入了各种方法去提升此成像技术的测量性能,同时也尝试将此成像技术应用于不同的工业和基础研究领域。本文综述了近年来人们对太赫兹脉冲焦平面成像的技术改良和应用研究,包括提升成像系统的空间分辨率、信噪比、信息获取能力,以及将此成像技术应用于光谱识别检测、超表面器件功能验证、太赫兹特殊光束测量、太赫兹表面波观测等,希望该综述能够推动太赫兹脉冲焦平面成像的进一步技术革新和应用拓展。     

埋地管道泄漏内封堵装置设计与研究

针对流体输送埋地管道泄漏问题,设计了一种利用管道机器人携带封堵气囊进行快速应急封堵修复的埋地管道泄漏内封堵装置。采用矩阵变换方法建立了牵引系统驱动轮过弯方程,利用MATLAB软件对过弯方程进行了验证,同时利用ADAMS软件仿真分析过弯路径与驱动轮转角对牵引系统行走速度的影响。研究结果表明:由两个串联封堵器组成的应急封堵系统可满足复杂工况下的管道泄漏封堵要求;牵引系统驱动轮在弯管内部行走时,单轮速度呈周期性变化,但三个驱动轮整体周期运动特性一致;驱动轮转角在25°~40°时,牵引系统行走速度与驱动轮转角成正比,且转角为30°时驱动效果最好。该内封堵装置的结构设计可为管道泄漏应急封堵领域装备的研发提供重要参考。     

Corrosion morphology of AZ91D exposed in an atmospheric environment

The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before.     

己二胺装置精馏工序的模拟及扩产改造研究

为了扩大己二胺生产装置的生产能力,运用PRO／Ⅱ流程模拟系统,在分析PRO／Ⅱ系统提供的多元物系的物性基础上,采用改进后的Wilson方程,对己二胺精馏工序生产装置进行模拟分析,与生产实际数据对比表明,该方法计算结果正确;对扩产后的装置进行模拟计算,为己二胺生产装置的扩产改造提供依据;对己二胺精馏工序进行了水力学计算,确定了改造方案。投产后的生产结果表明,己二胺的生产能力达到了50kt／a。     

Performance and Commercial Application of the Promoter LCC-A for Maximization of Propylene Yield

1 Introduction Propylene as an important feedstock for organic chemicals is mainly originated from steam cracking and catalytic cracking processes. During the FCC process the propylene content varies with the FCC catalyst and process technology adopted, resulting in significant difference in propylene concentration in the cracked product——LPG. The conventional FCC pro- cess generally gives a propylene yield of around 4%, while the FCC process with maximization of propylene yield can in…     

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.     

基于CB的串行口和接口板端口程序应用

串行口及接口板端口是计算机通信的主要途径 ,也是目前计算机工程测控中通用的基本方法。C Builder (简称CB)编程语言以其功能完备、开发效率高的特点而成为目前流行的程序开发工具 ,介绍了利用CB语言编写串行口和端口通信的程序的方法 ,并对具体的各方法编写了相应的示例。     

一种基于空间到达角的卫星电子侦察信号分选方法

在建立简化的卫星电子侦察空间模型的基础上，提出了一种利用空间到达角分选卫星电子侦察信号的新方法。通过仿真实验验证了这种方法的可行性。该方法可用于密集信号的预处理。     

Blind feedforward cyclostationarity-based timing estimation for linear modulations

By exploiting a general cyclostationary (CS) statistics-based framework, this letter develops a rigorous and unified asymptotic (large sample) performance analysis setup for a class of blind feedforward timing epoch estimators for linear modulations transmitted through time nonselective flat-fading channels. Within the proposed CS framework, it is shown that several estimators proposed in the literature can be asymptotically interpreted as maximum likelihood (ML) estimators applied on a (sub)set of the second- (and/or higher) order statistics of the received signal. The asymptotic variance of these ML estimators is established in closed-form expression and compared with the modified Crame/spl acute/r-Rao bound. It is shown that the timing estimator proposed by Oerder and Meyr achieves asymptotically the best performance in the class of estimators which exploit all the second-order statistics of the received signal, and its performance is insensitive to oversampling rates P as long as P/spl ges/3. Further, an asymptotically best consistent estimator, which achieves the lowest asymptotic variance among all the possible estimators that can be derived by exploiting jointly the second- and fourth-order statistics of the received signal, is also proposed.     

分布式光纤拉曼放大器的增益平坦设计

介绍了在波分复用（WDM）系统中分布式光纤拉曼放大器（FRA）的理论分析模型。在此基础上，对增益平坦设计所需考虑的因素进行了分析；最后通过试验证明了它的有效性。