良好交割 的英文怎麼說
中文拼音 [liánghǎojiāogē]
良好交割
英文
good delivery-
In addition, chapter one also introduces the basic knowledge of the classification, function and delivery rules etc. of national debt and national debt futures. next, the author proceeds to explain the main body - - - the necessity and feasibility of the reconstruction of our national debt futures market. in order to sufficiently explain and better to conduct national debt futures transaction in our country, the author has got some valuable experience about reconstructing our national debt futures market after studying that market of developed market : 1
本文認為，近些年我國國債市場取得了長足的發展，無論國債市場的容量和流動性等交易條件方面還是國債市場基礎設施、投資者、國債利率市場化等環境條件方面都已經為國債期貨的推出打下了良好的基礎;同時為了我國國債期貨的順利推出，本文也提出了一些相關的政策建議，主要指國家應該逐步合併三個分割的國債市場，加快現貨市場短期國債的發行，並加強法律法規的建設，形成多頭監督管理制度，強化交易所的職能。A novel method of content - based image segmentation using deformable template matching is proposed. a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly. then the definitions of internal and external energy functions are given according to the image segmentation problem, and genetic algorithm is used to obtain globally optimal solutions. the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template. experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method
本文提出一種採用可變形模板匹配技術進行基於內容的圖像分割演算法.通過預先計算出可變形模板沿著變形的正交曲線，並對模板曲線及正交曲線進行離散抽樣，建立一基於正交曲線的二維（ 2 - d ）可變形模板，針對圖像分割問題定義控制可變形模板進行變形的內、外部能量函數，本文採用遺傳演算法搜索能量函數最小的全局最優解.該新演算法比傳統的可變形模板匹配方法降低了搜索空間的維數，減少了演算法對模板初始位置的敏感.對實際圖像及模擬低信噪比圖像處理的結果表明，新演算法具有良好的分割精度及穩定性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演算法。
分享友人