全文获取类型
收费全文 | 2890篇 |
免费 | 192篇 |
国内免费 | 248篇 |
专业分类
化学 | 194篇 |
晶体学 | 1篇 |
力学 | 78篇 |
综合类 | 79篇 |
数学 | 2673篇 |
物理学 | 305篇 |
出版年
2024年 | 5篇 |
2023年 | 34篇 |
2022年 | 70篇 |
2021年 | 48篇 |
2020年 | 74篇 |
2019年 | 86篇 |
2018年 | 77篇 |
2017年 | 96篇 |
2016年 | 76篇 |
2015年 | 63篇 |
2014年 | 100篇 |
2013年 | 271篇 |
2012年 | 98篇 |
2011年 | 122篇 |
2010年 | 133篇 |
2009年 | 159篇 |
2008年 | 212篇 |
2007年 | 185篇 |
2006年 | 177篇 |
2005年 | 118篇 |
2004年 | 138篇 |
2003年 | 134篇 |
2002年 | 133篇 |
2001年 | 104篇 |
2000年 | 114篇 |
1999年 | 89篇 |
1998年 | 82篇 |
1997年 | 58篇 |
1996年 | 64篇 |
1995年 | 28篇 |
1994年 | 30篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 18篇 |
1990年 | 9篇 |
1989年 | 13篇 |
1987年 | 6篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 14篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1975年 | 2篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有3330条查询结果,搜索用时 0 毫秒
1.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
2.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
3.
A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices
is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same
degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations
on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces
on at most 11 vertices.
In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there
exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two
distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which
are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly
regular. 相似文献
4.
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K5‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K3,3), M*(K5)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5), M*(K5)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
5.
6.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
7.
8.
Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences. 相似文献
9.
Alexander Zimmermann 《Algebras and Representation Theory》2004,7(1):19-34
In an earlier paper, Raphaël Rouquier and the author introduced the group of self-equivalences of a derived category. In the case of a Brauer tree algebra, we determined a nontrivial homomorphism of the Artin braid group to this group of self-equivalences. The class of Brauer tree algebras include blocks of finite group rings over a large enough field with cyclic defect groups. In the present paper we give an integral version of this homomorphism. Moreover, we identify some interesting arithmetic subgroups with natural groups of self-equivalences of the derived category. 相似文献
10.
Marco Pretti 《Journal of statistical physics》2003,111(3-4):993-1015
In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent. 相似文献