x

bipartite

uploads/bipartite.jpg

bipartite adj.1.由兩部分構成的。2.【法律】一式兩份的；(條...

adj. 1.由兩部分構成的。 2.【法律】一式兩份的；(條約等)兩方之間的。 3.【植物；植物學】有二深裂的(葉子等)。 4.【數學】除兩次的。 短語和例子a bipartite contract 一式兩份的合同。 a bipartite pact 兩國協定。 bipartite rule 共同支配。 a bipartite leaf 二裂葉。 “bipartite cleftpalate“ 中文翻譯：   雙腭裂“bipartite cubic“ 中文翻譯：   雙枝三次曲線“bipartite genome“ 中文翻譯：   二分基因組,二重基因組; 兩分基因組; 兩分染色體組“bipartite graph“ 中文翻譯：   二部圖; 二分圖; 偶圖“bipartite matching“ 中文翻譯：   二部圖匹配“bipartite matroid“ 中文翻譯：   二部擬陣“bipartite network“ 中文翻譯：   對分網絡“bipartite oolite“ 中文翻譯：   對分鯢石“bipartite patella“ 中文翻譯：   分裂髕骨; 髕骨雙分裂“bipartite patellae“ 中文翻譯：   兩分髕骨“bipartite placenta“ 中文翻譯：   雙葉胎盤“bipartite shape“ 中文翻譯：   二分形“bipartite structure“ 中文翻譯：   二分結構[如指染色體核心顆粒“bipartite texture“ 中文翻譯：   二分結構“bipartite treaty“ 中文翻譯：   雙方條約“bipartite uterus“ 中文翻譯：   二分子宮“bipartite administrative act“ 中文翻譯：   雙方行政行為“bipartite light transistor“ 中文翻譯：   雙分式光電管“bipartite safety committee“ 中文翻譯：   雙邊安全委員會“bipartite trsut receitp“ 中文翻譯：   雙方的信托收據“bipartiter graph bipartite graph“ 中文翻譯：   偶圖“complete bipartite graph“ 中文翻譯：   完全二分圖; 完全偶圖“oriented bipartite graph“ 中文翻譯：   有向雙元圖“bipartisanship“ 中文翻譯：   兩黨合作“bipartisanbipartizan“ 中文翻譯：   兩黨連立的“bipartisan talkss“ 中文翻譯：   兩黨的會談

bipartition

The main content of this dissertation is as follows : this dissertation introduces in details the basic conditions that bipartite entanglement measure should satisfy and the five entanglement measure , von neumann entropy , formation of entanglement , distillation of entanglement , relative entropy of entanglement and entanglement monotone . this dissertation presents that for a class of states , their relative entropy can be calculated analytically 主要內容包括：詳細闡述了兩體糾纏度量須滿足的基本條件，以及五種基本糾纏度量： vonneumann熵、結構糾纏、提取糾纏、相對熵糾纏和糾纏單調，給出了一類態相對熵糾纏的解析計算公式。

Taking attributed scattering center - based classification as example , the computation of feature likelihood function under many - many and 1 - 1 correspondence are studied , by using the algorithm of bipartite graph perfect matching to find the optimal 1 - 1 correspondence , the computation efficiency is improved greatly , the relations of likelihood function between 1 - 1 and many - many correspondence are analyzed , and two sub - optimal methods of calculating the likelihood function of 1 - 1 correspondence are presented 本章以基于屬性散射中心特征的分類為例，深入研究了多?多對應和1 ? 1對應特征似然函數的計算，通過將求解二分圖最佳匹配的算法用于尋找特征之間的最優1 ? 1對應關系，有效提高了1 ? 1對應特征似然函數的計算效率，分析了1 ? 1對應和多?多對應特征似然函數之間的關系，給出了兩種次優的1 ? 1對應特征似然函數計算方法。

Based on nielsen theorem of bipartite pure - state transformation under local operation and classical communication ( locc ) , the dissertation shows that quantum entanglement can be used to accomplish state transformation and proves that the information in the two product systems can be transferred under locc 借助于兩體糾纏純態轉換的nielsen定理，指出了糾纏可用來幫助糾纏純態的轉換，并且證明了在局域操作和經典通信下，兩個不存在相互作用的純態系統的信息可以發生互換。

Cascaded low - density erasure codes are based on sparse random bipartite graphs . very efficient linear time encoding and erasure recover algorithms with the arbitrarily near erasure channel capacity performance of the codes with respect to the algorithms have made them one of the most optimal coding techniques up to now 基于稀疏隨機二部圖的級聯型低密度糾刪碼因其線性時間的編譯碼算法和可任意逼近刪除信道容量限而成為目前最佳編碼技術之一。

4 . when solving the tna problem based on minimum fleet requirement , a bipartite graph describing flight - pairing - link property is constructed , by which the primary problem is transferred to two weighted bipartite matching 在解決最少需用飛機數要求的飛機排班問題時，本文將尋找航班節銜接方案問題，描述成一個二部圖的匹配問題，進而通過解兩個二部圖的最小權最大匹配，尋找需用飛機數最少的飛機調度方案。

So we can conclude that the ground - state total spin ( gsts ) is related to its shape for finite bipartite haf . it is possible that the gs take a much highter value of ts than the lowest possible one ( lpst ) and higher degenerate 由此得出結論：有限雙組分海森堡反鐵磁( haf )系統，基態總自旋( gsts )的取值與它的格點位形有關，可能取比最低可能總自旋( lpts )高很多的值，從而導致高度簡并的基態。

Employing this conclusion we also prove a specially simple criterion : if the sum of the schmidt numbers of a set of bipartite states in a quantum system is bigger than the dimensions of hilbert space of the system , the states are not locc distinguishable 利用這個必要條件，不僅可得到很多新的不可局域區分的態組，還可對目前文獻報道的大多數不可局域區分的態組很容易地作出正確的判定。

Siam journal of computing , 1973 , 2 : 225 - 231 . 14 uno t . algorithms for enumerating all perfect , maximum and maximal matchings in bipartite graphs . lecture notes in computer science 1350 , springer - verlag , 1997 , pp . 92 - 101 首先為模型組件添加虛構方程補償缺失的約束以構建調試環境，然后采用圖論方法通過分析相應方程系統的結構鑒別出最小奇異組件，確定欠過約束發生的范圍，并提示給用戶。

The main contents of this thesis are shown below : 1 . a necessary and sufficient condition of the separability of a mixed state in bipartite systems is presented by decomposing a higher dimension hilbert space into many 2 2 subspaces 主要內容包括： 1 、提出了一種通過把高維hilbert空間投影到多個低維子空間的方法，來研究糾纏態的判據，得到了糾纏態的一個充分必要判據。

This problem was first studied by n . hasan and c . l . liu in [ 5 ] , and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem . hasan and liu proposed two algorithms that solves the cbvc problem 另外， kuo和fuchs還對如何修復給出了兩個算法：一個是近似算法，到目前為止，該算法仍然是最高效的頂點覆蓋問題的求解算法之一。

This dissertation derives the transformation rule between schmidt decomposable multipartite entangled pure states ( schmidt state ) under locc , which is the same as the rule for the bipartite entangled pure - state transformation under locc 得出了schmidt可分解的多體糾纏純態(簡稱為schmidt態)的轉換規律，發現這種轉換規律與兩體糾纏純態的轉換規律相同。

In this paper , firstly starting from the entanglement of bipartite system , we consider the heisenberg xyz model and investigate the influence of the parameter of the system to the entanglement 本文從兩體糾纏的基礎理論入手，首先以heisenbergxyz模型為研究對象，討論了系統的各個參數對形成糾纏度的影響。

2 there is also a new result on two bipartite graphs . let h be a graph obtained from km and kn by joining them with a bridge , and m > n > a > b , then r ( kab , h ) < max { r ( ka ? km ) , r ( ka4 , kn ) + m } 另外對完全二部圖的ramsey數進行研究，給山一個結論： h是在k _ m和k _ n之間連接一個橋得到的， m n b 。

In chapter 3 , orthogonal factorizations of graphs , including [ 0 , k1 ] m - factorizations orthogonal to a subgraph and orthogonal factorizations of bipartite graphs , is mainly studied 第三章研究了圖的正交因子分解問題，主要包括與任意圖正交的[ 0 ， k _ i ] _ l ~ m -因子分解和二分圖的正交因子分解

Comment : a graph is called bipartite if its vertex can be parted into two parts such that every edge connects one vertex in one part and another vertex in another part 說明：如果能夠把一個圖的頂點分成兩部分，使得每個邊連接的兩個點，都必然分別在兩個部分中，那么稱這個圖為“二部圖” 。

It is easy to see that every semisymmetric graph is necessarily bipartite , with the two parts having equal size and che automorphism group acting transitively on each of these two parts 顯然，半對稱圖是兩分圖，并且兩部分的階相同，自同構群在這兩部分上的作用是傳遞的。

In chapter 6 , we first discuss the relationship between quantum capacity and entanglement , then investigate the upper and lower bounds of the entanglements of bipartite gaussian states 第六章首先介紹量子容量與量子糾纏的關系，然后研究了雙邊量子高斯態的糾纏的上下限。

The enamelled bipartite dial with its well proportioned roman numerals is contrasted with pear - tipped hands crafted manually . a clear and noble character is created 部分的并鑲以細巧的羅馬數字的搪瓷表盤上轉動著手工制成的梨形金指針，都表達了高貴而清晰的特點。

It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low - density erasure codes 其中二部圖度序列的設計是構造低密度糾刪碼的最關鍵問題之一。