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.     

Synthesis of amphiphilic magnetic microspheres by dispersion copolymerization of styrene and poly(ethylene oxide) macromonomer

Amphiphilic magnetic microspheres ranging in diameter from 5 to 100 µm were prepared by dispersion copolymerization of styrene and poly(ethylene oxide) vinylbenzyl (PEO‐VB) macromonomer (MPEO) in the presence of Fe₃O₄ magnetic fluid. The effects of various polymerization parameters on the average particle size were systematically investigated. The average particle size was found to increase with increasing styrene concentration and initiator concentration. It also increased with decreasing stabilizer concentration and molecular weight of MPEO. The content of the hydroxyl groups localized in the microspheres ranged from 0.01 to 0.2 mmol g^?1. © 2003 Society of Chemical Industry     

Degree-of-polarization and eye-closure penalty associated with optical signals with orthogonal polarizations

We perform a systematic measurement of the degree-of-polarization (DOP) and eye-closure penalty for optical signals with orthogonal polarizations. We find that the symmetry of DOP is maintained for the orthogonal polarizations under both first and higher order polarization-mode dispersion (PMD), whereas the symmetry of eye-closure penalty is broken under second-order PMD. An orthogonal polarization pair can have large disparity of eye-closure penalty despite an identical DOP. We also demonstrate a novel approach to estimate the maximum eye-closure penalty asymmetry with three orthogonal polarizations on the Poincare/spl acute/ sphere.     

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.     

On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

利用AutoCAD编制电气CAD

介绍如何利用AutoCAD开发适合电气专业使用的CAD系统，通过编制电气CAD的功能菜单，构造电气元件库，增强CAD的专业性能。编制电气CAD可以有效地统一本单位电气制图标准，方便电气工程师使用CAD进行专业设计。     

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

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