x

acyclic

uploads/acyclic.jpg

acyclic adj.非周期性的；【化學】非環式的；【植物；植物學】非...

adj. 非周期性的；【化學】非環式的；【植物；植物學】非輪生的。 “acyclic accelerator“ 中文翻譯：   無環促進劑“acyclic circuit“ 中文翻譯：   非循環電路; 非周期電機; 非周期電路“acyclic communication“ 中文翻譯：   非周期性通訊“acyclic complex“ 中文翻譯：   非循環復形“acyclic compound“ 中文翻譯：   無環化合物; 無環式化合物“acyclic digraph“ 中文翻譯：   無圈有向圖, 非循環有向圖“acyclic dynamo“ 中文翻譯：   單極發電機“acyclic elastomer“ 中文翻譯：   無環彈性體“acyclic feeding“ 中文翻譯：   非同期性饋送; 非周期饋送; 非周期性饋送“acyclic flower“ 中文翻譯：   非輪生花“acyclic generator“ 中文翻譯：   單極發電機“acyclic graph“ 中文翻譯：   非循環圖; 非循環圍; 環道自由圖; 無圈圖; 無圈圖, 非循環圖“acyclic hydrocarbon“ 中文翻譯：   無環烴“acyclic hydrocarbons“ 中文翻譯：   無環烴“acyclic hypergraph“ 中文翻譯：   無圈雙線圖“acyclic isoprenoids“ 中文翻譯：   無環異戊間二烯化合物“acyclic machine“ 中文翻譯：   單極電機; 單極發電機; 非周期性電機; 非周斯性電機“acyclic model“ 中文翻譯：   非循環模型“acyclic motion“ 中文翻譯：   無旋流動“acyclic network“ 中文翻譯：   非循環綱絡; 非循環網絡; 非周期勢運動“acyclic nucleotide“ 中文翻譯：   無環核苷酸“acyclic oscillations“ 中文翻譯：   非周期性振蕩“acyclic phyllotaxis“ 中文翻譯：   非輪生葉序“acyclic terpene“ 中文翻譯：   無環萜烯“acyclia“ 中文翻譯：   體液循環停止“acyclic carrier function“ 中文翻譯：   非循環承載形函數

The quantum gate array is the natural quantum generalization of acyclic combinational logic “ circuit “ studied in conventional computational complexity theory . in 1995 , barenco showed that almost any two - bit gate is universal , so building a feasible two - bit logic gate is the first step to engineer a quantum computer . in principle , the quantum bit can be carried by any two states system 在眾多的量子計算機模型中目前討論最廣泛的是量子計算機門組網絡模型，量子計算機門組網絡模型是經典計算機門組網絡結構的量子推廣，它是根基于barenco等人所證明的“一個兩比特受控操作和對單比特進行任意操作的門可以構成一個‘通用量子邏輯門組’ ”之上的。

acyl

Bn is a directed acyclic graph with network structure , which is intuitionistic and easy understanding . it can handle multi - information expression , data fusion and bi - directional parallel reasoning . the ability to colligate the prior information and the current information makes the inference much more accurate and believable 貝葉斯網絡是一種基于網絡結構的有向圖解描述,具有多源信息一致表達與信息融合能力,能進行雙向并行推理,并能綜合先驗信息和樣本信息,使推理結果更為準確可信。

The elip is suitable for the case that the uncontrollable subnet is cascade petri net and some cascade subnets are neither acyclic petri nets nor state graphs , and the main character is that the nonlinear integer program problem is converted into the problem that can be solved by using some standardized mathematical tools 當不可控子網是序狀petri網，且無法用整數規劃法綜合控制器時，可使用擴展線性整數規劃法，該方法的優點在于把非線性整數規劃轉化為可用標準數學工具求解的問題。

The petri net theory part : firstly , a new subclass of petri net named as cascade petri net , which is the superset of acyclic petri net , is formally defined . secondly , some fundamental properties and some methods of reachability analysis of cascade petri net are presented in detail . finally , the determinant and decomposition algorithms of cascade petri net are given Petri網理論部分：首先定義了一類名為序狀petri網的全新的petri網子類，這種petri網是無環petri網的超集；接著討論了序狀petri網的基本性質及其可達性分析方法；最后研究了序狀petri網的判定和分解算法。

View maintenance is a challenging problem in data warehousing . this paper introduces and / or dag ( directed acyclic graph ) to materialized view sets and proposes a materialized view sets management mechanism on the background of the view maintenance problems and the theory of data warehouse in the dong gang logistical business intelligence system 數據倉庫中的實視圖維護問題是現在數據倉庫設計中的一項極富挑戰性的工作，本文在基于業務智能系統的基礎上，以東港物流系統中的實視圖維護問題為背景，采用了面向對象的實視圖技術。

The quantum gate array is the natural quantum generalization of acyclic combinational logic “ circuit “ studied in conventional computational complexity theory . in 1995 , barenco showed that almost any two - bit gate is universal , so building a feasible two - bit logic gate is the first step to engineer a quantum computer . in principle , the quantum bit can be carried by any two states system 在眾多的量子計算機模型中目前討論最廣泛的是量子計算機門組網絡模型，量子計算機門組網絡模型是經典計算機門組網絡結構的量子推廣，它是根基于barenco等人所證明的“一個兩比特受控操作和對單比特進行任意操作的門可以構成一個‘通用量子邏輯門組’ ”之上的。

