最遲時間 的英文怎麼說

中文拼音 [zuìchíshíjiān]
最遲時間 英文
latest time
  • : 副詞(表示某種屬性超過所有同類的人或事物) most; best; worst; first; very; least; above all; -est
  • : Ⅰ形容詞1. (緩慢) slow; tardy; dilatory 2. (晚) late; delayed 3. (遲鈍) slow; obtuseⅡ名詞(姓氏) 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 (一間...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. Outraged, yes, but it took two years and german resumption of unrestricted submarine warfare in early 1917 ( which mr roberts strangely postpones to that september ) to bring america to war ? surely the longest reaction - time in the history of galvanism

    義憤填膺,沒錯,但是兩年之後,再加之德國人在1917年初恢復的無限制的水下戰爭才把美國捲入了戰爭(羅伯特很奇怪地把到當年的9月)那一定是歷史上反應長的電療法。
  2. Using the logarithm graph, multi - varieties production batch problem is resolved. the production scheduling is realized with heuristic traverse algorithm. at last, the strategies, which include disassembling task, shorting interval of the working procedure, overlapping working procedure, deferring the back working procedure etc., are brought forward to deal with the order ' s inserting, postponement, freezing and doing again on carrying out the production plan

    3 )分析了企業職能信息系統的集成性和各部門的協調性,研究車生產計劃的制訂過程,以模糊多屬性折衷式模型實現了工藝路線的決策,採用對數坐標圖表法,解決了多品種生產批量問題,用基於啟發式的遍歷演算法實現了生產工單的排產,後提出了任務分解、縮短工序隔,相鄰工序疊加,延后續工序等控制策略處理計劃執行過程中工單的插單、延期、掛停與返工等特殊問題。
  3. Newer events will be delayed at most five minutes if the provider is under heavy load, assuming they are not dropped because of a full buffer

    如果提供程序承擔的負荷繁重,則較新事件的延多為5分鐘,前提是這些事件沒有因為緩沖區已滿而被丟棄。
  4. Based on these models, a main - road traffic flow model with two speeds on one dimension is designed. this model simulate the situation of one road in the city, traffic lights placed on the crossing, using the computer simulation, firstly, in the case of synchronized traffic lights, we investigated the velocity and flow of the model when the initial density, the turning probabilities, the number of the traffic lights, the green to signal ratio and the period of the signal are changed, then we have advanced some meliorate measure to traffic flow ; secondly, in the case of the traffic lights " signal update delay in turn, we found the optimal matching between the period of the signal and the delay time of the traffic lights so as to the perfect velocity and the flow of the model are attained

    在此基礎上,建立了一維二速主幹道模型,該模型模擬了城市交通中一條主幹道的交通情況,在交叉口處設置紅綠燈,通過計算機模擬,首先,在交通燈信號同步更新的條件下,研究模型在改變車輛的初始密度、轉向概率、交通燈個數、紅綠燈信號的綠信比、紅綠燈信號周期等各種情況下主幹道的速度、流量的變化,根據模擬結果提出一些改善交通的有效措施;其次,在交通燈信號依次延更新的條件下,研究模型在參數道路長、紅綠燈綠信比、交通燈個數、車輛的初始密度給定的情況下找到紅綠燈信號周期和延佳匹配使得主幹道的速度、流量達到理想的值。
  5. All applicants / nominates will be notified by january 20, 2006. fellow term will begin as soon as possible thereafter, but no later than september 2006

    所有申請人被提名者將於2006年1月20日接到通知。隨后,該項目將在內啟動,不會晚於2006年9月。
  6. According to a delay - dependent stability condition of control systems, a state feedback controller is designed and the madb is obtained in terms of linear matrix inequalities

    該方法利用控制系統的滯相關穩定性條件設計狀態反饋控制器,得到大允許延,並以線性矩陣不等式的形式描述。
  7. Time delay was chosen by using autocorrelation function method and mutual information method, while reconstruct dimension was obtained by g - p saturation correlation dimension method and false nearest neighbor percentage method. furthermore, initial neighborhood radius was computed by the estimated noise level based on the g - p saturation correlation dimension method. secondly, a noise reduction of the inflow time series was carried out by chaotic nonlinear local projection noise reduction method, and the effects on noise to chaotic characteristics and state reconstruction parameters were discussed

    採用g - p關聯維法計算關聯維數; rosenstein法和kantz法計算大lyapunov指數;重構相空的延採用了自相關函數法和互信息量法;嵌入維數採用了飽和關聯維法和偽鄰近點法;初始領域半徑的選取採用了基於g - p關聯維法的噪聲水平的初始估計方法。
  8. The first class methods are the classical frequency domain - based equivalent system methods ( f - esm ) which recommended by mil - f - 8785c and mil - std - 1797a. five longitudinal low order equivalent systems and fourteen lateral ones are discussed in detail and some pieces of advice are given. also conduct an investigation in the time domain - based equivalent system methods ( t - esm ). and for longitude short period movement, two least square ( ls ) identification methods of estimating its parameters are studied

    研究了求取高增穩飛機的低階等效系統的幾種方法:研究了經典的頻域等效系統方法,針對縱向5種、橫向14種構型的低階等效系統進行了擬配實踐,並提出一些有益的看法;以頻域等效系統方法為基礎,提出了域等效系統新方法;以小二乘辨識為基礎,提出了兩種縱向短周期低階等效系統域辨識方法(等效延_ q參與或不參與) 。
  9. What is the latest time at which ups can pick up your shipment

    Ups可收取您的貨件的最遲時間是何
  10. The optimized driver package ensures extremely low latency for pcs. a mac version will follow shortly

    佳化的驅動程式可使pc的延達到小, mac版本也將馬上跟進。
  11. A new method is proposed to obtain the maximum allowable delay bound ( madb ) for networked control systems ( ncss )

    摘要提出了一種獲取網路化控制系統大允許延的新方法。
  12. These include two keys problem in phase space reconstruction theory, that is embedding dimension and optimal delay time, and numeric recognition of chaos, that is lyapunov exponent, as well as numeric recognition of fractal, that is correlative dimension of chaotic attractors

    其中重點講述了非線性動力學的數值研究實驗方法:相空重構的兩個關鍵問題,即嵌入維數和佳延;混沌的數值識別,即李雅普諾夫指數;分形的數值識別,即吸引子的關聯維數。
  13. Given a list of tasks for a project, their times to complete, and their precedence relationships, the six sigma black belt should be able to compute the time to completion for the project, the earliest completion times, the latest completion times and the slack times

    給出一個項目的任務列表、它們的完成和它們之的優先級關系, 6西格瑪黑帶應能計算出項目的完成早完成完成和延
  14. When we say “ best route ” we consider parameters like the number of hops ( the trip a packet takes from one router or intermediate point to another in the network ), time delay and communication cost of packet transmission

    我們所說的優路徑需要考慮到的參數包括優路由路徑(信息包從在網路中一個路由器或中節點傳輸到另一個路由器或中節點)的數量,延和信息包傳輸過程中的消耗等等。
  15. Under vertical dynamic loading, the max deflection value will decrease with the loading time diminishing and also that of the stress of asphalt pavement

    路面大彎沉值與路面內各計算點的應力大值出現不同,應力在載荷消失后立即達到大值或延非常扳,而彎沉大值延相對較長。
  16. Abstract : in a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    文摘:在網路系統中,節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失,對于限令牌網路,節點消息發送和消息緩沖容量的分配是影響消息實性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制,說明了消息緩沖容量的確定與網路帶寬分配方法的關系,並提出了消息緩沖容量的確定方法,導出了避免消息覆蓋或溢出所需的大發送和接收緩沖容量余度.指出在消息的產生隔大於該消息的大允許的延和接收節點響應的條件下,發送和接收端的消息緩沖容量等於被緩沖消息的長度
  17. In a network system, overflow or overwrite of message buffer will cause missing of messages. for a timed token network, message transmission time and the message buffering space allocation in a node are very important issues on network real time capability. this paper analyses the message buffering mechanism, describes the relationship of message buffering space and message transmission bandwidth allocation, and proposes a space determination method of message buffer for ltpb network. the maximum space redundancy avoiding buffer overflow for “ send ” and “ receive ” buffers has been derived. it is found that the space of “ send ” and “ receive ” buffers is equal to the message size under condition that the message gap time is greater than message latency and node response time

    在網路系統中,節點緩沖區內消息發生覆蓋或溢出會造成消息的丟失,對于限令牌網路,節點消息發送和消息緩沖容量的分配是影響消息實性的重要因素.針對令牌傳遞網路分析了節點消息緩沖機制,說明了消息緩沖容量的確定與網路帶寬分配方法的關系,並提出了消息緩沖容量的確定方法,導出了避免消息覆蓋或溢出所需的大發送和接收緩沖容量余度.指出在消息的產生隔大於該消息的大允許的延和接收節點響應的條件下,發送和接收端的消息緩沖容量等於被緩沖消息的長度
  18. This thesis contains three parts, the objective is to minimize the maximum lateness on batching machine. two variants are analyzed. in part one, some notion, definitions and basic background information - ts introduced

    在實際生產中,存在大量成批加工的問題,即如何分批,以便使某一目標函數達到優的問題,論文主要研究了目標為極小化大延的分批排序問題。
  19. Some heuristics for the problems are present, and their performance guarantee is analyzed by the transform lemma. some present results are improved. in part three, the problem of scheduling n jobs on a single ' batching machine is addressed, and the jobs have release times and due dates

    第三部分研究了單臺批處理機器,工件的到達不同,以極小化大延為目標的分批排序問題1 | r _ j , b | lmax ,論文提出了一些近似演算法,給出該了問題相應的差性能比界。
  20. At the delay time when the area on the anode surface bombarded by electrons expands to a maximum field, the upper limit of ion beam current output is reached. the ion beam parameters are an accelerating voltage of 220 kv, an ion current density of 350 a / cm2 with beam pulse width of 70 ns and with composition of 30 % proton and 70 % carbon ions

    在電子流對陽極轟擊面積達到大所對應的延,獲得了大離子束流密度輸出,離子束參數為: 220kv , 350a cm ~ 2 , 70ns ,成分約為30 h離子和70 c離子,離子束流密度的波動同樣可控制在20 。
分享友人