首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1621349篇
  免费   32259篇
  国内免费   8427篇
化学   717745篇
晶体学   21058篇
力学   77243篇
综合类   107篇
数学   250059篇
物理学   395175篇
无线电   200648篇
  2021年   14894篇
  2020年   17499篇
  2019年   17633篇
  2018年   18086篇
  2017年   16601篇
  2016年   31863篇
  2015年   22403篇
  2014年   33067篇
  2013年   79104篇
  2012年   44965篇
  2011年   46750篇
  2010年   44175篇
  2009年   48408篇
  2008年   48511篇
  2007年   47058篇
  2006年   48123篇
  2005年   43603篇
  2004年   42638篇
  2003年   39171篇
  2002年   38980篇
  2001年   38649篇
  2000年   33489篇
  1999年   29899篇
  1998年   27839篇
  1997年   27581篇
  1996年   27101篇
  1995年   24812篇
  1994年   24347篇
  1993年   23752篇
  1992年   23828篇
  1991年   23957篇
  1990年   22798篇
  1989年   22417篇
  1988年   21601篇
  1987年   20301篇
  1986年   19121篇
  1985年   25603篇
  1984年   26601篇
  1983年   22434篇
  1982年   23796篇
  1981年   22991篇
  1980年   22221篇
  1979年   22270篇
  1978年   23438篇
  1977年   23016篇
  1976年   22617篇
  1975年   21301篇
  1974年   20936篇
  1973年   21399篇
  1972年   15574篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
971.
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.  相似文献   
972.
973.
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.  相似文献   
974.
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.  相似文献   
975.
976.
977.
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.  相似文献   
978.
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.  相似文献   
979.
Preface     
  相似文献   
980.
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号