全文获取类型
收费全文 | 10379篇 |
免费 | 799篇 |
国内免费 | 343篇 |
专业分类
化学 | 1829篇 |
晶体学 | 28篇 |
力学 | 1071篇 |
综合类 | 150篇 |
数学 | 6943篇 |
物理学 | 1500篇 |
出版年
2024年 | 17篇 |
2023年 | 98篇 |
2022年 | 279篇 |
2021年 | 337篇 |
2020年 | 215篇 |
2019年 | 229篇 |
2018年 | 250篇 |
2017年 | 331篇 |
2016年 | 329篇 |
2015年 | 247篇 |
2014年 | 474篇 |
2013年 | 591篇 |
2012年 | 626篇 |
2011年 | 492篇 |
2010年 | 466篇 |
2009年 | 582篇 |
2008年 | 584篇 |
2007年 | 638篇 |
2006年 | 542篇 |
2005年 | 492篇 |
2004年 | 413篇 |
2003年 | 389篇 |
2002年 | 313篇 |
2001年 | 293篇 |
2000年 | 294篇 |
1999年 | 209篇 |
1998年 | 243篇 |
1997年 | 226篇 |
1996年 | 151篇 |
1995年 | 171篇 |
1994年 | 132篇 |
1993年 | 114篇 |
1992年 | 101篇 |
1991年 | 85篇 |
1990年 | 78篇 |
1989年 | 61篇 |
1988年 | 48篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 57篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
22.
23.
24.
25.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
26.
本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。 相似文献
27.
从决策有限理性角度,引入行为金融理论于机构投资风险优化系统,对多心理账户条件下机构投资的风险优化设计进行了研究。以Friedman和Savage之谜为释例,对机构投资风险优化中的诸多非标准金融异像进行了解释。以Shefrin和Statman行为证券组合理论为核心,建立了多心理账户条件下机构投资的风险优化模型,为机构投资的风险优化实践提供了一种量化分析工具。 相似文献
28.
Employing a cleavable carbohydrate–peptide linker, a new strategy for single-bead analysis of multivalent cyclic neoglycopeptides based on Edman degradation is described. Edman degradation of glycopeptides is hampered by the acid lability of the glycosidic bond and potential incompatibilities of phenylthiohydantoin (PTH) derivatives of glycosylated amino acids with PTH derivatives of the proteinogenic amino acids. To overcome this problem, carbohydrates are detached from the cyclopeptide templates before single-bead analysis, allowing for micro sequencing under routine conditions. With this strategy, application of multivalent cyclic neoglycopeptides in split-mix libraries with a subsequent screening process becomes possible for the first time. 相似文献
29.
30.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献