基于小波变换的雷达目标回波信号提取算法

随着雷达技术的快速发展,低信噪比(signal-to-noise ratio, SNR)条件下的雷达目标信号提取越来越重要。传统的脉冲压缩算法在低SNR条件下作用不明显。提出了一种新的在低SNR条件下的雷达目标回波信号提取算法。该算法在传统脉冲压缩算法的基础之上,采用小波变换对脉冲压缩后的信号进行分解,提取信号高频信息的小波系数。再用改进的小波变换模极大值算法对信号的高频信息进行去噪,然后重构信号的高频信息,最后再重构完整的雷达目标回波信号。仿真结果表明,该算法能够有效地去除噪声,提取出雷达目标的回波信号,相比于脉冲压缩算法及其他算法性能得到了很大的提升。     

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.     

强迫布鲁塞尔振子双稳周期吸引子的初值流域

本文利用数值方法,在几组典型参数值下,详细地考察了弱耦合强迫布鲁塞尔振子在超临界情况下双稳周期运动的周期与初值的关系。首次在初值平面x_0—y_0上的一定范围内,给出了导致不同周期运动的初值分布(流域)。计算结果还表明:在此范围内不存在多重稳定态,因而从一个方面进一步加强了弱耦合条件下的强迫布鲁塞尔振子与圆映象的可比性。     

半光滑方程利用uv-分解理论求解

利用uv-分解理论,将半光滑函数应用到uv-分解中.首先利用半光滑函数的性质,对半光滑函数uv-分解的合理性予以考虑,主要考虑了Lu函数和最优解集W(u)在u-空间的性质,得出了相关的结论和定理,并利用Newton法和得出的性质定理,给出了半光滑方程的另一种求解方法.     

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

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.