个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

基于多相滤波器的信道化接收机及其应用研究

本文主要研究了应用多相滤波技术的信道化接收机建模问题。在给定信道频谱划分方案下,推导了基于多相 滤波器的信道化接收机数学模型。并由此模型设计了一个四信道模拟系统。最后用仿真实验结果验证了模型的正确性。     

频谱分解技术在塔里木盆地北部TH地区碳酸盐岩缝洞型储层预测中的应用

本文从频谱分解技术的基本原理及计算方法入手,根据正演模型,通过对比缝洞型储层与地震反射特征的关系,总结出储层发育的反射特征,相应地精细调整频谱分解处理参数,进而进行预测。通过与钻井资料对比可知,频谱分解技术可以刻画不同频率强反射、弱反射的边界。     

Mesh结构P/G布线网络层次化快速分析方法

本文提出了一个基于网络划分的P／G布线网络层次化快速分析方法。其中，对于子网运算，通过对Cholesky分解法三角化对称正定阵的图模型分析，并基于Mesh结构网络的自身特点，提出了一个基于图顶点排序的加速子网分析运算策略；并用基于MPI的并行结构实现了P／G布线网络分析的并行运算。     

用于快速P/G网分析的Cholesky分解法图模型

通过对Cholesky分解法求解线性方程组的分析，建立Cholesky分解法三角化对称正定阵的图模型，并基于该模型及Mesh结构P／G网络的自身特点，提出一个P／G网快速分析算法．实验证明，该算法能大大降低Mesh结构P／G网络的分析运算时间和内存占用．     

接收机有限带宽对多相码数字脉压的影响

限制接收机带宽是雷达系统中提高信噪比(SNR)的常用方法,相应的也会引起输出波形的失真。本文主要分析了多相码数字脉压雷达系统中,接收机有限带宽对脉压输出结果所造成的影响。运用五点滑动窗平均法在计算机上进行了模拟,并给出了仿真结果。     

On the solvability of the positive real lemma equations

In this paper, we consider the classical equations of the positive real lemma under the sole assumption that the state matrix A has unmixed spectrum: σ(A)∩σ(−A)=. Without any other system-theoretic assumption (observability, reachability, stability, etc.), we derive a necessary and sufficient condition for the solvability of the positive real lemma equations.     

Eigensolution of specially structured matrices with hyper‐symmetry

Recently, four canonical forms have been developed and applied to the dynamics and stability analysis of symmetric frames. In this paper, hyper‐symmetric matrices and specially structured matrices are defined and efficient methods are proposed for the eigensolution of such matrices. Applications are extended to hyper‐graphs and specially structured graphs. Simple methods are developed for calculating the eigenvalues of the Laplacian matrices of such graphs. The developments presented in this paper can also be considered as generalization of Form II and Form III symmetry, previously defined by the authors. Copyright © 2006 John Wiley & Sons, Ltd.     

A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution

The queue of a single server is considered with independent and identically distributed interarrivai and service times and an infinite (GI/G/1) or finite (GI/G/1/N) waiting room. The queue discipline is non-preemptive and independent of the service times.

A discrete time version of the system is analyzed, using a two-component state model at the arrival and departure instants of customers. The equilibrium equations are solved by a polynomial factorization method. The steady state distribution of the queue size is then represented as a linear combination of geometrical series, whose parameters are evaluated by closed formulae depending on the roots of a characteristic polynomial.

Considering modified boundary constraints, systems with finite waiting room or with an exceptional first service in each busy period are included.     

A robust watermarking algorithm based on QR factorization and DCT using quantization index modulation technique

We propose a robust digital watermarking algorithm for copyright protection.A stable feature is obtained by utilizing QR factorization and discrete cosine transform(DCT) techniques,and a meaningful watermark image is embedded into an image by modifying the stable feature with a quantization index modulation(QIM) method.The combination of QR factorization,DCT,and QIM techniques guarantees the robustness of the algorithm.Furthermore,an embedding location selection method is exploited to select blocks with small modifications as the embedding locations.This can minimize the embedding distortion and greatly improve the imperceptibility of our scheme.Several standard images were tested and the experimental results were compared with those of other published schemes.The results demonstrate that our proposed scheme can achieve not only better imperceptibility,but also stronger robustness against common signal processing operations and lossy compressions,such as filtering,noise addition,scaling,sharpening,rotation,cropping,and JPEG/JPEG2000 compression.