首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7200篇
  免费   162篇
  国内免费   52篇
化学   4848篇
晶体学   105篇
力学   150篇
数学   1107篇
物理学   1204篇
  2021年   49篇
  2020年   49篇
  2019年   67篇
  2018年   61篇
  2017年   52篇
  2016年   127篇
  2015年   125篇
  2014年   123篇
  2013年   349篇
  2012年   289篇
  2011年   377篇
  2010年   181篇
  2009年   179篇
  2008年   337篇
  2007年   357篇
  2006年   327篇
  2005年   347篇
  2004年   300篇
  2003年   334篇
  2002年   276篇
  2001年   134篇
  2000年   122篇
  1999年   106篇
  1998年   81篇
  1997年   105篇
  1996年   118篇
  1995年   119篇
  1994年   116篇
  1993年   89篇
  1992年   81篇
  1991年   84篇
  1990年   72篇
  1989年   81篇
  1988年   93篇
  1987年   74篇
  1986年   70篇
  1985年   99篇
  1984年   126篇
  1983年   88篇
  1982年   102篇
  1981年   105篇
  1980年   111篇
  1979年   93篇
  1978年   97篇
  1977年   82篇
  1976年   89篇
  1975年   78篇
  1974年   76篇
  1973年   58篇
  1972年   36篇
排序方式: 共有7414条查询结果,搜索用时 15 毫秒
31.
32.
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.  相似文献   
33.
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  相似文献   
34.
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.  相似文献   
35.
36.
37.
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  相似文献   
38.
We derive the Kramers equation, namely, the Fokker-Planck equation for an oscillator, from a completely deterministic picture. The oscillator is coupled to a “booster”, i.e., a deterministic system in a fully chaotic state, wherein diffusion is derived from the sensitive dependence of chaos on initial conditions and friction is a consequence of the linear response of the booster to the action exerted on it by the oscillator. To deal with the Hamiltonian nature of the system of interest and of its coupling to the booster, we extend the earlier theoretical derivation of macroscopic transport coefficients from deterministic dynamics. We show that the frequency of the oscillator can be tuned to the microscopic frequencies of the booster without affecting the canonical nature of the “macroscopic” statistics. The theoretical predictions are supported by numerical simulations.  相似文献   
39.
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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