全文获取类型
收费全文 | 89013篇 |
免费 | 7320篇 |
国内免费 | 7486篇 |
专业分类
化学 | 27565篇 |
晶体学 | 354篇 |
力学 | 7223篇 |
综合类 | 1261篇 |
数学 | 25254篇 |
物理学 | 22452篇 |
无线电 | 19710篇 |
出版年
2024年 | 158篇 |
2023年 | 936篇 |
2022年 | 1472篇 |
2021年 | 1807篇 |
2020年 | 1944篇 |
2019年 | 2030篇 |
2018年 | 1710篇 |
2017年 | 2106篇 |
2016年 | 2459篇 |
2015年 | 2420篇 |
2014年 | 3705篇 |
2013年 | 5611篇 |
2012年 | 4105篇 |
2011年 | 4402篇 |
2010年 | 3670篇 |
2009年 | 4739篇 |
2008年 | 5262篇 |
2007年 | 5639篇 |
2006年 | 5340篇 |
2005年 | 4551篇 |
2004年 | 4160篇 |
2003年 | 4180篇 |
2002年 | 3683篇 |
2001年 | 3107篇 |
2000年 | 2987篇 |
1999年 | 2599篇 |
1998年 | 2381篇 |
1997年 | 1975篇 |
1996年 | 1845篇 |
1995年 | 1620篇 |
1994年 | 1464篇 |
1993年 | 1270篇 |
1992年 | 1193篇 |
1991年 | 946篇 |
1990年 | 796篇 |
1989年 | 665篇 |
1988年 | 589篇 |
1987年 | 440篇 |
1986年 | 376篇 |
1985年 | 444篇 |
1984年 | 440篇 |
1983年 | 219篇 |
1982年 | 353篇 |
1981年 | 404篇 |
1980年 | 309篇 |
1979年 | 294篇 |
1978年 | 221篇 |
1977年 | 208篇 |
1976年 | 155篇 |
1974年 | 110篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
文章报道了用分子束外延(MBE)法在600℃和650℃下,在Si掺杂的GaAs衬底的(311)A和(311)B面上成功地生长了高质量的AlxGa1-As/GaAs单量子阱材料。计算了光荧光(PL)峰值能量,并与实验作了比较。讨论了(311)A和(311)B面上的不同生长特性。 相似文献
32.
侯旻 《新疆大学学报(理工版)》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/α)}。 相似文献
33.
34.
Paul Howard 《Mathematical Logic Quarterly》2007,53(3):247-254
Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?2 has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
35.
一类拟线性大系统的稳定性 总被引:1,自引:0,他引:1
彭晓林 《新疆大学学报(理工版)》1991,8(1):41-45
本文应用大系统的分解方法和一个推广的不等式,研究了一类拟线性大系统的稳定性问题,所得结果简洁、易于验证,且推导过程不复杂,最后给出了应用实例。 相似文献
36.
F. A. Potra 《Journal of Optimization Theory and Applications》1989,63(3):415-431
We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper. 相似文献
37.
Based on the Dyson-Schwinger equations of QCD in the "rainbow" approximation, the fully dressed quarkpropagator Sf(p) is investigated, and then an algebraic parametrization form of the propagator is obtained as a solutionof the equations. The dressed quark amplitudes Af and Bf built up the fully dressed quark propagator and the dynamicalrunning masses Mf defined by Af and Bf for light quarks u, d and s are calculated, respectively. Using the predictedrunning masses Mf, quark condensates <0|q(0)q(0)|0> = -(0.255 GeV)a for u, d quarks, and <0|s s|0> = 0.8<0|q(0)q(0)]0)for s quark, and experimental pion decay constant fπ = 0.093 GeV, the masses of Goldstone bosons K, π, and η are alsoevaluated. The numerical results show that the masses of quarks are dependent on their momentum p2. The fully dressedquark amplitudes Af and Bf have correct behaviors which can be used for many purposes in our future researches onnonperturbative QCD. 相似文献
38.
Gerhard Lischke 《Mathematical Logic Quarterly》2006,52(1):20-28
Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
39.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
40.
本工作用x射线衍射技术分析计算了二种天然树脂的局部结构参数,由测得的衍射强度数据求出了它们的结构因子I(r)和径向分布函数RDF(r),并由此得到了分子链内临近原子和次临近原子平均间距、配位数和短程有序畴。 相似文献