DNA芯片图像的自适应提取

软件内嵌探针测试是在探针函数模板的框架内编写被测对象,并对被测对象进行面向对象软件的常规测试,在观察预期结果与实际结果是否一致的同时,还要察看探针函数输出的信息,以确定对象的状态是否正确。本论文研究的重点在于探针函数的构成、探针函数的实现及内嵌探针测试方法的应用研究,意在构筑一个基本的应用框架,提供一种实用的测试方法。     

基于3D Mesh结构的一种静态路由算法

3D NoC在同构多核系统中相比2D NoC具有更为优越的性能.本文在研究3D Mesh结构的基础上,对拓扑结构中的平均延时和理想吞吐量进行了理论上的评估,并提出了一种基于3D Mesh的新的静态路由算法,最后运用NS2网络仿真软件对其进行仿真和比较.实验结果显示,新的路由算法可以有效地提高吞吐量,并在大规模数据传输时...     

基于单片机的防盗报警系统的设计

设计了一款基于单片机的防盗报警系统,该系统与电话网络组成自动寻呼报警系统,当任一被监测点有事故发生时,该点的传感器将信号送入该系统,则系统自动通过电话网络向警讯中心或用户寻呼,对所指定的机构或人员发出警情信号。     

基于DNA计算自组装模型的Diffie-Hellman算法破译(英文)

DNA自组装计算模型是近年来引人关注的计算模型,已有基于自组装模型的二进制加法、乘法以及有限域中的加法和乘法的讨论．文中利用DNA自组装模型设计的模乘系统,实现了素数P的本原根g连续乘方后模p的数的排列,从而可以在线性时间内求解离散对数,为破译Diffie—Hellman密钥交换算法提供了新的生物方法．该模乘系统使用了Θ（p）种自组装类型,组装的时间复杂度为Θ（p-1）．系统最后组装结果提取出报告链后,经过PCR和凝胶电泳读取离散对数结果．该模型扩展了DNA自组装计算模型的应用,为求取离散对数提供了新思路．     

片上多核处理器容软错误执行模型

随着工艺的进步,微处理器将面临越来越严重的软错误威胁.文中提出了两种片上多核处理器容软错误执行模型:双核冗余执行模型DCR和三核冗余执行模型TCR.DCR在两个冗余的内核上以一定的时间间距运行两份相同的线程,store指令只有在进行了结果比较以后才能提交.每个内核增加了硬件实现的现场保存与恢复机制,以实现对软错误的恢复.文中选择的现场保存点有利于隐藏现场保存带来的时间开销,并且采用了特殊的机制保证恢复执行和原始执行过程中load数据的一致性.TCR执行模型通过在3个不同的内核上运行相同的线程实现对软错误的屏蔽.在检测到软错误以后,TCR可以进行动态重构,屏蔽被软错误破坏的内核.实验结果表明,与传统的软错误恢复执行模型CRTR相比,DCR和TCR对核间通信带宽的需求分别降低了57.5%和54.2%.在检测到软错误的情况下,DCR的恢复执行带来5.2%的性能开销,而TCR的重构带来的性能开销为1.3%.错误注入实验表明,DCR能够恢复99.69%的软错误,而TCR实现了对SEU(Single Event Upset)型故障的全面屏蔽.     

基于自组装DNA计算的NTRU密码系统破译方案(英文)

自组装DNA计算在解决NP问题,尤其在破译密码系统方面,具有传统计算机无法比拟的优势．文中提出了一种用自组装DNA计算破译NTRU公钥密码系统的方法．针对NTRU密码系统的特点,采用DNA瓦片编码信息,借助于瓦片间的粘性末端进行自组装,给出了求解多项式卷积运算的实现方案．在此基础上,通过引入非确定性的指派瓦片,提出了一种破译NTRU系统的非确定性算法．通过创建数以亿计的参与计算的DNA瓦片,该算法可以并行地测试每个可能的密钥,以高概率地输出正确密钥．该方法最大的优点是充分利用了DNA瓦片具有的海量存储能力、生化反应的巨大并行性以及组装的自发有序性．理论分析表明,该方法具有一定的可行性．     

DNA fragment assembly using a grid-based genetic algorithm

In this paper we propose a genetic algorithm (GA) for solving the DNA fragment assembly problem in a computational grid. The algorithm, which is named GrEA, is a steady-state GA which uses a panmitic population, and it is based on computing parallel function evaluations in an asynchronous way. We have implemented GrEA on top of the Condor system, and we have used it to solve the DNA assembly problem. This is an NP-hard combinatorial optimization problem which is growing in importance and complexity as more research centers become involved on sequencing new genomes. While previous works on this problem have usually faced 30 K base pairs (bps) long instances, we have tackled here a 77 K bps long one to show how a grid system can move research forward. After analyzing the basic grid algorithm, we have studied the use of an improvement method to still enhance its scalability. Then, by using a grid composed of up to 150 computers, we have achieved time reductions from tens of days down to a few hours, and we have obtained near optimal solutions when solving the 77 K bps long instance (773 fragments). We conclude that our proposal is a promising approach to take advantage of a grid system to solve large DNA fragment assembly problem instances and also to learn more about grid metaheuristics as a new class of algorithms for really challenging problems.     

An ant colony optimization algorithm for DNA sequencing by hybridization

The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Several metaheuristics such as tabu search and evolutionary algorithms have been applied to this problem. However, the performance of existing metaheuristics is often inferior to the performance of recently proposed constructive heuristics. On the basis of these new heuristics we develop an ant colony optimization algorithm for DNA sequencing by hybridization. An important feature of this algorithm is the implementation in a so-called multi-level framework. The computational results show that our algorithm is currently a state-of-the-art method for the tackled problem.     

Electrochemical DNA biosensor for the detection of interaction between di[azino-di(5,6-azafluorene)-κ-NN′]dichlormanganous and DNA

A new Mn(II) complex of MnL₂Cl₂ (L = azino-di(5,6-azafluorene)-κ²-NN′) was synthesized and utilized as an electrochemical indicator for the determination of hepatitis B virus (HBV) based on its interaction with MnL₂Cl₂. The electrochemical behavior of interaction of MnL₂Cl₂ with salmon sperm DNA was investigated on glassy carbon electrode (GCE). In the presence of salmon sperm DNA, the peak current of [MnL₂]²⁺ was decreased and the peak potential was shifted positively without appearance of new peaks. The binding ratio between [MnL₂]²⁺ and salmon sperm DNA was calculated to be 2:1 and the binding constant was 3.72 × 10⁸ mol² L⁻². The extent of hybridization was evaluated on the basis of the difference between signals of [MnL₂]²⁺ with probe DNA before and after hybridization with complementary sequence. Control experiments performed with non-complementary and mismatch sequence demonstrated the good selectivity of the biosensor. With this approach, a sequence of the HBV could be quantified over the range from 1.76 × 10⁻⁸ to 1.07 × 10⁻⁶ mol L⁻¹, with a linear correlation of r = 0.9904 and a detection limit of 6.80 × 10⁻⁹ mol L⁻¹. Additionally, the binding mechanism was preliminarily discussed. The mode of interaction between MnL₂Cl₂ and DNA was found to be primary intercalation binding.     

Pollard p-1因子分解的DNA计算机算法

如何有效地对大整数进行因子分解是数学上的一个难题.给出了基于分子生物技术的因子分解问题的DNA计算机算法.算法以Pollard p-1算法为基础,利用DNA分子生物操作完成加、减、乘、除运算,实现平方-乘以及欧几里德算法,产生并得到最终解.基于分子生物学的实验表明,该算法是可行和有效的.