全文获取类型
收费全文 | 9799篇 |
免费 | 728篇 |
国内免费 | 262篇 |
专业分类
化学 | 1318篇 |
晶体学 | 31篇 |
力学 | 1096篇 |
综合类 | 145篇 |
数学 | 6680篇 |
物理学 | 1519篇 |
出版年
2024年 | 22篇 |
2023年 | 102篇 |
2022年 | 334篇 |
2021年 | 336篇 |
2020年 | 207篇 |
2019年 | 222篇 |
2018年 | 241篇 |
2017年 | 327篇 |
2016年 | 309篇 |
2015年 | 228篇 |
2014年 | 456篇 |
2013年 | 548篇 |
2012年 | 611篇 |
2011年 | 469篇 |
2010年 | 442篇 |
2009年 | 549篇 |
2008年 | 550篇 |
2007年 | 602篇 |
2006年 | 483篇 |
2005年 | 422篇 |
2004年 | 333篇 |
2003年 | 311篇 |
2002年 | 287篇 |
2001年 | 262篇 |
2000年 | 261篇 |
1999年 | 193篇 |
1998年 | 211篇 |
1997年 | 192篇 |
1996年 | 135篇 |
1995年 | 160篇 |
1994年 | 132篇 |
1993年 | 111篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 30篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
O. A. Brezhneva Yu. G. Evtushenko A. A. Tret’yakov 《Computational Mathematics and Mathematical Physics》2006,46(11):1896-1909
The theory of p-regularity is applied to optimization problems and to singular ordinary differential equations (ODE). The special variant of the method of the modified Lagrangian function proposed by Yu.G. Evtushenko for constrained optimization problems with inequality constraints is justified on the basis of the 2-factor transformation. An implicit function theorem is given for the singular case. This theorem is used to show the existence of solutions to a boundary value problem for a nonlinear differential equation in the resonance case. New numerical methods are proposed including the p-factor method for solving ODEs with a small parameter. 相似文献
92.
N. B. Brusnikina A. V. Lotov 《Computational Mathematics and Mathematical Physics》2007,47(11):1779-1787
A method is proposed for approximating the reachable set of a dynamic system with a state space dimension no higher than six-eight considered on a finite time interval. The system is governed by linear differential equations with piecewise constant coefficients and impulse actions specified at prescribed times. The method is based on guaranteed-accuracy polyhedral approximations of reachable sets at researcher-specified times. Every approximation is constructed using the preceding one. A procedure is described for choosing parameters of the method that ensure the required accuracy with close-to-minimal time costs. 相似文献
93.
航空公司在给定的运力和机队配置条件下,如何适应航线需求的不断变化而合理地分配运力,使航空公司的经营效益最大化是我国航空经营管理的一个重大课题.根据航班效益分析,在一定的经营时间,航行班次的条件下,建立一个航线贡献最大化的含有随机变量的动态规划模型.求解方法是先用M ON TE C ARLO方法计算机仿真把模型转化为非线性的整数规划.再用动态规划中资源分配算法求出模型的最优解,编排最优各航线规划. 相似文献
94.
Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming 总被引:1,自引:0,他引:1
Hyeong Soo Chang 《Journal of Global Optimization》2006,35(3):423-441
In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving
combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value.
We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost
stochastic dynamic programming problems and show that HBPI also converges to the optimal value. 相似文献
95.
We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions. 相似文献
96.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献
97.
Erica L. Plambeck Bor-Ruey Fu Stephen M. Robinson Rajan Suri 《Mathematical Programming》1996,75(2):137-176
In this paper we propose a method for optimizing convex performance functions in stochastic systems. These functions can include
expected performance in static systems and steady-state performance in discrete-event dynamic systems; they may be nonsmooth.
The method is closely related to retrospective simulation optimization; it appears to overcome some limitations of stochastic
approximation, which is often applied to such problems. We explain the method and give computational results for two classes
of problems: tandem production lines with up to 50 machines, and stochastic PERT (Program Evaluation and Review Technique)
problems with up to 70 nodes and 110 arcs.
Sponsored by the National Science Foundation under grant number CCR-9109345, by the Air Force Systems Command, USAF, under
grant numbers F49620-93-1-0068 and F49620-95-1-0222, by the U.S. Army Research Office under grant number DAAL03-92-G-0408,
and by the U.S. Army Space and Strategic Defense Command under contract number DASG60-91-C-0144. The U.S. Government has certain
rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding
any copyright notation thereon.
Sponsored by a Wisconsin/Hilldale Research Award, by the U.S. Army Space and Strategic Defense Command under contract number
DASG60-91-C-0144, and the Air Force Systems Command, USAF, under grant number F49620-93-1-0068.
Sponsored by the National Science Foundation under grant number DDM-9201813. 相似文献
98.
M. A. Morón C. Romero F. R. Ruiz del Portal 《Journal of Optimization Theory and Applications》1996,91(3):643-649
The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain. 相似文献
99.
On the numerical solution of a class of Stackelberg problems 总被引:1,自引:0,他引:1
J. V. Outrata 《Mathematical Methods of Operations Research》1990,34(4):255-277
This study tries to develop two new approaches to the numerical solution of Stackelberg problems. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. The approaches are illustrated by simple examples and an optimum design problem with an elliptic variational inequality.Prepared while the author was visiting the Department of Mathematics, University of Bayreuth as a guest of the FSP Anwendungsbezogene Optimierung und Steuerung. 相似文献
100.
We study the convergence properties of reduced Hessian successive quadratic programming for equality constrained optimization. The method uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula. Two merit functions are considered for the line search: the
1 function and the Fletcher exact penalty function. We give conditions under which local and superlinear convergence is obtained, and also prove a global convergence result. The analysis allows the initial reduced Hessian approximation to be any positive definite matrix, and does not assume that the iterates converge, or that the matrices are bounded. The effects of a second order correction step, a watchdog procedure and of the choice of null space basis are considered. This work can be seen as an extension to reduced Hessian methods of the well known results of Powell (1976) for unconstrained optimization.This author was supported, in part, by National Science Foundation grant CCR-8702403, Air Force Office of Scientific Research grant AFOSR-85-0251, and Army Research Office contract DAAL03-88-K-0086.This author was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contracts W-31-109-Eng-38 and DE FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071. 相似文献