全文获取类型
收费全文 | 17550篇 |
免费 | 623篇 |
国内免费 | 743篇 |
专业分类
化学 | 4730篇 |
晶体学 | 858篇 |
力学 | 442篇 |
综合类 | 69篇 |
数学 | 10358篇 |
物理学 | 2459篇 |
出版年
2023年 | 81篇 |
2022年 | 217篇 |
2021年 | 184篇 |
2020年 | 179篇 |
2019年 | 414篇 |
2018年 | 430篇 |
2017年 | 312篇 |
2016年 | 332篇 |
2015年 | 322篇 |
2014年 | 599篇 |
2013年 | 923篇 |
2012年 | 543篇 |
2011年 | 1150篇 |
2010年 | 1209篇 |
2009年 | 1330篇 |
2008年 | 1338篇 |
2007年 | 1320篇 |
2006年 | 1072篇 |
2005年 | 839篇 |
2004年 | 819篇 |
2003年 | 643篇 |
2002年 | 536篇 |
2001年 | 384篇 |
2000年 | 334篇 |
1999年 | 322篇 |
1998年 | 285篇 |
1997年 | 250篇 |
1996年 | 332篇 |
1995年 | 285篇 |
1994年 | 290篇 |
1993年 | 256篇 |
1992年 | 204篇 |
1991年 | 125篇 |
1990年 | 112篇 |
1989年 | 112篇 |
1988年 | 76篇 |
1987年 | 87篇 |
1986年 | 93篇 |
1985年 | 125篇 |
1984年 | 73篇 |
1983年 | 51篇 |
1982年 | 69篇 |
1981年 | 61篇 |
1980年 | 36篇 |
1979年 | 19篇 |
1978年 | 31篇 |
1977年 | 40篇 |
1976年 | 32篇 |
1974年 | 15篇 |
1973年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
In this article we investigate some integral functional inequalities of Bellman–Bihari type for piecewise-continuous functions with some fixed points of discontinuity. We also prove a new analogy and generalization of results which were obtained by Bellman and Bihari to integro-sum inequalities with delay and discontinuities that do not belong to Lipschitz’s type. 相似文献
132.
A convergent synthesis of the key synthetic intermediate of hemibrevetoxin B was achieved via the intramolecular allylation of an α-chloroacetoxy ether and subsequent ring-closing metathesis. 相似文献
133.
134.
Sandip B. Bharate 《Tetrahedron letters》2006,47(39):7021-7024
The antimalarial robustadials A and B have been synthesized in two steps starting from commercially available phloroglucinol comprising a key biomimetic three-component reaction that involves in situ generation of an o-quinone methide via Knoevenagel condensation and subsequent Diels-Alder cycloaddition with (−)-β-pinene. 相似文献
135.
C. Praagman 《Aequationes Mathematicae》1987,33(1):251-259
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too 相似文献
136.
F. García 《Topology and its Applications》2006,153(15):2886-2892
In this paper we characterize the class of uniform Eberlein compact spaces through a network condition and also in terms of covering properties for the square of the space. 相似文献
137.
In this paper we construct a positive doubly power bounded operator
with a nonpositive inverse on an AL-space. 相似文献
138.
Debora Di Caprio 《Topology and its Applications》2006,153(14):2680-2702
We introduce and study some completeness properties for systems of open coverings of a given topological space. A Hausdorff space admitting a system of cardinality κ satisfying one of these properties is of type Gκ. Hence, we define several new variants of the ?ech number and use elementary submodels to determine further results. We introduce M-hulls and M-networks, for M elementary submodel. As an application, we give estimates for both the tightness and the Lindelöf number of a generic upper hyperspace. Two recent results of Costantini, Holá and Vitolo on the tightness of co-compact hyperspaces follow from ours as corollaries. 相似文献
139.
A survey of the contributions of Aldo Cossu in finite geometry is given.
Dedicated to the memory of Professor Aldo Cossu 相似文献
140.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献