"体裁分析"简析

从体裁的概念分析得出：体裁具有社会交际目的特征和特定宏观结构模式；而具体分析某一体裁的宏观结构时，可参照体裁分析理论提出的七个步骤和五种语篇模式的特定结构进行分析，从而达到理解和写作某一体裁的目的。体裁分析理论对第二语言教学有全新的启示。     

从诸葛菜cDNA文库中筛选过氧化物酶基因

在200mmol／L NaCl诱导下构建诸葛菜苗期的cDNA文库，并从cDNA文库中筛选到一个新的过氧化物酶基因OvRCI，该基因cDNA全长1220bp，包含了一个1128bp的开放阅读框．通过同源分析比较及RT-PCR实验等对该基因进行了分析．结果显示该基因是一个诱导型表达的基因。     

可成为交换整区的素近环

设N是2-挠自由分配生成素近环,它具有单位元1和中心Z.该文证明了如果N满足下列条件之一,则N是交换整区(1)N容纳2个非零导子D1,D2,使得D1D2(N) Z;(2)N容纳一个非零导子D,使得[D(N),D2(N)]={0};(3)N容纳一个导子D,使得D(Z)≠{0},且() x,y∈N,有[x-D(x),D(y)]=0.     

图的Hamilton-圈与连通度

利用插点方法和H－序列，给出l－连通图G是Hamilton－圈的一个新充分条件。     

大范围运动空间梁的耦合动力学模型

从连续介质力学原理出发，对作大范围运动的空间梁建立耦合动力学模型．在纵向变形中计及了变形位移的二次耦合变形量，基于Jourdain速度变分原理导出作大范围运动的空间梁的动力学方程．将耦合动力学模型的仿真计算结果与不计二次耦合变形量传统的建模理论进行比较表明，在大范围运动的侧向角速度和浮动基基点的纵向加速度较大的情况下，二次耦合变形量对系统的刚—柔耦合动力学性质产生一定的影响．     

防止催化裂化分馏塔结盐研究

本文对催化裂化分馏塔在不同操作条件下的结盐状况及其主要原因进行了分析，提出相应的预防结盐措施，这些防止结盐措施，可有效地避免催化裂化分馏塔结盐。     

B0型空间上共轭凸函数的指数共轭性

引入并刻划B0型准范空间中凸函数的上、下指数，建立共轭凸函数上、下指数间的完整共轭关系。     

TD—SCDMA系统定位算法研究与仿真

为了克服NLOS信号对移动无线电定位的影响，对TD－SCDMA系统中联合DOA与TOA实现移动终端定位的方案进行了研究，基于NLOS信号识别的算法有效地解决了NLOS信号对实施定位的影响，提出了一种对多基站时间加权定位算法，通过仿真实验证明了所采用算法的可行性，在NLOS情况下也可满足FCC对E－911业务的要求。     

A new species of Gobiconodon （Triconodonta, Mammalia） and its implication for the age of Jehol Biota

A new species of Gobiconodon is found from the Yixian Formation of western Liaonlng, China. The new taxa,G zofiae sp. nov., has a confluent opening for branches Ⅱand Ⅲ of the trigeminal nerve on the anterior lamina of the petrosal. G zofiae sp. nov. is similar to Repenomamus in having an ossified Meckel‘s cartilage connecting the lower jaws and ear region. The new species, with enlarged I^1/I1, posteriorly located infraorbital foramen and four mental foramina,distinctly differs from the other species of Gobiconodon. The new material indicates that Gobiconodon has four, not five,upper molariforms. The presence of Gobiconodon in Jchol Biota makes it possible to correlate Jehol Biota with faunas in eastern Asia and North America, and suggests the age of the Yixian Formation to be Early Cretaceous.     

A surface-based DNA algorithm for the minimal vertex cover problem

Abstract DNA computing was proposed for solving a class of intractable computational problems, of which the computing timewill grow exponentially with the problem size. Up to now, many achievements have been made to improve its performance and increase itsreliability. It has been shown many times that the surface-based DNA computing technique has very low error rate, but the technique hasnot been widely used in the DNA computing algorithms design. In this paper, a surface-based DNA computing algorithm for minimal ver-tex cover problem, a problem well-known for its exponential difficulty, is introduced. This work provides further evidence for the abilityof surface-based DNA computing in solving NP-complete problems.