排序機 的英文怎麼說

中文拼音 [bèixùjī]
排序機 英文
collator
  1. First, strategy analyzing : through analyzing the inner and outer environment factors such as history, resources, competence and its strengths and weaknesses, we identified the firm ' s competitive advantages, core competence and long term goal. especially, we compare and arrange the order of civil listing cement enterprises in china through establishing a series of relevant indexes and fuzzy subsets method. we forecast the firm ' s next 5 years manufacture capability by recession analysis

    論文分析了企業的內外環境，歸納出企業優劣勢及企業發展的機會和方向，特別通過對企業歷史、資源、能力的分析，總結出企業的戰略目標及核心能力，通過建立相關指標體系及模糊聚類對水泥行業上市公司的競爭地位進行了比較分析與排序，通過二元回歸方法對秦嶺水泥的生產規模進行預測。
  2. The complexity and approximation algorithm of three parallel machines scheduling problem with servers

    帶服務器的三臺平行機排序問題的復雜性和近似演算法
  3. The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper. the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough, as to continuous attributes, the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  4. Wheeler ' s team used dna sequencing and computer simulations to reconstruct the evolutionary tree of venomous fish ? all the way back to their common ancestor

    威勒的團隊使用dna排序和計算機模擬的方法重構了有毒魚類的遺傳樹，一直追溯到它們的共同祖先
  5. When solving the tna problem based on fleet dispatching commands, a stage - assignment algorithm is build to overcome the defect of fifo algorithm, which can be widely applied to cope with fixed job scheduling problem. 3

    在解決基於飛機調度指令要求的飛機排班問題時，本文提出的分階段指派演算法較好地克服了標號演算法的缺陷，該演算法能普遍地應用於處理類似的固定工件排序問題。
  6. Firstly, the static time window model of scheduling aircraft landings at an airport with single runway or multiple runways was studied and the " matrix sorting algorithm " for deciding flights sequence was presented based on it

    論文首先介紹了單跑道和多跑道系統終端區到達飛機流排序的靜態時間窗模型，然後討論了動態排序問題，以此為基礎提出了矩陣排序方法。
  7. For example, a high proportion of nonfunctional sequence makes it unlikely that a functional element will be destroyed in a chromosomal crossover event, possibly making a species more tolerant to this important mechanism of genetic recombination

    例如，比例高的非功能排序就使得它在一次染色體搭橋事件中不太可能受到破壞，或許使得物種朝這個遺傳再結合的重要機制方面更有耐受性。
  8. This approach improves the test model by transforming the uml state diagram to extended finite state model ( efsm ), then eliminating the infeasible paths in the efsm. thus we can generate test message sequences from the resulting efsm and sort them

    該方法改進了基於uml狀態圖的測試模型:通過將uml狀態圖轉化成擴展有限狀態機模型（ efsm ） ，然後消除efsm中的不可達路徑;從而根據該efsm生成測試消息序列，並對消息序列進行排序。
  9. The mo - dified first - come - first - served algorithm, time - adva nc e algorithm and constrained position - shift algorithm are put forward to automat ically plan the most efficient landing order, to assign optimal spaced landing times to all arrivals without violate the spacing requirements for different typ es of aircraft and to enhance the usage of the runway under heavy traffic condit ion in the terminal area

    為了能夠在終端區交通繁忙的情況下高效地為到達的飛機流安排合理的著陸次序，並在不違反飛機間距要求的情況下給出各飛機經過優化的著陸時間，提高機場跑道的利用率，提出了經過改進的先來先服務、帶有時間提前量、帶有約束的位置偏移三種排序演算法。
  10. We show that under the consideration of discounted factor, jobs in the p - maximal initial set / * of module m should be processed prior to other jobs in module m, and the schedule is the optimal if the jobs in i * are n ' t be preempted by the jobs in n i *. this result is a extension of lawler ' s method for minimizing total weighted completion time with a series - parallel precedence

    證明了在考慮折扣因子的條件下，模塊m的因子最大初始集合i中的任務優先於模塊m中的其他任務，並且被連續加工所得的排序為最優排序：該結果推廣了lawler用來求解約束為串並有向圖的單機加權總完工時間問題的由底向上搜索分解樹的方法。
  11. The two particular highlights of this event were : first, liangxiang division established a mechanism in order, making the scene in an orderly manner

    特別值得注意的是，此次活動有兩大亮點：一是良鄉分部建立了排號機制，使得現場秩序井然。
  12. This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem, based on depth - first - search implicit emumeration algorithm, subject to mps limiting, position lock limiting and optimization depth limiting

    摘要以深度優先搜索的隱枚舉演算法為基礎，結合mps約束、位置凍結限制、優化深度限制，使用復雜的軟體編碼實現了特定於飛機著陸調度問題的優化排序演算法。
  13. The easyline 8031 is the cost - effective solution for sorting dice into waffle pack, jedec matrix trays or bonding onto artifical wafers

    Easy line 8031是具有較高價格/性能比的晶元分選機，它可以把晶元排序于編帶或各類載片盒中。
  14. Fourthly, we use the two models to study the dynamic single - machine scheduling problem prmp fmax and develop on - line optimal dispatching rules, which consider only available information

    考慮該問題在中斷一恢復和兩種中斷一安裝重復模型下的單機動態排序問題，給出了在這幾種模型下的只考慮當前可用信息的在線調度規則
  15. This article details the arrangement relationship of independence, order, deflection order and the waterfall arrangement ways according to path number and running time, with the stress on the " trapezoid " arithmetic of batch process in parallel computer

    摘要介紹了含有獨立、順序、有偏序關系的批作業的梳理，以及批作業按作業序列路徑數、運行時間長短排序的瀑布式方法，重點講述了并行機批作業執行時的「梯形」演算法。
  16. The premise to assure qos is to provide sufficient resource to meet demands. we come up with a method to partition the resources of web cluster for each class with its resource demand and priority requirement taken for granted, where system processing time or average access rates is summed up for each class periodically and resource demands is evaluated with stretch factor as performance metric. also the nodes marked in number will be orderly assigned to the classes ordered in priorities, which helps to maintain data locality and improves memory cache hits

    資源滿足需求是實現服務質量保證的前提，為滿足業務類動態的資源需求，我們提出一種支持業務類優先級和資源需求的資源劃分方法，通過按周期對業務類請求處理時間或平均訪問率進行統計，以響應擴展因子為質量指標對業務類預期的資源需求作出評估，採取按主機編號有序地分配給按優先級排序的業務類，減少業務類資源變動和提高主存cache命中率。
  17. They are sequenced by a sorting machine that puts them into alphabetical order.

    利用排序機，把它們按字母表的次序依次排列起來。
  18. Computer search algorithms for time window scheduling

    窗時排序的計算機搜索演算法
  19. In this paper we review the new development of scheduling in practice, espacially the machine scheduling with material handling device ( the robotic cell scheduling problem, the automated guided vehicles scheduling problem etc. ) and the hoist scheduling problem

    對排序問題的研究在實際應用中的新發展，特別是具有材料搬運裝置的機器排序問題和抓鉤排序問題作了綜述。
  20. The schedule of this kind of production can be formulated as assigning n parts to m machines. to find the optimal solution is an np - complete problem in theory

    該類生產的調度可歸結為n種零件需經m類機器加工的復雜非流水型作業系統的排序問題。
分享友人
分享到 Line

分享到臉書