知识库中精确知识的判定算法

研究了知识库中挖掘它所包含的精确知识的方法，给出知识库的相关概念及精确知识的定义，讨论了一种在所定义的知识库中提取并判定精确知识的算法．     

水稻苯达松敏感致死基因的RAPD标记的克隆及测序

用3S Spin DNA Agarose Gel Purification Kit试剂盒将与水稻苯达松敏感致死基因相连锁的RAPD遗传标记S20—420和S316—600回收纯化，连接于pGEM—T载体并克隆测序，得到了S20—420和S316—600的全序列，其长度分别为423bp、606bp．将两端序列设计特异PCR扩增引物可用于检测水稻苯达松敏感致死基因和标记辅助育种．     

满江红鱼腥藻glnA基因上游调控区的克隆及其序列分析

以满江红鱼腥藻（Ａａｃ）提取总ＤＮＡ为模板,通过ＰＣＲ技术,扩增得到其谷氨酰胺合成酶基因（ｇｌｎＡ）上游区．经酶切得到４０９ｂｐ的片段,并将其连接到ｐＢｌｕｅｓｃｒｉｐｔⅡｋｓ＋上测序．将测序结果与Ａｎａｂａｅｎａ７１２０调控序列比较,有９８２％的同源性．在上游调控中也具有ｎｉｆｌｉｋｅ和Ｅ．ｃｏｌｉｌｉｋｅ启动子,值得注意的是,调节蛋白ＶＦ１的结合位点正好位于ｎｉｆｌｉｋｅ启动子上．所克隆的片段不但对蓝藻固氮、泌氨的基因调控研究具有意义,也对表达载体的构建具有实用价值．     

一种使用非线性循环数列解决堆栈问题的算法

提出了一种使用非线性循环数列解决堆栈问题的算法,对研究栈的性质和求解栈的输出序列具有一定的实用价值。     

Genomic organization of EDSV strain AA-2

The genomic organization of egg drop syndrome virus strain AA-2 isolated in China is reported here. The genome was found to be 32 838 bp in length, approximately 2 kb shorter than those of the human subgenus C adenoviruses. Analysis of open reading frames indicated that the genes for major viral structural proteins (55 K, Penton base, pⅦ, pⅩ, pⅥ, Hexon, 100 K, pⅧ and Fiber), as well as EP, DNA polymerase and ⅣaⅡ are present in the expected locations in the genome. EDSV possesses no identifiable E3 and E4 regions and most proteins encoded by E3 and E4 regions of other adenoviruses genome were not presented in EDSV.     

综放开采在小峪3^#煤层应用的可行性研究

采用多因素分析综合评价方法,论证了在小峪３＾＃煤层应用综放开采是可行的,并提出了具体实施方案,对矿井生产及类似条件的煤层开发有指导借鉴意义。     

条带采煤法的计算机模拟分析

借助ADINA程序对“采18留18”和“采6留6”两种条采方案的模拟计算.获得了两种方案条带煤柱和开采条带覆岩的应力分布规律、弹塑性状态,并分析、评述了其破坏特点.     

Almost sure convergence of weighted sums of NA sequences

For double arrays of constants {a _ni, 1≤i≤k _n, n≥1} and NA r.v. 's {X _n, n≥1}, conditions for almost sure convergence of are given. Both casesk _n ↑ ∞ andk _n=∞ are treated. A Marcinkiewicz-type theorem for i. d. NA sequences is obtained as a special case. Supported by the National Natural Science Foundation of China Cheng Riyan: born in 1968, MS student     

THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL

For unimodal maps on the interval we prove that, if the kneading sequences (KS) are eventually periodic, then their formal languages are regular ones. The finite automata for such languages are constructed. Comparing with the languages generated by periodic KS, it is shown that the languages here are not finite complement languages.     

粗糙集方法在基于属性分类中的应用

介绍粗糙集基础上的属性分类系统的构造,给出一种数据挖掘中新的分类方法:从初始的数据信息出发,依次构造约简属性集,并对其使用Bayes判别法进行基于属性的分类。最后给出了实例,验证算法的可行性。