全文获取类型
收费全文 | 6181篇 |
免费 | 1050篇 |
国内免费 | 619篇 |
专业分类
化学 | 3986篇 |
晶体学 | 59篇 |
力学 | 330篇 |
综合类 | 37篇 |
数学 | 798篇 |
物理学 | 2640篇 |
出版年
2024年 | 25篇 |
2023年 | 138篇 |
2022年 | 225篇 |
2021年 | 234篇 |
2020年 | 245篇 |
2019年 | 210篇 |
2018年 | 200篇 |
2017年 | 186篇 |
2016年 | 312篇 |
2015年 | 272篇 |
2014年 | 369篇 |
2013年 | 414篇 |
2012年 | 511篇 |
2011年 | 582篇 |
2010年 | 357篇 |
2009年 | 349篇 |
2008年 | 378篇 |
2007年 | 348篇 |
2006年 | 328篇 |
2005年 | 287篇 |
2004年 | 206篇 |
2003年 | 175篇 |
2002年 | 208篇 |
2001年 | 162篇 |
2000年 | 129篇 |
1999年 | 173篇 |
1998年 | 137篇 |
1997年 | 112篇 |
1996年 | 109篇 |
1995年 | 76篇 |
1994年 | 56篇 |
1993年 | 53篇 |
1992年 | 51篇 |
1991年 | 61篇 |
1990年 | 33篇 |
1989年 | 28篇 |
1988年 | 22篇 |
1987年 | 18篇 |
1986年 | 23篇 |
1985年 | 17篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有7850条查询结果,搜索用时 0 毫秒
1.
2.
3.
在氢化丁苯共聚物13C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的1H-和13C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。 相似文献
4.
5.
6.
A two-step swelling procedure was adopted to synthesize mono-dispersed and highly cross-linked poly (St-divinylbenzene) particles
with PSt micro-spheres (1.80 μm in diameter). The PSt micro-spheres were prepared by a dispersion polymerization method and
used as seeds. The effects of monomer concentration, ratio of ethanol to water, swelling reagents, crosslinking reagents,
swelling temperature and agitation speed on particle size were investigated in detail. The morphologies and size distributions
of these micro-spheres were examined by SEM and particle size analysis (PSA). The T
g of the micro-spheres was measured by DSC. The results indicate that the particles (6.20 μm in diameter) exhibit excellent
mono dispersed property and high crosslinking degree when the concentration of the swelling reagent was 25%, the concentration
of the crosslinking reagents was 23%, the swelling temperature was 30°C and the stirring speed was 150 r/min.
__________
Translated from Chinese Journal of Applied Chemistry, 2007, 24(11): 1289–1294 相似文献
7.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
8.
Qing Shi Dong Yang Yanlei Su Jian Li Zhongyi Jiang Yanjun Jiang Weikang Yuan 《Journal of nanoparticle research》2007,9(6):1205-1210
Lipase from Candida rugosa was covalently anchored onto acid-treated multi-walled carbon nanotubes (MWNTs) through a self-catalytic mechanism. A variety
of characterization techniques including FTIR, Raman spectroscopy, and XPS were employed to demonstrate the formation of the
ester linkage between lipase and MWNTs. The MWNTs-lipase biocomposites showed significantly increased solubility in some common-used
organic solvents, such as THF, DMF and chloroform. This study may offer a novel and facile route for covalent modification
of carbon nanotubes, and expand the potential utilization of both lipases and MWNTs in the fields of biocatalyst and biosensor. 相似文献
9.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
10.
In this paper, an interior point algorithm based on trust region techniques is proposed for solving nonlinear optimization problems with linear equality constraints and nonnegative variables. Unlike those existing interior-point trust region methods, this proposed method does not require that a general quadratic subproblem with a trust region bound be solved at each iteration. Instead, a system of linear equations is solved to get a search direction, and then a linesearch of Armijo type is performed in this direction to obtain a new iteration point. From a computational point of view, this approach may in general reduce a computational effort, and thus improve the computational efficiency. Under suitable conditions, it is proven that any accumulation of the sequence generated by the algorithm satisfies the first-order optimality condition. 相似文献