priority algorithm 中文意思是什麼
priority algorithm
解釋
優先演算法-
A coding scheme is proposed to eliminate the redundancy of output vectors in pyramidal lattice vector quantization ( plvq ). a fast algorithm of labeling lattice points and a fast algorithm of finding lattice points are presented. and the transmission priority in case of asynchronous transfer mode is suggested
提出了一種與圖象本身無關的熵編碼方法去消除金字塔格型矢量量化（ plvq ）的輸出冗餘：同時也提出了由格點輸出索引和由索引輸出格點的快速演算法；而且還根據異步傳輸模式（ atm ）的特點，選擇了傳輸的優先級。 -
To deal with the difference on operating system level, this paper designs a thread - level algorithm based upon priority inheritance protocol to prevent priority inversion. a dynamic priority mapping and scheduling algorithm to achieve strict order is also presented. through analysis of multi - threaded execution order under fixed priority scheduling model, a multithreaded programming model with totally predicable execution order is proposed
針對各種操作系統的差異，本文提出了基於優先級繼承協議的線程級防優先級翻轉演算法，提出了能夠嚴格保序的動態優先級映射方法及相關的調度演算法，通過研究固定優先級調度下的多線程執行順序問題，本文還提出了一種執行順序可預測的多線程程序設計模式。 -
Deadline monotonic algorithm is studied from several perspectives including the development history of the theory, the scheduability test algorithm, priority inversion solutions, aperiodic task handling etc. and 2 important conclusions of the theory : static optimal property and the sufficient and necessary feasibility test, are discussed in proof form
從理論發展歷史、可調度性測試方法、優先級倒置的處理、非周期任務的處理等幾個方面對截止時間單調演算法進行了研究。並對演算法的兩個重要結論：靜態最優性和可調度性測試方法分別進行了證明和推導。 -
9 tgywk a r, lehoczky j p. algorithm for scheduling hard aperiodic tasks in fixed - priority systems using slack stealing. in proc. ieee real - time systems symposium, puerto rico, december 1994, pp. 22 - 33
Ic - eat構造了一個能確保多個cpu利用率的分散式多輸入多輸出控制環，它集成了非周期任務調度的許可控制機制與回饋控制機制，動態調整任務的qos 。 -
Therefore this paper proposes the delay equalization algorithm which can both guarantee the qos of high priority traffic and effectively reduce the delay of ubr traffic in broadband satellite network. it is based on the prediction and equalization the delay of vbr or abr traffic so that the saved slots can be allocated to ubr traffic. the approach of dynamic alternation slots between vbr and ubr traffic can improve the mean tdma frame utilization while reducing the delay of ubr traffic
因此本文在基於流量估計的資源調度演算法基礎上，提出了一種在寬帶衛星網路下能夠保證高級別類業務qos ，同時又能夠有效地降低ubr業務時延的時延均衡（ delayequalization ）調度演算法，它是基於對vbr或abr業務時延的預測，均衡時延的方法，保證vbr或者abr業務qos的同時，將節省的時隙分配給ubr業務。 -
In this approach, remaining operating time ( rot ) is divided into two types : one is relative rot, and the other is absolute rot. a new dispatching rule, i. e. the maximum relative rot of part is priority, is presented. this scheduling algorithm is proven to be effective by examples and theory analysis
論文重點研究了在單件、小批量生產方式下，基於啟發式的作業車間調度問題，提出了優先分配啟發式演算法的一種新的優先分配規則，即相對剩餘加工時間最大的概念，並從理論分析和軟體實現兩個方面驗證了該演算法的有效性。 -
The main method of the algorithm is using heuristic searching on dynamic network on the basis of all the flights " priority been determined
該演算法解決改航問題的基本方法是在確定航班優先級的基礎上在動態網路流模型中運用啟發式搜索法求得最優解。 -
After a short - term load forecasting method based analogous and linear extrapolation is proposed, the load forecast and the priority of equipment action are led into static reactive power optimization. the aim function is constructed for the practical situation of power system. on the basis of traditional genetic algorithm the fitness function and the holding of population diversity are improved
在提出基於相似日和線性外推的短期負荷預測新方法的基礎上，將負荷預測和設備動作優先級引入靜態無功優化中，並結合電網實際情況，構造了實用的目標函數，對遺傳演算法的適應度函數和群體多樣性的保持進行了改進，採用鄰域搜索運算元增加遺傳演算法的局部尋優能力。 -
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
排序演算法可以解決具有多扇出、多迴路嵌套及交叉反饋的邏輯門電路，按照其連接關系進行排序，並給出其中的最大反饋鏈。 -
An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising
提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
Abstract : an algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage. in the algorithm, the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance. first, the nets are arranged into different priority queues according to their weighted sum of their length and criticality. then, the cpa problem for one queue of nets is translated into a linear assignment problem. after the assignment of one queue of nets, a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned. the algorithm is tested by a set of bench mark examples, and the experimental results are promising
文摘:提出了一種在過點分配階段解決噪聲耦合效應問題的演算法.該演算法採用優先隊列同拆線重布策略相結合的方法，控制由互連線耦合電容引起的串擾噪聲.演算法中，首先按照線長和約束限制，將線網劃分到若干個優先隊列中.然後，將每個優先隊列的過點分配問題轉換為線性分配問題.在完成一個線網隊列的分配后，通過過點分配后處理過程檢查串擾約束滿足情況，對違反約束的線網對進行拆除，放入后續線網隊列進行重新分配.實驗數據表明，該演算法能夠取得好的效果 -
This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. an efficient priority - based heuristic algorithm is developed, which works slice by slice
在布線的各階段中，總體布線有較大的靈活性，但對各區域或信號線上的串擾難以估計詳細布線可以精確地計算串擾，但靈活性太小，往往出現反復拆線重布，難以達到設計收斂相比之下，總體布線和詳細布線中間的階段既有一定的靈活性，又可以相對準確地計算噪聲，是解決串擾問題的理想時機。 -
Rms ( rate - monntonic scheduling algorithm ) in acos is an optimal static priority algorithm for scheduling independent, preemptible, periodic tasks
Acos中的單調速率調度演算法（ rms ）對于可獨立、可搶先調度的周期性任務是一種最佳的靜態優先級演算法。 -
On the basis of comparing and analyzing dominating production planning and control approaches, an integrated production planning approach combining network planning and theory of constraints is put forward. and then, some key problems with the approach were studied, such as equipment resources assigned, bottleneck identified, selection of the operation priority rules, and optimization algorithm base on theory of constraints
然後，在比較與分析了當前主要幾種生產計劃與控制方法的基礎上，提出了一種基於網路計劃與約束理論集成的模具生產計劃與管理的方法，並重點研究了網路計劃與約束理論集成方法的資源分配、瓶頸資源識別、工序優先級別選擇以及基於約束理論的優化演算法等問題。 -
Chapter 2 uses two ways to address the issues of qos based resource allocation in ip over wdm networks. firstly, for optical - layering approach, we propose a novel priority - based wavelength assignment algorithm. by calculating the relative capacity loss, we manage to assign wavelengths so as to guarantee the blocking probability of the high priority requests to a lower degree, and at the same time with the least influence on the lower priority
基於此，首次提出了利用全網信息而支持優先級的波長分配演算法，由於利用了全網信息，在保證較高優先級請求的阻塞性能時，還對較低優先級請求的阻塞性能進行了優化，從而改善了全網的平均阻塞率；另一個為基於mpls技術的方法，提出了支持不同qos要求的vpn業務的設計問題。 -
Next, a novel priority - based wavelength assignment algorithm in all - optical networks with partial wavelength conversion is proposed, based on link independent assumption and the method of calculating the network the blocks probability. it improves the routing and wavelength assignment presented by others. this algorithm fits the demand of different business for asking the grade of corresponding different services in the modern all - optical network than the original algorithm
其次研究了部分波長可變wdm網中支持優先級的波長分配問題，以及在此網路中網路阻塞概率的計算;基於鏈路波長佔用獨立性假設，改進了在部分波長轉換wdm網中已有的rwa演算法，提出了一種支持優先級的動態波長分配演算法，該演算法保證了較高優先級的光路建立請求具有較低的阻塞率，比原有演算法更加適合現代光網路中不同業務請求對應不同服務等級的要求。 -
This paper analyzes and develops the existing risk analysis model bases on term rewriting system. it divides the group of assets into critical and normal subset, and performs the analysis in separate procedure. this reduces the system complexity, guarantee the priority of the critical assets ; it also introduces and / or attack tree into the attack scenario, cut down the system requirement of space, and provides support for both the coming graph rewriting model and decision selection algorithm
本文針對項重寫風險分析模型中資產的關鍵性級別，劃分出關鍵資產，通過分步的風險分析，實現不僅可以降低系統復雜度，還能有效保證關鍵資產的優先處理;引入了與或攻擊樹構建攻擊場景，節約了運行所需的空間，為后來的決策選擇打下基礎，同時也為以後的圖重寫的風險分析提供依據。 -
The length or the capacities of the tactical data are always different, and so the conventional data scheduling algorithm which consisted " first in first service " and " shore message first service " are not appropriate in the tactical communication applications. to meet the requirement of the information service priority, we presented a dynamic priority scheduling algorithms, which working on the order programming mode, can improve the efficiency of the asymmetric broadcast channel
戰場數據分發的長短消息數據容量相差懸殊，分析了常規「先入先服務」及「短消息優先」等調度演算法存在的不公平特性，根據戰術通信對信息服務優先權的特殊要求，提出了一種「動態優先權」調度演算法，在點播模式下，可提高非對稱廣播通道數據的傳輸效率。 -
Automatic calibration of portable test instrument based on fixed priority algorithm
基於固定優先級演算法的便攜式檢定儀自動校準 -
In the part of steady optimization in frontapc, a multi - priority algorithm is given
在frontapc穩態優化部分，作者給出了一種多優先級穩態優化演算法。
分享友人