generalized algorithm 中文意思是什麼

generalized algorithm 解釋
廣義演算法
  1. Focused on the application of the generalized cross correlation ( gcc ) time delay estimation ( tde ) in the car microphone array denoising system, gcc tde algorithm is analyzed theoretically and compared with high rank cumulation tde

    摘要針對汽車環境中麥克風陣列語音去噪系統的應用，對廣義相關時延估計方法進行了模擬，並與基於高階累積量的時延估計方法作了比較分析。
  2. Used perturbed method and making inexact generalized gradient projection with cone, perturbed generalized gradient projection method is proposed. the field of the algorithm is extended. numerical experiments show that the method is effective. secondly, using the trust region form and the pseudo - directional derivative of minimax problem, we propose the trust region form of minimax problem

    對信賴域法作了進一步的研究，藉助minimax問題的偽方向導數，構造出其信賴域二次模型，並結合非單調策略，給出求解minimax問題的簡單易行的信賴域演算法。
  3. Then discusses its properties, such as biased property, relative efficiency of generalized variance and superiority comparisons between generalized ridge estimation and generalized least squares estimation. shows iterative algorithm based on the mean dispersion error

    該估計雖然具有偏崎，但其估計精度具有良好的性質，如：有偏性、方差一致最優性、相對于廣義最小二乘估計的廣義方差效率、 mde ? ?有效性等。
  4. Dead - lock detection algorithm is developed gradually in the same order of the resource re - quire models. some classical algorithms were proposed in last decades, such as the single cycle detection algorithm proposed by mitchell and merritt, the cycle detec - tion algorithm proposed by chandy and misra, the knot detection algorithm proposed by lee and the generalized algorithm proposed by manivannan

    對每一種模型下發生的死鎖，在演算法研究中都出現了一些經典的死鎖檢測方法，如mitchell和merritt提出的單環檢測演算法， chandy和misra提出的環檢測演算法， lee提出的結檢測演算法和manivannan提出的通用檢測演算法等等。
  5. A generalized minium variance pole assignment pid self - tuning controller can be used for the system with gentle time - varying delay. the controller algorithm is simplified. its effectiveness has been shown in many simulation uses

    在考慮系統時滯特性的情況下，提出了適合一類時滯系統的廣義最小方差極點配置自校正控制器，並對控制器演算法進行了簡化，使該控制器簡單易行，適應性強，模擬結果表明它的有效性。
  6. Moreover, when the parameter is chosen in a certain interval, it is proved that the generalized d - gap function g has bounded level sets for the strongly monotone vip. an error bound estimation of the algorithm is obtained, which partially gives an answer to the question raised by yamashita ( 1997 ) et al

    更進一步，當廣義d -間隙函數g _ （ ）中的參數取值于某一區間時，證明了函數g _ （ ）對于強單調變分不等式而言，具有有界的水平集，同時，給出了演算法的一個誤差界估計，它部分回答了yamashita等人提出的一個問題。
  7. Chaos synchronization control algorithm for generalized lorenz system and generalized

    系統混沌同步控制演算法
  8. An iterative algorithm of solving generalized optimal set of discriminant vectors based on perturbation

    基於擾動方法的廣義最佳鑒別矢量集求解的一種迭代演算法
  9. An analytical algorithm of solving generalized optimal set of discriminant vectors based on perturbation method

    基於擾動方法的廣義最佳鑒別矢量集求解的一種解析演算法
  10. An iterative algorithm for the generalized optimal set of discriminant vectors and its application to face recognition

    求解廣義最佳鑒別矢量集的一種迭代演算法及人臉識別
  11. In this thesis, the optimality sufficiency conditions and duality theory are discussed in multiobjective nonlinear programming involving ( f, a, p, d ) - convexity and generalized ( f, a, p, d ) - convexity. at that time, an algorithm is discussed for nonlinear multiobjective problem

    本文主要討論了（ f ， ， ， d ） -凸及廣義（ f ， ， ， d ） -凸條件下非線性多目標規劃問題的最優性充分條件和對偶理論，同時，也探討了求解具有線性等式約束的非線性多目標規劃問題的一種新演算法。
  12. The content of this paper is arranged as foll owing : chapter 1 introduces the concept of credit, credit risk and credit assessment, as well as the history and development of credit assessment ; chapter 2 introduces the history of ai technology, and the background of expert system and neural network. characters and disadvantages of expert system and neural network are presented respectively and the necessity of combining expert system and neural network is lightened ; chapter 3 shows the process of dealing with sample data, including the treatment of exceptional data and factor analysis, and puts forward the concrete framework of the mixed - expert credit assessment system ; chapter 4 introduces concept of object - oriented technology, and constructs object model and functional model after analyzing the whole system. it also illustrates the implementation of concrete classes by an example of rule class and the inference algorithm in the form of pseudocode ; chapter 5 introduces the structure of the whole system, the major functional models and their interfaces, and the characteristic of the system is also generalized ; chapter 6 summarizes the whole work, and points out the remaining deficiencies as well as the prospective of this method

    本文具體內容安排如下：第一章介紹了信用、信用風險、信用評價的概念，回顧了信用評價的歷史、發展和現狀，並綜合各種信用評價模型，指出這些模型各自的優缺點：第二章簡單描述了人工智慧技術，著重介紹有關專家系統與神經網路的基礎知識，通過總結它們的優缺點，指出結合專家系統與神經網路構造混合型專家系統的必要性；本章還介紹了神經網路子模塊的概念，提出了混合型專家系統的一般框架與設計步驟：第三章對樣本數據進行處理，包括異常數據的剔除、因子分析等，提出了信用評價混合型專家系統的具體框架結構，介紹了系統知識庫的主要部分、基於優先級的正向推理機制的流程、以及基於事實的自動解釋機制的具體實現方法；第四章介紹了面向對象技術，進而採用面向對象對信用評價系統進行分析，建立了對象模型和功能模型，並在此基礎上，採用c + +語言以規則類為例說明系統中具體類的實現，用偽代碼的形式描述了推理的演算法；第五章描述了整個系統的結構，對系統主要功能模塊和界面進行了介紹，並總結系統的特點；第六章總結了全文，指出本文所構造系統存在的不足以及對將來的展望。
  13. We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept, we proposed an effective algorithm

    對從廣義開關網路中提取出兩點間連接矩陣的方法進行了研究，利用tarjan的拓撲圖塊劃分演算法、開關網路中的不可分二端圖概念等設計了較有效的演算法。
  14. Generalized discrete hopfield neural network and heuristic algorithm

    廣義離散神經網路模型及啟發式演算法
  15. By taking advantages of epipolar line features and depth discontinuities in reference 中國科學院 軟件 研究所 博士 學位 論文 基于 圖 象 的 快速 繪制 技術 的 研究 images ， an efficient inverse wmping algorithm is pfoposed in chapter 3 for gcnerating nagcs of novel views by combining multiple eference images 帆 enhm different vie 呷 oints because continuous segnents determi 。 d by pairs ofedge pixels at co 。 spending epipolar lines are order kept ， only pairs of edge pixels in the reference 渝 明 e e necess 叨 口 cowute to obtain generalized disparity of all points in the desired image as a result ， sighficant acceleraion could be made in the endering pfo 比 鴕 two accelerating techiq 此 s e presented in this algori 山 mb accelerate the hole illing process his algorithm extends the reference images rom projection of single col ： ii ’ ected surface in previously developed nvnverse w 出 下 er to ima 驢 s captured rom complex scene in chapter 4 ， an 《 dent ibr method is prese 庇 仙 y takn ull 訕 antage of 呷 bies c 咖 the method can simulate the 3d details on sllri ： ace of object successfully he 。 叩 proach ， called rered ature mopmp consists of two pans at fst ， an origi 。 ltexture with orthogonal displacements per pixel is deco 啊 osed into a series of new t6 刀 mfcs with each 他 lug a given displacement per pixel ， called ae ， ea atures ， or lt hen hese lt e used to render the novel view by conventional texture mapping d avoid gaps n the endered hlla 驢 ， some phels are to be interpolated nd extended in the 廠 kaccoding to the depth differe eee between two neighbor pixels in the original texture as these ltlt fc … e much storage nd therefore much time is equired to install ltlt into the text ’ ufc buffec an 舊 thod is pfoposed to co 呷 fcss the ltlt ， nd the cottcspondingfclldering method is given experimental esults show that the new method is efficient ， especially n rendering those objects with a smaller depth rnge compared withtheir size ， such as relief surfaces of building

    與己有的三維變換方法相比較，該方法不但成功地填補了由於投影區域擴張而產生的第一類空洞，而且成功地填補了由於空間深度非連續物體相互遮擋而產生的第二類空洞，從而方便地實現了虛擬環境中的漫遊；基於物體表面深度的連續性，本文提出了一個位移預測方法? ?此方法可以從單幅參考圖象獲得逆映射過程中所需要的目標圖象的位移信息，從而大大提高了演算法的效率：與通常的正向映射演算法相比，此演算法克服了多幅參考圖象所帶來的計算量成倍增長等問題，而且誤差較小。 2 ）基於極線幾何的快速逆映射演算法。利用參考圖象的邊界信息與隱含的遮擋關系，以及極線幾何的性質，本文第三章提出了一個基於極線幾何的快速3 『一中國科學院軟體研究所博士學位論文基於圖象的快速繪制技術的研究逆映射演算法，從多幅參考圖象精確合成當前視點目標圖象。
  16. In chapter 6, the usage of floater ' s algorithm on a disk is discussed which is for geometric reconstruction of surface with four edges using double cubic b - spline surface, and the algorithm is generalized to a cylinder and a mobius

    第六章討論了floater關於四邊拓撲曲面的雙三次b樣條幾何重建方法在圓一摘要浙江大學博士學位論文一盤拓撲曲面上的應用，並將其推廣到平環與mbbius帶上。
  17. A generalized particle model and algorithm for dynamic optimization of bandwidth allocation in atm networks

    網路帶寬動態優化的廣義粒子模型和演算法
  18. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  19. This paper applies generalized multipler method to translate convex quadratic programs with equal constraints and non - negative constraints into simple convex quadratic programs with non - negative constraints. the new algorithm is gotten by solving the simple quadratic program. it avoids the computation of inverse matrix and exploits sparsity structure in the matrix of the quadratic form. the results of numerical experiments show the effectiveness of the algorithm on large scale problems

    根據廣義乘子法的思想，將具有等式約束和非負約束的凸二次規劃問題轉化為只有非負約束的簡單凸二次規劃，通過解簡單凸二次規劃來得到解等式約束和非負約束的凸二次規劃新演算法，新演算法不用求逆矩陣，這樣可充分保持矩陣的稀疏性，用來解大規模稀疏問題.數值結果表明：在微機486 / 33上就能解較大規模的凸二次規劃
  20. A extended model and a generalized algorithm for a job scheduling problem in production management

    生產管理中一類排序問題的擴展模型及通用演算法
分享友人
分享到 Line

分享到臉書