| 1. | In the valence bond treatment, explicit recourse is made to classical, localized bond structure .
价键法明显依赖经典的定域结构。 |
| 2. | The way in which the wavelengths change depends critically on the orbital configuration of the electrons
电子的轨域结构可决定波长如何变化。 |
| 3. | In chapter 3 , the local structure of a scattered point set and its classical algorithms are investigated
第三章研究了散乱点集的邻域结构及其经典算法。 |
| 4. | 2 . gives an proper concept of " surburbs tourism development " and the method of dividing surburbs
二、对城郊旅游开发作出了准确的界定，并提出了城郊旅游地域结构的划分方法。 |
| 5. | An evolutionary iterated local search algorithm with the features of multiple neighborhood structures and population - based evolution is designed to solve the model
提出了一种基于多个邻域结构和种群进化策略的进化迭代局部搜索算法，用于求解该模型。 |
| 6. | The prior information of pixel intense distribution is introduced . then simulated annealing algorithm is applied to choose the proper neighborhood structure , and the optimal estimate can be obtained
引入像素强度的先验概率分布模型，运用模拟退火算法选择合适的邻域结构，获得强度的最优估计。 |
| 7. | With investigation of application background , a preliminary solution of dwfms based on multi - duties is given , then it analyzes the system ’ s architecture , executing strategy , data storage and so on
在对项目应用背景进行充分调研后,提出了基于多任务域结构的分布式工作流系统解决方案,对系统架构、运行策略、通信机制和数据存储策略等进行了深入的分析。 |
| 8. | Based on tabu search , a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem , which provides an approach to control the optimizing process flexibly
基于tabu搜索设计了变邻域结构的局部搜索技术，提供了灵活控制寻优过程的途径;全多项式时间复杂性近似策略的开发，使得0一1背包问题的求解成为了n户c问题近似算法设计中最为成功的范例。 |
| 9. | The local search procedure based on several critical block based neighborhood structure is hybrid with aco _ stag algorithm , comparisons with other well - performed algorithms on taillard ' s benchmark problems show that the hybrid algorithm performs better
给出了fiowshop问题的几种基于关键路径的邻域结构，并把蚁群算法与邻域搜索相结合构成混合算法，与其他算法在taillard流水作业调度测试问题集上的比较试验表明，混合算法性能更优。 |
| 10. | Then we propose the problems that will be discussed in the following papers . also , we introduce the theory in the field of feasible region for semi - infinite programming , and concluded that in some area around the feasible points , feasible region can be expressed by finite inequality constraints , this results gives a base to the following algorithms
接着介绍了半无限规划可行域的结构和稳定点的稳定性，指出了关于可行域结构理论研究的现状，并指出在一定的条件下，在可行点的局部邻域内，可行域可以有有限个不等式约束来表示，这为第二、三章半无限规划问题的算法提供了理论基础。 |
