Characterize the degree sequence of forests ! 指出森林的度序列的特征。
Analysis of sleep staging by time - window complexity sequence of eeg 基于時(shí)窗復(fù)雜度序列的睡眠腦電分析
Degree sequences of potential k5 - e - graph 圖的度序列
Degree sequences in graphs 圖中的度序列
It is shown that low - density erasure codes based on ( d , 2d ) - regular sequences of degree distribution are not close to optimal ( d > 3 ) . 3 從理論上證明了基于( d , 2d ) -正則度序列的低密度糾刪碼都不是漸近最優(yōu)碼( d 3 ) ; 3
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 其中二部圖度序列的設(shè)計(jì)是構(gòu)造低密度糾刪碼的最關(guān)鍵問(wèn)題之一。
Heavy - tail / poisson and right - regular sequences are analyzed in detail and a new method for designing the two classes of sequences above is presented 在對(duì)heavy - tail / poisson序列和右邊正則度序列的詳細(xì)分析的基礎(chǔ)上提出了一種新的設(shè)計(jì)方法。
Use stochastic simulation , create the plainness sequence of the stable stochastic road surface for the target road spectrums with programming , and use logistic test to verify 采用隨機(jī)模擬方法,通過(guò)編程產(chǎn)生目標(biāo)路譜的平穩(wěn)隨機(jī)路面不平度序列,并通過(guò)數(shù)理檢驗(yàn)進(jìn)行驗(yàn)證。
A new concept of so - called " constraint degree " is introduced for a multi - objective programming problems , on the basis of which the compatibility of the programming problems is described by all sequences of the constraint degree 摘要對(duì)于多目標(biāo)規(guī)劃問(wèn)題,提出了約束度的概念,基于此概念利用各個(gè)約束度序列可以刻劃該規(guī)劃系統(tǒng)的相容性。
Bandwidth efficient multilevel coded modulation system based on ldpc codes is described in the last part of this thesis . furthermore , the designing method of combining component code rate and degree distribution is introduced 介紹了ldpc碼的多層編碼調(diào)制系統(tǒng)中,分量碼碼率與度序列分布聯(lián)合最優(yōu)的設(shè)計(jì)準(zhǔn)則,并給出了相應(yīng)的理論分析。