In addition, an upper bound of multivariate Gaussian probability for a general convex domain is given based on a geometric observation.
利用已得一维Mills率的估计验证了在部分参数区间上我们的上界估计要优于已有的估计。
Since the feasible domain of each model is in general non-convex, we apply various methods to solve them respectively.
针对每种模型的可行域在一般情况下是非凸的特点，分别采用多种方法求解。
A signal x, which has a sparse representation in a transform domainΨ, can be reconstructed from M = C μ2 logN K compressive measurement exactly with high probability by solving a convex optimization problem of the following form min x1, subject to y =ΦΨx.
在变换域有稀疏表示的信号可以通过解以下形式的凸优化问题，确实以高的概率，由压缩测量值重构。
Second, the robust stability is considered for a class of time-delay Hamiltonian systems which possesse time-invariant uncertainties belonging to some convex bounded polytypic domain.
讨论了一类不确定时滞哈密顿系统的稳定性，这类系统的结构矩阵含有属于某些凸有界多项域的时不变不确定性。
So its optimization result is not perfect for the problem with un-convex feasible domain and constrained monstrosity extremum points.
本文针对这种情况，提出了一种新的算法，从算例的计算结果看，此方法对某些问题进行计算还是可行的。
For very general single location on a closed convex domain, propose a combining algorithm which has global convergence.
针对一般具闭凸集约束的单址选址模型，提出具全局收敛性的组合算法。
By extending Interior Radius Vector Sweeping and combining with Boolean operations, smoothing the convex cavities in the multiply connected domain has been studied. 6.
将内点极径扫描法进行推广，并采用布尔运算的方式，研究了复连通域的磨光问题。
At last, it is proved that when the control domain U is a bounded, closed set, the reachable set is the same as that when the control domain is the convex of U. It is an advancement for original results.
最后证明了当控制区域U是有界闭集时，系统的等时区域与控制区域是U的凸包时的等时区域相同，推广了有限维的结论。
So we propose improvement DV-Hop (IDV-Hop) algorithm. We make beacon nodes divide the network into several approximate regular domains through algorithms based on convex hull. So that unknown nodes can choose suitable beacon nodes to estimate their positions in every domain.
对此本文提出一种改进的算法IDV-Hop算法，通过利于基于凸壳的方法将非规则网络划分为几个近似规则的区域，在各个区域内对未知节点进行位置估计。
A Trust Region Algorithm for Fermat Location on a Closed Convex Domain
闭凸集上Fermat场址问题的信赖域算法
A non-probabilistic reliability index was proposed to measure the fuzziness of the structural performance, and the index was defined in a convex domain a subspace of the standard interval vector space and in its extended space.
在标准区间向量张成的凸域及其扩展空间中，研究截集水平和基于区间分析的结构非概率可靠性指标之间的定量关系。
In finite dimensional space form a bounded open domain, we study some open convex subsets and it's topology, then give a complete metric space.
考虑了在有限维空间中包含在某一有界开区域中的所有有界开凸子集所成空间上的拓扑，给出了一个相关的完备的度量空间。
Domain Decomposition Method change the problem in the knaggy domain to the problem in several convex domains which do not wrap. The whole solution is gained by alternating boundary conditions between Dirichlet condition and Neumann condition on the common boundary.
区域分裂法是将不规则凹凸区域上的求解问题化为多个不重叠凸区域上的求解问题，在公共的边界上用Dirichlet条件、Neumann条件交替迭代得到全区域上的解。
In the first part, convex duality method linearizes convex wealth equation, and the introduction of Lagrange multiplier converts original problem to an unconstrained static optimum problem. At last, we obtain another equivalent optimum problem with convex control domain.
文章前一部分运用凸对偶的方法先将财富方程线性化，Lagrange乘子的引入使最优问题等价与一个无约束的静态最优问题，最后转化为一个凸控制域的最优问题。
For a twice differentiable function defined on a convex domain in R~n, multivariate differential Mean Value theorems are generalized to the high order case, and an example is given.
对凸区域DRn上的二次可微函数，本文采用构造混合函数的方法，将多元函数微分中值定理推广到了高阶的情形，并给出了应用示例。
Defect correction for finite element in convex polygonal domain
凸多边形区域中的有限元方量校正
For solving the fixed point Brouwer problem in the non convex horseshoe zone, a constructing method of positive irrelative mapping is given. SPIKE-LAYERED SOLUTIONS OF A QUASILINEAR ELLIPTIC EQUATION ON CONVEX DOMAIN
给出了马蹄形非凸区域上计算Brouwer不动点计算方法，以及马蹄形非凸区域上拟法锥的构造方法，证明了拟法锥条件成立；凸区域上拟线性椭圆型方程的尖峰解
But the viable domain for frequency optimization is a non-convex set, that is to say improper selection of the optimization methods could lead to no solution to optimization problems, so the selection for method of frequency optimization wants great care.
但是频率优化的可行域是一个非凸集，也就是说对优化方法选择不当可能导致优化问题无解，因此对频率优化方法的选择要极为谨慎。
A domain transformation method based on the property of convex is proposed and its basic properties are given.
本文提出了基于函数凸性的变换区域舍选法算法，该方法可应用于产生具有凸性区间的密度函数随机数。
The new weighted formulas are especially suitable for the case of a local q-convex wedge with non-smooth boundary, so one can avoid complex estimates of the boundary integrals, and the density of integral may not be defined on the boundary but only in the domain.
这些新的带权公式尤其适用于具有非光滑边界的局部q-凸楔形，这时不但可以避免边界积分的复杂估计，而且积分密度也不必在边界有定义，只要在区域上有定义就行。