首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2924篇
  免费   31篇
  国内免费   21篇
化学   1764篇
晶体学   17篇
力学   94篇
数学   626篇
物理学   475篇
  2020年   19篇
  2019年   21篇
  2016年   26篇
  2015年   26篇
  2014年   39篇
  2013年   156篇
  2012年   83篇
  2011年   100篇
  2010年   71篇
  2009年   83篇
  2008年   100篇
  2007年   93篇
  2006年   131篇
  2005年   126篇
  2004年   100篇
  2003年   95篇
  2002年   89篇
  2001年   64篇
  2000年   56篇
  1999年   50篇
  1998年   64篇
  1997年   59篇
  1996年   69篇
  1995年   40篇
  1994年   55篇
  1993年   47篇
  1992年   40篇
  1991年   40篇
  1990年   36篇
  1989年   25篇
  1988年   30篇
  1987年   33篇
  1986年   29篇
  1985年   53篇
  1984年   56篇
  1983年   57篇
  1982年   42篇
  1981年   37篇
  1980年   60篇
  1979年   30篇
  1978年   55篇
  1977年   63篇
  1976年   41篇
  1975年   36篇
  1974年   57篇
  1973年   42篇
  1972年   30篇
  1971年   24篇
  1969年   31篇
  1968年   22篇
排序方式: 共有2976条查询结果,搜索用时 43 毫秒
1.
2.
3.
In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.  相似文献   
4.
The critical group of a graph is an abelian group that arisesin several contexts, and there are some similarities with thegroups that are used in cryptography. We construct a familyof graphs with critical groups that are cyclic, and discussthe associated computational problems using algorithms basedon the theory of ‘chip-firing’.  相似文献   
5.
6.
In this article, the question is considered whether there exist finite translation planes with arbitrarily small kernels admitting nonsolvable collineation groups. For any integerN, it is shown that there exist translation planes of dimension >N and orderq 3 admittingGL(2,q) as a collineation group.  相似文献   
7.
A theoretical equation has been developed to described the rate of slow crack growth in an ethylene-hexene copolymer in terms of the basic morphological parameters. These parameters are spacing of the butyl branches, number of tie molecules, and the thickness of the lamellar crystal. Experimentally, the thickness of the lamellae and the long period were determined as functions of the branch density. The calculation of the number of tie molecules is based on the values of the molecular weight and the long period. The model of slow crack growth is based on the rate of disentanglement of the tie molecules. The rate of disentanglement varies inversely with the number of tie molecules and directly with the number of tie molecules that are not pinned by the branches.  相似文献   
8.
It is well known that S 12 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S 12 for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
9.
10.
Translation planes of order q 2 containing non-Desarguesian Baer subplanes are used to construct transversal-free translation nets with very small deficiencies. Also, a generalization of the ideas of Bruen shows that any non-Desarguesian spread in PG(3, q) produces a transversal-free net of small deficiency.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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