全文获取类型
收费全文 | 10307篇 |
免费 | 1221篇 |
国内免费 | 418篇 |
专业分类
化学 | 1466篇 |
晶体学 | 14篇 |
力学 | 1106篇 |
综合类 | 339篇 |
数学 | 5764篇 |
物理学 | 3257篇 |
出版年
2024年 | 26篇 |
2023年 | 149篇 |
2022年 | 354篇 |
2021年 | 341篇 |
2020年 | 229篇 |
2019年 | 235篇 |
2018年 | 267篇 |
2017年 | 391篇 |
2016年 | 488篇 |
2015年 | 341篇 |
2014年 | 621篇 |
2013年 | 683篇 |
2012年 | 562篇 |
2011年 | 625篇 |
2010年 | 506篇 |
2009年 | 656篇 |
2008年 | 666篇 |
2007年 | 688篇 |
2006年 | 550篇 |
2005年 | 485篇 |
2004年 | 419篇 |
2003年 | 355篇 |
2002年 | 322篇 |
2001年 | 274篇 |
2000年 | 248篇 |
1999年 | 217篇 |
1998年 | 197篇 |
1997年 | 180篇 |
1996年 | 154篇 |
1995年 | 113篇 |
1994年 | 85篇 |
1993年 | 91篇 |
1992年 | 80篇 |
1991年 | 45篇 |
1990年 | 50篇 |
1989年 | 32篇 |
1988年 | 37篇 |
1987年 | 28篇 |
1986年 | 29篇 |
1985年 | 31篇 |
1984年 | 31篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
W.A. Mangum 《Natural Resource Modeling》1992,6(4):373-384
This paper presents a discrete age structured SI model of tracheal mite (Acarapis woodi (Rennie)) infestation of honey bees (Apis mellifera L.) at the colony level. The model describes the elevated honey bee attrition during winter and predicts that winter brood rearing should promote colony survival by decreasing the colony's infestation and increasing the colony's population. The model also predicts that swarming and the artificial removal of part of the colony's forager honey bees should reduce the colony's infestation level. 相似文献
52.
New concepts for the study of incompressible plane or axisymmetric flows are analysed by the stream tube method. Flows without eddies and pure vortex flows are considered in a transformed domain where the mapped streamlines are rectilinear or circular. The transformation between the physical domain and the computational domain is an unknown of the problem. In order to solve the non-linear set of relevant equations, we present a new algorithm based on a trust region technique which is effective for non-convex optimization problems. Experimental results show that the new algorithm is more robust compared to the Newton-Raphson method. 相似文献
53.
54.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献
55.
In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise
(standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees
of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances
of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain
how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty
term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known
or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising
and of compression. 相似文献
56.
We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log2n) time per output vertex which is an improvement by a factor of O(n/log2n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n2+) for any positive constant . In the case k<n2+, where k is the total size of the input and output, we improve the running to O((n+k+(nk)2/3)logO(1)n). 相似文献
57.
线性规划的符号跟踪算法 总被引:2,自引:1,他引:1
分析了只含一个约束条件的线性规划最优基变量的特征,将其运用到搜寻含m个约束条件的线性规划的最优基变量,从而提出了线性规划的符号跟踪算法,为线性规划求解提供了新途径。 相似文献
58.
59.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
60.