查询词典 constraints

In the POPF model, wind farm is modeled by the probabilistic wind farm model considering the reactive power-slip characteristic, and the inequality constraints include not only the unit output constraints, the ratio constraints, the voltage constraints and the line current constraints but also the reactive compensation capacity constraints in wind farm and the system climbing capacity constraints per minute. By introducing the NCP function, the KKT conditions of POPF system are transformed equivalently. Based on the transformed nonsmooth nonlinear algebraic equations, the FOSMM is used to determine the POPF model expressed by the numerical characteristic of variables. The model includes nonsmooth functions, so it can be solved by a semismooth Newton-type method based on the subdifferential.

概率最优潮流模型中，风电场采用考虑无功功率—滑加热器差特性的风电概率模型，不等式约束中除了机组出力约束、有载调压变压器变比约束、电压约束和支路电流约束，也考虑了风电场无功补偿容量约束、系统的分钟级爬坡能力约束；使用非线性互补函数将概率最优潮流的KKT条件转化为一组包含有不光滑函数的非线性代数方程组，然后基于一次二阶矩法确定了以待求量的数字特征表示的POPF模型，由于该模型包含不光滑函数，因此采用基于次微分的半光滑牛顿型方加热器法求解。

It can be integrated into existing applications. It is designed for application developer. The system provides power modeling. Users can widely select decision variables, such as integer, real, Boolean, etc. Users can also select extensive set of predefined constraints, such as primitive constraints and function constraints, local constraints and global constraints.

"明月"系统是开放的C++类库，可嵌入到具体的应用中，可扩展，是面向开发人员设计的；系统具有强有力的建模功能，用户可以广泛选择决策变量，例如整型、实型、布尔型等；可扩展的预定义约束集合，其中包括基本约束和功能约束，局部约束和全局约束。

A self-evolving software technique is proposed, which is based on Agent technique and the dynamic binding mechanism. According to the characters of self-evolution, the constraints are divided into micro level constraints which focus on individual Agent and the macro level constraints which focus on overall system. Language facilities are proposed to describe the constraints on self-evolution, the constraints are analyzed and inspected through runtime verification.

提出了基于Agent，以动态绑定机制为核心的软件自演化技术，根据自演化的性质和特点，区分出微观层面个体Agent自演化约束和宏观层面系统全局自演化约束；提出了对自演化约束进行描述的语言设施，并通过运行时检查的方法对自演化约束条件进行了分析和检查。

We also provide basis for KB splitting and solve the KB splitting problem Gasser has referred to but failed to solve We systematically analyze the multiple factors which lead to reorganization: the status and environment of system, the status of cooperative members, the properties and requirements of users, the amount, frequency, temporal constraints, task-solving quality constraints, cost constraints and resource constraints of the task to be solved, and the resource status, etc. We also present and realize an open, multi-level and multi-stage model to reorganize dynamically the architecture.

系统地分析了引起重组的多方面因素：系统的状态、环境，协作成员的状况，用户的属性、要求，待解任务的数量、频度、时间约束、求解质量约束、求解代价、资源约束，及资源状况等；提出并实现了开放的、多层次和多阶段的体系结构动态组织模型。

There exits several MDO algorithms. But they are in our opinion either nonefficient or complicated. So we devised an algorithm called Subspace Approximation Optimization . In the SAO algorithm, the whole system is decomposed into one system-level optimization and several disciplinary optimizations so that a large and complicated problem can be divided into several easy-solving sub-problems. The coupling relationships and the coordination among disciplines are presented by equality constraints and these equality constraints are assigned to relevant disciplines. The optimums of design variables in system level optimization are transferred to discipline level optimization. The optimums of design variables in discipline level correspond to the point that is the nearest to the optimums of design variables in system level. If the optimums of design variables in system level are out of feasible region of discipline 1eve1, linear constraints can be built in the system level optimization using the design variable optimums obtained by the discipline level optimization. The system level optimization would improve the design of the whole system with these linear constraints.

目前，国内外已经发展出了多种飞机多学科设计优化算法，本文的重点是针对协同优化算法的不足，提出了子空间近似优化算法(Subspace ApproximatingOptimization，SAO)，SAO算法中，整个系统的优化问题被分解成一个系统级优化和若干学科级优化，而各个学科之间的耦合与权衡关系则被当作等式约束，这些等式约束将被分配到各个学科级优化中去，系统级优化的任务是寻找整个系统的最优解，而学科级优化的目标函数是以系统级优化分配下来的设计点为圆心的超球半径的平方，因此，如果系统级优化分配下来的设计点在学科级优化可行域内，则学科级优化目标函数为0，反之，则学科级优化的最优点是系统级优化当前设计点距离可行域最近的点。

Association rule is an important content in data mining, efficient arithmetic is the most important part of data-mining 昺odel, especially when facing the complicated and various demands, it is necessary to propose characteristic and complementary arithmetic according to different factors. The paper analyses elaborately the idea of association rule mining arithmetic based on constraints, studies the classes of constraints in order to confirm its utility. The arithmetic aiming at united variable constraints improvement strategy and exchange of complication aggregation constraints has been designed, the practice has proved that it is effective.

关联规则是数据挖掘研究的重要内容，高效的算法是数据挖掘的重要组成部分，而且面对复杂的多方面的需求，应提供针对各种因素的各具特色的互补的多种算法，本文详尽地研究了基于约束的关联规则挖掘算法的思想，深入地研究了约束的分类、确定其可利用的性质，在此基础上提出了针对联合约束中前驱和后继重叠时的改进策略和复杂聚集约束的转换方法。

Classifying the system constraints as basic constraints and variable constraints,a model of flexible multibody with changing topologies is developed.

将系统约束分为基本约束和条件约束，建立了变拓扑结构柔性多体动力学模型。

Another key point in the contact problem is how to deal with such contact constraints as normal force constraints and displacement constraints.

在接触问题分析中，接触约束的施加是一项关键的技术。

The studyshows that Chetaev's model for mechanicalsystems with non-holonomic con-straints can be reduced to three essential factors:(1)a kind of direct sum ofjet bundles according to the constraints,(2)D′Alembert's principle,(3)pos-tulate of ideal constraints.The first among the three factors only has geomet-ric significance and the second is a fundamental physics principle independentof any constraints.

研究表明，非完整约束力学系统的Chetaev模型归结为三个要素：(1)射丛按约束的直和分解；(2)D′Alembert原理；(3)理想约束条件，其中(1)仅具有几何意义，(2)为与约束无关的基本物理原理，而(3)是对约束力学系统的限制条件。

Some constraints are selected, and omitted according to the most-obtuse-angle principle. The smaller problem is solved with the simplex method. Then the omitted constraints are added to restore the original problem. If all the constraints are satisfied, then a basic optimal solution is reached. In the other case, the dual simplex method is used to obtain the basic optimal solution.

该算法依据最钝角原理略去部分约束得到一个规模较小的子问题，用原始单纯形算法解之；再添加所略去的约束恢复原问题，若此时全部约束条件均满足则已获得一个基本最优解，否则用对偶单纯形算法继续求解。

The shaping method of noncircular part and the tool holder's radial motion characters in noncircular turning process are discussed in detail in the thesis.

论文详细研究了非圆零件的成型方法和加工过程中刀架的径向运动规律。

I have not really liked him,I do not like his this kind of disposition.

我没有真的喜欢他，我不喜欢他的这种性格。