共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
7.
As a member of robot families, climbing robots have become one of the research hot-spots in the robotic field recently and Gekko gecko (G. gecko) has been broadly seen as an ideal model for climbing robot development. But for gecko-mimic robots, one of the key problems is how to design the robot's foot. In this paper, (1) high-speed camera recording and electrophysiological method are used to observe motion patterns of G. gecko's foot when it climbs on different oriented surfaces; (2) nerve innervations of gecko's toes to motion and reception are studied. It is found that the five toes of the G. gecko can be divided into two motion and reception divisions, and also its motion and reception are modulated and controlled hierarchically. The results provide important information and exclusive ideas for the foot design and control algorithm of gecko-mimic robots. 相似文献
8.
《武汉大学学报:自然科学英文版》2020,(2)
An H-covering(resp.decomposition) of a graph G is a set of subgraphs of G,{H_1,H_2,…,H_k} such that H_1 is isomorphic to H for eachi,and each edge of G belongs to at least(resp.exactly) one of the subgraphs H_i,fox 1≤i≤k.An H-covering(resp.decomposition) of a graph G is a magic H-covering(resp.decomposition) if there is a bijection f:V(G)∪E(G)→{1,...,|V(G)|+|E(G)|} such that the sum of labels of edges and the vertices of each copy of H in the decomposition is a constant.If G admits a unique H-covering H and H is a magic H-covering of G,then G is H-magic.In this paper,we show that if G admits a magic H-covering(resp.decomposition),and satisfies some other conditions,then a union of k vertex joint graph G,kG,and a graph obtained from kG,Gk admit a magic H-covering or decomposition. 相似文献
9.
10.
讨论群的阶与群的不可约特征标个数的商和群的结构之间的关系,定义μ(G)=|G|/|Irr(G)|.得到了
定理1 若G是非交换有限群,μ(G)=2。则cd(G)={1,2},|G|=3,且|G|=6|Irr|(G)|,其中Irr1(G)表示G的所有非线性不可约特征标.
定理2 对非交换有限群G有
(1)设P为|G|的最小素因子,设cd(G)={1,m1,m2,…,m4},1〈m1〈m2〈…〈md,则μ(G)≥pmi^2/(mi^2+p-1)等号成立当且仅当d=1且|G’|=P.
(2)若|G/G'|=1,则μ(G)≥12,且μ(G)=12当且仅当G≈A5。
(3)若|G/G'|=2,则≈(G)≥2,且≈(G)=2当且仅当G≈S3. 相似文献
13.
14.
根据流场的叠加原理,用平面点源、点汇、二元直匀流叠加而成的流场模型,模拟某型飞机机身的表面流场。该流场模型的主要参数与机身几何参数一一对应,只要代入机身几何数据,就可以求出该模型的精确表达式。再根据实际飞行条件,把该流场模型转化为三元流场,根据流场特性,可以确定机身表面的压力分布规律。通过与该型飞机实验数据的比较可知,此模型及计算程序精度较高,具有普遍的适用性。 相似文献
15.
主要讨论有限链L上的分配性方程F( G1( x,y),z)=G2( F( x,z),F( y,z))。分别针对以下情况对上述分配性方程的解进行特征刻画:(a) F为光滑三角模,G1=G2为光滑三角余模(F为光滑三角余模,G1=G2为光滑三角模);(b)F为S-蕴涵(或R-蕴涵),G1为光滑三角模且G2为光滑三角余模;(c) F为S-蕴涵(或R-蕴涵),G1为光滑三角余模且G2为光滑三角模;(d) F为S-蕴涵(或R-蕴涵),G1和G2均为光滑三角模;(e) F为S-蕴涵(或R-蕴涵),G1和G2均为光滑三角余模。 相似文献
16.
17.
关于图的第二特征标R2(G) 总被引:10,自引:2,他引:8
毛建树 《青海师范大学学报(自然科学版)》2004,(1):18-22
对任意图G,h(G,x)表示图G的伴随多项式,R2(G)表示图G的第二特征标,本文刻画了R2(G)=-2,-1,0,1,2的全部连通图。 相似文献
18.
二部图的[r,s,t]-着色 总被引:4,自引:0,他引:4
给出了二部图G的[r,s,t]-色数的界及它达到下界时的条件,讨论了星作为特殊二部图的[r,s,t]-色数,得到的结果为若G是二部图,任意v1,v2∈V△,v1v2 (∈/)E(G),任意u∈V△, u1∈NG(u),使得dG(u1)=1,且s≥2t,r≤t,则χr,s,t(G)=(△-1)s+1;若G是二部图,且r≥(△-1)s+2t,则χr,s,t(G)(G)=r+1;若G是二部图,且(△-1)s+t〈r≤(△-1)s+2t,则χr,s,t(G)≤(△-1)s+2t+1;若G是二部图,则r△+1≤χr,r,r(G)≤r(△+1)+1。 相似文献
19.
张丽 《云南大学学报(自然科学版)》2004,26(B07):16-18,22
给定一个阶为n的简单图G=(V;E),其中α(G)≥4,及1个正整数k≥2,考虑在领域条件下G划分成k条点不交路的问题,并得到下面的结果:对G中任何4个独立点x1,x2,y1,y2,满足领域条件,1NG(x1)∪NG(x2){ }NG(y1)∪NG(y2)1≥n-k-1,则要么G能划分成k条点不交的路,要么G属于一类例外图G′。 相似文献
20.
证明如下结论:设G是连通、N2-局部连通、δ≥6的K1,4-受限图,如果G中不含有同构于G1,G2或G3的导出子图H。则G含哈密顿圈. 相似文献