首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   32407篇
  免费   1090篇
  国内免费   242篇
化学   22460篇
晶体学   223篇
力学   768篇
数学   5422篇
物理学   4866篇
  2023年   169篇
  2021年   419篇
  2020年   514篇
  2019年   483篇
  2018年   376篇
  2017年   369篇
  2016年   832篇
  2015年   737篇
  2014年   807篇
  2013年   1725篇
  2012年   1866篇
  2011年   2352篇
  2010年   1141篇
  2009年   1004篇
  2008年   2009篇
  2007年   2020篇
  2006年   1996篇
  2005年   1862篇
  2004年   1588篇
  2003年   1383篇
  2002年   1282篇
  2001年   402篇
  2000年   388篇
  1999年   358篇
  1998年   335篇
  1997年   357篇
  1996年   486篇
  1995年   343篇
  1994年   298篇
  1993年   271篇
  1992年   256篇
  1991年   231篇
  1990年   197篇
  1989年   200篇
  1988年   229篇
  1987年   197篇
  1986年   176篇
  1985年   346篇
  1984年   335篇
  1983年   239篇
  1982年   312篇
  1981年   322篇
  1980年   296篇
  1979年   281篇
  1978年   257篇
  1977年   226篇
  1976年   206篇
  1975年   208篇
  1974年   210篇
  1973年   209篇
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
131.
Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001  相似文献   
132.
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms.  相似文献   
133.
The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service. Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration.  相似文献   
134.
135.
136.
137.
Summary We provide an alternate proof of McMullen's theorem on contractive properties of the Poincaré series operator in the special case of the universal covering. This case includes in particular Kra's Theta Conjecture.Oblatum 16-X-1991 & 14-IV-1992First author supported in part by a grant from the National Science Foundation  相似文献   
138.
An overview is given on the stepwise learning programmes undertaken to identify the main sources of error associated with the determination of the mandatory organic contaminants in the marine monitoring programmes. Details are given on the preparation and use of LRMs and CRMs to maintain analytical control and quantify the laboratory errors in relation to the measurement of changes in the environment.  相似文献   
139.
In continuation of our interest in solid-state structures of silver complexes of photographic importance, the structure for silver benzotriazole (AgBZT), has now been obtained. The preferred method for solving crystal structures is via single-crystal X-ray diffraction (XRD). However, for some materials, growing single crystals of appropriate size and quality is often difficult or even impossible. AgBZT is an example of such a silver complex with poor solubility. The usual routes to preparing single crystals using recrystallization from a cooperating solvent resulted in polycrystalline powder samples. We propose a crystal structure for AgBZT, solved from synchrotron X-ray powder diffraction data, using a direct-space Monte Carlo simulated annealing approach. AgBZT crystals are monoclinic, (P21/c), with unit cell dimensions, a=14.8052(3) Å, b=3.7498(4) Å, c=12.3495(12) Å, and β=114.200(6)°. The AgBZT complex is constructed from all three of the Benzotriazole (BZT) nitrogens bonding to a separate silver atom. As a consequence of this bonding mode, the structure is a highly cross-linked, coordination polymer.  相似文献   
140.
Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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