首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1334743篇
  免费   29512篇
  国内免费   7687篇
化学   657441篇
晶体学   20814篇
力学   75474篇
综合类   103篇
数学   244007篇
物理学   374103篇
  2021年   13471篇
  2020年   15900篇
  2019年   16016篇
  2018年   15026篇
  2017年   13647篇
  2016年   28824篇
  2015年   21031篇
  2014年   30398篇
  2013年   74292篇
  2012年   37586篇
  2011年   35631篇
  2010年   38460篇
  2009年   41088篇
  2008年   34902篇
  2007年   31093篇
  2006年   34027篇
  2005年   28888篇
  2004年   29350篇
  2003年   27641篇
  2002年   28182篇
  2001年   26210篇
  2000年   23333篇
  1999年   21868篇
  1998年   20836篇
  1997年   20847篇
  1996年   21009篇
  1995年   19076篇
  1994年   18548篇
  1993年   18073篇
  1992年   17687篇
  1991年   18037篇
  1990年   17240篇
  1989年   17364篇
  1988年   16874篇
  1987年   16920篇
  1986年   15733篇
  1985年   22255篇
  1984年   23581篇
  1983年   19840篇
  1982年   21569篇
  1981年   20822篇
  1980年   20140篇
  1979年   20186篇
  1978年   21604篇
  1977年   21149篇
  1976年   20803篇
  1975年   19484篇
  1974年   19110篇
  1973年   19596篇
  1972年   14096篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
981.
This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed.Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.  相似文献   
982.
When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.  相似文献   
983.
Some well-known theorems on typical properties of real-valued continuous functions defined on [0, 1] are improved using the notion of porosity.  相似文献   
984.
It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given.  相似文献   
985.
The singular-perturbation expansion of the plasma cold-fluid equations for crossed fields in a planar geometry is presented. The general expansion is carried out to third order. Various instabilities that occur in the first, second, and third orders are discussed.  相似文献   
986.
Dubrovin valuation rings and Henselization   总被引:4,自引:0,他引:4  
Supported in part by the National Science Foundation  相似文献   
987.
Partially supported by the general research fund at the University of Kansas  相似文献   
988.
Selected experiences in the control of contamination and the threat it poses to the quality of analytical date are discussed in the context of the whole analytical process from collection of marine environmental samples, through handling and radiochemical separation, to the final interpretation of results. Examples include a demonstration of the contamination introduced during sediment core sectioning, contamination of sea water by a ship's pumping system, and the effect of filtration on the apparent partitioning of radionuclides between solid and liquid phases of sea water.  相似文献   
989.
Lithium (10–150 ng ml?1) in wine is determined by atomic absorption spectrometry by direct nebulization and after digestion with mixed acids. The results of methods are similar. Thirty-four wines from various Spanish provinces are analysed.  相似文献   
990.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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