全概率公式的不足与改进

指出了全概率公式存在的不足,主要表现为不便于应用与易于误导等问题,进而给出了改进型全概率公式及其证明.实践表明,本文所给出的改进型全概率公式有着易于理解、便于掌握和应用等优点.     

全概率公式的推广与应用

认为全概率公式成立的条件＂事件组须为样本空间的划分＂可以减弱,给出全概率公式在有限事件组情形和无限可列事件组情形下的两种推广形式,由此对贝叶斯公式进行两种相应推广,并通过实例展示全概率公式在敏感性调查中的应用.     

全概率公式的推广

首先给出了普通事件在普通条件和Fuzzy条件下的Fuzzy条件概率及Fuzzy事件在普通条件和Fuzzy条件下的Fuzzy条件概率公式,并通过对普通事件的全概率公式进行推广,得到普通事件和Fuzzy事件分别在普通划分和Fuzzy划分下的全概率公式     

全概率公式的推广及应用

给出两种全概率公式的推广形式,从而弱化了全概率公式中事件列是互不相容的条件,最后给出相关的应用.     

浅谈全概率公式的教学

全概率公式是概率论教学中的重点和难点,利用它可由简单事件的概率推算复合事件概率。透彻地讲解公式和有效地进行解题思维分析,是教学中的难点。 一、由实例引入公式,以引代证,引导发现性思维。 学生普遍反映,全概率公式虽然形式简单易记,证明过程也可以接受。但对于某些复合     

基于数学核心素养的单元一课时教学设计——以“条件概率”为例

“条件概率与全概率公式”单元教学设计以整体关联性知识为载体,通过具体实例,由特殊到一般,从具体到抽象,建构条件概率,导出条件概率和全概率公式,并在实际运用中促进“一般观念”的发展,实现知识、方法、能力迁移,提升数学核心素养.     

基于条件期望的全期望公式在《随机过程》中的应用

本文介绍了条件化的全期望公式以及由全期望公式延伸出的随机变量型全概率公式,并给出在随机过程中的具体应用,还进一步探讨了全期望公式在随机过程中的误用.     

全概率公式的推广及其在保险中的应用

在实际应用中,可以利用随机变量的联合分布、条件分布及边缘分布推导出全概率公式,其基本思想是将一个边缘密度分解成条件密度,使所要解决的问题简化.通过具体实例,分析条件概率和全概率公式在保险中的广泛应用.     

计算数学期望和概率的条件化方法

借助于条件数学期望和随机事件A的示性函数IA,通过对随机变量的适当"条件化"处理,应用全期望公式和推广的全概率公式,讨论了计算数学期望和概率的条件化方法.     

基于全概率公式的随机变量边际分布

探讨如何利用全概率公式求二维随机变量的边际分布.特别的对二维连续型随机变量的边际分布进行了形式的推导,并发现积分区域对连续型全概率公式的重要影响.通过几个典型例题着重说明了该公式对积分区域形状的依赖.     

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 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.     

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.     

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.     

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

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

抛散落点的均匀性检验

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

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

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.