全文获取类型
收费全文 | 7996篇 |
免费 | 267篇 |
国内免费 | 164篇 |
专业分类
化学 | 250篇 |
晶体学 | 1篇 |
力学 | 326篇 |
综合类 | 78篇 |
数学 | 7442篇 |
物理学 | 330篇 |
出版年
2023年 | 32篇 |
2022年 | 69篇 |
2021年 | 81篇 |
2020年 | 95篇 |
2019年 | 101篇 |
2018年 | 105篇 |
2017年 | 142篇 |
2016年 | 131篇 |
2015年 | 121篇 |
2014年 | 318篇 |
2013年 | 371篇 |
2012年 | 432篇 |
2011年 | 317篇 |
2010年 | 336篇 |
2009年 | 476篇 |
2008年 | 501篇 |
2007年 | 525篇 |
2006年 | 363篇 |
2005年 | 331篇 |
2004年 | 264篇 |
2003年 | 256篇 |
2002年 | 264篇 |
2001年 | 220篇 |
2000年 | 243篇 |
1999年 | 192篇 |
1998年 | 168篇 |
1997年 | 163篇 |
1996年 | 191篇 |
1995年 | 183篇 |
1994年 | 128篇 |
1993年 | 128篇 |
1992年 | 134篇 |
1991年 | 118篇 |
1990年 | 101篇 |
1989年 | 70篇 |
1988年 | 87篇 |
1987年 | 57篇 |
1986年 | 85篇 |
1985年 | 114篇 |
1984年 | 79篇 |
1983年 | 22篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 34篇 |
1979年 | 27篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 28篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8427条查询结果,搜索用时 468 毫秒
21.
求线性规划初始可行基的新方法 总被引:9,自引:3,他引:6
本文提出一个求线性规划初始可行基的新算法,该算法不仅避免了人工变量,而且理论分析及初步的数值实验结果表明其效率更高。 相似文献
22.
线性规划联合算法的理论与应用 总被引:6,自引:4,他引:2
本在[1]的基础上.较系统的叙述了线性规划联合算法的步骤、相关理论及其应用,指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。 相似文献
23.
24.
本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。 相似文献
25.
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. 相似文献
26.
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. 相似文献
27.
在等离子体增强化学气相淀积系统中,采用aSi:H层淀积和原位等离子体氧化相结合的逐层生长技术制备了aSi:H/SiO_2多层膜.在激光诱导限制结晶原理基础上,使用KrF准分子脉冲激光为辐照源,对aSi:H/SiO_2多层膜进行辐照,使纳米级厚度的aSi:H子层晶化.Raman散射谱和电子衍射谱的结果表明,经过激光辐照后纳米Si颗粒在原始的aSi:H子层内形成,晶粒尺寸可以根据aSi:H层的厚度精确控制.还研究了样品的光致发光(PL)特性以及激光辐照能量密度对PL性质的影响.
关键词:
脉冲激光
多层膜
限制结晶 相似文献
28.
G. Z. Ruan S. Y. Wang Y. Yamamoto S. S. Zhu 《Journal of Optimization Theory and Applications》2004,123(2):409-429
In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems. 相似文献
29.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
30.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献