期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
FROM MOLECULAR RESPONSE TO CELL RESPONSE-Approaching the complexity of biological systems
1
作者 Wang Kui(The School of Pharmaceutical, Beijing Medical University) 《Bulletin of the Chinese Academy of Sciences》 2000年第1期17-25,共9页
I. THE COMPLEXITY OFBIOLOGICAL RESPONSESFor an organism, to be living or notdepends on its response to foreign matters.Facing the increasing amount and diversi-ty of chemicals, natural and synthetic, tounderstand the ... I. THE COMPLEXITY OFBIOLOGICAL RESPONSESFor an organism, to be living or notdepends on its response to foreign matters.Facing the increasing amount and diversi-ty of chemicals, natural and synthetic, tounderstand the principles of the biologicalresponses becomes extremely importantin pursuing the way of rational utiliza-tion and governing the foreign matters.However, most biological responses aretoo complex to explore their nature. Forinstance, the risk to human beings andorganisms related to the application ofrare earths in agriculture, forestation, fish-ery and husbandry has been argued 展开更多
关键词 FROM MOLECULAR RESPONSE TO CELL RESPONSE-Approaching the complexity of biological systems
在线阅读 下载PDF
0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM
2
作者 堵丁柱 KER-IKo 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1989年第1期68-80,共13页
A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Lin... A routing tree for a set of tasks is a decision tree which assigns the tasks to their destinationsaccording to the features of the tasks. A weighted routing tree is one with costs attached to each linkof the tree. Links of the same feature have the same cost. It is proved that the problem of finding ?routing tree of the minimum cost for a given set of tasks of two features is NP-complete. 展开更多
关键词 NODE TH the complexity OF AN OPTIMAL ROUTING TREE PROBLEM
原文传递
ON THE COMPLEXITY OF A PL HOMOTOPY ALGORITHM FOR ZEROS OF POLYNOMIALS
3
作者 高堂安 王则柯 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1993年第2期135-142,共8页
A PL homotopy algorithm is modified to yield a polynomial-time result on its computational complexity.We prove that the cost of locating all zeros of a polynomial of degree n to an accuracy of ε(measured by the numbe... A PL homotopy algorithm is modified to yield a polynomial-time result on its computational complexity.We prove that the cost of locating all zeros of a polynomial of degree n to an accuracy of ε(measured by the number of evaluations of the polynomial)grows no faster than O(max{n^4,n^3log_2(n/ε)}).This work is in response to a question raised in a paper by S.Smale as to the efficiency of piecewise linear methods in solving equations.In comparison with a few results reported,the algorithm under discussion is the only one providing correct multiplicities and the only one employing vector labelling. 展开更多
关键词 ON the complexity OF A PL HOMOTOPY ALGORITHM FOR ZEROS OF POLYNOMIALS PL
原文传递
The Distribution Search:An O(n) Expected Time Search
4
《Wuhan University Journal of Natural Sciences》 CAS 1996年第2期167-170,共4页
Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and... Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search. 展开更多
关键词 the distribution search the algorithm design a mathematical formula analysis of the complexity O(n)expected time
在线阅读 下载PDF
Coordination and evolution mechanism of fractal crack network in mining rock mass destruction
5
作者 YU Guang-ming ZHANG Chun-hui 《中国有色金属学会会刊:英文版》 CSCD 2005年第S1期105-107,共3页
Based on the natural characters of stratum,complicated geological mining conditions and the essence of mining rock mass destruction,the complexity of rock mass destruction caused by miningw as analyzed.The inner link ... Based on the natural characters of stratum,complicated geological mining conditions and the essence of mining rock mass destruction,the complexity of rock mass destruction caused by miningw as analyzed.The inner link between rock mass destruction phenomena caused by mining and nonlinear science was revealed.There are numerous cracks in natural rock mass.The cracks’distribution is irregular and is of statistical fractal structure.Self-organizational nonlinear evolution of the inner structure flaws leads to the rock mass destruction with external force.The evolution includes single fault’s fractal development,formation and evolution of fractal crack network and coordination of fractal crack network,etc.The law of fractal crack network’s evolution was introduced,at the same time,the coordination of fractal crack network was analyzed.Finally,based on coordination the principal equation of mining-caused subsidence of structural rock mass was established and its steady-state solution and unsteady-state solution were found. 展开更多
关键词 the complexity of rock mass destruction fractal crack network coordination
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部