全文获取类型
收费全文 | 7035篇 |
免费 | 535篇 |
国内免费 | 713篇 |
专业分类
化学 | 758篇 |
晶体学 | 12篇 |
力学 | 426篇 |
综合类 | 178篇 |
数学 | 6148篇 |
物理学 | 761篇 |
出版年
2024年 | 7篇 |
2023年 | 84篇 |
2022年 | 89篇 |
2021年 | 157篇 |
2020年 | 158篇 |
2019年 | 159篇 |
2018年 | 185篇 |
2017年 | 194篇 |
2016年 | 198篇 |
2015年 | 156篇 |
2014年 | 258篇 |
2013年 | 487篇 |
2012年 | 299篇 |
2011年 | 364篇 |
2010年 | 348篇 |
2009年 | 443篇 |
2008年 | 468篇 |
2007年 | 432篇 |
2006年 | 440篇 |
2005年 | 395篇 |
2004年 | 319篇 |
2003年 | 365篇 |
2002年 | 310篇 |
2001年 | 282篇 |
2000年 | 266篇 |
1999年 | 240篇 |
1998年 | 236篇 |
1997年 | 205篇 |
1996年 | 127篇 |
1995年 | 92篇 |
1994年 | 78篇 |
1993年 | 68篇 |
1992年 | 52篇 |
1991年 | 36篇 |
1990年 | 24篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 32篇 |
1984年 | 28篇 |
1983年 | 16篇 |
1982年 | 33篇 |
1981年 | 22篇 |
1980年 | 20篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1974年 | 4篇 |
排序方式: 共有8283条查询结果,搜索用时 296 毫秒
51.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
52.
David Stanovský 《Czechoslovak Mathematical Journal》2007,57(1):191-200
We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. 相似文献
53.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
54.
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. 相似文献
55.
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 . 相似文献
56.
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. 相似文献
57.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
58.
The theory of Ribaucour transformations for hypersurfaces in space forms is established. For any such hypersurface M, that admits orthonormal principal vector fields, it was shown the existence of a totally umbilic hypersurface locally associated to M by a Ribaucour transformation. A method of obtaining linear Weingarten surfaces in a three-dimensional space form is provided. By applying the theory, a new one-parameter family of complete constant mean curvature (cmc) surfaces in the unit sphere, locally associated to the flat torus, is obtained. The family contains a class of complete cmc cylinders in the sphere. In particular, one gets a family of complete minimal surfaces and minimal cylinders, locally associated to the Clifford torus.Mathematics Subject Classifications (2000): 53C20. 相似文献
59.
60.
对覆盖广义Rough集中的隶属关系、隶属函数进行了定义,并利用隶属函数定义了集合的Rough包含与Rough相等,得到一些与Pawlak的Rough集不同的性质。 相似文献