首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1499篇
  免费   83篇
  国内免费   4篇
化学   1195篇
晶体学   1篇
力学   25篇
数学   168篇
物理学   197篇
  2023年   10篇
  2022年   9篇
  2021年   17篇
  2020年   35篇
  2019年   30篇
  2018年   14篇
  2017年   9篇
  2016年   68篇
  2015年   54篇
  2014年   64篇
  2013年   75篇
  2012年   128篇
  2011年   115篇
  2010年   73篇
  2009年   54篇
  2008年   106篇
  2007年   84篇
  2006年   95篇
  2005年   72篇
  2004年   95篇
  2003年   70篇
  2002年   53篇
  2001年   35篇
  2000年   21篇
  1999年   16篇
  1998年   13篇
  1997年   13篇
  1996年   22篇
  1995年   17篇
  1994年   21篇
  1993年   4篇
  1992年   8篇
  1991年   4篇
  1990年   5篇
  1986年   3篇
  1984年   3篇
  1983年   3篇
  1982年   3篇
  1981年   8篇
  1980年   6篇
  1978年   6篇
  1976年   3篇
  1975年   3篇
  1973年   4篇
  1970年   3篇
  1968年   3篇
  1966年   3篇
  1965年   3篇
  1963年   4篇
  1962年   3篇
排序方式: 共有1586条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
A method was developed for free‐radical polymerization in the confines of a hollow latex particle. Hollow particles were prepared via the dynamic swelling method from polystyrene seed and divinylbenzene and had hollows of 500–1000 nm. So that these hollow poly(divinylbenzene) particles could function as submicrometer reactors, the particles were filled with a monomer (N‐isopropylacrylamide) via the dispersion of the dried particles in the molten monomer. The monomer that was not contained in the hollows was removed by washing and gentle abrasion. Free‐radical polymerization was then initiated by γ radiolysis in the solid state. Transmission electron microscopy showed that poly(N‐isopropylacrylamide) formed in the hollow interior of the particles, which functioned as submicrometer reactors. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5706–5713, 2004  相似文献   
5.
We have used Affymetrix gene chips to measure the expression of 10 CESA and 29 CSL genes of Arabidopsis in different developmental stages or organs. These measurements reveal that many of the genes exhibit different levels of expression in the various organs. While several CESA genes are highly expressed in all the tissues examined, very few CSL genes approach such high levels of expression. This suggests that the CSL genes either encode enzymes for the synthesis of minor components of cell walls or are expressed only in specific cell types. The expression data also highlights the potential importance of the CESA genes for primary and secondary cell wall formation during different developmental stages and in the different organs examined.  相似文献   
6.
7.
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.  相似文献   
8.
9.
10.
Active set algorithms for isotonic regression; A unifying framework   总被引:1,自引:0,他引:1  
In this and subsequent papers we will show that several algorithms for the isotonic regression problem may be viewed as active set methods. The active set approach provides a unifying framework for studying algorithms for isotonic regression, simplifies the exposition of existing algorithms and leads to several new efficient algorithms. We also investigate the computational complexity of several algorithms.In this paper we consider the isotonic regression problem with respect to a complete order where eachw i is strictly positive and eachy i is an arbitrary real number. We show that the Pool Adjacent Violators algorithm (due to Ayer et al., 1955; Miles, 1959; Kruskal, 1964), is a dual feasible active set method and that the Minimum Lower Set algorithm (due to Brunk et al., 1957) is a primal feasible active set method of computational complexity O(n 2). We present a new O(n) primal feasible active set algorithm. Finally we discuss Van Eeden's method and show that it is of worst-case exponential time complexity.This work was supported by the National Science and Engineering Research Council of Canada under Research Grant A8189 and an Ontario Graduate Scholarship.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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