查询词典 problem

Matt: This is not our problem. This is your problem.

这不是我们的问题，是你们的问题。

According to the existence results of general equilibrium problems and vector equilibrium problems have been studied more and more. Inspired and motivated by these research results, this paper is devoted to study systematically a class of equilibrium problems, which is unify and extension of a large number of known equilibrium problems and variational inequalities problems. The research is carried on from three aspects.Firstly, in finitely continuous topological spaces, we introduce four new types of the system of generalized vector quasi-equilibrium problems, and we derive some existence results of a solution for the system of generalized vector quasi-equilibrium problems via the maximal element theorems in product finitely continuous topological spaces.Secondly, in complete metric spaces, we provide the Ekeland variational principle to equilibrium problems with set-valued maps. And via the Ekeland variational principle, existence results for vector equilibrium problem with set-valued maps and the system of vector equilibrium problem with set-valued maps.

针对一般的均衡问题和向量均衡问题解的存在性，已有许多研究成果，受这些成果的启发，本文主要从理论上较为系统地研究了一类均衡问题，它统一和推广了许多已有的均衡问题和变分不等式问题，研究分有三个方面；首先，在有限连续拓扑空间中，我们提出了四类广义向量拟均衡系，并借助于有限连续拓扑空间中的极大元定理讨论了这四类均衡系问题的解的存在性问题，然后，在完备度量空间中，我们给出了关于集值均衡问题的Ekeland变分原理，并利用Ekeland变分原理分别讨论了集值向量均衡问题和集值向量均衡系问题的解的存在性。

Via connecting the maximal module ideal point algorithm with the power coefficient under Kuhn-Tucker condition, the bilevel multiobjective programming problem is changed to a singular-level singular-objective constraint programming problem.

给出双层多目标决策问题数学模型的一种解决方法，把带权极大模理想点法和Kuhn-Tucker条件结合起来，从而把双层多目标规划问题转化为单层单目标约束规划问题，进而求得原问题的弱有效解。

One of the classical method of the problem of finding zeros of maximal monotone operator is proximal point algorithm, which solve the problem by solving a series well-conditioned sub-problems.

1我们首先给出投影松弛邻近点算法，用来求解给定区域内的零点，其每一步迭代可以是不精确的。

The problem that under what conditions the - resolvent operator of a maximal TJ - monotone set-valued mapping is a Lipschitz continuous single-valued mapping on whole space, which also answers the open problem mentioned above, is studied on finite dimensional Euclidean spaces.

借助于图收敛理论证明了有限维欧氏空间中的两个极大单调集值映射的和映射在较弱条件下仍是极大单调集值映射，并在此基础上讨论了一般集值变分包含问题解集的凸性、闭性和有界性。

On the base that two comparison theorems are established,applying the fixed-point theorems,we investigate the existence of maximal and minimal solutions forfirst order initial value problem and the JKjperiodic boundary value problem of discontinuous differential-integral equations of mixed type in partial-ordered Banach spaces,respectively.

在建立了两个比较定理的基础上，我们应用不动点定理，分别研究了半序Banach空间中不连续的一阶混合型微分-积分方程的初值问题与周期边值问题最大解与最小解的存在性。

Since the stability of the neural network don't require the convexity of the original maximin problem, the obtained results can be applied to solve a class of nonconvex optimization problem.

由于稳定性分析中不需要原极大极小问题的凸性，该网络可以用来求解一类非凸优化问题。

It was proposed in this paper that the method combined Neural Networks with Maximum Likelihood method was used to solve this inverse problem. It solved the problem of local minima during iteration process, and also improved the precision of estimation.

本文提出了神经网络与极大似然估计相结合的方法，解决了求解上述反演问题中迭代过程发散和陷入局部最优的问题，并且得到了较高的估计精度。

In this paper we equate the problem of predicting the disulfide bonding in proteins to a problem of finding the graph matching with the maximum weight.

本文将一个蛋白质结构中二硫键的预测问题，等价为一个寻找图的最大权的匹配问题。

It is related with an artificial problem, called the maximum simple sharing problem.

证明了最大简单共享问题是NP-hard的，给出了一种简单的贪心算法，并证明该贪心算法的近似度为3。

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

屈膝跪下。。。下跪祈祷