- 更多网络例句与求值子相关的网络例句 [注：此内容来源于网络，仅供参考]
-
That is,the truth value of an implication compound proposition is just the compatibleness degree of the actual implication degree or implication rate between its sub-propositions with the language value that describes the feature of implication relation in this compound proposition.
关于复合命题A→B本身的真值，传统逻辑中是由其支命题A、B的实际真值通过某种真值运算(二值逻辑中用"实质蕴涵"，模糊逻辑中有众多的"蕴涵算子")而求得。我们称这种求蕴涵型复合命题真值的方法为逻辑方法。
-
The key technique in the MUSIC algorithm is the signal subspace extraction which can be found from the eigen decomposition of the sample covariance matrix of the antenna receive signal. The eigen value decomposition of a Hermitian matrix is implemented by using the QR algorithm, and the signal subspace is constituted by collecting the significant eigen vectors.
在复合信号分类演算法中的重要关键为信号子空间与杂讯子空间的分解，这两个子空间可以利用对天线收到信号的取样共变异矩阵做特徵值分解中求出，本篇并以QR演算法实现厄米特矩阵之特徵值分解，信号子空间便是由分解后的特徵向量所集合而成。
-
To solve this problem, an algorithm which can adaptively determine the double thresholds based on gradient histogram and minimum interclass variance and improve Canny operator was proposed. Theory and experiments show that the proposed algorithm is effective and correct.
为了对Canny算子的这一缺陷加以改进，提出了基于梯度幅度直方图和类内方差最小化原理自适应地求取双阈值的算法对大津法作出改进，理论推导和实验结果证明了该算法的正确性和有效性。
-
By means of the numerical methods, the root of the resonance frequency equation is solved, and by means of Ansys software and the finite element method, the torsional vibration mode of the thin ring is analyzed, and the academic value and the simulant value of the resonance frequency are compared.
利用数值方法，求出了共振频率的理论值；并利用Ansys软件，对薄圆环振子进行了有限元模拟，得到了其共振频率的模拟值。
-
The left singular vector of the projection has been tracked by the projection approximation subspace tracking algorithm. Then the modal parameters are obtained by least square method. At last an experiment is made using a cantilever beam to prove the efficiency and stability of the method by changing the frequency band of the exciting signal.
通过子空间跟踪算法，不断跟踪计算投影的左奇异值向量，再利用最小二乘法求出系统的模态参数，最后用悬臂梁作为实验模型，通过不断改变系统激励的频带范围，验证方法的有效性及稳定性。
-
The numerical calculation commonly used for the Delphi process more than 100, including solutions of linear algebraic equations, interpolation, numerical integration, special, function approximation, eigenvalue problems, data fitting equation Root and solve nonlinear equations, functions and the extreme optimization, statistical data description, Fourier transform spectra, solution of ordinary differential equations reconciliation partial differential equations.
本书共有数值计算中常用的Delphi子过程100多个，内容包括解线性代数方程组、插值、数值积分、特殊函数、函数逼近、特征值问题、数据拟合、方程求根和非线性方程组求解、函数的极值和最优化、数据的统计描述、傅里叶变换谱方法、解常微分方程组和解偏微分方程组。
-
Stack will be the first to use infix form of the formula into the form of the suffix and then form the basis of the suffix from the beginning of leaf nodes corresponding binary tree structure Finally after by traversal of the tree, and the value of the subtree, that is, for every arrival a node, the value of its sub-tree has been calculated, when the reach the root node, the obtained value is the formula of true value.
首先利用堆栈将中缀形式的公式变为后缀形式；然后根据后缀形式，从叶结点开始构造相应的二叉树；最后按后序遍历该树，求各子树之值，即每到达一个结点，其子树之值已经计算出来，当到达根结点时，求得的值就是公式之真值。
-
First,the determinant is regarded as a function of or- der n and denoted by D;Second,the determinant is expanded by row or by column,then the relation in both of Dand subdeterminants will be examined in details to set up certain a recursion,generally speaking,it must be a homogenous or a non homogenous recursion;fi- nally the coefficients of the general solution are found out with the aid.
给出了用递归关系方法求任意 n 阶行列式的值的一般方法：首先，把已知的 n 阶行列式看作为阶数 n 的一个函数，记为 D；其次，按行或按列展开这个行列式，并仔细观察存在于余子式及 D里的关系，建立关于 D的某一递归关系，此关系总为一个齐次的或非齐次的递归关系；最后，借助于 D(0)、D(1)和D(2)等求出递归关系的通解的系数。
-
The crossover operation in the traditional GA operating is that choose two chromosome cross only at random also you can cross a bit, match and cross partly, cross order and cross cycle etc.
传统GA算法中的交叉操作，是随机选取两个染色体进行单点交叉(也可以多点交叉、部分匹配交叉、顺序交叉和周期交叉等等)，但是不管是采用何种交叉操作，新的子代染色体某一基因位上的值都是由两个父代染色体中相应基因位值经过一定交叉运算(直接交换或经算术运算等)所得到的，采用这种交叉算子操作使群体经过多次迭代后群体中的个体开始出现极大的相似性，因此照此下去就会出现早期收敛现象，使得算法的收敛速度非常慢甚至只能求到问题的局部最优解。
-
The crossover operation in the traditional GA operating is that choose two chromosome cross only at random also you can cross a bit, match and cross partly, cross order and cross cycle etc.
传统GA算法中的交*操作，是随机选取两个染色体进行单点交*(也可以多点交*、部分匹配交*、顺序交*和周期交*等等)，但是不管是采用何种交*操作，新的子代染色体某一基因位上的值都是由两个父代染色体中相应基因位值经过一定交*运算(直接交换或经算术运算等)所得到的，采用这种交*算子操作使群体经过多次迭代后群体中的个体开始出现极大的相似性，因此照此下去就会出现早期收敛现象，使得算法的收敛速度非常慢甚至只能求到问题的局部最优解。
- 更多网络解释与求值子相关的网络解释 [注：此内容来源于网络，仅供参考]
-
evaluation：计算
~(match) 在 AWK 之涵意简述如下 :的子字符串; 若含有该成立(true) 则执行其对应的 Actions.之前所介绍的各种 Patterns, 其计算(evaluation)后结果为一逻辑值上式利用&& (and) 将两个 Pattern 求值的结果合并成一个逻辑值.当AWK读入的资料列使得 Pattern1 成立时,
-
interpolation problem：插值问题
算子插值 interpolation of operators | 插值问题 interpolation problem | 插值求积公式 interpolation quadrature formula