SOME NEW ASPECT OF LYAPUNOV TYPE THEOREMS FOR STOCHASTIC DIFFERENCE EQUATIONS WITH CONTINUOUS TIME

Some new Lyapunov type theorems for stochastic difference equations with continuous time are proven. It is shown that these theorems simplify an application of Lyapunov functionals construction method.     

CXFTV2: A Fortran subroutine for the discrete least squares convex approximation

A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software.     

空气调节中加湿处理的方案选择--某商标编织车间的空调设计

本文针对散热量大 ,散湿量小并要求控制室内相对湿度的场所进行了空调方案的分析比较 ,由此选择了一种比较节能和节省投资的空调设计方案。     

我国和奥地利普兰西公司的钨、钼产品及其差距

对奥地利普兰西公司作了简要介绍，并将我国的钨、钼产品标准和普兰百公司的钨、钼产品、规格进行了对比。根据差距提出了我国钨、钼产品今后的发展方向。     

Ray-cast volume rendering accelerated by incremental trilinear interpolation and cell templates

Two related ideas for improving the speed of ray-cast volume rendering are studied in this paper. The first is an incremental algorithm for trilinear interpolation, a method commonly used in ray-cast volume rendering to calculate sample values. The incremental algorithm can expedite trilinear interpolation when many samples along a ray are located in one cell. The second is an efficient hybrid volume rendering restricted to parallel projection. In the preprocessing stage, acell template is created to store the information used by the incremental trilinear interpolation. When a cell is parallel projected, the information is retrieved from the template to compute the cell contribution. Because the algorithm with only one template may cause aliasing, an antialiasing technique exploiting multiple cell templates is proposed. With our method, ray-cast volume rendering can be accelerated considerably.     

智能视频监控中运动目标检测的研究

针对某武器试验中背景复杂,现有的背景差分法在背景模型的维持和更新不能用于长期和复杂的场景,以及对近地目标提取检测困难的问题,提出一种改进的背景差分法。该算法采用结合邻域信息的背景差分法和最大方差阈值法,能够在一定程度上减小背景滞后更新引起的运动目标检测误差,且使目标边缘提取更加明确,从而提高了系统的运行速度,实现复杂背景下的运动目标检测。在Visual C＋＋6.0中用OpenCV实现了相关算法的设计,并给出了完成系统任务所需的部分关键代码,实现了运动目标和试验场景的分离与提取。仿真实验验证了该算法的有效性以及实时性。     

一种简化的三维模糊制器

针对三维模糊控制器规则多,结构复杂,难以实现的问题,提出了一种简化的三维模糊控制器。该方法是把三个输入量分别为偏差、偏差变化、偏差的偏差变化的一维模糊控制器加权融合实现简化的三维模糊控制器。并提出了根据不同类型的被控对象设置三个加权系数。加权系数具有粗调、细调和微调的作用,类似于传统PID调节器的比例、积分和微分,实现对系统静差的消除。     

人群头发元素分布及某些特征研究

本文介绍用堆中子活化分析法测定人群头发中I、Br、Mg、Mn、Cu、Na、V、Cl、Al、Ca、S等11种元素。研究人发中元素分布特征、相关性特征、性别年令分布特征。方法学中还从法庭科学应用角度介绍同一性识别中差异率和重合几率的双判据方法。     

Local artificial boundary conditions for Schrödinger and heat equations by using high-order azimuth derivatives on circular artificial boundary

The aim of the paper is to design high-order artificial boundary conditions for the Schrödinger equation on unbounded domains in parallel with a treatment of the heat equation. We first introduce a circular artificial boundary to divide the unbounded definition domain into a bounded computational domain and an unbounded exterior domain. On the exterior domain, the Laplace transformation in time and Fourier series in space are applied to achieve the relation of special functions. Then the rational functions are used to approximate the relation of the special functions. Applying the inverse Laplace transformation to a series of simple rational function, we finally obtain the corresponding high-order artificial boundary conditions, where a sequence of auxiliary variables are utilized to avoid the high-order derivatives in respect to time and space. Furthermore, the finite difference method is formulated to discretize the reduced initial–boundary value problem with high-order artificial boundary conditions on a bounded computational domain. Numerical experiments are presented to illustrate the performance of our method.