Preparation and photochromism of nanocomposite thin film based on polyoxometalate and polyethyleneglycol

A photochromic nanocomposite based on Keggin structure phosphomolybdic acid (PMoA) well dispersed in polyethyleneglycol (PEG) was fabricated. TEM image showed that PMoA nanoparticles with narrow size distribution were finely dispersed in polymer matrix. FT-IR results showed that the Keggin geometry of polyoxometalates was still preserved inside the composites and strong coulombic interaction was built between PMoA and polymer matrix. Under UV irradiation, the film was reduced photochemically to yield a blue species, which was in accordance with a charge-transfer mechanism.     

监理在工程项目施工阶段的投资控制和索赔

阐述了监理在建设项目施工阶段对投资控制的依据、投资控制的主要措施,及索赔过程中的时效、证据收集和评审原则。     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

珠江口盆地开平凹陷油气聚集条件分析

珠江口盆地自新生代以来,曾先后受到不同方向张应力的作用,造成了不同时期构造体系的交叉叠合.中中新世以来构造运动强烈,并具有东强西弱的特点,对油气的运移与聚集产生了重要影响.开平凹陷的剧烈断裂和断陷活动始于始新世,并在同期沉积了巨厚的文昌组.晚渐新世以后,由于断裂活动非常微弱,在成熟的烃源岩与其上地层之间缺乏有效的油源断层,因而自生自储、近距离运移可能是开平凹陷油气聚集的基本特征.在凹陷内部,因重力滑动和欠压实泥岩共同作用所形成的KPll-1构造带可能是该区最具有油气远景的地区.     

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

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

基于ATM的网络互连方式

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

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

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

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.