binary gain 中文意思是什麼

binary gain 解釋
二進制增益
  • binary : adj. 二,雙,復;【化學】二元的;【數學】二進制的。n. 二,雙,復;雙體,復體;【天文學】雙[聯]星【數學】二進制。
  • gain : vt 1 獲得;博得,掙得;贏得,打勝(戰爭、官司)。2 吸引;爭取…(到一邊),說服。3 (尤指通過努力...
  1. In binary-gain system 4 more bits are used to specify the amplitude range within which the samples fall.

    在二進制增益系統中,用4位或更多數碼來確定各個樣的振幅范圍。
  2. The light spot image thresholding part of the suite puts forward the iterative algorithm to gain the best threshold by comparing, which could perfectly hold the original image feature. in the extracting the light spot image features part, the algorithms on calculating the coordinates of the " energy distribution barycenter " in the 256 gray levels image and the " geometric - center " in the binary image are adopted respectively and so on

    如在對光斑圖像進行二值化的過程中,通過比較發現使用迭代法求出最佳閾值的演算法能夠較好的保留原圖像的特徵。在對光斑圖像進行特徵提取的過程中,分別採用了對256級灰度的光斑圖像求其「能量分佈的重心」坐標;對光斑的二值化圖像求其「形心」坐標等演算法。
  3. Firstly, some basic algorithms for inducing decision tree are discussed, including id3, which uses information gain to select a splitting attribute when partitioning a training set ; c4. 5, which can deal with numeric attributes ; cart, which uses gini rule in attribute selection and induces a binary tree ; public, which puts tree pruning in the tree building phase ; interactive method, which puts artificial intelligence and human - computer interaction into the procedure of decision tree induction ; as well as sliq and sprint which are scalable and can be easily parallelized. advantages and disadvantages of these algorithms are also presented

    文中詳細闡述了幾種極具代表性的決策樹演算法:包括使用信息熵原理分割樣本集的id3演算法;可以處理連續屬性和屬性值空缺樣本的c4 . 5演算法;依據gini系數尋找最佳分割並生成二叉決策樹的cart演算法;將樹剪枝融入到建樹過程中的public演算法;在決策樹生成過程中加入人工智慧和人為干預的基於人機交互的決策樹生成方法;以及突破主存容量限制,具有良好的伸縮性和并行性的sliq和sprint演算法。
  4. Binary - gain amplifier

    二進制增益放大器
分享友人