首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10424篇
  免费   221篇
  国内免费   75篇
化学   428篇
晶体学   13篇
力学   66篇
综合类   6篇
数学   9442篇
物理学   765篇
  2023年   19篇
  2022年   26篇
  2021年   28篇
  2020年   54篇
  2019年   281篇
  2018年   284篇
  2017年   169篇
  2016年   136篇
  2015年   122篇
  2014年   250篇
  2013年   613篇
  2012年   277篇
  2011年   599篇
  2010年   504篇
  2009年   702篇
  2008年   820篇
  2007年   838篇
  2006年   641篇
  2005年   387篇
  2004年   356篇
  2003年   325篇
  2002年   257篇
  2001年   197篇
  2000年   202篇
  1999年   259篇
  1998年   228篇
  1997年   169篇
  1996年   244篇
  1995年   214篇
  1994年   210篇
  1993年   173篇
  1992年   121篇
  1991年   90篇
  1990年   90篇
  1989年   90篇
  1988年   60篇
  1987年   60篇
  1986年   65篇
  1985年   88篇
  1984年   61篇
  1983年   51篇
  1982年   63篇
  1981年   60篇
  1980年   54篇
  1979年   39篇
  1978年   44篇
  1977年   35篇
  1976年   38篇
  1975年   10篇
  1974年   9篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
111.
We prove that a for a mapping f of finite distortion , the -Hausdorff measure of any point preimage is zero provided is integrable, with , and the multiplicity function of f is essentially bounded. As a consequence for we obtain that the mapping is then open and discrete. Received: 18 June 2001 / Revised version: 31 January 2002 / Published online: 27 June 2002  相似文献   
112.
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.  相似文献   
113.
This work is supported in part by the fund OTKA (No. 5-134).  相似文献   
114.
The qualitative behavior of buckled states of two different models of elastic beams is studied. It is assumed that random imperfections affect the governing nonlinear equations. It is shown that near the first critical value of the buckling load the stochastic bifurcation is described asymptotically by an algebraic equation whose coeffficients are Gaussian random variables. The corresponding asymptotic expansion for the displacement is to lowest order a Gaussian stochastic process.Work supported by NSF Grant No. DCR81-14726.Work supported by NSF Grant No. DMS87-01895.  相似文献   
115.
This paper is based on the M. Sc. thesis written by the third author under the supervision of the first two authors. It was submitted to the University of Baghdad in 1986.  相似文献   
116.
Summary We study the augmented system approach for the solution of sparse linear least-squares problems. It is well known that this method has better numerical properties than the method based on the normal equations. We use recent work by Arioli et al. (1988) to introduce error bounds and estimates for the components of the solution of the augmented system. In particular, we find that, using iterative refinement, we obtain a very robust algorithm and our estimates of the error are accurate and cheap to compute. The final error and all our error estimates are much better than the classical or Skeel's error analysis (1979) indicates. Moreover, we prove that our error estimates are independent of the row scaling of the augmented system and we analyze the influence of the Björck scaling (1967) on these estimates. We illustrate this with runs both on large-scale practical problems and contrived examples, comparing the numerical behaviour of the augmented systems approach with a code using the normal equations. These experiments show that while the augmented system approach with iterative refinement can sometimes be less efficient than the normal equations approach, it is comparable or better when the least-squares matrix has a full row, and is, in any case, much more stable and robust.This author was visiting Harwell and was funded by a grant from the Italian National Council of Research (CNR), Istituto di Elaborazione dell'Informazione-CNR, via S. Maria 46, I-56100 Pisa, ItalyThis author was visiting Harwell from Faculty of Mathematics and Computer Science of the University of Amsterdam  相似文献   
117.
Under some general continuous and compact conditions, the existence problems of fiked points andd coupled fixed points for increasing operators are studied. an application, we utilize the results obtained to study the existence of solutions for differential inclusions in Banach spaces.  相似文献   
118.
Nonlinear (at the second-harmonic frequency of the incident light) optical reflection by two-dimensional magnetic superstructures is theoretically studied. A square lattice of magnetic dots and a hexagonal lattice of magnetic bubbles (cylindrical magnetic domains) are considered. Because the periods of these structures are comparable with the wavelengths of the fundamental and the second-harmonic radiation, it would be possible to observe diffraction at the second-harmonic frequency. A polarization analysis of nonlinearly diffracted radiation is performed and the numbers of observable diffraction orders for the above structures are estimated. Received: 10 January 2002 / Published online: 11 June 2002  相似文献   
119.
Multiderivations of Coxeter arrangements   总被引:3,自引:0,他引:3  
Let V be an ℓ-dimensional Euclidean space. Let GO(V) be a finite irreducible orthogonal reflection group. Let ? be the corresponding Coxeter arrangement. Let S be the algebra of polynomial functions on V. For H∈? choose α H V * such that H=ker(α H ). For each nonnegative integer m, define the derivation module D (m) (?)={θ∈Der S |θ(α H )∈Sα m H }. The module is known to be a free S-module of rank ℓ by K. Saito (1975) for m=1 and L. Solomon-H. Terao (1998) for m=2. The main result of this paper is that this is the case for all m. Moreover we explicitly construct a basis for D (m) (?). Their degrees are all equal to mh/2 (when m is even) or are equal to ((m−1)h/2)+m i (1≤i≤ℓ) (when m is odd). Here m 1≤···≤m are the exponents of G and h=m +1 is the Coxeter number. The construction heavily uses the primitive derivation D which plays a central role in the theory of flat generators by K. Saito (or equivalently the Frobenius manifold structure for the orbit space of G). Some new results concerning the primitive derivation D are obtained in the course of proof of the main result. Oblatum 27-XI-2001 & 4-XII-2001?Published online: 18 February 2002  相似文献   
120.
Summary We show that each holomorphic Wiener function has a skeleton which is intrinsic from several viewpoints. In particular, we study the topological aspects of the skeletons by using the local Taylor expansion for holomorphic Wiener functions.Supported in part by the Grant-in-Aid for Science Research 03740120 Min. Education  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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