一种适用于高数据速率和高速移动环境的新型信道估计方法——双正交通道信道估计方法

本文给出了一种适用于高数据速率和高速移动环境下的新型有效的信道估计方法-双正交通道信道估计方法(CETOC,Channel Estimation by using Two Orthogonal Channels),这种信道估计方法通过采用两个独立通道的联合估计,可以有效的克服快衰落的影响,从而使得在快衰落信道下应用多维状态调制成为可能.     

用小波变换抑制SAR图像中的斑点噪声

抑制合成孔径雷达图像中的斑点噪声一直是处理图像并得到准确图像信息的难点，提出了一种基于小波变换抑制合成孔径雷达（SAR）图像中的斑点噪声的方法，对原有的小波变换方法作了改进，能更好地保留图像的边缘信息，并能简化计算量。在仿真实验中使用了合成的模拟图像和真实的合成孔径雷图像，并与以往的小波去噪滤波方法以及一些经典的斑点噪声滤波方法（包括中值滤波，Lee滤波，Frost滤波）进行比较，在综合考虑了滤波算法在均匀区域对斑点噪声的抑制能力以及保留边缘信息能力的情况下，提出的算法有更好的效果。     

Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

OFDM系统信道盲估计的一种新算法

利用循环前缀（CP）引入的信息冗余，在利用接受信号的二阶统计特性实现正交频分复用（OFDM）系统信道盲估计的子空间算法基础上，采用矩阵变换的方法，改善信息序列的非周期相关函数，推导出信道估计的新算法。     

降低雷达接收机中噪声的几种方法

噪声是影响雷达接收机灵敏度的重要因素。本文通过讨论雷达接收机噪声的来源，分析并提出了集中降低雷达接收机内部和外部噪声的几种方法，具有一定的实际意义。     

基于AutoCAD2000的图解法确定工艺转角

提出了基于AutoCAD2 0 0 0的图解法求解机械加工过程中工艺转角的问题 ,并针对具体的应用实例给出了圆满的解答 ,并验证了其精度。     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

Wavelet based Denial-of-Service detection

Network Denial-of-Service (DoS) attacks that disable network services by flooding them with spurious packets are on the rise. Criminals with large networks (botnets) of compromised nodes (zombies) use the threat of DoS attacks to extort legitimate companies. To fight these threats and ensure network reliability, early detection of these attacks is critical. Many methods have been developed with limited success to date. This paper presents an approach that identifies change points in the time series of network packet arrival rates. The proposed process has two stages: (i) statistical analysis that finds the rate of increase of network traffic, and (ii) wavelet analysis of the network statistics that quickly detects the sudden increases in packet arrival rates characteristic of botnet attacks.Most intrusion detections are tested using data sets from special security testing configurations, which leads to unacceptable false positive rates being found when they are used in the real world. We test our approach using data from both network simulations and a large operational network. The true and false positive detection rates are determined for both data sets, and receiver operating curves use these rates to find optimal parameters for our approach. Evaluation using operational data proves the effectiveness of our approach.     

Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers

In this paper a set of techniques for improving the performance of the fast Fourier transform (FFT) algorithm on modern vector-oriented supercomputers is presented. Single-processor FFT implementations based on these techniques are developed for the CRAY-2 and the CRAY Y-MP, and it is shown that they achieve higher performance than previously measured on these machines. The techniques include (1) using gather/scatter operations to maintain optimum length vectors throughout all stages of small-to medium-sized FFTs, (2) using efficient radix-8 and radix-16 inner loops, which allow a large number of vector loads/stores to be overlapped, and (3) prefetching twiddle factors as vectors so that on the CRAY-2 they can later be fetched from local memory in parallel with common memory accesses. Performance results for Fortran implementations using these techniques demonstrate that they are faster than Cray's library FFT routine CFFT2. The actual speedups obtained, which depend on the size of the FFT being computed and the supercomputer being used, range from about 5 to over 300%.     

MIMO系统中的分组全分集全码率空时编码

针对未编码的多输入多输出（MIMO，Multi—Input Multi—Output）系统，提出一种复杂度适中的分组全分集全码率（GFDFR，Group—wise Full Diversity Full Rate）空时编码方案。该方案通过在发送端进行天线分组，各组独立编码，减小全分集全码率（FDFR，Full Diversity Full Rate）编码块的大小从而降低系统编解码复杂度；在频率选择性信道中，进一步对子载波分组进行独立编码，获得频率分集（或多径分集），以适中的复杂度在不降低系统分集度的情况下保证了信息的全码率传输，是一种在MIMO信道中极具实用价值的空时编码方案。