全文获取类型
收费全文 | 4139篇 |
免费 | 423篇 |
国内免费 | 331篇 |
专业分类
化学 | 783篇 |
晶体学 | 12篇 |
力学 | 303篇 |
综合类 | 104篇 |
数学 | 2538篇 |
物理学 | 1153篇 |
出版年
2024年 | 9篇 |
2023年 | 44篇 |
2022年 | 128篇 |
2021年 | 153篇 |
2020年 | 151篇 |
2019年 | 127篇 |
2018年 | 120篇 |
2017年 | 164篇 |
2016年 | 149篇 |
2015年 | 129篇 |
2014年 | 251篇 |
2013年 | 290篇 |
2012年 | 197篇 |
2011年 | 235篇 |
2010年 | 191篇 |
2009年 | 291篇 |
2008年 | 256篇 |
2007年 | 247篇 |
2006年 | 224篇 |
2005年 | 197篇 |
2004年 | 169篇 |
2003年 | 163篇 |
2002年 | 138篇 |
2001年 | 108篇 |
2000年 | 122篇 |
1999年 | 115篇 |
1998年 | 110篇 |
1997年 | 86篇 |
1996年 | 63篇 |
1995年 | 39篇 |
1994年 | 46篇 |
1993年 | 29篇 |
1992年 | 22篇 |
1991年 | 26篇 |
1990年 | 18篇 |
1989年 | 8篇 |
1988年 | 14篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1973年 | 3篇 |
1972年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有4893条查询结果,搜索用时 31 毫秒
41.
A method has been developed to determine the boiling point distribution of sulfur compounds in light cycle oils (LCO'S). The method chosen for this analysis was GC with a flame photometric detector (FPD) and pyrolyzer. Tests were carried out to evaluate the recovery efficiency, repeatability, and accuracy of the method. Repeatabilities within 2% were obtained. The recovery of benzothiophenes and dibenzothiophenes was close to 100%; this was important because these are the major sulfur components in LCO's. No hydrocarbon or solvent interferences were observed with the use of the pyrolyzer, even for a 95% solvent level. Comparison with results from other techniques showed that the method accurately determined the levels of sulfur compounds in the LCO boiling point range. 相似文献
42.
43.
排气全燃型联合循环设计点性能简明估计公式 总被引:1,自引:0,他引:1
排气全燃型联合循环设计点性能简明估计公式蔡睿贤(中国科学院工程热物理研究所北京10O080)关键词:排气全燃型联合循环,热力分析主要符号表Hu燃料热值L燃料理论空气量l比功P单位能量价格R燃气轮机与蒸汽轮机的功率比α过量空气系数β摩尔燃料系数△增量η... 相似文献
44.
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies. 相似文献
45.
The symplectic, optical, and photon-number tomographic symbols of binomial states of the radiation field are studied. Explicit relations for all tomograms of the binomial states are obtained. Two measures for nonclassical properties of these states are discussed. 相似文献
46.
Heinz H. Bauschke Patrick L. Combettes 《Proceedings of the American Mathematical Society》2003,131(12):3757-3766
An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.
47.
The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature. 相似文献
48.
49.
Total syntheses of the peptide enamide natural products terpeptin and aspergillamides A and B are reported. An oxidative decarboxylation-elimination protocol is employed to construct the indolic enamide moiety. Unambiguous stereochemical assignment of (−)-terpeptin is accomplished by synthesis of all possible stereochemical analogues. Select compounds have been evaluated in cell cycle inhibitor assays which show that the natural amino acid configuration of terpeptin has the most potent inhibitory activity. 相似文献
50.
Frank N. Proske Madan L. Puri 《Proceedings of the American Mathematical Society》2003,131(9):2937-2944
In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.