全文获取类型
收费全文 | 65029篇 |
免费 | 1906篇 |
国内免费 | 149篇 |
专业分类
化学 | 40298篇 |
晶体学 | 407篇 |
力学 | 1379篇 |
数学 | 9801篇 |
物理学 | 15199篇 |
出版年
2022年 | 425篇 |
2021年 | 638篇 |
2020年 | 941篇 |
2019年 | 792篇 |
2018年 | 763篇 |
2017年 | 689篇 |
2016年 | 1665篇 |
2015年 | 1456篇 |
2014年 | 1662篇 |
2013年 | 3304篇 |
2012年 | 3251篇 |
2011年 | 3746篇 |
2010年 | 2039篇 |
2009年 | 1684篇 |
2008年 | 3336篇 |
2007年 | 3233篇 |
2006年 | 3031篇 |
2005年 | 2745篇 |
2004年 | 2316篇 |
2003年 | 1859篇 |
2002年 | 1861篇 |
2001年 | 1202篇 |
2000年 | 1072篇 |
1999年 | 850篇 |
1998年 | 779篇 |
1997年 | 764篇 |
1996年 | 869篇 |
1995年 | 760篇 |
1994年 | 797篇 |
1993年 | 862篇 |
1992年 | 735篇 |
1991年 | 547篇 |
1990年 | 615篇 |
1989年 | 508篇 |
1988年 | 547篇 |
1987年 | 519篇 |
1986年 | 466篇 |
1985年 | 749篇 |
1984年 | 715篇 |
1983年 | 611篇 |
1982年 | 650篇 |
1981年 | 650篇 |
1980年 | 601篇 |
1979年 | 541篇 |
1978年 | 621篇 |
1977年 | 582篇 |
1976年 | 486篇 |
1975年 | 474篇 |
1974年 | 477篇 |
1973年 | 459篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
J. Fülöp 《Mathematical Methods of Operations Research》1991,35(1):1-13
This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.
Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.相似文献
102.
György Gát 《Analysis Mathematica》2006,32(1):25-48
Summary It is known that the Fejér means - with respect to the character system of the Walsh, and bounded Vilenkin groups - of an
integrable function converge to the function a.e. In this work we discuss analogous problems on the complete product of finite,
not necessarily Abelian groups with respect to the character system for functions that are constant on the conjugacy classes.
We find that the nonabelian case differs from the commutative case. We prove the a.e. convergence of the (C,1) means of the Fourier series of square integrable functions. We also prove the existence of a function f∊Lq for some q >1 such that sup |σn f | = + ∞ a.e. This is a sharp contrast between the Abelian and the nonabelian cases. 相似文献
103.
Thomas Sonar 《Mathematische Semesterberichte》2006,53(2):258-265
Ohne Zusammenfassung 相似文献
104.
105.
Jürg Fröhlich Tai-Peng Tsai Horng-Tzer Yau 《Communications in Mathematical Physics》2002,225(2):223-274
We consider the nonlinear Hartree equation describing the dynamics of weakly interacting non-relativistic Bosons. We show
that a nonlinear M?ller wave operator describing the scattering of a soliton and a wave can be defined. We also consider the dynamics of a
soliton in a slowly varying background potential W(ɛx). We prove that the soliton decomposes into a soliton plus a scattering wave (radiation) up to times of order ɛ−1. To leading order, the center of the soliton follows the trajectory of a classical particle in the potential W(ɛx).
Received: 30 June 2000 / Accepted: 25 June 2001 相似文献
106.
Jörg Zintl 《Mathematische Zeitschrift》2002,242(3):415-426
107.
Thomas Marlow 《International Journal of Theoretical Physics》2006,45(7):1247-1257
We attempt a justification of a generalisation of the consistent histories programme using a notion of probability that is valid for all complete sets of history propositions. This consists of introducing Cox's axioms of probability theory and showing that our candidate notion of probability obeys them. We also give a generalisation of Bayes' theorem and comment upon how Bayesianism should be useful for the quantum gravity/cosmology programmes.
PACS: 02.50.Cw;03.65.Ta;04.60.-m. 相似文献
108.
A cutting plane algorithm for a clustering problem 总被引:2,自引:0,他引:2
In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We have studied the latter problem from a polyhedral point of view and determined large classes of facets of the associated polytope. These theoretical results are utilized in this paper. We describe a cutting plane algorithm that is based on the simplex method and uses exact and heuristic separation routines for some of the classes of facets mentioned before. We discuss some details of the implementation of our code and present our computational results. We mention applications from, e.g., zoology, economics, and the political sciences. 相似文献
109.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
110.