光子交换技术的前景简述

本文首先指出光纤通信向全光网推进的趋向，认真研究光子交换技术的必要性。其后简单说明光子交换有关的波分多路／波分多址系统，空分交换器，交叉连接结点，波长路由器和波长转换器，光电子集成／光子集成技术。最后给出作者个人见解的结论．     

综合网络管理技术

阐明综合网络管理概念，综述国际标准化组织作的努力及国外发展情况，一个示例说明ＩＮＭＳ技术，最后介绍几项关键技术。     

公安110报警指挥系统组网设计

１１０是电话网中的匪警特服号，现代信息化社会的发展要求１１０接警响应迅速而准确，本文介绍了公安１１０报警指挥系统的组成原理，给出了该系统与公共市话网和公安专网的组网实现方法，并对工程设计中的系统可靠性问题进行了详细的讨论，该系统也可用于１１９报警等其待服业务。     

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.     

人工神经网络及其在分析化学中的应用

人工神经网络是一种新兴的计算方法，有着广阔的发展前途，目前在分析化学领域已经有了多方面的应用。本文简要介绍了人工神经网络的原理及其在分析化学中的应用。     

新颖的二维超分子化合物[CoⅢ(aea)(2,2''''-bipy)]Cl·H2O的水热合成及结构表征

0IntroductionInrecentyearsgreatattentionhasbeenpaidtosupramolecularchemistryandawidevarietyofnet鄄workshavealreadybeenconstructedbasedupontheprincipleofcrystalengineering[1~3].Usually,variousmultifunctionalorganicligands,bothrigidandflexiblemulticarboxyli…     

Networks and chain coverings in partial orders and their products

For an arbitrary poset P, subposets {P _i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.