首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
为了更好地组合不同的相似度度量结果以提高本体映射结果的质量,提出一种新的基于调谐值度量和单纯降序提取算法的自动化本体映射技术。该技术首先通过调谐值来度量各种相似度矩阵的可靠性,并为每一个相似度矩阵赋予权重以集成不同的相似度矩阵,然后通过单纯降序提取算法结合阈值的策略提取最终的本体映射结果。实验采用2012年本体映射评价竞赛的测试数据集,同2012年本体映射评价竞赛的参与者的比较表明该文提出的方法是有效的。  相似文献   

2.
Genomics and bioinformatics are topics of increasing interest in undergraduate biological science curricula. Many existing exercises focus on gene annotation and analysis of a single genome. In this paper, we present two educational modules designed to enable students to learn and apply fundamental concepts in comparative genomics using examples related to bacterial pathogenesis. Students first examine alignments of genomes of Escherichia coli O157:H7 strains isolated from three food-poisoning outbreaks using the multiple-genome alignment tool Mauve. Students investigate conservation of virulence factors using the Mauve viewer and by browsing annotations available at the A Systematic Annotation Package for Community Analysis of Genomes database. In the second module, students use an alignment of five Yersinia pestis genomes to analyze single-nucleotide polymorphisms of three genes to classify strains into biovar groups. Students are then given sequences of bacterial DNA amplified from the teeth of corpses from the first and second pandemics of the bubonic plague and asked to classify these new samples. Learning-assessment results reveal student improvement in self-efficacy and content knowledge, as well as students' ability to use BLAST to identify genomic islands and conduct analyses of virulence factors from E. coli O157:H7 or Y. pestis. Each of these educational modules offers educators new ready-to-implement resources for integrating comparative genomic topics into their curricula.  相似文献   

3.
M序列是非常重要的伪随机序列.给出了2元n级M序列的一个新的递归算法,该算法所需存储空间约为4n比特.而且只要经过一些修改便可生成大量的M序列.  相似文献   

4.
鲁棒UKF滤波算法在SINS初始对准中的应用   总被引:2,自引:0,他引:2  
针对系统存在不确定性扰动时传统UKF滤波算法的滤波精度和鲁棒性均下降的问题,提出了一种基于H∞范数的鲁棒UKF滤波算法.该算法在Krein空间内对简化UKF滤波算法进行改进,增加了一个鲁棒环节.鲁棒环节通过引入给定正常数调整滤波增益从而提高滤波算法的鲁棒性能.在SINS大方位失准角初始对准中对简化UKF滤波算法和鲁棒U...  相似文献   

5.
为了消除经典归并算法O(n)的附加空间并保持稳定性,提出一个简便的就地归并算法,它在待归并的第二段头部动态形成缓冲区,存放归并时前段的较大者,并组织成循环队列。对长为m、n的两段,归并时比较次数不超过m+n-1。将算法用于归并排序进行了测试,给出了归并、归并排序两者效率的关系,由排序结果验证了归并的比较次数为最优的O(n),并得出移动次数约为n2/48。  相似文献   

6.
刘璐 《衡水学院学报》2009,11(4):37-39,43
二叉树的构造有多种方法,给出一棵二叉树的中序序列和后序序列,可以构造出这棵二又树,但一般采用递归算法.尽管递归算法具有结构简炼、清晰、可读性强等优点,但递归算法在执行过程会耗费太多的时间和空间,为了追求算法的时空效率,必须将递归算法转化为非递化算法,问题才能得到有效解决,本文设计了一个非递归算法,输入一棵二又树的中序遍历和后序遍历的结点序列,构造出该二又树,该算法对于一棵有n个结点的二又树,具有O(n)时间复杂度,是解决该问题的最优算法.  相似文献   

7.
对于n个工件m台设备的作业调度问题,分析了基于作业工序编码算法存在的不足,提出了基于工作中心编码的遗传算法,即在不同染色体相同工作中心之间进行作业交换,有效扩大搜索解的空间。实验表明,基于工作中心编码算法的调度效果和调度效率均优于基于工序编码的算法。  相似文献   

8.
In this letter,we briefly describe a program of self-adapting hidden Markov model(SA-HMM) and its application in multiple sequences alignment.Program consistes of two stage optimisation algorithm.  相似文献   

9.
提出一种新的由一棵严格二叉树的后序序列和结点的双亲情况构造该严格二叉树的非递归算法。通过实例说明该算法的执行过程,假设n是严格二叉树的结点的个数,该算法的时间复杂度和最差情况空间复杂度都是O(n)。  相似文献   

10.
介绍了一种基于FPGA的可编程SONET OC-192 10 Gbit/s伪随机序列发生器和比特间插入奇偶校验码BIP-8的误码测试仪.该误码测试仪为并行反馈结构,可生成PRBS序列长度为27-1,210-1,215-1,223-1和231-1,通过SFI-4接口,采用10 Gbit/s收发一体光模块,其工作速率可达10 Gbit/s.在OC-192帧同步调整电路中,采用STM-64/OC192二分查找法的帧同步法,显著提高了帧同步速度并减少了帧同步逻辑的复杂度.该系统可作为一种低成本的测试仪评估OC-192-设备与器件,以取代昂贵的商用PRBS测试仪.  相似文献   

