首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1308834篇
  免费   29657篇
  国内免费   7680篇
化学   651179篇
晶体学   20026篇
力学   74130篇
综合类   103篇
数学   239030篇
物理学   361703篇
  2021年   13463篇
  2020年   15883篇
  2019年   16011篇
  2016年   27276篇
  2015年   20568篇
  2014年   30320篇
  2013年   74232篇
  2012年   36061篇
  2011年   31284篇
  2010年   35565篇
  2009年   38203篇
  2008年   31181篇
  2007年   26449篇
  2006年   34259篇
  2005年   25756篇
  2004年   27874篇
  2003年   26714篇
  2002年   28136篇
  2001年   27576篇
  2000年   24222篇
  1999年   22243篇
  1998年   20931篇
  1997年   20916篇
  1996年   21025篇
  1995年   19122篇
  1994年   18556篇
  1993年   18098篇
  1992年   18105篇
  1991年   18349篇
  1990年   17645篇
  1989年   17685篇
  1988年   17228篇
  1987年   17243篇
  1986年   16150篇
  1985年   22598篇
  1984年   23793篇
  1983年   19968篇
  1982年   21623篇
  1981年   20876篇
  1980年   20200篇
  1979年   20439篇
  1978年   21690篇
  1977年   21343篇
  1976年   21026篇
  1975年   19733篇
  1974年   19377篇
  1973年   19845篇
  1972年   14338篇
  1968年   12255篇
  1967年   12604篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
901.
The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.  相似文献   
902.
903.
We present a stratification by “normal flatness” associated to an analytic mapping, analogous to Hironaka's classical result for analytic spaces. Our construction is based on a generic normal flatness theorem for mappings, proved using techniques concerning the variation of modules of meromorphically parametrized formal power series [1]. The existence of such a stratification was announced by Hironaka [13], but the other claims made in [13] are false. Counterexamples are also presented here.  相似文献   
904.
Using an integral theory of grating diffraction we calculate efficiencies greater than 100% if a coating with gain is taken into account. A connection with guided modes is conjectured. The application in optical computing seems to be possible.  相似文献   
905.
906.
907.
Physics and Mathematics Division with Computational Center of the Bashkir Branch of the USSR Academy of Sciences. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 80, No. 3, pp. 470–473, September, 1989.  相似文献   
908.
In this paper, an application of the Riquer-Thomas-Janet theory is described for the problem of transforming a system of partial differential equations into a passive form, i.e., to a special form which contains explicitly both the equations of the initial system and all their nontrivial differential consequences. This special representation of a system markedly facilitates the subsequent integration of the corresponding differential equations. In this paper, the modern approach to the indicated problem is presented. This is the approach adopted in the Knuth-Bendix procedure [13] for critical-pair/completion and then Buchberger's algorithm for completion of polynomial ideal bases [13] (or, alternatively, for the construction of Groebner bases for ideals in a differential operator ring [14]). The algorithm of reduction to the passive form for linear system of partial differential equations and its implementation in the algorithmic language REFAL, as well as the capabilities of the corresponding program, are outlined. Examples illustrating the power and efficiency of the system are presented.  相似文献   
909.
Preface     
  相似文献   
910.
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号