首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1180篇
  免费   41篇
  国内免费   49篇
化学   52篇
晶体学   2篇
力学   82篇
综合类   8篇
数学   809篇
物理学   317篇
  2024年   5篇
  2023年   16篇
  2022年   16篇
  2021年   10篇
  2020年   39篇
  2019年   45篇
  2018年   27篇
  2017年   30篇
  2016年   23篇
  2015年   26篇
  2014年   56篇
  2013年   101篇
  2012年   31篇
  2011年   57篇
  2010年   54篇
  2009年   93篇
  2008年   93篇
  2007年   81篇
  2006年   79篇
  2005年   66篇
  2004年   37篇
  2003年   46篇
  2002年   43篇
  2001年   25篇
  2000年   35篇
  1999年   28篇
  1998年   37篇
  1997年   17篇
  1996年   11篇
  1995年   5篇
  1994年   7篇
  1993年   6篇
  1992年   5篇
  1991年   4篇
  1990年   2篇
  1989年   3篇
  1988年   1篇
  1987年   2篇
  1986年   2篇
  1985年   2篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
排序方式: 共有1270条查询结果,搜索用时 15 毫秒
71.
In this work, we study the asymptotic properties of a new Sturm–Liouville problem with retarded argument. Contrary to previous works, differential equation includes eigenparameter as a quadratic function. In the considered problem arise new difficulties. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
72.
73.
74.
In the paper, we study three types of finite-time ruin probabilities in a diffusion-perturbed bidimensional risk model with constant force of interest, pairwise strongly quasi-asymptotically independent claims and two general claim arrival processes, and obtain uniformly asymptotic formulas for times in a finite interval when the claims are both long-tailed and dominatedly-varying-tailed. In particular, with a certain dependence structure among the inter-arrival times, these formulas hold uniformly for all times when the claims are pairwise quasi-asymptotically independent and consistently-varying-tailed.  相似文献   
75.
3限制边割是连通图的一个边割, 它将此图分离成阶不小于3的连通分支. 图G的最小3限制边割所含的边数称为此图的3限制边连通度, 记作λ\-3(G). 它以图G的3阶连通点导出 子图的余边界的最小基数ξ_3(G)为上界. 如果λ_3(G)=ξ_3(G), 则称图G是极大3限制边连通的 . 已知在某种程度上,3限制边连通度较大的网络有较好的可靠性. 作者在文中证明: 如果k正则连通点可迁图的 围长至少是5, 那么它是是极大3限制边连通的.  相似文献   
76.
The notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee [C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee: Competition multigraphs and the multicompetition number, Ars Combinatoria 29B (1990) 185-192] as a generalization of the competition graphs of digraphs.In this note, we give a characterization of competition multigraphs of arbitrary digraphs and a characterization of competition multigraphs of loopless digraphs. Moreover, we characterize multigraphs whose multicompetition numbers are at most m, where m is a given nonnegative integer and give characterizations of competition multihypergraphs.  相似文献   
77.
Masuyama (2011) obtained the subexponential asymptotics of the stationary distribution of an M/G/1 type Markov chain under the assumption related to the periodic structure of G-matrix. In this note, we improve Masuyama’s result by showing that the subexponential asymptotics holds without the assumption related to the periodic structure of G-matrix.  相似文献   
78.
A theory of transport in the quantum-Hall regime is developed for separately contacted double-layer electron systems. Inter-layer tunneling provides a channel for equilibration of the distribution functions in the two layers at the edge states. Resistances and transresistances for various configurations of the electrodes are calculated as functions of the inter-layer tunneling amplitude. Induced current in one of the layer by a current in the other is also calculated. It is shown that reflection at the leads causes change in the results for some electrode configurations. The results obtained in this work is consistent with recent experiments.  相似文献   
79.
We show that uniform asymptotics of orthogonal polynomials on the real line imply uniform asymptotics for all their derivatives. This is more technically challenging than the corresponding problem on the unit circle. We also examine asymptotics in the L 2 norm. Research supported by NSF grant DMS0400446 and US-Israel BSF grant 2004353.  相似文献   
80.
We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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