混合的问题

The boundary contour formulations of evaluatingstresses from the Somigliana stress identity are derived for 2-D problemswith quadratic boundary elements.The boundary contour method basedon the traction boundary integral equation is further discussed.Elasticproblems are first solved using the traction boundary contour method.Amixed collocation of the displacement boundary contour formulation andtraction boundary contour formulation is given.(4)The dual boundarycontour method is developed for the analysis of crack problems.

3建出了Somigliana应力积分式的二维和三维问题的边界轮廓法理论；给立了二维问题由Somigliana应力积分式计算应力的二次形函数的边界轮廓法方程，进而给出了基于面力边界积分方程的边界轮廓法；提出了一种以位移边界轮廓法方程与面力边界轮廓法方程混合配置的方案，首次实现了用两种积分方程相结合来求解弹性力学问题。

We show that such decomposition gives the same solution with the original problem, and discuss well-posedness of the Cauchy problem based on the stratification theory.

首先证明了这样的分解与原问题同解，然后用分层方法讨论相应Cauchy问题的适定性，从而得到了原混合问题的适定的充要条件。

The operator of crossover, mutation and selection in HGA have function of macroscopically search, that deals with a large scale search, while the quasi-Newton operator has function of local search, and deals with a small circle search and problem of accelerating of search.

混合遗传算法中交叉算子、变异算子和选择算子的作用是宏观搜索，处理的是大范围搜索问题，而拟牛顿算子迭代运算的作用是局部搜索，即微观搜索，处理的是小范围搜索问题和搜索加速问题。

Weak formulation of equilibrium equations including boundary conditions of laminated cylindrical shell are presented, and thermal stresses mixed state equation for axisymmetric problem of closed cantilever cylindrical shell is established.

导出层合柱壳轴对称问题的平衡方程和边界条件的弱形式，提供了方程和边界条件放在一起的算子形式，建立了悬臂柱壳轴对称问题的热应力混合方程，给出了正交异性层合悬臂柱壳在热荷载和机械荷载作用下的弱形式解·本文提出的方法弱化了求解方程和边界条件，化解了问题，具有一般性并便于推

In chapter 2 we propose a linear equality constraint optimization question , the new algorithm is combined with the new conjugate gradient method(HS-DY conjugate gradient method)and Rosen"s gradient projection method , and has proven it"s convergence under the Wolfe line search.In chapter 3 we have combined a descent algorithm of constraint question with Rosen"s gradient projection, and proposed a linear equality constraint optimization question"s new algorithm, and proposed a combining algorithm about this algorithm, then we have proven their convergence under the Wolfe line search, and has performed the numerical experimentation.

在第三章中我们将无约束问题的一类下降算法与Rosen投影梯度法相结合，将其推广到线性等式约束最优化问题，提出了线性等式约束最优化问题的一类投影下降算法，并提出了基于这类算法的混合算法，在Wolfe线搜索下证明了这两类算法的收敛性，并通过数值试验验证了算法的有效性。

Finally, the perturbation problems for the mixed variational-like inequalities problems are discussed, and the existence and uniqueness theorem of the solutions for the perturbation problems is also proved.

最后，讨论了混合似变分不等式问题的扰动问题，并证明了扰动问题的解的存在唯一性定理。

Hybrid Flow Shop scheduling problem is a kind of complicated scheduling problems which involve task, resource and time.

混合流水线(Hybrid Flow Shop，简称HFS)调度问题是一类复杂的调度问题，由于调度涉及任务、资源、时间的三维性，建立HFS调度问题精确的数学模型是非常困难的。

Theoretical analysis shows QRBKP can solve QoSR not only with additive constraint parameters, but also with nonadditive constraint parameters.

理论分析表明，QRBKP不仅能够解决加性度量参数受约束的QoS路由问题，而且能够解决加性与非加性度量参数混合受约束QoS路由问题。

The algorithm is based on a reformulation of the complementarity problem as an unconstrained optimization. It is proved that the algorithm is globally convergent.

在将互补问题转化为一个无约束优化问题的基础上，给出了一种求解互补问题的混合方法，证明了该算法的全局收敛性。

Moreover, A hybrid algorithm, ALHybrid, which is made of the algorithm LIDBSO and the algorithm AprioriIpv, is designed. Two algorithm, MQC_Apriori and MQC_LIDBSO, are given to mining multiple level quantitative association rules with item constrains. Two algorithm, PMARⅡ and PMARⅢ, which are based on different sequential mining algorithms, are given for parallelling mining association rules. In order to solve the mining association rules problem when we add a set of data to a database or delete a set of data from a database, two incremental updating algorithm, EUAR and EUAR, are given. Three incremental updating algorithm for association rules mining, DIUAⅠ, DIUAⅡ and DIUAⅢ, are dedigned to solve the three kinds of association rules incremental updating problem in distributed databases.

另外，文中还设计了一个算法LIDBSO与算法AprioriIpv相结合的混合采掘算法ALHybrid；对于多层次、带约束、多值属性关联规则的采掘问题，给出了两个采掘算法：算法MQC_Apriori和算法MQC_LIDBSO；在关联规则的并行采掘方面，还设计了两个基于不同顺序关联规则采掘算法的并行算法：算法PMARⅡ和算法PMARⅢ；在关联规则的增量式更新问题上，还给出了两个改进算法：算法EUAR和算法EUARˉ，分别用于解决当数据库增加或删除一个数据集合时的关联规则增量式更新问题；针对分布式数据库中的关联规则增量式更新的三类问题，提出了三个增量式更新算法：算法DIUA Ⅰ、算法DIUAⅡ和算法DIUAⅢ。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。