查询词典 solve problems

Heuristic algorithms are needed to solve the NP-complete problems, which is the method of this paper to study the packing problems. On the basis of lots of tests and the wide research on the packing problems, a heuristic algorithm based on objective and orthogonal decomposition of space is developed to solve the non-guillotine packing 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.

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

This kind of parallel processing hugely improves the computational speed, and can change some NP problems that cannot be accomplished by classical computers, i.e., the complexity of the problems exponentially increases with the increase of bits, to P problems, i.e., the complexity of the problems polynomially increases with the increase of bits. In 1994 Peter Shor at Bell Laboratory proved that quantum computers could efficiently solve the problem of Large Number Factorization, which was the security footstone of nowaday classical cryptosystems, while none of any classical computers could implement this.

这种并行处理极大地提高了计算速度，可以把一些经典计算中无法计算的NP问题即问题的复杂度随着比特位数的增长而指数上升，变成P问题即问题的复杂度随着比特位数的增长以多项式上升。1994年，Bell实验室的Peter Shor证明量子计算机可以有效解决经典计算机所不能解决的大数因子分解问题，而这恰恰是目前经典密码的安全性基础。

In this paper, we construct the differential equation to solve the unconstrained optimization problem. Such methods solving the ill-conditioned problems are very effective. It indicates that the asymptotically stable region of explicit the Euler method to solve the differential equation equals to the descent region of the gradient method to solve the original unconstrained optimization problem.

我们发现，在用Euler方法求解二次优化问题的等价动力系统的方程时，由方法的步长确定的稳定区域对应于这些方法所得到的迭代公式的步长满足单调下降算法的条件确定的单调下降区域，因此我们可以利用这个性质构造解无约束优化问题的数值方法而不采用标准的常微分方程的数值求解公式。

This thesis is divided into six parts. The first chapter is preface, the current status of research in the inverse problems for parabolic partial differential equations is reported; the second chapter is "regularization methods for numerical differentiation and their applications ", in this chapter we investigate many regularization methods from a viewpoint of regularization theory and algorithm, some applications in the inverse problems for parabolic partial differential equations are given; the third chapter is "spectral regularization methods". Based on Fourier analysis, within the framework of regularization theory, we apply the spectral methods to some ill-posed problems. Many numerical experiments are done in order to show the validity of the methods; the fourth chapter is devoted to wavelet dual least squares method and a revised wavelet method; in the fifth chapter,we combine finite difference method with method of lines and apply it to the backward heat conduction problem in time; in the sixth chapter "identification problems for unknown source ", the essence and the degree of two problems related to source identification are pointed out, at the same time, some numerical methods are reported.

本文分为六个部分，第一章前言简要分析了国内外抛物型偏微分方程反问题的研究现状；第二章数值微分的正则化及其应用从正则化理论和算法的角度出发，考察了许多正则化方法，还给出了数值微分在抛物型偏微分方程反问题的一些应用；第三章谱正则化方法是在Fourier分析的基础上，在一般正则化理论的框架下，给出了这种方法在各种不适定问题中的应用，数值实验表明谱方法是有效的；第四章研究了小波对偶最小二乘方法和改进的小波方法；第五章主要研究了有限差分方法结合线方法在时间反向热传导问题中的应用；第六章是未知源识别问题，主要指出了两类未知源问题的不适定程度和不适定本质，同时报告了一些数值方法。

Additionally, a great deal of contradictions and problems in current Chinas socio-economic development, such as, the problems caused by duality structures in urban and rural areas, three main problems in rural area (problems in agriculture, in rural areas and with farmers), problems in industrial structure adjustment, urban planning and infrastructure construction, rational utilization of land resource and ecological environmental protection etc, unexceptionally have close connections to relative lag of urbanization.

更重要的是，当前中国社会经济发展中的诸多矛盾和问题如城乡二元结构与"三农"问题、产业结构调整问题、城市规划与基础设施建设问题、土地资源合理利用和生态环境保护问题等等，无例外的与我国城镇化发展相对滞后有密切的联系。

It points out that it is no more application of the basic solution of elastic problems in the misalignment of material main axis and coordinate axis to orthogonal anisotropic body and puts forward the coordinate translation methods to solve the problems of the misalignment of material main axis and coordinate axis by using Boundary Element Method to solve the problem.

指出了对于正交各向异性体，当材料主轴与坐标轴不重合时，关于弹性问题的基本解不再适用，为了解决这一问题，特提出坐标转换的方法，以求应用边界元法解决材料主轴与坐标轴不一致的问题。

There is no good method to solve such problems. T method is proposed to solve problems, the method is a simple but quite efficient approximate method.

提出的t方法是一个简单同时又效率很高的近似方法，能够很好地解决这类问题。

Based on the higher mathematics method proved inequalities are summarized, and the proposed using the function extreme value and the monotonicity and concave and convex function sex, and mean value theorem, Taylor formula, integral these common higher mathematics method, combining with concrete examples of each kind of method to solve the problems for type, and the key problem of the specific steps, and points out that the inequality proof of higher mathematics method used properly, improve the difficult easy to ability to solve problems.

本文对不等式证明中的高等数学方法作了归纳总结，提出了利用函数的单调性，极值与最值，函数凹凸性，中值定理，泰勒公式，积分这些常用的高等数学方法，并结合具体实例阐述了每一种方法的适用类型、解决问题的关键和证明问题的具体步骤，指出在不等式证明中恰当地运用高等数学方法可以化难为易，提高解题能力。

All the sub-plans are described by a group of general mathematic formulae. The computation of the sub- plan can be decomposed into two sub-problems by relaxing the constraint that production level at production period of a sub-plan must be more than zero. Based on the properties of an optimal solution, two polynomial algorithms are devised to solve sub-problems and reintegrate the relaxed constraint. Finally, a dynamic programming algorithm with complexity O(T^4) is developed to solve the global problem, where T is number of periods in planning horizon.

给出了所有子计划的通用数学描述，并通过松弛正生产量约束将子计划的计算分成两个子问题；依据子问题和子计划最优解的性质，设计了求解子问题和重新集结松弛约束的多项式算法；在此基础上提出了一个复杂性为O(T^4)的求解整个规划问题的多项式动态规划算法，这里T是规划时段上的周期数。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样