全文获取类型
收费全文 | 8618篇 |
免费 | 929篇 |
国内免费 | 901篇 |
专业分类
化学 | 1239篇 |
晶体学 | 16篇 |
力学 | 1045篇 |
综合类 | 144篇 |
数学 | 5686篇 |
物理学 | 2318篇 |
出版年
2024年 | 16篇 |
2023年 | 94篇 |
2022年 | 219篇 |
2021年 | 219篇 |
2020年 | 265篇 |
2019年 | 248篇 |
2018年 | 241篇 |
2017年 | 279篇 |
2016年 | 272篇 |
2015年 | 220篇 |
2014年 | 345篇 |
2013年 | 633篇 |
2012年 | 399篇 |
2011年 | 505篇 |
2010年 | 438篇 |
2009年 | 630篇 |
2008年 | 603篇 |
2007年 | 558篇 |
2006年 | 522篇 |
2005年 | 489篇 |
2004年 | 365篇 |
2003年 | 357篇 |
2002年 | 323篇 |
2001年 | 269篇 |
2000年 | 256篇 |
1999年 | 233篇 |
1998年 | 250篇 |
1997年 | 204篇 |
1996年 | 152篇 |
1995年 | 102篇 |
1994年 | 111篇 |
1993年 | 67篇 |
1992年 | 66篇 |
1991年 | 57篇 |
1990年 | 42篇 |
1989年 | 43篇 |
1988年 | 38篇 |
1987年 | 36篇 |
1986年 | 32篇 |
1985年 | 34篇 |
1984年 | 37篇 |
1983年 | 10篇 |
1982年 | 19篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 28篇 |
1978年 | 24篇 |
1977年 | 13篇 |
1976年 | 10篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
101.
Rb(5PJ)+Rb(5PJ)→Rb(5JS)+Rb(nl=5D,7S)碰撞能量合并 总被引:1,自引:1,他引:0
研究了Rb(5PJ)+Rb(5PJ)→Rb(nlJ')+Rb(5S)碰撞能量合并过程,利用单模半导体激光器分别共振激发Rb原子的5P1/2或5P3/2态,利用另一与泵浦激光束反向平行的单模激光束作为吸收线探测激发态原子密度及其空间分布,吸收线分别调至5P1/2→5D3/2和5P3/2→7S1/2跃迁.由激发态原子密度和谱线荧光比得到碰撞能量合并过程的截面,对5P3/2激发,碰撞转移得到5D5/2,5D3/2和7S1/2的截面分别是(1.32士0.59)×10-14,(1.18士0.53)×10-14和(3.21士1.44)×10-15cm2;对5P1/2激发,碰撞转移到5D5/2和5D3/2的截面分别是(6.57士2.96)×10-15和(5.90士2.66)×10-15cm2.与其他的实验结果进行了比较. 相似文献
102.
The collision-generated hybridization which has been found responsible for the on-site mixing of the atomic-likef-state and the band-liked states in mixed valence solids has been studied for the cerium solid. A practical expression which depends on the lattice
constant and temperature has been obtained for the collision-generated hybridization. Numerical calculations show that the
valence varies continuously with lattice constant and that temperature makes the transition smoother. The collision-generated
hybridization is found to be of significant strength in the intermediate valence regime; but over a wide range of the valence
near 3.5 it varies rather slowly without preferring a particular valence. Factors which can assist the collision-generated
hybridization in stabilizing the mixed valence phase at a particular lattice constant are discussed. 相似文献
103.
关于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数的下界比用其它公式算得的下界好 . 相似文献
104.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
105.
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. 相似文献
106.
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. 相似文献
107.
研究了十二烷基三苯基溴化鏻(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,后者与文献值一致。 相似文献
108.
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 相似文献
109.
This paper is concerned with the quenching problem of a degenerate functional reaction-diffusion equation. The quenching problem and global existence of solution for the reaction-diffusion equation are derived and, some results of the positive steady state solutions for functional elliptic boundary value are also presented. 相似文献
110.
双环网络是计算机互连网络和通讯系统的一类重要拓扑结构.1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族.2003年,徐俊明等人给出一个4紧优双环网络的无限族.本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法. 相似文献