首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1392426篇
  免费   29796篇
  国内免费   7748篇
化学   699584篇
晶体学   20658篇
力学   75986篇
综合类   106篇
数学   245661篇
物理学   387975篇
  2021年   13556篇
  2020年   15975篇
  2019年   16099篇
  2018年   14802篇
  2017年   13307篇
  2016年   28943篇
  2015年   21051篇
  2014年   30579篇
  2013年   74668篇
  2012年   40728篇
  2011年   40162篇
  2010年   39102篇
  2009年   41123篇
  2008年   38426篇
  2007年   34954篇
  2006年   38634篇
  2005年   32321篇
  2004年   32672篇
  2003年   30219篇
  2002年   30831篇
  2001年   31337篇
  2000年   26460篇
  1999年   23348篇
  1998年   21379篇
  1997年   21336篇
  1996年   21303篇
  1995年   19342篇
  1994年   18791篇
  1993年   18342篇
  1992年   18641篇
  1991年   18916篇
  1990年   18069篇
  1989年   18072篇
  1988年   17623篇
  1987年   17587篇
  1986年   16539篇
  1985年   22941篇
  1984年   24058篇
  1983年   20182篇
  1982年   21790篇
  1981年   20998篇
  1980年   20334篇
  1979年   20689篇
  1978年   21849篇
  1977年   21484篇
  1976年   21242篇
  1975年   19915篇
  1974年   19561篇
  1973年   20012篇
  1972年   14507篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
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.  相似文献   
992.
993.
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.  相似文献   
994.
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.  相似文献   
995.
996.
997.
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.  相似文献   
998.
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.  相似文献   
999.
Preface     
  相似文献   
1000.
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号