全文获取类型
收费全文 | 10347篇 |
免费 | 532篇 |
国内免费 | 999篇 |
专业分类
化学 | 487篇 |
晶体学 | 4篇 |
力学 | 302篇 |
综合类 | 124篇 |
数学 | 5243篇 |
物理学 | 403篇 |
综合类 | 5315篇 |
出版年
2024年 | 16篇 |
2023年 | 93篇 |
2022年 | 137篇 |
2021年 | 147篇 |
2020年 | 172篇 |
2019年 | 182篇 |
2018年 | 202篇 |
2017年 | 206篇 |
2016年 | 221篇 |
2015年 | 235篇 |
2014年 | 403篇 |
2013年 | 548篇 |
2012年 | 484篇 |
2011年 | 562篇 |
2010年 | 472篇 |
2009年 | 646篇 |
2008年 | 643篇 |
2007年 | 724篇 |
2006年 | 713篇 |
2005年 | 545篇 |
2004年 | 521篇 |
2003年 | 515篇 |
2002年 | 471篇 |
2001年 | 410篇 |
2000年 | 365篇 |
1999年 | 329篇 |
1998年 | 307篇 |
1997年 | 288篇 |
1996年 | 225篇 |
1995年 | 151篇 |
1994年 | 165篇 |
1993年 | 139篇 |
1992年 | 107篇 |
1991年 | 100篇 |
1990年 | 87篇 |
1989年 | 72篇 |
1988年 | 64篇 |
1987年 | 43篇 |
1986年 | 26篇 |
1985年 | 27篇 |
1984年 | 22篇 |
1983年 | 12篇 |
1982年 | 24篇 |
1981年 | 16篇 |
1980年 | 18篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Annegret K. Wagler 《4OR: A Quarterly Journal of Operations Research》2005,3(4):329-336
Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete
join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004.
We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004.
Received: November 2004 / Revised version: June 2005 相似文献
22.
Krzysztof Pawaowski 《K-Theory》1998,13(1):41-55
The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery. 相似文献
23.
A Fixed Point Theorem for Multi-valued Composite Increasing OperatorsLiFengyou(李凤友)(DepartmentofMathematics,Tianjin'NormalUni... 相似文献
24.
25.
Alexander P. Schuster 《Proceedings of the American Mathematical Society》1997,125(6):1717-1725
Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.
26.
本文给出了一个判定最大无关组的充要性定理及其证明.同时对用矩阵的行变换求最大无关组这一问题进行了点滴分析并介绍了一个解齐次线性方程组的简便方法。 相似文献
27.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
28.
Alex Hellsten 《Archive for Mathematical Logic》2006,45(6):705-714
We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal. 相似文献
29.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
30.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献