通性的

In this paper, the connectivity axiom and the continuity axiom in Von Neumann-Morgenstern Rational behavior axioms are weakened. Then, a set of axiom for lattice ordered decision-making behavior, which can describe the decision-making behavior more rationally, is constructed. At last, the relative unique existence theorem for utility function is obtained.

根据偏好关系所具有的格序特征，将Von Neumann-Morgenstern理性行为公理体系中的连通性公理弱化为格连通性公理，并相应地弱化连续性公理，得到了一集能更为合理地描述具有"有限理性"的决策行为的格序决策行为公理体系，构造并证明了在格序决策行为公理体系之下，效用函数的存在惟一性定理。

Ed Mitchell, on his way back from the Moon, realised that "the molecules of my body and of the spacecraft and of my partners were manufactured in some ancient generation of stars - and that was an overwhelming sense of oneness and connectedness".

艾德。米切尔在从月球归来的途中感觉到，"我身体里的分子，以及宇宙飞船的和我同伴的，都是早在这个星球的上古年代被合成的--那是一种无法抑制的，对于我们之间一体性和连通性的强烈感受。"

In this paper, based on local compactness in topological spaces, local N-compactness and connectedness in L—topological spaces, we have studied local paxacompactness in topological spaces, local paxacompactness and δ—connectedness in L—topological spaces.

本文以拓扑空间的局部紧性、L-拓扑空间的局部良紧性以及连通性为基础，研究拓扑空间的局部仿紧性、L-拓扑空间的局部仿紧性以及δ-连通性。

The minimality of the virtual backbone is assured by designing optimization algorithm. As a result, it can effectively decrease the overhead of control packets dissemination. Simulation resluts show the correctness and the ability of self- renew.Considering the characteristic of fast-moving in wireless ad hoc networks, we construct a virtual backbone with a independent dominating set. This method can avoid sustaining connectivity between backbone nodes and the bakebone network can be rapidly reconstructed as topology change.

对规模较大、移动较频繁的ad hoc网络，用独立支配集构建虚拟骨干网，克服了骨干节点之间必须维护连通性的问题，使得拓扑变化较快时骨干网的重构能快速实现；采用动态按需路由机制，解决了骨干节点要维护路由表的问题；还利用极大独立集的求解得到极小独立支配集；并通过仿真测试了算法的正确性及自恢复能力。

And by applying the linear dispersion relation of wave, all the properties of wave refraction including wave rays, constant phase lines, phase function and crest lines etc., can be expressed in explicit functions. By introducing an orthogonal curvilinear coordinate along the wave ray and the constant phase line, and with an estimated scale factor, the refraction coefficients along any wave ray can then be determined. The present results are verified by ordinary wave ray theory and some previous numerical results.

就此特例情况在波浪的线性分散关係的应用下，前进波浪折射现象的整体特性，包括波向线、等位相线、位相函数与波峰线皆被导述出明確显然的函数表示；同时引入由沿著波向线与等位相线所构成的完全符合波浪折射几何通性的正交曲线座標，求出其尺度因子后，由能通量守衡原则定出沿著任一条波向线上的折射係数；並由之对往昔纯依两相邻的波向线间的几何类比所给定的折射係数给予导証之。

Based on the topological dimension reduction method presented by B. Zhang et al for the problem of motion planning in the environment consisting of precisely known polygonal or polyhedral obstacles, we further discuss the problem of motion planning for a multi—joint robotic arm.

对由完全精确已知的多边形或多面体组成的障碍环境中的运动规划问题，在张钹等提出的拓扑降维法的基础上，本论文进一步探讨了应用拓扑法的多关节机械手的运动规划问题，其中重点解决了状态空间中连通块的划分问题和连通块之间连通性的判别问题。

After the simulation system based on these algorithm for motion planning is set up, the correctness of partition principles is confirmed by many typical simulation experiments, so does the feasibility of motion planning for multi-joint robot based on topological dimension reduction method.

经过状态空间的划分，得到许多连通块，根据连通块之间的连通性的判别条件，构建特征网，最后根据搜索算法在特征网上搜索连通路径，进而从特征网上的连通路径求出机器人运动的几何路径。

Connectivity is one of the basic properties of topological space. R-strong connectivity is stronger than connectivity, and it has some good qualities.

连通性是拓扑空间的基本性质，R-强连通性比连通性要强，它具有一些良好的性质。

A method dealing with the division of coverage region is discussed in this paper based on certainty coverage. Secondly, under the condition of the connectivity, dynamic programming method is used to optimize the coverage regions and their radiuses, which minimizes the sum of radiuses and reduces the cost of the coverage of the network.

然后在保证网络一定连通性的约束条件下，通过动态规划的方法优化网络覆盖区数量和覆盖半径，使网络内所有覆盖区的半径累加和最小，剔除冗余的节点降低网络的覆盖成本。

However, In the road network condition, the result of the k nearest neighbor quires is rest with the connectivities of road network, not the objects relative positions.

然而，在基于路网的条件下，k近邻查询的结果是取决于路网的连通性的，而不是查询对象的相对位置。

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.

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