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.     

Comparison of Drought-Resistance about Three Wild Rocky-Grasses

In this experiment, using the methods of drought-stress in the pot and PEG simulative drought-stress, three native rocky-slope grasses Pogonatherum panideum（Lam.） Hack, Erioophorum comosum nees and Cynodon dactylon cultivated in the pots were selected as materials to study their drought-resistance by analyzing the indexes such as the leaf area index, the drying roots accumulation, the holding water ability of leaf, the relative conductance of leaf, the soluble protein, chlorophyll. At the same time, by comparing with membership function value of each index, the order of each grass drought-resistance was decided. The results showed that the drought-resistance of Erioophorum comosum nees was stronger than Cynodon dactylon and drought-resistance of Cynodon dactylon was stronger than Pogonatherum panideum （Lam.） Hack. The purpose of the experimental results was to find theoretical foundations for selecting and cultivating native protecting-slope vegetations to adapt to rocky slopes.     

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

Therapeutic applications of bone marrow-derived stem cells in liver transplantation for end-stage liver diseases

Today, liver transplantation (LT) is the only established treatment for end-stage liver diseases. The de- velopment of LT, including OLT, cadaveric LT, split LT, living donor LT (LDLT), brings hopes to patients with these diseases. However, increasing donor shortage, rejection and life-long immunosuppression with its side effects are the major limitations of this therapy strategy. Bone marrow-derived stem cells (BMDSCs) are capable of differentiating into hepatocyte-like cells and contribute to liver injury repair. The microenvironment of liver injury caused by rejection, ischemia/reperfusion, loss of liver mass, recurrence of HCV and "small-for-size syndrome" after LT can attract a variety of bone marrow-derived stem cell population to the peripheral circulation and then migration to the injury liver to promote the hepatic function restoration. Additionally, BMDSCs can also take part in the functional regeneration of living donor liver after LDLT. This participation in liver regeneration may be associated to the interac- tion between SDF-1and its receptor CXCR4, involving HGF, IL-8, MMP9, and VEGF/VEGFR-2. BMDSC with its bio-characteristics could maintain the allograft tolerance from different angles and in different ways. In conclusion, BMDSCs transplantation, as a new assistant therapeutic method for LT, will ex- pand the space of LT, and provide more survival opportunities for the patients suffering liver diseases in the future.     

网络路由收敛性能测试研究

在网络建设和运行中,采用测试的方法对其性能进行评估对于网络的正常运营具有重要的意义.本文研究了网络路由收敛性能测试方法,为得到路由收敛性能指标,对OSPF和iBGP的路由收敛时间进行了测量.提出了一种简化的路由收敛时间测量方法,通过测量数据平面的传输性能指标,对路由控制平面的收敛时间进行估算.该方法对于测试设备要求不高,实施简单方便.采用该方法在CERNET2投入运营之前对其进行了路由性能测试,实验结果表明CERNET2在路由变化时具有较好的路由收敛性能.     

MIS新思维软件工具的设计与实现

本文针对目前陈旧的管理软件的设计方法提出了一种新的观点,同时探讨了为实现这种新观点而研制的软件工具的设计方法和实现技巧。     

再议网络图的逻辑同构变换

图对同一个逻辑问题可有不同的表达方式，在必要时需进行逻辑同构变换＾［１］。本文对“节点型网络向箭线型网络的逻辑风构变换”的研究进行了补充，增加了三种情况的图开有子模，进一步谁了逐节生长法的通用性。同时，提出了箭线型网络向节点型网络逆向变换的算法；逐线收缩法。     

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.