Question

急求高手翻译--3---不要在线翻译的!!!!!!!!

7. Conclusion
7.1 Summary
Hardware implementations of approximate string matching algorithms have typically ignored
the variety of tasks to which DP matching is applied. We show that a family of hardware
components, tuned for interoperability with each other, is a practical way to offer a wide variety
of options. We also show that, by tailoring each component to a specific task, the “generality
penalty” can be avoided: each application pays only the cost of its own requirements, not the
cost of other possible options.
We also observed that several object-oriented design principles were very helpful in this
implementation, including the Open-Closed principle, the Dependency Inversion principle, and
use of the Strategy design pattern. These were directly applicable to standard VHDL and a
standard development environment. This gives real cause for optimism about the transferability
of modern software design techniques to large, complex hardware design, and suggests several
ways in which minor tool changes could have significant effect on design productivity.
7.2 Future Work
There are large numbers of configuration options, such as NW end costs and score bit-widths
that can also be varied; costs have not been established for all combinations. New character
rules are possible, such as codons vs. amino acids. They raise new issues, such as the
possibility of gap penalties that penalize codon frame shifts. These implementations all allow
the reference strings to be reloaded in a running system. Comparisons would be simpler and
faster, however, if the reference strings were hard-coded into the logic of the character rule cells
as in other systems [8,9]. The current implementations are not highly tuned, so resource usage
and clock rates may improve in the future. In the long run, this mechanism offers an
unprecedented vehicle for exploring tradeoffs of hardware efficiency vs. application features.
Smith-Eggerton (SE) repeated matching [15] is an interesting variation, but is based on a
calculation wavefront that lies vertically across the DP grid. These DP calculations are based
on a wavefront running diagonally across the logical grid. SE could be probably
accommodated with a different organization of the DP grid, but we have not investigated the
changes that would be required. We have examined a modified SE algorithm with a diagonal
wavefront, but have not fully characterized that algorithm’s string-matching performance.

Answer 1

7 . 结论7.1总结硬件implementations近似串匹配算法通常都忽略了各种任务,其中dp 配套应用. 我们证明了家庭的硬件组成,调谐互用,互相 是一个切实可行的方法,提供了多种选择. 我们也证明,由裁缝每一部分的具体任务, "一般性的惩罚" ,可避免: 每份申请仅支付的费用,其本身的要求,而不是费用,其他可能的选择. 我们还看到,一些面向对象的设计原则是非常有益的,在这一执行,包括开放封闭原理, 依赖倒置的原则,并利用该战略的设计模式. 这些都直接适用于标准VHDL和标准的发展环境. 这实在令人乐观的转换,将现代软件设计技巧的大型复杂的硬件设计, 并提出了一些办法,使小手段的变化可能产生重大影响的设计生产力. 7.2今后的工作中,有大量的配置选项, 如nw末成本及评分位元的宽度,也可以不同; 费还没有确定所有的组合. 新文字的规则都是可能的,如密码子与氨基酸. 他们提出新的问题,诸如可能会有差距处罚,处罚密码框轮班. 这些实现让所有参考字符串被装在一个运行系统. 比较可能会比较简单快捷,但 如果参照弦被硬编码为逻辑的规则性细胞如在其他系统[ 8,9 ] . 当前implementations are not highly tuned ,使资源利用率和时钟速度可能会有所改善,在未来. 从长远来看,这种机制提供了前所未有的工具,探讨得失硬件的效率与应用的特点. 史密斯- eggerton ( SE )的反复核对〔15〕是一个很有意思的变化, 而是基于一种计算wavefront在于垂直横跨主电网. 这些民主党的算盘是基于一种波运行斜对面的逻辑网. 硒可容纳可能有不同的组织的DP网 但我们还没有调查所需的变动. 我们已审阅修改se算法对角线波,但还没有完全具有这种算法的字符串匹配的表现.

Answer 2

7. 近似
串配比的
算法的结论7.1概略硬件实现典型地忽略了
DP匹配是应用的任务的品种。 我们表示，硬件元件家庭
，调整为互相的互用性，是一个实用方式提供选择广
品种。 我们也表示，通过为每个组分专门制作一项具体任务， “普通性
惩罚”可以避免： 每种应用它本身支付仅费用要求，不是
费用其他可能的选择。
我们也观察几项面向对象的设计原则是非常有用的在这
实施，包括Open-Closed原则，附庸反向对
战略设计样式的原则和用途。 这些直接地是可适用的对标准VHDL和
标准开发环境。 这给真正的起因为乐观关于现代
软件设计技术的转移性大，复杂硬件设计，并且建议
较小工具变动在设计生产力可能有重大作用的几个方式。

