首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   64708篇
  免费   11493篇
  国内免费   3004篇
化学   65210篇
晶体学   950篇
力学   1574篇
综合类   44篇
数学   5990篇
物理学   5437篇
  2023年   47篇
  2022年   119篇
  2021年   309篇
  2020年   672篇
  2019年   2476篇
  2018年   2383篇
  2017年   2831篇
  2016年   3111篇
  2015年   5385篇
  2014年   5126篇
  2013年   7277篇
  2012年   5659篇
  2011年   5328篇
  2010年   4336篇
  2009年   4225篇
  2008年   4577篇
  2007年   3922篇
  2006年   3656篇
  2005年   3521篇
  2004年   2957篇
  2003年   2678篇
  2002年   3264篇
  2001年   1713篇
  2000年   1558篇
  1999年   737篇
  1998年   153篇
  1997年   119篇
  1996年   133篇
  1995年   118篇
  1994年   127篇
  1993年   116篇
  1992年   106篇
  1991年   73篇
  1990年   37篇
  1989年   40篇
  1988年   40篇
  1987年   23篇
  1986年   41篇
  1985年   23篇
  1984年   17篇
  1983年   6篇
  1982年   14篇
  1981年   24篇
  1980年   26篇
  1979年   25篇
  1978年   14篇
  1977年   21篇
  1976年   10篇
  1973年   8篇
  1972年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
We investigate the dynamics of the Λ system driven by two resonant laser fields in presence of dissipation for coupling strengths where the rotating‐wave approximation starts to break down. This regime is characterised by Rabi frequencies being approximately equal or smaller than the field frequencies. A systematic procedure to obtain an expansion for the solution of the Bloch evolution equations of the system is presented. The lowest contribution results to be the well‐known rotating‐wave approximation. The method is based on a semi‐classical treatment of the problem, and its predictions are interpreted fully quantum mechanically. The theory is illustrated by a detailed study of the disappearance of coherent population trapping as the intensities of the fields increase.  相似文献   
82.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.  相似文献   
83.
一类积分不等式的推广   总被引:1,自引:0,他引:1  
石红 《数学研究》2003,36(2):163-170
对一些基本的积分不等式进行了推广,给出了含有n个无关变元的更广泛的非线性积分不等式.利用所得的不等式讨论了某些非线性积分方程解的有界性.  相似文献   
84.
In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
85.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
86.
87.
A graph G is N2locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005  相似文献   
88.
89.
The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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