linear time algorithm 中文意思是什麼

linear time algorithm 解釋
線性時間演算法
  • linear : adj. 1. 線的，直線的。2. 長度的。3. 【數學】一次的，線性的。4. 【動、植】線狀的；細長的。5. 由線條組成的，以線條為主的，強調線條的。
  • time : n 1 時，時間，時日，歲月。2 時候，時刻；期間；時節，季節；〈常pl 〉時期，年代，時代； 〈the time ...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. A novel dynamic evolutionary clustering algorithm ( deca ) is proposed in this paper to overcome the shortcomings of fuzzy modeling method based on general clustering algorithms that fuzzy rule number should be determined beforehand. deca searches for the optimal cluster number by using the improved genetic techniques to optimize string lengths of chromosomes ; at the same time, the convergence of clustering center parameters is expedited with the help of fuzzy c - means ( fcm ) algorithm. moreover, by introducing memory function and vaccine inoculation mechanism of immune system, at the same time, deca can converge to the optimal solution rapidly and stably. the proper fuzzy rule number and exact premise parameters are obtained simultaneously when using this efficient deca to identify fuzzy models. the effectiveness of the proposed fuzzy modeling method based on deca is demonstrated by simulation examples, and the accurate non - linear fuzzy models can be obtained when the method is applied to the thermal processes

    針對模糊聚類演算法不適應復雜環境的問題，提出了一種新的動態進化聚類演算法，克服了傳統模糊聚類建模演算法須事先確定規則數的缺陷.通過改進的遺傳策略來優化染色體長度，實現對聚類個數進行全局尋優;利用fcm演算法加快聚類中心參數的收斂;並引入免疫系統的記憶功能和疫苗接種機理，使演算法能快速穩定地收斂到最優解.利用這種高效的動態聚類演算法辨識模糊模型，可同時得到合適的模糊規則數和準確的前提參數，將其應用於控制過程可獲得高精度的非線性模糊模型
  2. 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計算時間只有少量增加
  3. In rsdm, binary patterns are replaced by real - valued patterns, accordingly avoiding the coding process ; the outer learning rule is replaced by regression rule, therefore the model has not only the ability of pattern recognition but the ability of function approximation. the prearrangement of the address array bases on the distribution of patterns. if the distribution of patterns is uniform. then the address array is prearranged randomly, otherwise predisposed with the theory of genetic algorithm and the pruneing measure so as to indicate the distribution of patterns and improve the network performance. non - linear function approximation, time - series prediction and handwritten numeral recognition show that the modified model is effective and feasible

    在rsdm中，以實值模式代替二值模式，避免了實值到二值的編碼過程：以回歸學習規則代替外積法，使該模型在具有識別能力的同時具有了對函數的逼近能力；地址矩陣的預置根據樣本的分佈採取不同方法，若樣本均勻分佈，則隨機預置，否則利用遺傳演算法的原理和消減措施來預置地址矩陣，使之反映樣本的分佈，改善網路的性能。
  4. The solution algorithm involves tracing the characteristic lines backwards in time from a upwind element of an interior point. two advanced mehtods, quasi - consistence and consistence hexahedral element method, for three - dimensional advective problem are developed. and comparison of these two methods with linear interpolating function method is implemented

    當re 400時，流動明顯地具有二維性； re 800時，流動具有一定程度的三維性，而且出現了次迴流區； re 1000時，流動則具有明顯的三維性。
  5. The result shows that the time complexity of algorithm is linear with the increment of transaction if the average length of transaction and frequent itemsets is invariable, but it is inefficient to the increament of item average length ( including transaction length and frequent itemset length )

    結果表明：在事務平均長度和頻繁數據項集一定條件下事務規模對演算法的時間復雜性影響是線性的；但演算法卻不能很好解決數據項長度（事務和頻繁數據項平均長度）增大對其性能的影響。
  6. Then, a linear - time partitioning algorithm based on a linear ordering of nodes in a circuit for parallel logic simulation is presented

    然後，提出一種在對電路中節點進行線性排序的基礎上的線性時間劃分演算法。
  7. The thesis detailedly discusses a kind of optimize method on genetic algorithm, and points out the advantage obout utilizing genetic algorithm to solve large - scale non - linear system. through the study on large - scale strip mine truck real - time dispatch system, proposes the optimize model of strip mine truck real - time dispatch system, and utilizes the characteristic of genetic algorithm, provides a method of using genetic algorithm to solve the optimize model, designs the genetic operators at the same time. by the program language of matlab, develops strip mine truck real - time dispatch system. the system has the advantage of simpless and perfect function, proposes powerful sustain for strip mine ' s production and decision - making

    本文詳細討論了遺傳演算法這種優化方法，指出了遺傳演算法在解決大型非線性系統優化問題時的優越性。通過對大型露天礦卡車調度系統的研究，建立了露天礦卡車實時調度系統的優化模型，並藉助于遺傳演算法自身的優點，給出了應用遺傳演算法解算該優化模型的編碼方法，設置了相應的遺傳運算元。並用matlab編程語言開發了露天礦卡車實時調度系統，該系統具有操作簡單和功能較完善等優點，為露天礦的生產決策提供了強大的支持。
  8. In the terms of interpolation, the image reconstructed from nearest interpolation or linear interpolation has good edge but serious noise ; reconstruction from 4 * 4cubic interpolation or three b - spline or three - order lagrange interpolations has better local character. 2 x 2cubic interpolations which has both better edge and local character is the ideal interpolation, the following is the basic principle during reconstruction : ( 1 ) the more width of interpolation, the more number of summation and the more order of interpolation polynomial, the higher of density resolution ; ( 2 ) the more of interpolation polynomial and width of interpolation, the more of reconstruction time simultaneously, aimed at eliminating the effects of noise contained in projection data, in this paper, author analysis cause and effects of common artifacts. importantly, discusses convolution back - projection reconstruction algorithm with a shift axis of rotation has been derived for correcting images that acquired with a divergence axis of rotation using the fan beam geometry with an angle - equaled detector

    在ct圖像重建時，選擇有限帶寬窗有較好的空間解析度，三角形窗有較好的密度解析度，選擇餘弦窗則使得空間解析度與密度解析度的折衷；從窗函數的頻譜角度來講，可以用於圖像重建的一個良好的卷積窗函數應該具備以下條件： （ ? ）小的3db帶寬b ，即最小的主瓣寬度； （ ? ）最小的旁瓣最大峰值a ； （ ? ）最大的旁瓣峰值衰減速度d ；就內插函數而言，臨近點內插與線性內插重建圖像噪聲大，但有較好的邊緣與細節； 4 4三次內插、三次b -樣條與四次拉格朗日多項式內插圖像平滑，局部特性較好。
  9. Thus, efci algorithm is improved and the oscillation is overcome validly. and further, a linear pid controller is designed to replace the nonlinear component in the standard efci algorithm, it makes flow control system more robust, at same time, controls the queue length to expected value, which is beneficial to decrease delay in queue

    為了進一步克服系統振蕩問題，提出採用一種線性的pid控制器來替換標準efci演算法中的非線性環節，增強了系統的魯棒性，並實現了隊列長度的定點控制，有效地減少了排隊延時。
  10. The microsoft time series algorithm uses a linear regression decision tree approach to analyze time - related data, such as monthly sales data or yearly profits

    Microsoft時序演算法使用線性回歸決策樹方法來分析與時間相關的數據，例如，月銷售額數據或年利潤。
  11. According to the numbers of segmentations, dts has multi scale feature and can reflect different trend similarity of time series under various analyzing frequency. 2 ) an enhanced algorithm, based on dual threshold value, and the conception of sub - series linear are proposed. relative point average error is used to measure the linear degree of sub series, which produced by bottom _ up algorithm

    對應時間序列線性分段數目的不同，序列趨勢距離具有基於時間的多尺度分析特性，可以有效反應不同分析頻率下時間序列的相似程度； 2 ）採用相對點平均殘差衡量bottom _ up演算法劃分的子序列線性度，提齣子序列線性度概念和一種雙誤差閥值改進演算法，大大提高了趨勢序列模型的準確性。
  12. In this dissertation, a kind of linear time invariant systems with unmodeled dynamics and nonlinear uncertainties are considered by using backstepping approach and variable structure control algorithm. also another kind of linear time varying systems are studied based on the same method

    本文主要利用backstepping方法與變結構控制方法，研究了有未建模動態及不確定非線性項的線性時不變系統，以及輸入通道帶有干擾的線性時變系統的控制器設計問題
  13. A linear - time algorithm to compute the reliability of 3 - tree networks

    網路全終端可靠度的線性時間演算法
  14. A linear - time algorithm for computing the value of hosoya index for trees is given

    對于hosoya指標本文給出了計算樹的hosoya指標值的一個線性時間演算法。
  15. Low density parity check ( ldpc ) codes are good error - correcting codes, which can approach shannon ' s capacity limit. due to the sparsity of its check matrix, ldpc codes can be decoded only with linear time complexity using iterative decoding algorithm. therefore, ldpc codes have become one of the most attractive fields in the channel coding community

    低密度校驗碼是一種逼近香農限的好碼，由於其校驗矩陣的稀疏特性，採用迭代譯碼演算法，它的譯碼僅具有線性時間復雜度，所以目前ldpc碼己成為通道編碼理論界的研究熱點之一。
  16. The improved parameterized matching algorithm has linear time and space complexity, fragment combining algorithm has 0 ( n2 ) time and space complexities ( n is the number of statements of the function which the fragment belongs to )

    分析表明：改進的參數化匹配演算法的復雜性同程序文件的行數成線性關系；碎片合併演算法的復雜性是o （ n ~ 2 ）的，其中n是碎片所在依賴單位的語句個數。
  17. An optimized linear - time component - labeling algorithm of image

    圖像中連通體的線性標定演算法的優化
  18. This part firstly studies the relation between spectral transmission of the optical system and the thickness of medium. then a linear search algorithm base on analysing of the shape of curve is discussed. the simulation results show that the fitting error and the computing time of the algorithm satisfy the practical measuring requirements

    本論文首先討論了光譜透過率與各向異性介質厚度之間的數學關系，然後在分析曲線形態基礎上進行全值匹配，模擬表明，該演算法可以實現曲線完全擬合，擬合時間均在1秒以內，完全符合實際測量要求。
  19. Furthermore, numerical algorithms used to solve the linear system are introduced. next, after briefly discussing several causes of the late - time instability of the tdie solvers, a novel viewpoint about the instability is proposed. the marching - on - in - time algorithm ( mot ) is described and some temporal bases are discussed

    其次，在簡要分析了引起時域積分方程（ tdie ）時間步進演算法求解的后時不穩定性問題的幾個原因后，指出引起時域積分方程時間步進演算法的后時不穩定性的主要原因是離散tdie時採用了不精確的數值計算方法和不恰當的近似。
  20. The algorithm is composed of two sections. in the first section the nodes in a circuit are arranged in linear time order to preserve simulation validity. in the second section, the nodes in order are divided into several sets whose root is primary input node and nodes in which can be reached by path ; then these sets are united by connectivity among sets into some larger sets, the number of which is equal to that of processors ; at last the sets are assigned to each processor by connectivity among sets

    該演算法主要分為兩個部分，第一部分是將電路中的節點按線性時間順序排序，這樣就保證了模擬過程的正確性；第二部分是將有序節點劃分到以不同原始輸入為根節點的子節點集中，並將這些子節點集按其連接量的大小合併為與處理器數目相等的子節點集合，最後將這些子節點集合按連接量分配到各個處理器上。
分享友人
分享到 Line

分享到臉書