1) Panorama of Pointing Fixed-point
环绕定点的全景图
2) multi-perspective panorama
多视点全景图像
1.
A novel method was proposed to create a multi-perspective panorama automatically.
提出了一种多视点全景图像自动生成的新方法。
3) stability of the holograms
全息图的环境稳定性
4) node-encircling
节点环绕
1.
Aimed at solving the limitation of the node-encircling p-cycle(NEPC)algorithm in the highly connected wavelength-division multiplexing(WDM)optical mesh network,a two-hop logic traversing based node-supplement p-cycle algorithm is proposed.
针对节点环绕算法NEPC在连通度较高的WDM光网络中的局限性,基于两跳转发业务的逻辑跨接链路,在NEPC算法的基础上提出一种新型增补节点P圈算法。
5) linking theorem
环绕定理
1.
Rabinowitz s linking theorem in critical point theory,the existence of T-periodic solution to second-order Hamiltonian system under the superquadratic condition was demonstrated.
Rabinowitz的环绕定理证明了二阶Hamilton系统在新的超二次条件下周期解的存在性。
2.
Via Linking Theorem and some estimates about the solutions,we consider a semilinear elliptic problem:-△u-μ/(|x|2)u=k(x)|u|2*-2u+λu,u∈H01(Ω),when k(x) satisfies some conditions,we can prove the existence of a nontrivial solution.
主要应用环绕定理及一些解的估计来讨论一类半线性椭圆方程:-△u-μ/(|x|2)u=k(x)|u|2*-2u+λu,u∈H01(Ω),当k(x)满足一定条件时,方程存在一个非平凡解。
3.
Using the Linking theorem and delicate estimates to study the existence of a nontrivial solution for the following semilinear elliptic equation with singularity at zero:-Δu+k(x)｜x｜2u=｜u｜2*-2u,u∈D1,20(Ω), where k(x) satisfies some conditions and 2*=2N/(N-2)(N≥3).
应用环绕定理以及精确估计来讨论一类在零点有奇性的超线性椭圆方程:-Δu+k(x)x 2u=u 2*-2u,u∈D1,0 2(Ω),其中k(x)满足一定的条件,2*=2N/(N-2)(N≥3),可以得到一个非平凡解的存在性。
6) Local linking
环绕定理
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条