On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

Periodicity of Two-Dimensional Bonding of Main Group Elements

In the periodic table the position of each atom follows the ‘aufbau’ principle of the individual electron shells. The resulting intrinsic periodicity of atomic properties determines the overall behavior of atoms in two-dimensional (2D) bonding and structure formation. Insight into the type and strength of bonding is the key in the discovery of innovative 2D materials. The primary features of 2D bonding and the ensuing monolayer structures of the main-group II–VI elements result from the number of valence electrons and the change of atom size, which determine the type of hybridization. The results reveal the tight connection between strength of bonding and bond length in 2D networks. The predictive power of the periodic table reveals general rules of bonding, the bonding-structure relationship, and allows an assessment of published data of 2D materials.     

Regular Balanced Cayley Maps for Cyclic, Dihedral and Generalized Quaternion Groups

A Cayley map is a Cayley graph embedded in an orientable surface such that. the local rotations at every vertex are identical. In this paper, balanced regular Cayley maps for cyclic groups, dihedral groups, and generalized quaternion groups are classified.     

一种基于Meta分析固定效应模型的简明统计学方法

为了让临床医生更方便地使用M eta分析方法,我们根据四格表数据特点,提出了一种基于固定效应模型的简明方法。该方法简单而容易操作,且统计结果与原方法完全等价,在循证医学领域很有推广价值。     

泛函梯度数值计算的一种新方法—正交试验法

本文研究并揭示了L_(2~a)(2~(2~a-1))型正交表行(列)间的递推规律,提出了一种泛函梯度数值计算的新方法——正交试验法,该方法在计算速度和精度上优于直接梯度法;在通用性及节省内存方面优于伴随算子法。     

应用加权列联表分析预测汛期（4─9月）洪涝趋势

本文根据汉寿县１９６０─１９８８年洪涝灾害资料，应用加权列联表分析法，与前期气候因子建立洪涝趋势预测模式。最后对１９８９─１９９０年洪涝试报，取得了满意的效果。     

系统动力学模型结构分析中表函数的改进方法

分析了非线性系统动力学(SD)模型中表函数环节的传统表示方法,指出该方法对于进行SD模型的结构分析所造成的障碍,并提出了用牛顿插值的承袭性算法来改进表函数环节的表示方法的思路.接着分别介绍了用差商和差分牛顿插值法改进表函数的过程.最后,通过一个实例说明了表函数改进的方法,并展示了以此为基础进行结构分析的思路.     

Reference priors for exponential families with simple quadratic variance function

Reference analysis is one of the most successful general methods to derive noninformative prior distributions. In practice, however, reference priors are often difficult to obtain. Recently developed theory for conditionally reducible natural exponential families identifies an attractive reparameterization which allows one, among other things, to construct an enriched conjugate prior. In this paper, under the assumption that the variance function is simple quadratic, the order-invariant group reference prior for the above parameter is found. Furthermore, group reference priors for the mean- and natural parameter of the families are obtained. A brief discussion of the frequentist coverage properties is also presented. The theory is illustrated for the multinomial and negative-multinomial family. Posterior computations are especially straightforward due to the fact that the resulting reference distributions belong to the corresponding enriched conjugate family. A substantive application of the theory relates to the construction of reference priors for the Bayesian analysis of two-way contingency tables with respect to two alternative parameterizations.     

STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES

Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained.     

On the pagenumber of trivalent Cayley graphs

Book embedding of graphs is one of the graph layout problem. It is useful for the multiprocessor network layout or the fault-tolerant processor arrays. We show that the trivalent Cayley graphs proposed by Vadapalli and Srimani can be embedded in five pages, and show some additional results on cube-connected cycles.