Level set and linear operator classes in menger - pn space 空间的线性算子类
2.
The level - set method for open mapping theorem and closed graph theorem of menger spaces 空间的开射及闭图定理
3.
Coincidence point theorems for multi - valued mappings in menger probabilistic metric spaces 概率度量空间中多值映象的重合定理
4.
On linearly topological structure and orthogonality of menger probabilistic inner product spaces 概率内积空间的线性拓扑结构和正交性质
5.
Do you believe in ghosts ? armed with a newly invented material called the menger sponge , a team of scientists led by hashimoto yousuke eguchi cap . . 猜拳，是一个猜心的游戏。犹如爱情，没有必胜秘笈，也没有方程式去捉摸对手，要赢，就只有全情投入地猜！
6.
Hashimoto and his team set the ghost child loose for ye to follow . with his eyes coated with menger sponge spray , ye is able to see the ghost 在调查的过程中，他看见小孩的双眼之间有一条细丝，隐约之间，细丝连接上某种神秘的力量，支持维系著小孩的鬼魂。
7.
Do you believe in ghosts ? armed with a newly invented material called the menger sponge , a team of scientists led by hashimoto yousuke eguchi captures the energy of a ghost child 一组由科学家桥本良晴江口洋介饰演所领导的科学小组，利用可以捕捉能量的发明孟杰海绵，捕抓到世界上第一只鬼。
8.
In this respect , modern austrian economics school and their market process theory , which are founded by menger and then developed by mises and hayek , could provide a new theoretic perspective for analyzing and justifying the micro - economic intervention 在这一方面，由门格尔奠基并经米塞斯、哈耶克等发展起来的现代奥地利学派及其市场过程理论可以为我们分析和判断微观经济干预的合理性提供一个新的理论视角。
9.
The paper will study the upper questions based on the two interconnection networks . first , we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second , with the rapid progress in vlsi , the failing probability of processors and links is very low , the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary , we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time , the result is the same as the hypercube . we also give a related algorithm in o ( n ) time , and the length of the longest path ; third , we apply cluster faun tolerance introduced by q . - p 根据menger定理， n -维交叉立方体可以容纳n - 1个故障顶点，我们给出了它的时间复杂度为o ( n )的容错路由选择算法及其最长路径长度分析；在此基础上本文证明， n -维交叉立方体的条件连通度为2n - 2 ( n 2 ) ，并给出了相应时间复杂度为o ( n )的算法及其最长路径长度；除此之外，本文还证明当n -维交叉立方体中的故障簇个数不大于n - 1 ，其直径不大于1 ，故障顶点总数不超过2n - 3 ( n 2 )时，交叉立方体中任两个无故障顶点都至少有一条可靠路径。
