整数

A technique based on lifting scheme is presented to construct the compactly supported wavelets whose coefficients are composed of a free variable. When t=1, the integer wavelets based on lifting scheme only use integral addition and shift, so it's fast and easily realized via hardware.

在理论上，基于提升理论构造了一种包含自由变量t的紧支撑小波，选取参数t=1的9/7整数小波基，只需要整数加法和移位实现，运算量低，便于硬件实现。

The method includes steps: each point in sequence x with length L, i=0, 1, 2,apostrophe L-1 is served as a independent variable of k order polynomial; changing coefficient of polynomial to generate multiple sequence f with length L, where k is nonnegative integer; operation in polynomial is carried out in Galois Field GF, where Q=pm, p as a prime number, and m as nonnegative integer; assigning generated sequences to multiple sectors to set of create biased sequences for each sector; it is different in constant terms of polynomial, and identical to other coefficients of coefficients corresponding to sequence assigned to same sector; creating corresponding time - frequency pattern unit from biased sequences of the sector; repeating TFP unit with equal interval in frequency domain so as to obtain integrated TFP.

本发明涉及一种时频资源的分配方法，所述方法包括：把一个长度为L的序列{x，i＝0，1，2，…L-1}中的每一点作为一个k次多项式的自变量，改变多项式的系数生成多个长度为L的序列{f}，其中k是非负整数，多项式中的运算在伽罗华域GF中进行，其中Q＝p m ，p是一个素数，m是非负整数；把生成的序列分配给多个小区，生成各小区的偏置序列集合，其中分配给同一个小区的序列所对应的生成多项式的常数项不同，其他项的系数都相同；由所述小区的偏置序列生成对应的时频图案单元，将时频图案单元经过频域等间隔重复，得到完整的时频图案。

Theorem 2.1.2 Let F be a family of holomorphic functions in a domain D , k (≥2) and p be positive integers, and let K be a positive number.

定理2.1.2设F为区域D内的一个全纯函数族，k (≥2)是一正整数，p是一正整数， K为一正数。

The inter-burst intervals of the stochastic bursting exhibited multi-mode and were approximately integer multiples of a basic IBI, similar to those of the ISIs of the integer multiple spiking caused by coherence resonance.

其簇簇间期(inter-burst intervals， IBIs)呈现出与随机自共振引起的整数倍峰放电节律的峰峰间期类似的整数倍特征。

The ultimate goal in integer optimization study is to develop efficient implementable algorithms for solving problems with integer variables.

研究整数规划的主要任务就是要设计一些有效算法来解决各种涉及整数变量的实际问题。

During the investigation, the optimization of infinitesimal information granularity is first solved to determine the low bound of the minimal power, and then the optimization of integer bit is solved, resulting in a fast integer bit-loading algorithm.

首先对无限小信息粒度的最优化问题进行分析，确定最小功率的下界。在此基础上再对整数比特的最优化问题进行求解，由此得到了一种快速的整数比特加载算法。

As with a normal 32-bit integer, up to 4 bytes are required to hold the value however the high bit of the first 3 bytes are used as flags to determine whether the next byte is part of the integer.

对于一个正常的32-bit的整数，需要4个字节来存储，然而前3个字节的最高位是用于标识下一个字节是不是整数的一部分

It is very interesting that the conditional expectation of the integer ambiguity solution is just equal to the admissible integer estimator of this ambiguity vector.

非常有趣的是模糊度整数解的条件期望就是这个模糊度向量的可容许整数估值。

With the definition of discrete local minimal solution of an integer programming problem,this paper presents a neighbourhood search algorithm for finding a discrete local minimal solution of the problem.

首先，给出整数规划问题的离散局部极小解的定义，并设计找离散局部极小解的邻域搜索算法。其次，构造整数规划问题的填充函数算法。

The Integer Solutions Property: As long as all the supplies, demands, and arc capacities have integer values, any minimum-cost flow problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its flow quantities.

具有整数解的特征：只要其所有的供应、需求和弧的容量都是整数值，那么任何最小费用流问题的可行解就一定有所有流量都是整数的最优解

Chrysanthemum of 10 thousand birthday is lax to edaphic requirement, with the arenaceous qualitative loam with fecund, good drainage had better.

万寿菊对土壤要求不严，以肥沃。排水良好的砂质壤土为好。

He unstepped the mast and furled the sail and tied it.

他拔下桅杆，把帆卷起，系住。