全文获取类型
收费全文 | 9486篇 |
免费 | 914篇 |
国内免费 | 1114篇 |
专业分类
化学 | 2447篇 |
晶体学 | 52篇 |
力学 | 1171篇 |
综合类 | 154篇 |
数学 | 5970篇 |
物理学 | 1720篇 |
出版年
2024年 | 17篇 |
2023年 | 101篇 |
2022年 | 182篇 |
2021年 | 202篇 |
2020年 | 282篇 |
2019年 | 264篇 |
2018年 | 254篇 |
2017年 | 330篇 |
2016年 | 301篇 |
2015年 | 256篇 |
2014年 | 424篇 |
2013年 | 766篇 |
2012年 | 479篇 |
2011年 | 567篇 |
2010年 | 471篇 |
2009年 | 669篇 |
2008年 | 618篇 |
2007年 | 613篇 |
2006年 | 540篇 |
2005年 | 518篇 |
2004年 | 436篇 |
2003年 | 409篇 |
2002年 | 366篇 |
2001年 | 276篇 |
2000年 | 298篇 |
1999年 | 290篇 |
1998年 | 286篇 |
1997年 | 244篇 |
1996年 | 165篇 |
1995年 | 119篇 |
1994年 | 116篇 |
1993年 | 79篇 |
1992年 | 83篇 |
1991年 | 68篇 |
1990年 | 55篇 |
1989年 | 35篇 |
1988年 | 42篇 |
1987年 | 42篇 |
1986年 | 40篇 |
1985年 | 27篇 |
1984年 | 31篇 |
1983年 | 8篇 |
1982年 | 21篇 |
1981年 | 16篇 |
1980年 | 19篇 |
1979年 | 22篇 |
1978年 | 20篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1972年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Analytical approach is presented to the isoperimetric type problems of finding convex figures separated by current hyperplanes. 相似文献
92.
为了进一步研究纳米导线阵列的排列形状以及阵列数目对其场发射行为的影响,利用镜像悬浮球模型对正方形以及六边形排列的纳米导线阵列的场发射行为进行计算与模拟,近似的得到纳米导线阵列的场发射增强因子满足如下的变化趋势:β=h/ρ(1/1+W)+1/2(1/1+W)2+3,其中h为纳米导线的高度,ρ为纳米导线的半径,W是以R为自变量的函数,R为纳米导线阵列的间距.结果显示纳米导线阵列的排列形状对其场发射性能的影响较小,而阵列间距则是影响场发射性能的关键因素:当R<R0时,场发射增强因子随着阵列间距的减小而急剧减小;当R>R0时,场发射增强因子基本不变,其中R0为导线阵列场发射的最佳间距.进一步研究表明改变纳米导线阵列的数目基本不会改变阵列的场发射性能随间距的变化趋势,但是随着阵列数目的增加,R0会有一定程度的减小,场发射增强因子也会降低.
关键词:
纳米导线
场发射
增强因子
阵列数目 相似文献
93.
关于Ramsey数下界的部分结果 总被引:3,自引:1,他引:2
刘富贵 《数学的实践与认识》2002,32(1):97-99
本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 . 相似文献
94.
We have investigated the low-lying collective states and electromagnetic transitions in 94Mo within the framework of the interacting boson model. The influence of model parameters on the energy levels and electromagnetic properties has been investigated. The analysis of the obtained results and the parameter values predict that the 23+state is the lowest mixed symmetry state with pure F = Fmax - 1 in this nucleus. The calculated results predicate that the 25+ (two-Q-phonon) mixed symmetry state is closed to the J = 2+ at 2.870 MeV in the experimental data, and the 2.965 MeV state is the lowest mixed symmetry with J = 3+. 相似文献
95.
A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γa(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γa(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γa(G)-δ(G)?k. 相似文献
96.
Nusselt number correlations for heat transfer to small spheres in thermal plasma flows 总被引:1,自引:0,他引:1
Seven different equations predicting heat transfer rates to small spheres in plasma flows are examined considering argon and nitrogan as plasma gases from 300 to 21,000 K at 1 atm. For argon there is a general consensus up to 9000 K, beyond which wide deviations in behavior occur. For nitrogen, the seven correlations are in good agreement up to 4000 K, but show substantial deviations beyond this value. Comparisons with the sparsely available experimental data are made for argon from 300 to 17,000 K and for nitrogen up to 5500 K. Disagreement between the various correlations and experiment can exceed one order of magnitude. 相似文献
97.
Zhangxin Chen 《Numerical Methods for Partial Differential Equations》2002,18(2):203-217
In this article we prove uniform convergence estimates for the recently developed Galerkin‐multigrid methods for nonconforming finite elements for second‐order problems with less than full elliptic regularity. These multigrid methods are defined in terms of the “Galerkin approach,” where quadratic forms over coarse grids are constructed using the quadratic form on the finest grid and iterated coarse‐to‐fine intergrid transfer operators. Previously, uniform estimates were obtained for problems with full elliptic regularity, whereas these estimates are derived with less than full elliptic regularity here. Applications to the nonconforming P1, rotated Q1, and Wilson finite elements are analyzed. The result applies to the mixed method based on finite elements that are equivalent to these nonconforming elements. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 203–217, 2002; DOI 10.1002/num.10004 相似文献
98.
研究了十二烷基三苯基溴化鏻(C_(12)PBr)胶束中N,N-二甲基苯胺(DMA)和二苯甲酮(DPK)对芘的荧光猝灭,发现DMA的猝灭行为不符合Stern-Volmer动态猝灭和Turro静态猝灭模型;DPK的猝灭行为不符合Stern-Volmer猝灭模型,但遵从Turro静态猝灭模型。根据DPK的静态猝灭性质测得C_(12)PBr胶束的平均簇集数为15士2,并相应地得到C_(12)PBr的临界胶束浓度为(1.77±0.09)×10~(-3)mol/L,后者与文献值一致。 相似文献
99.
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 相似文献
100.
A graph G is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3‐connected 3‐domination critical graph of order n. In this paper, we show that there is a path of length at least n?2 between any two distinct vertices in G and the lower bound is sharp. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 76–85, 2002 相似文献