On Super Hamiltonian Semigroups

The concept of super hamiltonian semigroup is introduced. As a result, the structure theorems obtained by A. Cherubini and A. Varisco on quasi commutative semi-groups and quasi hamiltonian semigroups respectively are extended to super hamiltonian semigroups.     

1.5μm波段基于级联二阶非线性的铌酸锂光波导全光波长变换的理论分析

研究了基于级联二阶非线性的铌酸锂波导全光波长变换器的特性.首先从耦合模方程出发,比较了数值分析结果与小信号近似分析的结果.其次在数值分析基础上,分析了铌酸锂晶体的温度变化导致相应基频光波波长与极化反转光栅周期的变化关系.最后分析了在不同相互作用长度下,转换的光波功率与有效基频光波波长带宽、温度调谐带宽、极化反转光栅周期带宽等关系,以对全光波长变换器件进行优化设计 关键词： 级联二阶非线性 波长变换 准位相匹配 铌酸锂光波导     

拟因子试验设计在生产中的应用

根据生产实际,综合利用并列、赋闲列和拟水平试验设计,运用多重比较进行方差分析,寻找水泥熟料的最佳工艺.不仅解决了不同水平多因素试验问题,同时还可考虑交互作用,大大减少了试验次数,从而提高经济效益.     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.     

异方差回归中的广义方差比检验

在同方差假设之下,线性模型在回归分析的理论与应用方面起着突出的作用,很受许多研究工作者的青睐.然而,回归模型中同方差性这一标准假设不一定总是成立的.因此我们考虑了用一类基于似残差的方法来检验异方差情形下线性模型拟合观测数据的情况.本文既给出了大量的模拟,又给出了实际数据作为应用的例子.效果都很好.     

D∞-APPROXIMATION OF PRODUCT VARIATIONS OF TWO PARAMETER SMOOTH SEMIMARTINGALES

Let X be a two parameter smooth semimartingale and (~X) be its process of the product variation. It is proved that (~X) can be approximated as D∞-limit of sums of its discrete product variations as the mesh of division tends to zero. Moreover, this result can be strengthen to yield the quasi sure convergence of sums by estimating the speed of the convergence.     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

新颖的PPLN电光开关

在分析基于级联二阶非线性效应的准相位匹配周期极化铌酸锂(PPLN)波导全光波长变换器的有关参量容限的基础上,提出PPLN波长变换器的电光调控设想,并给予简要论证,论证结果是可行的,从而可实施电控调谐来自动补偿其失配,进而也可实现光开关的功能 关键词： 准相位匹配 周期极化铌酸锂 波长变换 光开关 电光效应调控     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003