polynomial solution 中文意思是什麼
polynomial solution
解釋
多項式解- polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
- solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
-
Firstly, in spherical coordinate system, the sovp formulation for the time - harmonic electromagnetic fields of the current dipole in conductive infinite - space is derived, using reciprocity theorem and transforming relations between special functions. then, selecting appropriate coordinate system, using superposition principle, the boundary - value problem of modified magnetic vector potential on the problem of a time - harmonic current dipole in spherical conductor is solved and analytical solution is obtained. finally, by means of the addition formulas of legendre polynomial and spherical harmonics function of degree n and order 1, the analytical solution in spherical coordinate system specially located is transformed into that in spherical coordinate system arbitrarily located
首先利用特殊函數間的轉化關系和互易定理推導得到了無限大導體空間中球坐標下時諧電流元電磁場的二階矢量位形式：然後利用疊加原理，選擇合適坐標系，求解了導體球中時諧電流元的修正磁矢量位邊值問題，得到了問題的解析解；最後依據不同坐標系下電磁場解的轉化原理，藉助勒讓德多項式和n次1階球諧函數的加法公式，將坐標系特殊安放時的電磁場解析解變換到坐標系一般安放時的解析解，給出了球內電場和球外磁場的並矢格林函數。 -
The addition formula of spherical harmonics function of degree n and order 1 is derived using the relations between coordinate varieties after coordinate rotating and the property of the associated legendre polynomial. the relations among the magnetic vector potential, the modified magnetic vector potential and the second - order vector potential ( sovp ) are shown going forward one by one. it is explained that the solutions of electromagnetic fields in different coordinate systems can be transformed and an example having analytical solution is given
利用坐標旋轉后球坐標變量間的關系和連帶勒讓德多項式的性質推導得到了n次1階球諧函數的加法公式；以遞進的方式說明磁矢量位、修正磁矢量位與二階矢量位的關系，寫出了引入二階矢量位的過程；以時諧場矢量邊值問題為例，闡明了不同坐標系下電磁場解的相互轉化原理，給出了一個解析解的轉化例子；在球坐標下，引入了較球矢量波函數更普遍的兩類矢量函數，給出了其在球面上的正交關系。 -
In this paper, the judgement of existing solution to circulant linear equations set and the solutions under all kinds of circumstances are presented by polynomial matrix theory
摘要利用多項式矩陣理論，給出了循環線性方程組有解的判定並求出各種情況下的解。 -
In the first algorithm, a solution to transcendental equations is converted into a solution to roots of a monic polynomial, and the latter can be fulfilled easily by using functions roots or solve in matlab. in the second algorithm, taking advantage of the property that the distance between solves in a circular domain and the center of the circle is less than that of solves out
方法一：將對超越方程的求解轉化為對首一多項式的根的求解，然後利用matlab的roots或solve函數進行求解；方法二：利用圓形區域內超越方程的解與圓心的距離小於區域外的解與圓心的距離和fsolve函數求解方程時優先搜索離初值最近的解的特點，將圓心坐標值作為fsolve函數求解的初值，先求解出包含指定區域的圓形區域內的解，再從中找出指定區域內的解。 -
A set of nonlinear equations of precise synthesis are established for special case according to co - planarity and equal distance conditions. by resultant elimination, 3 polynomial equations containing 3 variables are obtained. all of the groups of real solution within a certain value range are generated with computer graphic method
針對實現兩個函數，每個函數四個精確點的rssr機構，通過結式消元法消元，得到三元高次多項式方程組，並採用計算機圖解法，在一定值范圍內解出了方程組的全部實數解。 -
Polynomial - time approximation schemes ( ptas ) : a ptas is a family of algorithm { a | > 0 } such that for any fixed > 0, a runs in time polynomial in the length of the input and gets a solution with an objective value which is at most 1 + e times of the optimum
若每次修正後，實例的目標函數值不超過原來的1 + o （ ）倍，我們稱修正費用不超過1 + o （ ） 。 ptas演算法：若演算法列{ a _ }對于問題的任一個例子都是1 +近似演算法，計算次數是問題大小的多項式（將視為常數） ，稱它為ptas演算法。 -
It reframes the traceback problem as a polynomial reconstruction problem, and uses techniques from algebraic coding theory to provide robust methods of transmission and restriction. the scheme is a new solution to the traceback problem during a dos attack ; the honeypot for ddos, which is a tool of traceback, lures the attacker to believe that he successfully compromised a slave for his needs, convincingly simulating the architecture of a potential ddos attack ; the source - based approach to ddos defense, which is a useful adjunt to traceback systems, deploys a ddos defense system at source - end networks. attacks are detected by monitoring two - way traffic flows, and the attacks originating from source networks are stopped by rate - limiting ; the routing mechanism based on pushback treats ddos attacks as a congestion - control problem
最後，就有關ddos攻擊反向追蹤問題，從四個方面對其解決方案進行了研究：在分析比較幾種反向追蹤演算法的基礎上，著重研究了代數方法編碼反向追蹤信息的方案，該方案把追蹤重構問題當作多項式重構問題，使用代數編碼理論技術提供魯棒的傳送和重構方法，是dos攻擊過程中的反向追蹤問題的一種新的解決方法； ddos陷阱作為反向追蹤的工具，引誘攻擊者相信自己成功與所需的傀儡主機通話，令人信服地模擬出潛在ddos攻擊體系結構；基於源的ddos防禦方法作為反向追蹤有用的補充，將防禦系統部署在源網路，通過監控雙向流量檢測攻擊和限制速率終止來自源的攻擊；基於向後倒推的防禦ddos的路由機制把ddos攻擊看作擁塞控制問題，添加功能到每個路由器來檢測並優先丟棄可能屬于攻擊的包，通過向後倒推上級路由器也得到通知而把這樣的包丟棄。 -
The oblivious polynomial evaluation protocol will be used many times in our privacy preserving naive bayesian classifier, so its efficiency is important to the solution
健忘多項式計算協議在保持隱私的樸素貝葉斯分類器協議中多次用到，因此協議的效率是一個需要關心的問題。 -
( 1 ) equation is deduced when input is complete correlation, frequency response function has not solution ( order of numerator of polynomial need not be defined ). we can directly use superposition principle of linear system to obtain response without solving frequency response function
（ 1 ）當輸入部分相關時，輸入矩陣為非對角矩陣，其頻響函數不能直接求得，本文推導了解決此類問題的公式。 -
Firstly, a weak formulation of this problem is derived. the existence, uniqueness and regularity of its solution are discussed. next, the mixed legendre - hermite polynomial approximation in non - isotropic sobolev space is proposed
首先，我們在第二章中討論無窮帶狀區域上熱傳導方程的弱形式及其解的存在性，唯一性和正則性，這種弱形式適合於數值計算。 -
Just like other optimization problems, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time
與其它的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索組合爆炸，在多項式時間內無法完成搜索。 -
Just like other optimization problem, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time
與其他的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間中尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索的組合爆炸，在多項式時間內無法完成搜索。 -
Abstract : this paper discusses the sensitivity problem of optimal statinary policy with discounted factor in continuous time markov dicision process. the author gives a solution by reducing it to a polynomial problem
文摘:討論了連續時間馬氏決策過程中最優平穩策略對折扣因子的靈敏度問題，並將之化為一個多項式問題來求解。 -
We propose a new algorithm for a sample and all nash equilibria by using heuristic search in game supports and the solution techniques of polynomial equation systems
摘要應用搜索博弈支持集和方程組求解技術，提出了一個計算單一和全部納什均衡點的啟發搜索方法。 -
The starting point for the solution is the taylor series of the 1 / x, and then by using a single private polynomial evaluation protocol we can get the solution
構造的思路是先將其轉化為相應的泰勒展開式，然後使用健忘多項式計算協議獲得結果。 -
To sidestep the deficiency of sampling way, we take a precondition on the initial polynomial system, and use the optimal solution of new system to approximate the optimal solution of initial system
針對矩陣montecarlo方法的特點，本文提出了對多項式系統的預處理，並用預處理之後最小m -齊次b zout數對應的分組來近似原方程組的最優分組。 -
The formula for mach number has been optimized with least - squres solution, thus the precision of a polynomial of power of 5 is better than that of 9. 2. after the solving of angle of attack and angle of sideslip, the theory of general inverse of matrix is used to simplify the nonlinear equations and to calculate the total pressure and the modified dynamic pressure ratio. these two parameters together with the angle of attack and angle of sideslip contain enough information to work out the dynamic pressure and static pressure
其中包括: 1 .應用最小二乘法，對馬赫數的泰勒求解公式進行優化，優化后的求解公式採用5次多項式即可在精度上優于原有的9次多項式，可以提高運算速度; 2 .提出應用廣義逆矩陣簡化非線性方程組:在已經求解出迎角與側滑角的前提下，直接從原始的壓力向量中提取出總壓，並且提出了動壓修正比的概念。
分享友人