均勻最優方案 的英文怎麼說

中文拼音 [jūnyúnzuìyōufāngàn]
均勻最優方案 英文
uniformly optimal plan
  • 均 : Ⅰ形容詞（均勻） equal; even Ⅱ副詞（都; 全） without exception; all
  • 勻 : Ⅰ形容詞（均勻） even Ⅱ動詞1. （使均勻） even up; divide evenly 2. （分出一部分） spare
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 方 : Ⅰ名詞1 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 案 : 名詞1 （長桌） table; desk 2 （案件） case; law [legal] case 3 （案卷; 記錄）record; file 4 （提...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 方案 : scheme; plan; programme; project; proposal; suggestion; formula; scenario; outline
  1. The concept called parallel macro - micro robot is presented. two kinds of optimal disposing methods of the cables ? tensions are used to build the inverse kinematics model of cable and cabin system. the error compensation model of the fine tuning stewart platform is deduced

    本章提出了並聯宏-微機器人的概念及基於懸索張力均勻原則和懸索系統勢能最小原則的兩種索張力優化配置方案，並在此基礎上建立了並聯懸索系統的逆運動學模型，推導了動基座stewart平臺的誤差補償模型。
  2. In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local

    本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。
  3. This paper can put into four parts ? this first part is the description and theoretical analyses of source coding, which focus on the research of optimizing equal quantization ? the second part presents the theoretical description of joint channel - source coding, which focus on the research of combined channel - source coding o the third part is about the application of combined channel - source coding to two different channel models, binary symmetric channel and cdma channel o in this part, two different coding designs are given according to different characters of these two channels ? and the last part is the description of simulation of combined channel - source coding ? most of my work are about two parts, one is to find the most appropriate quantization steps and centroid points of separate channel - source coding, another is to simulate the combined channel - source coding ? comparing the simulation results of separate channel - source coding and combined channel - source coding, the characters of joint channel - source coding are given

    本論文可以分成四部分：第一部分給出了信源編碼的基本概念和理論分析，重點放在最優均勻量化編碼的研究方面；第二部分給出了通道?信源聯合編碼的原理敘述，重點放在復合式通道?信源編碼的分析研究上；第三部分將通道-信源聯合編碼原理應用在兩種噪聲通道上：離散無記憶通道和cdma通道，並根據兩種通道的不同特點詳細描述了兩種相應的編碼設計方案；第四部分給出了復合式通道-信源編碼的模擬結果以及對結果的相應分析。
  4. But studies have never been done in china in the past few years. in order for the sc and tcsc equipments to be homemade, deep researches have been made firstly to movs in this paper. special attention is devoted to the most difficult problem concerning the uniformly sharing of fault current among all shunt columns in a mov in this paper

    如何能使這種限壓器在動作時流過各閥片柱的電流分流均勻，即均流問題，是mov研製過程中最主要的問題，在本文中，作者提出了兩套優化配片方案，使這個問題得到了很好的解決。
  5. This article, aiming at the specialties of rmb currency image, puts forward a new method using linear transform of image gray to diminish the influence of the background image noises in order to give prominence to edge information of the image. then the edge characteristic information image is obtained by edge detecting using simple statistics. by dividing the edge characteristic information image in the width direction into different areas, getting the number of the edge characteristic points of different areas as input vectors to random masks and optimized by ga

    文中提出了利用圖像灰度線性變換來抑制背景圖案噪聲的影響，突出圖像邊緣信息；然後採用簡單統計法進行邊緣檢測，得到邊緣特徵信息圖；最後通過對邊緣特徵信息圖在寬度方向上進行均勻劃分成不同的區域，統計不同區域的邊緣特徵點的數目作為神經網路的初始輸入向量，對初始輸入向量用隨機掩碼處理和遺傳演算法進行優化得到最終輸入向量，通過三層bp神經網路分類器進行分類，達到了人民幣識別的目的。
  6. This paper studies the least redundant solutions of two - dimensional array system by using the simulated annealing algorithm. two ideal thinning solutions for the two - dimensional circle array were discussed intensively in this paper. one solution uses half - circle configuration with very much reduced number of elements and taking an image by rotating the array ; the other selects element positions around the full circle to provide a roughly uniform coverage in the spatial frequency domain

    在一維天線陣設計的基礎上，本文利用模擬退火演算法給出了兩種最小冗餘二維圓環天線陣的結構設計方案，一種方案利用天線旋轉，在半圓周內稀疏天線；另一種方案通過將空間頻率采樣點的均勻分佈作為優化的約束條件，在全圓周上使天線單元分佈達到最優。
分享友人
分享到 Line

分享到臉書