Preparation and characterization of mesoporous silica thin films from polyethoxysiloxanes

Tetraethoxysilane (TEOS) and polyethoxysiloxanes (PEOSs; prepared by the acid‐catalyzed hydrolytic polycondensation of TEOS) were subjected to the sol–gel process in the presence of cetyltrimethylammonium bromide (CTAB), respectively. The PEOSs with M_w 700–26,000, as prepared by sol–gel coating of TEOS and PEOS under various conditions, were used. Uniform and crack‐free thin films of thickness 276–613 nm were prepared by spin‐coating of a PEOS solution containing CTAB. When the coating films were sintered at 400 °C, the combustion of ethoxy groups and CTAB took place to provide porous silica thin films. The structure of the thin films was found to be dependent on the molecular weight of PEOS and the molar ratio of CTAB/Si: lamellar or hexagonal phase was observed for M_w less than 15,000 and for CTAB/Si molar ratios greater than 0.10. Honeycomb structures were observed for M_w less than 5000 and for CTAB/Si molar ratios of 0.15. The honeycomb structure was also observed by atomic force microscopy and transmission electron microscope. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 2542–2550, 2006     

概率神经网络和FTIR光谱用于食道癌的辅助分析

利用正常与相应癌化食道组织的主要FTIR特征峰aυs,CH3、sυ,CH2、σCH2、aυs,po4-、υc-o、sυ,po2-及sυ,磷酸化蛋白作为概率神经网络的输入向量,对网络的主要参数(网络径向基函数分布spread(0~5))、输入向量和网络表现(m ean accurate rate of recogn ition)之间的关系进行了研究。主要结论如下:i)无论输入向量是哪种特征频率的组合,其平均识别正确率都高于71.40%;ii)当输入向量为特征频率sυ,po2、sυ,磷酸化蛋白或υc-0、sυ,po2、sυ,磷酸化蛋白时,网络表现较佳,平均识别正确率较好。当spread介于1.4~2.3时,两者均达到网络具有的最高平均识别正确率(85.71%);iii)大多数情况下,网络的平均识别正确率与spread之间呈现二个高峰的特征,即spread介于0.1~0.3和1.5~5.0之间时,网络均具有较高的平均识别正确率。研究表明,以傅里叶变换红外光谱的主要特征峰为概率神经网络的输入向量,用于食道组织样品的癌化识别分析是完全可能的,其平均识别正确率可达85.71%。     

Wetting at a polymer gel–vapor interface; a system not influenced by a long-range van der Waals contribution

The exterior of a cross-linked polymer gel resembles a polymer brush. Such gel including its brush can be swollen by a good solvent. The detachment of the solvent–vapor (L–V) interface from the brush is controlled by the adsorption of polymer segments onto this interface and is to a very good approximation not influenced by long-range van der Waals contributions. A wetting transition in this system coincided with the adsorption–desorption transition for chains onto such L–V interface and has various unusual features. There are several indications that in practice this system should feature a second-order wetting transition.     

On the origin of 1.5 μm luminescence in porous silicon coated with sol–gel derived erbium-doped Fe2O3 films

Sol–gel derived Fe₂O₃ films containing about 10 wt% of Er₂O₃ were deposited on porous silicon by dipping or by a spin-on technique followed by thermal processing at 1073 K for 15 min. The samples were characterized by means of PL, SEM and X-ray diffraction analyses. They exhibit strong room-temperature luminescence at 1.5 μm related to erbium in the sol–gel derived host. The luminescence intensity increases by a factor of 1000 when the samples are cooled from 300 to 4.2 K. After complete removal of the erbium-doped film by etching and partial etching the porous silicon, the erbium-related luminescence disappears. Following this, luminescence at 1.5 μm originating from optically active dislocations (“D-lines”) in porous silicon was detected. The influence of the conditions of synthesis on luminescence at 1.5 μm is discussed.     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.     

Hydrogel nanonetworks with functional core-shell structure

Nanohydrogel particles of poly(acrylonitrile-co-N-isopropylacrylamide (p(AN-c-NIPAM)) were synthesized using a microemulsion polymerization technique. Highly monodisperse nanohydrogel particles e.g. 50-150 nm, and various morphology such as core-shell and connected beads were obtained. It was shown that the shell thickness and the size of particles can be tuned by the monomer concentrations and their ratios as well as by the utilization of different crosslinkers. The hydrophobic core monomer, AN was converted to amidoxime groups to increase the hydrophilicity of the nanogels which provide more hydrophilic character and impart new functionality to the nanonetwork. Transmission electron microscopy (TEM), and dynamic light scattering (DLS) techniques were employed for the particle size characterizations. The amidoximation reaction was confirmed by FT-IR spectroscopy.     

人工神经网络方法预测气相色谱保留值

本文运用一典型的人工神经网络模型－“反向传播“模型的改进形式，研究了诱导效应指数Ｉ，摩尔折射度Ｒｏ，疏水亲脂参数ＩｇＰ，以及分子联通性指数与气象色谱保留行为的关系，实现了对色谱保留植的预测。神经网络预测模型的最大相对误差不超过８．７％。结果表明，该方法性能良好，可望成为色谱保留值预测的有效手段。