IPv4/IPv6翻译网关的研究

In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.     

Stability criteria for controlled queueing systems

We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues; the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results generalise Kurkova [8] and complement Foley and McDonald [4] and [5]. AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15     

Locally minimal uniformly oriented shortest networks

The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].     

Electro-optical performance of polymer stabilized cholesteric texture cell: The influence of chiral dopant and monomer concentration

Reverse-mode polymer stabilized cholesteric texture (PSCT) cells with various chiral dopant and monomer concentrations were fabricated. Experimental results indicate that the chiral dopant concentration and the monomer concentration significantly influence the threshold voltage and hysteresis of the cells. The chiral dopant and monomer deform the hysteresis loop. Increasing the monomer concentration reduces the width of the hysteresis loop of the reverse-mode PSCT cell.     

概率神经网络和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%。     

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.     

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

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