upper and lower bound 中文意思是什麼
upper and lower bound
解釋
上下界-
4 ) an algorithm for reliability upper bound assessment of large - size network is presented, which is based on the principle of topological classification of node - set ; and the lower bound can be also obtained by dual graph of oriented network.
應用圖論的點集拓撲分類原理，提出一個計算大型復雜網路可靠度上界的類分法，並應用對偶理論求解網路可靠度的下界。 -
In this paper, we will more deeply research on the base of the works, the first part, we give the summarize for the condition and the significance. the second part, we give the preparation knowledge to the whole paper ; the third part, we research the lower and upper bound of the generalized hamming weights for the linear codes ; include d ( r, n, k ) bound, the finite sum representation of the lower and upper bound function of generalized hamming weights for linear codes, generalized griesmer bounds ; the 4 - th part, research the definition, the property of the r - th generalized weights for the non - linear codes and non - linear constant codes, and give the expression of the generalized weight of binary ( n, m, d ) non - linear codes ; the 5 - th part, research the weight hierarchy of linear codes and non - linear codes, for example, necessary condition and sufficient condition, the 6 - th part, we research the expression of the r - th generalized hamming weights of reseaval classes codes
本文在已有的基礎之上作了進一步的探討，第一章綜述了廣義hamming重量的現狀和意義；第二章給出了全文的預備知識；第三章研究了線性碼的廣義hamming重量的一些上下界；包括d （ r ， n ， k ）界，上下限函數有限和表達式，廣義griesmer界；第四章討論了非線性碼及非線性等重碼的廣義hamming重量的定義、性質，給出了2元（ n ， m ， d ）非線性碼的第r廣義hamming重量的表達式；第五章研究了線性碼、非線性碼的重量譜系；第六章給出了幾類碼的廣義hamming重量的表達式，這些碼包括直和碼（ directsumcodes ） 、笛卡爾積碼（ cartesianproductcodes ） 、張量積碼（ tensorproductcodes ） 、延長hamming碼。 -
In order to efficiently analyze the fault - tolerance of hypercube network and to propose a better fault - tolerant algorithms, the evaluation of an upper bound and a lower bound on the lip are given. a very significative conjecture on the bound of lip is obtained. besides, the
2 .為了更好的分析超立方體網路的容錯性，提出更為優越的容錯路由演算法，文章給出了超立方體網路中lip容錯模型的上下界估計，並給出一個非常有意義的猜想，而且結合程序結果對上下界及猜想進行了驗證。 -
With the method of integral within ordered product of operators, we obtain the analytical expression of quantum information counterpart of mutual information. the coherent information, as a function of input thermal state power and thermal noise channel power, we discuss the upper and lower bound for quantum gaussian channel introduced by holevo - werner and by quantum codes
用正規乘積內的算符積分技術求出了互信息的量子對應物? ?相干信息用輸入熱噪聲信號功率和通道熱噪聲功率表示的公式。討論了由holevo和werner引入的量子高斯通道量子容量的上界及由量子編碼所確定的下界。 -
We expand the eigenvalue of possion equation using wilson nonconforming element. by the formulation of the error expanition, we can not conclude whether it is a upper bound or a lowr bound. but we guess it is a lower bound, and by two numerical example, we find thatwe are right. we also extraplate the error expansion and enhance the accuracy of the eigenvalue from second order to third order
通過數值算例，計算方行與l行區域上的poisson方程的近似特徵值，並對數據進行分析，驗證了我們的推測是正確的，然後通過對誤差展開式外推，收斂階數可以從二階提高到三階，得到了高精度的解。 -
If this paper also studies the band percolation of the models of the triangle lattice and the hexagonal lattice when p = pc and p > pc. such as the estimation of power of, x and xf and their upper and lower bound
本文還研究了正三角形和正六邊形滲流在臨界點處（ p pc ）和上臨界狀態（屍屍的滲流。特別考慮關於0 ， x和冪指數的估計，並且給出了估計的上下界。 -
By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree, the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree
建樹階段設置大小限制的修剪演算法是通過計算出不完整樹的最小代價得到優化樹的代價上限，根據此上限以及計算出的節點的實際代價來修剪節點的。在預測模型中應用了在建樹階段加入大小限制條件的修剪演算法。 -
An index is potentially useful if its first column or prefix set of columns are used in the sarg, and the sarg establishes a lower bound, upper bound, or both, to limit the search
如果在sarg中使用索引的第一列或預先指定的一組列，且sarg指定了限制搜索范圍的下限、上限或同時執行了這兩者，則索引很可能是有用的。 -
My study involves two areas in quantum key distribution protocol. first, in the field of the b92 protocol, it is first calculated and analyzed for the holevo upper bound of b92 protocol to noise and eavesdropping, the fidelity, a lower bound on the guaranteed privacy and the capacity for classical information over phase flip channels. it is computed and validated for that projective measurements increase quantum entropy
本文主要涉及兩個方面:一、 b92量子密鑰分配協議方面，計算分析了b92協議對噪聲和竊聽的holevo上界，以及通過相位翻轉通道的通道保真度，通道可靠的保密性量子熵下界和對經典信息的容量，計算驗證了定理投影測量增加量子熵，分析了測量前後量子狀態的變化，並用計算機模擬繪制了圖形，能夠清楚直觀地分析比較。 -
The dynamic matrix control algorithms based on finite impulse response are studied. the model errors are defined in the form of upper and lower bound and the error square sum of impulse response coefficients of single - input / single - output systems. the robust stability conditions are proposed for closed - loop systems using dmc in the form of lmi, which can assure the closed - loop system using dmc algorithm to be asymptotically stable, when the coefficients of characteristic polynomial do n ' t satisfy jury ' s dominant coefficient lemma
浙江大學博士學位論文4 .研究了基於脈沖響應模型的動態矩陣預測控制田mc ）演算法，針對單輸入、單輸出系統可能出現的預測模型誤差，分別以脈沖響應系數上下界和脈沖響應系數誤差平方和的形式對預測模型的模型誤差進行定義，根據該定義以線性矩陣不等式的形式分別提出了閉環系統魯棒穩定判據，當閉環多項式系數不能滿足j切嘆主系數定理的情況下仍能保證系統閉環穩定。 -
Next, the lower and upper bound expressions are evaluated, insofar they are present ; defaults are zero and the sequence ' s length
下一步，在它們所出現的范圍內，對上下限表達式求值；預設值是零和序列長度。 -
For applying the hybrid optimization algorithm to solve the optimization problem with constraints, a self - adaptive penalty strategy for handling the constraints is designed, which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables
為了便於應用混合優化演算法對約束優化問題進行求解，設計了一種處理約束條件的自適應懲罰策略，用於將具有不等式約束和等式約束的優化問題轉變為僅包含決策變量上、下限約束的優化問題。 -
The other is a measure dimension estimate for graph - directed iterated function systems when they satisfy the double lipschitz condition and the sosc. we obtain the lower and upper bound estimate for the hausdorff dimension of a list of useful measures
其二是當圖迭代函數系統滿足雙lipschitz條件及強開集條件的情況下，我們得到了一類相應的圖吸引子上的測度維數的上下界的估計。 -
This paper revealed an optimized strategy to search for systolic array transformations for nested loops, when the upper and lower bound of inner index was affine functions of there outer loop indexes
對于多重循環中，當內層迭代的上下界為外層迭代的仿射函數時，介紹了搜索脈動變換的一個優化策略和相應的自動化演算法。 -
The method to control chaos by using uniform phase space compression is applied to economic systems in this paper, and a new stabilization method celled threshold stabilization method that suppresses chaos by adding upper hound or and lower bound to state variable is developed according to the characteristic of economic systems
摘要把利用相空間壓縮來控制混沌應用於經濟系統， ?針對經濟系統的特點引申出閾值控製法，即通過限制變量取值的上限或（和）下限來達到控制混沌的目的。 -
Under the condition of being given the present stock price, three quantitative indexes : probabilities that stock price first arrives at the given upper bound and lower bound, the expectation of the first arrival at the preceding bound are calculated precisely
在已知現在的股票價格情況下，通過求解微分方程，計算了股票價格到達給定的上、下限的概率和平均到達的時間。 -
You can specify the lower and upper bound of each dimension
可以指定每個維的上限和下限。
分享友人