DNA计算研究概述与分析

基于生化反应机理的DNA计算模型受到科学领域内许多不同学科学者们的关注。DNA计算已经形成国际科学前沿领域内研究的一个新的热点。主要介绍了Sticker模型的应用及布尔电路的仿真应用,并分析了DNA计算模型中存在的问题。最后,简要介绍了DNA计算研究存在的问题及未来的研究方向。     

Closed circle DNA algorithm of change positive-weighted Hamilton circuit problem

Chain length of closed circle DNA is equal. The same closed circle DNA's position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions axe composed. Then, the feasible solutions axe filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment axe discussed.     

贝叶斯网络推理的一种高精度仿真算法

简要分析了贝叶斯网络推理算法的现状,提出了基于马氏链随机拟蒙特卡罗算法(MCRQMC)的推理方法.在给出高精度推理结果的同时,该推理算法亦能给出推理结果的标准偏差.从理论上对MCRQMC算法与现有的算法进行了比较分析,并采用随机Halton序列、Sobol序列和普通随机序列进行了推理实验.结果表明MCRQMC算法在同样样本数量的情况下,推理精度显著优于现有算法.     

时间Petri网与遗传-蚁群算法相结合的并行测试研究

自动测试系统中并行测试任务调度方案一直是尚未解决的难题.在基于Petri网理论的基础上,建立了并行测试的时间Petrl网模型,并且首次将遗传-蚁群算法引入到时间Petri网的变迁序列的寻找过程中,快速地求得了最优调度方案.仿真结果表明,该算法能够以较大的收敛概率快速地收敛,最终得到最优变迁序列.     

混合方法优化的自适应引力搜索算法

针对引力搜索算法存在的易早熟收敛、易陷入局部最优、搜索精度有待提高等缺陷,提出一种混合方法优化的自适应引力搜索算法（gravitational search algorithm,GSA）。首先利用Sobol序列初始化种群,增强算法全局搜索能力;其次引入Hamming贴进度计算种群成熟度,判断种群是否早熟;然后引入Logistic混沌对种群作混沌搜索,变异已陷入局部最优的粒子位置;最后基于早熟收敛判断因子改进引力系数,并为粒子位置公式添加收缩因子,促使种群加快脱离局部最优。对9个不同类型的基准测试函数做仿真实验,结果表明新算法能有效改善种群的早熟问题,具备更好的寻优性能。     

结合伪随机特征码的多序列跳频通信方法

针对多序列跳频(multi-sequence frequency hopping, MSFH)通信系统在对偶信道存在干扰信号的情况下易引发误码的问题,提出了结合伪随机特征码的MSFH(pseudo-random feature coding MSFH, PRFC-MSFH)通信方法。在信道频率间隔内调制伪随机特征码作为信号来源的特征信息,减少对偶信道受干扰的影响,达到抗干扰目的。建立了PRFC-MSFH发射接收通信模型,根据模型推导了PRFC-MSFH在不同干扰下的误码性能。仿真结果表明, PRFC-MSFH在跟踪干扰条件下较常规跳频约有3~5 dB性能增益,在最坏多音干扰条件下较MSFH有约6~7 dB性能增益,具有较强的综合抗干扰能力。     

基于傅立叶变换的积分算法研究

在信号分析与处理中,常涉及的积分变换是傅里叶变换(FT)、傅里叶级数(FST)、傅里叶Z变换(FZT)及离散付里叶变换(DFT)。本文通过分析FT与FST、FZT、DFT的关系,提出一种基于FT计算FST、FZT、DFT的新算法,并通过例子说明这种算法的实用性。     

一种探测shill出价的数据挖掘模型

随着网上拍卖规模的不断扩大，作为最具隐蔽性的在线欺诈形式，shill出价开始引起人们的广泛关注，但由于传统拍卖理论缺乏对shill出价理论的研究，致使至今仍无有效的方法制约shill出价。本文通过引入生物信息学方法，模拟生物基因的遗传变异特性，在基于shill出价规律序列具有遗传变异的基础上，提出了一种探测shill出价规律序列的数据挖掘模型，模型克服了传统方法因shill可能频繁变更用户ID而失灵的问题。     

ASYMPTOTIC NORMALITY OF SOME ESTIMATORS IN A FIXED-DESIGN SEMIPARAMETRIC REGRESSION MODEL WITH LINEAR TIME SERIES ERRORS

Consider a semiparametric regression model with linear time series errors Yk = x'kβ g(tk) εk, 1 < k < n, where Yk's are responses, xk = (xk1,xk2,..... ,xkp)' and tk ∈T ∪R are fixed design points, β= (β1, β2, ....., βp)' is an unknown parameter vector, g(.) is an unknown bounded real-valued function defined on a compact subset T of the real line R, and εk is a linear process given by εk = ∑j=0∞j(?)ek-j,(?)= 1, where , are i.i.d. random variables. In this paper we establish the asymptotic normality of the least squares estimator of β, a smooth estimator of g(.), and estimators of the autocovariance and autocorrelation functions of the linear process εk.     

The Research on Ordering Structure of Credit Targets

We put forward the credit targets sequences set and ordering structure of credit targets sequences and the dominance structure in credit targets sequences set. We also give a model to evaluate customer‘s credit by the deviation.