全文获取类型
收费全文 | 4344篇 |
免费 | 84篇 |
国内免费 | 68篇 |
专业分类
化学 | 87篇 |
力学 | 200篇 |
综合类 | 6篇 |
数学 | 3548篇 |
物理学 | 655篇 |
出版年
2023年 | 23篇 |
2022年 | 38篇 |
2021年 | 49篇 |
2020年 | 122篇 |
2019年 | 125篇 |
2018年 | 97篇 |
2017年 | 71篇 |
2016年 | 63篇 |
2015年 | 93篇 |
2014年 | 217篇 |
2013年 | 609篇 |
2012年 | 248篇 |
2011年 | 262篇 |
2010年 | 238篇 |
2009年 | 285篇 |
2008年 | 279篇 |
2007年 | 272篇 |
2006年 | 188篇 |
2005年 | 87篇 |
2004年 | 93篇 |
2003年 | 73篇 |
2002年 | 81篇 |
2001年 | 68篇 |
2000年 | 60篇 |
1999年 | 45篇 |
1998年 | 52篇 |
1997年 | 41篇 |
1996年 | 57篇 |
1995年 | 45篇 |
1994年 | 45篇 |
1993年 | 40篇 |
1992年 | 24篇 |
1991年 | 20篇 |
1990年 | 28篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 20篇 |
1986年 | 24篇 |
1985年 | 30篇 |
1984年 | 35篇 |
1983年 | 24篇 |
1982年 | 34篇 |
1981年 | 28篇 |
1980年 | 35篇 |
1979年 | 29篇 |
1978年 | 35篇 |
1977年 | 16篇 |
1976年 | 8篇 |
1975年 | 3篇 |
1972年 | 4篇 |
排序方式: 共有4496条查询结果,搜索用时 0 毫秒
41.
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. 相似文献
42.
Y. Wardi 《Journal of Optimization Theory and Applications》1990,64(2):399-417
Stochastic algorithms for optimization problems, where function evaluations are done by Monte Carlo simulations, are presented. At each iteratex
i, they draw a predetermined numbern(i) of sample points from an underlying probability space; based on these sample points, they compute a feasible-descent direction, an Armijo stepsize, and the next iteratex
i+1. For an appropriate optimality function , corresponding to an optimality condition, it is shown that, ifn(i) , then (x
i) 0, whereJ is a set of integers whose upper density is zero. First, convergence is shown for a general algorithm prototype: then, a steepest-descent algorithm for unconstrained problems and a feasible-direction algorithm for problems with inequality constraints are developed. A numerical example is supplied. 相似文献
43.
In this paper, we identify a new class of stochastic linearconvex optimal control problems, whose solution can be obtained by solving appropriate equivalent deterministic optimal control problems. The term linear-convex is meant to imply that the dynamics is linear and the cost function is convex in the state variables, linear in the control variables, and separable. Moreover, some of the coefficients in the dynamics are allowed to be random and the expectations of the control variables are allowed to be constrained. For any stochastic linear-convex problem, the equivalent deterministic problem is obtained. Furthermore, it is shown that the optimal feedback policy of the stochastic problem is affine in its current state, where the affine transformation depends explicitly on the optimal solution of the equivalent deterministic problem in a simple way. The result is illustrated by its application to a simple stochastic inventory control problem.This research was supported in part by NSERC Grant A4617, by SSHRC Grant 410-83-0888, and by an INRIA Post-Doctoral Fellowship. 相似文献
44.
P. Marcotte 《Mathematical Programming》1986,34(2):142-162
45.
46.
《Operations Research Letters》2022,50(1):76-83
We derive formulas for constants of strong convexity (CSCs) of expectation functions encountered in two-stage stochastic programs with linear recourse. One of them yields a CSC as the optimal value of a certain quadratically constrained quadratic program, another one in terms of the thickness of the feasibility polytope of the dual problem associated to the recourse problem. CSCs appear in Hoelder-type estimates relating the distance of optimal solution sets of stochastic programs to a suitable distance of underlying probability distributions. 相似文献
47.
Tong ZHAO 《数学年刊B辑(英文版)》2022,43(2):195-208
This paper characterizes the limits of a large system of interacting particles distributed on the real line. The interaction occurring among neighbors involves two kinds of independent actions with different rates. This system is a generalization of the voter process, of which each particle is of type A or a. Under suitable scaling, the local proportion functions of A particles converge to continuous functions which solve a class of stochastic partial differential equations driven by Fisher-Wrig... 相似文献
48.
Asymptotic Behavior of a Stochastic Predator-prey Model with Beddington-DeAngelis Functional Response and L\'{e}vy Jumps 下载免费PDF全文
A stochastic two-prey-one-predator model with Beddington-DeAngelis functional response and L\''{e}vy jumps is proposed and investigated in this paper. First of all, we prove the existence and uniqueness of the global positive solution, and stochastic ultimate boundedness of the solution. Next, under a simple assumption, by using It\^{o} formula and other important inequalities, some sufficient conditions are established to ensure the extinction and persistence in the mean of the system. The results show that neither strong white noise nor L\''{e}vy noise is conducive to the persistence of the population. Finally, the theoretical results are verified by numerical simulations. 相似文献
49.
General Stochastic Hybrid System (SHS) are characterised by Stochastic Differential Equations (SDEs) with discontinuities and Poisson jump processes. SHS are useful in model based design of Cyber-Physical System (CPS) controllers under uncertainty. Industry standard model based design tools such as Simulink/Stateflow® are inefficient when simulating, testing, and validating SHS, because of dependence on fixed-step Euler–Maruyama (EM) integration and discontinuity detection. We present a novel efficient adaptive step-size simulation/integration technique for general SHSs modelled as a network of Stochastic Hybrid Automatons (SHAs). We propose a simulation algorithm where each SHA in the network executes synchronously with the other, at an integration step-size computed using adaptive step-size integration. Ito’ multi-dimensional lemma and the inverse sampling theorem are leveraged to compute the integration step-size by making the SDEs and Poisson jump rate integration dependent upon discontinuities. Existence and convergence analysis along with experimental results show that the proposed technique is substantially faster than Simulink/Stateflow®when simulating general SHSs. 相似文献
50.
Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log3/2
n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%). 相似文献