new lower bound 中文意思是什麼
new lower bound
解釋
新下界-
For the non - preemptive version, we present a new lower bound 6 5 which improves the known lower bound 1. 161. for the preemptive version, we present an optimal semi - online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5 4 otherwise, while a lower bound 1. 0957 is also presented for general case
本文的主要結果為：對不可中斷的情況，我們給出了該問題的下界是6 5 ，從而改進了文獻中的給出的結果1 . 161 .對可中斷的情況，所謂工件加工允許中斷，即加工過程中允許機器暫停某工件的加工，而改為加工另一工件。 -
The conventional variable structure control technique for uncertain system requires that the uncertainty bound is known as a premise to assure robustness. the requirement creates an over - conservative controller and enlarges chattering. the proposed controller regards the influence of unknown disturbances and parameter uncertainties as an equivalent disturbance and generates an on - line estimation used in smc to cancel the slowly varying uncertainties by the mechanism of time delay. the reaching law approach is used to get the conditions and band of quasi - sliding mode. the new methodology offers a robust feedback control with much lower gains and reduces chattering without a prior knowledge of the uncertainty bounds or matched conditions
常規變結構控制用於不確定系統，須利用不確定性界確保系統的魯棒性，控制器過于保守且抖振變大.本文把未知干擾和參數不確定性的影響等效為名義系統的外界干擾，利用時延技術對干擾進行在線估計，並將估計值引入到變結構控制中，從而抵消掉系統中的慢變不確定性，利用離散趨近律法，推出了準滑動模態的存在條件及其帶寬.該方法克服了以往控制方法中須已知不確定性界的限制，且不必滿足匹配條件，用較低的控制增益保證了系統的魯棒性，降低了準滑動模態帶即削弱了抖振 -
Abstract : the conventional variable structure control technique for uncertain system requires that the uncertainty bound is known as a premise to assure robustness. the requirement creates an over - conservative controller and enlarges chattering. the proposed controller regards the influence of unknown disturbances and parameter uncertainties as an equivalent disturbance and generates an on - line estimation used in smc to cancel the slowly varying uncertainties by the mechanism of time delay. the reaching law approach is used to get the conditions and band of quasi - sliding mode. the new methodology offers a robust feedback control with much lower gains and reduces chattering without a prior knowledge of the uncertainty bounds or matched conditions
文摘:常規變結構控制用於不確定系統，須利用不確定性界確保系統的魯棒性，控制器過于保守且抖振變大.本文把未知干擾和參數不確定性的影響等效為名義系統的外界干擾，利用時延技術對干擾進行在線估計，並將估計值引入到變結構控制中，從而抵消掉系統中的慢變不確定性，利用離散趨近律法，推出了準滑動模態的存在條件及其帶寬.該方法克服了以往控制方法中須已知不確定性界的限制，且不必滿足匹配條件，用較低的控制增益保證了系統的魯棒性，降低了準滑動模態帶即削弱了抖振 -
Another new mv benchmarking lower bound is established, it can be acquired from the process data and diagonal interactor matrix
建立了另一最小方差基準下界，此新下界可通過過程數據和對角關聯矩陣得到。 -
The at 2 scale based on the internal area - time lower bound of the viterbi decoder is analyzed. and the at 2 scales of three vlsi realization algorithms ( m - step decoder algorithm, flow and block decoder algorithm, and sliding block decoder algorithm ) are deduced. in succession, a fully new algorithm named ring - vd algorithm designed by ourselves is put forward, and its at 2 scale is also fetched
分析並推導了viterbi譯碼器基於內部信息流的vlsi面-時下界at2尺度;推導了已有的三種viterbi譯碼器的vlsi高速實現演算法（ m步譯碼演算法、流水式塊譯碼演算法和滑動塊譯碼演算法）的at2尺度;提出了一種新的環形vd演算法，並推導了它的at2尺度;對四種viterbi譯碼器的vlsi高速實現演算法進行了比較分析。 -
By making algebraically equivalent transformation for the standard centering equation xs = e, we obtain a new system of perturbed k - k - t equations and, for specific power transformation, recover the newton equations that are recently used by j. m. peng et al to show a lower polynomial complexity bound for large - update algorithm
前述的兩種方法是針對擾動k一k一t系統進行的，而本文的另一種方法是採用ncp函數，直接將標準線性規劃k一k一t條件化為一個不含內點約束的等價方程組，以此改造標準攝動方程組。 -
Compare to existing results for general graph, new lower bound on the size of the minimum feedback vertex set of ( n, k ) - star graph is given based on its special structure
本文主要討論了關于組合星圖反饋結點集的下界問題，在基於組合星圖的性質和已有相關結果的基礎上，給出了組合星圖反饋結點集的新的下界。 -
A new method for doa estimation in certain nonstationary environments is presented in chapter 4. the maximum likelihood ( ml ) estimations of doa ' s of multiple rapidly moving sources is derived and the theoretical variance of angle estimation and the corresponding cramer - rao lower bound ( crlb ) are also given. its simulations show that this parametric technique is able to resolve closely spaced sources
提出了一種非平穩環境下的最大似然doa估計方法，該演算法適合於時變doa的情形，並分析了其參數估計性能，給出了角度估計的漸進方差的解析表達式，表明了常規的最大似然doa估計是本文的一特殊情形。 -
First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals
需加工n個工件人； … ；人，每個工件是在線到達（ oneb ， olle ）且可打斷的，機器人人的準備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應用背景。這里工件在線到達（ onebyone ）指的是工件的情況並不是提前知道的，只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。 -
We give the value of the code - length n and dimension k, and the lower bound of the minimal distances of the new linear code under some particular condition
在某些情況下，我們得到了該類線性碼的碼長n和維數k的取值以及最小距離d的下限。 -
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
摘要把利用相空間壓縮來控制混沌應用於經濟系統， ?針對經濟系統的特點引申出閾值控製法，即通過限制變量取值的上限或（和）下限來達到控制混沌的目的。 -
Second, combining with the construction principle of geometry - goppa codes, we present a kind of new algebraic - geometry code by using the properties of algebraic curves on finite fields. we determine the value of the code - length n and d imension k, and the lower bound of the minimal distances of the new algebraic - geometry code. the new algebraic - geometry code have the following characteristics : ( l ) the new code is the generalization of geometry - goppa codes and the algebraic - geometry code constructed by chaoping xing and san ling in 2000 ( 2 ) compared with brouwer ' table of the best known codes, we find more new codes, there are at least 60 new codes under two - dimension cases
其次，結合幾何goppa碼的構造原理，利用有限域上代數曲線的特點來構造代數幾何碼，確定了新的代數幾何碼的碼長n和維數k的取值，給出了最小距離d的下限，這類碼的特點是： （ 1 ）新的代數幾何碼是幾何goppa碼和新加坡國立大學chaopingxing和sanling在2000年所構造的代數幾何碼的推廣； （ 2 ）這類碼中有許多種碼的參數優于brouwer碼表，僅二維情形時，就有60多種碼優于brouwer碼表。
分享友人