首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1438943篇
  免费   38182篇
  国内免费   14239篇
化学   735249篇
晶体学   20945篇
力学   79654篇
综合类   610篇
数学   251776篇
物理学   403130篇
  2021年   15517篇
  2020年   17774篇
  2019年   18119篇
  2018年   15849篇
  2017年   14075篇
  2016年   30865篇
  2015年   23356篇
  2014年   33511篇
  2013年   78443篇
  2012年   45412篇
  2011年   44763篇
  2010年   41917篇
  2009年   43826篇
  2008年   41489篇
  2007年   37376篇
  2006年   41629篇
  2005年   34248篇
  2004年   34319篇
  2003年   31521篇
  2002年   32112篇
  2001年   32314篇
  2000年   27510篇
  1999年   24560篇
  1998年   22455篇
  1997年   22199篇
  1996年   22235篇
  1995年   20185篇
  1994年   19579篇
  1993年   19041篇
  1992年   19226篇
  1991年   19372篇
  1990年   18518篇
  1989年   18459篇
  1988年   17938篇
  1987年   17860篇
  1986年   16774篇
  1985年   23118篇
  1984年   24124篇
  1983年   20224篇
  1982年   21815篇
  1981年   21022篇
  1980年   20328篇
  1979年   20627篇
  1978年   21820篇
  1977年   21441篇
  1976年   21146篇
  1975年   19859篇
  1974年   19506篇
  1973年   19920篇
  1972年   14434篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
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.  相似文献   
952.
953.
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.  相似文献   
954.
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.  相似文献   
955.
956.
957.
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.  相似文献   
958.
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.  相似文献   
959.
Preface     
  相似文献   
960.
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号