快凝Pd82Si18合金原子团簇的演化特性及遗传机制

采用分子动力学(MD)模拟计算,对Pd82Si18合金快凝过程中基本原子团簇的遗传特性、演化趋势和结构稳定性进行了研究.团簇类型指数法(CTIM)分析表明:非晶固体中Si原子为中心的(102/14418/1551)双帽阿基米德反棱柱(BSAP)团簇数目占据优势.快凝过程中,BSAP结构团簇具有最大的遗传分数,并且其他以Si原子为中心的Kasper团簇大多都会向BSAP结构团簇转变.通过对Si原子为中心的Kasper基本团簇电子性质第一性原理计算发现,体系中BSAP团簇的结合能最低,结构稳定性较高,与分子动力学计算结果一致.     

低强度He-Ne激光照射水稻的显微拉曼散射研究

介绍了用显微拉曼研究经低强度He-Ne激光照射。并在均匀磁场中处理过的水稻的结果。并与未经处理水稻的拉曼光谱进行了比较。基本依据是激光对生物分子的共振激发作用理论。从实验结果看．其间的谱线有一定差异，表明激光照射和均匀磁场处理，有可能改变水稻的遗传特性。     

微波对水稻的诱变效果及应用于育种的可行性研究

作物新品种的选育是农业生产的主要研究课题之一.作为育种的一种方法—辐射育种,特别是高能辐射育种的研究在我国至今已有30多年的历史,据统计已在22种植物上育成243个突变品种,如棉花“鲁棉一号”,水稻“原丰果”,大豆“铁丰18”.诱变获得大量有利用价值的早熟、矮杆、抗病、抗逆,优质及其他特异突变体.因此高能辐射育种走过了一段从开创、曲折到稳步发展的三个阶段.但是由于高能辐射的控制和防护受到一定条件的限制,加上仍属于一种随机的不可重复过程,故作者想寻找一种遗传变异大,突变后代可利用性高和处理方法简便的诱变育种方法.近几年来随着大功率微波技术的发展,有可能对它的生产、工程系统和控制、防护进行广泛的研究与应用.本文就是作者用大功率微波做的一种育种试验.     

Bayesian Variable Selection on Model Spaces Constrained by Heredity Conditions

This article investigates Bayesian variable selection when there is a hierarchical dependence structure on the inclusion of predictors in the model. In particular, we study the type of dependence found in polynomial response surfaces of orders two and higher, whose model spaces are required to satisfy weak or strong heredity conditions. These conditions restrict the inclusion of higher-order terms depending upon the inclusion of lower-order parent terms. We develop classes of priors on the model space, investigate their theoretical and finite sample properties, and provide a Metropolis–Hastings algorithm for searching the space of models. The tools proposed allow fast and thorough exploration of model spaces that account for hierarchical polynomial structure in the predictors and provide control of the inclusion of false positives in high posterior probability models.     

类电磁机制算法研究与改进

针对原算法中初始种群不均匀、局部搜索随机性强及移动公式效率低等问题,提出了一种改进的类电磁机制算法。采用随机化均匀设计方法构造初始种群,将混沌搜索与试探性移动方法相结合进行局部搜索,运用改进后的公式计算粒子之间的合力,将遗传变异思想融入移动公式来更新粒子。实验结果表明,改进后的算法具有更好的收敛效果和更高的求解精度。     

针对UART通信错误遗传性的止错码

UART协议简单易用,在串行通信设计中也得到了广泛的应用,但是由于它特有的通信协议,一旦出现错误,有可能导致后面大量正确的数据出错。针对UART在数据通信时的错误遗传性,找到了一组能够解决这种问题的止错码,详细分析了它的工作原理,为错误的及时终止提供了一定的理论基础。     

血型分布的稳定性问题

在ABO血型系统中,各个民族、地区的血型分布情况极不同相同.但能长期稳定存在.本文通过建立血型遗传迭代数学模型对所给的数据进行处理,合理解释了各个民族血型分布能长期稳定原因.     

Heredity of clusters in the rapidly cooling processes of Al-doped Zr_(50)Cu_(50) melts and its correlation with the glass-forming ability

The heredity of clusters in rapidly cooled(Zr_(50)Cu_(50))_(100-x)Al_x melts and its correlation with glass-forming ability(GFA) are studied via molecular dynamics simulations. Pair distribution function and the largest standard cluster(LSC)are adopted to characterize the local atomic structures in the(Zr_(50)Cu_(50))_(100-x)Al_x systems. The [12/555] icosahedra and their medium-range order(IMRO) play an important role in forming(Zr_(50)Cu_(50))_(100-x)Al_x metallic glasses(MGs). The fraction of [12/555], the number of IMRO, and the maximum size of IMRO in MGs increase significantly with increasing x. A tracking study further reveals that the configuration heredity of icosahedral clusters starts from supercooled liquids.No direct correlation exists between the GFA and the onset temperature of continuous or stated heredity. Instead, a larger hereditary supercooled degree of icosahedra matches with better GFA of Al-doped Zr_(50)Cu_(50) alloys.     

求解Job-Shop调度问题的改进蚁群算法

蚁群算法是一种新型的模拟进化算法,具有一些优良性质,但是蚁群算法容易陷入局部最优,且初期信息素匮乏导致求解速度慢.针对这一特点,在蚁群算法中引入遗传变异操作,并对蚁群算法做了改进.实验结果表明此方法行之有效.     

On an extension of distance hereditary graphs

Given a simple and finite connected graph G, the distance d_G(u,v) is the length of the shortest induced {u,v}-path linking the vertices u and v in G. Bandelt and Mulder [H.J. Bandelt, H.M. Mulder, Distance hereditary graphs, J. Combin. Theory Ser. B 41 (1986) 182-208] have characterized the class of distance hereditary graphs where the distance is preserved in each connected induced subgraph. In this paper, we are interested in the class of k-distance hereditary graphs (k∈N) which consists in a parametric extension of the distance heredity notion. We allow the distance in each connected induced subgraph to increase by at most k. We provide a characterization of k-distance hereditary graphs in terms of forbidden configurations for each k≥2.