首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1453篇
  免费   23篇
  国内免费   19篇
化学   818篇
晶体学   17篇
力学   17篇
数学   129篇
物理学   514篇
  2016年   15篇
  2015年   12篇
  2014年   12篇
  2013年   38篇
  2012年   29篇
  2011年   61篇
  2010年   33篇
  2009年   34篇
  2008年   51篇
  2007年   44篇
  2006年   63篇
  2005年   46篇
  2004年   51篇
  2003年   53篇
  2002年   44篇
  2001年   33篇
  2000年   36篇
  1999年   26篇
  1998年   19篇
  1997年   20篇
  1996年   27篇
  1995年   33篇
  1994年   38篇
  1993年   26篇
  1992年   34篇
  1991年   27篇
  1990年   33篇
  1989年   25篇
  1988年   23篇
  1987年   20篇
  1986年   19篇
  1985年   21篇
  1984年   27篇
  1983年   21篇
  1982年   13篇
  1981年   10篇
  1980年   21篇
  1979年   19篇
  1978年   20篇
  1977年   10篇
  1976年   22篇
  1975年   20篇
  1974年   29篇
  1973年   22篇
  1972年   15篇
  1970年   11篇
  1969年   16篇
  1968年   16篇
  1967年   19篇
  1966年   16篇
排序方式: 共有1495条查询结果,搜索用时 22 毫秒
11.
12.
13.
14.
15.
The conditions for macroscopic segregation ofA andB in a steady-stateA+B 0 reaction are studied in infinite systems. Segregation occurs in one and two dimensions and is marginal ford=3. We note the dependence of these results on the precise experimental conditions assumed in the theory. We also note the difference between these results and our earlier ones for finite systems where the critical dimension isd=2.  相似文献   
16.
17.
For an arbitrary poset P, subposets {P i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.  相似文献   
18.
19.
Cerium(III) ions in dilute sulphuric acid medium exhibit a characteristic fluorescence which has its excitation maximum at 260 nm and its fluorescence emission maximum at 350 nm. By utilising the osmium-catalysed redox reaction between cerium(IV) and arsenic(III), microgram amounts of arsenic (7.5–37.5 μg) may be determined by spectrofluorimetric measurement of the ceriurm(III) produced. The principle may be applied to the determination of several other ions which cannot yet be determined by direct spectrofluorimetry, e.g.. Fe(II) (5.6–28 μg), oxalate (8.8–44μg). Osmium(VIII) (0.05–0.2 μg) and iodide (0.6–2.5 μg) may be determined by their catalytic action.  相似文献   
20.
A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x 1<...ksuch that (x 1)...(xk). Let P nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + k, k) , where k 0 as k. Alternatively, the largest k such that every regression on P nis guaranteed to have a monotone k-chain lies between lg*(n) and lg*(n)–2, inclusive, where lg*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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