全文获取类型
收费全文 | 315355篇 |
免费 | 2830篇 |
国内免费 | 1056篇 |
专业分类
化学 | 140119篇 |
晶体学 | 4159篇 |
力学 | 17693篇 |
综合类 | 5篇 |
数学 | 67859篇 |
物理学 | 89406篇 |
出版年
2020年 | 1108篇 |
2018年 | 18280篇 |
2017年 | 18928篇 |
2016年 | 10886篇 |
2015年 | 3262篇 |
2014年 | 2457篇 |
2013年 | 6794篇 |
2012年 | 12256篇 |
2011年 | 27015篇 |
2010年 | 15492篇 |
2009年 | 15577篇 |
2008年 | 21678篇 |
2007年 | 26922篇 |
2006年 | 6230篇 |
2005年 | 13944篇 |
2004年 | 9718篇 |
2003年 | 9500篇 |
2002年 | 6490篇 |
2001年 | 4315篇 |
2000年 | 3595篇 |
1999年 | 2692篇 |
1998年 | 2401篇 |
1997年 | 2341篇 |
1996年 | 2538篇 |
1995年 | 2257篇 |
1994年 | 1956篇 |
1993年 | 1927篇 |
1992年 | 2102篇 |
1991年 | 2081篇 |
1990年 | 1968篇 |
1989年 | 1985篇 |
1988年 | 2017篇 |
1987年 | 1970篇 |
1986年 | 1866篇 |
1985年 | 2581篇 |
1984年 | 2697篇 |
1983年 | 2225篇 |
1982年 | 2601篇 |
1981年 | 2425篇 |
1980年 | 2458篇 |
1979年 | 2438篇 |
1978年 | 2546篇 |
1977年 | 2344篇 |
1976年 | 2365篇 |
1975年 | 2290篇 |
1974年 | 2109篇 |
1973年 | 2378篇 |
1972年 | 1392篇 |
1968年 | 1191篇 |
1967年 | 1174篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
152.
153.
Yasuyuki Kawahigashi 《Communications in Mathematical Physics》2002,226(2):269-287
We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if
we apply this construction to a non-degenerately braided subfactor N⊂M and α±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M
opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from αplusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize
our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors
on S
1 to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context.
Received: 11 September 2001 / Accepted: 7 October 2001 相似文献
154.
155.
Julio Castellanos 《Mathematische Zeitschrift》2002,239(4):777-802
We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions
greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type
of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples
are presented.
Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002 相似文献
156.
157.
We call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough prefixes of w contain as a suffix a ρth power (or more generally a repetition of order ρ) of a word of length at most l. We show that each (2,4)-repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, (2,5)-repetitive words. Further, we characterize nonultimately periodic (2,5)-repetitive words both structurally and algebraically. 相似文献
158.
159.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
160.
Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures 总被引:1,自引:1,他引:0
A.C.D. van Enter R. Fernández F. den Hollander F. Redig 《Communications in Mathematical Physics》2002,226(1):101-130
We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a
reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study
the Gibbsian character of the measure νS(t) at time t and show the following:
(1) For all ν and μ, νS(t) is Gibbs for small t.
(2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0.
(3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t.
(4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t.
The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios.
Received: 26 April 2001 / Accepted: 10 October 2001 相似文献