问题求解

Four basic processes are analyzed in detail in network security decision,which are the base of NSDSS security decision. Then, developing strategies and methods are analyzed according to the objective and task of the system. Antetype method with RAD speciality is chosen to lead the developing process of the system. The structure of "Four-Base and Seven-System" of NSDSS is decided, based on which, the Function and Structure of Man-Machine Conversation system, General Management system, Data Base system, Model and Method Base system, knowledge base system, Causing and solving problems system are discussed. The basic theories and methods of each part are discussed. In the designing process of Model Base System, detailed analysis is given to the models of prediction, evaluation and management in the course of security decision. Moreover, basic process and method are discussed on question generation and solution. Then, detailed explanation is provided on the integration and implement of the system. After that, it is suggested that implement of the system should be carried through the process of the system.

论文首先对NSDSS涉及到的相关知识进行了讨论，详细分析了网络安全决策中的四个基本过程，这是NSDSS进行安全决策的基础；随后依据系统的目标和任务，对系统的开发策略和方法进行了分析，选择具有RAD能力的原型法指导整个系统的开发过程；确定了NSDSS"四库七系统"的整体结构；在此基础上，分别探讨了人机对话系统、通用管理系统、数据库系统、模型库和方法库系统、知识库系统、问题生成和求解系统的功能和结构，对各部件的基本原理和实现方法进行了论述；在模型库系统的设计过程中，对安全决策过程中运用到的安全预测、安全评估、安全管理等模型进行了详细的分析；仔细探讨了问题生成和求解的基本过程和方法；较为详细地阐述了系统集成和实施的有关问题，面向系统的成功实现，提出了将系统实施贯串于整个系统开发过程中的思想。

In this paper we study the method of interpolation by radial basis functions in H~k(k ≥ 1) and give some error estimates. By means of such interpolation with a special kind of radial basis function, we construct a basis in H~k(k ≥ 1). Combined with the Galerkin method, this theory can be applied to solve boundary value problems for elliptic partial differential equations (such as the third boundary value problem for Poisson equation and the corresponding problem for the biharmonic equation), and some numerical experiments are also given.

本文从求解偏微分方程的角度出发，在被逼近函数u属于一般的Sobolev空间H~k(k≥1)的情形，引入了一种径向基函数插值方法，并建立了相应的误差估计；再利用这种插值性质，从一类特殊径向基函数出发构造Sobolev空间的一组基，针对Poisson方程第三类边值问题和重调和方程类似边值问题，为用无网格算法求解偏微分方程边值问题建立了相应的理论，并通过算例来验证了这一算法。

Analyzed the similarity between scheme solving problem and traveling salesman problem, the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed.

摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。

Three solution algorithms for classical transportation continuous/discrete/ mixed network design problems are designed based on particle swarm optimization approach, in which the continuous NDP is studied in detail, discrete and mixed NDP are only described the frameworks of the solution algorithms.2. Generally, road capacity constraints must be added to the lower level problem of classical discrete NDPs bilevel programming model in order to avoid traffic assignment on candidate roads.

本论文研究工作主要有如下几个方面：(1)基于粒子群优化思想设计了求解传统的城市道路交通网络设计问题的算法，其中详细研究了连续网络设计问题，并用两个网络例子进行了数值实验；并给出了离散网络设计问题和混合网络设计问题的求解算法思路和主要步骤。

Finally, based on the fundamental solutions of Biots consolidation of transversely isotropic saturated multi-layered soils, the Fredholm integral equation of second kind for the interaction between transversely isotropic saturated multi-layered soils and rectangular piles is established, the relevant numerical analysis is also carried out.

最后，基于横观各向同性层状饱和地基Biot固结问题的基本解答，建立了横观各向同性层状饱和地基与方形单桩、群桩共同作用问题的第二类Fredholm积分方程，并进行了数值分析与计算；通过将矩形刚性基础基底划分成若干个大小相等的矩形网格，用矩形均布荷载表示网格的基底反力，并利用已获得的横观各向同性层状饱和地基Biot固结问题的基本解来求解每个矩形网格的柔度系数，然后根据刚性基础与层状饱和地基的接触条件和其本身的静力平衡条件，求解分析了横观各向同性层状饱和地基与刚性矩形板的共同作用问题。

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是规划时段上的周期数。

According to the problem of game tree solution, the immune evolutionary algorithm was designed, the Bayesian Nash equilibrium was carried out, and the best strategy sequence was achieved.

以不完全信息动态博弈理论为基础，无人机攻防对抗问题为背景，建立无人机攻防对抗问题的不完全信息动态博弈模型；针对博弈树的求解问题，设计免疫进化算法，求解问题的贝叶斯纳什均衡解，得到无人机的最优策略序列。

LINDO for solving linear programming and quadratic programming problems, LINDO LINGO addition to the full functionality, but also can be used for nonlinear programming problem some also can be used for linear and nonlinear equations solution, and so on.

LINDO用于求解线性规划和二次规划问题，LINGO除了具有LINDO的全部功能外，还可以用于求解非线性规划问题，也可以用于一些线性和非线性方程的求解，等等。

The theory minutely analyze trait of evolutionary programming arithmetic and state variables breakout problem in solving reactive power optimization problem, link reactive power balance theory.. reactive power bed and subarea control theory and adjusted-voltage material law of actual system. The theory first put forward a effective variability quantity modified measure, escape unfeasible problem in evolutionary programming, also make evolutionary programming arithmetic in solving reactive power optimization problem more quick and effective.

详细分析了进化规划算法的特点和在求解无功优化问题时存在的状态变量越限问题，结合无功平衡原理、无功分层分区控制原理以及实际系统中调压的具体规律，首次提出了一套有效的变异量修正措施，避免了进化规划的不可行问题，也使进化规划算法在求解无功优化问题时更加快速有效。

In the model solution method's choice, according to the mix integer model's characteristic, the paper proposed to divide the model solution into two parts. The linear segment used the transportation plan method to solve and the mis alignment part used the implicit enumeration to solve. Finally the paper proved the model's feasibility through the example to solve the location-selection for the distribution center and obtained the quite satisfactory the location-selection result.

建立了以区域配送中心总成本最小化为目标的一个混合整数选址模型；在模型求解方法的选择上，根据混合整数模型的特点，提出了将模型的求解分成两个部分：线性部分采用运输规划法求解，非线性部分采用隐枚举法求解；最后通过实例论证了模型对求解配送中心选址问题的可行性并得到了比较满意的选址结果。

In the negative and interrogative forms, of course, this is identical to the non-emphatic forms.

。但是，在否定句或疑问句里，这种带有"do"的方法表达的效果却没有什么强调的意思。

Go down on one's knees;kneel down

屈膝跪下。。。下跪祈祷