L－fuzzy集网的R－收敛性质

本文在ＬＦ拓扑空间中建立了Ｌ－ｆｕｚｚｙ集网的弱收敛（Ｒ－收敛）概念，应用文［４］中的Ｒ－闭包，系统讨论了它们的性质，证明了等式ＲｌｉｍＡ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ和ＲｌｉｍＡ＿ｎ＝Ａ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ并且给出了Ｌ－ｆｕｚｚｙ集网与其子网之间的关系。     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

On the R-Order of Convergence of a Family of Methods for Simultaneous Extraction of Part of All Roots of Algebraic Polynomials

This note deals with the R-order of convergence of Weierstrass-Durand-Kerner-Dochev type single-step methods for the simultaneous determination of only a part of all roots of algebraic polynomials.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

抛散落点的均匀性检验

讨论了抛散落点的均匀性检验,给出了一种排序法检验,并将它与传统的两种检验方法进行比较．     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

一类完全正则半群簇子簇格的性质

本文研究了完全正则半群簇的子簇格［Ｖ＋∩ＰＶ，Ｖ＋∩ＰＶ］的某些格运算性质，我们证明了簇Ｖ＋∩ＰＶ可分解为Ｖ与Ｖ＋∩ＰＶ的并；对任意完全正则半群簇Ｗ，有Ｗ∩（Ｖ∨Ｖ＋∩ＰＶ）＝（Ｗ∩Ｖ）∨（Ｗ∩Ｖ＋∩ＰＶ）．特别地，我们得到了等式Ｖ＋∩ＰＶ＝Ｖ成立的若干条件．     

碾压混凝土坝施工层面变形分析模型

针对碾压混凝土坝施工层面对大坝变形产生显著影响的问题,深入研究了施工层面的变化性质及规律,提出了层面不同阶段变形的模拟方法,建立了施工层面有厚度和无厚度分析模型,提出的模型能反映层面的弹性变形、衰减蠕变、不可逆变形以及加速蠕变等变形状态．实例分析表明:所提出的碾压混凝土坝施工层面有厚度和无厚度分析模型能较客观地模拟大坝的结构变化形态,尤其是施工层面有厚度分析模型较完整地模拟了层面的渐变规律,其计算结果与原位监测成果吻合较好．同时,提出的方法和建立的分析模型可推广应用于常规混凝土坝,特别是坝基内断层和夹层等变形规律的分析．     

白骨化尸体死亡时间的推断

本文分析了15具白骨化尸体标本的股骨汞(Hg),铅(Pb),镉(Cd)元素含量数据,在三年的时间内采集了3次,一共收集到45个数据。首先将这组数据看着纵向数据,利用线性随机效应混合模型、Cox随机混合效应模型进行分析,结果显示,如果对每个白骨化尸体标本建立线性模型,可以精确预测出死亡时间,而且不需要采集铅元素含量数据。混合效应模型的预测效果也很好,最大误差不会超过1个月。其次我们对数据不作任何假设,利用机器学习中随机森林方法分析数据,并利用5折交叉验证方法来判断结果的可靠性,训练集和测试集的NMSE分别为0.1205944,0.5604286,因此可以用训练出的模型来预测死亡时间。     

Asymptotics of families of solutions of nonlinear difference equations

One method to determine the asymptotics of particular solutions of a difference equation is by solving an associated asymptotic functional equation. Here we study the behaviour of the solutions in an asymptotic neighbourhood of such individual solutions. We identify several types of attraction and repulsion, which range from almost orthogonality to almost parallelness. Necessary and sufficient conditions for these types of behaviour are given.     

Admissibility of estimators of the probability of unobserved outcomes

The problem of estimating the probability of unobserved outcomes or, as it is sometimes called, the conditional probability of a new species, is studied. Good's estimator, which is essentially the same as Robbins' estimator, namely the number of singleton species observed divided by the sample size, is studied from a decision theory point of view. The results obtained are as follows: (1) When the total number of different species is assumed bounded by some known number, Good's and Robbins' estimators are inadmissible for squared error loss. (2) If the number of different species can be infinite, Good's and Robbins' estimators are admissible for squared error loss. (3) Whereas Robbins' estimator is a UMVUE for theunconditional probability of a new species obtained in one extra sample point, Robbins' estimator is not a uniformly minimum mean squared error unbiased estimator of the conditional probability of a new species. This answers a question raised by Robbins. (4) It is shown that for Robbins' model and squared error loss, there are admissible Bayes estimators which do not depend only on a minimal sufficient statistic. A discussion of interpretations and significance of the results is offered. Research supported by NSF Grant DMS-88-22622.     

Groups of Automorphisms of Tournaments

By the Holland Representation Theorem, every lattice ordered group (l-group) is isomorphic to a subalgebra of the l-group of automorphisms of a chain. Since weakly associative lattice groups (wal-groups) and tournaments are non-transitive generalizations of l-groups and chains, respectively, the problem concerning the possibility of representation of wal-groups by automorphisms of tournaments arises. In the paper we describe the class of wal-groups isomorphic to wal-groups of automorphisms of tournament and show some of its properties.     

图表示范畴的两个子范畴

引进图表示范畴的两个子范畴,研究它们的同调性质。     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Convergence of densities of some functionals of Gaussian processes

The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density. Precise estimates for the uniform distance are derived by using the techniques of Malliavin calculus, combined with Stein?s method for normal approximation. We need to assume some non-degeneracy conditions. First, the study is focused on random variables in a fixed Wiener chaos, and later, the results are extended to the uniform convergence of the derivatives of the densities and to the case of random vectors in some fixed chaos, which are uniformly non-degenerate in the sense of Malliavin calculus. Explicit upper bounds for the uniform norm are obtained for random variables in the second Wiener chaos, and an application to the convergence of densities of the least square estimator for the drift parameter in Ornstein–Uhlenbeck processes is discussed.     

Justification of the Method of Approximation of Solutions to Contact Problems of Filtration Theory

We suggest a new convergent algorithm for numerical solution of the nonlinear problem of finding the parameters of conformal mappings describing fluid filtration flows with free (contact) boundaries in porous media.