全文获取类型
收费全文 | 6630篇 |
免费 | 753篇 |
国内免费 | 438篇 |
专业分类
化学 | 402篇 |
晶体学 | 14篇 |
力学 | 100篇 |
综合类 | 141篇 |
数学 | 5294篇 |
物理学 | 677篇 |
无线电 | 1193篇 |
出版年
2024年 | 19篇 |
2023年 | 121篇 |
2022年 | 198篇 |
2021年 | 168篇 |
2020年 | 238篇 |
2019年 | 260篇 |
2018年 | 243篇 |
2017年 | 274篇 |
2016年 | 176篇 |
2015年 | 163篇 |
2014年 | 254篇 |
2013年 | 549篇 |
2012年 | 314篇 |
2011年 | 386篇 |
2010年 | 383篇 |
2009年 | 531篇 |
2008年 | 481篇 |
2007年 | 372篇 |
2006年 | 411篇 |
2005年 | 303篇 |
2004年 | 275篇 |
2003年 | 236篇 |
2002年 | 221篇 |
2001年 | 194篇 |
2000年 | 184篇 |
1999年 | 166篇 |
1998年 | 141篇 |
1997年 | 119篇 |
1996年 | 76篇 |
1995年 | 69篇 |
1994年 | 63篇 |
1993年 | 44篇 |
1992年 | 37篇 |
1991年 | 22篇 |
1990年 | 16篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 16篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有7821条查询结果,搜索用时 31 毫秒
31.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
32.
33.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
34.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
35.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献
36.
分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题.基于断点图的概念,给出一个时间复杂性为O(max{b^(π),nb(π)}),空间复杂性为0(n)的求其近似最优解的算法.其中n为基因组中基因个数,π=(π1,π2,…,πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据实验的结果表明,该近似算法可以求得较好的结果. 相似文献
37.
38.
在等离子体增强化学气相淀积系统中,采用aSi:H层淀积和原位等离子体氧化相结合的逐层生长技术制备了aSi:H/SiO_2多层膜.在激光诱导限制结晶原理基础上,使用KrF准分子脉冲激光为辐照源,对aSi:H/SiO_2多层膜进行辐照,使纳米级厚度的aSi:H子层晶化.Raman散射谱和电子衍射谱的结果表明,经过激光辐照后纳米Si颗粒在原始的aSi:H子层内形成,晶粒尺寸可以根据aSi:H层的厚度精确控制.还研究了样品的光致发光(PL)特性以及激光辐照能量密度对PL性质的影响.
关键词:
脉冲激光
多层膜
限制结晶 相似文献
39.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the
Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead
and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
40.
Based on the discrete-structural theory of thin plates and shells, a calculation model for thin-walled elements consisting
of a number of rigid anisotropic layers is put forward. It is assumed that the transverse shear and compression stresses are
equal on the interfaces. Elastic slippage is allowed over the interfaces between adjacent layers. The solution to the problem
is obtained in a geometrically nonlinear statement with account of the influence of transverse shear and compression strains.
The stress-strain state of circular two-layer transversely isotropic plates, both without defects and with a local area of
adhesion failure at their center, is investigated numerically and experimentally. It is found that the kinematic and static
contact conditions on the interfaces of layered thin-walled structural members greatly affect the magnitude of stresses and
strains. With the use of three variants of calculation models, in the cases of perfect and weakened contact conditions between
layers, the calculation results for circular plates are compared. It is revealed that the variant suggested in this paper
adequately reflects the behavior of layered thin-walled structural elements under large deformations.
__________
Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 6, pp. 761–772, November–December, 2005. 相似文献