求解过程

词组短语

solving process

与求解过程相关的网络例句 [注：此内容来源于网络，仅供参考]

The model was solved by the Ritz method, and the orthogonal polynomials generated by the Gram-Schmidt process were employed as admissible function for both disk and blades. With this approach, the matrix derived from kinetic energies becomes diagonal and numerical manipulation can become easy and stable.

采用Gram-Schmidt方法生成正交多项式作为李兹容许函数进行模型的离散化，简化了所得到的频率方程求解过程，有利於求解过程的数值稳定性，并可方便地通过对方程系数性质的分析了解结构振动模态的性质。

This solution can solve problem by original coefficient matrix directly.

该方法不必一开始就去用新的系数矩阵代替原系数矩阵，而是可直接在原系数矩阵上进行求解，只是求解过程中的一些原则与最小化问题的求解原则有所不同。

CBFEC emphasizes direct correspondence of concepts in EC with its software architecture for ease of understanding and using; minimal coupling with specific problem structure for easy adaptation it to solve a large number of wholly different problems; interface-centered design for extendibility. To achieve those objects, the problem-solving method of EC is analyzed and the problem-solving procedure of EC is divided into three interactive aspects: population-based stochastic searching mechanism, problem specific information to implicitly guide the stochastic searching, and the observation and control of the computation procedure of EC. Then the key concepts of EC are identified in those three aspects; the normal implementations of those concepts are summarized; the interfaces represents those concepts in software are abstracted; the collaborations of components through those interfaces are designed. CBFEC is implemented on mainstream component software platform COM/DCOM (Component Object Model/Distributed COM from Microsoft), which includes interfaces definitions, commonly using EC components implemented those interfaces, such as Simply EA component, Steady State EA component, EA component, EA component, Population component, Tournament Selection component, Linear Ranking Selection component, Nonlinear Ranking Selection component, Random Number Generator component, etc, and the collaborations of those components through those interfaces.

具体的做法是把演化计算看作是基于组件的软件工程的一个应用领域：首先分析了演化计算求解问题的一般思路和方法，把演化计算问题求解过程分为："设计基于群体的随机搜索机制"、"研究问题的性质并以此隐含地定义算法的搜索方向"和"求解过程的观察与控制"三个部分；然后分别找出各个部分中的关键概念，总结这些概念现有的一般实现方法，抽取其本质，以此结合设计模式来定义组件软件的接口；通过分析演化计算各个概念之间的相互联系来设计组件软件间通过接口的进行交互的方式；最后还在目前一种主流组件软件开发平台COM／DCOM（微软提出的组件对象模型）的基础上实现了常用的演化计算组件，如简单演化算法组件、稳态演化算法组件、演化算法组件、演化算法组件、种群组件、锦标赛选择策略组件、线性排名选择策略组件、非线性排名选择策略组件、随机数发生器组件等等。

The resource model and organization model reflect the organizational dispersibility as well as the scheduling and dispatching of dynamic resources.

基于该组织模式，对面向过程的虚拟制造联盟生命周期中的虚拟合作模式和协商策略进行了深入研究，并给出了数学模型及其求解算法和求解过程。

We point that the process of function-tree solving is the process of Function-Sets solving, and a function solving method based on extend functional matrix is proposed. Furthermore, aiming at the characters of innovational design, the lossless optimization method is given.

在功能树的求解方法方面，指出功能树的求解过程就是对功能函数的功能集族进行求解的过程，并提出了基于功能矩阵的求解方法，更进一步地针对创新性设计的特点，提出了无损优化的方法。

The paper gives a special discussion of regularization method in inverse problem. On this basis, an ideal solution for ill-posed problem is built-the best disturbed iteration.

论述了反问题的高度非线性及求解的不适定性，分析了反问题求解的各种方法，并对在反问题求解过程中经常遇到的一类离散不适定问题进行了详细地分析和研究，并给出了具体的算法。

By introducing a new concept-Motion Characteristic Transformation Matrix , this thesis presents a top-down solving method to decompose the complex requirement into several simpler ones by sophisticated matrix operation, row and column shifting and velocity character expanding strategy.

作者提出运动特性变换矩阵，将运动类型、运动轴线以及速度特性等三个运动求解过程中所需的运动特性有机地集成于一体，并通过矩阵的行列变换以及基于规则的速度特性扩展策略，将复杂运动需求分解为简单的运动需求后进行求解，从而实现了自顶向下的复杂运动需求的求解。

By the numerical analysis of the ultimate bearing capacity of two- and three-dimensional footing under combined loading mode, the results show that the effect of alteration of underground water lever on bearing capacity of three-dimensional foundation is more than on that of two-dimensional foundation, the effect of soil gravity on bearing capacity of three-dimensional foundation is more than that of two-dimensional foundation. At the same time, the numerical calculation process of ABAQUS indicates that whether the geostatic stress is balanced or not has great effect on the numerical convergence. In view of the effect extent of dilation angle of soil on the ultimate bearing capacity and the failure pattern of foundation, the condition of two-dimensional plane strain is higher than that of the three-dimensional foundation.

