第二章是预备知识，介绍了锥、锥凸集值函数、切锥与集值映射的切导数等的相关知识。
In chapter 2, we introduce the knowledge that the paper use, introducing these conception of cone, cone convex set-valued maps, tangent cones, and tangent derivatives of set-valued mapping, etc.
提供了完整的函数集，因此可以把这些值显式地从一种类型转换为另一种类型，将这种转换作为它们在XPath 2.0中操作的一部分。
A full set of functions is provided so you can explicitly convert these values from one type to another as part of their manipulation in XPath 2.0.
尽量尝试将您的扩展函数设计为仅使用双精度、字符串、布尔和节点集作为实参和返回值的类型。
Try to design your extension functions so that they use only doubles, strings, booleans, and node-sets as both arguments and return values.
结果集是一个数组，该数组由0个或多个与数据库查询相匹配的行组成；结果集标识符只是一个值，您可以将该值传递给其它函数，以使它们能够使用结果集中的行。
A result set is an array consisting of 0 or more rows that match a database query; a result set identifier is simply a value that you pass to other functions to work with the rows in the result set.
处理节点集的扩展函数编写起来比那些处理简单值的函数更要求技巧，但不是非常困难。
Extension functions that operate on node-sets are trickier to write than ones that operate on simple values, but not excessively so.
EXTRACT函数是选择一组值的非常高效的方法，但是如果预期的结果集只是单一对象，那么最好使用前面介绍的choose函数。
The EXTRACT function is a very efficient way to select a group of values, but if the expected result set is just a single object then you are better off using the CHOOSE function previously discussed.
使用函数odbc_result，该函数接受结果集和列名称(字符串形式)，并返回行迭代程序所指向的行中的单元值。
Use the function odbc_result , which takes in a result set and a column name (as a string) and returns the cell value within the row that the row iterator points to.
由凸集分离定理及终端时间阈值函数方程，我们获得了最大值原理及最优控制时间的确定方法。
Using separation theorem of convex set and the time terminal value function equation, we obtain the determining method of optimal terminal time as well as the Maximum principle.
关于算法分析的定理证明了这种混合算法对于紧致集内的权向量构成的任意连续函数能依概率1收敛于全局极小值。
It is shown that this algorithm ensures convergence to a global minimum with probability 1in a compact region of a weight vector space.
为了得到关于弱集值渐近鞅的收敛性质，首先证明了支撑函数列的极限亦为一支撑函数。
In order to get the convergence properties of the weak set-valued Amart, we firstly proved the theorem that the limit of support functions is a support function.
利用集收敛、函数收敛建立了集值映射收敛的概念及其性质，并依此讨论了平衡问题解的收敛性。
By using set convergence and function convergence, we establish the convergence for set-valued mappings and present the convergence results for the perturbed equilibrium problems.
在极大值函数的有效域为非空凸集的条件下研究了次微分，并给出它的结构表达式。
And the expression of its subdifferential is developed in the case that the effective domain of the sup-type function is a non-empty convex set.
该模型采用二值化水平集方法实现，避免了传统实现方法水平集函数需要重新初始化为符号距离函数，从而导致稳定性差、计算量大、实现复杂等缺点。
The model was implemented by level set method with a binary level set function to reduce the expensive computational cost of re-initialization of the traditional level set function.
采用水平集方法描述结构的拓扑及其变化，使用紧支径向基函数对计算区域的水平集进行插值以得到参数化的水平集方法。
The level set method was adopted to describing the structural topology and its change, and the compactly supported radial basis function was introduced to getting the parametric level set method.
首先通过构造一个函数的有限集替代动态规划中的条件期望，其次使用蒙特卡洛模拟和最小二乘法计算第一步中的值函数。
First, in this algorithm, the condition expectation in the dynamic programming principle is replaced by projections on a finite set of functions.
当一个数据聚集函数使用另一个数据集函数作为参数时，该参数取MD X值，而不是显示值。
When one CUBE function USES another CUBE function as its argument, the argument takes on the MDX value rather than the display value.
本文对线性空间中的凸集上的实值函数定义一种导数，用其研究函数凸性，得到了上述三种凸函数的若干判定定理。
This paper defines a kind of derivative for real function on convex set which is in linear space. By means of the derivative we study convexity of function and obtain some decision theories.
本文对无线传感器网络的节点配置问题的研究方法是一个对建立的目标价值函数的可变参数集进行优化，从中求得最优值的过程。
For the problem of WSN node deployment, this paper's researching approach is a process of optimizing the variable parameter set of object value function and then finding the optimal result.
本文主要研究了非紧致集上的极大值函数和带不等式约束的广义半无限规划。
This dissertation is devoted to the study of sup-type function on non-compact set and the first-order optimality conditions for generalized semi-infinite programming with inequality constraints.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
本文提出了一个在三角形域上的有理布尔和插值的新方法，此方法的特点是所构造的插值函数结构简单，多项式准确集较高。
A new method of rational Boolean sum interpolation on an arbitrary triangle is developed in this paper. The structure of the interpolation function is simple.
值 的函数不能配置为返回数据集。
User-defined function returning values cannot be configured to return a dataset.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
The algorithm is an improved greedy algorithm which combined the part of enumeration method with the greedy algorithm, thus to make it a better performance guarantee.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
The algorithm is an improved greedy algorithm which combined the part of enumeration method with the greedy algorithm, thus to make it a better performance guarantee.
应用推荐