论质量世界与质量工程

提出了人类社会质量世界与人类社会质量工程的新理论概念，初步探讨了质量世界的基本定律，基本结构和基本属性，探讨了质量工作的基本要素，基本模式，基础和弊病，提出了人类的职责，使命与质量工作者的任务。     

Multiple short pass glass capillary gas chromatography

A multiple repass system, utilizing an in-line switching valve and suitable for use with small-bore glass open tubular columns, is described. The advantages of the system, which include higher OPGV, large plate numbers and optimization of column “length”, are discussed.     

Diameter of P.A. random graphs with edge‐step functions

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function f:N→[0,1] that drives the asymptotic proportion between the numbers of vertices and edges. These results are sharp when f is a regularly varying function at infinity with strictly negative index of regular variation ?γ. For this particular class, we prove a characterization for the diameter that depends only on ?γ. More specifically, we prove that the diameter of such graphs is of order 1/γ with high probability, although its vertex set order goes to infinity polynomially. Sharp results for the diameter for a wide class of slowly varying functions are also obtained.     

Spectral reordering of a range-dependent weighted random graph

^** Email: aas96106{at}maths.strath.ac.uk Grindrod (2002. Phys. Rev. E, 66, 0667021–0667027) posedthe problem of reordering a range-dependent random graph andshowed that it is relevant to the analysis of data sets frombioinformatics. Reordering under a random graph hypothesis canbe regarded as an extension of clustering and fits into thegeneral area of data mining. Here, we consider a generalizationof Grindrod's model and show how an existing spectral reorderingalgorithm that has arisen in a number of areas may be interpretedfrom a maximum likelihood range-dependent random graph viewpoint.Looked at this way, the spectral algorithm, which uses eigenvectorinformation from the graph Laplacian, is found to be automaticallytuned to an exponential edge density. The connection is precisefor optimal reorderings, but is weaker when approximate reorderingsare computed via relaxation. We illustrate the performance ofthe spectral algorithm in the weighted random graph contextand give experimental evidence that it can be successful forother edge densities. We conclude by applying the algorithmto a data set from the biological literature that describescortical connectivity in the cat brain.     

Construct a power‐efficient and space‐reuse‐effective dominating set using small‐world model in mobile ad hoc networks

In this paper, we proposed a novel distributed power management and clustering scheme for a large scale of ad hoc networks. An inappropriate transmission power leads to high power consumption and interference, thus we introduce a power management and clustering scheme to maintain coverage and to minimize interference using the small world model that provides a good starting point to sustain connectivity. This scheme reduces number of relay nodes and relay packets by constructing the virtual backbone with clusters. Our proposed scheme divided a large contention domain into small ones. Owing to power management for each node, space reuse is effective. Furthermore, the power consumption is obviously reduced by our proposed scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

控制在小世界网络中的仿真研究

探讨和分析了NS的工作原理和仿真机制,介绍了在小世界网络下利用NS软件进行网络控制系统仿真的方法和设计实现过程。基于网络仿真软件NS的编程通用性强和功能可扩展的特点,利用NS中类C++的语言环境实现了控制系统微分方程的实时求解,最后展示了仿真研究的结果。     

自动白平衡算法的研究与实现

介绍了白平衡基本原理,通过对图像自动白平衡的算法研究,讨论了常用白平衡算法及其特性以及约束条件,给出严格的数学模型以及处理流程,算法步骤;并对各算法的理论基础以及实现作出相应讨论,通过对几种白平衡方法算法优缺点、适用范围,处理结果的比较,分析得出结论。     

＂Final all possible steps＂ approach for accelerating stochastic simulation of coupled chemical reactions

In this paper, we develop a modified accelerated stochastic simulation method for chemically reacting systems, called the ＂final all possible steps＂ （FAPS） method, which obtains the reliable statistics of all species in any time during the time course with fewer simulation times. Moreover, the FAPS method can be incorporated into the leap methods, which makes the simulation of larger systems more efficient. Numerical results indicate that the proposed methods can be applied to a wide range of chemically reacting systems with a high-precision level and obtain a significant improvement on efficiency over the existing methods.     

Stochastic kronecker graphs

A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large‐scale real‐world networks such as the web. This model simultaneously captures several well‐known properties of real‐world networks; in particular, it gives rise to a heavy‐tailed degree distribution, has a low diameter, and obeys the densification power law. Most properties of Kronecker products of graphs (such as connectivity and diameter) are only rigorously analyzed in the deterministic case. In this article, we study the basic properties of stochastic Kronecker products based on an initiator matrix of size two (which is the case that is shown to provide the best fit to many real‐world networks). We will show a phase transition for the emergence of the giant component and another phase transition for connectivity, and prove that such graphs have constant diameters beyond the connectivity threshold, but are not searchable using a decentralized algorithm. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 38, 453–466, 2011     

Mathematical programming models for some smallest-world problems

Given a weighted graph G, in the minimum-cost-edge-selection problem (MCES), a minimum weighted set of edges is chosen subject to an upper bound on the diameter of graph G. Similarly, in the minimum-diameter-edge-selection problem (MDES), a set of edges is chosen to minimize the diameter subject to an upper bound on their total weight. These problems are shown to be equivalent and proven to be NP-complete. MCES is then formulated as a 0–1 integer programming problem. The problems MCES and MDES provide models for determining smallest-world networks and for measuring the “small-worldness” of graphs.