查询词典 solve the problem

In the algorithm, radial-basis function neural network was utilized as forward model, and genetic algorithm was used to solve the optimization problem in the inverse problem, which can avoid the local minimum solution possibly encountered in the iterative inverse algorithm based on gradient descent and consequently achieve the global optimized solution of the inverse problem.

在该算法中，径向基函数神经网络用作前向模型，遗传算法用于求解逆问题中的优化问题，其优点是能够避免基于梯度下降法的迭代逆算法中可能遇到的局部最小问题，并能得到逆问题的全局最优解。

Exive least-squares solutions, antire?exive least-squares solutions, bisymmetric least-squaressolutions, symmetric and antipersymmetric least-squares solutions, symmetric or-thogonal symmetric least-squares solutions, symmetric orthogonal antisymmetricleast-squares solutions and their optimal approximation to the linear matrix equa-tion AX = B, and solve them successfully. 2. For Problem II, we can convert it to another problem of finding the least-squares solutions with the least norm of a new consistent matrix equation. Onthe base of the solutions of Problem I we can apply the iterative method to get

本文所构造的迭代法的优点在于先利用法方程变换将求矩阵方程的最小二乘解转化为求一个相容矩阵方程的解的问题，再利用迭代法对于任意给定的初始矩阵进行迭代，均可在有限步内迭代出所求问题的一个解；可将问题II转化为求新方程的极小范数解的问题，同样用迭代法求解，从而系统且全面地解决了问题I、II在约束矩阵类如中心对称、中心反对称、自反矩阵、反自反矩阵、双对称、对称次反对称、对称正交对称、对称正交反对称矩阵中的最小二乘解及其最佳逼近问题。

Maze problem is a very old problem, the annex to the use of recursive algorithm to solve this problem.

详细说明：迷宫问题是一个很古老的问题，附件中使用递归算法求解这一问题。

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

At the same time,select three issues carries on solve by the Year 2008's ACM\ICPC finals:air condition machine is description the elbow of air conditioning installation problem,limited the quantity and types of air-conditioning pipe under the conditions of the installation of air-conditioning method;Password suspects,this problem is giving a system password letter combinations possible combinations and length under the conditions,to design an algorithm to calculate the correct arrangement of the password;Steam roller,this problem giving the situation of urban streets,drive steam roller from one point to another point of the shortest path,is used by how many time.

同时，选取了2008年度ACM\ICPC总决赛的三道题目进行求解：空调机器这一题描述的是对空调管的安装问题，在限定空调管数量和型号的条件下空调管可能的安装方法；密码嫌疑这一题求解的是在给定一个系统密码的可能的字母组合和长度的条件下，设计一个算法以算出正确的密码的排列方式；蒸汽压路机这一题是在给出城市道路情况的条件下，求两点间压路机走完最短路径总共所花费多少时间的问题。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

In this article it raises a mathematical model for this problem according to the practical experiences of production, and unifies simulated annealing algorithm with genetic algorithm in view of the model to solve the fast convergence problem and weak partial searching ability problem in genetic algorithm.

根据生产上的实际经验提出了问题的数学模型，针对该模型，将遗传算法和模拟退火算法结合，解决了遗传算法的收敛过快以及局部搜索能力不强的问题。

This dissertation emphasize put forward the problem of Taizhou farmer specialty cooperation:(1) development was not enough quickly, bestrow was small;(2) corporation status of cooperation was not definitude;(3) favourable revenue problem of cooperate organization could"t solve;(4) financing of cooperate organization was difficult carried out;(5) sell problem of cooperation;(6) bowel acted up;(7) associator relation was not compactness;(8) service arrangement was lowness, market competition wasn"t strong;(8) bring too much administration.

本文着重指出台州市农民专业合作社发展存在的问题：(1)发展不够快，覆盖面小；(2)合作社的法人地位问题未明确；(3)合作社的税收优惠问题未解决；(4)合作社的融资问题难落实；(5)合作社的销售问题；(6)内部运作不够规范；(7)与会员的利益关系不够紧密；(8)服务层次低，市场竞争力不强；(9)行政色彩较浓。

The new representation proposed in this paper deals with the partitional clustering problem by regarding it as a multi-objective optimal problem; in this approach the niche Pareto genetic algorithm is used to solve the problem.

动态聚类算法从本质上讲是单目标组合优化算法，一般需要事先给定目标分类数和初始聚类中心，且初始聚类中心的选择对数据划分结果影响较大。

Ever so, this kind of exploration has stablished the solid foundation for china"s modernization, have played and lays foundation on function for the settlement of china"s rural, agricultural, peasant"s problem, Its position is pioneering.Deng ciao-ping is in the new period for reform and opening up to the lutside world. He suggests reform and opening up the outside world as theAbstractmotive force of development, and reform the factor of fettering productivity development in the old system, make a reservation and solve the basic point of china"s rural problem again. He emphasize that liberates and develop rural productivity again and point out that the rich peasant is a key of solving the problem.

邓小平在改革开放的新时期，改革传统体制中&左&的、束缚生产力发展的旧体制；强调重新解放和发展农村生产力；以富裕农民为关键，以确立农业在新时期的战略重点地位为核心；强调科技在农业发展中的作用；强调调整农业产业结构，发展多种经营；强调工业支援农业，发展乡镇企业，转移农村剩余劳动力；提出中国农业发展的&两个飞跃&的思想；继承毛泽东农民教育思想，提出教育改造农民的新思路；吸取以往经验教训，强调保护农民的物质利益，尊重农民群众的首创精神；继续强调共同富裕的农村发展目标，提出&先富&到&共富&的发展思路等观点。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。