给定拓扑结构的网络的可靠性设计

本文首先讨论了网络链路堵概率的加权平均值，提出了网络分配的一般准则，并在考虑了网络链路生存链路概率的因素后，提出了更一般的网络链路堵塞概率的加权平均值，以此为基础，分别讨论了网络在给定点的费用条件下，使得网络可靠性最大的网络设计问题，以及在给定网络可靠性指标的前提下，使得网络费用最小的网络设计问题。     

基于ATM的网络互连方式

ＡＴＭ技术能否在数据通信网中广泛采用取决于其是否能高效地支持现有业务，其中主要为非连接业务。本文介绍了几种基于ＡＴＭ 的非连接业务支持方式和协议体系结构，对其进行了评述并对ＩＰ分组到ＡＴＭ信元的封装效率进行了分析。     

我国模压全息技术发展现况述评

模压全息技术作为一种高科技已在近年来得到迅速的发展并趋于成熟,模压全息能以较低的成本和较高的速度进行大批量的工业化生产。本文对我国模压全息技术发展现况进行了述评。     

航空油品高频/高压电脱水微观机理

设计并建立了一套高压电物理化学显微分析装置，为研究高压电物理化学领域的微观机理提供了一种新的技术途径。采用该技术，研究了胜利稠油经6％加氢裂解柴油稀释的原料油的高频／高压电脱水的微观机理。该原料的脱水率达96．7％，高于传统的电脱水方法。     

乳化酸+硝酸粉末酸压技术在泥灰岩储层中的应用

华北油田泥灰岩储层曾进行多种类型的酸化增产改造工艺,但均未取得理想效果。经过对泥灰岩地层进行大量的油藏地质、室内试验研究以及工程、地质技术人员的反复论证,优选出一种切实可行的酸压改造措施——前置液+高温乳化酸+固体硝酸酸压工艺。经过现场应用,收到了较好的增产效果,为华北油田泥灰岩储层改造措施找到了突破口。     

化学复合镀Ni-P-TiO_2光催化降解次甲基蓝

以钛酸丁酯为原料通过溶胶 凝胶法制备出粒径 30nm左右的纳米TiO2 ,利用化学复合镀在钢铁基底上形成Ni P 纳米TiO2 复合镀层 ,该复合镀层对次甲基蓝有较好的光催化降解作用 ,其催化性能与粉末状纳米TiO2 的催化性能大致相当。     

离子液体用于燃料油深度脱硫的研究进展

首先介绍了加氢催化脱硫和其他脱硫技术的特点,综述了近年来国内外利用离子液体在萃取脱硫、萃取脱硫与氧化脱硫耦合、萃取脱硫与生物脱硫耦合等方面的研究。认为离子液体萃取脱硫具有操作简便、可循环使用、无需氢气、环境友好、能深度脱硫等特点,是一项具有广阔发展前景的技术。若要实现该技术的工业化应用,还需进一步加强离子液体在合成工艺、脱硫选择性及回收再生等方面的研究。     

OFDM-MIMO系统及其频率同步分析

多媒体业务对无线通信的带宽与品质提出了更高的要求，OFDM和MIMO由于满足了这一需求被越来越多的无线通信标准采用所为底层的调制和传输技术。频率同步问题是OFDM—MIMO物理层设计中正确解调的前提和基础，本文介绍了OFDM—MIMO的原理、特点和频率同步问题的研究现状。     

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.