11.
There is increasing international interest in learning outside the classroom; place-based education is one manifestation of this. In this article, some conceptualisations of place are considered and attention drawn to alignments with habitus at micro, meso and macro levels. I develop a concept of cultural density as an explanatory tool to theorise how place and culture intersect to support some educational aims and interfere with others within a cross-sectional research study of a place-based curriculum centred on three schools located in the Southwest of England. Cultural density refers to the nature, thickness and dominance of habitus and norms of practice in places. Reflecting on the interface between how young people come to ‘know their place in the world’ and learning opportunities, careful alignment of purpose, pedagogy and place considering past, present and future is argued as a means of maximising the opportunities afforded by learning outside the classroom.  相似文献   

12.
文章研究了Hilbert空间中一类广义逆混合变分不等式解的存在性.利用广义f-投影算子的性质,构造了新的迭代公式,研究了这类迭代公式的收敛性,给出了所得的收敛结果是广义逆混合变分不等式的解.  相似文献   

13.
提出一种改进的基于Logistic映射和Lorenz映射相结合的彩色图像加密方法。将三维空间的彩色图像转换成二维的灰度图像,分别利用Logistic、Lorenz混沌系统生成的混沌序列对二维图像进行像素位置与像素值的置乱,对置乱后的图像按折叠算法进行处理。Matlab仿真实验结果可知,转换成二维灰度图像后有效地降低了算法的计算强度和空间需求;置乱时实现了不同层次(R、G、B)亮度值的完全混合,取得了较好的加密效果,安全性更高。  相似文献   

14.
给出一种基于广义混沌序列的多幅图像隐藏算法.利用图像的迭代混合可以将多幅图像隐藏于一幅图像之中,借助Logistic混沌动力学系统过程既非周期又不收敛,且对初始条件敏感性,产生实数值混沌序列,利用该混沌序列生成广义混沌序列,作为隐藏算法的混合因子,提高了隐藏算法的安全性.数值实验结果表明,算法简单易行,安全性好.  相似文献   

15.
提出了一种基于混沌序列的DCT数字图像水印嵌入算法,利用Logistic混沌映射来置乱水印以提高数字水印的随机性,并对水印图像作调制加密处理以消除水印图像各像素的空间相关性,而且嵌入水印的DCT块并不连续地选取,而是用Logistic混沌序列选取。实验结果表明,该算法在抵抗噪声、JPEG有损压缩以及裁剪等方面均有较好的鲁棒性。  相似文献   

16.
A simplified method is proposed for analyzing the overpressure history of an optional point on the walls of a closed cuboid due to its internal optional point-explosion. Firstly, the overpressure histories of all nodes on the walls of a cube with a side-length of 2 m are computed under a reference-charge explosion at each node of its inner space using the LS-DYNA software, and then are collected to form a reference database. Next, with the thought of the isoparametric finite element, an interpolating algori...  相似文献   

17.
Autofocus method based on the analysis of image content information is investigated to reduce the alignment error resulting from mark positioning uncertainty due to defocus in microstructure layered fabrication process based on multilevel imprint lithography, The applicability of several autofocus functions to the alignment mark images is evaluated concerning their uniformity, sharpness near peak, reliability and measure computation efficiency and the most suitable one based on power spectrum in frequency domain (PSFD) is adopted. To solve the problem of too much computation amount needed in PSFD algorithm, the strategy of interested region detection and effective image reconstruction is proposed and the algorithm efficiency is improved. The test results show that the computation time is reduced from 0.316 s to 0.023 s under the same conditions while the other merits of the function are preserved, which indicates that the modified algorithm can meet the mark image autofocusing require-ments in response time, accuracy and robustness. The alignment error due to defocus which is about 0.5 μm indi-cated by experimental results can be reduced or eliminated by the autofocusing implementation.  相似文献   

18.
为了提高KNN检索策略的检索效率和检索结果的质量,提出一种改进的KNN检索策略。在引入图书馆领域本体和概念语义相似度度量技术的前提下,利用句法结构筛选不合理的案例以降低计算规模,从而提高案例的检索质量和效率,利用改进的微粒群算法优化概念语义相似度度量技术中的组合参数以提高KNN检索的结果质量。实验数据采用福州晓锋科技信息咨询有限公司提供的图书馆参考咨询测试数据。实验结果表明,相比于传统KNN和基于传统PSO的改进KNN方案有效地提高了案例匹配结果的查全率和查准率。  相似文献   

19.
本文主要研究基因无方向的基因组重排的反转排序问题.本文算法基于断点图的概念,给出一个时间复杂性为O(maxb3(π),nb(π)),空间复杂性为O(n)的求解近似最优解的算法,其中n为基因组中基因个数,π=(π1,π2,...πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据试验的结果表明,该近似算法可以求得较好的结果.  相似文献   

20.
给出了一个快速算法决定有限域Fq上周期为upn序列的极小多项式.设p,q,u为不同素数,q为模p2的本原根,m为最小正整数使得qm≡1modu和gcd(m,p(p-1))=1.利用一个算法把有限域Fq上周期为upn序列化为几个有限域Fq(ζ)上周期为pn序列,其中ζ为一个u次本原单位根,从而利用肖国正等的算法得到每个周期为pn序列的极小多项式.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号