动态规划法求解加工顺序问题的研究

提出动态规划法求解加工顺序问题的方法,分析最优子结构性质,建立最优值的递归关系式,分析Johnson-Bell-man’s Rule并设计算法流程,最后通过构造实例表明了算法的有效性。     

Blind estimation of the PN sequence in lower SNR DS-SS signals with residual carrier

This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR.     

Quantification of secondary structure prediction improvement using multiple alignments

The use of multiple sequence alignments for secondary structurepredictions is analysed. Seven different protein families, containingonly sequences of known structure, were considered to providea range of alignment and prediction conditions. Using alignmentsobtained by spatial superposition of main chain atoms in knowntertiary protein structures allowed a mean of 8% in secondarystructure prediction accuracy, when compared to those obtainedfrom the individual sequences. Substitution of these alignmentsby those determined directly from an automated sequence alignmentalgorithm showed variations in the prediction accuracy whichcorrelated with the quality of the multiple alignments and distanceof the primary sequence. Secondary structure predictions canbe reliably improved using alignments from an automatic alignmentprocedure with a mean increase of 6.87percnt;, giving an overallprediction accuracy of 68.5%, if there is a minimum of 25% sequenceidentity between all sequences in a family.     

Fingerprinting G-protein-coupled receptors

Recently we reported the design of a discriminating fingerprintfor rhodopsin-like G-protein-coupled receptors (GPCRs). Thefingerprint encodes the seven putative membrane-spanning motifsand was potently diagnostic of all GPCRs (52 in all) in version8.1 of the OWL composite sequence database, readily distinguishingthem from all other integral membrane proteins. With a 3-foldincrease in the size of OWL, the fingerprint has been updatedand now finds 332 receptors that match all the motifs. The situation,however, has grown in complexity: 61 sequences make imperfectmatches with the fingerprint, yielding a total of 393 ‘hits’.The bulk of the partial hits are olfactory receptors: theseappear to fall into discrete subfamilies in which one or moreof the transmembrane motifs are either poorly matched or arenot matched at all. These results are supported by preliminaryphylogenetic analyses, which show the olfactory and variousother partial matches clustering away from the main body oftrue hits. The approach has provided a powerful diagnostic toolfor identifying GPCRs, and results are consistent with previousobservations that the pheromone, cAMP and secretin-like receptorsbelong to separate families-these bear their own unique sequencefingerprints by which they may be distinguished from the rhodopsin-likesuperfamily     

中国狂犬病毒疫苗株CTN-1-V三个代次的GP基因序列分析

目的分析三个代次CTN-1-V病毒株糖蛋白(GP)基因部分序列,并与代表性街毒株进行比较。方法利用RTPCR反应,从感染了CTN-1-V病毒的小鼠脑内获得GPcDNA的部分片段,并进行序列测定。结果三个代次的CTN-1-V病毒株GPcDNA序列的690个核苷酸与代表性狂犬病毒GP核苷酸相应序列同源性为83.2%～96.8%,氨基酸序列同源性为90.0%～97.4%。CTN1V株三代之间的核苷酸序列几乎相同。结论CTN1V株在传代过程中GP基因结构基本稳定,与中国流行的代表性街毒株的同源性高于aG株和PV株。     

基于多混沌系统的彩色图像加密方法

为了提高彩色图像加密的安全性和加密性能,设计了一种基于多混沌系统的彩色图像加密方法.将一个彩色图像分解为R、G、B三个灰度图像,使用MD5算法动态生成加密算法的初始值,然后使用三种不同的基于混沌的加密结构对三个图像进行加密.对R图像使用Feistel结构加密,其中Feistel结构的S一盒由Logistic混沌序列和Hyperhenon混沌序列组合产生;对G图像使用由Lorenz系统产生加密序列对图像进行代替和置换操作的加密结构;对B图像使用由分段线性混沌映射产生加密序列,然后加密图像的加密结构,再把加密后的图像结合起来生成加密后的图像.理论分析和实验结果表明,该加密方法能够较为有效地保证彩色图像加密的安全性.     

时间Petri网与CAGA算法相结合的并行测试研究

在并行测试的研究中对于任务的测试次序一直是个研究重点及难题。用时间Petri网建立关于并行测试系统的模型,并首次用元胞遗传算法(CAGA)对模型中的变迁序列进行搜索,快速得到最好的测试序列。通过仿真结果表明,该算法展示了很好的收敛效果,并且与已有的研究成果相比更具优势。     

RT-PCR法检测庚型肝炎病毒C(GBV-C)RNA

应用RT－PCR法在非甲～非戊型肝炎患者血清及单采浆站供血员血浆中检测到GBV－CRNA，扩增产物经序列测定进一步确证，在30例非甲～非戊型肝炎患者中阳性率为6．6％；在600例单采浆供血者血浆中阳性率为0．33％。提示GBV－C可能不是非甲～非戊型肝炎的主要致病因子，可能存在GBV－C健康携带者。     

催化剂烧炭再生模拟和分析

催化剂烧炭再生是非定态过程。本文建立了绝热反应器内催化剂烧炭模型,利用移动边界正交配置法求解。以结炭的BO2催化剂再生为工作反应,模拟预测与实验值吻合良好。模拟计算表明,用递升进口温度序列烧炭,使再生时间明显缩短。     

基于引力搜索算法的分数阶变异时序回归GSA-TSGM(1,1)模型

为了利用分数阶累加算子在灰色短期预测中的高效性能,首次将分数阶累加算子引入变异时序回归模型以期取得更高的预测精度。主要方法如下：首先取湖北省链子崖某监测点1978—1987年的十年数据作为训练集并使用引力搜索算法确定最佳分数阶累加阶数,而1988—1993年的六年数据作为验证集验证提出的模型;其次对比了经典灰色模型GM(1,1)、分数阶累加灰色模型、变异时序回归模型TSGM(1,1)三种灰色模型。结果如下：首先修正了陈西江等人变异时序回归模型仿真时出现的错误,其次表明了相比于其他的模型,基于引力搜索算法的分数阶累加时序回归模型在进行灰色长期预测中具有较高的预测精度。因此,通过分数阶累加算子提高了灰色理论中长期预测模型的精度,为灰色长期预测提供了指导。