首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92496篇
  免费   5122篇
  国内免费   12091篇
化学   72725篇
晶体学   1253篇
力学   2424篇
综合类   862篇
数学   12871篇
物理学   19574篇
  2024年   123篇
  2023年   696篇
  2022年   1931篇
  2021年   1861篇
  2020年   2279篇
  2019年   2234篇
  2018年   1897篇
  2017年   2777篇
  2016年   2905篇
  2015年   2441篇
  2014年   3385篇
  2013年   6787篇
  2012年   6318篇
  2011年   5068篇
  2010年   4292篇
  2009年   5853篇
  2008年   6039篇
  2007年   6324篇
  2006年   5738篇
  2005年   4872篇
  2004年   4538篇
  2003年   3748篇
  2002年   4974篇
  2001年   2871篇
  2000年   2669篇
  1999年   2482篇
  1998年   2170篇
  1997年   1713篇
  1996年   1441篇
  1995年   1379篇
  1994年   1223篇
  1993年   1017篇
  1992年   960篇
  1991年   649篇
  1990年   548篇
  1989年   522篇
  1988年   381篇
  1987年   306篇
  1986年   283篇
  1985年   229篇
  1984年   239篇
  1983年   139篇
  1982年   213篇
  1981年   175篇
  1980年   194篇
  1979年   187篇
  1978年   169篇
  1977年   123篇
  1976年   109篇
  1973年   68篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.  相似文献   
52.
53.
This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002  相似文献   
54.
55.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
56.
A design of diode-pumped high-efficiency Nd:YVO4/LBO red laser is reported. Using critical phase-matching (CPM) LBO, 671 nm red laser was obtained from 1342 nm light by intracavity frequency doubling. With an incident pump laser of 800 mW, using type-I and type-II CPM LBO, 97 and 52 mWTEM00 mode red laser outputs were obtained, with optical-to-optical conversion efficiencies of up to 12.1% and 6.5%, respectively.  相似文献   
57.
The scattering of heavy ion with a multilevel Rydberg atom in the presence of an electromagnetic field is studied. The interaction of Rydberg atom and the e.m field is explored using non-perturbative quasi-energy technique. Although the results are presented for selected excitations but in actual calculations we have included many levels of the atom. The effect of various parameters are shown on collisional excitation process. As an illustration detailed calculations are performed for the inelastic proton-Na Rydberg atom collision accompanied by the transfer of photons and the effects of dressing due to the field are considered. The emphasis of the present work is on collision induced transitions especially the case that involves change of orbital as well as principal quantum number. Received 26 December 2001 / Received in final form 8 April 2002 Published online 19 July 2002  相似文献   
58.
用全实加关联方法计算了类锂V20+离子1s23d-1s2nf的跃迁能和偶极振子强度.依据量子亏损理论, 确定了1s2nf系列的量子数亏损,用这些作为能量的缓变函数的量子亏损,实现对该Rydberg系列任意高激发态(n≥10)的能量的可靠预言.将这些分立态振子强度与量子亏损理论相结合,得到在电离域附近束缚态间的偶极跃迁振子强度以及束缚态-连续态跃迁的振子强度密度,从而将V20+离子的这一重要光谱特性的理论预言外推到整个能域.  相似文献   
59.
非傍轴平顶高斯光束M2因子两种定义的比较研究   总被引:3,自引:2,他引:1  
基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·  相似文献   
60.
Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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