As a result , the process of developing and modifying the reports would have to be lightweight , because the reporting requirements were going to be " discovered dynamically , " rather than specified up - front 因此，开发和修改报告的过程必须是轻量级的，因为报告要求是“动态发现”的，而不是预先指定的。
Columns must match the prefix set of index columns with the exact order . for example , the index create index emp name on employees " last name " asc , " first name " asc 在使用多列索引的情况下，为了使order - by或group - by处理特定索引， order - by或group - by列必须与预先指定的一组索引列匹配，而且顺序要完全相同。
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指定了限制搜索范围的下限、上限或同时执行了这两者，则索引很可能是有用的。
Finally , the effectiveness of the proposed method is verified through theoretical and numerical results for systems with both unknown time - invariant and time - varying parameters 理论分析与仿真结果表明，跟踪误差信号在一预先指定区间上收敛到零，在起始区间段上被囿于死区所确定的区域中；并保证闭环系统中所有信号是有界的。
A small , usually rectangular board , used as a game of chance , that contains many holes each filled with a folded slip of paper that when punched out indicates a designated prize , win , or loss 抽彩盘一种用作赌具盘的通常呈长方形的小盘子，同分布有许多小孔，每个小孔中放有折叠在一起的纸条，纸条被抽出后表明预先指定的价钱、胜利或失败
The linear matrix inequality ( lmi ) approach is developed to design the state observer and linear dynamic output feedback controller such that , for all admissible uncertainties as well as actuator failures occurring among a prespecified subset of actuators , the closed - loop system is asymptotically stable 该控制器对于系统中任意容许的不确定性以及在每一个子系统中预先指定的执行器子集合执行器的失效，都可以镇定相应的闭环系统。
We found that if the coin is fair , you will be able to start from a very small capital , say ? > 0 , by means of legal trading , to obtain a very large profit , say a / < < x > , with a probability very close to 1 , say 1 - a . ve will call this situation an opportunity of essential arbitrage . we feel that it is unreasonable to consider such a financial market & perfect 我们发现如果硬币是公平的(均匀的) ，你就有可能“从任意小的初始资本0出发，经过合法的交易，以任意接近于1的概率(容许取极限，甚至可以达到概率1 )获得预先指定的(可以任意大的)目标盈利m ” ，我们把这种可能成为“可本性套利” 。
Motivated by this observation , this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories . two algorithms are developed based on best - first traversal paradigm , called bfp k nn and bft k nn , which handle the k nn retrieval with respect to the static query point and the moving query trajectory , respectively . both algorithms minimize the number of node access , that is , they perform a single access only to those qualifying nodes that may contain the final result 例如，若已知动物的轨迹，则动物学家可能提出如下两种查询： i在时间区间ti , tj内找到离一个给定的静态点譬如食物源实验室等最近的k条动物轨迹ii在时间区间ti , tj内找到离一条预先指定的动物轨迹最近的k条动物轨迹。
By making use of two kinds of exponential sums and cohen ' s sieve , we better the lower bound concerning the number of primitive elements and also prove the existence of primitive polynomials with a1 , a2 prescribed when n = 5 , 6 . in the remaining of the paper we study primitive elements in the form of a + a - 1 over finite fields . a counting formula is given as a result , as well as all the finite fields that do not have such elements 本文对n = 5 ， 6两种情形，利用有限域上的两类特征和估计及cohen筛法[ 5 ] [ 7 ] ，改进了[ 10 ] [ 11 ]中关于方程组本原元解个数的下界，并得到在特征为奇的有限域上存在可预先指定前两项系数的n次本原多项式。
Nc machining requires " interpolation " algorithms that accurately and efficiently generate sequences of reference position , distributed according to a prescribed feedrate function , along the tool paths . this paper present a systematic derivation of the proper taylor series coefficients for variable feedrate interpolators . when the path is ph curves , detailed formulations for instances are presented where the feedrate v is specified as a constant , the function of the time t , the arc length s and the local curvature k 对于nc加工要求插值算法沿着刀具路径准确、有效的生成参考点序列(根据预先指定的速率函数进行分布)的实际工程需要，本文系统地推导了变速率插值算子的泰勒系数，给出了当路径为ph曲线，速率v为常数，及时间t 、弧长s 、曲率k的函数时具体的插值算子。
