排程演演算法 的英文怎麼說

中文拼音 [bèichéngyǎnyǎnsuànfǎ]
排程演演算法 英文
algorithm scheduing
  • 排 : 排構詞成分。
  • 程 : 名詞1 （規章; 法式） rule; regulation 2 （進度; 程序） order; procedure 3 （路途; 一段路） journe...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. Using the logarithm graph, multi - varieties production batch problem is resolved. the production scheduling is realized with heuristic traverse algorithm. at last, the strategies, which include disassembling task, shorting interval of the working procedure, overlapping working procedure, deferring the back working procedure etc., are brought forward to deal with the order ' s inserting, postponement, freezing and doing again on carrying out the production plan

    3 ）分析了企業職能信息系統的集成性和各部門間的協調性，研究車間生產計劃的制訂過程，以模糊多屬性折衷式模型實現了工藝路線的決策，採用對數坐標圖表法，解決了多品種生產批量問題，用基於啟發式的遍歷演算法實現了生產工單的排產，最後提出了任務分解、縮短工序間隔，相鄰工序時間疊加，延遲后續工序等控制策略處理計劃執行過程中工單的插單、延期、掛停與返工等特殊問題。
  2. The content of this paper is arranged as foll owing : chapter 1 introduces the concept of credit, credit risk and credit assessment, as well as the history and development of credit assessment ; chapter 2 introduces the history of ai technology, and the background of expert system and neural network. characters and disadvantages of expert system and neural network are presented respectively and the necessity of combining expert system and neural network is lightened ; chapter 3 shows the process of dealing with sample data, including the treatment of exceptional data and factor analysis, and puts forward the concrete framework of the mixed - expert credit assessment system ; chapter 4 introduces concept of object - oriented technology, and constructs object model and functional model after analyzing the whole system. it also illustrates the implementation of concrete classes by an example of rule class and the inference algorithm in the form of pseudocode ; chapter 5 introduces the structure of the whole system, the major functional models and their interfaces, and the characteristic of the system is also generalized ; chapter 6 summarizes the whole work, and points out the remaining deficiencies as well as the prospective of this method

    本文具體內容安排如下：第一章介紹了信用、信用風險、信用評價的概念，回顧了信用評價的歷史、發展和現狀，並綜合各種信用評價模型，指出這些模型各自的優缺點：第二章簡單描述了人工智慧技術，著重介紹有關專家系統與神經網路的基礎知識，通過總結它們的優缺點，指出結合專家系統與神經網路構造混合型專家系統的必要性；本章還介紹了神經網路子模塊的概念，提出了混合型專家系統的一般框架與設計步驟：第三章對樣本數據進行處理，包括異常數據的剔除、因子分析等，提出了信用評價混合型專家系統的具體框架結構，介紹了系統知識庫的主要部分、基於優先級的正向推理機制的流程、以及基於事實的自動解釋機制的具體實現方法；第四章介紹了面向對象技術，進而採用面向對象對信用評價系統進行分析，建立了對象模型和功能模型，並在此基礎上，採用c + +語言以規則類為例說明系統中具體類的實現，用偽代碼的形式描述了推理的演算法；第五章描述了整個系統的結構，對系統主要功能模塊和界面進行了介紹，並總結系統的特點；第六章總結了全文，指出本文所構造系統存在的不足以及對將來的展望。
  3. In computation of swept volume approximation, an improved technique to generate the swept volume approximation for arbitrary meshes is presented by introducing generator simplification and path resample using frenet moving frames along the discreted sweeping trajectory. other steps, such as a directed distance field computation on a uniform grid based on the hardware accelerated computation technique and iso - surface extraction using marching cubes algorithm, are also included in this algorithm. in addition, the simplification scheme and smoothing technique are applied to the swept volume generated from iso - surface extraction

    本文的主要貢獻在於：在掃描體逼近計算方面，在原有任意多邊形網格模型沿任意路徑運動生成掃描體逼近演算法的基礎上，提出了加入對掃描母體簡化的預處理和用活動標架對掃描路徑進行重采樣等過程，演算法的其它過程還包括：計算掃描體中幾何基元的排列，用硬體加速構造無符號的有向距離場，將無符號距離場轉化為有符號距離場，從有符號有向距離場提取等值面等。
  4. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  5. T. p. hong, p. y. huang, and g. horng, ( 2004 ) " combining the lpt and the gupta approaches to solve group flexible flow - shop problems, " 15th international conference of information management, taiwan, may 29, 2004

    洪國寶，王乾隆，洪宗貝，黃?瑩， "擴展pt排程演演算法以解決彈性流程問題， " 2003人工智慧、模糊系統及灰色系統聯合研討會， 2003年12月
  6. Also, the author ’ s design strategy and creativity has been given in this paper. specifically, it includes : based on the feasibility analysis of the fit selection of control parameters in the aeration process, the aeration process of wastewater treatment of the joint - constructional complete - mixed activated sludge process has been aimed at in this paper. then, the state equations of the aeration process have been proposed in this paper, which is on the base of dissolved oxygen concentration ( do ) and discharge quantity of sludge ( qw ) as control variables, the concentration of bod and sludge as state variables. based on the present study on optimization control of wastewater treatment, the multivariable optimal control model with restriction factor has been presented in the paper with introducing modern control theory and system analysis into the field of activated sludge wastewater treatment,

    具體包括:以完全混合、表面曝氣合建式活性污泥工藝的污水處理曝氣過程為研究對象，在闡述了曝氣過程式控制制參數選取可行性的基礎上，建立了以溶解氧濃度do和活性污泥排放量qw為控制變量，以曝氣池中有機物濃度s和微生物濃度x為狀態變量的活性污泥曝氣過程的基本狀態方程;運用現代控制理論的觀點和污水處理理論，在現有關于污水處理最優控制問題研究的基礎上，建立了有約束條件多變量能耗最小數學模型，該數學模型是以有機物排放總量和狀態變量的末值條件作為約束條件，曝氣過程的能耗最小作為目標泛函;採用增廣拉格朗日乘子法對最優控制問題進行轉化，並對應用極大值原理求解能耗最小這一最優控制問題進行了詳細的解析;引入約束運算元，應用具有控制約束的共軛梯度演算法對能耗最小這一最優控制問題進行求解，並進行模擬實驗驗證。
  7. With the flowchart the program can be divided into six parts and it includes initial flow field, computation of molecular motion, boundary treatment, re - sort of molecular, sample and computation of molecular collision. several cases have been simulated to certify the correctness of the program. dsmc method is improved using method of characteristics to modify the boundary condition and gets the goal as expected

    首先，編程實現了基本dsmc方法對二維流動的計算，給出了所用演算法的原理、相關模型，並結合程序結構流程圖，分別介紹了初始化流場、計算分子的運動、邊界的處理、分子的排序、抽樣計算分子的碰撞、流場參數采樣統計各個功能模塊在fsmm2d中的實現，並對該程序進行了算例校驗。
  8. Abstract : according to the similitude definition between data, this paper proposes an efficient multi - dimension fuzzy clusteringalgorithm by dimension reducing and sorting

    文摘:本文根據數據間相似程度的定義，利用排序縮小范圍，提出一種多維數據聚類的演算法。
  9. Next, we proposed the method of fitness sequence statistics analysis, to directly explore characteristics of fitness landscapes, and to further measure the extent of ga - hardness

    提出了一種排序統計分析方法，可以直接測試適應值曲面的特徵，從而進一步反映遺傳演算法對該問題優化的困難程度。
  10. Then, a restricted - aco ( ant colony optimization ) algorithm is proposed to solve the car - sequencing problem with buffer restriction under a round painted body storage, which reaches the objective to minimize the total conveyor stoppage time

    在此基礎上，設計了約束集蟻群演算法求解環型油漆車身緩沖區約束下，以傳送帶中斷時間最短為目標的汽車製造排程問題。
  11. Making these criteria precise ? and devising scheduling algorithms to achieve them, even approximately ? are areas of active research

    訂定確實的標準，並且設計出盡可能達成目標的排程演演算法，是目前人們積極研究的重點。
  12. Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed

    為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。
  13. Three propositions are proposed based the vector base network. cognition of human being and vector base cognition model are compared, the corresponding connection is created. 7 ) the application for rubber mixing process is given : abnormal modeling samples first removed, svm is applied to build the discharge model to establish the rubber discharge condition, and long term practical production validated the discharge modeling method ; adopting dynamic rkrls and rsvm, mooney time serials is used to model and predict, which shows better prediction ability than rls ; using v

    7 ）將本文演算法在橡膠工業的密煉過程得到實際的應用:在排除異常樣本點的情況下，利用5vm的工業特性，進行排膠點的建模，獲得好的應用效果:利用動態的rkrls和rsvm演算法，通過對橡膠棍煉質量的門尼指標進行建模和預測分析，表明演算法具有較好的跟蹤預測性能;利用矢量基學習網路對密煉過程的門尼進行辨識建模和預報，獲得了較好的效果，從而實現了更好的門尼波動的控制。
  14. A modified genetic algorithm ( mga ) framework was developed and applied to the flowshop sequencing problems with objective of minimizing mean total flowtime. to improve the general genetic algorithm routine, two operations were introduced into the framework. firstly, the worst points were filtered off in each generation and replaced with the best individuals found in previous generations ; secondly, the most promising individual was selectively cultivating if a certain number of recent generations have not been improved yet. under conditions of flowshop machine, the initial population generation and crossover function can also be improved when the mga framework is implemented. computational experiments with random samples show that the mga is superior to general genetic algorithm in performance and comparable to special - purpose heuristic algorithms. the mga framework can also be easily extended to other optimizations even though it will be implemented differently in detail

    提出了一個改進遺傳演算法的結構，並且應用於帶有目標是最小平均總流程時間的流水調度排序中.為了改進一般遺傳演算法的程序，兩個新的操作被引進到這個操作中.這兩個操作為： 1 ）過濾操作：過濾掉在每一代中的最壞的個體，用前一代中的最好的個體替代它； 2 ）培育操作：當在一定代數內演算法不改進時，選擇一個培育操作用於培育最有希望的個體.通過大量的隨機產生的問題的例子的計算機實驗顯示出，提出的演算法的性能明顯好於一般遺傳演算法，並且和此問題的最好的專門意義的啟發式演算法相匹配.新的mga框架很容易擴展到其它最優化當中，只是實施的詳細的步驟有所不同
  15. We regulate a command - response pair for the encryption / decryption operation based on permutation code, combining rsa and md5 used in cos safety module, and bring forward a safety transmission process for documentation

    並給排列碼加密解密操作賦予相應的命令應答對，結合智能卡操作系統的安全模塊中的rsa演算法和md5演算法，提出了使用這種數字簽名卡進行文件安全傳輸的過程。
  16. Because of the defect of long running time and big complexity in the classical job - shop scheduling algorithm, the paper brought forward an intelligent optimization algorithm based on rule ; scheduling process is divided to primary process and optimization process. through the method of ahp ( analytical hierarchy process ), the effect is researched between several rules and estimate. moreover, the results of ahp are used as a measurable standard to scheduling results

    本文針對傳統車間作業調度演算法運行時間長，復雜度大的缺點，提出了基於規則的智能優化調度演算法，將排序的過程分為初始排序與優化排序;基於多目標決策的層次分析方法，得出了各種規則與系統評價指標之間的影響度，其結論為生產計劃方案的選擇提供了定量的參考依據。
  17. Compared this with genetic algorithms, it brightens a promising future with practical examples in water supply and drainage design

    通過實例說明蟻群演算法的過程，並與遺傳演算法進行比較，表明蟻群演算法在給排水管網設計中有較為廣闊的應用前景。
  18. Then it presents the design of information push service based on agent by using artificial intelligence technique. a brief introduction of each function module in this system and their internal transaction sequence are followed. the detail design and implement of key parts in each module is also given, which includes setting up user interest model with vector space model, searching information by using word segmenting and searching engine, filtering information using sorting algorithm, ordering information using pagerank algorithm

    本文首先分析了傳統的信息「拉取」方式存在的主要問題以及推送技術的產生;然後結合人工智慧領域的agent技術，提出了基於agent的信息推送服務的總體設計，並簡要闡述了各功能模塊的內部處理流程和思想;接著給出了各模塊的詳細設計與實現，主要包括:利用向量空間模型（ vectorspacemodel ）建立用戶興趣模型，通過分詞並與搜索引擎協作實現信息檢索，採用分類演算法對已檢索的信息進行過濾，用pagerank演算法對信息排序。
  19. The off - line program system based on cad / cam for dispensing robot is designed on the computer. in the module of trajectory planning, preliminary discussion is done about the shortest loop path and an algorithm of solving this problem is provided ; in the module of back procedure, dda ( digital differential analyzer ) is adopted in line, circle and ellipse interpolation. at last the protocol transferring program data to robot from off - line system is analyzed

    在離線編程的系統的設計中，實現了cad的建模、點膠軌跡的程序示教、工藝參數編輯、軌跡規劃、後置處理等功能，並在規劃模塊中針對平面內不規則排列點進行點膠的軌跡規劃進行了初步探討，採用圖論的方法，給出滿足實際要求且演算法復雜度較小的最短閉合迴路的程序演算法;在離線編程系統的後置處理模塊中，介紹了直線、圓弧、橢圓弧的dda插補方法以及脈沖分配不均勻的改進方法;最後對通信協議的制定進行了分析。
  20. The dividing process is recorded by octree, and then we make out the rapid adjacent - field searching algorithm using envelopment - box ' s recursion feature. this algorithm can also kick off some noise - points from the data cloud. it make the consequent process of surface reconstruction more convenience and precise

    分割過程採用八叉樹來記錄，並利用包圍盒的遞歸特性實現了點的鄰域的快速搜索演算法，同時可以有效地排除噪聲點，顯著減少了密集散亂數據點雲幾何建模所花費的時間，提高了建模效率。
分享友人
分享到 Line

分享到臉書