复合加载模式下，通过对三维矩形基础和二维条形基础进行数值分析，结果表明：黏性土地基中地下水位的变化，对三维矩形基础极限承载力的影响程度高于对二维条形基础的影响；在求解地基极限承载力的过程中，土体重度对三维矩形基础的影响明显高于对二维条形基础的影响，同时ABAQUS数值计算过程表明，地基土体地应力能否合理平衡，对数值求解过程中是否收敛有很大的影响；就土体剪胀角对地基极限承载力的影响程度而言，二维平面应变情况下土体剪胀角对极限承载力的影响比三维情况下的影响更明显，即土体剪胀角对条形基础极限承载力的影响高于三维矩形基础。

The algorithms make the solution process correspond to the process of producing, growing and maturating of the T cells, the make use of the powerful maintaining variety mechanism in the developing process of Tcells to design the selection mechanism of the algorithm in order to improve the capability of the algorithm.

该算法将问题求解过程与免疫应答机制中 T细胞的产生、成长及成熟过程相对应，利用 T细胞发育过程中强大的多样性维持机制来设计算法的选择机制，提高算法的求解性能。

A user interface for CPES-V language has been designed, which is a parallel expert system tool language V language is convenient for user, simple and clear in expression. It integrates blackboard discription, knowledge_source discription and problem solving model discription in one entity.

本文为CPES设计了一种使用方便、表达简洁的用户界面——V语言，V语言是一种并行专家系统工具语言，它集黑板问题求解过程中的黑板描述、知识源描述、问题求解模型描述为一体，大大缩短了用户使用黑板模型进行问题求解试验的周期，本文还讨论了使用V语言进行问题求解的一些具体问题，如任务分配问题、存贮容量分配问题、问题求解步骤等。

与求解过程相关的网络解释 [注：此内容来源于网络，仅供参考]

boundary element method：边界元素法

在计算过程中,吾人以边界元素法(Boundary Element Method)为基础[10]. 在使用拉凡格氏法求解本逆向问题后,以数值实验为基础,可得以下结论:拉凡格氏法仅需少量之量测点数、非常短之计算时间及不甚精确的外形起始猜值,即可正确的预测出结霜过程中霜之热扩散系数及厚度.

Dynamic Programming：动态规划

概念及意义 动态规划(dynamic programming)是运筹学的一个分支,是求解决策过程(decision process)最优化的数学方法. 20世纪50年代初美国数学家R.E.Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时,

principle of optimality：最优性原理

Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时,提出了著名的最优性原理(principle of optimality),把多阶段过程转化为一系列单阶段问题,逐个求解,创立了解决这类过程优化问题的新方法-动态规划.

poisson equation：泊松方程

该程序以差分格式求解方程组,即泊松方程(Poisson Equation)和二维复数坐标系中空间电荷偏移方程(Space Charge Drift Formula),求解时考虑粒子的粒度统计分布与相应的荷电过程.

knowledge representation：知识表示

现代AI研究的两个相互联系的核心问题:知识表示(knowledge representation)和搜索(search). 表现力(expressiveness)和效率(efficiency)是评价只是表示语言的主要尺度. 状态空间搜索为我们提供一种形式化问题求解过程的手段,启发(heuristic)使我们可以为这个过程注入智能.

resolving：解析过程

resolverrotor 求解仪转子 解算仪转子 | resolving 解析过程 | resolvingability 解算能力 分辨能力 分解力 鉴别能力 辨别能力

revise：修正

是分析多目标、多准则的复杂公共管理间题的有力工具,它最适宜于解决那些难以完全用定量方法进行分析的公共决策问题. 一个经典的CBR问题求解过程通常分为4个阶段:检索(retrieve)、重用(reuse)、修正(revise)和存储(retum),如图1所示.

SIP：强隐过程

模型同时考虑了电场力、洛仑兹力和电子压强梯度对传导电流的贡献,由电子动力学方程和粒子微观碰撞理论推导出电流方程,由麦克斯韦方程组推导出电磁场控制方程,采用包括强隐过程(SIP)迭代法在内的十种迭代方法求解离散的电磁场方程.

solver：求解器

KMAS由网格生成器(Mesher),前处理器(Top),求解器(Solver),后处理器(View)四部分组成. 可对一般(一次)成形、多阶段成形、回弹变形过程进行仿真[1],成形方式包括工业常用的单动与双动压机两种.

solving process：求解过程

solver 解算机,解算器,解算装置,求解器=>ソルバー | solving process 求解过程 | SOM, Solar Monitor 太陽光計測装置