algorithm limitation 中文意思是什麼

algorithm limitation 解釋
演算法局限性
  • algorithm : n. 【數學】演算法；規則系統；演段。
  • limitation : n. 1. 限制。2. 界限；極限；限度；局限性；限制因素。3. 【法律】（訴訟）時效，有效期限。
  1. Because of no limitation to task granularity, ppa is especially suitable for scheduling fine granularity tasks ( also suitable for coarse and medium tasks of course ), consequently helpful theoretically and practically for studying task schedule algorithm for rtdcs. according to the principle of fault - tolerant scheduling, combined with characteristics of tft in rtdcs, the paper puts forward the scheduling model of tft, corresponding implementation mechanism and the dynamic fault - tolerant scheduling algorithm ( namely ftpb ) and analyzes its complexity, with experimental data and contrast table compared with other analogic algorithm

    結合實時分佈系統中容錯任務的特點，根據容錯調度原理，給出了容錯任務的調度模型、實現機制及動態容錯調度演算法ftpb ，並對演算法進行了復雜哈爾濱工程大學博士學位論文; ; ; ; ;二; ; ; ;奮石石奮; ;性分析，給出了演算法實驗數據及與其它同類演算法的比較結果。
  2. Perfect pre - processing and post - processing function is one of the main factors to evaluate the vitality and market value of the finite element analysis system surveying today development of finite element analysis technology, most of which concentrate on establishing fine user interface, also has some limitation on application, and especially, the research on the visualization of arbitrary cut - plane is always in ascendants to realize the visual processing on cut - plane needs reprocessing the results of finite element analysis which have get, so the algorithm is two parts : seeking the physical value of cut - plane and drawing 2d contours, the former, based on the theory of stress on " arbitrary inclined plane " in physical mechanics, use the method of linear interpolation method to get the coordination and physical value of intersection between cut - plane and element arris ; the latter, based on the tables on elements, nodes, stress and strain, summarize a rapid algorithm of generating 2d contours based on the grid. this thesis synthesizes there two parts and get a visual processing program under fortran

    縱觀有限元分析技術的發展，目前大多集中在建立良好的用戶界面上的研究仍存在許多應用上的局限性，其中對任意剖面上可視化的研究仍處于方興未艾的階段。要實現任意剖面上可視化處理，必須先將得到的有限元計算結果進行再處理，因此在演算法上分為兩部分：求任意剖面上物理量值的演算法及二維等值線演算法。前一部分以彈性力學中「任意斜截面的應力」為理論基礎，利用線性插值方法得到截面與單元棱邊的交點坐標及交點物理量值；在此基礎上；根據已得到的單元及節點序號表、應力應變物理量表，總結出一種基於有限元剖分網格的快速生成二維等值線的演算法。
  3. A new fractal - based infrared image feature extraction method is presented and the detailed theoretic analysis and implement procedure of this algorithm is submitted and tested in some experiments. with the limitation of the line detection based on traditional hough transform that the information of the length and the end points of the line is unavailable, a new algorithm which makes use of the accessional strategy based on precognition information is put forward to meet the demand for more information of the line, simulation results show this method is effective. finally, the whole process of airport target recognition is presented and the result images are also given

    使用分形方法提取目標的特徵，在知識指導下，提出了一種基於目標特徵模型的降維的形態學分形維數計算方法，對傳統分形方法進行了改進，從理論上推證了演算法的合理性，並對演算法進行了模擬分析；針對傳統hough變換無法獲得線段端點和長度信息的局限性，提出了一種基於目標特徵先驗知識的hough變換融合策略，通過引入目標先驗知識，可以有效地獲得直線信息；對信息多而復雜的機場目標採用基於知識的目標識別方法，使用置信度模摘要型實現不確定推理，對目標進行識別判斷，將知識貫穿于整個識別過程中，對目標進行了有效地識別。
  4. 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 。
  5. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design. due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement. novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps. moreover, divide - and - conquer strategy and other simplified methods are adopted to minimize complexity. experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time

    文摘:以大規模混合模式布局問題為背景，提出了有效的初始詳細布局演算法.在大規模混合模式布局問題中，由於受到計算復雜性的限制，有效的初始布局演算法顯得非常重要.該演算法採用網路流方法來滿足行容量約束，採用線性布局策略解決單元重疊問題.同時，為解決大規模設計問題，整體上採用分治策略和簡化策略，有效地控制問題的規模，以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該演算法能夠取得比較好的效果，平均比paflo演算法有16的線長改善，而cpu計算時間只有少量增加
  6. Starting with analyzing the error of algorithm based on time - fraction and system model, the dissertation investigates the inherent limitation of traditional power system calculation methods

    本文首先從分析基於時間斷面和系統模型演算法的誤差入手，藉助于矩陣分析理論，研究了傳統電力系統計算方法中存在的誤差來源以及它們對計算結果的影響。
  7. 3. aiming at the limitation of simulated anneal genetic algorithm on a high computation while applied to flow shop scheduling problems, the paper presented selected simulated anneal genetic algorithm

    三、針對模擬退火遺傳演算法解決流水車間調度問題存在收斂速度慢的局限性，提出了選擇性退火的遺傳演算法。
  8. The main contributions of this dissertation are : a novel detection strategy in blind image watermarking algorithm generally, the traditional detection strategy corresponding to embedment model i = i + aw has its limitation. first, we treat the watermark information as noise for an image and expand the noise before detection. then, we find the corresponding data in the frequency - domain and adjust them according to our relative minmum principle

    為了解決這一問題，我們將嵌入水印圖像中的水印信息看作一種噪聲，在提取水印前，利用降噪方法得到原始圖像的一個逼近，通過和待檢測圖像的比較，得到含有水印信息的噪聲，再將這種噪聲信息進行放大，最後利用局部最大的編碼原則將水印恢復出來；將改進的水印提取模型應用於基於fourier - mellin變換的盲水印演算法，解決了由於插值和多變換造成誤差積累而造成很難提取水印這一問題。
  9. Fortunately, we can solve this problem by using ap ( alternating projection ) algorithm, by this way ; the computational load can reduce dramatically. doa estimation is mostly research base on linear array, because of the limitation of linear, it can estimate the azimuth only ; solid array can estimate the azimuth and elevation, in this paper, the solid array is used for doa estimation ; when the signal sources are uncorrelated, the music algorithm is chosen, using mdl / aic algorithm, we attain the signal number of sources

    本文採用立體六元陣進行測向，在非相干信號源條件下，採用music演算法進行doa估計，採用基於信息論原理mdl準則或者aic準則判斷信號源數目，通過對陣列流形的研究，指出基於圓陣的陣列流形具有的某種對稱性，利用該對稱性來降低運算量，並且通過對演算法的研究，提出用維數較小的信號子空間或噪聲子空間來計算空間譜，進一步減小music演算法運算量。
  10. At the beginning of this thesis, the principle of fiber fabry - perot strain sensor is presented briefly, and the influence on the results of the peak - to - peak algorithm, brought by the spectrum distribution of light source, wavelength quantification or the noise in the output of the fabry - perot sensor is investigated. the limitation of the peak - to - peak algorithm is pointed out

    論文首先闡述了光纖法珀應變傳感器的測量原理，分析了實際光源光譜的非均勻分佈、波長量化和傳感器輸出信號中的噪聲等對波長域的條紋峰值解調演算法的應變測量結果的影響，深入分析了條紋峰值解調演算法的局限性。
  11. In order to override the well - known limitation of back propagation algorithm, such as local grade problem, we suggest genetic algorithm, a global optimization algorithm, to optimize the weights set. the different parts of this model were modularized and combined as a prediction system

    通過對固定網路結構的權系值進行遺傳操作，優化網路的權系值組合，快速收斂到最優權系值組合，進而提高網路的分析預測效率和能力。
  12. For the first problem, we overcome the limitation of binary code algorithm based on threshold value, which is popular used now, we presented the binary code algorithm based on the statistical information of neighbour region

    對于輸入編碼問題，針對目前常用的基於閾值的二值法的局限性，我們提出了基於鄰域統計信息的峰值檢測演算法。
  13. Firstly, under the curvilinear coordinates, mathematical model for wave propagation in water of slowly topography is presented. the model is suitable to arbitrary boundary shapes and overcomes the limitation of other models with algorithm transformation

    首先，基於曲線坐標系，建立了緩變水深水域波浪傳播的數值模擬模型，模型適宜於任意變化的邊界形狀，克服了各種代數坐標變換的局限性。
  14. Traffic conditioner ' s key logic components is the meter and shaper, according to the analysis of the theory basis to realize ihe two logic components and the present algorithms limitation in detail, the thesis designs related algorithms to upswing the present algorithm

    通信量調節器的關鍵邏輯部件為計量器和整形器，論文中詳細分析了這兩種邏輯部件實現的理論基礎，並針對現有演算法的缺陷，設計了改進的實現演算法。
  15. By the algorithm we design a method to find a pixel - lined segment with some feature. if the segment is found, it is taken as template. but there is a limitation of stabilization in this method

    本文先提出了基於特徵象素點線段的匹配演算法，該演算法根據一定的策略，在相鄰照片中找到具有一定特徵的象素點線段，把這個特徵象素點線段作為匹配模板進行匹配。
  16. In clustering part, we modify k - means for overcoming its trend limitation, making its clustering result more equal and mostly reflecting the character of clustering. the modified algorithm can increase the classification accuracy

    聚類部分，改進了k - means演算法，克服了它的傾向缺陷，使它的結果分佈比較均勻，更能體現一個聚簇的規律，提高了分類精度。
  17. Using this algorithm, we can get precise results of regular moments and moment invariants for arbitrary binary images. this aspect breaks through the limitation of delta method, which suits only horizontal convex binary images

    該方法可對任意二值圖像的規則矩和矩不變量進行精確計算，突破了delta方法僅適合於二值水平連續圖像的限制。
  18. The traditional beam propagation algorithm based on fast fourier transform fails to give right results due to the limitation of the sampling theorem

    由於取樣定理的限制，常規的基於快速傅里葉變換（ fft ）光束傳輸模擬演算法不能進行任意焦距聚焦光束的傳輸過程的模擬。
  19. Then analyses the security and speed performance of md5, which is a representative one - way hash algorithm. points out its limitation and puts forward improved schemes. finally, analyses, designs and realizes the authentication mechanism of electronic commerce with improved md5

    之後介紹了在認證中要使用的單向哈希演算法，描述了其作用及設計準則，並重點討論了代表性的演算法md5 ，分析了其安全和速度性能，並針對其缺陷提出了自己的改進意見。
  20. Combined with the adaptive modulation and coding technology, this algorithm reallocates the residual power by effectively utilizing the discrete modulation orders according to the different priorities of sub - channels under the limitation of quality of service over the block fading channel

    在滿足服務質量要求的前提下充分利用星座圖尺寸的離散性，將殘余功率按照各子通道的不同優先級進行二次分配，並結合自適應調制編碼技術改善低信噪比時的系統吞吐量。
分享友人
分享到 Line

分享到臉書