最長傳播時間 的英文怎麼說

中文拼音 [zuìzhǎngzhuànbōshíjiān]
最長傳播時間 英文
maximum propagation time
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 長 : 長Ⅰ形容詞1 （年紀較大） older; elder; senior 2 （排行最大） eldest; oldest Ⅱ名詞（領導人） chief;...
  • 傳 : 傳名詞1 （解釋經文的著作） commentaries on classics 2 （傳記） biography 3 （敘述歷史故事的作品）...
  • 播 : 播名詞（姓氏） a surname
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 傳播 : 1 （廣泛散布） disseminate; propagate; spread; （over）; diffuse; transmit; run 2 [物理學] propag...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. Professor featherstone of nottingham trent university, one of the most influential participator in post - modernism and cultural globalization debate, has devoted himself to a vast project - new encyclopedia project recently

    摘要英國諾丁漢特倫特大學社會學與傳播學教授費瑟斯通，作為后現代主義和文化全球化論爭最有影響的參與者之一，最近致力於並將在今後很長一段時間都要從事的浩大工程新百科全書工程。
  2. In satellite navigation and positioning system, time is important information for fast and direct acquisition of long cycle code, one of its important aspects is the uncertainty compression of signal ' s propagation delay to reduce time search range

    摘要衛星導航定位系統中，輔助長碼快捕的一個最重要的信息是時間信息，衛星信號傳播時延估計是提供先驗時間信息，減少時域搜索范圍的一個重要方面。
  3. Special blog websites are mushrooming, and they are gradually used in the fields of news dissemination, network marketing, and educational teaching etc. practical teaching is the most important part of teaching system of the high vocational education practicality to train teaching in fact, which is different from the experimental teaching of ordinary higher education and practicing teaching

    博客是信息技術發展的產物， 2002年引入中國，盡管時間很短，但發展非常快，其應用也非常迅速，專門的博客網站也如雨後春筍般成長起來，在新聞傳播、網路營銷、教育教學等領域都得到了廣泛應用。實訓教學是高等職業教育實踐性教學體系最重要的部分，它不同於普通高等教育的實驗教學、實習教學。
  4. America set up a poker museum in cmcmnat ; of - in 1984. and stoued - thousand decks of poker and 70 thousand which are not integrative. it is said it is the largest collection site of poker in the world. some of the oldest and the most valuable poker are collected in morgan museum in newyork. poker collections also take place in the notional library on paris, and two sites in england, the great england museum and the gilld hall, so do vienna, nuremberg, dresden, munich, and buelapest. augsburg city in german is well known as " poker city " for poker production. poker museum and poker france also stand there. the first poker museum in gave its opening ceremony on 17th dec. 1999. it situates in - of the souehern paris it is rich or 8, 500 set of collections, mcluding 5, 000 sets of poker, 800 pieces of printing plate, drawinigs and acher is ement, about 1, 000 set of other things in relation to poker, the mose valuable collection is " farrari car " painted with - produced in 15th centrury. they goe it on the oction at the price of 750 thousand franc in 1967. and theothers are as follows, the best painting of manufactual in dustry in paris in 16th centrury. a typeset table in 17th centrury, the only existing luxury copy. of 1967, and two sets of poker prineed with 4 suits of ballet fashion

    根據專業市場研究公司的分析和預測，如果我們把電視傳媒報紙雜志媒體廣播媒體網際網路媒體稱為「主要媒體」 ，經過未來數年的快速發展，廣告撲克將成為「次媒體」中最具影響力的表現形式。其實，廣告撲克的賣點之清晰市場之廣闊前景之巨大，並不需要專家來研究和預測，只要我們注意到以下事實就深信不疑：一盒名片100張，一般的價格為15 30元盒，最低的價格為10元，平均每張名片的價格為0 . 1元到0 . 3元一張a4的銅版紙雙面彩頁，價格在1 . 0元左右，可是辛辛苦苦製作的彩頁大多是被隨客戶隨手扔掉，在展覽會上經常看見這種現象。與彩頁相比， 54張撲克的面積是a4紙的5 . 5倍，宣傳持續時間長得多。
  5. In this thesis, firstly, the existing heuristic algorithms for steiner tree problem are summarized ; secondly, a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented. through simulation, we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time. at last, the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented

    本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由演算法，該演算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最後，研究了wdm光傳送網中的多播路由和波長分配問題，並提出了wdm全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。
分享友人
分享到 Line

分享到臉書