全文获取类型
收费全文 | 11571篇 |
免费 | 1029篇 |
国内免费 | 414篇 |
专业分类
化学 | 1962篇 |
晶体学 | 58篇 |
力学 | 1601篇 |
综合类 | 192篇 |
数学 | 6959篇 |
物理学 | 2242篇 |
出版年
2024年 | 14篇 |
2023年 | 117篇 |
2022年 | 228篇 |
2021年 | 366篇 |
2020年 | 255篇 |
2019年 | 257篇 |
2018年 | 307篇 |
2017年 | 426篇 |
2016年 | 390篇 |
2015年 | 298篇 |
2014年 | 561篇 |
2013年 | 711篇 |
2012年 | 710篇 |
2011年 | 600篇 |
2010年 | 563篇 |
2009年 | 666篇 |
2008年 | 658篇 |
2007年 | 718篇 |
2006年 | 615篇 |
2005年 | 520篇 |
2004年 | 417篇 |
2003年 | 392篇 |
2002年 | 360篇 |
2001年 | 325篇 |
2000年 | 312篇 |
1999年 | 262篇 |
1998年 | 258篇 |
1997年 | 224篇 |
1996年 | 161篇 |
1995年 | 188篇 |
1994年 | 157篇 |
1993年 | 132篇 |
1992年 | 122篇 |
1991年 | 100篇 |
1990年 | 82篇 |
1989年 | 68篇 |
1988年 | 59篇 |
1987年 | 43篇 |
1986年 | 44篇 |
1985年 | 60篇 |
1984年 | 54篇 |
1983年 | 16篇 |
1982年 | 26篇 |
1981年 | 24篇 |
1980年 | 21篇 |
1979年 | 34篇 |
1978年 | 21篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
Stochastic programming is recognized as a powerful tool to help decision making under uncertainty in financial planning. The deterministic equivalent formulations of these stochastic programs have huge dimensions even for moderate numbers of assets, time stages and scenarios per time stage. So far models treated by mathematical programming approaches have been limited to simple linear or quadratic models due to the inability of currently available solvers to solve NLP problems of typical sizes. However stochastic programming problems are highly structured. The key to the efficient solution of such problems is therefore the ability to exploit their structure. Interior point methods are well-suited to the solution of very large non-linear optimization problems. In this paper we exploit this feature and show how portfolio optimization problems with sizes measured in millions of constraints and decision variables, featuring constraints on semi-variance, skewness or non-linear utility functions in the objective, can be solved with the state-of-the-art solver. 相似文献
982.
This paper describes a class of frame-based direct search methods for unconstrained optimization without derivatives. A template for convergent direct search methods is developed, some requiring only the relative ordering of function values. At each iteration, the template considers a number of search steps which form a positive basis and conducts a ray search along a step giving adequate decrease. Various ray search strategies are possible, including discrete equivalents of the Goldstein–Armijo and one-sided Wolfe–Powell ray searches. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another. 相似文献
983.
We describe a new parallel method for solving global optimization problems. The formulation of the decision rules of this method is presented. We examine convergence conditions of the proposed algorithm and establish conditions which guarantee a considerable speedup with respect to the sequential version of the algorithm. We also present some numerical experiments executed on Alliant FX/80 for one class of multiextremal functions.The authors are greatly indebted to R. G. Strongin who stimulated the fulfillment of this research. They also would like to thank the anonymous referees for their useful suggestions.The research of the first author was partially supported by Grant 9494/NC/89 from the Italian Government under the Italian-Soviet Agreement about the Cultural and Scientific Exchange in 1990–1991. He thanks the Systems Department, University of Calabria, where he was a Visitor. 相似文献
984.
Mark S. Gockenbach Anthony J. Kearsley William W. Symes 《Computational Optimization and Applications》1997,8(3):273-286
Minimizing the Lennard-Jones potential, the most-studied modelproblem for molecular conformation, is an unconstrained globaloptimization problem with a large number of local minima. In thispaper, the problem is reformulated as an equality constrainednonlinear programming problem with only linear constraints. Thisformulation allows the solution to approached through infeasibleconfigurations, increasing the basin of attraction of the globalsolution. In this way the likelihood of finding a global minimizeris increased. An algorithm for solving this nonlinear program isdiscussed, and results of numerical tests are presented. 相似文献
985.
A manufacturing system with two tandem machines producing one part type is considered in this work. The machines are unreliable, each having two states, up and down. Both surplus controls and Kanban systems are considered. Algorithms for approximating the optimal threshold values are developed. First, perturbation analysis techniques are employed to obtain consistent gradient estimates based on a single simulation run. Then, iterative algorithms of the stochastic optimization type are constructed. It is shown that the algorithms converge to the optimal threshold values in an appropriate sense. Numerical examples are provided to demonstrate the performance of the algorithms.The research of these authors was supported in part by grants from URIF, MRCO, National Science Foundation, and Wayne State University. The authors would like to thank Dr. X. R. Cao, Digital Equipment Corporation, for the valuable initial discussion and Dr. X. Y. Zhou, University of Toronto, for his helpful comments. 相似文献
986.
Interval arithmetic and Taylor's formula can be used to bound the slope of the cord of a univariate function at a given point. This leads in turn to bounding the values of the function itself. Computing such bounds for the function, its first and second derviatives, allows the determination of intervals in which this function cannot have a global minimum. Exploiting this information together with a simple branching rule yields an efficient algorithm for global minimization of univariate functions. Computational experience is reported.The first and second authors have been supported by FCAR (Fonds pour la Formation de Chercheurs et l'Aide à la Recherche) Grant 92EQ1048 and AFOSR Grant 90-0008 to Rutgers University. The first author has also been supported by NSERC (Natural Sciences and Engineering Research Council of Canada) Grant to HEC and NSERC Grant GP0105574. The second author has been supported by NSERC Grant GP0036426, FCAR Grant 90NC0305, and a NSF Visiting Professorship for Women in Science at Princeton University. Work of the third author was done in part while he was a graduate student at the Department of Mathematics, Rutgers University, New Brunswick, New Jersey, USA and during a visit to GERAD, June–August 1991. 相似文献
987.
L. Lukšan 《Journal of Optimization Theory and Applications》1994,83(1):27-47
Variable metric methods from the Broyden family are well known and commonly used for unconstrained minimization. These methods have good theoretical and practical convergence properties which depend on a selection of free parameters. We demonstrate, using extensive computational experiments, the influence of both the Biggs stabilization parameter and Oren scaling parameter on 12 individual variable metric updates, two of which are new. This paper focuses on a class of variable metric updates belonging to the so-called preconvex part of the Broyden family. These methods outperform the more familiar BFGS method. We also experimentally demonstrate the efficiency of the controlled scaling strategy for problems of sufficient size and sparsity. 相似文献
988.
Convergence of Perry and Shanno's Memoryless Quasi-Newton Method for Nonconvex Optimization Problems 总被引:2,自引:0,他引:2
1.IntroductionWeconsidertheunconstrainedoptimizationproblem:minj(x).(1.1)acRewheref:R"-- Riscontinuouslydifferelltiable.PerryandShanno'smemorylesssquasiNewtonmethodisoftenusedtosolvetheproblem(1.1)whennislarge.ItwasoriginatedfromtheworksofPerry(1977[l])an… 相似文献
989.
Dietrich Stauffer 《Journal of statistical physics》1994,74(5-6):1293-1299
In Kauffman's Boolean automata model on the square lattice, the Darwinian fitness of survival can be defined as the fraction of elements which do not change from one iteration to the next. Biological mutations are simulated by filpping one bit in the rule of one site. Selection of the fitter mutant then optimizes the whole lattice completely. This optimization is particularly effective near the critical point of the transition to chaos, but is in itself not a critical phenomenon. Also a two-dimensional spin glass can be optimized in this way. 相似文献
990.
R. Lipton 《Journal of Optimization Theory and Applications》1994,81(3):549-568
The relaxation for optimal complicance design is independent of whether the underlying elastic problem is formulated in terms of displacements or strains. For the purposes of numerical experimentation and computation, it may be advantageous to formulate optimal design problems in terms of displacements as is done in Ref. 1. The relaxed problem delivered by the displacement-based formulation is of min-min-max type. Because of this, efficient numerical implementation is hampered by the order of the last two min-max operations. We show here that the last two min-max operations may be exchanged, facilitating an efficient numerical algorithm. We remark that the rigorous results given here corroborate the numerical methods and experiments given in Ref. 1.This work was supported by NSF Grant DMS-92-05158. 相似文献