全文获取类型
收费全文 | 15673篇 |
免费 | 1040篇 |
国内免费 | 538篇 |
专业分类
化学 | 1454篇 |
晶体学 | 28篇 |
力学 | 1599篇 |
综合类 | 192篇 |
数学 | 12086篇 |
物理学 | 1892篇 |
出版年
2024年 | 23篇 |
2023年 | 153篇 |
2022年 | 360篇 |
2021年 | 383篇 |
2020年 | 314篇 |
2019年 | 336篇 |
2018年 | 359篇 |
2017年 | 459篇 |
2016年 | 439篇 |
2015年 | 347篇 |
2014年 | 633篇 |
2013年 | 1083篇 |
2012年 | 818篇 |
2011年 | 738篇 |
2010年 | 674篇 |
2009年 | 903篇 |
2008年 | 943篇 |
2007年 | 982篇 |
2006年 | 782篇 |
2005年 | 700篇 |
2004年 | 553篇 |
2003年 | 540篇 |
2002年 | 492篇 |
2001年 | 440篇 |
2000年 | 441篇 |
1999年 | 342篇 |
1998年 | 402篇 |
1997年 | 334篇 |
1996年 | 253篇 |
1995年 | 244篇 |
1994年 | 218篇 |
1993年 | 179篇 |
1992年 | 171篇 |
1991年 | 130篇 |
1990年 | 112篇 |
1989年 | 89篇 |
1988年 | 85篇 |
1987年 | 76篇 |
1986年 | 79篇 |
1985年 | 99篇 |
1984年 | 88篇 |
1983年 | 37篇 |
1982年 | 57篇 |
1981年 | 47篇 |
1980年 | 58篇 |
1979年 | 72篇 |
1978年 | 47篇 |
1977年 | 52篇 |
1976年 | 47篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
122.
Asymptotic methods for contact problems are expounded. Some typical integral equations are considered 相似文献
123.
Silvia Lorenzo-Freire José M. Alonso-Meijide Balbina Casas-Méndez Ruud Hendrickx 《European Journal of Operational Research》2007
Calleja et al. [Calleja, P., Borm, P., Hendrickx, R., 2005. Multi-issue allocation situations. European Journal of Operational Research 164, 730–747] introduced multi-issue allocation situations with awards. In this paper, we extend the classical model of cooperative games with transferable utility to the cooperative games with transferable utility and awards. We define a run-to-the-bank rule for cooperative games with transferable utility and awards and characterise it in terms of a property of balanced contributions. We apply our main result to bankruptcy problems and multi-issue allocation situations with awards. 相似文献
124.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献
125.
文章建立一个随机内生增长模型来阐明主要政策参数对经济增长与社会福利的影响.若对生产函数、效用函数、偏好及随机干扰作一些特殊的假设,我们证明了主要政策参数的均衡值能被模型参数唯一决定.进一步我们还得到了期望增长率与储蓄的清晰解.文章的最后,我们证明了政府支出直接影响个体决策者的决策:即提高经济增长率将减少福利;反之,增加福利将减少增长率. 相似文献
126.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
127.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
128.
关于《一类奇异边值问题的正解》的注记 总被引:3,自引:0,他引:3
文[4]通过构造反例断言文[1]中定理的必要性证明有误,本文首先指出文[4] 的这个断言不正确,然后对文[4]中定理2.1作了本质性的改进. 相似文献
129.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
130.
An exponentially fitted special second-order finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer at one end (left or right) point. A fitting factor is introduced in a tri-diagonal finite difference scheme and is obtained from the theory of singular perturbations. Thomas Algorithm is used to solve the system and its stability is investigated. To demonstrate the applicability of the method, we have solved several linear and non-linear problems. From the results, it is observed that the present method approximates the exact solution very well. 相似文献