首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19315篇
  免费   1946篇
  国内免费   1673篇
化学   9083篇
晶体学   113篇
力学   1469篇
综合类   272篇
数学   7257篇
物理学   4740篇
  2024年   30篇
  2023年   134篇
  2022年   316篇
  2021年   360篇
  2020年   487篇
  2019年   456篇
  2018年   492篇
  2017年   633篇
  2016年   716篇
  2015年   588篇
  2014年   794篇
  2013年   1406篇
  2012年   1166篇
  2011年   1077篇
  2010年   957篇
  2009年   1111篇
  2008年   1137篇
  2007年   1197篇
  2006年   1065篇
  2005年   898篇
  2004年   886篇
  2003年   814篇
  2002年   701篇
  2001年   538篇
  2000年   586篇
  1999年   576篇
  1998年   503篇
  1997年   511篇
  1996年   396篇
  1995年   332篇
  1994年   299篇
  1993年   231篇
  1992年   222篇
  1991年   183篇
  1990年   185篇
  1989年   146篇
  1988年   133篇
  1987年   108篇
  1986年   70篇
  1985年   89篇
  1984年   71篇
  1983年   46篇
  1982年   68篇
  1981年   50篇
  1980年   35篇
  1979年   35篇
  1978年   28篇
  1977年   19篇
  1976年   13篇
  1973年   11篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
本文采用直接模拟蒙特卡罗方法对稀薄气体二维外部柱体绕流问题进行了数值模拟。结果表明:外部绕流问题,在特定情况下会产生激波,激波的产生,不仅与气体的稀薄程度有关,还与来流马赫数有关。而气流与壁面之间的换热,随来流马赫数增加而增加,随气体稀薄程度增加而减小。  相似文献   
92.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
93.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.  相似文献   
94.
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.  相似文献   
95.
In this paper, by the use of a fixed point theorem, many new necessary and sufficient conditions for the existence of positive solutions in C[0,1]∩C1[0,1]∩C2(0,1) or C[0,1]∩C2(0,1) are presented for singular superlinear and sublinear second-order boundary value problems. Singularities at t=0, t=1 will be discussed.  相似文献   
96.
In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.  相似文献   
97.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.  相似文献   
98.
The influence of thermal excitation on a finite-amplitude vortex disturbance in a shear flow of a molecular gas is studied in a model problem. The evolution of such vortex structures is typical of both the nonlinear stage of the laminar–turbulent transition and for developed turbulence. Since the excitation level was assumed to be comparatively low, full Navier–Stokes equations for a compressible heat-conducting gas were used in calculations; nonequilibrium was taken into account by the coefficient of bulk viscosity. As the bulk viscosity increases in the range of realistic values, the disturbance-energy damping rate in a weakly compressible flow increases approximately by 10%. The increase in the Mach number enhances the effect of disturbance suppression.  相似文献   
99.
孙兴旺  代新利 《数学季刊》2003,18(4):378-387
§ 1. IntroductionRecently ,thedifferentialequationswithdeviatingargumentswereusuallydiscussed(see[1 ],[4],[5 ]) .In [1 ],AGARWALRPandO’REGANDconsideredequationy″(t) =f(t,y(t) ,y(σ(t) ) ) , a.e .t∈ [0 ,1 ]y(t) =ψ(t) ,        t∈ [-r ,0 ]y( 1 ) =a ,( )andtheydiscussedtheexistenceofatleastonesolutionforequation ( ) .Inthispaper ,weconsideramoregeneralequation-x″(t) =f(t ,xt) , t∈ [0 ,1 ]x(t) =ψ(t) ,    t∈ ( -∞ ,0 ]x( 0 ) =x( 1 ) =0 ,( 1 .1 )andsomeexistencetheor…  相似文献   
100.
本文引入了一种满足更一般的收缩不等式的多重函数类,并证明了属于该类的可测多重函数对的一些随机重合点定理。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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