全文获取类型
收费全文 | 6203篇 |
免费 | 167篇 |
国内免费 | 44篇 |
专业分类
化学 | 4618篇 |
晶体学 | 66篇 |
力学 | 143篇 |
数学 | 663篇 |
物理学 | 924篇 |
出版年
2023年 | 26篇 |
2022年 | 48篇 |
2021年 | 50篇 |
2020年 | 76篇 |
2019年 | 95篇 |
2018年 | 66篇 |
2017年 | 46篇 |
2016年 | 132篇 |
2015年 | 109篇 |
2014年 | 122篇 |
2013年 | 274篇 |
2012年 | 373篇 |
2011年 | 462篇 |
2010年 | 220篇 |
2009年 | 190篇 |
2008年 | 392篇 |
2007年 | 446篇 |
2006年 | 439篇 |
2005年 | 434篇 |
2004年 | 397篇 |
2003年 | 313篇 |
2002年 | 279篇 |
2001年 | 88篇 |
2000年 | 68篇 |
1999年 | 72篇 |
1998年 | 78篇 |
1997年 | 56篇 |
1996年 | 83篇 |
1995年 | 62篇 |
1994年 | 59篇 |
1993年 | 43篇 |
1992年 | 43篇 |
1991年 | 47篇 |
1990年 | 45篇 |
1989年 | 36篇 |
1988年 | 38篇 |
1987年 | 30篇 |
1986年 | 30篇 |
1985年 | 53篇 |
1984年 | 52篇 |
1983年 | 48篇 |
1982年 | 46篇 |
1981年 | 47篇 |
1980年 | 44篇 |
1979年 | 43篇 |
1978年 | 49篇 |
1977年 | 40篇 |
1976年 | 37篇 |
1975年 | 23篇 |
1974年 | 23篇 |
排序方式: 共有6414条查询结果,搜索用时 0 毫秒
1.
2.
Brian R. Holder Colleen A. McNaney David Luchetti Eric Schaeffer Dieter M. Drexler 《Biomedical chromatography : BMC》2015,29(9):1375-1379
Acetyl‐l ‐carnitine (ALCAR) is a potential biomarker for the modulation of brain neurotransmitter activity, but is also present in cerebrospinal fluid (CSF). Recent studies have utilized hydrophilic interaction liquid chromatography–tandem mass spectrometry (HILIC‐MS/MS) based assays to detect and quantify ALCAR within biofluids such as urine, plasma and serum, using various sample pretreatment procedures. In order to address the need to quantify ALCAR in CSF on a high‐throughput scale, a new and simple HILIC‐MS/MS assay has been successfully developed and validated. For rapid analysis, CSF sample pretreatment was performed via ‘dilute and shoot’ directly onto an advanced HILIC column prior to MS/MS detection. This newly developed HILIC‐MS/MS assay shows good recoveries of ALCAR without the need for chemical derivatization and multistep sample extraction procedures. The employment of this assay is suitable for the high‐throughput bioanalysis and quantification of ALCAR within the CSF of various animal models and human clinical studies. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
3.
Transition Metal Chemistry - (η5-Dp)Ru(PPh3)2H (Dp?=?C8H9?, 1,2-dihydropentalenyl) was synthesized in 90% yield by reaction of (η5-Dp)Ru(PPh3)2Cl with sodium formate.... 相似文献
4.
Brian R. Hunt 《Proceedings of the American Mathematical Society》1998,126(3):791-800
The Weierstrass nowhere differentiable function, and functions constructed from similar infinite series, have been studied often as examples of functions whose graph is a fractal. Though there is a simple formula for the Hausdorff dimension of the graph which is widely accepted, it has not been rigorously proved to hold. We prove that if arbitrary phases are included in each term of the summation for the Weierstrass function, the Hausdorff dimension of the graph of the function has the conjectured value for almost every sequence of phases. The argument extends to a much wider class of Weierstrass-like functions.
5.
Brian H. Bowditch 《Transactions of the American Mathematical Society》2002,354(3):1049-1078
We describe a means of constructing splittings of a one-ended finitely generated group over two-ended subgroups, starting with a finite collection of codimension-one two-ended subgroups. In the case where all the two-ended subgroups have two-ended commensurators, we obtain an annulus theorem, and a form of the JSJ splitting of Rips and Sela. The construction uses ideas from the work of Dunwoody, Sageev and Swenson. We use a particular kind of order structure which combines cyclic orders and treelike structures. In the special case of hyperbolic groups, this provides a link between combinarorial constructions, and constructions arising from the topological structure of the boundary. In this context, we recover the annulus theorem of Scott and Swarup. We also show that a one-ended finitely generated group which contains an infinite-order element, and such that every infinite cyclic subgroup is (virtually) codimension-one is a virtual surface group.
6.
We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006 相似文献
7.
L. Brian Lawrence 《Transactions of the American Mathematical Society》2005,357(7):2535-2556
Working in ZFC, we give an example as indicated in the title.
8.
T. Brian Cavitt Brian Phillips Charles E. Hoyle Bo Pan Sukhendu B. Hait Kalyanaraman Viswanathan Sonny Jnsson 《Journal of polymer science. Part A, Polymer chemistry》2004,42(16):4009-4015
Three‐component photoinitiators comprised of an N‐arylphthalimide, a diarylketone, and a tertiary amine were investigated for their initiation efficiency of acrylate polymerization. The use of an electron‐deficient N‐arylphthalimide resulted in a greater acrylate polymerization rate than an electron‐rich N‐arylphthalimide. Triplet energies of each N‐arylphthalimide, determined from their phosphorescence spectra, and the respective rate constants for triplet quenching by the N‐arylphthalimide derivatives (acquired via laser flash photolysis) indicated that an electron–proton transfer from an intermediate radical species to the N‐arylphthalimide (not energy transfer from triplet sensitization) is responsible for generating the initiating radicals under the conditions and species concentrations used for polymerization. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 4009–4015, 2004 相似文献
9.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
10.