概率论课程中蕴含的数学文化

数学文化是概率论课程的重要组成部分,因此在概率论课程教学中非常有必要展示所蕴含的数学文化,才能使概率论课程教学在培养学生的工程数学学习与应用技能的同时,又能形成良好的数学思维与素养.从概率论的发展历程、概率论的数学思想与方法,概率实际应用案例等几方面阐明概率论中蕴含的数学文化.概率论课程教学与数学文化的融合能够解读枯燥的概率知识,降低概率知识的抽象性,用数学文化自身的魅力吸引学生,培养学生的创新应用等综合素质.     

概率论思维及其智力品质的培养

概率论思维是人脑和概率论研究对象交互作用并按照一般思维规律认识概率论内容的内在理性活动.它具有随机性、概括性、问题性、辐射性、指向性和创造性.提高概率论思维的效率及质量,必须从构筑知识平台,加强应用训练及强化批判意识等方面全面注意概率论思维智力品质的培养.     

谚语背后的概率问题

谚语以其短小精炼而为人熟知,有些谚语背后隐藏着一些概率论的知识.对一些谚语,从概率论的角度进行解释,以扩大对于概率论在生活中的体现的认识,增加学习概率论的兴趣,并加深概率论在生活中应用的理解.     

示性函数在初等概率论中的应用

示性函数在实分析等课程中很基本且应用广泛,但在初等概率论教材里应用不多.本文举例说明示性函数可以帮助学生理解初等概率论中一些基本概念、结论并精简其中一些计算.     

关于概率论中的分段函数问题

分段函数在概率论中有着广泛的应用.通过对几个概率问题的研究,探讨针对分段函数如何合理分段或分区域进行积分问题,体现分段函数在概率论中的重要性.     

概率论与数理统计丛书编辑委员会成立

随着科学技术和经济建设的发展,概率论与数理统计已渗透到自然科学、社会科学、国民经济的各个领域之中,为反映我国科研的成就,加快概率论、数理统计的普及和应用,以适应国民经济发展的需要,中国概率统计学会决定有计划有步骤地组织编写一套概率论与数理统计丛书,并组织概率论丛书编辑委员会负责这一工作. 丛书的编写方针为:     

范例集锦

<正> 随着科学技术术的发展,《概率论》的应用越来越广泛.它在自然科学、社会科学、工程技术、军事和工农业生产中有着广泛的应用,并且与其它数学学科互相渗透和结合.是理工科大学学生必修的一门基础课. 与其它数学课程比较,《概率论》这门课具有许多不同的特点,这给初学者带来不少困难,     

概率论中常见分布之间内在联系的探讨

概率论中的常见分布之间存在某些内在联系,研究其内在联系可以提高教学质量,激发学生的学习兴趣,具有一定的理论价值和应用价值.本文对概率论中常见分布之间的内在联系进行探讨.     

《概率论与数理统计》应用实例选讲

概率论与数理统计是经济管理类各专业的公共必修基础课,但学生普遍学习目的不明确,不清楚该门课的应用领域.本文选取课程中的有关内容,介绍一些经济、管理、金融等领域中的应用例子,让学生能真切地感受到概率论与数理统计知识的用处.     

对現行中学数学教学大綱的几点意見

(二)关于增加概率论初步知識的問題 1.增加概率论初步知識的必要性:(1)概率论在生产建设、交通运输、公用事业、軍事等方面有着广泛的应用。大跃进以来,許多在工农业战线上工作的同志都迫切需要有关概率论的知識,因为生产建设给他們提出了大量的须要用概率論解決的課題。 (2) 概率論的方法是研究近代自然科学的重要方法。概率论是研究客观世界的大量现象,卽研究由大量的个体所组成的一个整体所表現出来的某种性质。这样它就成了研究近代許多自然科学的基础,如分子物理、数理統計、电子計算及化学。 (3) 增加概率论可以更有力地对学生进行辯証唯     

Generalized symmetry of graphs — A survey

Symmetry of graphs has been extensively studied over the past fifty years by using automorphisms of graphs and group theory which have played and still play an important role for graph theory, and promising and interesting results have been obtained, see for examples, [L.W. Beineke, R.J. Wilson, Topics in Algebraic Graph Theory, Cambridge University Press, London, 2004; N. Biggs, Algebraic Graph Theory, Cambridge University Press, London, 1993; C. Godsil, C. Royle, Algebraic graph theory, Springer-Verlag, London, 2001; G. Hahn, G. Sabidussi, Graph Symmetry: Algebraic Methods and Application, in: NATO ASI Series C, vol. 497, Kluwer Academic Publishers, Dordrecht, 1997]. We introduced generalized symmetry of graphs and investigated it by using endomorphisms of graphs and semigroup theory. In this paper, we will survey some results we have achieved in recent years. The paper consists of the following sections.

1. Introduction

2. End-regular graphs

3. End-transitive graphs

4. Unretractive graphs

5. Graphs and their endomorphism monoids.

Moment information for probability distributions,without solving the moment problem,II: Main-mass,tails and shape approximation

