X波段及DBS接收用PHEMT单片低噪声放大器

报道了X波段及DBS接收用单片低噪声放大器的研制结果。利用CAD软件对单片电路进行优化设计，设计工作包括MBE材料、PHEMT器件和单片电路三部分。在研制过程中，开展了关键工艺的专题研究。研究结果为：单级单片放大器在10：5－11．6GHz范围内，NF≤1．82dB，G≥7.72dB；在11．7－12．2GHz范围内，NF≤1．80dB，G≥6．8dB；双级放大器在10．4－11．1GHz范围内，NF≤1．96dB，G≥15．3dB，最低噪声系数为1．63dB，最高增益为16．07dB。     

PREPARATION OF BONE TUMOR THERAPEUTIC RADIOPHARMACEUTICALS ^153 Sm—EDTMP

ＰＲＥＰＡＲＡＴＩＯＮ　ＯＦ　ＢＯＮＥ　ＴＵＭＯＲ　ＴＨＥＲＡＰＥＵＴＩＣ　ＲＡＤＩＯＰＨＡＲＭＡＣＥＵＴＩＣＡＬＳ　~（１５３）Ｓｍ－ＥＤＴＭＰＬｕｏＳｈｕｎｚｈｏｎｇ（罗顺忠）；ＰｕＭａｎｆｅｉ（蒲满飞）；ＱｉａｏＪｉａｎ（谯健）；ＬｉｕＺｈｏｎ?..     

马来酸酐在乙丙橡胶上的接枝共聚

马来酸酐在乙丙橡胶上的接枝共聚,用过氧化苯甲酰为引发剂的效果优于偶氮二异丁腈。研究了温度、马来酸酐用量和引发剂用量等对接枝率的影响。用红外光谱和薄层色谱证明了接枝物的存在。用接触角技术测定了接枝物的表面性能。     

加气混凝土切割机的特性与选用

文章分析了我国目前生产加气混凝土制品的各种切割工艺及采用的切割设备--地翻型切割机、空中翻转型切割机、长杆式切割机、预铺式切割机、压入式切割机、栅条式切割机(JQS)钢带式切割机的工艺特点.介绍了选用这些切割机应注意的问题,指出必须结合实际的生产工艺、产品要求及场地特点、投资大小合理选择切割机.     

冶金厂房钢吊车梁设计中一些问题的探讨

对双层翼缘板焊接工型钢吊车梁的某些受力特征、吊车梁的支座节点连接构造设计等进行了较详尽的分析,提出了满足冶金工业厂房大跨度、大吨位吊车梁系统受力和工艺要求的方法.     

安钢集团信息化实施策略探讨

近年来，为了更好地应对新的市场挑战，钢铁企业都在积极推进信息化建设，以实现管理提升、效益提升的目标。本文结合安钢集团的实际情况，对信息化实施策略进行初步的探讨，希望能对企业信息化建设有所借鉴。     

Advances in internet congestion control

In this survey, we first review the concept of congestion control with a focus on the Transmission Control Protocol⁄Internet Protocol (TCP⁄IP). We describe many recently proposed algorithms to combat congestion and improve performance, particularly active queue management (AQM) algorithms such as random early detection (RED) and its variants. We then survey control-theoretic analysis and design of TCP congestion control with an AQM scheme. In addition, we discuss three problems associated with AQM proposals: parameter setting, the insensitivity to the input traffic load variation, and the mismatch between macroscopic and microscopic behavior of queue length dynamics. As alternatives to AQM algorithms, we also survey architectural approaches such as modification of source or network algorithms, and economic approaches including pricing or optimization of allocated resources. Finally, we list many open issues that persist in the design, operation, and control of the Internet.     

Novel algorithms for shared segment protection

The major challenges in designing survivable schemes are how to allocate a minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and, in case a failure occurs, to be able to recover quickly from it. All existing approaches invariably make tradeoffs. We propose novel shared segment protection algorithms which make little or no compromise . We develop an elegant integer linear programming (ILP) model to determine an optimal set of segments to protect a given active path. Although the ILP approach is useful for a medium-size network, it is too time consuming for large networks. Accordingly, we also design a fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments. Although the heuristic algorithm has a polynomial time complexity, it can achieve a bandwidth efficiency as high as some best-performing shared path protection schemes and, at the same time, much faster recovery than these shared path protection schemes. The proposed scheme is also applicable to a wide range of networking technologies, including Internet Protocol and wavelength-division multiplexing networks under the generalized multiprotocol label switched framework.     

Achieving fast and bandwidth-efficient shared-path protection

Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.