全文获取类型
收费全文 | 14161篇 |
免费 | 875篇 |
国内免费 | 471篇 |
专业分类
化学 | 2062篇 |
晶体学 | 30篇 |
力学 | 1330篇 |
综合类 | 157篇 |
数学 | 9759篇 |
物理学 | 2169篇 |
出版年
2024年 | 18篇 |
2023年 | 153篇 |
2022年 | 384篇 |
2021年 | 400篇 |
2020年 | 261篇 |
2019年 | 303篇 |
2018年 | 302篇 |
2017年 | 406篇 |
2016年 | 380篇 |
2015年 | 304篇 |
2014年 | 609篇 |
2013年 | 906篇 |
2012年 | 833篇 |
2011年 | 717篇 |
2010年 | 668篇 |
2009年 | 875篇 |
2008年 | 882篇 |
2007年 | 916篇 |
2006年 | 700篇 |
2005年 | 585篇 |
2004年 | 494篇 |
2003年 | 446篇 |
2002年 | 415篇 |
2001年 | 347篇 |
2000年 | 337篇 |
1999年 | 260篇 |
1998年 | 294篇 |
1997年 | 268篇 |
1996年 | 235篇 |
1995年 | 227篇 |
1994年 | 218篇 |
1993年 | 176篇 |
1992年 | 163篇 |
1991年 | 117篇 |
1990年 | 112篇 |
1989年 | 86篇 |
1988年 | 67篇 |
1987年 | 58篇 |
1986年 | 67篇 |
1985年 | 85篇 |
1984年 | 80篇 |
1983年 | 25篇 |
1982年 | 64篇 |
1981年 | 41篇 |
1980年 | 38篇 |
1979年 | 56篇 |
1978年 | 36篇 |
1977年 | 40篇 |
1976年 | 26篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
32.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
33.
SUN Qiyu 《数学年刊B辑(英文版)》2003,24(3):367-386
In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2). 相似文献
34.
本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。 相似文献
35.
从决策有限理性角度,引入行为金融理论于机构投资风险优化系统,对多心理账户条件下机构投资的风险优化设计进行了研究。以Friedman和Savage之谜为释例,对机构投资风险优化中的诸多非标准金融异像进行了解释。以Shefrin和Statman行为证券组合理论为核心,建立了多心理账户条件下机构投资的风险优化模型,为机构投资的风险优化实践提供了一种量化分析工具。 相似文献
36.
37.
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. 相似文献
38.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献
39.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
40.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献