preassigned
英
美
网络 预先指定的; 预先分派的; 预先分配的
双语例句
- If the sending endstation determines that the destination address is not local, the packet goes to a first-hop router, typically one that is close and has been preassigned to the sender.
如果发送端站确定目的地址不在本地，该包就被送到第一跳路由器，一般来说，该路由器是在附近的，并已被预先分配给发送者。 - In addition this paper constructs a matrix algorithm for computing bivariate diagonal vector valued rational interpolants with preassigned poles.
然后构造了在预给极点情况下求主对角线和副对角线上向量值有理插值的矩阵算法。 - Preassigned multiple access satellite system
预分多址联接卫星系统 - We design several different aperiodic photonic quantum-well ( APQW) structures to achieve the filter function in preassigned wave length range.
本文的主要内容是设计几个不同的非周期量子阱来达到预设波段的滤波器功能。 - At the date and time of the call, each participant dials the preassigned conference telephone numbers to establish the voice and data connections.
到了开会的日期和时间，每个与会者拨预先分配的会议电话号码，建立起声音和数据连接。 - By preassigned credibility and precision, effective estimate of sieving rate of connectivity sieve is achieved.
通过预先设定置信度和估计精度，可以获得连通性筛子筛选率的有效估计值。 - There are two groups of controllable ram air parachute, which can change the flying direction of the ram air parachute and realize retrieval at the preassigned location.
可控翼伞后缘有二组操纵绳，控制它可以改变翼伞飞行方向，实现定点回收。 - Nagata's conjecture concerns about the lower bound of the degree of a plane curve with preassigned singularities in general position.
Nagata猜想是关于满足特定条件的平面曲线的次数的下界的猜测，这些特定要求是指此类曲线过平面上给定的若干个一般点，并在相应点有给定的重数。 - Optimal quadrature formulae with preassigned multiplicities
指定结点重数的最优求积公式 - It adopted the pseudo-random proportional rule, renewed global pheromone after the tasks were executed, and renewed local pheromone before the tasks were preassigned to the grid resource.
该算法采用伪随机比例规则，不仅在网格计算资源完成任务后进行信息素的整体更新，还要求预分配网格计算资源时进行信息素的局部更新。 - Since the image units with the same density attributes to the direct ratio between gray scale value and preassigned adjusting accuracy.
调整结果的灰度均匀水平与预先指定的调整精度成正比。 - From the engineering point of view, a design method for single input optimal regulator with preassigned closed-loop pole by inverse problem approach has been derived.
给出了从逆问题指定闭环极点设计最优调节器的方法，试图从工程角度解决单输入线性定常系统最优调节器的极点配置问题。 - On Convergence of the Interpolation Sequence of Rational Functions with Preassigned Poles
给定极点的有理函数插值序列的收敛性 - Design of optimal regulator with preassigned closed-loop poles by inverse problem approach
从逆问题指定闭环极点设计最优调节器 - Under the condition of the preassigned desired steady-state covariance, the algorithm calculates the efficiency of various sensor combinations by solving the Riccati equation, and then chooses the combination which has the minimum value of objective function for allocation.
在预先给定稳态期望协方差的情形下，该算法通过求解Riccati方程计算出各种传感器组合的效能，并选择使目标函数值最小的传感器组合进行分配。 - At a level of fairy generality, it is identified that continuous ( or even smooth) controllers can be designed to drive the system states towards a preassigned sliding manifold.
在相当一般的假设条件下，我们指出了可以采用连续（乃至光滑）的控制方案，将系统的状态驱往给定的滑动流形上。 - The GMCF decreases monotonically as the number of hidden neurons increases and it would be zero if the number of hidden neurons is not less than the number of preassigned patterns.
并指出代价函数全局最小值随隐层神经元个数的增加而单调减小.当隐层神经元个数不小于样本个数时，网络的代价函数全局最小值将等于零。 - On the best approximation of functions in the e_p ( 1p ≤+ ∞) space by rational functions with preassigned poles
关于函数空间Ep（P1）中有理函数的最佳逼近（EplP≤+∞）中具有给定极点的有理函数最佳逼近问题 - On Best Approximation by Rational Functions with Preassigned Poles in Bergman Spaces
具有予先指定的极点的有理函数在Bergman空间中的最佳逼近 - Multi agents are linked into a group to achieve a common goal through formation. A cooperation model is built to carry out the allocation and standing-location cooperation for a preassigned task.
针对RoboCup中型组比赛提出的动态阵型选择算法建立了动态协作模型，将多个智能体组合成一个拥有共同目标的团队，完成给定的任务分配和站位配合。 - However, the virtual boundary element-equivalent collocation method has some shortcoming, such as the inappropriate collocation points on the boundaries affect the validity of result and the virtual loads at the preassigned isolated points on the virtual boundary maybe not complete.
然而等额配点法具有不恰当的配点影响计算结果和预先选定的孤立点上的虚载荷可能不完备的缺点。