To study software project time related risk in software project process , the definitions of temporal bayesian network and scheduling bayesian network are given . the probability updating algorithm for acyclic temporal bayesian network based on model simplification and general probability updating algorithm for temporal bayesian network are presented 其中在時間貝葉斯網絡研究中,分別提出了適用于非循環時間貝葉斯網絡的基于模型化簡的概率更新算法和一般概率更新算法。

Bn is a directed acyclic graph with network structure , which is intuitionistic and easy understanding . it can handle multi - information expression , data fusion and bi - directional parallel reasoning . the ability to colligate the prior information and the current information makes the inference much more accurate and believable 貝葉斯網絡是一種基于網絡結構的有向圖解描述，具有多源信息一致表達與信息融合能力，能進行雙向并行推理，并能綜合先驗信息和樣本信息，使推理結果更為準確可信。

Domain ontology can be modeled a simple directed acyclic network , subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ) , association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h ) 領域本體可以模型化為一個簡單有向無環網絡，概念之間的包含關系可以通過a ~ h中的(直接)前驅后繼算法來求解，而概念之間的關聯度可以通過a ~ h中的最短路徑算法來求解。

An algorithm is proposed to avoid the crack between terrain blocks , set the state of the border vertices consistent forcibly , at the same time set the ancestors of these vertices active , which use the dag ( directed acyclic graphic ) to decide the dependency relationship of vertices 摘要提出了一種避免地形塊間裂縫的算法，將公共邊界上的頂點狀態設為一致，對于那些由不活躍變為活躍的邊界點，利用頂點引入次序的有向無環圖將其祖先頂點也設為活躍。

The compare is made between the one - versus - one , one - versus - rest and directed acyclic graph algorithm of presented support vector machine multi - class classification algorithms . the simulations show the advantage of directed acyclic graph algorithm over the others the identification rate 分析比較了現有支持向量機多值分類算法中的一對一、一對多和有向無環圖算法，分析表明有向無環圖相對于其它兩種算法，不僅速度快，而且識別率也較高。

Of xml nodes ; a grove is a collection of trees in computer science terms , a directed acyclic graph , and xslt is an example of a host language for xpath that takes advantage of this distinction to allow xpath to process the contents of multiple source documents courtesy of the xslt ，林是樹（在計算機科學中指的是有向無環圖）的集合， xslt是一種xpath宿主語言，它利用了這一差別來允許xpath處理多個源文檔的內容（得益于xslt函數

Major contributions of this thesis include : 1 ) advances a new algorithm a ~ ( h ) to compute all possible paths , the shortest ( longest ) path and the ( immediate ) ancestor or descendent relation between two nodes on a simple directed acyclic network 本文取得的創新性成果主要表現在以下幾個方面： 1 )對簡單有向無環網絡中任意兩個結點之間的所有可能路徑、最短(長)路徑以及(直接)前驅后繼等問題，本文提出一種新的算法a ~ h 。

Among them the applications with the general local lemma arc the most important , such as acyclic edge colorings of graphs . we prove that the acyclic edge chromatic number of g is less than or equal to a + 2 for any graph g whose girth is at least 700 log ) sz局部引理給出應用實例，即無圈邊染色，證明了當圖g的圍長大于等于700 log時，圖g的無圈邊色教小于等于+ 2然后，用概率論的方法證明了幾種形式的lov (

The lip is suitable for the case that the uncontrollable subnet is cascade petri net and all cascade subnets are either acyclic petri nets or state graphs , and control laws can be calculated using some standardized mathematical tools 線性整數規劃法適用于不可控子網是序狀petri網， _且.各序狀子網要么是無環網，要么是狀態圖的場合，該方法的優點在于在數學上有一標準的求解工具。

The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification , shows the advantages of capability in dealing with scared samples , nonlinear and high dimensions 將次序最小優化改進算法和有向無環圖算法構建的支持向量機用于貨幣識別，充分發抨了支持向量機解決小樣本、非線性和高維模式識別問題的優點。

In the proposed algorithm , each application is represented by a directed acyclic graph , and then all directed acyclic graphs are partitioned into several levels , during executing process , the ready application set can insert in term of a certain regular 該算法采用有向無環圖表示每個應用，然后，將所有這些圖進行分層，執行過程中，就緒的應用組可以按照一定的規則動態插入。

Second , an adaptive rate - distortion model is proposed by extending directed acyclic graph model for fine granular scalable video coding . we add rate , original distortion and adaptive scale to the directed acyclic graph model 其次,針對精細粒度可擴展視頻編碼技術,本文擴展有向無環圖模型,在該模型中加入碼率,原始失真和自適應因子等屬性,建立了自適應率失真模型。

Based on the available resources mapping algorithm using the directed acyclic graph , a new dynamic resource co - allocation algorithm is proposed to solve the dynamic problem of the resource co - allocation in the grid 摘要針對網格系統中資源協同分配的動態性問題，分析了現有的基于有向無環圖的資源映射方法，提出了一種動態資源協同分配算法。