全文获取类型
收费全文 | 73887篇 |
免费 | 5485篇 |
国内免费 | 6762篇 |
专业分类
化学 | 26126篇 |
晶体学 | 289篇 |
力学 | 6332篇 |
综合类 | 1386篇 |
数学 | 30871篇 |
物理学 | 21130篇 |
出版年
2023年 | 619篇 |
2022年 | 965篇 |
2021年 | 1285篇 |
2020年 | 1458篇 |
2019年 | 1736篇 |
2018年 | 1473篇 |
2017年 | 1722篇 |
2016年 | 1848篇 |
2015年 | 1681篇 |
2014年 | 2466篇 |
2013年 | 4788篇 |
2012年 | 2856篇 |
2011年 | 3312篇 |
2010年 | 2913篇 |
2009年 | 4165篇 |
2008年 | 4584篇 |
2007年 | 4680篇 |
2006年 | 4427篇 |
2005年 | 3715篇 |
2004年 | 3437篇 |
2003年 | 3429篇 |
2002年 | 3190篇 |
2001年 | 2705篇 |
2000年 | 2623篇 |
1999年 | 2389篇 |
1998年 | 2215篇 |
1997年 | 1796篇 |
1996年 | 1576篇 |
1995年 | 1455篇 |
1994年 | 1326篇 |
1993年 | 1126篇 |
1992年 | 1091篇 |
1991年 | 844篇 |
1990年 | 696篇 |
1989年 | 615篇 |
1988年 | 564篇 |
1987年 | 443篇 |
1986年 | 377篇 |
1985年 | 448篇 |
1984年 | 438篇 |
1983年 | 213篇 |
1982年 | 349篇 |
1981年 | 402篇 |
1980年 | 308篇 |
1979年 | 294篇 |
1978年 | 223篇 |
1977年 | 211篇 |
1976年 | 156篇 |
1974年 | 112篇 |
1973年 | 105篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
On Quantum Team Games 总被引:2,自引:0,他引:2
E. Ahmed M. F. Elettreby A. S. Hegazi 《International Journal of Theoretical Physics》2006,45(5):880-886
Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied. 相似文献
102.
给出2005年全国部分高校研究生数学建模竞赛D题的研究背景,对参赛论文作了简要评注,并提供了一种参考解答. 相似文献
103.
A. D. Rogers 《Acta Mathematica Hungarica》2006,110(1-2):13-21
Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded
strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from
integral geometry. 相似文献
104.
Benjamin J. K. Evans Susan M. Scott Antony C. Searle 《General Relativity and Gravitation》2002,34(10):1675-1684
We have developed a new tool for numerical work in General Relativity: GRworkbench. We discuss how GRworkbench's implementation of a numerically-amenable analogue to Differential Geometry facilitates the development of robust and chart-independent numerical algorithms. We consider, as an example, geodesic tracing on two charts covering the exterior Schwarzschild space-time. 相似文献
105.
106.
We show that the difference between the Schrödinger uncertainty relations (UR) and the Heisenberg UR is fundamental. We propose a modified version of stochastic mechanics that allows clearly demonstrating that the contributions from the anticommutator and the commutator to the Schrödinger UR are equally important. A classification of quantum states minimizing the Schrödinger UR at an arbitrary instant is proposed. We show that the correlation of the coordinate and momentum fluctuations in such correlated-coherent states (CCS) is largely determined by the contributions from not only the commutator but also the anticommutator of the corresponding operators. We demonstrate that the character of this correlation changes qualitatively in time from the antiphase correlation typical for the Heisenberg UR to the inphase correlation for which the contribution from the anticommutator is decisive. We comparatively analyze properties of a free microparticle and a quantum oscillator in CCS and show that the CCS correspond to traveling-standing de Broglie waves in both models. 相似文献
107.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
108.
Kasper K. Berthelsen Jesper Møller 《Bulletin of the Brazilian Mathematical Society》2002,33(3):351-367
This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect
simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and
the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed.
Received: 30 June 2002 相似文献
109.
110.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献