全文获取类型
收费全文 | 32110篇 |
免费 | 2160篇 |
国内免费 | 1652篇 |
专业分类
化学 | 2262篇 |
晶体学 | 36篇 |
力学 | 1870篇 |
综合类 | 227篇 |
数学 | 12975篇 |
物理学 | 2591篇 |
综合类 | 15961篇 |
出版年
2024年 | 122篇 |
2023年 | 406篇 |
2022年 | 688篇 |
2021年 | 801篇 |
2020年 | 716篇 |
2019年 | 705篇 |
2018年 | 696篇 |
2017年 | 943篇 |
2016年 | 925篇 |
2015年 | 926篇 |
2014年 | 1563篇 |
2013年 | 1986篇 |
2012年 | 1839篇 |
2011年 | 1858篇 |
2010年 | 1510篇 |
2009年 | 1803篇 |
2008年 | 1841篇 |
2007年 | 2140篇 |
2006年 | 1796篇 |
2005年 | 1510篇 |
2004年 | 1282篇 |
2003年 | 1154篇 |
2002年 | 1047篇 |
2001年 | 934篇 |
2000年 | 856篇 |
1999年 | 694篇 |
1998年 | 732篇 |
1997年 | 599篇 |
1996年 | 501篇 |
1995年 | 444篇 |
1994年 | 382篇 |
1993年 | 362篇 |
1992年 | 329篇 |
1991年 | 262篇 |
1990年 | 225篇 |
1989年 | 192篇 |
1988年 | 192篇 |
1987年 | 134篇 |
1986年 | 112篇 |
1985年 | 121篇 |
1984年 | 91篇 |
1983年 | 46篇 |
1982年 | 57篇 |
1981年 | 54篇 |
1980年 | 61篇 |
1979年 | 72篇 |
1978年 | 51篇 |
1977年 | 58篇 |
1976年 | 54篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
31.
高师田径教学存在的问题与改革对策 总被引:2,自引:0,他引:2
以中小学体育与健康课程的变革为依托 ,阐述了目前高师田径教学存在的问题 ,并提出了一些相应的改革对策 相似文献
32.
洞室开挖会使围岩周边产生应力集中 ,产生拉应力与压应力。围岩出现拉应力对洞室稳定十分不利 ,通常通过改变洞室形状和轴比来消除围岩中的拉应力。本文提出一种使洞室拉应力σθ=0 ,而压应力最小的确定洞室最优几何形状的方法。 相似文献
33.
以多目标决策理论、组合优化理论以及预测科学技术为依据 ,首先建立了土地功能配置模型 ,帮助规划师对各种不同功能土地的片面布置进行分析 ,从而找到最合理的城市土地布局 ;然后以遗传算法作为优化工具 ,对建立的模型进行了优化。 相似文献
34.
35.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
36.
37.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
38.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
39.
40.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献