首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   18538篇
  免费   384篇
  国内免费   194篇
化学   670篇
晶体学   32篇
力学   144篇
综合类   10篇
数学   17307篇
物理学   953篇
  2023年   17篇
  2022年   61篇
  2021年   36篇
  2020年   51篇
  2019年   334篇
  2018年   376篇
  2017年   193篇
  2016年   164篇
  2015年   178篇
  2014年   399篇
  2013年   1084篇
  2012年   492篇
  2011年   1085篇
  2010年   955篇
  2009年   1216篇
  2008年   1377篇
  2007年   1345篇
  2006年   913篇
  2005年   653篇
  2004年   491篇
  2003年   431篇
  2002年   383篇
  2001年   357篇
  2000年   369篇
  1999年   484篇
  1998年   467篇
  1997年   398篇
  1996年   409篇
  1995年   405篇
  1994年   421篇
  1993年   378篇
  1992年   356篇
  1991年   265篇
  1990年   258篇
  1989年   273篇
  1988年   178篇
  1987年   182篇
  1986年   191篇
  1985年   231篇
  1984年   225篇
  1983年   115篇
  1982年   200篇
  1981年   165篇
  1980年   143篇
  1979年   102篇
  1978年   129篇
  1977年   73篇
  1976年   52篇
  1975年   15篇
  1973年   16篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
In this paper we construct a positive doubly power bounded operator with a nonpositive inverse on an AL-space.  相似文献   
102.
Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.  相似文献   
103.
Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA  相似文献   
104.
Equicontinuous semigroups of transformations of a compact Hausdorff space and their sets of all invariant (Borel, regular and probabilistic) measures are studied. Conditions equivalent to the existence of at least one invariant measure are given. The (algebraic and topological) structure of the set of invariant measures is researched.  相似文献   
105.
Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.  相似文献   
106.
In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.  相似文献   
107.
We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314.  相似文献   
108.
Ion synthesis and laser annealing of Cu nanoparticles in Al2O3   总被引:1,自引:0,他引:1  
Al2O3 samples with Cu nanoparticles, synthesised by ion implantation at 40 keV with a dose of 1×1017 ion/cm2 and a current density from 2.5 to 12.5 μA/cm2, were annealed using ten pulses from a KrF excimer laser with a single pulse fluence of 0.3 J/cm2. The copper depth distribution, formation and modification of metal nanoparticles under the ion implantation and laser treatment were studied by Rutherford backscattering (RBS), energy dispersive X-ray (EDX) analysis, atomic force microscopy (AFM) and optical spectroscopy. It was found that laser annealing leads to a reduction in the nanoparticle size without diffusion of metal atoms into the bulk. The change in particle size and the possibility for oxidation of the copper particles are examined in the framework of Mie theory. Calculations presented show that under excimer laser treatment, Cu nanoparticles are more likely to be reduced in size than to undergo oxidation. Received: 19 April 2001 / Accepted: 7 November 2001 / Published online: 23 January 2002  相似文献   
109.
Summary A new method for the numerical integration of very high dimensional functions is introduced and implemented based on the Metropolis' Monte Carlo algorithm. The logarithm of the high dimensional integral is reduced to a 1-dimensional integration of a certain statistical function with respect to a scale parameter over the range of the unit interval. The improvement in accuracy is found to be substantial comparing to the conventional crude Monte Carlo integration. Several numerical demonstrations are made, and variability of the estimates are shown.  相似文献   
110.
Summary. The perfectly matched layer (PML) is an efficient tool to simulate propagation phenomena in free space on unbounded domain. In this paper we consider a new type of absorbing layer for Maxwell's equations and the linearized Euler equations which is also valid for several classes of first order hyperbolic systems. The definition of this layer appears as a slight modification of the PML technique. We show that the associated Cauchy problem is well-posed in suitable spaces. This theory is finally illustrated by some numerical results. It must be underlined that the discretization of this layer leads to a new discretization of the classical PML formulation. Received May 5, 2000 / Published online November 15, 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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