查询词典 uniquely defined

First, the formal representation of the search environment is established, the multi-UAV is modeled as a controlled system and the predictive model of the system is presented. Considering the uncertainty of the sensor measurement and the environment, a Search Probability Map is defined and the updating method based on Bayes formula is presented. Based on SPM, information gain is defined to measure the search effects and used to be the optimization object in the predictive horizon. By using of GA, the solution of the optimization problem is got and it is taken as the input of the controlled system.

首先，建立搜索环境的规则描述，然后将多个UAV建模为一个控制系统，建立系统的预测模型，考虑到UAV传感器测量的不确定性和环境自身的不确定性，建立搜索概率图描述搜索环境的不确定性，给出了基于Bayes准则的搜索概率图更新方法，继而基于搜索概率图定义信息增益来衡量搜索效果，并将预测周期内的优化目标定为最大化信息增益，采用遗传算法进行求解，得到最优解作为被控系统的输入。

The composite nonsmooth optimization problem is defined as follows:〓where h is a convex function defined on〓and is bounded from below,and〓〓is a mapping from〓to〓and〓are twicecontinuously differentiable function on〓.

复合NDO问题被定义如下：〓这里h是一个定义在〓上的凸函数，并且有下界，〓，〓是一个从〓到〓上的映照。

The left and top corner of the path will be at the center of the bounding box defined by the left and top points as defined by Style .

路径的左侧和顶部角落将在由由风格定义的左侧和顶部点定义的边界框的中心。

After analyzing the structure of sentences,Tarski found that, it was impossible to define the truth of the calculus of classes directly,but making use of the structure character of sentential functions could give us the approach to escape the dilemma:Firstly,we could defined the concept of satisfaction in sentential functions by means of recursive method;Then,we could regard sentences as a peculiar form of sentential functions;Finally,with the help of the concept of satisfaction,we could defined successfully the truth of the calculus of classes.

通过分析语句的结构，塔斯基发现很难直接定义出类演算语言的真概念，而语句函项所具有的可递归形成的结构性质可以使我们得到脱离困境的办法：先采用递归方法针对语句函项定义出满足概念，然后把语句作为语句函项的特殊形式，借助于满足概念最终可以得到类演算语言的真概念定义。

By taking advantage of a corollary of the Desargues theorem and the corresponging extension of Desarguesian configuration, the concept of stereohomology has been defined in projective geometry and presented based on homogeneous coordinates. Consequently, a series of geometrical transformations, such as central projection, parallel projection, centrosymmetry, translation transformation, reflection, rotation transformation, which can be contained in it or derived from it have also been analytically defined.

利用Desargues定理的一个推论和引申的Desargues图形，给出"空间透射"在射影几何意义下基于齐次坐标表象的解析定义，从而解析定义了可蕴涵其中的中心投影、平行投影、中心对称、平移、反射等几何变换以及可由此衍生出的旋转变换。

Closed group: A group with a pre-defined set of members. Only defined members may participate in a closed group.

闭合群：预定义了一组成员的群，只有定义了的成员才能加入群。

If F is a space of functions defined on a domain Ω and ψ is a function taking Ωinto itself, then the composition operator C〓 induced by ψ is defined by C〓: f〓fοψ,〓f∈F. It is obvious that C〓 is a linear operator.

设F是定义在区域Ω上的一个函数空间，φ：Ω→Ω是Ω到自身的一个映射，则可通过函数的复合定义一个线性算子C〓：f→foφ，〓f∈F，称为由φ诱导的复合算子。

Consistency conditions in the development system are defined as concrete graph properties in first-order logic with equality. Some classes of consistency conditions related to object and relation types, processes, styles and applications are defined.

在考察了各种对象的演化特征之后，我们用图重写规则定义了基本演化规则，包括对象、关系的添加和删除，对象、关系类型的修改，以及一些典型的高级演化规则。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

To obtain the likelihood function indicating the uncertainty of observed information, noisy data is firstly expressed by a set of data vectors instead of a single vector, and then transferred to probability density curve defined in model space through confidence value defined in data space.

我们将数据向量的概念扩展为数据向量的集合，通过引入数据空间内的信赖度，把数据噪声转移到模型空间的概率密度函数上，即获得了反映数据本身的不确定性的似然函数。

Who? I never heard of him, Paul said, before asking teammate James Posey if he had heard of him.

赛后，科比说，他一直都是一名非常出色的射手，今天他打得很棒。

When I joined the company, I rotated around the different sections.

我加入这个公司时，轮换过几个不同的部门。