等效可变孔径远场法测量单模光纤模场半径

本文提出等效远场的可变孔径方法,由测量光纤远场累积分布求得模场半径。并且利用Petermann关于模场半径的新定义,推出了一种对非高斯模场分布也适用的求模场半径的方法。实验表明,这种测量方法简便可靠,在不同的制备端面下,重复测量的标准误差小于0.04μm。     

Thermal decomposition of a generation 4.5 PAMAM dendrimer platinum drug conjugate

A nanoscale multivalent platinum drug based on a poly(amidoamine) [PAMAM] dendrimer (generation 4.5, carboxylate surface) has been synthesized and fully characterized using a variety of spectroscopic, chromatographic and thermal methods. Treatment of the dendrimer with an aqueous solution containing an excess diaquo(cis-1,2-diaminocyclohexane)platinum(II) produces a conjugate containing approximately forty (diaminocyclohexane)platinum(II) moieties at the surface of the dendrimer. This material undergoes smooth two-stage thermal decomposition to provide residual platinum oxide reflecting the platinum loading in the drug.     

Bubble point pressure estimates from Gibbs ensemble simulations

Bubble pressure points of ethanol–1,1,1,2,3,3,3-heptafluoropropane (HFC-227ea refrigerant) mixtures from the third Industrial Fluid Properties Simulation Challenge are computed using publicly available molecular simulation software. Several published force fields are compared against the known answers provided in the contest guidelines and the best force fields are used to make predictions for the unknown results.     

Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem

In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one.     

一致Lipschitz映射的遍历定理及其遍历分解

设(X,d)是一个可分的度量空间,Cu(X,d)是由全体一致连续函数所组成的C(X,d)的子空间,T是定义在X上的一致Lipschitz映射,那么对f∈Cu(X),1/n n∑k=1 Uk If在Cu(X)上收敛.从这个基本结果出发,利用Cu(X,d)的共扼空间的表示定理,得到了相空间的Yosida型遍历分解;利用空间的嵌入技术证明了非一致Lipschitz映射的大数法则.     

数据库应用综合设计实验改革初探

文章对数据库应用的综合设计性实验改革工作进行了总结，给出了一种既能培养学生的创新能力又可以节约学校资源的实验模式。     

D-N交替法与Schwartz交替法的收敛关系分析

This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process.     

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.