How much information does a small number of moments carry about the unknown distribution function? Is it possible to explicitly obtain from these moments some useful information, e.g., about the support, the modality, the general shape, or the tails of a distribution, without going into a detailed numerical solution of the moment problem? In this, previous and subsequent papers, clear and easy to implement answers will be given to some questions of this type. First, the question of how to distinguish between the main-mass interval and the tail regions, in the case we know only a number of moments of the target distribution function, will be addressed. The answer to this question is based on a version of the Chebyshev–Stieltjes–Markov inequality, which provides us with upper and lower, moment-based, bounds for the target distribution. Then, exploiting existing asymptotic results in the main-mass region, an explicit, moment-based approximation of the target probability density function is provided. Although the latter cannot be considered, in general, as a satisfactory solution, it can always serve as an initial approximation in any iterative scheme for the numerical solution of the moment problem. Numerical results illustrating all the theoretical statements are also presented.     

Splitting up value: A critical review of residual income theories

This paper deals with the notion of residual income, which may be defined as the surplus profit that residues after a capital charge (opportunity cost) has been covered. While the origins of the notion trace back to the 19th century, in-depth theoretical investigations and widespread real-life applications are relatively recent and concern an interdisciplinary field connecting management accounting, corporate finance and financial mathematics (Peasnell, 1981, 1982; Peccati, 1987, 1989, 1991; Stewart, 1991; Ohlson, 1995; Arnold and Davies, 2000; Young and O’Byrne, 2001; Martin, Petty and Rich, 2003). This paper presents both a historical outline of its birth and development and an overview of the main recent contributions regarding capital budgeting decisions, production and sales decisions, implementation of optimal portfolios, forecasts of asset prices and calculation of intrinsic values. A most recent theory, the systemic-value-added approach (also named lost-capital paradigm), provides a different definition of residual income, consistent with arbitrage theory. Enfolded in Keynes’s (1936) notion of user cost and forerun by Pressacco and Stucchi (1997), the theory has been formally introduced in Magni (2000a,b,c; 2001a,b; 2003), where its properties are thoroughly investigated as well as its relations with the standard theory; two different lost-capital metrics have been considered, for value-based management purposes, by Drukarczyk and Schueler (2000) and Young and O’Byrne (2001). This work illustrates the main properties of the two theories and their relations, and provides a minimal guide to construction of performance metrics in the two approaches.     

关于群中乘积元素的阶

讨论群中两个元素a,b的阶不相等时其乘积ab的阶的一类计算问题.设ㄧaㄧ=m,ㄧ bㄧ=n,若(m,n)=1,且存在k∈N使a=bk,则有ㄧabㄧ=mn/d1d2,其中d1=(m,k+1),d2=(n,k+1).若m≠n,ab=ba,且(m,n)ㄧm/(m,n),或(m,n)ㄧn/(m,n),则有ㄧabㄧ=[m,n].     

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 261–269, April–June, 2005.     

城市老旧居住小区交通环境评价指标与评价方法

定量的评判城市老旧居住小区整体交通环境质量并进而科学有效的提出老旧小区交通环境更新与改善措施,对城市老旧居住小区交通环境进行了调查,明确了老旧居住小区存在的突出交通问题,并提出了城市老旧居住小区交通环境评价的指标体系,包括行人跨路出行指数、无人行道路段长度占比、停车泊位供需比、路内非法停车占比、平均停车步行距离、泊位数量户数比、人均步行空间、无障碍通道、盲道设置比例、非机动车泊位供需比、地面停放车辆数小区面积比、外部穿行交通周转量小区面积比等。并给出了具体指标的计算方法与获得办法。以长沙市四个典型老旧居住小区为例,对评价方法进行了论证,并得到城市老旧居住小区存在的一般问题,包括人车混杂、人车交织现象严重,停车泊位短缺、车辆乱停乱放,交通设施、特别是弱势群体交通设施缺乏。给出的评价指标、评价方法与结论可为城市老旧小区改造更新,特别是其中很重要的交通环境更新提供决策依据。     

The permanence and extinction of a nonlinear growth rate single-species non-autonomous dispersal models with time delays

In this paper, we consider the effect of diffusion on the permanence and extinction of a non-autonomous nonlinear growth rate single-species dispersal model with time delays. Firstly, the sufficient conditions of the permanence and extinction of the species are established, which shows if the growth rate and dispersal coefficients is suitable, the species is permanent, on the contrary, it is extinction. Secondly, an interesting result is established, that is, if only the species in some patches even in one patch is permanent, then it is also permanent in other patches. Finally, some examples together with their numerical simulations show the feasibility of our main results.     

互连网络的向量图模型

n-超立方体,环网,k元n超立方体,Star网络,煎饼(pancake)网络,冒泡排序(bubble sort)网络,对换树的Cayley图,De Bruijn图,Kautz图,Consecutive-d有向图,循环图以及有向环图等已被广泛的应用做处理机或通信互连网络.这些网络的性能通常通过它们的度,直径,连通度,hamiltonian性,容错度以及路由选择算法等来度量.在本文中,首先,我们提出了有向向量图和向量图的概念;其次,我们开发了有向向量图模型和向量图模型来更好地设计,分析,改良互连网络;我们进一步证明了上述各类著名互连网络都可表示为有向向量图模型或向量图模型;更重要的是该模型能够使我们设计出了新的互连网络---双星网络和三角形网络.