部件寿命服从威布尔分布时典型系统的寿命与剩余寿命估计

在实际工程中,对系统寿命以及剩余寿命的估计非常重要。在已知系统中部件寿命与可靠度的前提下,关于如何快速得到系统级寿命与剩余寿命的相关研究比较缺乏。针对这一问题,首先研究了可靠度、寿命以及剩余寿命的关系,进一步假设部件寿命服从同一威布尔分布,根据部件的寿命与可靠度函数,推导得到串联、并联和表决系统寿命与剩余寿命期望的封闭表达式,并给出了相应的计算方法。对于冷备系统,当部件寿命服从同一指数分布时,推得了系统寿命及剩余寿命期望的封闭表达式,而当部件寿命服从同一威布尔分布时,给出了系统寿命与剩余寿命的数值计算方法。仿真试验证明本文所提出的方法是准确高效的。最后,以卫星中的动量轮r/n(G)表决系统为例开展了实例研究,证明了该方法在工程实践中的有效性。     

Reconsideration on Homogeneous Quadratic Riemann Boundary Value Problem

The homogeneous quadratic Riemann boundary value problem (1) with Hoelder continuous coefficients for the normal case was considered by the author in 1997. But the solutions obtained there are incomplete. Here its general method of solution is obtained.     

含量子点的A-B环中的持续电流(PC)与环尺寸的关系

对处于磁场中的近藤体系的闭合点环系统，其基态性质用单一杂质安德森模型哈密顿量加以研究；该哈密顿量是用平均场理论Slave—Boson技术求解。结果表明：由磁场感应的电流与系统字称和环的尺寸大小有很大关系，通过理论研究得出一些新的结论并探讨了一些相关问题。     

Static extracting method of software intended behavior based on API functions invoking

The method of extracting and describing the intended behavior of software precisely has become one of the key points in the fields of software behavior＇s dynamic and trusted authentication. In this paper, the author proposes a specified measure of extracting SIBDS （software intended behaviors describing sets） statically from the binary executable using the software＇s API functions invoking, and also introduces the definition of the structure used to store the SIBDS in detail. Experimental results demonstrate that the extracting method and the storage structure definition offers three strong properties： （i） it can describe the software＇s intended behavior accurately; （ii） it demands a small storage expense; （iii） it provides strong capability to defend against mimicry attack.     

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

The harmonic decomposition reconstruction for the exponential radon transform

The exponential Radon transform, a generalization of the Radon transform, is defined and studied as a mapping of function spaces. It is represented in terms of Fourier transform of its domain and range, and this leads to the harmonic decomposition reconstruction. The results are similar results of Tretiak and Metz. Foundation item: Supported by the National Natural Science Foundation of China (No. 19971064), Key Project of Science and Technology of Hubei Province Education Committee. Biography: Wang Jin-ping (1963-), male, Ph.D. candidate, research direction: numberical solution of singular integral equation and integral transformation etc.     

基于DirectX的视频编程

介绍了采用DirectX技术的微机上进行视频编程的原理，并给出了视频叠加的应用例子。     

上皮生长因子预防心脏术后心包粘连的实验及临床研究

目的探讨上皮生长因子(EGF)对心脏术后心包粘连的预防作用.方法术中对犬心包内喷洒上皮生长因子3个月后,观察心包粘连情况;选先天性心脏病、房缺及室缺病人40例,术中心包内喷洒上皮生长因子,术后6个月、12个月经CT检查,判定心包粘连、增厚结果.结果在动物实验和临床研究中,实验组粘连程度显著低于对照组(P<0.01).结论 EGF心包内应用有明显预防心脏术后心包粘连的作用.     

Resource Search in Unstructured Peer-to-Peer System Based on Multiple-Tree Overlay Structure

We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit the heterogeneity of peers in each cluster by connecting peers with more capacities closer to the root of the tree. The capacity of a peer can be defined in different ways （e.g. higher network bandwidth, larger disk space, more data items of a certain type etc.） according to different needs of users or applications.