輸出優先權 的英文怎麼說

中文拼音 [shūchūyōuxiānquán]
輸出優先權 英文
output priority
  • : Ⅰ動詞1 (運輸; 運送) transport; convey 2 [書面語] (捐獻) contribute money; donate 3 (失敗) l...
  • : 名詞1 (時間或次序在前的) earlier; before; first; in advance 2 (祖先; 上代) elder generation; ...
  • : Ⅰ名詞1 [書面語] (秤錘) counterpoise; weight (of a steelyard)2 (權力) power; authority 3 (...
  • 輸出 : 1 (從內部送到外部) export 2 [電學] output; outcome; outlet; out fan; fanout; 輸出變壓器 output ...
  1. This article puts forward a solution named divide - assemble by deducing the size of bp neural network to overcome entering the local best point, the dividing process is that a big bp neural network is divided into several small bp neural networks, every small bp neural network can study alone, after all small bp neural networks finish their study, we can assemble all these small bp neural networks into the quondam big bp neural networks ; on the basis of divide - assemble solution, this article discusses the preprocessing of input species and how to deduce the size of bp neural network further to make it easy to overcome entering the local best point ; for the study of every small bp neural network, this article adopts a solution named gdr - ga algorithm, which includes two algorithms. gdr ? a algorithm makes the merits of the two algorithms makeup each other to increase searching speed. finally, this article discusses the processing of atm band - width distribution dynamically

    本文從bp網的結構發,以減小bp神經網路的規模為手段來克服陷入局部極小點,提了bp神經網路的拆分組裝方法,即將一個大的bp網有機地拆分為幾個小的子bp網,每個子網的值單獨訓練,訓練好以後,再將每個子網的單元和值有機地組裝成原的bp網,從理論和實驗上證明了該方法在解決局部極小值這一問題時是有效的;在拆分組裝方法基礎上,本文詳細闡述了入樣本的預處理過程,更進一步地減小了bp網路的規模,使子網的學習更加容易了;對于子網的學習,本文採用了最速梯度? ?遺傳混合演算法(即gdr ? ? ga演算法) ,使gdr演算法和ga演算法的點互為補充,提高了收斂速度;最後本文闡述了用以上方法進行atm帶寬動態分配的過程。
  2. In ad hoc, based on dcf ( distributed coordination function ) of ieee 802. 11, this paper introduces a new mac, which divides the packet into three kinds : non - periodic real - time information, periodic real time information, and non real - time information. the priority of these three information packets demotes in turn

    針對交換式以太網qos實現問題,按照網路流量分配級、實時性信息分配較高級的原則,本文提考慮級的加公平隊列演算法( wfqp ) ,即對交換機的數據流進行調度處理,降低實時信息的端到端延遲,從而有效提高實時信息的傳質量。
  3. We first consider the m / m / s queueing model with two priorities. through the analysis of state transition - rate equations of two priorities, the average queue length at the input or output of communications systems is derived

    考慮帶有兩個的m m s排隊模型,通過對兩個隊列的狀態轉移方程的分析,給了通信系統線上的穩態隊長。
  4. 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

    戰場數據分發的長短消息數據容量相差懸殊,分析了常規「服務」及「短消息」等調度演算法存在的不公平特性,根據戰術通信對信息服務的特殊要求,提了一種「動態」調度演算法,在點播模式下,可提高非對稱廣播通道數據的傳效率。
  5. We have found that many application of linear programming, such as assignment problem., traveling salesman problem, flow shop sequencing problem, hamilton problem and so on, fall into the category of transportation problem, that is, of shipping at minimum total cost a homogeneous good from a set of m warehouses to a set of n markets

    元素判別值分配法是基於運問題引發的通用解法,通過遍歷調運表中的各行各列計算每個元素的分配重? ?元素判別值,然後依據元素判別值,根據調配原則進行元素分配,使得分配方案在多數情況下一次分配即可獲得最解,但目前仍需要完善。
  6. Using the method of imbedded markov chain, probability generating funtion and laplace transform, we can obtain the mean queue length, mean waiting time for each queue and generalize this conclusion to multi - priority queues. this chapter includes four sections. in the first section, the detailed description of the system is given, and the set of stationary equations of the imbedded markov chain is obtained

    第二章考慮的是一個三個隊入的帶非搶的m m 1系統,這是一個連續時間的排隊系統,採用嵌入馬爾可夫鏈的方法,以母函數和拉普拉斯變換為工具求了三個隊的平均隊長和平均等待時間,並給了此結論推廣到n個隊的根據和方法。
分享友人