全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 复杂性 在 数学 分类中 的翻译结果: 查询用时：0.047秒
 历史查询

 复杂性
 complexity
 Research on Complexity of Evolution in the Integrated Supply Chain Management System 集成供应链管理系统动态演化的复杂性研究 短句来源 Research on Complexity and Coordinated Development of "Higher Education-Economy" Composite System “高等教育—经济”复合系统的复杂性及其协调发展研究 短句来源 Research on The Complexity Oriented Digital City 面向数字城市的复杂性研究 短句来源 THE TIME COMPLEXITY OF TRIDIAGONAL TOEPLITZ SYSTEMS 关于三角形Toeplitz系统的复杂性 短句来源 Complexity Analysis of Some Problems in Finite Automata 有限自动机上几个问题的复杂性分析 短句来源 更多
 economic complexity
 Although scholars in economics in the west have theoretically elaborated the factors, which contribute to the formation of the optimal capital structures in enterprises, the results of empirical study are not completely consistent due to the economic complexity and peculiarity of economy in each country. 尽管西方学者对企业最佳资本结构形成的因素作了许多理论阐述,但由于现实经济的复杂性及各国经济的特殊性,实证检验的结果并不完全一致。 短句来源
 information complexity
 Advances in the Optimization of Direct Methods and Information Complexity for Approximate Solution of Operator Equation 算子方程近似解直接方法的优化和信息复杂性研究进展 短句来源
 “复杂性”译为未确定词的双语例句
 (2) There is a factor 5/2 algorithm to this problem, it runs in polynomial time O(n logn). (2)我们设计了近似值为5/2的近似算法来解决该问题,所设计的算法的复杂性为O(n logn)。 POLYNOMIALITY OF A HIGH-ORDER FEASIBLE INTERIOR POINT METHOD FOR SOLVING THE HORIZONTAL LINEAR COMPLEMENTARITY PROBLEMS 一个求解水平线性互补问题的高阶可行内点算法的多项式复杂性 短句来源 An O(|v|~(1/2)*|A|) s-t Connectivity Algorithmne 复杂性O(│v│~(1/2)*│A│)s-t连通度算法 短句来源 Information-based Complexitty of Approximately SolvingMultidimensional Fredholm Integrel Equations whithKernels in H Class 核属于H函数类的多维Fredholm积分方程类近似解的计算复杂性 短句来源 THE ε-COMPLEXITY OF INTEGRAL EQUATIONS 积分方程的ε复杂性 短句来源 更多

我想查看译文中含有：的双语例句

 complexity
 An infinitesimal characterization of the complexity of homogeneous spaces A characterization of the complexity of a homogeneous space of a reductive groupG is given in terms of the mutual position of the tangent Lie algebra of the stabilizer of a generic point of and the (-1)-eigenspace of a Weyl involution of. In particular, we prove an integral formula for the degree of an ample divisor on a variety of complexity 1, and apply this formula to computing the degree of a closed 3-dimensional orbit in any SL2-module. Complexity of Homogeneous Spaces and Growth of Multiplicities The complexity of a homogeneous space G/H under a reductive group G is by definition the codimension of general orbits in G/H of a Borel subgroup B\subseteq G. 更多
 economic complexity
 Economic complexity as network complication: Multiregional input-output structural path analysis Due to the hydrological and socio-economic complexity of water use within river basins and even sub-basins, it is a considerable challenge to manage water resources in an efficient, equitable and sustainable way. Adopting this view of economic complexity is just one way of looking at the problem. It seems clear that during the Neolithic, social and economic complexity was far more multi-tiered than previously thought. In response, this paper has outlined two caveats that underscore the economic complexity of devolution. 更多
 information complexity
 One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. On the basis of non-linear dynamics, the paper uses a Lempel-Ziv complexity measure and presents a new definition of the information complexity rate: cc(n). Of critical importance are the relative magnitudes of the information complexity of the concept to be learned and the complexity of the implementation hardware. This paper considers the realizability of quantum gates from the perspective of information complexity. After a formal statement of the problem, some theorems are provided identifying the conditions necessary and sufficient for efficient learning, with respect to measures of information complexity and computational complexity. 更多
 In this paper the importance and complexity of the problem of atmos- pheric diffusion is discussed;eight diffusion formulae from point source are reviewed,four being of semi-emprical approach and other four being of sta- tistical approach. 本文阐述了大气中点源扩散问题的重要性和复杂性;扼要评介了近代有关点源扩散的8种模式。 In accordance with Doolean Difference we have in many documents put out the algorithm of the complete test sets. Its prominnet features are the clarity and precision of deduction, However its shortomings are: (1). The accurate value we obtained when there is no fault between test code and the combinational logic network cannot be decided immediately; (2). High Complexitg of computation exists and especially in the structure of the reconverging fan-out.I herein propose the conception of Boolean orientable difference... In accordance with Doolean Difference we have in many documents put out the algorithm of the complete test sets. Its prominnet features are the clarity and precision of deduction, However its shortomings are: (1). The accurate value we obtained when there is no fault between test code and the combinational logic network cannot be decided immediately; (2). High Complexitg of computation exists and especially in the structure of the reconverging fan-out.I herein propose the conception of Boolean orientable difference and the path along with Boolean Difference, in the meantime, taking this proposition as a basis I am trying to establish the algorithm of combinational logic network fault diagnosis test sets.I believe the couple of the shortcomings mentioned above can be overcome. 许多文章利用布尔差分的概念建立故障完全测试集的算法。其优点是推导清晰严谨,但其缺点是,一、所求得的测试码对应组合逻辑网络无故障时的正确输出值不能立即确定。二、计算复杂性高,特别对扇出再收敛型结构更为如此。本文作者提出布尔方向差分和沿通路布尔差分的概念,并以此为基础建立一种组合逻辑网络故障诊断测试集的算法。上述两个缺点可以克服。 In this paper a Sufficient and necessary Condition that decide a directed graph whether a directed enlerian is put forward. And give an algorithm that Search a directed Euler tonr in the directed eulerian. In addition, the algorithm that Search a shortest Euler tresil in directed noneulerian is given also. Making use of above result, We Can get a shrtest function test Sequence of Sequential Circuits, finally, that the algorithm Complexity is polynomial for the state graph of the seqnential Circuits is proved.... In this paper a Sufficient and necessary Condition that decide a directed graph whether a directed enlerian is put forward. And give an algorithm that Search a directed Euler tonr in the directed eulerian. In addition, the algorithm that Search a shortest Euler tresil in directed noneulerian is given also. Making use of above result, We Can get a shrtest function test Sequence of Sequential Circuits, finally, that the algorithm Complexity is polynomial for the state graph of the seqnential Circuits is proved. 本文提出了一种判别有向图是否欧拉图的充分必要条件,并给出了在有问欧拉图中找一条欧拉巡回的新的算法。除此还给出了在非有向欧拉图中找一条最短欧拉道路的算法。利用上述结果可以得到时序机的最小功能测试序列。因而使时序机最小功能测试问题得到解决(参考文献〔2〕p76),并证明对于给定时序机的状态图而言算法是多项式复杂性的。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社