首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   473437篇
  免费   7128篇
  国内免费   1249篇
化学   258067篇
晶体学   6665篇
力学   20060篇
综合类   13篇
数学   56752篇
物理学   140257篇
  2021年   4151篇
  2020年   4719篇
  2019年   5047篇
  2018年   6686篇
  2017年   6415篇
  2016年   10074篇
  2015年   6716篇
  2014年   9675篇
  2013年   22601篇
  2012年   18379篇
  2011年   22090篇
  2010年   15139篇
  2009年   14685篇
  2008年   20027篇
  2007年   19914篇
  2006年   18373篇
  2005年   16562篇
  2004年   15250篇
  2003年   13304篇
  2002年   12919篇
  2001年   13951篇
  2000年   10563篇
  1999年   8249篇
  1998年   6855篇
  1997年   6589篇
  1996年   6467篇
  1995年   5704篇
  1994年   5671篇
  1993年   5487篇
  1992年   6131篇
  1991年   6167篇
  1990年   5896篇
  1989年   5702篇
  1988年   5692篇
  1987年   5568篇
  1986年   5258篇
  1985年   6856篇
  1984年   6976篇
  1983年   5488篇
  1982年   5649篇
  1981年   5625篇
  1980年   5203篇
  1979年   5557篇
  1978年   5696篇
  1977年   5555篇
  1976年   5525篇
  1975年   5100篇
  1974年   5085篇
  1973年   5080篇
  1972年   3533篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
993.
994.
We study the hyperkähler geometry of complex adjoint orbits from the point of view of twistor theory. We introduce, for complex semisimple adjoint orbits, the associated spectral curve and construct the twistor space as a union of certain regular adjoint orbits; we also exhibit the family of twistor lines. Furthermore, we show how our methods may be applied for describing hyperkähler metrics associated to more general spectral curves. In particular, we give an algebraic characterisation of the twistor lines.  相似文献   
995.
996.
997.
This paper is concerned with several approximation problems in the weighted Hardy spacesH p(Ω) of analytic functions in the open unit disc D of the complex plane ℂ. We prove that ifX is a relatively closed subset of D, the class of uniform limits onX of functions inH p(Ω) coincides, moduloH p(Ω), with the space of uniformly continuous functions on a certain hull ofX which are holomorphic on its interior. We also solve the simultaneous approximation problems of describing Farrell and Mergelyan sets forH p(Ω), giving geometric characterizations for them. By replacing approximating polynomials by polynomial multipliers of outer functions, our results lead to characterizations of the same sets with respect to cyclic vectors in the classical Hardy spacesH p(D), 1 ⪯p < ∞. Dedicated to Professor Nácere Hayek on the occasion of his 75th birthday.  相似文献   
998.
Forced-air precooling of spherical foods in bulk: A parametric study   总被引:4,自引:0,他引:4  
In this paper, a mathematical model for forced-air precooling of spherical food products in bulk is developed. The foods are arranged in horizontal layers stacked one above the other to form a rectangular parallelepiped with a vertical gap in between the product layers. The foods are cooled by chilled air blown along the height of the package. The governing equations for the conduction heat transfer in the foods, simultaneous heat and mass transfer at the food-air interface and in the air stream are solved numerically using finite-difference methods. A comprehensive numerical study is performed by varying the process parameters over a wide range. Typical results showing the variation of moist air properties along the height of the package and the effect of each parameter on the process time are presented. The ranges of parameters for advantageous operation of the precooling system are identified. Correlations are obtained for the process time based on the product center and mass-averaged temperatures in terms of process parameters.  相似文献   
999.
The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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