例句與用法

1. We hatle discussed the k - matchings by using the relevant matching polynomial
   本章主要使用匹配多項(xiàng)式進(jìn)行研究。
2. In this work , we have also tried to make use of the k - matchings to analyze the reaction activity of atoms in pahs
   本文還對(duì)多環(huán)芳烴的化學(xué)反應(yīng)活性進(jìn)行了可視化設(shè)計(jì)，主要是從k匹配數(shù)的角度進(jìn)行分析。
3. More complex matchings are possible both in terms of the structure of the document , and in the values of the nodes and their attributes
   更為復(fù)雜的匹配可能同時(shí)在包含文檔的結(jié)構(gòu)方面以及在節(jié)點(diǎn)及其屬性的值中。
4. The control - flow stack is a last - in , first out list whose elements define the permissible matchings of control - flow words and the restrictions imposed on data - stack usage during the compilation of control structures
   流程控制堆疊是一個(gè)后進(jìn)先出的列表,它的元素定義了流程控制詞的允許的配對(duì)及在編譯控制結(jié)構(gòu)時(shí)的加入到資料堆疊的使用限制
5. 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
   首先為模型組件添加虛構(gòu)方程補(bǔ)償缺失的約束以構(gòu)建調(diào)試環(huán)境，然后采用圖論方法通過(guò)分析相應(yīng)方程系統(tǒng)的結(jié)構(gòu)鑒別出最小奇異組件，確定欠過(guò)約束發(fā)生的范圍，并提示給用戶。