刺纹车轮虫 18S rDNA 克隆与序列分析

首次对刺纹车轮虫(TrichodinacentrostrigataBasson,VanAs & Paperna, 1983)进行了 18S rDNA 的克隆测序并分析，研究结果显示：刺纹车轮虫是一种具有辐射状中央颗粒的淡水车轮虫，具有相对较高的 GC 含量而位于分子系统树的顶枝，它与海水环境中的车轮虫具有较高的序列相似性及较近的遗传距离从而聚为一枝。研究提示刺纹车轮虫具有较强的宿主适应性，在系统进化中分化较晚并与海水种类具有较近的亲缘关系；此外，车轮虫的同源性与 18S rDNA序列相似性、遗传距离具明显相关性，GC 含量与分子支序树分枝具有明显相关性。
     

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.     

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

C~3I系统工程可靠性评估技术研究

针对Ｃ￣３Ｉ系统分层管理拓扑结构模式，文章重点对系统可靠性度量指标及其相互关系、系统可靠性模型设计与可靠度计算等重要技术进行了研究。本文可对Ｃ￣３Ｉ系统工程总体技术设计可行性论证，以及系统验收评审提供参考。     

CNC系统中任意三维椭圆弧的高速插补新方法

本文根据两步递归插补的思想,导出了任意三维椭圆弧高速插补的公式和算法.它是空间圆弧高速插补方法在三维椭圆弧的情况下进一步推广应用.本文最后还对插补算法进行了稳定性分析和误差分析.     

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.     

On the verge of <Emphasis Type="Italic">Umdeutung</Emphasis> in Minnesota: Van Vleck and the correspondence principle. Part one

In October 1924, The Physical Review, a relatively minor journal at the time, published a remarkable two-part paper by John H. Van Vleck, working in virtual isolation at the University of Minnesota. Using Bohr’s correspondence principle and Einstein’s quantum theory of radiation along with advanced techniques from classical mechanics, Van Vleck showed that quantum formulae for emission, absorption, and dispersion of radiation merge with their classical counterparts in the limit of high quantum numbers. For modern readers Van Vleck’s paper is much easier to follow than the famous paper by Kramers and Heisenberg on dispersion theory, which covers similar terrain and is widely credited to have led directly to Heisenberg’s Umdeutung paper. This makes Van Vleck’s paper extremely valuable for the reconstruction of the genesis of matrix mechanics. It also makes it tempting to ask why Van Vleck did not take the next step and develop matrix mechanics himself. This paper was written as part of a joint project in the history of quantum physics of the Max Planck Institut für Wissenschaftsgeschichte and the Fritz-Haber-Institut in Berlin.