第一計演算法 的英文怎麼說

中文拼音 [dìyījìyǎnsuànfǎ]
第一計演算法 英文
first calculation
  • 第 : Ⅰ助詞（用在整數的數詞前 表示次序） auxiliary word for ordinal numbers Ⅱ名詞1 [書面語] （科第） gr...
  • 計 : Ⅰ動詞1 （計算） count; compute; calculate; number 2 （設想; 打算） plan; plot Ⅱ名詞1 （測量或計算...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 第一 : first; primary; foremost; first and foremost
  1. Among them the gray level co - occurrence matrix ( glcm ) and gray gradient co - occurrence matrix ( ggcm ) methods, which attributed to the statistic textural analysis scheme were then chosen to extract the textural features of five kind areas on satellite images. in the second part the principle of classification and bp neural network were introduced. combined with textural features, the improved bp neural network successfully performed on the classification of the satellite images

    論文的第一部分介紹了進行紋理特徵研究的一些典型的方法，利用其中的基於統計的紋理分析法中的灰度共生矩陣以及灰度一梯度共生矩陣法，分析了衛星雲圖上五類區域的紋理特性；第二部分主要介紹了遙感圖像分類原理以及神經網路中的bp演算法，在對演算法原理進行深入理解的基礎上，把紋理特徵與神經網路進行組合，實現對衛星雲圖進行分類分析；第三部分內容是在前面圖像分類結果的基礎上，對序列圖像用相關匹配法進行運動分析，反演雲跡風風場。
  2. In this paper, we made an investigation into texture feature extraction and classification based on statistic method and its application in multi - spectral image classification. the research works of this paper have been done as follows : firstly, in order to overcome the weakness of gray level co - occurrence matrix ( glcm ), a new unsupervised texture segment algorithm, based on multi - resolution model, is presented in this thesis

    本文主要研究了基於紋理統計特性的特徵提取與分割方法，並將其用於實際的多光譜圖像分類，具體工作如下:第一，針對傳統灰度共現陣方法中特徵提取的尺度單一問題，本文提出了一種多分辨無監督紋理分割演算法。
  3. The thesis consists of six chapters. content is dispatched as follows : chapter 1 introduces simply the network management. chapter 2 interprets the traditional network management, such as osi management, tmn management and internet management. chapter 3 describes the topology discovery. including the algorithm and the implementing mechanism. chapter 4 is the main chapter and will present the design of the integrated object model ( iom ). chapter 5 integrates snmp to iom as an application ; chapter 6, namely the last chapter, summarizes the whole thesis and prospects the future study

    內容安排：第一章對網路管理作了簡單的介紹；第二章介紹了傳統網路管理， osi管理， tmn管理和internet管理；第三章描述了拓撲發現的演算法及具體實現機制；第四章是本文的重點，對網管模型- iom -作了具體的設計；第五章針對snmp作了集成的應用；最後一章對全文所做的工作做一個總結，並提出了進一步的展望。
  4. The third part analyses several theories on interest weighing include the theories of restraint and application of jiatengyilang, the quantitative calmatives method of alexi, the layered stricture theory of liangshangshang and comprehensive weighing theory of li na. the author puts forward 4 rules in the process of weight : 1. protection of justice interest. 2

    第三部分分別對有關利益衡量規則的幾種學說進行了評述，包括加藤一郎的節制和適用說，阿列克西的定量計演算法，樑上上的層次結構理論和李娜的綜合平衡理論。在評述的基礎上，筆者提出了利益衡量適用過程中應遵循的四個規則: 1 、保護正當利益。
  5. This article canvass the status quo of the archive ' s automatization administration and the develop status of data mining, and discusses how to combine the data mining technology with the archive work from data cleaning means, data mining arithmetic, and data storage etc. and this article put forword a data mining syst em design idea. this article ' s structure is : first, in allusion to the archive data status quo, the pretreatment work of archive data that include data quality evaluation, data cleaning and data commut - ation process is bringed forword ; second, in the process of realizating data mining, the article discusses conception description, association rule, class three familiar means of applicating data mining, also put inforword the concrete arithmetic and the program design chart, and discusses the range and the foreground of all kinds of arithmetic when they are applicated in the archive ; third, the base of so you say, this article also discusses the importance of the archice applicate data storage and the means of realizing it ; last, the article discusses seval important problem of realizing an archive data mining system from data, diversity, arithmetic multiformity, mining result variety and the data pretreatment visibility, mining object descriptive visibility, mining process visibility, mining result visibil ity, user demand description and problem defining etc aspect. the article ' s core is how to import data mining technology in the archive work

    本文評述了檔案自動化管理現狀和數據挖掘技術的發展狀況，從數據清洗方法、數據挖掘演算法、數據倉庫的建立等方面論述了如何將數據挖掘技術與檔案工作相結合的具體思路，並提出了一個數據挖掘系統的設計思想。文章首先，針對檔案數據的現狀，提出了應對檔案數據進行預處理工作，包括數據質量評估、數據清理、數據變換和歸約等過程；其次，在具體實現數據挖掘過程中，本文結合檔案數據的特點探討了概念描述、關聯規則、分類等三種常見挖掘形式的實現方法，提出了具體的實現演算法和程序設計框圖，並論述了各種演算法在檔案工作中的應用范圍及前景；第三，在上述基礎上，又論述數據倉庫在檔案數據挖掘中的重要性並提出了實現一個檔案數據倉庫的方法；最後，從處理數據的多樣性、演算法的多樣性、挖掘結果的多樣性、數據預處理可視化、挖掘對象描述的可視化、挖掘過程可視化、結果顯示可視化、用戶需求的描述及問題定義等幾方面討論了實現一個檔案數據挖掘系統的幾個重點問題。全文以探討如何將數據挖掘技術引入到具體的檔案工作實踐中為核心。
  6. In chapter 4, the total construction and design thought of establishing apmp business platform has been introduced, which including the product ' s unified code, bargain process, bid platform, and some other techniques and services

    在第四章中，介紹了汽摩配行業商務平臺的總體結構和設計思路，並著重介紹其中的產品統一編碼演算法，交易流程，招投標平臺，協同采購中心以及其他的一些技術和服務。
  7. In the preprocessing stage the method of user and session identification often adopt heuristic algorithm for the being of cache and agent. this induce the uncertainty of data resource. the cppc algorithm avoid the limitation and has no use for complicated hash data structure. in this algorithm, by constructing a userld - url revelant matrix similar customer groups are discovered by measuring similarity between column vectors and relevant web pages are obtained by measuring similarity between row vectors ; frequent access paths can also be discovered by further processing of the latter. experiments show the effectiveness of the algorithm. in the fourth part, this thesis bring some key techniques of data mining into web usage mining, combine the characteristic of relation database design and implement a web usage mining system wlgms with function of visible. lt can provide the user with decision support, and has good practicability

    本文演算法避免了這個缺陷，且不需要復雜的hash數據結構，通過構造一個userid - uel關聯矩陣，對列向量進行相似性分析得到相似客戶群體，對行向量進行相似性度量獲得相關web頁面，對後者再進一步處理得到頻繁訪問路徑。實驗結果表明了演算法的有效性。第四是本文將傳統數據挖掘過程中的各種關鍵技術，引入到對web使用信息的挖掘活動中，結合關系數據庫的特點設計並實現了一個具有可廣西人學頎士學位論義視化功能的web使用挖掘系統wlgms 。
  8. It can dynamically determine the structure information need to index according to real query loads and opti mization of index. second, to consider the effects of structural information on result relevance ranking, this dissertation proposes a ranking algorithm that consider both the frequency distribution and structural distribution of keywords in the result, and a dynamic element - oriented method to compute the weight of keywords

    第二，為考慮xml數據中的結構信息對查詢結果相關度值的影響，本文提出了一種綜合考慮關鍵字頻率分佈特徵和結構分佈特徵的查詢結果相關度演算法，以及一種基於節點的關鍵字權重計演算法，取得了更優的檢索性能。
  9. In chapter iv, a new method of eyes location is provided. it detects the edg of human face image with wavelet transform in the first. then it begins to statistic the gray value of the row and list

    本文第四章提出了一種基於簡單背景的人眼定位演算法，用小波變換對人臉圖像進行邊緣檢測，對得到的結果進行行列統計，得到人臉的大致位置，再用模板匹配進行最後的精確定位。
  10. Generally, the skew bridge ' s calculation theories can be divided into three types : the category 1 is the plank theories method, such as the finite difference method, the finite element method and the finite strip method, etc ; the category 2 is the beam theories, such as the grid beam theories, the general grid theories, the rigid cross - beam method, the elastically - supported continuous beam method and the bar system analytical method, etc ; the category 3 is the practical method, such as the g - m revising method, the grid - beam simple method and ghali form coefficient method, etc

    目前關于斜梁橋的計算理論和方法概括起來，大致可以分為三類：第一類為板理論方法，如有限差分法、變分法、有限單元法、有限條法等；第二類為梁理論法，如格構梁理論、一般格構理論、剛性橫梁法、彈性支承連續法、桿件結構的分析方法；第三類為實用計演算法，荷載橫向分佈的計算方法如g ? m修正法、格構梁的簡易法、 ghali表格系數法等。
  11. The first algorithm gives unique result unaffected by the handling order of points concerned, and it calculates the control vertexes at once without estimation and correction

    第一種演算法的特點是重建結果不依賴于頂點的處理順序，不需要進行控制頂點的初估及修正，可使各控制頂點的計算一次完成。
  12. In section two, the theory of rayleigh waves is discussed and a matrix method for elastic wave problem - knopoff method is introduced

    第二部分討論了瑞雷波勘探原理，同時介紹了瑞雷波的一種矩陣計算方法? knopoff快速計演算法。
  13. In contrast to existing simplex method, this method has several peculiarities as follows : to begin with, applying it to solve linear programming problem. one need n ' t introduce any additional variable such as relaxing variable, artificial variable and other parameters, so that calculation is subtracted on a large scale. in addition to this, as a result of its higher degree of structuralization, this algorithm can be more easily transformed into program language and, of course, more quickly performed by computers

    與現有的單純形法相比，新演算法具有如下主要特徵：第一，求解過程不需要引進諸如松馳變量、人工變量等參變量參與運算，計算量大大減少了；第二，新演算法較單純形法的結構化程度高，更容易轉化為程序語言，進而在計算機上更快地得以實現；第三，新演算法在運算過程中不會引起攝動現象。
  14. Based on fourth - order cumulant, a computationally efficient method for joint estimating both directions of arrival and ranges of near field sources with known carrier frequency is firstly presented. the proposed algorithm need not any spectral peak searching and the 2 - d parameters are automatically paired. lt is suitable for arbitrary additive gaussian noise environment. in the following section, a 3 - d esprit method for jointly estimating of frequencies, doa ' s and ranges of multiple near - field sources with unknown carrier frequencies is proposed. the parameters estimation are given by the eigenvalues of different matrices. furthermore, its performances are confirmed by several computer simulations

    利用四階累積量，第五章首先給出了一種載頻已知的情況下基於近場源的距離和波達方向聯合估計演算法，通過構造的陣列輸出信號四階累量矩陣使空間信號到達方向和距離估計無需譜峰搜索，且參數自動配對，適合於任意高斯噪聲環境。進一步在第三節提出了一種載頻未知的情況下的多個近場窄帶信號源doa 、距離和頻率聯合估計的3 - desprit演算法。
  15. Railway applications - methods for calculation of stopping distances, slowing distances and immobilisation braking - part 1 : general algorithms

    鐵路設施.制動距離減速距離和定位制動的計算方法.第1部分:一般演算法
  16. The beginning point of the first research direction is that we design a type of load - balancing virtual topology which is insensitive to the traffic, such plan method has been proposed whose name is vlbs ( valiant load - balancing schemem ), the disadvantage of vlbs is that it can only be applied to the homogeneous network in which each node has the same capacity, in chapter2, a more general valiant load - balancing scheme ( gvlbs ) has been proposed, the advantage of the gvlbs is that it can be used both on the homogeneous network and heterogeous network, in this chapter, we will give the detail derivation process and numerical analysis. the beginning point of the second research direction is that we first design a virtual topology for the physical topology under a specific traffic matrix, for a while, the traffic has changed, the network performence will decline. under such condition, in chpater 3, a virtual topology reconfiguration algorithm is studied which can decrease the average weighted hops

    本文針對動態變化業務量情況下的wdm網路設計方法劃分為兩個主要的研究方向，第一個方向的研究出發點是可以在最初的虛拓撲設計過程中根據物理拓撲情況設計出一種虛拓撲出來，該虛拓撲是負載均衡的，在這種虛拓撲上跑的業務量矩陣特徵只要在某種范圍以內，無論它怎樣動態變化，網路都不會出現擁塞，但這種虛拓撲設計演算法vlbs的一個缺陷是它只能適用於同構網路，即每個節點所擁有的容量大小都相等，在第二章中，本文提出了一種更通用的負載均衡的光網路虛拓撲設計演算法gvlbs ，該演算法與傳統的負載均衡演算法vlbs不同之處在於vlbs演算法只能適用於同構網路而gvlbs演算法既可以適用於同構網路，又可以適用於異構網路，在本章中將給出了gvlbs演算法的的詳細推導和數值分析。
  17. In the second part, the necessity of employing differential demodulation in rapid changing channel was explained, performance of multiple symbol detection of mdpsk and decision feed back multiple symbol detection were analyzed. then we present a new differential demodulation algorithm. the decision data is used to recover the carry phase. given the same observation intervals, this demodulation algorithm has almost the same performance, but the receiver is much more simplified

    第二章首先指出了通道參數變化劇烈的情況下，採用差分解調的必要性；分析了多碼元差分解調和數據判決反饋解調演算法的性能和抑制噪聲的能力；在此基礎上提出了一種新的差分解調方案：利用判決數據輔助進行載波恢復，即在判決數據的輔助下，採用fir （ finantimpounsrespouns ）結構對載波相位進行預測的一種演算法，精心設計了該演算法的實現結構。
  18. The first algorithm computes up + vq of koblitz curves. its complexity is n / 2 ( n is the extension degree ) addition of two points. the result is better than other algorithms we have known

    第一種演算法計算koblitz曲線上的up + vq ，其計算復雜度為n / 2 （ n為擴域次數）次橢圓曲線的加法，此演算法較目前所知的演算法為優。
  19. The problem of joint estimating the frequencies and time - delay of multiple sinusoids received at two separated sensors is considered. the frequencies are firstly estimated using a state - space realization approach. the tune - delay is then found using a direct - form esprit - like method. finally, the performance of the proposed algorithm is demonstrated via computer simulations using sinusoidals as well as real speech data

    6 .在第七章提出了一種基於狀態空間實現的頻率、時延聯合估計演算法，正弦波的頻率首先用狀態過渡矩陣的特徵值估計得到，然後時延由估計的頻率和觀測矩陣直接給出。
  20. The design methods and algorithms applied in computer aided road design system are presented in chapter 3 : draw - out algorithm of contour line, plane - design methods etc. we put highlight on the plane - design method and our improvement on this aspect

    第三章介紹計算機輔助道路設計系統中所採用的一系列演算法，主要包括等高線抽取演算法，選線定線演算法，平面線形設計演算法等等，其中重點介紹平面線形設計演算法以及本文對現有演算法所作的改進。
分享友人
分享到 Line

分享到臉書