查询词典 sequencing problem

The Neumann Problem of Laplace equation is an important elliptic boundary value problem and has extensive applications.

Laplace方程的Neumann问题作为一类重要的椭圆边值问题，有广泛的运用背景。

In the bounded linear operator approximation theory of Hilbert Space,the isolate point of operator essential spectrum is always a problem. In this paper,a general method to treat this problem is given.

孙辉在Hilbert空间线性算子逼近论中，算子本质谱的孤立点通常是处理一些问题的主要障碍之一，本文给出处理算子本质谱的孤立点的一般方法。

Under some reasonable assumptions of the'Distribution Matrix', the Riemann Problem with piecewise constant initial data is proved to have a unique Riemann Solver; furthermore, using'Wave Front Tracking Method'and properties of the'Generalized Characteristics', we prove the existence of weak entropy solution to the Riemann Problem with arbitrary initial data of bounded Total Variation.

在"分布矩阵"满足合理的假设前提下，证明了具有分片常值初始条件的黎曼问题的黎曼解算子的存在唯一性；并进一步运用"波前追踪法"和"广义特征"等得到了具有任意有界全变差初值条件的广义黎曼问题的弱熵解的存在性。

Biot's consolidation theory was used to serve as a frame working with the nonlinear elastic model or with elasto-plastic model in the program. Nonlinear elastic model includes Duncan-Zhang model, Gong Xiannan Ko consolidation model and the model proposed in chapter 2. Elasto-plastic model in the program includes Mohr-Coulomb model, Drucker-Prager model and the bounding surface model developed in chapter 3. The program can be used in cases of plane problem and axisymmtric problem.

FOR，针对软土地基的变形特点，该程序以Biot固结理论为框架，可以进行线弹性，非线性弹性和弹塑性的有限元计算，在非线性弹性模型中包括了Duncan—Chang模型、龚晓南Ko固结模型和本文建立的非线性模型，弹塑性模型中包拓了Mohr—Coulomb模型，Drucker—Prager模型以及本文中建立的边界面模型，该程序可以考虑平面问题也可以考虑轴对称问题。

The designated verifier signature scheme was proposed using the root problem and conjugacy search problem in the braid group. Analysis shows that it is a simple, fast and efficient scheme with security features.

介绍了辫群的基本概念和辫群中的困难问题，在此基础之上，利用辫群中左右子群的元素可交换性，提出了一个基于辫群上的共轭查找问题和p次根问题的指定验证者的签名方案，通过分析可知，该方案具有简单实用、算法速度快和高效安全的特性。

" New brain truster ": To whole tripartite pays an industry for, a problem that cares most pays license tag namely extend problem, but did not send all the time to now, do you feel the Central Bank is in what is this respect to be stemmed from to consider?

新智囊》：对于整个第三方支付行业来说，最为关心的一个问题就是支付牌照的发放问题，但是到现在一直没有发下来，您觉得央行在这方面是出于什么考虑呢？

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

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

Secondly, the research methods of the pallet loading problem are induced. Branch and Bound Method is analysed. Upper bounds for the Pallet Loading Problem are summerizaed.

接着，归纳了装盘问题的研究方法，分析了分支定界方法，重点总结了装盘问题中的定界算法。

When problem scale is small, we can adopt many classical algorithms such as linear programming integer programming, branch and bound method to solve this problem.

当问题规模较小时，可用线性规划、整数规划、动态规划等经典算法求解。

Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.

此外，当优化问题具有某种特殊性质时，我们能给出更加简便的松弛化方法，如考虑广义几何规划问题，能充分利用其特殊结构，建立了广义几何规划问题的松弛线性规划问题；在分枝定界技术的基础上，提出了一个求广义几何规划全局解的线性松弛算法；证明了算法的收敛性。

Don not attempt to do something which you can not to do.

不要企图做那些办不到的事情。

The expression of CTGF and TNF-αweredetected by immunochemistry and the number of Clara Cells was calculated.

光镜下观察肺组织的病理变化，采用免疫组化染色观察肺组织中结缔组织生长因子和肿瘤坏死因子-α的表达和Clara细胞的数量。