采用时空混沌耦合映象格子产生混沌扩频序列

利用耦合映象格子这一具体的时空混沌模型来产生混沌扩频序列，研究了产生混沌扩频序列的方法，并对序列特性进行了分析，结果证明产生出来的序列扩频特性性能良好，可以应用于扩频通信系统。     

A genetic algorithm on multiple sequences alignment problems in biology

The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence similarity involves the consideration of the possible sequence alignments in order to find an optimal one for which the “distance” between sequences is minimum. In biology informatics area, it is a more important and difficult problem due to the long length (100 at least) of sequence, this cause the compute complexity and large memory require. By associating a path in a lattice to each alignment, a geometric insight can be brought into the problem of finding an optimal alignment, this give an obvious encoding of each path. This problem can be solved by applying genetic algorithm, which is more efficient than dynamic programming and hidden Markov model using commomly now. Foundation item: Supported by Zi-qiang Foundation of Wuhan University and Open Foundation of the State Key-Laboratory of Software Engineering, Wuhan University Biography: Shi Feng(1966-), male, Associate professor, research direction: bioinformatics.     

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.     

独立随机变量第k个最大值的密度函数的局部一致收敛

ξ_1,ξ_2,…,ξ_n是独立同分布随机变量,公共分布函数F(x)绝对连续,g_n.k(x)为ξ_1,…,ξ_n的第k个规范化最大值的分布密度函数.本文讨论了g_n,k(x)的局部一致收敛性以及在L_p(O相似文献   

Banach空间中混合型非线性积分──微分方程的最大解和最小解

在弱序列完备的Ｂａｎａｃｈ空间中，利用推理论和单调迭代方法，研究了混合型非线性积分－微分方程初值问题最大解和最小解的存在性。其结果改进和推广了许多已知的结果。     

收敛复数列空间上的Taylor猜想

本文证明,取值于收敛复数列Banach空间c的随机元列Vn,不能同时满足EV_n=0,||V_n||≡1及||∑_(i=1)~nV_1/n||≡1.c为收敛实数列空间时,这是Taylor在Stochastic Convergence of Weighted sums of Random Elementsin Linear Spaces,Springer,107面中提出的一个猜想,已被作者解决,并在1986年世界数学家会议上宣读,当时有人问,c能否是收敛复数列空间?本文回答了这个问题.     

m序列法测量室内脉冲响应的非线性失真分析

m序列法测量室内脉冲响应已经被广泛接受，鉴于实际系统中的噪声和非线性会降低脉冲响应测量的精确性，对m序列法测量过程中室内系统微弱非线性所引起的失真进行了分析．叠加有微弱非线性的室内系统在时域可以等效为一个线性子系统和非线性无记忆环节的级联模型．根据该模型，推导了单一非线性作用下运用m序列法测量的室内脉冲响应误差，并且分析了该方法对各阶非线性的抑制能力．仿真实验验证了推论的正确性．     

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.     

二重序列空间｜pq的对偶空间（0〈p，q〈1）

研究了当0〈P〈1，0〈q〈1时二重序列空间｜pq的对偶空间以及当p为区间（0，1）中的序列且q〉1时的赋准范二重序列空间的对偶空间，证明了在0〈p，q〈1时lpq韵对偶空间是l∞，∞。而在第二种情况下它的对偶空间是l∞u，其中，u〉1，1/q＋q/u=1。