定...的界

Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.

此外，当优化问题具有某种特殊性质时，我们能给出更加简便的松弛化方法，如考虑广义几何规划问题，能充分利用其特殊结构，建立了广义几何规划问题的松弛线性规划问题；在分枝定界技术的基础上，提出了一个求广义几何规划全局解的线性松弛算法；证明了算法的收敛性。

The given Branch and Bound method can find out the optimal solution of the problem in small size while the given GA implement can quickly find out the approximate optimal solution of the problem in large size. The given GA implement proves to be very effective by numerical experiments and examples.

对于问题的较小规模情形分支定界法能精确地求得最优解；对于问题的较大规模情形遗传算法能很快地求得近似最优解；算例及大量实验表明用遗传算法来求问题的近似解是成功的。

By means of Heuristic Search, Branch and Bound method and Voronoi Diagram, the algorithm analyzes occlusion on complicated denture models precisely and quickly, which solved the practical problem in the application of VR technologies in dentistry.

通过推广基于分离轴定理的经典碰撞检测算法，借助启发式搜索、分支定界和Voronoi图等手段，算法可以在较短的时间内对复杂牙列模型完成高精度的定量咬合分析任务，解决了虚拟现实技术在口腔医学领域应用中的实际问题。

Second, according to model characteristic, such as non-linear, non-convex, multiple-peaked and so on, the paper discusses limitation of traditional solving algorithm, such as branch and bound method, GBD method and OA method, puts forward penalty function-makeup integer algorithm and genetic algorithm, analyses procedures of genetic algorithm, such as selection, crossover and mutation, brings forward modifications for specific realized problems of genetic algorithm, such as selection of initial points, operator design, adoptive value adjustment, constraint treatment and so on, and works out correlated solving program.

其次针对该模型非线性、非凸、多峰等特点，讨论了分支定界法、GBD法和OA法等传统求解算法的局限性，提出了罚函数一凑整算法和遗传算法的求解思路，对遗传算法的选择、交叉、变异等过程进行分析，对遗传算法初始点选择、算子设计、适应值调整和约束处理等具体实现问题提出了改进措施，并编制了相关的求解程序。

The imprecise polynomial circuit optimization is based on arithmetic transformation method, considering the fixed point and floating point representation condition first, then give a realization of circuits under different accuracy boundary, trade off error with power dissipation and area, applying branch and bound method to find the solution with minimal cost, determine the minimal word length which satisfies the error bound, make use of the automation synthesis approach to get ultimate optimize structure at the same time.

非精确多项式电路优化基于算术变换方法，首先考虑电路的定点和浮点表示情况，给出电路在不同精度界限下的实现，进行误差和功耗、面积的权衡，然后应用分枝定界方法求解出最小代价电路，决定满足误差要求的最小字长，同时利用自动综合优化方法得到最终的优化结构。

Therefore, it is not every Newton indefinite integral that can carry on Riemann integral, and not every Riemann integral has Newton Indefinite integral.

牛顿所积分的函数都是连续的，可分为牛顿不定积分和牛顿定积分，而黎曼所积分的函数又是有界的。

In our thesis, contents are organized as following In Chapter 1 we present our topic's internal and overseas research situations, theoretical and practical significance, and introduce the research object and contents, and the main contributions of this dissertation. Chapter 2 reviews the development of the stability results for nonlinear systems and some relevant recent results, which include Lyapunov and LaSalle-Yoshizawa theorems for nonlinear systems, and stochastic edition for stochastic nonlinear systems. Sontag's formula for systems affine in control is presented in the frame of CLF. The concepts of disturbance attenuation and the inverse optimality are also explained in this Chapter. In chapter 3 we present the solvable theorem of inverse optimal gain assignment problem, design the inverse optimal controller and the inverse optimal tracking controller for strict-feedback nonlinear continuous systems with unknown time-varing bounded disturbances and constant unknown parameters using an adaptive backstepping algorithm, which are nonlinear, continuous and are easier to realize. These designs are fully systematic and the algorithm can be directly coded in symbolic software. The results of simulation show the effectiveness of the control algorithms.

论文的结构如下：在第1章中，给出了本文研究课题的研究现状、理论意义和实际应用，并介绍了本文的研究对象、研究内容以及主要贡献；在第2章中，针对确定性非线性系统和随机非线性系统，分别介绍了Lyapunov定理、LaSalle-Yoshizawa定理及其随机版本；对仿射系统，在控制Lyapunov函数框架下，给出了Sontag公式；同时给出了非线性系统扰动抑制和逆最优控制问题的基本概念；在第3章中，针对具有未知时变有界扰动和未知定常参数的一类不确定非线性系统，给出并证明了逆最优增益配置可解定理，使用自适应Backstepping算法和均值定理，系统地设计了自适应逆最优控制器和逆最优跟踪器，这种设计方法可同时获得逆最优控制策略和自适应律，简单明了，仿真结果表明该控制算法的有效性，并给出了性能估计。

The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper.

本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍，然后对精确算法中的分支定界法作了较为详细的讨论，最后

Northern Song Dynasty, there are thick with Mei Yao AC, advocacy literature reflects social contradictions of the poet Zhang Yong, promoting innovation Song poetry, well Ouyang Xiu, Lu regimes, often with Shanseng Alchemist exchanges, as "chao will Scriptures" for Notes, and many achievements, his son Zhang Jie Ren Yiyang county magistrate court recommended to open up business during the Meishan, farming and the abolition of the people are not allowed to Cave Yiyang forbidden land bordering some of the Meishan adopted a reconciliatory policy, security of the split, the new of two counties, will never be the central piece of the effective jurisdiction of the Inland Empire area for the first time into the "king of land", together with Zhangdun open when the plum deal in, the official Hubushilang.

北宋，有与梅尧臣交厚，倡导文学反映社会矛盾的诗人张颙，推动了宋初诗风革新，深受欧阳修、陆游的推崇，常与山僧方士交往，为《玉照定真经》作注，流传后世，其子张颉在任益阳知县期间向朝廷建议开拓经营梅山，取消不准峒民耕种与益阳接界之地的禁约，对梅山蛮采取怀柔政策，分置安化、新化二县，将这块从未被中央王朝有效管辖的内陆地域第一次纳入"王土"，与章惇一起当为开梅首功，官至户部侍郎。

Let the opinions impugned be the belief in a God and in a future state, or any of the commonly received doctrines of morality.

且把所要论驳的意见定为信仰上帝和信仰彼界，或者任何一个一般公认的道德方面的教义。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。