工程弹性系统与系统弹性理论研究综述

工程弹性系统(engineered resilient system,ERS)是美国国防部(department of defense,DOD)应对越来越不确定的任务和环境而提出的未来国防系统发展战略,对复杂系统的工程实践与系统弹性理论都带来新的挑战。首先,对ERS提出的背景和相关概念进行介绍,重点对美国国防领域对ERS的一些观点进行分析,包括ERS的关键属性、弹性工程与现役系统关系、ERS设计中考虑的因素和ERS与系统工程的关系等,并对美国DOD优先立项的ERS项目研究进展进行了的研究。其次,对弹性相关的学术研究进行了述评,包括不同领域中弹性的概念、系统弹性不同的评价方法以及系统弹性设计方法,以便于对ERS的发展有一个较为全面的了解和借鉴。最后,在ERS发展研究基础上,从理论和应用角度对ERS和系统弹性理论面临的挑战进行了讨论。     

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.     

校园网络用户资料WEB管理系统初探

介绍了校园网络用户资料如何用WEB页面来进行管理。通过ASP ACCESS数据库的方式实现对用户资料的添加、查询、修改等功能。     

苄基氯制备技术分析

本文是苄基氯制备工艺技术分析的文献综述。     

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.     

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.