首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5804篇
  免费   139篇
  国内免费   34篇
化学   4011篇
晶体学   88篇
力学   141篇
数学   988篇
物理学   749篇
  2021年   42篇
  2020年   41篇
  2019年   62篇
  2018年   58篇
  2017年   47篇
  2016年   113篇
  2015年   113篇
  2014年   113篇
  2013年   314篇
  2012年   263篇
  2011年   320篇
  2010年   148篇
  2009年   145篇
  2008年   289篇
  2007年   313篇
  2006年   266篇
  2005年   303篇
  2004年   251篇
  2003年   281篇
  2002年   234篇
  2001年   104篇
  2000年   92篇
  1999年   85篇
  1998年   63篇
  1997年   86篇
  1996年   95篇
  1995年   92篇
  1994年   84篇
  1993年   64篇
  1992年   52篇
  1991年   56篇
  1990年   46篇
  1989年   62篇
  1988年   72篇
  1987年   52篇
  1986年   52篇
  1985年   78篇
  1984年   98篇
  1983年   67篇
  1982年   89篇
  1981年   95篇
  1980年   90篇
  1979年   74篇
  1978年   77篇
  1977年   72篇
  1976年   67篇
  1975年   58篇
  1974年   48篇
  1973年   36篇
  1972年   21篇
排序方式: 共有5977条查询结果,搜索用时 281 毫秒
31.
The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.  相似文献   
32.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007  相似文献   
33.
Thin films of polystyrene (PS), poly(methyl methacrylate) (PMMA) and polystyrene-polyacrylonitrile copolymer (PS-AN), containing various embedded transition-metal complexes, have been studied by FTIR microscopy. The spatial distributions of the transition-metal carbonyl complexes throughout the thin organic polymer films have been determined by a two-dimensional IR mapping procedure. The spectral variations observed in the distribution of the metal carbonyls throughout the different polymer films are discussed. The IR data show that the technique used to prepare the organometallic-embedded thin films (viz. freeze-drying of solutions followed by hot mechanical pressing of the residues) does in general lead to homogeneous films which may eventually find industrial application, e.g. as membrane sensors for small molecules.  相似文献   
34.
35.
36.
We discuss whether an appropriately defined dimensionless scalar function might be an acceptable candidate for the gravitational entropy, by explicitly considering Szekeres and Bianchi type VI h models that admit an isotropic singularity. We also briefly discuss other possible gravitational entropy functions, including an appropriate measure of the velocity dependent Bel-Robinson tensor. PACS: 04.20.-q 95.30.Sf 98.80.Jk  相似文献   
37.
38.
39.
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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