show path 中文意思是什麼

show path 解釋
顯示/隱藏
  • show : vt (showed;shown 〈罕用語〉showed)1 給看,示,出示;顯示,顯出;陳列,展出,供參觀;炫耀,賣弄...
  • path : path(ol )=pathological; pathology n (pl paths )1 (自然踏成的)路;路徑;(馬路邊上的)人行...
  1. I hope this spiritual torch of jain precepts will show light of truth and peaceful coexistence to the benighted world treading the path of bitterness, intolerance and discord

    我希望耆那教義的精神火把為踏上苦難,偏狹,無序之路的黑暗世界帶來真理與和平共存的光亮。
  2. Yes, pious had told him of that land and chaste had pointed him to the way but the reason was that in the way he fell in with a certain whore of an eyepleasing exterior whose name, she said, is bird - in - the - hand and she beguiled him wrongways from the true path by her flatteries that she said to him as, ho, you pretty man, turn aside hither and i will show you a brave place, and she lay at him so flatteringly that she had him in her grot which is named two - in - the - bush or, by some learned, carnal concupiscence

    「虔誠」告彼以該國之事, 「節操」指示彼以通往該國之路。但途中,彼遇一形貌艷麗之妓,自稱「一鳥在手」 ,曰: 「呔,汝美男子,跟吾來,帶汝赴一極佳之所。 」一片甜言蜜語,將彼從正路誘人歧途!
  3. Show the critical path across inserted projects

    顯示穿過多個插入項目的關鍵路徑
  4. After introducing some backgrounds and the state of art of motion editing and motion synthesis, we introduce some basic operations of motion editing and show implementation results in eidolon. chapter 3 describes inverse kinematics, and two real time algorithms : ccd and jacobian transpose are discussed in detail. in chapter 4, we introduce the principle of multiple level b - spline, and motion path editing is achieved with such spline

    在介紹了運動編輯和合成的一些背景知識和研究現狀后,本文第二章概述了運動編輯的一些基本操作並給出了在eidolon中的實現結果;第三章介紹了逆向運動學演算法,著重講述了兩個具有實時性的演算法:循環坐標下降法和雅克比轉置法;第四章詳細介紹了多層次b樣條原理和用其進行運動路徑編輯的方法。
  5. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理, n -維交叉立方體可以容納n - 1個故障頂點,我們給出了它的時間復雜度為o ( n )的容錯路由選擇演算法及其最長路徑長度分析;在此基礎上本文證明, n -維交叉立方體的條件連通度為2n - 2 ( n 2 ) ,並給出了相應時間復雜度為o ( n )的演算法及其最長路徑長度;除此之外,本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ,其直徑不大於1 ,故障頂點總數不超過2n - 3 ( n 2 )時,交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  6. The path - way controlling of neptunium in co - decontamination step of purex process, the extraction thermodynamics of amido podand and its usage in recovery of actinides from simulated hllw have been investigated. more than 95 % np were maintained in np ( v ) in 1a extractor and flowed into 1 aw, if enough amount of hno2 was added in feed adjustment and then hno2 scavenger ( urea ) was added before extraction. three kinds of amido podand were synthesized, and the extraction of lanthanides, actinides and some fission products were studied. one of them ( tbopda, n, n, n ', n " - tetrabutyl - 3 - oxa - pantenadiamide ) was used as extractant to recover actinides from hllw. the results of experiments show that more than 99. 99 % actinides were recovered from hllw and separated basically in groups. the main digests are as follows : 1

    鎿走向控制研究中通過調價階段加入亞硝酸、而萃取前清除亞硝酸的獨特辦法可以將大於95的鎿趕入1aw 。合成了三種酰胺莢醚萃取劑,研究了它們對錒系和裂片元素的萃取熱力學,通過條件實驗選擇了其中一種莢醚tbopda ( n , n , n 』 , n 』 ?四丁基? 3 ?氧戊二酰胺) ,進行了從模擬高放廢液中分離錒鑭系元素的工藝研究,錒系的回收率大於99 . 99 ,並且基本上實現了錒鑭元素的組分離。其要點如下: 1
  7. We discuss the formation of the unidirectional links and their influence on the manet routing protocols such as dsr, dsdv, aodv. solutions are given to overcom e the problems, we analyze some of they and point out their limitations. in the third part, we show a new on - demand routing strategy supported unidirectional links, it use the two circuits route search algorithms to establish the route from the source node to the destination and backward with directions ; it transfer the route error messages from the backward positions to the forward positions one by one ; it apply the packet encapsulation technique to forward the packets through the unidirectional links and introduced the circuit path to transmit information from the forward node to the backward node

    接著,指出在移動自組網環境中,單向鏈路的普遍存在,分析了它的產生原因、它對目前協議棧的影響;然後,我們給出了一種按需路由的自組網單向鏈路路由演算法,它只有在需要路徑的時候才維護路由,使用二循環路由尋徑演算法以建立節點間的路徑,使用逐跳逆向傳遞的方式報告路由終斷,使用封裝廣播的方式沿單向鏈路正向傳輸,使用報文封裝方式支持單向鏈路下游節點向上游節點傳遞信息。
  8. An infeasible path - following algorithm is constructed, and its polynomial complexity is analyzed. numerical tests show the self - adjusting effect of the parameters

    基於這組方程,文中建立了一個求解線性互補的不可行內點演算法,並分析了它的多項式復雜度。
  9. To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5

    詳細分析了與rwa相關的光網路關鍵技術,包括傳輸、交換、組網等,重點研究了光交叉連接的功能和結構、性能,對其引入的串擾進行了詳細分析,選擇恰當的器件參數進行了數值模擬,並提出了抑制措施(如雙重濾波、優化判決門限、選擇恰當的復用波長數) ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題(光網路類型、業務類型、流量類型、光網路生存性) 、 r認人演算法的分類和比較,具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法,提出預置光路的概念,對網路資源進行狀態分類(佔用、未佔用、預置) ,利用改進的r認叭演算法模擬,預置光路可為部分新到的連接請求快速建立連接,從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法,提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數,利用基於波長分層圖模型的并行r場人演算法模擬,利用新的鏈路權重函數使得演算法具有更優的性能,使網路具有更低的連接阻塞率。
  10. ( 3 ) planar full - crank five - bar mechanisms without uncertainty singularity are chosen to construct a hybrid mechanism generating the given path. a mathematical model is set up to optimize the dimensions of five - bar mechanism with the minimal power consume of the controlling motor by the improved genetic algorithms. an example is given to show the effectiveness of the mathematical model

    ( 3 )第四章中,選取全曲柄五桿機構中的三種類型機構作為混合驅動機構,以減少用於控制其一連架桿運動的步進電機所消耗的功率為目的,建立相應的數學模型,用改進的遺傳演算法對該五桿機構進行優化綜合,求得尺寸參數。
  11. By computing the water level and sedimentation processes with and without considering the extension of flow path, the results show that the effect of the river mouth path extension on the sedimentation of the trail channel is a longer period of evolution for several years or even over 10 years, and furthermore, the effect becomes weaker and weaker gradually from downstream to upstream in general

    通過比較考慮和不考慮入海流路淤積延伸2種情況的計算水位和淤積量的變化得出:單一的河口延伸對下遊河道淤積的影響過程是一個相對較長的過程,需要幾年、甚至十幾年的發展,影響程度自下游到上游逐漸減弱。
  12. But this time, it is to show the heroes a path to the palace

    拜婭拉曾經多次玩弄陰謀,但這一次,她不得不老實向英雄們交待通往魔宮的道路。
  13. Numerical simulations were done to show the distortion of the wavefront and the interference pattern under several kinds of typical plasma density distributions. the ray path in plasma was calculated by the numerical solution of the vector equation of light ray, when the plasma density was closing to the critical electron density of the laser frequency. through the simulations, the factors that influence the measurement were found out under different density distributions and shapes of plasma

    在此基礎上,採用數值模擬的方法,計算了在幾種典型的等離子體密度分佈下,激光波面的變化和產生的干涉圖樣;並用光線矢量微分方程的數值解法計算了當等離子體密度接近光頻臨界電子密度時,光線在等離子體中的傳播路徑,從中掌握了在不同的等離子體密度和形狀下,進行干涉測量所應估計到的因素。
  14. I sincerely, deeply, fervently longed to do what was right ; and only that. show me, show me the path

    我誠懇地深深地熱切地期望去做對的事情,也只做對的事情。
  15. If you show your children by your actions that you respect the environment in which you live, this will start them on this path

    如果你用行動向孩子們表明你尊重你所生活的環境,這會引導他們走上愛護環境的正道。
  16. Traditional delay estimation based on ica requires the trail sequences to initialize the receiver, but the new algorithm based on ica does not need the trail sequences. it is based on the channel character of downlink, using the ica algorithm to estimate the multi - path mixture matrix, then, find the delay information which is embodied by the column vector of the mixture matrix. the simulation results show that it does enhance the performance of traditional detector without wasting the invaluable frequency resource

    傳統的通道估計演算法需要訓練序列使接收端的參數調整到理想狀態,而本文提出的基於ica的通道估計的多用戶檢測演算法不需要訓練序列,它是利用下行通道的固有特點,用ica的盲源分離法估計出多徑通道的卷積矩陣,從而從中提取出通道的延遲信息,模擬實驗結果證明這種方法在節省了頻譜資源的同時取得較好的估計效果,使得傳統的接收機的誤碼性能得到了很大的提高。
  17. An algorithm of path - based timing optimization by buffer insertion is presented. the algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look - up table for gate delay estimation. and heuristic method of buffer insertion is presented to reduce delay. the algorithm is tested by industral circuit case. experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied

    提出了一種基於路徑的緩沖器插入時延優化演算法,演算法採用高階模型估計連線時延,用基於查表的非線性時延模型估計門延遲.在基於路徑的時延分析基礎上,提出了緩沖器插入的時延優化啟發式演算法.工業測試實例實驗表明,該演算法能夠有效地優化電路時延,滿足時延約束
  18. Js, wish you all the luck on your future path in the show business ! wish you better improvement in your acting ! bring us more attractive tv series ! !

    Js願你在今後的演藝道路上一切順利!演技更近一步! !給我們帶來更好看的電視劇! !
  19. Still, the change of vg parameter in the beam was investigated in this thesis. dilation of plastic belt in the beam is also studied. analysis show that there is clear direction during the dilation of plastic belt, which is similar with the path of shear - mode fracture

    分析表明塑性區的擴展有明顯方向性,據此得到的塑性區擴展方向與剪切型斷裂時的斷裂路徑比較接近,也與加載過程中韌帶區出現的集中剪切滑移線的方向比較一致。
  20. Because of above demands, the program of simulation of response of the impact load is generated by fepg, deeply analysis to the program shows the meanings of parameters, function of subroutines and interface files, and compared with the result of experimentation, which indicate the difference is small enough, so can generate the computing source program of the grid structure. as the beginning research of the load identification, this thesis discusses the recognisation of cantilever beam by ga, and the result is well, but the program is limit by number of the parameters. finally show the path of accuracy improvement

    基於上述要求,本文利用fepg對格柵結構在沖擊載荷作用下的響應進行了數值模擬,生成了計算源程序,並對源程序做了詳細而細致的分析,對內部各程序中的變量含義、子程序功能和文件介面做了詳細說明,並將模擬結果與實驗結果作了比較,結果表明, fepg在格柵結構的計算結果與實驗結果相差較少,可以用來生成計算源程序,為下一步的格柵結構載荷重構研究提供參考。
分享友人