upper and lower bounds 中文意思是什麼
upper and lower bounds
解釋
上界和下界-
For the decidable cases of arithmatical sentences, we give the upper and lower bounds of their computational complexity
對具可決定性的算術句型，我們並給出了其計算繁度的上界與下界。 -
To separate the lower and upper bounds of the range,
）將范圍的上下限分開， -
In this paper, we study the stopping sets, stopping distance and stopping redundancy for binary linear codes. stopping redundancy is a new concept proposed by schwartz and vardy recently for evaluating the performance of a linear code under iterative decoding over a binary erasure channel. since the exact value of stopping redundancy is difficult to obtain in general, good lower and upper bounds are important
近年來，迭代譯碼的性能分析是低密度校驗ldpc碼研究領域的熱點問題之一， di等人在2001年指出：迭代譯碼在二元刪除通道bec中的性能可以由ldpc碼的停止集stopping set完全刻畫。 -
Evading risk in financial trading market cries for pricing options to a nicety. asian option, as the most flourish options in the finace market, the pricing has been focused on always. the exact pricing formula for the geometric average asian option had existed, but as to the european - style arithmetic average asian option, due to the dependence structure between the prices of the underlying asset, no analytical formula exists. on the hypothesis that the market is frictionless and without transaction costs 、 on the base of b - s ’ s and in the binomial tree model, we provide several algorithms for computing an accurate value of the european - style arithmetic average asian option. following rogers and shi and by jensen ’ s inequality, many different upper and lower bounds are provided ; meanwhile a formula have got by the comonotonicity and approximating the distribution function. all of the algorithms are easy for programming. with the development of computer, more accurater price can be computed quickly. and numerical example proved that these algorithms are very accurate
對于幾何平均亞式期權它的定價相對簡單，已經給出了定價公式。對于算術平均亞式期權，它的未定權益具有軌道依賴特性，一直沒有得到它的定價方程的解析解形式。本文基於對市場是無摩擦且在沒有交易費用的情況下，在b - s模型下，利用二叉樹模型給出了算術平均亞式期權定價方法;並總結了利用jensen 』 s不等式給出的各種不同情況下的上下界;同時應用共單調性和近似分佈函數的方法也給出了算術平均亞式期權價格的近似公式。 -
In chapter two, concepts of integrity, integral set and integral number are introduced firstly, and then some relationships between the integrity and some other parameters of graphs are given, then the upper and lower bounds of the integrity are investigated on the basis of integral number determined. the final result is the upper and lower bounds of integral number if the integrity is known
第二部分主要討論了完整度與圖的其它參數之間的關系；給出了完整度給定條件下完整數的最大可能值及完整數給定條件下，完整度的最大最小可能值；給出了圖的完整度與此圖的刪點子圖的完整度之間的關系。 -
Upper and lower bounds of eigenvalues of uncertain closed - loop systems with second - order perturbation
不確定性閉環系統特徵上下界的二階攝動法 -
By using temporal redundancy, upper and lower bounds of process measurements are added in the modified sicc method to avoid the misidentification of gross errors
改進后的演算法利用時間冗餘性，加入對過程測量變量的上下限約束，避免了顯著誤差的誤判。 -
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碼。 -
At first, we introduce a class of generalized s - r - kkm type mapping in g - convex space, and establish generalized s - r - kkm type nonempty intersection theorem under the noncompact setting of g - convex space. as for application, some new minimax inequalities, saddle point theorem and existence theorem of maximal elements are proved in g - convex spaces ; second, by using the generalized r - kkm mapping and generalized r - kkm theorems in [ 13 ], some new existence theorem of maximal elements, existence theorem of equilibrium point for the abstract generalized vector equilibrium problem and existence theorem of solutions for equilibrium problem with lower and upper bounds are obtained in topological spaces
首先，我們在g -凸空間內引入了廣義s - r - kkm型映像，並在非緊設置下建立了一類新的廣義s - r - kkm型非空交定理，作為應用，證明了g -凸空間內一些新的極大極小不等式、鞍點定理和極大元存在定理；其次，利用文[ 13 ]中引入的廣義r - kkm映像和廣義r - kkm定理，在拓撲空間上得到了一些新的極大元存在定理、抽象廣義矢量平衡問題平衡點的存在定理和有上下界的平衡問題解的存在性定理。 -
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
建樹階段設置大小限制的修剪演算法是通過計算出不完整樹的最小代價得到優化樹的代價上限，根據此上限以及計算出的節點的實際代價來修剪節點的。在預測模型中應用了在建樹階段加入大小限制條件的修剪演算法。 -
Chapter 2 focuses on the discussion of vertex - neighbor - integrity of compound graphs. we give several upper and lower bounds of the vertex - neighbor - integrity of compound graphs in general condition. meanwhile, the vertex - neighbor - integrity of some special compound graphs such as path, cycle etc. are given
第二章集中討論復合圖的鄰域完整度，給出了一般情形下復合圖鄰域完整度的上下界，路狀，圈狀等特殊復合圖的鄰域完整度，還糾正了pinardundar的幾個錯誤。 -
Firstly, based on the classical theorem of limit analysis, the von mises yielding condition and finite element method technique, two common mathematical programs for the determination of the lower and upper bounds are built and solved by an iteration algorithm directly
首先，基於塑性極限載荷分析中的上下限定理和有限元離散技術，推導和給出了一般結構極限載荷上下限計算的數學規劃的普遍格式和相應的積分數值計算公式。 -
The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds, and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex, and uses backtracking method to obtain optimum solution
該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。 -
It is more difficult to work out the all generalized hamming weight for the code, at present, the generalized hamming weights are worked out with some codes in the most of works, or some lower and upper bounds are given with the generalized hamming weights
由於求一個碼的廣義hamming重量是一項比較難的工作，目前國內外只求出了某一類碼的全部廣義hamming重量，但大多數文獻只求出了某些碼的（前幾個）廣義hamming重量，或給出廣義hamming重量的一些上下界。 -
The authors discuss the statistical distributions of multiple - input multiple - output mimo channels over flat rayleigh fading via the order statistics analysis. simplified expressions are derived for expectations of the vector energies when the column or row number is equal to 1 and 2, which is followed by the upper and lower bounds when the antenna number at one side approaches infinite
以順序統計量分析rayleigh平坦衰落mimo通道矩陣各向量能量的分佈特徵，給出其各階矩公式以及列行數為1和2時行列向量的能量期望值的簡潔表達式，並由此推導出通道矩陣的單邊維數趨于無窮時行和列向量能量期望值的上下界。 -
The results of this paper extend the existed results of normal systems to descriptor systems. 8. lower and upper matrix bounds for the positive semidefinite solution of discrete - time riccati matrix equation are obtained
給出離散ricoati方程和統一的耦合代數ricoati方程的半正定解的上、下矩陣邊界估計，並得到求離散ricoat方程和統一的耦合代數ricoati方程的半正定解的兩個迭代演算法。 -
Taking all the interval number s in the equations as optimal design variables and representing the lower and th e upper bounds of each interval number as the boundary constrain of the variable respectively, the maximum and the minimum of various components of the solution are achieved by using the constrained optimization method
將方程組中的所有區間數都作為設計變量，區間量的變化區間作為相應的設計變量的邊界約束，運用約束優化法求出方程組解的各元素的最大值和最小值。 -
Results the upper and the lower bounds of compound systems are obtained
結果獲得了兩類混聯系統可靠度上下界的表達式。 -
The optimal control of uncertain piecewise linear systems is converted to the optimization of upper and lower bounds of the cost function
摘要將不確定分段線性系統的最優控制問題轉化成最優控制性能上界的優化問題。 -
Can specify the lower and upper bounds of that dimension
中的各個條目可指定該維度的下限和上限。
分享友人