多维随机大与SNBU多维寿命分布类

本文从多维随机序──随机大入手，定义了多维寿命分布类ＳＮＢＵ，证明了该定义与文［１］中的定义等价，研究了其部分性质。     

The problem of time's arrow historico-critically reexamined

Responding to Hasok Chang's vision of the history and philosophy of science (HPS) as the continuation of science by other means, I illustrate the methods of HPS and their utility through a historico-critical examination of the problem of “time's arrow”, that is to say, the problem posed by the claim by Boltzmann and others that the temporal asymmetry of many physical processes and indeed the very possibility of identifying each of the two directions we distinguish in time must have a ground in the laws of nature. I claim that this problem has proved intractable chiefly because the standard mathematical representation of time employed in the formulation of the laws of nature “forgets” one of the connotations of the word ‘time’ as it is used in ordinary language and in experimental physics.     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

一类随机过程的多尺度建模

基于多尺度随机模型具有有效性和高度并行算法这一优势，提出如何用三阶树多尺度模型来表示1-D Reciprocal过程；并如何获得多尺度模型的参数。这就为具有Markov统计特性的信号或过程建立起一般的三阶树多尺度随机模型，为更有效的解决实际问题提供了理沦基础，同时，给出了一类定义在单位区间上的随机过程三阶树多尺度表示的仿真示例。     

广义不确定原理对一般静态黑洞熵的影响

把广义不确定原理引入黑洞熵的计算,采用薄膜brick-wall模型,对一般静态黑洞外部标量场的熵进行了计算,得到了熵计算公式.应用该公式结果表明,可以得到已知所有静态黑洞的Bekenstein-Hawking熵.作为比较和进一步研究,对视界面上的二维膜的熵进行计算,可以更方便和一般性地得到熵与视界面积成正比的结论,该讨论可直接表明黑洞熵就是其视界面上的量子态的熵.与原始brick-wall模型不同的是,这一结论是有限的,计算中无需引入截断,且小质量近似也可以避免.     

一些Fuzzy映象的重合度

本文讨论一些Fuzzy映象的重合度的存在性,得出了一些新的重合度定理.本文所得结果统一和发展了引文[5～9]中的许多重要结果.     

Poisson单和—类广义Poisson单的刻划

讨论了Ｐｏｉｓｓｏｎ单和一类广义Ｐｏｉｓｓｏｎ单的基本刻划问题。     

随机Benjamin-Ono 方程初值问题及对河口区域生物分布的应用

该文对具梯度耦合噪声的随机Benjamin-Ono 方程（以下简记为B-O方程）的初值问题导出了解得积分表达式，并将它应用于河口区域生物分布问题，得到了一维空间的分布表达式。     

非线性随机规划问题最优值与最优解的可测性

利用对偶理论与可测集值映射理论等,本文首次证明了一般非线性随机规划问题最优值和最优解的可测性,从而为研究它们的概率分布、矩等分布问题以及一般随机规划问题的实际求解奠定了理论基础.     

减少化验次数的一个优化模型

依据数学理论证明在一定条件下，可以减少化验次数；并给出了选择方法；建立了一个减少化验次数的优化模型。