基于后验风险确定故障样本量的Bayes方法

针对目前测试性故障样本量的确定方法过于粗糙和试验样本量过大的问题,提出了合理运用信息熵方法对装备系统各单元的测试性先验信息进行信息融合,得到装备系统级测试性试验数据。在此基础上得到测试性指标的先验分布,并进一步通过Bayes后验风险准则确定故障样本量及试验方案。以某型电动舵机系统各模块的试验数据为例,以故障检测率为测试性指标,经过分析和计算,发现运用所提方法得到的故障样本量相比传统方法明显减少,从而减少了试验成本,同时得到的测试性指标相对误差较小,保证了可信度。     

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.     

西文期刊回溯建库中几个重要项目的著录

在实践的基础上，从期刊的出版日期、出版周期、卷、期、年、月及其他标识、ISSN、增刊、出版者以及期刊的历史发展等方面对西文期刊机读目录的标准化著录问题进行了探讨。     

关于21世纪图书馆员继续教育问题的思考

论述了21世纪对图书馆员进行继续教育的必要性，介绍了图书馆员继续教育的内容，针对我国图书馆员继续教育的状况，提出了应采取加大投入、进行针对性培训、运用激励机制等措施来加强对图书馆员的继续教育。     

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