On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

随机扰动下三维流体界面不稳定性的并行计算

对三维流体界面不稳定性的数值模拟引进了新的数值计算方法,并在MPI并行计算环境下进行了数值模拟.利用LevelSet方法确定界面位置,零水平集对应界面位置.对应离散LevelSet方程和界面两侧的两套Euler方程,借助于Ghost网格方法来完成离散.对最后网格点上的两套状态量的辨认依赖于该点的LevelSet值的符号.并进行了数值计算.     

最大乘积型Fuzzy文法与自动机

本文对提出的最大乘积型Ｆｕｚｚｙ文法与最大乘积型Ｆｕｚｚｙ自动机的关系作了详细讨论，得出了两个重要的结论。即：由给定的最大乘积型Ｆｕｚｚｙ正规文法可构造一个最大乘积型Ｆｕｚｚｙ自动机使得二者接受的语言集相同，反之亦然。从而达到自动识别语言的目的。     

随机动力系统的进展和问题

本文主要介绍随机动力系统的主要成果和进一步研究的问题。     

Neutron skin thickness of 90Zr and symmetry energy constrained by charge exchange spin-dipole excitations

The charge exchange spin-dipole (SD) excitations of \begin{document}$ ^{90} $\end{document}Zr are studied using the Skyrme Hartee-Fock plus proton-neutron random phase approximation with SAMi-J interactions. The experimental value of the model-independent sum rule obtained from the SD strength distributions of \begin{document}$ ^{90} $\end{document}Zr(p, n)\begin{document}$ ^{90} $\end{document}Nb and \begin{document}$ ^{90} $\end{document}Zr(n, p)\begin{document}$ ^{90} $\end{document}Y is used to deduce the neutron skin thickness. The neutron skin thickness \begin{document}$ \Delta r_{np} $\end{document} of \begin{document}$ ^{90} $\end{document}Zr is extracted as \begin{document}$ 0.083\pm0.032 $\end{document} fm, which is similar to the results of other studies. Based on the correlation analysis of the neutron skin thickness \begin{document}$ \Delta r_{np} $\end{document} and the nuclear symmetry energy J as well as its slope parameter L, a constraint from the extracted \begin{document}$ \Delta r_{np} $\end{document} leads to the limitation of J to \begin{document}$ 29.2 \pm 2.6 $\end{document} MeV and L to \begin{document}$ 53.3 \pm 28.2 $\end{document} MeV.     

随机单调减算子的随机不动点定理

利用锥理论和非对称迭代法,讨论了随机单调减算子的随机不动点的存在唯一性,同时给出了迭代序列收敛于解的误差估计,改进和推广了某些已知结果.     

Morphic-环与SF-环

以正则环为桥梁,研究了morphic-环与SF-环之间的关系.主要工作如下:(i)研究了SF-环成为morphic-环的若干条件;(ii)讨论了在一定条件下SF-环与morphic-环的等价性;(iii)给出了利用morphic-环对半单环在约化条件下的一个刻划.     

拟自适应分类随机森林算法

本文给出了集成学习模型可以收敛的集成学习算法,拟自适应分类随机森林算法。拟自适应分类随机森林算法综合了Adaboost算法和随机森林算法的优势,实验数据分析表明,训练集较大时,拟自适应随机森林算法的效果会好于随机森林算法。另外,拟自适应分类随机森林算法的收敛性确保它的推广误差可以通过训练集估计,所以,对于实际数据,拟自适应分类随机森林算法不需要把数据划分为训练集和测试集,从而,可以有效的利用数据信息。     

SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts

A graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) if and only if G is Hamiltonian and for any cost matrix C=(c_(i,j)) associated with G where all tours have the same cost, there exist vectors a=(a₁,…,a_n) and b=(b₁,…,b_n) such that . In this paper we show that for symmetric digraphs strong Hamiltonicity is a necessary condition for SC-Hamiltonicity. As a surprising consequence, we prove that the symmetric digraph obtained from an undirected SC-Hamiltonian graph by edge duplication need not be SC-Hamiltonian. This settles a conjecture of Kabadi and Punnen. We then show that an undirected graph on an even number of nodes having an edge that appears in every Hamiltonian cycle cannot be SC-Hamiltonian. Using this we establish that multiple subdivision of an edge need not preserve SC-Hamiltonicity, disproving a previous claim. Further, we identify other necessary conditions for SC-Hamiltonicity and obtain new classes of SC-Hamiltonian graphs.     

关于任意随机序列的一个强大数定理

This note is devoted to introduce a new concept of conditionally dominated random variables.Under suitable restrict conditions,a general strong law of large numbers for arbitrary continuous random variables is obtained.