基于规则的网状结构目标识别研究

在分析ＥＤＧ图的基础上，针对拱桥图像的网状结构，提出了以有向边缘为属性的ｅｄＮＬＣ图文法及其产生式规则，导出了该类网状结构目标的自上而下的识别算法，模拟实验的结果表明，本算法对网状结构的识别是有效的．     

Spectral analysis of phylogenetic data

The spectral analysis of sequence and distance data is a new approach to phylogenetic analysis. For two-state character sequences, the character values at a given site split the set of taxa into two subsets, a bipartition of the taxa set. The vector which counts the relative numbers of each of these bipartitions over all sites is called a sequence spectrum. Applying a transformation called a Hadamard conjugation, the sequence spectrum is transformed to the conjugate spectrum. This conjugation corrects for unobserved changes in the data, independently from the choice of phylogenetic tree. For any given phylogenetic tree with edge weights (probabilities of state change), we define a corresponding tree spectrum. The selection of a weighted phylogenetic tree from the given sequence data is made by matching the conjugate spectrum with a tree spectrum. We develop an optimality selection procedure using a least squares best fit, to find the phylogenetic tree whose tree spectrum most closely matches the conjugate spectrum. An inferred sequence spectrum can be derived from the selected tree spectrum using the inverse Hadamard conjugation to allow a comparison with the original sequence spectrum. A possible adaptation for the analysis of four-state character sequences with unequal frequencies is considered. A corresponding spectral analysis for distance data is also introduced. These analyses are illustrated with biological examples for both distance and sequence data. Spectral analysis using the Fast Hadamard transform allows optimal trees to be found for at least 20 taxa and perhaps for up to 30 taxa. The development presented here is self contained, although some mathematical proofs available elsewhere have been omitted. The analysis of sequence data is based on methods reported earlier, but the terminology and the application to distance data are new.     

一种进行屏幕图形打印的C函数原理与实现

C语言具有很强的功能,但没有支持图形打印的库函数。本文阐述如何使用汇编语言编制可被高级C语言调用的函数的原理和方法,以实现屏幕任一区域内的图形打印。所述原理和方法可推广应用于其它高级语言。     

寻优平衡量化的小波变换图像压缩编码器

提出一种基于小波变换WT的图像压缩的编码方法—“子树寻优平衡量化法” ,并在实践中收效良好     

Walsh平面上调幅Hilbert变换的一致有界性

摘要：给出了调幅Hilbert变换的Walsh模型,并证明了这些算子在Lp空间上的一致有界性.     

基于小波变换的弹射加速度滤波分析

根据小波分解与重构理论，对弹射加速度信号进行多尺度的小波变换，即用不同中心频率的带通滤波器对信号滤波，把主要反映噪声频率的那些尺度的小波变换去掉，再把剩余各尺度的小波变换结合起来，作小波重构变换，从而得到较好地抑制了噪声的信号。     

The Edge-pancyclicity of Generalized Hypercubes

Generalized hypercubes （denoted by Q（d1,d2,... ,dn）） is an important network topology for parallel processing computer systems. Some methods of forming big cycle from small cycles and links have been developed. Basing on which, we has proved that in generalized hypercubes, every edge can be contained on a cycle of every length from 3 to IV（G）I inclusive and all kinds of length cycles have been constructed. The edgepanciclieity and node-pancilicity of generalized hypercubes can be applied in the topology design of computer networks to improve the network performance.     

共轭对称和共轭反对称新序列的构造与应用

本文通过对共轭对称序列和共轭反对称序列的分析,指出了一种构造新序列的方法,新序列保持了原序列的性质,用途却比原序列要广。文章着重讨论了新序列在DFT(Discrete Fourier Transform)方面的应用,通过计算一个复序列的N点DFT,便可获得四个实序列的N点DFT。     

用二进小波变换处理电磁脉冲数据

利用二进小波变换极大模图能将信号的奇异性和噪声分开的特点，在模拟核电磁脉冲中，对钢筋混凝土建筑物内部产生影响的实验中所测得的场强数据检测不连续点和进行了去除噪声的处理。     

有机物溶解度和辛醇/水分配系数的QSPR研究

通过对分子图的顶点和边同时着色得到染色分子图,借助于相对键长和点价δｉ来分别代替拓扑距离以及顶点度ｖｉ,并结合邻接矩阵和距离矩阵提出了一个用于表征含多重键,杂原子化合物的拓扑指数Ｘｕ,研究了拓扑指数与醇,醚,酯,酮和烷基苯的溶解度,正辛醇／水分配系数的相关性。