查询词典 combinatorial optimization problem

A fine-grained genetic algorithm based algorithm which is for the parameters optimization problem of agent model is proposed. The fine-grained genetic algorithm is used to solve the parameters optimization problem of agent model. As to the parameters optimization problem of the agents colony model, the first step is to define the concept of "the parameters mode of the combat agents colony" to describe the parameters of the combat agent colony model. Then the genetic algorithm is used to solve the optimization problem with the parameters mode of the combat agent colony model as the genetic individual. Besides the algorithm, the algorithm dispatch tactic is also considered. And the two level sequence dispatch tactic and the two level nesting dispatch tactic are put forward for those complex parameters optimization problem. At last, the model parameters optimization under antagonism codition is studied. The means to solve this problem is to translate it into a kind of antagonism problem, then use the competitive co-evolutionary genetic algorithms to solve it.

其中：提出了一种基于细粒度模型的作战智能体模型参数优化求解算法，用细粒度模型遗传算法求解作战智能体模型参数优化问题；提出了"作战智能体群体参数模式"的概念，对作战智能体群体模型参数进行形式化描述，再以作战智能体群体参数模式为遗传个体，应用遗传算法求解作战智能体群体模型参数的优化问题；研究了上述优化问题求解算法的调度策略，提出了分层模型参数优化算法的双层顺序调度策略和双层嵌套调度策略，解决复杂的模型参数优化问题；将对抗条件下作战模型参数的优化问题转化为一种对抗性问题，应用竞争性共同进化遗传算法，进行求解。

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，反之，则学科级优化的最优点是系统级优化当前设计点距离可行域最近的点。

The maximum clique problem is a classical combinatorial optimization problem, and finds many important applications in different domains, this paper surveys the current progress on MCP. The Cross Entropy method for combinatorial optimization is proposed by Reuven Y.

最大团问题是一个经典的组合优化问题，在理论研究和实际应用方面都有重要的价值，本文对最大团问题的最新研究进展做了分析综述。

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

By the combinatorial proof or combinatorial interpretation, the identity is equipped with certain count meaning. The most general way in the combinatorial proof is to count two sides of the identity by two different methods. Generaly, through building a bijection from one set to another one, the number of the two sets respectively represents the two sides of the identity.

恒等式的组合证明或组合解释赋予了恒等式一定的计数意义，组合证明最常用的方法是分别用两种不同的方法对恒等式的两端进行计数，一般通过构造两个集合之间的双射，这两个集合的个数分别表示恒等式的两端，从而根据双射的一一对应性证明恒等式。

Moreover, by the combinatorial proof or combinatorial interpretation, the identity is equipped with certain count meaning. The most general way in the combinatorial proofs is to count two sides of the identity by two different methods. Generaly, through building a bijection from one set to another one, the number of the two sets respectively represents the two sides of the identity. Because of the 1-1 property of bijection, the identity is proved.

此外，恒等式的组合证明或组合解释赋予了恒等式一定的计数意义，组合证明最常用的方法是分别用两种不同的方法对恒等式的两端进行计数，一般通过构造两个集合之间的双射，这两个集合的个数分别表示恒等式的两端，从而根据双射的一一对应性证明恒等式。

In the thesis some vital identities with binomial coefficient are given with their combinatorial proof, and the q-analogues of some identities are offered with corresponding combinatorial proofs on the subspace-lattice. Especially, one remarkable result is that a new q-analogue of the cube-sums identity is obtained with its combinatorial proof over the vector space.

本文给出了一些重要的二项式系数恒等式的组合证明或组合解释，并从向量空间角度给出了一些恒等式的q-模拟及组合证明，其中突出的成果是给出了立方和恒等式的一个新的q-模拟及组合证明。

In the thesis , we give combinatorial proof of some q-identities using integer partition.In the thesis some vital identities with binomial coefficient are given with their combinatorial proof, and the q-analogues of some identities are offered with corresponding combinatorial proof using integer partition.

本文给出了一些重要的二项式系数恒等式的组合证明或组合解释，并从分拆的角度给出了一些q-恒等式的组合证明，其中突出的成果是给出了平方和恒等式的一个直接的组合证明并给出了偶数平方和与奇数平方和的q-模拟及组合证明。

If the power series ∑anxn an ∑anxn and ∑bnxn satisfy the condition r =∑bn xn, we obtain the twin combinatorial identity theorem between the sequences {an} and bn}.We also obtain some specific twin combinatorial identities by using the expansion on the binomial expression formula, including two expansions of combinatorial number(rsn and ...

如果幂级数∑anxn与∑bnxn满足条件r＝∑bnxn 时，获得数列｛an｝与｛bn｝之间孪生组合恒等式的定理，应用在二项式定理等展开式上得出具体的多组孪生组合恒等式，其中包含组合数的两种展开法，Bernoulli数直接表达式的新证等结果。

The chapter 3 investigates the constructive method which means that many combinatorial numbers, such as Stirling number, Bell number, harmonic number, Fibonacci number and the number of derangement, are represented to moments of some random variables. This method is used in the computation of combinatorial sums, discovery and proof of combinatorial identities.

第三章研究了构造性概率方法，即一些常见组合变量(以后统称组合数为组合变量)的概率表示，诸如Stirling数、Bell数、调和数、Fibonacci数、错排数都可以表示为一些随机变量的矩，这些概率表示可以用来研究组合和式的计算与恒等式的证明。

The role of the environment is very important.

的作用，环境是非常重要的。

At that time, the High Court of England and Wales Court of Queen's Bench president of William Murray, Lord Mansfield in June 22, 1772 ruling:"No matter then there is the inconvenience, but there must be a decision, I can not say that this case under the law in England are permitted or authorized; are so black should be released."

当时的英格兰及威尔士高等法院王座法庭院长William Murray， Lord Mansfield于1772年6月22日宣判：「无论有那麽不便，但总要有个决定，我不能说这件案在英格兰法律之下是准许或认可；所以黑人是应该被释放。