全文获取类型
收费全文 | 6348篇 |
免费 | 530篇 |
国内免费 | 912篇 |
专业分类
化学 | 2712篇 |
晶体学 | 27篇 |
力学 | 479篇 |
综合类 | 88篇 |
数学 | 3375篇 |
物理学 | 1109篇 |
出版年
2024年 | 11篇 |
2023年 | 69篇 |
2022年 | 110篇 |
2021年 | 149篇 |
2020年 | 169篇 |
2019年 | 189篇 |
2018年 | 178篇 |
2017年 | 174篇 |
2016年 | 206篇 |
2015年 | 175篇 |
2014年 | 282篇 |
2013年 | 489篇 |
2012年 | 281篇 |
2011年 | 326篇 |
2010年 | 289篇 |
2009年 | 395篇 |
2008年 | 425篇 |
2007年 | 433篇 |
2006年 | 413篇 |
2005年 | 328篇 |
2004年 | 315篇 |
2003年 | 295篇 |
2002年 | 296篇 |
2001年 | 261篇 |
2000年 | 257篇 |
1999年 | 180篇 |
1998年 | 180篇 |
1997年 | 147篇 |
1996年 | 134篇 |
1995年 | 122篇 |
1994年 | 97篇 |
1993年 | 77篇 |
1992年 | 64篇 |
1991年 | 53篇 |
1990年 | 33篇 |
1989年 | 16篇 |
1988年 | 27篇 |
1987年 | 24篇 |
1986年 | 21篇 |
1985年 | 16篇 |
1984年 | 25篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 7篇 |
1976年 | 5篇 |
1973年 | 2篇 |
1957年 | 1篇 |
排序方式: 共有7790条查询结果,搜索用时 15 毫秒
971.
Mark Tygert 《Journal of computational physics》2010,229(18):6181-6192
We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the second paper from this series on “Fast algorithms for spherical harmonic expansions”. The requisite precomputations become manageable when organized as a “depth-first traversal” of the program’s control-flow graph, rather than as the perhaps more natural “breadth-first traversal” that processes one-by-one each level of the multilevel procedure. We illustrate the results via several numerical examples. 相似文献
972.
Stéphane Dellacherie Pascal Omnes Felix Rieper 《Journal of computational physics》2010,229(14):5315-5338
By studying the structure of the discrete kernel of the linear acoustic operator discretized with a Godunov scheme, we clearly explain why the behaviour of the Godunov scheme applied to the linear wave equation deeply depends on the space dimension and, especially, on the type of mesh. This approach allows us to explain why, in the periodic case, the Godunov scheme applied to the resolution of the compressible Euler or Navier–Stokes system is accurate at low Mach number when the mesh is triangular or tetrahedral and is not accurate when the mesh is a 2D (or 3D) cartesian mesh. This approach confirms also the fact that a Godunov scheme remains accurate when it is modified by simply centering the discretization of the pressure gradient. 相似文献
973.
In this paper, we almost completely solve the Hamilton–Waterloo problem with -factors and -factors where the number of vertices is a multiple of . 相似文献
974.
We study the enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint. We exhibit new restricted sets of Dyck paths counted by the Motzkin numbers, and we give a constructive bijection between these objects and Motzkin paths. As a byproduct, we provide a generating function for the number of Motzkin paths of height with a flat (resp. with no flats) at the maximal height. 相似文献
975.
In this paper, we compute depth and Stanley depth for the quotient ring of the edge ideal associated to a square path on n vertices. We also compute depth and Stanley depth for the quotient ring of the edge ideal associated to a square cycle on n vertices, when n≡0,3,4( mod 5), and give tight bounds when n≡1,2( mod 5). We also prove a conjecture of Herzog presented in [5], for the edge ideals of square paths and square cycles. 相似文献
976.
Let G be a finite group and let cd(G) be the set of all irreducible character degrees of G. We consider finite groups G with the property that cd(G) has at most three composite members. We derive a bound 8 for the size of character degree sets of such groups. 相似文献
977.
《Journal of Graph Theory》2018,89(1):26-39
The Turán number of a graph H, , is the maximum number of edges in any graph of order n that does not contain an H as a subgraph. A graph on vertices consisting of k triangles that intersect in exactly one common vertex is called a k‐fan, and a graph consisting of k cycles that intersect in exactly one common vertex is called a k‐flower. In this article, we determine the Turán number of any k‐flower containing at least one odd cycle and characterize all extremal graphs provided n is sufficiently large. Erdős, Füredi, Gould, and Gunderson determined the Turán number for the k‐fan. Our result is a generalization of their result. The addition aim of this article is to draw attention to a powerful tool, the so‐called progressive induction lemma of Simonovits. 相似文献
978.
《Journal of Graph Theory》2018,88(3):434-448
The natural infinite analog of a (finite) Hamilton cycle is a two‐way‐infinite Hamilton path (connected spanning 2‐valent subgraph). Although it is known that every connected 2k‐valent infinite circulant graph has a two‐way‐infinite Hamilton path, there exist many such graphs that do not have a decomposition into k edge‐disjoint two‐way‐infinite Hamilton paths. This contrasts with the finite case where it is conjectured that every 2k‐valent connected circulant graph has a decomposition into k edge‐disjoint Hamilton cycles. We settle the problem of decomposing 2k‐valent infinite circulant graphs into k edge‐disjoint two‐way‐infinite Hamilton paths for , in many cases when , and in many other cases including where the connection set is or . 相似文献
979.
《Journal of Graph Theory》2018,88(4):631-640
The 3‐Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2‐regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs. 相似文献
980.
《Operations Research Letters》2020,48(4):441-445
With the help of the newly developed technique—second order cone (SOC) constraints to strengthen the SDP relaxation of the extended trust-region subproblem (eTRS), we modify two recent SDP relaxation based branch and bound algorithms for solving eTRS. Numerical experiments on some types of problems show that the new algorithms run faster for finding the global optimal solutions than the SDP relaxation based algorithms. 相似文献