助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   有序字符串 的翻译结果: 查询用时:0.199秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

有序字符串
相关语句
  “有序字符串”译为未确定词的双语例句
     The Realization of Multi-ordering Character Recognition by Means of Joint Transform
     多特征有序字符串的Joint变换识别
短句来源
  相似匹配句对
     The Realization of Multi-ordering Character Recognition by Means of Joint Transform
     多特征有序字符串的Joint变换识别
短句来源
     Efficient Skip-Pattern Matching Algorithm for Approximate String Sequential Problem
     一种有效的字符串有序跳跃模式近似匹配算法
短句来源
     Research of String Matching Techniques
     字符串匹配技术研究
短句来源
     On Order Management
     论有序管理
短句来源
     METABOLISMS AND ORDER
     新陈代谢与有序
短句来源
查询“有序字符串”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


The present paper makes a further study of the realization of multi-ordering character recognition by means of Joint Transform, the realization of multi-ordering character recognition by this method is dealt with for the first time in this paper. Mathematical models and the results of the experiments of the realization are obtained. It is shown that Joint Transform of the t-number ordering signals with their character signals will give t-multiplying overlapping correlations in the same position on the output...

The present paper makes a further study of the realization of multi-ordering character recognition by means of Joint Transform, the realization of multi-ordering character recognition by this method is dealt with for the first time in this paper. Mathematical models and the results of the experiments of the realization are obtained. It is shown that Joint Transform of the t-number ordering signals with their character signals will give t-multiplying overlapping correlations in the same position on the output plane of the Joint Transform correlator system.

本文就Joint变换用于特征识别问题作了进一步的分析研究,首次讨论了多特征有序字符串的Joint变换识别,求得了这类问题的数学模型,给出了实验研究的结果,证明了t个有序特征字符串的识别,可以在Joint变换相关运算系统的输出平面上,通过对确定位置的t重重叠自相关的检测来实现,为多特征信号的识别工作提供了有益依据。

From the point view of simulating railway sectional station dispatcher′s view, the paper analyses the integrated features of train sets occupation of the arrival and departure track at sectional station. By algorithm of dividing time interval, it builds up a suitable arrangement graph model, which converts arrangement of arrival and departure tracks into kvertex graph coloring. According to hybrid genetic algorithms principle, a method of using greedy algorithms in combination with hybrid genetic algorithms...

From the point view of simulating railway sectional station dispatcher′s view, the paper analyses the integrated features of train sets occupation of the arrival and departure track at sectional station. By algorithm of dividing time interval, it builds up a suitable arrangement graph model, which converts arrangement of arrival and departure tracks into kvertex graph coloring. According to hybrid genetic algorithms principle, a method of using greedy algorithms in combination with hybrid genetic algorithms is adopted to solve the problem. It designs the sequent character string code, creates the adaptability function based on penalty function and uses crossover and mutation to give the fundamental solution steps of hybrid genetic algorithms.

从模拟铁路区段站调度员思维角度出发,分析区段站车列占用到发线时区集合的特点,应用划分时间片算法建立合适的到发线安排的图论模型,将到发线安排问题转化为顶点具有加权的图的k 着色问题。依据设计混合遗传算法基本原则,将基于顺序的贪婪着色算法和遗传算法混合起来运用于该问题,设计有序的字符串编码方法,构造基于罚函数的适应度函数,采用交叉和变异等技术,给出混合遗传算法的基本求解步骤。

A simple and universal gene encoding scheme for just-in-time production planning in job manufacturing systems was presented, by which a production planning directly corresponds to an ordering string. For the encoding, three important genetic operators: selection, crossover and mutation were contrived and described in derail. In order to increase the algorithm's capacity of global convergence, some strategies such as adaptive probability of mutation, calculating the degree of similarity, niche technology based...

A simple and universal gene encoding scheme for just-in-time production planning in job manufacturing systems was presented, by which a production planning directly corresponds to an ordering string. For the encoding, three important genetic operators: selection, crossover and mutation were contrived and described in derail. In order to increase the algorithm's capacity of global convergence, some strategies such as adaptive probability of mutation, calculating the degree of similarity, niche technology based on preselection, multigroup parallel and combining with heuristic approach were adopted.

设计了一种遗传算法,用来解决以准时生产为目标的单件制造业生产计划问题.提出了基于投产日期的生产计划编码方法,这种编码方法直接把生产计划映射为一个有序的字符串.并针对这种编码设计了专门的交叉算子和变异算子.相似度检验增加了初始种群的多样性;小生境进化技术的运用有效地保持了群体的分布性;种群并行进化策略、变异率自适应调整、与启发式算法相结合等措施提高了遗传算法收敛到最优解的成功率.

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关有序字符串的内容
在知识搜索中查有关有序字符串的内容
在数字搜索中查有关有序字符串的内容
在概念知识元中查有关有序字符串的内容
在学术趋势中查有关有序字符串的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社