.2那里
未来工作是很大数量的配置选项，例如NW可能也变化的结尾
费用和比分位宽度; 费用为所有组合未建立。 新的字符
规则是可能的，例如密码子对 氨基酸。 他们提出新的问题，例如的空白
惩罚的可能性处罚密码子框架转移。 这些实施全部在
一个连续系统允许参考串被再装。 比较是更加简单和
更加快速的， 然而，如果参考串是硬编码入字符规则细胞的逻辑
和在其他系统[8,9]。 当前实施不高度调整，因此资源使用
和时钟频率也许在将来改善。 从长远看来，这个机制提供一辆
史无前例的车为硬件效率探索的交易对 应用特点。
史密斯Eggerton (SE)重覆的匹配[15]是有趣的变异，但根据垂直
横跨DP栅格在的演算波前。 这些DP演算根据
跑对角地横跨逻辑栅格的波前。 SE可能大概
容纳以DP栅格的一个不同的组织，但我们未调查
将需要的变动。 我们审查了一种修改过的SE算法以对角
波前，但不充分地描绘了那种算法的串匹配的表现

Answer 3

7. 结论
7.1 摘要
相配运算法则的大约线硬件落实已经典型地忽略
相配的 DP 被应用到的工作多样性。 我们硬件的一个家庭
成份, 调谐的为互通性和彼此, 是一个实际的方法提供一个广泛的多样性
选项。 我们也那,藉由缝制对一件特性工作的每个成份, 那 " 概论
处罚"可能被避免: 每个申请只支付它自己需求的费用, 不那
其他的可能选项的费用。
我们也观察一些物体定向的设计原则在这非常有帮助
落实, 包括开着- 关闭原则，属国倒转原则, 和
策略设计式样的使用。 这些直接地可以应用在标准的 VHDL 和一
标准发展环境。 这有关可转移性为乐观主义给真正的因素
现代的软件设计，大的, 复杂的硬件技术设计, 而且一些
未成年人工具变化可以有在设计生产力上的重要效果的方法。
7.2 未来工作
有大量的结构选项, 像是 NW 结束费用而且得分咬- 宽度
那也可能被改变；费用为所有的组合没有被建立。 新的个性
规则是可能的,像是 codons 和含氨基的酸比较。 他们升起新的议题, 如此的当做那
处罚 codon 体格变化的缝隙处罚的可能性。 这些落实全部允许
叁考线到在一个赛跑系统中被再装货。 比较会是比较简单的和
更快速地，然而，如果叁考线很难- 进入个性规则细胞的逻辑之内编码
当做在其他的系统中 [8,9]. 现在的落实不高度调谐, 因此资源用法
而且时钟率未来可能改良。 最后，这一个机制提供一
探究硬件效率和申请特征比较的 tradeoffs 的空前交通工具。
史密斯- Eggerton(SE) 重复的相配 [15] 是一种有趣的变化, 但是为基础一
横过垂直地躺卧 DP 格子的计算波前。 这些 DP 计算是建立
在一个波前横过对角的跑合乎逻辑的格子上。 SE 可能是或许
以 DP 格子的一个不同的组织适应，但是我们没有调查那
变化会被需要。 我们已经用对角线调查一个被修正的 SE 运算法则
波前, 但是不已经完全表示那一个运算法则的相配线的表现特色了

Answer 4

呵呵,没人有那闲工夫给你翻译,即使有,也不一定是个高手~!!~
再说了,试着通过翻译软件,再加上自己的语言组装也能提升你的英文水平,不是吗?

我觉得http://www.google.cn/language_tools

谷歌的这个网站的在线翻译不错的,自己看看吧,翻译得大致准确,比很多收费的翻译软件都准确~!~!~

我试过的

Answer 5

Hardware implementations of approximate string matching algorithms have typically ignored
the variety of tasks to which DP matching is applied. We show that a family of hardware
components, tuned for interoperability with each other, is a practical way to offer a wide variety
of options. We also show that, by tailoring each component to a specific task, the “generality
penalty” can be avoided: each application pays only the cost of its own requirements, not the
cost of other possible options.
We also observed that several object-oriented design principles were very helpful in this
implementation, including the Open-Closed principle, the Dependency Inversion principle, and
use of the Strategy design pattern. These were directly applicable to standard VHDL and a
standard development environment. This gives real cause for optimism about the transferability
of modern software design techniques to large, complex hardware design, and suggests several
ways in which minor tool changes could have significant effect on design productivity.
7.2 Future Work
There are large numbers of configuration options, such as NW end costs and score bit-widths
that can also be varied; costs have not been established for all combinations. New character
rules are possible, such as codons vs. amino acids. They raise new issues, such as the
possibility of gap penalties that penalize codon frame shifts. These implementations all allow
the reference strings to be reloaded in a running system. Comparisons would be simpler and
faster, however, if the reference strings were hard-coded into the logic of the character rule cells
as in other systems [8,9]. The current implementations are not highly tuned, so resource usage
and clock rates may improve in the future. In the long run, this mechanism offers an
unprecedented vehicle for exploring tradeoffs of hardware efficiency vs. application features.
Smith-Eggerton (SE) repeated matching [15] is an interesting variation, but is based on a
calculation wavefront that lies vertically across the DP grid. These DP calculations are based
on a wavefront running diagonally across the logical grid. SE could be probably
accommodated with a different organization of the DP grid, but we have not investigated the
changes that would be required. We have examined a modified SE algorithm with a diagonal
wavefront, but have not fully characterized that algorithm’s string-matching performance.

Answer 6

难得六一不用上班，起床后帮你搞定。3