助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   intersection 的翻译结果: 查询用时:0.011秒
图标索引 在分类学科中查询
所有学科
公路与水路运输
数学
计算机软件及计算机应用
自然地理学和测绘学
地质学
矿业工程
武器工业与军事技术
自动化技术
地球物理学
更多类别查询

图标索引 历史查询
 

intersection     
相关语句
  交叉口
     Traffic Noise Analysis of Signalized Intersection with Simulation Method
     利用模拟方法进行信号灯控制交叉口道路交通噪声特性分析
短句来源
     Application of VISSIM to Transportation Design and Operation Analysis of Intersection
     VISSIM在交叉口交通设计与运行分析中的应用
短句来源
     The Description of Traffic Flow Mathematical Model of T Intersection
     T型交叉口交通流数学模型的描述
短句来源
     Rules optimization of fuzzy controller for urban single intersection based on GA
     基于GA的城市交叉口信号控制模糊规则优化
短句来源
     Forecasting the Downstream Intersection Traffic Volume by BP Neural Network
     用BP神经网络预测下游交叉口进口交通量
短句来源
更多       
  
     For given operators A ∈ B(H), B ∈ B(K), we investigate the intersection of Weyl spectra ∩_(C∈B_(K,H)) σ_w(M_C) by analyse the spectrum structure of operators and give a complete characterization of the intersection of Browder spectra ∩_(C∈B_(K,H)) σ_b(M_C).
     通过对算子谱结构的分析,当算子A∈B(H),B∈B(K)给定时,给出Weyl谱的∩_(C∈B(K,H))σ_w(M_C)的重新刻画。 这与文献[2]中推论3.7的结果是一致的。
短句来源
     In this paper we give an efficient algorithm for determing the intersection of all minimal coverings in a bipartite graph G,the time complexity of which is O(max {|V(G)|~(1/2),|E(G)|,|V(G)|~2}).
     本文给出了一个求二分图G所有最小复盖的的好算法,其时间复杂性为O(max{|V(G)|~(1/2)。|E(G)|,|V(G)|~2})。
短句来源
     In this paper we give an efficient algorithm for determing the intersection of all minimal coverings in a bipartite graph G, the time complexity of which is O(max {|V(G)|~(1/2),|E(G)|,|V(G)~2}).
     本文给出了一个求二分图G所有最小复盖的的好算法,其时间复杂性为O(max{|V(G))|~(1/2)。|E(G)|,|V(G)|~2})。
短句来源
     Besides, we give a characterization of the intersection. of Drazin spectra ∩_(C∈B_(K,H)) σ_D(M_C) under a certain condition.
     同时给出在一定条件下,M_C的Drazin谱的∩_(C∈B(K,H))σ_D(M_C)的具体表示。
短句来源
     Intersection Mechanism of Deformation Twins with α_2 Plates in γ-TiAl Alloy Deformed at Room Temperature
     室温变形γ-TiAl基合金中形变孪晶与α_2片的截机制
短句来源
更多       
  相交
     A lower limit estimation to intersection number of a class of Lagrangiansubmani folds in T ̄(2n)× CP ̄m×CP ̄m.
     本文给出了T ̄(2n),CP ̄m与CP ̄m的乘积中一类Lagrange子流形相交数的下界估计。
短句来源
     Let G be a group of order 4p4 with Dihedral image D 4p2,by investigating the intersection numbers,it is concluded that there is no Menon difference set in G if p≥ 5(where p is a prime).
     设G是具有二面体群同态象D4p2的4p4阶群,通过考察其相交数得到如下结论:当p是素数且p≥5时,G上的差集不存在。
短句来源
     This paper solved the problem about the intersection of λ_1 fold triple systems and λ_2 fold triple systems where(λ_1,λ_2)=(1,2),(1,3),(2,3).
     本文解决了v阶λ1重三元系和v阶λ2重三元系的相交数问题,其中(1λ,2λ)=(1,2),(1,3),(2,3).
短句来源
     Section Theorems,Coincidence Theorems and Intersection Theorems on H-Spaces with Applications
     H-空间的截口定理重合定理相交定理及其应用
短句来源
     In this article, we study the intersection relations of the components of approximate point spectrum σa(T) with σa(S) and σs (S), T and S being quasisimilar operators acting on a Banach space.
     讨论了Banach空间X上两个算子T,S拟相似时,近似点谱σa(T)的每一个连通分支与σa(S) 以及σ5(S)的相交关系.
短句来源
更多       
  求交
     Torus/Sphere Intersection Algorithm
     圆环面/球面求交算法
短句来源
     INTERSECTION ALGORITHM FOR NURBS CURVES
     NURBS求交算法——曲线部分
短句来源
     Intersection of Composite Triangular Bezier Surface and Plane and its Application
     复合三角Bezier曲面和平面的求交及其应用
短句来源
     Chapter 4 discusses the ray-tracing algorithm, focuses on the intersection algorithm and the improved algorithm. At the last, compares the in bounding-box with the improved algorithm.
     第4章探讨了光线跟踪算法,重点研究了光线跟踪的场景求交算法以及包围盒算法的改进算法,并将内包围盒算法与改进算法进行了对比。
短句来源
     A Resarch on Intersection of Surface in CAD/CAM
     CAD/CAM中曲面求交技术的研究
短句来源
更多       

 

查询“intersection”译词为其他词的双语例句

 

查询“intersection”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  intersection
An algebraicG-varietyX is called "wonderful", if the following conditions are satisfied:X is (connected) smooth and complete;X containsr irreducible smoothG-invariant divisors having a non void transversal intersection;G has 2r orbits inX.
      
We apply these results to intersection theory on varieties with group actions, especially to Schubert calculus and its generalizations.
      
We give criteria for a divisor to be Cartier, globally generated and ample, and apply them to a study of the local structure and the intersection theory of aG-variety.
      
However the compatibility of the canonical base of the modified algebra and of the geometric base given by intersection cohomology sheaves on the affine flag variety was never proved.
      
We derive two consequences: the first is a new proof of Lusztig's description of the intersection cohomology of nilpotent orbit closures for GLn, and the second is an analogous description for GL2n/Sp2n.
      
更多          


点击这里查询相关文摘
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关intersection的内容
在知识搜索中查有关intersection的内容
在数字搜索中查有关intersection的内容
在概念知识元中查有关intersection的内容
在学术趋势中查有关intersection的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社