如果能将它们解耦，会更加易于编码、测试和维护。
If you can decouple them, you can more easily code, test, and maintain them.
在他们的书“消失的符号之谜：通往达芬奇密码后未解之谜的向导，”中，他们解开了字谜，编码词组和许多其他奇怪真相。
In their book, "Secrets of the Lost Symbol: the Unauthorized Guide to the Mysteries Behind the Da Vinci code Sequel," they uncover anagrams and coded phrases and a host of other curious facts.
同时提出了一种改进的二进制编码方法，该方法引入了若干参数用以方便地控制解的精度和搜索空间。
An improved binary code method is also proposed, which introduces several parameters to conveniently control the solution precision and search space.
因此，如何将问题的解转换为编码表达的染色体是遗传算法的关键问题。
So how to transform the solution of the problem into the chromosome embodied by code is crucial.
提出了一种改进的二进制编码方法，该方法引入了若干参数用以控制解的精度和搜索空间。
An improved binary coding method is proposed, which introduces several parameters to control the solution precision and search space efficiently.
最后，针对模型的具体特点，设计模型解的编码方式，并采用基于云模型的参数自适应蚁群遗传算法进行仿真，结果表明了模型和算法的有效性。
At last, an effective algorithm model taking advance of a skillful encoding method is designed and called ACGA with self-adaptation adjustment of parameters based on cloud models.
基于产品的形态编码，采用参数权重集中曲线的噪声度自动评测方式对解空间进行降维处理，并对产品形态编码分级。
Based on the product shape coding, the paper discusses a method for reducing solution space dimensions by evaluating parameters weights with the help of the weight concentrating curves.
所有这些基因都负责熟知的药品（诸如抗抑郁药、精神抑制药与包括百忧解、舒马曲坦与安理申等在内的止疼片）的分子靶标的编码。
The genes all encode molecular targets of well-known pharmaceuticals, such as antidepressants, antipsychotics and pain relievers including Prozac, Imitrex, and Aricept.
描述一种被称为SZ相位编码的解距离模糊方法在脉冲多普勒气象雷达中的应用。
A method of phase code named SZ code to mitigate range ambiguity applied on a pulse Doppler weather radar is introduced.
利用网络编码，允许中间节点进行信息编码，最小能量广播问题可以转化为一个线性规划问题，并且具有一个多项式时间解。
We use network coding, i. e. , allowing intermediate nodes to code, the problem can be formulated as a linear program problem and has a polynomial-time solution.
由此，提出了遗传算法求解作业车间调度新的编码方法，能够彻底避免产生不可行调度解，大大提高了遗传算法的质量。
We improve on the encoding schema of GA to solve JSP, it reduces occurrence of the unfeasible scheduling solution, then enhances the quality of GA.
基于该编码方法所建立的DNA计算模型可用于求解0-1规划问题，只需4次PCR反应即可读取问题的可行解。
By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions.
叙述了该系统的组成及原理，并着重分析和讨论了编码方式、滤波、均衡、加扰及解扰等问题。
This paper describes the architecture and principle of DITS system. The problems about coding, filtering, equalization, scramble and descramble are discussed in detail.
像在上面说到的那样，传播者根据他自己的知识和技能对信息进行编码，受者也在他或她的经验范围内译解它。
As noted above, the sender of a message encodes it according to his of her skill and knowledge and the receiver decodes it according to his or her field of experience.
通过对遗传算法编码方法的改进和对辐射型网络的修复，合理的排除了大量的不可行解，解决了遗传算法计算时间长、搜索空间大的问题，提高了程序的计算速度。
The paper improved the coding mode and repaired the radial pattern networks, so breeds out the infeasible solution reasonably, tails off the search space and boosts the procedure's calculating speed.
该算法对传统遗传算法的编码方式、群体规模以及遗传算子等方面进行了改进，利用专家知识辅助搜寻可行解，并提出罚因子的自适应调整。
This algorithm improves the method of coding, size of population and operators; USES expert knowledge to aid searching feasible solution; and presents self adaptive adjusting of penalty factor.
沉旧设计了物料的编码脚册，并将旧的物料编码体解当用于企业物料开认、ERP和BOM外。
The redesign material's coding manual, and the new material coding system will apply in the enterprise material acknowledgment, ERP and BOM.
本发明公开了一种新的多肽——人解螺旋酶11，编码此多肽的多核苷酸和经d NA重组技术产生这种多肽的方法。
The present invention discloses one novel polypeptide, human uncoiling enzyme 11, polynucleotides encoding this polypeptide and DNA recombination process to produce the polypeptide.
遗传算法中二进制编码通常用来解决最优解问题，引入了BCD编码来解决最优解问题。
Binary code usually deals with searching for optimization in Genetic Algorithms(GA). BCD code is used to solve optimization problem.
理论分析结果表明：策略中的编码信息包在所有接收节点具有可解性，可以达到重传目的。
The theoretic analysis shows that the approach ensures the solvability in the received nodes and achieves retransmission.
本文主要研究了最大可解线性网络编码的计算复杂性与构造方法。
The thesis focuses on two facets of maximum decodable linear network coding: the computing complexity and the constructing method.
本文主要研究了最大可解线性网络编码的计算复杂性与构造方法。
The thesis focuses on two facets of maximum decodable linear network coding: the computing complexity and the constructing method.
应用推荐