全文获取类型
收费全文 | 12768篇 |
免费 | 1518篇 |
国内免费 | 768篇 |
专业分类
化学 | 4212篇 |
晶体学 | 32篇 |
力学 | 802篇 |
综合类 | 327篇 |
数学 | 7111篇 |
物理学 | 2570篇 |
出版年
2024年 | 24篇 |
2023年 | 198篇 |
2022年 | 349篇 |
2021年 | 439篇 |
2020年 | 578篇 |
2019年 | 474篇 |
2018年 | 448篇 |
2017年 | 535篇 |
2016年 | 527篇 |
2015年 | 433篇 |
2014年 | 637篇 |
2013年 | 896篇 |
2012年 | 673篇 |
2011年 | 740篇 |
2010年 | 677篇 |
2009年 | 904篇 |
2008年 | 806篇 |
2007年 | 719篇 |
2006年 | 732篇 |
2005年 | 570篇 |
2004年 | 519篇 |
2003年 | 443篇 |
2002年 | 391篇 |
2001年 | 332篇 |
2000年 | 323篇 |
1999年 | 283篇 |
1998年 | 270篇 |
1997年 | 188篇 |
1996年 | 142篇 |
1995年 | 154篇 |
1994年 | 120篇 |
1993年 | 95篇 |
1992年 | 84篇 |
1991年 | 49篇 |
1990年 | 41篇 |
1989年 | 39篇 |
1988年 | 29篇 |
1987年 | 25篇 |
1986年 | 20篇 |
1985年 | 38篇 |
1984年 | 28篇 |
1983年 | 8篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
71.
简析"静止液体内部压强公式验证"实验的设计策略 总被引:1,自引:1,他引:0
“静止液体内部压强公式验证”在现行教材中有两种实验方法。通过分析实验的设计策略,说明其作用、效果及操作上的困难,指出合理的与不合理诸因素,从而提出改进实验的方法,化难为易,提高实验教学效果。 相似文献
72.
A convergent-barrel (CB) cold spray nozzle was designed through numerical simulation. It was found that the main factors influencing significantly particle velocity and temperature include the length and diameter of the barrel section, the nature of the accelerating gas and its pressure and temperature, and the particle size. Particles can achieve a relatively low velocity but a high temperature under the same gas pressure using a CB nozzle compared to a convergent-divergent (CD) nozzle. The experiment results with Cu powder using the designed CB nozzle confirmed that particle deposition can be realized under a lower gas pressure with a CB nozzle. 相似文献
73.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
74.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
75.
76.
Temperature effects on deposition rate of silicon nitride films were characterized by building a neural network prediction model. The silicon nitride films were deposited by using a plasma enhanced chemical vapor deposition system and process parameter effects were systematically characterized by 26−1 fractional factorial experiment. The process parameters involved include a radio frequency power, pressure, temperature, SiH4, N2, and NH3 flow rates. The prediction performance of generalized regression neural network was drastically improved by optimizing multi-valued training factors using a genetic algorithm. Several 3D plots were generated to investigate parameter effects at various temperatures. Predicted variations were experimentally validated. The temperature effect on the deposition rate was a complex function of parameters but N2 flow rate. Larger decreases in the deposition rate with the temperature were only noticed at lower SiH4 (or higher NH3) flow rates. Typical effects of SiH4 or NH3 flow rate were only observed at higher or lower temperatures. A comparison with the refractive index model facilitated a selective choice of either SiH4 or NH3 for process optimization. 相似文献
77.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
78.
79.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献
80.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献