計算樹邏輯 的英文怎麼說

中文拼音 [suànshùluó]
計算樹邏輯 英文
ctl
  • : Ⅰ動詞1 (計算) count; compute; calculate; number 2 (設想; 打算) plan; plot Ⅱ名詞1 (測量或計算...
  • : Ⅰ動詞1 (計算數目) calculate; reckon; compute; figure 2 (計算進去) include; count 3 (謀劃;計...
  • : Ⅰ名詞1 (木本植物的通稱) tree 2 (姓氏) a surname Ⅱ動詞1 (種植; 栽培) plant; cultivate 2 (樹...
  • : Ⅰ動1. (巡察) patrol 2. [書面語] (遮攔) blockⅡ名詞1. (巡察) patrol 2. [書面語] (山溪的邊緣) edge
  • : Ⅰ動詞(編輯; 輯錄) collect; compile; edit Ⅱ名詞(整套書籍、資料的各個部分) part; volume; division
  • 計算 : 1 (求得未知數) count; compute; calculate; reckon; enumerate 2 (考慮; 籌劃) consideration; pla...
  • 邏輯 : logic
  1. This paper trice to find the cause of effective ness loss and to analyze it theoretically by adopting the ways of quantitative analysis and quantitative analysis by using the way of fault tree to carry out the qualitative analysis, it draws the logic charts by various elements that cause the loss of effectiveness and to make a faucet tree to find out the loss programs, then make a final analysis of the smallest element of the fault tree. the first problem is due to the over friction by exceeding permitted limits ; the second problem is due to the gear feather ' s low inteusity, this paper adopts the method of changing the trans mission ratio of the first gear and the width of the sixth gear of second shaft so as to solve the problems

    本文採用定性和定量相結合的方法,利用失效進行定性分析,它通過對可能造成系統失效的各種因素,畫出框圖,從上到下繪成失效,找出失效譜,並對失效的全部最小割集進行分析,找出有可能的失效原因,再對其通過理論進行定量分析,由此發現第一個問題是由於離合器在極限狀況下的滑磨功超過其許用值造成的,第二個問題的原因是二軸六檔齒輪強度不足。
  2. Abstract : fault tree analysis is introduced about diagnosing fault in the electromechanical equipment. the qualitative and quantitative analysis is made to the structure and action of the fault tree analysis. this paper presents logical relationship between the element fault and system fault. general formulas are deduced from system reliability and the probability of the system fault

    文摘:介紹了機電設備的故障分析法,對故障的構成及其作用作了定性及定量的分析,指出了元器件的故障與系統故障的關系,並給出了系統故障概率公式及實例。
  3. Verifying the soundness of the uml statecharts model can be translated into the verification of the soundness of the global reachable state transition diagram, and the algorithms verifying the soundness and the properties of semantic - related are given. at the aspect of verifying the consistency of temporal constraints of workflow, the time events are added into the uml statecharts, then the rules translating the extended uml statecharts into timed automata are given. the upper constraints ( the most time interval between two tasks ), lower constraints ( the least time interval between two tasks ) and deadline constraints are defined by tctl. the consistency of these constraints in build time, instantiation time and run - time are defined respectively

    在驗證工作流時序約束一致性方面,在uml狀態圖中加入了時間事件,給出了將擴展后的uml狀態圖轉化為時間自動機的規則,用時間計算樹邏輯定義了兩個任務間的最大、最小時間間隔(上、下界約束)和工作流的最終期限約束,並給出了這三類約束分別在創建階段、實例化階段和運行階段的一致性定義,通過alur的演法對時序約束一致性進行驗證。
  4. The binary fat tree is a network topology which is prone to accomplish butterfly computing. according to this feature, a logical model for binary fat tree was constructed at first, and then a parallel fast fourier transform algorithm based on it was devel.

    二叉胖網路結構是一種易於實現蝶式的網路拓撲結構,基於這一特點,首先構造了一種二叉胖模型,並提出了一種基於該模型的并行快速傅立葉變換演法。
  5. On the basis of the concepts of divide - and - conquer and rough - fine, dia build a set of algorithm models including two rough classifiers ( i. e. bdt and cmac ) and three fine classifiers ( i. e. clchfpp, cpn - wed, nne - ifm ) which integrate some techniques such as clustering, decision tree, neural networks, fuzzy logic and information fusion etc. and take advantage of them, so dia has a high accuracy and speed theoretically

    Dia系統中演法模型的設基於「分而治之」和「由粗到精」的模式識別思想,具體構建了兩種粗分器( bdt和cmac )及三種精分器( clc - fpp 、 cpn - wed和nne - ifm ) ,這些分類器的設綜合了聚類法、決策、神經網路、模糊以及信息融合等技術的應用,並使其優勢互補,因此在理論上具有識別精度高及速度快的優點。
  6. A new algorithm called the rapid spanning - tree algorithm was developed to reduce the time for a network to compute a loop free logical topology

    一個新的演演法叫做快速擴充演演法,是開發用來減少網路上,一個沒有?圈的拓撲所需的時間。
分享友人