首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1290篇
  免费   55篇
  国内免费   4篇
化学   1032篇
晶体学   3篇
力学   23篇
数学   190篇
物理学   101篇
  2022年   5篇
  2021年   5篇
  2020年   11篇
  2019年   14篇
  2018年   10篇
  2016年   23篇
  2015年   44篇
  2014年   30篇
  2013年   78篇
  2012年   74篇
  2011年   73篇
  2010年   33篇
  2009年   36篇
  2008年   61篇
  2007年   45篇
  2006年   33篇
  2005年   49篇
  2004年   51篇
  2003年   26篇
  2002年   33篇
  2001年   15篇
  2000年   22篇
  1999年   19篇
  1998年   23篇
  1997年   32篇
  1996年   31篇
  1995年   30篇
  1994年   27篇
  1993年   38篇
  1992年   21篇
  1991年   21篇
  1990年   14篇
  1989年   17篇
  1988年   24篇
  1987年   10篇
  1986年   15篇
  1985年   19篇
  1984年   15篇
  1983年   22篇
  1982年   12篇
  1981年   12篇
  1980年   14篇
  1979年   21篇
  1978年   33篇
  1977年   20篇
  1976年   15篇
  1975年   15篇
  1974年   11篇
  1973年   18篇
  1972年   10篇
排序方式: 共有1349条查询结果,搜索用时 15 毫秒
121.
122.
123.
124.
In 1983/1984, in the course of the 28th Soviet Antarctic Expedition, waterbody, ice cover, and surrounding glaciers of the lakes Untersee and Obersee were sampled along some depth profiles. The geochemical data of those samples, now available, show the homogeneity of both large lakes in vertical (down to the maximum depth) as well as in lateral directions. The comparison of isotope and chemical composition of lake water and adjoining glacier ice suggests strong differences in the long-term evolution between the lakes Untersee and Obersee. First data from a lakelet, embedded in the large morainic area to the west of Lake Untersee, are of special interest: the δ(2)H values of the lakelet water are lower than those of recent regional glacier ice by 50‰ SMOW. This fact indicates that the lakelet is fed episodically by Pleistocene dead ice, covered by the morainic material.  相似文献   
125.
Dietmar Cieslik   《Discrete Mathematics》2003,260(1-3):189-196
Steiner's Problem is the “Problem of shortest connectivity”, that means, given a finite set of points in a metric space (X,ρ), search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called Steiner points. If we do not allow Steiner points, that means, we only connect certain pairs of the given points, we get a tree which is called a Minimum Spanning Tree (MST). Steiner's Problem is very hard as well in combinatorial as in computational sense, but, on the other hand, the determination of an MST is simple. Consequently, we are interested in the greatest lower bound for the ratio between the lengths of these both trees:
which is called the Steiner ratio (of (X,ρ)). We look for estimates and exact values for the Steiner ratio in several discrete metric spaces. Particularly, we determine the Steiner ratio for spaces of words, and we estimate the Steiner ratio for specific graphs.  相似文献   
126.
A straightforward method for the preparation of polysiloxanes grafted with carbohydrate side groups is described. Two kinds of backbones have been functionalized, namely one‐dimensional, linear polysiloxanes, and hyperbranched poly(siloxysilane)s based on cyclotetrasiloxanes. The method enables us to keep a good integrity of the polysiloxane backbone. The introduction of intermediate activated esters as side groups on the polysiloxane backbone ensures a complete homogeneity of the reaction medium during sugar grafting in dimethyl sulfoxide, and consequently an easy grafting with the unprotected amino sugar. Solubility of the resulting polysiloxanes has been tested in various solvents. The sugar‐grafted polysiloxanes are good candidates for applications such as silicone formulations, hydrophilic silicone elastomers, interactions with metallic nanoparticles, and suspension stabilization, or as starting point for the design of more complex polysiloxanes for molecular recognition. © 2013 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2013, 51, 3607–3618  相似文献   
127.
128.
129.
130.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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