隱函數解 的英文怎麼說

中文拼音 [yǐnhánshǔjiě]
隱函數解 英文
implicit solution
  • 隱 : Ⅰ動詞（隱瞞; 隱藏） hide; conceal Ⅱ形容詞1 （隱藏不露） hidden from view; concealed 2 （潛伏的; ...
  • 函 : 名詞1. [書面語] （匣; 封套） case; envelope 2. （信件） letter 3. （姓氏） a surname
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 解 : 解動詞（解送） send under guard
  • 函數 : [數學] function函數計算機 function computer; 函數計算器 function calculator; 函數運算 functional operation
  1. In algorithms, classification algorithms are divided into two cases : one for known statistical distribution model and the other for unknown statistical distribution model. four classification algorithms, the bata - prime statistic model fusing quadratic gamma classifier, based on sar image rcs reconstruction and space position mode, on the mixed double hint layers rbfn ( mdhrbfn ) model and on the self - adapt fuzzy rbfn ( afrbfn ) model, are derived. the problems, including how to further improving the class ratio of the bayes decision, decreasing the dependence on the statistical model and directly providing the adapted algorithm with samples, are solved

    提出了基於徑向基函數神經網路（ rbfn ）的雙隱層混合網路（ mdhrbfn ）模型，解決了標準神經網路在具體sar圖像地物分類中分類類別數目不夠和分類精度差的問題；提出了基於模糊推理系統的自適應模糊rbfn分類（ afrbfn ）模型，兼顧通用性與精確性，增強人機交互能力，進一步提高了演算法分類率。
  2. In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local

    本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。
  3. In this article, we give sufficient conditions for the existence of solutions to the vectorial hamilton - jacobi equations with dirichlet boundary condition : obtaining, in addition, an application to the theory of existence of minimizers for a class of non - convex variational problems

    本文給出了一類依賴于自變量和未知函數的梯度的向量情況隱式偏微分方程的dirichlet問題的弱解的存在性的充分條件，並將該結果應用到一類非擬凸變分問題中去。
  4. Second part, using approximation method and implicit function theorem, we obtain the existence of large amplitude 2 - periodic bouncing for damped linear impact osillator with mutiple impacts in one period

    在第二部分里，我們運用逼近框架與隱函數定理，對于帶小阻尼的線性碰撞振子，證明了在一周期內發生多次碰撞的大振幅2 -周期解的存在性。
  5. The algorithm have the good one - way property, high sensitivity to initial values and good security due to the intrinsic characteristic of chaotic system and rijndael algorithm. the simulation experiment demonstrates the convenience and good hash performance ; 3 ) a new scheme of digital voice secure communication was proposed based on chaotic modulation without additional synchronization. the modulation sequence generated by chaotic logical mapping was used to encrypt the digital voice signal

    混沌系統和rijndael演算法的固有特點使該演算法具有較好的安全性、對初值有高度的敏感性以及較好的單向性能，並且易於實現，是一種有效的單向hash函數； 3 ）研究了一種無需同步的基於混沌調制的數字語音保密通信系統的方案，利用邏輯映射產生混沌調制序列，以該序列作為密碼對數字語音進行加密處理，為了更好的隱匿信號特徵，混沌調制在小波分解的基礎上，對不同的通道使用不同的參數進行，並借鑒混沌掩蓋對信息信號進行了限幅處理，使密文完全隨機化。
  6. A permutated implicit enumeration for the linear 0 - 1 programming model is proposed according to the generic model in this thesis, which utilizes the relationship between the objective functions, permutes the constrained solutions so as to search the optimum solution in the aggregate of minimums and accelerate the convergence speed

    針對多機場的非實時流量管理的模型，提出了基於排序的隱枚舉法，它利用目標函數值大小的相對關系，對約束條件解進行排序，在最小解集中尋找最優解，以加快收斂速度。
  7. Normal bp algorithm can be used in many fields and resolved many practical problems, however, normal bp algorithm has many limitations such as it ' s easy to fall into the local minimum in the course of convergence, its " convergent speed is very slow, the method which set the structural parameter and the operational parameter has n ' t be widely accepted, and so on

    標準bp演算法應用甚廣，解決了許多的實際問題，但同時它也存在著諸如在收斂過程中容易陷入局部最小點、收斂速度很慢以及網路的結構參數（隱層數、隱層單元）和運算參數（步長、非線性函數的選擇）等都尚無公認的理論指導等問題。
  8. With the retrospect and critique of the existing firm theory, this paper analyses the possible faults of each school ' s theory, which includes the theory of smith, marx, new classical and neo - institution, and utilizes the historical data to analyze the relation between the firm ' s boundary and income, and classifies the direct and indirect income of the firm to establish a new function of the firm ' s boundary which can explain the changes of the firm scale and the effect of the perfecting institution diminishing the transaction cost and raising the efficiency of the society action

    論文首先對現有的企業理論進行了批判性的回顧，逐一分析各學派包括斯密、馬克思、新古典以及新制度學派的理論可能存在的不足和缺陷。在此基礎上，論文利用歷史數據分析企業邊界與企業收入之間的關系，區分顯性收入和隱性收入，建立新的企業規模函數。在證明新的企業規模函數的合理性的基礎上，論文利用這一函數解釋企業的變遷，說明制度的完善將降低交易費用，提高社會活動的效率，並且認為隨著制度的完善、個人目標和社會目標的趨同，共產主義社會並非是遙不可及的夢想。
  9. This paper studies 3 kinds of algorithms : the viterbi algorithm, multiresolutional algorithm based on wavelet transformation and bayesian bootstrap algorithm. the viterbi algorithm is based on the hidden markov model theory and it is a kind of map estimation, this paper studies this algorithm and puts up an algorithm that suits for filtering in the presence of interference. multiresolutional algorithm takes full advantage of multiresolutional data, we can see it has a better filtering ability than the traditional filtering methods ; bootstrap algorithm is a recursive bayesian estimation, it describes the probability density function by the samples, so it can be used to nonlinear non - gaussion filtering, the simulation result of the two groundings is presented

    Viterbi演算法以隱馬爾可夫理論為基礎，是一種最大后驗概率估計方法，本文對該演算法進行了研究，給出了一種適合於非高斯干擾條件下的濾波方法；多分辨分析方法充分利用到了多解析度測量數據所包含的信息，從模擬結果中可以看出，該方法的濾波精度要高於傳統的濾波演算法；自主濾波方法是一種遞推貝葉斯估計演算法，它利用采樣點來描述目標狀態的概率密度函數，因而適用於非線性、非高斯條件下的濾波，本文分別對這兩種情況下的濾波進行了模擬。
  10. An implicit equation with guaranteed differential properties is obtained by simple combinations of the primitives implicit representations using r - function theory. the surface corresponding to the zero - set of the implicit equation is efficiently and directly polygonized using the primitives parametric forms

    但是，要得到所構建物體的外表面，也就是相關隱函數的零集合，需要對隱函數進行顯示求解或使用一些面片生成演算法如marching cubes演算法。
  11. According to the theory of equivalent time, creep as a function of equivalent time is expressed. by fitting experimental data, parameters of creep in equivalent time field are obtained ; initial strain implicit solution of elastic creep equation in equivalent time field is derived

    根據等效時間理論，將徐變表示為等效時間的函數，通過擬合試驗數據，得出等效時間域彈性模量和徐變度公式的計算參數，推導了等效時間域的彈性徐變方程的初應變隱式解法。
  12. In this paper, a 3d finite element analysis software ( fzfx3d ) was compiled to simulate the construction process of mass concrete structures constructed with sequence method. based on the practical project xiluodu arch dam, the dam ' s construction process was simulated by a small time step size, 0. 5 or 1 days. the environmental temperature change, hydration heat rise, artificial cooling, creep, volume deformatio

    運用laplace變換方法將溫度的求解表示為只與空間坐標及澆築時間有關的函數，從而避免了用隱式差分法、有限元法求解時需求解聯立方程的因而對測點選擇的依賴，也避免了顯式差分法求解穩定性受時間步長，測點間距大小限制的缺點，因而具有測點布置靈活的特點。
  13. Numerical experiments with four test functions are performed, and some valuable conclusions are reached. first, the efficacy of full dominance - recessive diploid genetic algorithm outperforms the standard genetic algorithm ( sga ) in high - dimensional functions. the time complexity of the proposed ga approximates a polynomial multiple of that of sga

    通過對四個常用測試函數用完全顯隱性二倍體遺傳演算法和標準遺傳演算法進行初始解相同的對比試驗，表明完全顯隱性二倍體遺傳演算法在十維以上的高維函數優化問題中解的效果明顯優于標準遺傳演算法，對低維函數優化問題也不劣於標準遺傳演算法。
分享友人
分享到 Line

分享到臉書