求解

Fur thermore,it shows the importance and some methods in the solution of the boundary value problems of the point sources .

并阐明点源，即集中分布的量在求解边值问题时的意义和方法。

Then by matching the traction along the branches and the boundary of the strip, Cauchy singular equations were obtained, in which the point dislocation and the distributed dislocation density served as the unknown function.

根据板条边界和裂纹面上的应力边界条件，建立以集中位错强度和分布位错密度为未知函数的Cauchy型奇异积分方程，利用半开型积分法则将该奇异积分方程化为代数方程求解。

As a result of the interpretation of the discrete random walk model,the stability and convergence of the numerical method in a bounded domain are discussed.

接下来提出求解有界区域内的Lévy-Feller对流-扩散微分方程的显式差分格式，并且利用前面随机游走模型中的结论证明了显式格式的稳定性和收敛性。

In order to effectively abstract the texture and denoise but not damage the edge and other important details of image, Meyer (2001) proposed using elements of BV space and G space to characterize cartoon and details of image respectively. The authors present PDE of minimizing energy on the basis of Meyer's work, After the model is discretizated. projection algorithm and the method for ROF model are applied. Thus an image is decomposed into two parts, bounded variation component u and texture with noise υ.

为有效地提取纹理和去噪而不损坏图像的边缘及其他重要细节，Meyer(2001)提出了分别用BV空间和G空间刻画图像的主体和细节部分，笔者在Meyer的图像分解模型基础上，建立能量最小化PDE方程，将模型离散化后，利用投影算法和ROF模型的求解方法，将图像分解为有界变差部分u和包含纹理和噪声的部分υ。

We obtain D3 brahe dual of 1/2 BPS Wilson-t Hooft loop, its vacuum expectation value and SL(2,Z)duality.

我们求解了一类1/2 BPS的Wilson-'t Hooft loop算符，得到了它的真空期望值，并验证了它具有严格的SL(2，Z)对称性。

It is very significant both in theory and practice to study and solve the problem of brain drain in small and medium-sized private enterprises.

对中小民营企业员工流失问题进行求解，具有十分重要的研究和实践意义。

Therefore,it is very significant both in theory and practice to study and solve the problem of brain drain in small and medium-sized private enterprises.

因此，对河南中小民营企业核心人才流失问题进行求解，具有十分重要的研究和实践意义。

To develop a branch and bound method for this problem,a nonlinear integer-programming model was constructed.

为设计求解该问题的分支定界算法，建立了非线性整数规划模型。

To speed up the solution of the problem, a solution method that hybridizes heuristic algorithm with conventional branch and bound method is presented.

文中还讨论了采用启发式算法同传统的分枝定界法相结合以提高问题的求解速度，并给出了一个数值例子。

1 Knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.

详细说明：0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。