按序演算法 的英文怎麼說

中文拼音 [ànxùyǎnsuànfǎ]
按序演算法 英文
sequential algorithm
  • 按 : Ⅰ動詞1 （用手或手指壓） press; push down 2 （壓住; 擱下） leave aside; shelve 3 （抑制） restrain...
  • 演 : 動詞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. In power system full dynandc simulation software, the adndttance matrixes of fault branches are adopted in the fault models to simulate arbitrary symmetrical and unsymmetrical faults, by use of contraction technique for adndttance matrix the multi - faults and the randomly occurred faults can be processed. the feature of this method is that the arbitrary multi - fault occurred in a branch can be simulated without any additional branches or buses to be added, thereby, the ca1culation efficiency and the expedience of usage are improved

    本文提出採用故障支路導納陣處理復故障計算，該演算法可以對一條支路發生任意重故障進行處理，而不需要增加支路或節點，克服了目前常用的電力系統機電暫態程序在處理復故障時，一般要按照事先預想的故障類型以及故障和操作發生的位置增加新的節點和小開關支路的問題。
  2. Monitor apparatus can measure valid value of three phase voltage and current, power factor, three phase disequilibrium, instant flecker of short time and harmonic without twenty, degree and harmonic distortion total. the paper are laid on the following. ( 1 ) master plan and function of circuit, ( 2 ) hardware design including circuit and principle of a / d conversion, phase lock, liquid crystal display and keystroke and so on, ( 3 ) design of system software including digital filtering, fft, a / d conversion and monitor interface of pc, ( 4 ) system test

    監測儀能夠完成包括三相電壓、三相電流的有效值、功率因數、三相不平衡、電壓短期閃變、以及20次內的諧波、諧波相位、諧波失真總量等的測量。論文重點介紹了以下幾部分： （ 1 ）電路的總體設計和功能； （ 2 ）硬體設計，包括a d轉換、鎖相環、液晶顯示和按鍵輸入等原理和電路。 （ 3 ）系統軟體設計，包括a d轉換、 fft 、數字濾波等程序的原理和演算法以及上位機監控界面的設計； （ 4 ）系統測試。
  3. The reference dictionary is sorted phonetically, making a systematic collation algorithm that will follow the same order impossible

    參考詞典是按語音順序排列的，使得系統的排列演算法無法按照相同的順序實現。
  4. This paper analysis the data mining of the single nd multiple streams time series, and draw a conclusion that the relationship between the events of the multiple streams time series are the association patterns dependency patterns, sudden patterns, this paper call them are structure patterns, the existing algorithm have n ' t discuss these patterns, although msdd discussed the dependency patterns, however, it ignored the association patterns, sudden patterns, this paper have a definition of the association patterns, sudden patterns and dependency patterns, and have a complete, frank algorithm called twma ( time window moving and filtering algorithm ), the peculiarity of this algorithm is that events is listed by the time window, by this way, the relationship of the events is clear

    本文將它們統稱為結構模式，而這正是目前其它演算法、沒有考慮到的，雖然msdd考慮了事件之間的依賴關系，但它忽略了突變模式，關聯模式等重要的知識表示。本文給出了關聯模式、依賴模式、突變模式的定義，提出了一個比較靈活全面、直觀的挖掘它們的演算法：時間窗口移動篩選演算法twma （ timewindowmovingandfilteringalgorithm ） 。該演算法的一個突出特點是將時間序列事件按時間窗口序列化，使得事件之間的時間關系表示很直觀，該演算法能成功地從多流時間序列中發現了事件之間的關系。
  5. Three steps of the method are, first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations ; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step ; finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme

    第一層優化是在整個規劃區域內，應用遺傳演算法搜索可能的變電站的遍歷順序；第二層優化是按照第一層優化確定的遍歷順序，應用綱絡圖論中的最小權匹配演算法分別對每一個變電站與其相鄰站之間的聯絡線進行優化。
  6. Concrete algorithm is firstly recognizing 2d feature obtained from geometric entities, then on the instruction of the shape analysis combining with the projective rulers of mechanical drawing, matching three 2d view features, creating 3d basic model, forming a operation list, finically finished 3d reconstruction

    在重建演算法上，利用提取的幾何實體進行二維視圖特徵的識別，在形體分析法的指導下，結合制圖中的投影原則匹配三維基本形體，最後按照基本體素的運算序列經過復雜的布爾運算完成重建。
  7. Application of genetic algorithm in data mining has been studied. based on gene hypothesis gene dynamic sort method has been brought forward. its feature is component of genes can become longer and better gene component and because of dynamic sort, good gene component can be kept effectively

    在分類規則提取系統中，為了更好地提高演算法的尋優和保優能力，提出了基因動態排序方法，即把各基因位按重要性大小進行排序，在此基礎上再進行交叉操作。
  8. The detail is clarified as follows : l ) based on the chaotic technology and contemporary encryption approach the paper put forward a new chaotic sequence, which introduced the m - sequence and the method of shrink key - the stream generator. the complexity of the sequence was promoted as the random alteration of the parameters of chaotic mapping, and at the same time, the shrinking key was used to enhance the security further more ; 2 ) the performance of one - way hash function was improved and new hash function construction methods are proposed through a novel hash method based on chaotic mapping and the aes - the rijndael algorithm. the algorithm of hashing messages of arbitrary length into 256 bits hash values was designed

    按照這種方法，輸出序列的周期性得以大大提高，理論分析和計算機模擬結果表明，該方法可以產生具有良好統計特性的密鑰流，而且易於軟硬體實現： 2 ）實現了一種基於混沌映射和分組密碼rijndael演算法的單向hash函數的構造方法，即使用logistic混沌映射產生混沌二值序列，序列的分組與明文序列分組進行按位異或后，進入rijndael加密模塊，所得的結果再加入到反饋端，參與下一分組輸入的異或運算，迭代結束時的rijndael加密結果即為所求的hash函數值。
  9. First, the minimal and maximal sentences of cfg are calculated. then the character strings are scanned one by one from the minimal sentence in certain order till the maximal sentence. the scanned character strings are printed or skipped according to a rule

    該枚舉演算法首先計算上下文無關語言的最小序句子和最大序句子，然後從最小序句子開始按照一定的順序掃描字元串，直至掃描到最大序句子為止，對被掃描的字元串進行判斷取捨。
  10. In this paper, we mainly optimize the flight profile of the aircraft, simulate the 4d - flight of them and research the application of sequence in arrival aircraft scheduling in terminal area. firstly, we create the mathematics models for simulating 4d - flight

    本文主要對按給定航線飛行的航班的飛行剖面進行優化設計，模擬航班的四維飛行，同時對到達航班隊列排序優化演算法進行設計、研究和實現。
  11. 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

    摘要介紹了含有獨立、順序、有偏序關系的批作業的梳理，以及批作業按作業序列路徑數、運行時間長短排序的瀑布式方法，重點講述了并行機批作業執行時的「梯形」演算法。
  12. In order to guarantee the validity of this algorithm, firstly the characteristic of an image is extracted, then the frame is divided into several blocks. in each block feature points are chosen to estimate the motion vectors according to certain scanning order

    為了保證該演算法的有效性，先提取圖像的特徵，再採用分區的方法在各個分區內按一定的掃描順序選取灰度最大值點作為特徵點用於運動矢量的估計。
  13. The main results in this paper as follows : first, a prototype of a shape - based image database retrieval system is completed, it can receive the query mode both by giving an example image and by sketching the desired object on the screen, second, five shape - based image retrieval methods are realized ; third, an algorithm based on triangulation for shape - based image retrieval is brought forward. in this algorithm, firstly, the edge of the original image is followed and the candidate corners in the original image are detected. then the counterpoints of the candidate corners in the result of edge follow are found, and the boundary corners whose counterpoints have been found are queued in the order of their counterpoints in edge follow

    同時本文中主要完成了以下三方面的工作：完成了一個基於形狀特徵的圖象檢索的原型系統，可實現例子圖象或徒手繪草圖兩種查詢方式；實現了五種利用形狀特徵進行圖象檢索的具體方法，並對其進行了分析比較；並且在繼承將三角剖分引入形狀檢索的思想基礎上提出了利用三角剖分進行形狀檢索的一種新演算法：先對原圖象進行邊界跟蹤和角點檢測；然後尋找初始角點在邊界跟蹤中的對應點，並對找到對應點的角點按其對應點在邊界跟蹤中的順序進行排序；再對排序后的角點進行德洛內三角剖分，得到能表示目標真實形狀的三角形序列；最後計算三角形序列的角度直方圖作為形狀特徵，並進行相似性匹配。
  14. ( 5 ) user management system is built by asp technology on the server - side. user ' s register and logging is accepted and the user permission for different group is designed ( program files referred to appendix 1 ) ; the connection between web server and plastic die material database system realized by ado, odbc technology, which will guarantee the mutual information transportation between the database system and different terminals ; ( 6 ) further study of expert system is discussed and the implementing reasoning base on plastics mould material selection neural networks is put forward and key problems is also discussed. according to the requirements of sustainability, extended knowledge frame of mould selection and track algorithm meeting the requirements of dynamics, history, structuralism, illegibility, unintegrity and uncertainty are verified and corresponding examples are also put forward

    （ 3 ）通過ado 、 odbc技術實現web服務器與塑料模具材料數據庫系統的連接，從而保證了塑料模具材料數據庫系統和各終端之間信息的雙向傳遞； （ 4 ）在服務器端利用asp技術建立塑料模具材料遠程選擇優化專家系統交互界面，通過標準數據庫查詢語言，客戶能對數據庫中的塑料模具材料信息進行查詢（程序文件列表參見附錄1 ） ；廣東丁業人學1學m學位淪義門）在服務器端利用sp技術建立用戶管理系統，接受用戶的注冊、登錄消求，為不同等級的用戶設定相應的權限（程序文件列表參見附錄1 ） ； （ 6 ）討論了進一步完善該專家系統所需做的工作，提出塑料模具選材神經網路批理的實現方案，並對其中的關鍵問題進行了討論：按照可持續發展的要求，對擴展的模具選材知識框架、滿足動忐性、歷史性、結構性、模糊性、個大根性、不硯定性等需求的跟蹤演算法進行了論證並給出計算示例。
  15. Research about the deadlock detection method experienced a long time. ac - cording to the resource requirement types of the processes, the distributed computa - tion models can be divided into single resource model, and model, or model and and - or model. generalization of these models is stronger gradually and the dead - lock topologies of these models are single cycle, cycle and knot respectively

    對分散式死鎖檢測演算法的研究由來已久，根據進程對資源的需求條件不同，分散式計算可以被分為單資源模型、 and模型、 or模型以及and - or模型，這些模型的通用性逐漸增強，它們在系統等待圖中所產生的死鎖拓撲結構相應地表示單環、多環和結（后兩種模型都為結） ，學者們對各種演算法的研究過程也是按著這個拓撲結構的順序展開的。
  16. Sorting algorithm can solve logic gate circuit for more fanout, more loop nestification and feedback alternately. we sort these nodes according to their joint relationship by the sort algorithm that can determine the priority order of digital circuit simulation and give the feedback chain

    排序演算法可以解決具有多扇出、多迴路嵌套及交叉反饋的邏輯門電路，按照其連接關系進行排序，並給出其中的最大反饋鏈。
  17. In this paper ， an optimal search strategy by dividing the whole surveillance area into regions is presented so that the optimal search can be adaptively implemented in phased array radar. firstly ， the inherent relationship among average discovering time ， radar resources consumption ， search frame period and target distribution density is studied. secondly ， parameters for the region search are optimized to achieve the optimal search performance inside regions. then ， the optimal search frame period for each region is derived to minimize the average discovering time of targets ， where the constraint of radar time resource and the importance of each region are taken into account. finally ， the adaptability of this search strategy is discussed. only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint ， the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. thus ， optimal search is adaptively implemented in the whole surveillance area

    本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索
  18. Reconfiguration approach of distribution network based on both system reliability and feeder loss is presented in this paper. being an objective function both to maximize the reliability and to minimize the loss of network, constraint conditions are considered as operation limits. an optimal method of the minimizing both the average service unavailability index and feeder losses is described in this paper

    本文以配電網可靠性最高、網路損耗最低為目標函數，以配電網的運行滿足電力連續供應為約束，提出了基於排序選擇、對違反約束個體進行直接比較的改進自適應遺傳演算法，對配電網的可靠性按照深度優先搜索最小路進行計算，對系統的網路損耗按照牛頓? ?拉夫遜法進行計算。
  19. In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6

    第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
  20. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
分享友人
分享到 Line

分享到臉書