稀疏化法 的英文怎麼說
中文拼音 [xīshūhuàfǎ]
稀疏化法
英文
rarefaction method-
In the previous direct simulation monte carlo ( dsmc ) method used in the dilute gas - solid flow, particle collision probability was calculated by the equation used for rarefied gas molecules. and gas phase was simulated by the laminar navier - stokes equations
已有的應用直接模擬蒙特卡羅（ dsmc ）方法模擬流化床內稀疏氣固兩相流動的研究中，均採用稀薄氣體分子碰撞概率的計算方法計算氣固兩相流中顆粒的碰撞概率，採用層流navier - stokes方程模擬氣相流動。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上就能解較大規模的凸二次規劃On the other hand, in the approach based on vector - matrix, through several special operations on vector - matrix, we have constructed a sparse ‘ 0 ’, ‘ 1 ’ parity - check matrix with dual diagonal matrix whose structure can easily construct the code. the simulation results have demonstrated the performance of this approach is similar to that of - rotation while the complexity is also higher. this problem is to be solved in the future research
在基於矢量矩陣的結構化方法中，通過對矢量矩陣進行一系列特殊處理可以構造出稀疏的『 0 』 、 『 1 』校驗矩陣，而校驗矩陣中的雙對角結構易於構造出相應的ldpc碼字，模擬表明，採用矢量矩陣的結構化方法具有和-旋轉構造法相當的性能，但是實現的復雜度大於-旋轉構造法，同時碼率和碼長受到一定的限制，這也是未來需要研究的方向。Different from other rank reduction methods, such as pca ( principal component analysis ) and vq ( vector quantization ), nmf ( nonnegative matrix factorization ) can get nonnegative, sparse basis vectors which make possible of the concept of a parts - based representation
與pca （主分量分析）和vq （矢量量化）等降維演算法不同， nmf （非負矩陣分解）演算法能夠分解出非負的，稀疏的特徵矩陣和編碼矩陣，能夠提取原始數據向量的局部特徵，使基於局部特徵進行分類的聚類演算法更容易實現。One is based on the discriminated matrics, the other is based on ga. we use many new ways to make the algorithms more effective, such as reducing dimension and sparsiting elements of the discriminated matrics, effectively selecting elements of the positive examples set and the counter examples set for the jointing - spreading matrics, using a new selecting operator, and so on
其次，實現了基於粗集理論的屬性約簡方法? ?基於可分辨矩陣的屬性約簡法和基於遺傳演算法的屬性約簡法，並通過降維、稀疏化、正例集和反例集的有效選取、新的選擇運算元等方法對原演算法進行了改進。Qga combining the genetic algorithm and the quantum information theory has a large search space with small population and a good global search capability, while image sparse decomposition based on mp is an optimal problem, so it can be fast solved by qga
量子遺傳演算法能用較小的種群規模實現較大的空間搜索，全局尋優能力強，基於匹配追蹤的圖像稀疏分解是最優化問題，因此可用量子遺傳演算法快速實現。In the development of neural network ? s architectures, a sparse coding is put forward
在結構設計中，提出了稀疏化的編碼方法。On the other hand, adaptive method can save running time of iterations by increasing the sparsity of markov hyperlink matrix
另一方面， adaptive方法通過將馬爾可夫超鏈接矩陣稀疏化以達到節省迭代時間的目的。This paper studies the least redundant solutions of two - dimensional array system by using the simulated annealing algorithm. two ideal thinning solutions for the two - dimensional circle array were discussed intensively in this paper. one solution uses half - circle configuration with very much reduced number of elements and taking an image by rotating the array ; the other selects element positions around the full circle to provide a roughly uniform coverage in the spatial frequency domain
在一維天線陣設計的基礎上，本文利用模擬退火演算法給出了兩種最小冗餘二維圓環天線陣的結構設計方案，一種方案利用天線旋轉，在半圓周內稀疏天線；另一種方案通過將空間頻率采樣點的均勻分佈作為優化的約束條件，在全圓周上使天線單元分佈達到最優。There are several problems in traditional systems from the current b2c website electronic commerce personalization recommendation system : data sparsity, the commodities which are purchased or rated by users only occupy the total commodity number about 1 % ; new project problem, the new user and the new commodity which doesn ’ t be purchased or rated can ’ t be recommended ; solely recommend means, long data processing and low recommendation precision
本文通過對當前b2c網站的電子商務個性化推薦系統分析，發現傳統的推薦系統有如下問題:數據稀疏性問題，用戶購買或評分的只佔總商品數的1 %左右;新項目問題，對于未被購買或評分的新商品、新用戶一般不能進行推薦;推薦方法單一、數據處理耗時過長以及推薦精度不高的問題。4 ) a sparse matrix based on multi - resolution analysis for signal decomposition was introduced. a compression method for arbitrarily long data on chemical process was developed then. the relative error of decompression data is still acceptably small enough and the compression ratio is large enough when the method was applied to the compression decompression manipulation of historical data on chemical process
浙江大學博士學位論文4 ）利用小波的多解析度分析特點，推出了一個用於信號多解析度分解的稀疏矩陣，在此基礎上給出了一種可對任意長度數據進行壓縮的方法，並對化工過程的歷史數據進行數據壓縮和還原，壓縮后的解壓縮數據仍保持較小的相對誤差，並得到了較大的壓縮比。Based on the two - way cross list for storing sparse block matrices fast algorithm between block matrices and bandwidth optimization based on node reorder in sparse block matrices were conducted to reduce calculation complexity and memory capacity of the finite element analysis
摘要在稀疏分塊矩陣的雙向正交鏈表存儲結構的基礎上，採用矩陣間的快速演算法和基於稀疏分塊矩陣的帶寬優化技術，減少了結構有限元分析的計算量和存儲容量。Two test problem generation algorithms, which generate large sparse random networks and rectangular grid road networks respectively, are proposed. using these two algorithms, different kinds of test problems to verify route planning algorithms for vehicle navigation arc generated
提出了兩種適臺檢驗用於車輛導航的路線優化演算法的測試問題生成演算法，這兩種演算法分別生成大型稀疏隨機網路和矩形網格狀路網。Based on work of w. clem karl etc., the quasi - newton iteration method for solving the optimization problem of sar imaging is derived, the sparse projection matrix tsof sar imaging is constructed, by replacing the original sar imaging projection matrix t with ts, the computation efficiency of peak - enhanced sar imaging is improved greatly
在w . clemkarl等工作的基礎上，導出了求解峰值特徵增強sar成像優化問題的準牛頓迭代方法，建立了sar成像稀疏投影矩陣t _ s ，通過用t _ s代替原始sar成像投影矩陣了，有效提高了峰值特徵增強sar成像方法的計算效率。分享友人