全文获取类型
收费全文 | 2124篇 |
免费 | 52篇 |
国内免费 | 6篇 |
专业分类
化学 | 1365篇 |
晶体学 | 21篇 |
力学 | 56篇 |
数学 | 331篇 |
物理学 | 409篇 |
出版年
2021年 | 20篇 |
2020年 | 17篇 |
2019年 | 20篇 |
2017年 | 16篇 |
2016年 | 37篇 |
2015年 | 30篇 |
2014年 | 34篇 |
2013年 | 81篇 |
2012年 | 94篇 |
2011年 | 104篇 |
2010年 | 54篇 |
2009年 | 56篇 |
2008年 | 91篇 |
2007年 | 110篇 |
2006年 | 100篇 |
2005年 | 98篇 |
2004年 | 88篇 |
2003年 | 70篇 |
2002年 | 74篇 |
2001年 | 54篇 |
2000年 | 27篇 |
1999年 | 28篇 |
1998年 | 33篇 |
1997年 | 17篇 |
1996年 | 32篇 |
1995年 | 28篇 |
1994年 | 41篇 |
1993年 | 25篇 |
1992年 | 37篇 |
1991年 | 23篇 |
1990年 | 24篇 |
1989年 | 25篇 |
1988年 | 23篇 |
1987年 | 21篇 |
1986年 | 29篇 |
1985年 | 33篇 |
1984年 | 24篇 |
1983年 | 25篇 |
1982年 | 31篇 |
1981年 | 27篇 |
1980年 | 26篇 |
1979年 | 24篇 |
1978年 | 34篇 |
1977年 | 28篇 |
1976年 | 32篇 |
1975年 | 26篇 |
1974年 | 25篇 |
1973年 | 22篇 |
1972年 | 22篇 |
1971年 | 14篇 |
排序方式: 共有2182条查询结果,搜索用时 15 毫秒
1.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
2.
Clifford S. Queen 《Journal of Number Theory》2002,92(1):164-173
In this paper we develop a theory of unique factorization for subgroups of the positive rationals. We show that this theory is strong enough to include arithmetic progressions and the theory of genera in algebraic number fields. We establish generalizations of both Dirichlet's theorem on primes in arithmetic progressions and the theory of genera for Abelian extensions of the rationals. 相似文献
3.
Clifford Henry Taubes 《Communications in Mathematical Physics》1989,122(3):455-526
A proof is given of Witten's conjectures for the rigidity of the index of the Dirac-Ramond operator on the loop space of a spin manifold which admits anS
1 symmetry.Research supported in part by the National Science Foundation 相似文献
4.
David Morris 《Applied biochemistry and biotechnology》2004,113(1-3):5-12
This article addresses two questions: Has the effectiveness of the US governments federal research and development (R&;D) spending suffered from the post-1980 strategic change from freely shared and publicly owned to privately owned scientific advances? What criteria would a federal R&;D program use to design a strategy that most effectively enhances the well-being of farmers and rural communities? Several studies found that the pre-1980 US Department of Agriculture research strategy was very effective. No comparable studies have analyzed the comparative effectiveness of the post-1980 strategy of restricting access to the results of public research. Recent experience and several analytical studies suggest that to significantly enhance the health of rural economies from an expanded use of plant matter as an industrial material, federal policy should channel scientific and engineering research into small- and medium-sized production and processing technologies and should encourage farmer-owned, value-added enterprises. 相似文献
5.
Peter Clifford 《Annals of Combinatorics》2005,9(3):281-291
Motivated by recent results of Stanley, we generalize the rank of a partition λ to the rank of a shifted partition S(λ). We show that the number of bars required in a minimal bar tableau of S(λ) is max(o, e + (ℓ(λ) mod 2)), where o and e are the number of odd and even rows of λ. As a consequence we show that the irreducible projective characters of Sn vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schur’s
Qλ symmetric functions in terms of the power sum symmetric functions.
Received November 20, 2003 相似文献
6.
E.Ann Hallinan Clifford R. DornWilliam M. Moore Gina M. JeromePamela T. Manning Barnett S. Pitzele 《Tetrahedron letters》2003,44(39):7345-7347
Described is a method of introducing trifluoroalkyl groups at C-6 of lysine. This chemistry has the potential to introduce a variety of functionality at C-6 of lysine. 相似文献
7.
8.
Andrew D. Abell Bruce M. Clark Kathryn B. Morris Jane M. Taylor 《Journal of mass spectrometry : JMS》1993,28(1):27-29
Positive-ion fast atom bombardment mass spectra of 13 keto acid and keto ester phosphoranes were examined. All compounds gave a protonated molecular ion and characteristic peaks at m/z 303, 279, 262 and 201. 相似文献
9.
Images of the surface ordering of 4-n-octyl-4'-cyanobiphenyl, a room temperature smectic liquid crystal deposited upon graphite, have been obtained by scanning tunnelling microscopy. The microscope was operated in air using the constant-current mode. Under certain tunnelling conditions it has been possible to resolve both the aliphatic and aromatic parts of the molecule, and to observe individual benzene rings. Two previously unreported conformations have been observed: an overlapping bilayer structure with spacing 3.7 nm, and a monolayer structure with spacing 2.4 nm. The latter structure may represent the first visual evidence for a surface polar ordered structure. 相似文献
10.
Ben J. Morris 《Random Structures and Algorithms》2002,21(2):135-146
We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri = Ω(n3/2m log m), and cj = Ω(m3/2n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was taken by Dyer, Kannan, and Mount in previous work. However, the algorithm we present is simpler and has weaker requirements on the row and column sums. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 135–146, 2002 相似文献