问题的

This paper presents a method to embed the original problem into separable parametric optimization problems and proves that the optimal solutions of the original problems are in the set of solutions of separable parametric optimization problems.

本文把原问题嵌入到可分的参数规划问题中，并证明了原问题的最优解包含在可分的参数规划问题的最优解集中。然后从最优解集中挑出原问题的最优解。

The discretized frictional contact problems can be reduced as a linear complementarity problem using parametric variational principle and parametric quadratic programming method. Then we can apply the algorithms proposed in this thesis to the solution of the contact problems.

利用参变量变分原理和参数二次规划法，离散后的接触问题可化为线性互补问题，之后，将第二、三章提出的互补问题算法应用到接触问题的数值求解中。

Arrival of information age require people learn study of independence, on the basis of to is it is it set up on a complicated one , meaningful problem among the situation learning to mean to learn independently issue, is it on positive angle of person who solves problem , is it is it reflect student true world situation bad to construct the question to face to go directly to put, through solving the complicated practical problem , train students' question to ask the tactics of solving , develop the basic discipline knowledge foundation and basic skill at the same time .

信息时代的到来要求人们学会自主性的学习，基于问题的学习是自主学习的一种，它是把学习设置于复杂的、有意义的问题情境中，将学生置于积极的问题解决者的角度，直接去面对反映真实世界情境的劣构问题，通过解决复杂的实际问题，培养学生的问题求解策略，同时发展基本的学科知识基础和基本技能。

Therefore, this paper on the current situation of state-owned banks queuing problem for reflection, analysis of the reasons for the outstanding issues for a long time, and from foreign banks to resolve similar problems, propose solutions to the problems the solution.

因此，本文结合当前形势对国有银行排队问题进行思考，分析问题长期以来悬而未决的原因，并借鉴外国银行解决类似问题的方法，提出解决问题的良策。

Based on this, convert the matrix equations problem for row symmetric matrices into ordinary matrix equations problem, the scale of converted matrix equations problem is half of that for the original problem.

在此基础上，将行对称矩阵方程组问题转化为一般的矩阵方程组问题，转化后的一般矩阵方程组问题的规模是原行对称矩阵方程组问题的一半。

At this point we are shifting to question two, since the problem is no longer, or not only, a physical one, but rather one that concerns the very nature of creative activity, of the reading process, and in order to unravel this skein of questions we have first of all to decide what we mean by a hypertextual link.

就此而言，我们正在转向第二个问题，因为问题已不再是，或不仅是一个物理问题了，而是一个关系到创造性活动真正天性的问题，关系到阅读的过程，为了解开问题的谜团，我们首先要判断的是，通过一个超文本的链接，我们意欲何为。

Our results improve the former results. For periodic Jacobi matrix, some new spectral properties of periodic Jacobi matrix are given by studying the relationship of the eigenvalues of periodic Jacobi matrix and its n—1 principal submatrix. Applying these spectral properties, we present a necessary and sufficient condition for the solvability of an inverse problem of periodic Jacobi matrices and discuss the number and the relationship of its solutions. Furthermore, we propose a new algorithm to construct its solution and compare it with the former algorithms. As this inverse problem of periodic Jacobi matrix usually has multiple solutions as many other eigenvalue inverse problems, we study the uniqueness of this problem. And a necessary and sufficient condition is given to ensure its uniqueness, under which an algorithm is presented and the stability analysis is also given. Finally, we put forward a new inverse problem for periodic Jacobi matrix which has not been solved.

对周期Jacobi矩阵特征值反问题，通过研究周期Jacobi矩阵与其n-1阶主子阵特征值的关系，给出了周期Jacobi矩阵的一些新的谱性质；利用这些谱性质，研究了一类周期Jacobi矩阵特征值反问题，用新的方法推导出了该类特征值反问题有解的充分必要条件，并讨论了解的个数以及解与解之间的关系；此外，提出了一种新的构造周期Jacobi矩阵反问题解的数值算法，并与前人的算法做了一定比较；由于周期Jacobi矩阵特征值反问题和其他很多特征值反问题一样往往存在多个解，本论文给出了周期Jacobi矩阵反问题解唯一的充要条件，并发现周期Jacobi矩阵特征值反问题的解唯一当且仅当构造的矩阵满足一定的条件；在解唯一的情况下，给出了构造唯一解的数值算法，并做了相应的稳定性分析；最后，提出了一类新的有待于解决的周期Jacobi矩阵特征值反问题。

In this paper, we describe the use of the ant colony optimization algorithm to solve the shortest superstring problem, which highlights a way for applying stochastic optimization methodologies to solve problem in bioinformatics.

而最短超字串问题可视为一个汉米尔顿回路[27]，TSP问题又为汉米尔顿回路中的一个特例，因此，本研究试图利用蚂蚁演算法来解最短超字串问题，并实验及探讨其对此问题的影响，以及其所求之最佳解的品质。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

The groundwork and achievement of the thesis are as follows:The text analyses the area surveying which is one of the focus questions in the real estate surveying at present and discusses origin and also provides ways at last. The text plays a key role in resolving issuable cases in the area amount of the house.

论文的主要工作及成果如下：商品房销售中的面积纠纷问题已成为购房者投诉较为集中的一个问题，本文在分析房屋面积量算问题的基础上，探讨了该问题的起因，提出了解决方案，对解决房屋面积量算纠纷问题有一定的借鉴作用。

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。