全文获取类型
收费全文 | 14814篇 |
免费 | 1465篇 |
国内免费 | 1497篇 |
专业分类
化学 | 2029篇 |
晶体学 | 26篇 |
力学 | 840篇 |
综合类 | 239篇 |
数学 | 11926篇 |
物理学 | 2716篇 |
出版年
2024年 | 40篇 |
2023年 | 184篇 |
2022年 | 197篇 |
2021年 | 276篇 |
2020年 | 321篇 |
2019年 | 381篇 |
2018年 | 380篇 |
2017年 | 438篇 |
2016年 | 504篇 |
2015年 | 360篇 |
2014年 | 631篇 |
2013年 | 1151篇 |
2012年 | 671篇 |
2011年 | 731篇 |
2010年 | 686篇 |
2009年 | 889篇 |
2008年 | 954篇 |
2007年 | 1018篇 |
2006年 | 903篇 |
2005年 | 843篇 |
2004年 | 705篇 |
2003年 | 628篇 |
2002年 | 652篇 |
2001年 | 566篇 |
2000年 | 514篇 |
1999年 | 526篇 |
1998年 | 416篇 |
1997年 | 380篇 |
1996年 | 300篇 |
1995年 | 215篇 |
1994年 | 183篇 |
1993年 | 136篇 |
1992年 | 130篇 |
1991年 | 107篇 |
1990年 | 80篇 |
1989年 | 64篇 |
1988年 | 59篇 |
1987年 | 55篇 |
1986年 | 52篇 |
1985年 | 79篇 |
1984年 | 71篇 |
1983年 | 27篇 |
1982年 | 54篇 |
1981年 | 30篇 |
1980年 | 43篇 |
1979年 | 37篇 |
1978年 | 26篇 |
1977年 | 25篇 |
1976年 | 17篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
201.
We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method. 相似文献
202.
本文给出直接求线性规划问题基可行解的一种简易方法,该方法既避免了引入人工变量,减少存储,一般又能较快地得到一个较好的基可行解. 相似文献
203.
Huang H. X. Liang Z. A. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,120(1):53-71
A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones. 相似文献
204.
Sergio A. Celani 《Central European Journal of Mathematics》2003,1(4):561-572
In this paper we shall give a topological representation for Hilbert algebras that extend the topological representation given
by A. Diego in [4]. For implicative semilattices this representation gives a full duality. We shall also consider the representation
for Boolean ring. 相似文献
205.
S. Alpay E. Yu. Emel'yanov Z. Ercan 《Proceedings of the American Mathematical Society》2004,132(12):3627-3628
In this paper we give a characterization of order ideals in Riesz spaces.
206.
We prove that simply connected open manifolds of bounded geometry, linear growth and sublinear filling growth (e.g. finite filling area) are simply connected at infinity. 相似文献
207.
引进集值映射的锥真拟凹概念,讨论一类具有集值映射的广义向量衡问题解的存在性与解集的凸性。 相似文献
208.
209.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献
210.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献