首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11190篇
  免费   1367篇
  国内免费   987篇
化学   1364篇
晶体学   42篇
力学   1549篇
综合类   223篇
数学   8213篇
物理学   2153篇
  2024年   25篇
  2023年   82篇
  2022年   135篇
  2021年   146篇
  2020年   243篇
  2019年   258篇
  2018年   242篇
  2017年   365篇
  2016年   399篇
  2015年   281篇
  2014年   482篇
  2013年   912篇
  2012年   578篇
  2011年   630篇
  2010年   609篇
  2009年   769篇
  2008年   771篇
  2007年   779篇
  2006年   663篇
  2005年   591篇
  2004年   542篇
  2003年   546篇
  2002年   464篇
  2001年   350篇
  2000年   357篇
  1999年   343篇
  1998年   302篇
  1997年   274篇
  1996年   228篇
  1995年   159篇
  1994年   151篇
  1993年   123篇
  1992年   114篇
  1991年   93篇
  1990年   92篇
  1989年   54篇
  1988年   41篇
  1987年   45篇
  1986年   26篇
  1985年   45篇
  1984年   25篇
  1983年   25篇
  1982年   36篇
  1981年   38篇
  1980年   25篇
  1979年   20篇
  1978年   24篇
  1977年   15篇
  1976年   7篇
  1957年   5篇
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
61.
In this paper, the Leslie predator-prey system with two delays is studied. The stability of the positive equilibrium is discussed by analyzing the associated characteristic transcendental equation. The direction and stability of the bifurcating periodic solutions are determined by applying the center manifold theorem and normal form theory. The conditions to guarantee the global existence of periodic solutions are given.  相似文献   
62.
Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping.  相似文献   
63.
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  相似文献   
64.
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.  相似文献   
65.
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.  相似文献   
66.
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.  相似文献   
67.
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.  相似文献   
68.
We consider a delayed predator-prey system with Beddington-DeAngelis functional response. The stability of the interior equilibrium will be studied by analyzing the associated characteristic transcendental equation. By choosing the delay τ as a bifurcation parameter, we show that Hopf bifurcation can occur as the delay τ crosses some critical values. The direction and stability of the Hopf bifurcation are investigated by following the procedure of deriving normal form given by Faria and Magalhães. An example is given and numerical simulations are performed to illustrate the obtained results.  相似文献   
69.
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.  相似文献   
70.
孙兴旺  代新利 《数学季刊》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…  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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