FCC装置主风分布管喷嘴磨损的气相流场分析

用FLUENT流体计算软件对FCC装置再生器树枝状分布管喷嘴流场进行了计算,分析了喷嘴发生磨损的机理.对喷嘴流场的计算表明喷嘴磨损是催化剂颗粒造成的,属于气固两相流冲蚀磨损.由于某些喷嘴的压力降偏低和流场存在偏流,造成催化剂颗粒倒流至喷嘴内部或分布支管内部.催化剂颗粒流经喷嘴时,斜向冲击内壁产生冲蚀磨损.磨损首先发生在喷嘴内壁局部区域,形成圆弧状磨损痕迹,再将喷嘴磨穿,逐渐扩大为整个喷嘴,磨掉喷嘴.这些分析结果可为主风分布管的设计提供帮助.     

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.     

基于单片机加压控制的PCD复合片真空扩散焊接

文章针对普通钎焊的聚晶金刚石钻头剪切强度不高，提出了采用单片机加压控制的PCD复合片真空扩散焊接的设计思想，在对原真空扩散焊机液压改造的基础上给出如何由单片机控制加压的电路和程序流程设计。实际应用表明，该技术经济实用，有较好的经济效益。     

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

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

Modeling node mobility for reliable packet delivery in mobile ip networks

In this paper, we analyze node mobility for reliable packet delivery in mobile IP networks. In mobile IP, packets destined to roaming nodes are intercepted by their home agents and delivered via tunneling to their care of addresses (CoA). A mobile node may roam across multiple subnets. At each boundary crossing, a handoff is initiated such that the CoA is updated and a new tunnel is established. We consider both basic mobile IP handoff and smooth handoff. We find that reliable packet delivery in mobile IP networks can be modeled as a renewal process, because the retransmission over a new tunnel after each boundary crossing is independent of the previous history. We then derive the probability distribution of boundary crossings for each successful packet, based on which the packet reliable delivery time can be obtained. Our analytical model is derived based on a general distribution of residence time in a subnet and a general distribution of successful retransmission attempts in each subnet. The results can be readily applied to any distributions for both items. We also provide numerical examples to calculate the probability distribution of boundary crossings, and conduct simulations to validate our analytical results     

厚膜永磁阵列微致动器的磁路研究

研究了厚膜永磁阵列微致动器中的磁场分布，并研究了永磁阵列单元几何尺寸对微致动器电磁力的影响。结果表明，厚膜永磁阵列单元高宽比和磁体单元间隔对微致动器电磁力影响较大磁徕单元高宽比为0．7是一个比较合适的尺寸。     

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

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

Advanced disturbance observer design for mechanical positioning systems

Disturbance-observer (DOB)-based controller design is one of the most popular methods in the field of motion control. In this paper, the generalized disturbance compensation framework, named the robust internal-loop compensator (RIC) is introduced and an advanced design method of a DOB is proposed based on the RIC. The mixed sensitivity optimization problem, which is the main issue of DOB design, is also solved through the parametrization of the DOB in the RIC framework. Differently from conventional methods, the Q-filter is separated from the mixed sensitivity optimization problem and a systematic design law for the DOB is proposed. This guarantees the robustness and optimality of the DOB and enables the design for unstable plants.     

三江盆地西部藻类地层学特征

本文依据三江盆地西部4口井的藻类分布特征，自下而上划分9个组合，并对各组合的时代及沉积环境进行了探讨。