查询词典 mapping

In addition, the return mapping algorithm is built in negative normal convex cone of violated constraints of level sets to conveniently give an initial structure with multi-constraints, multi-materials and non-design domains.

在这些研究的基础上，提出了适用于一般目标函数、多材料、多约束和多载荷工况的结构拓扑优化的水平集算法4.1，并给出了刚性结构、柔性机构和复合材料微结构设计算法5.1、6.1和7.1，以及大量的数值算例。

Along with the development of convex fuzzy set, people investigate the convexity of fuzzy mapping on convex sets and its application in fuzzy programming .

随着凸模糊集研究的深入与发展，人们讨论了模糊映射在凸集上的凸性及其在模糊规划中的应用。

Xu and Noor had proved the theorem on convergence of three-step iterations for asymptotically nonexpansive mapping on nonempty closed, bounded, and convex subset of uniformly convex Banach space.

王娴 ，何震Xu和Norr已经证明了建立在一致凸Banach空间的一个非空有界闭凸子集上的渐进非扩张映射的三步迭代的收敛定理问题。

H-2: The measurable set-valued mapping F : X - CC is -bounded (n+1)-lower semicontinuos where X is a closed, bounded and convex subset of a n-dimension Bana...

的。 H-3：X是1-维赋范线性空间中的有界闭凸子集，可测集值映射F：X→C_c是2-下半连续的(2-l.s.c。)。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

According to the theory of applied optics and coordinate transformation, the mapping transformation differential method is developed.

根据应用光学知识和坐标变换理论，提出了映射变换差分方法(mappingtransformationdifferentialmethod，MTDM)。

Firstly, we give out the definitions of L-graph and partial L-subgraph, and we ob-tain some properties of partial L-subgraphs. Secondly, continuous mapping is intro-duced respectively between L-graphs and between L-cotowers, and the relationshipbetween the category L-FG of L-graphs and the category FG_L~C of L-cotowers isstudied. At last, we study the finite topological property of the category L-FG, andgive out the concrete constructions of finite product and finite coproduct.

本章首先给出了L-图和部分L-子图的概念，得到了部分L-子图的若干性质；其次，给出了L-余塔的概念，在L-图之间和L-余塔之间分别引入连续映射，研究了L-图范畴L-FG和L-余塔范畴FG_L~G之间的联系；最后，研究了L-图范畴L-FG的有限拓扑性质，给出了L-图范畴L-FG的有限积和有限余积的具体构造。

Objective To explore the technology for cortical language mapping by electrical cortical stimulation.

目的 探讨以皮质电刺激为基础的语言功能区皮质的定位方法。

This set used a unique "cosecant squared" antenna that gave a true representation of the ground surface mapping, rather than a distorted slant-range picture. It's things like this that made life better for bombardiers.

它特有的"余割方形"天线，就是这样也可以让投弹手更安全些。

Cosine 1.30 sine curve mapping, spent ListCtrl, Slider, etc. Controls for beginners learning reference.

正弦余弦三角曲线的绘制，用了ListCtrl，Slider等控件，供初学者学习参考。

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.

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