全文获取类型
收费全文 | 871篇 |
免费 | 30篇 |
国内免费 | 32篇 |
专业分类
化学 | 4篇 |
力学 | 18篇 |
综合类 | 11篇 |
数学 | 893篇 |
物理学 | 7篇 |
出版年
2023年 | 6篇 |
2022年 | 4篇 |
2021年 | 10篇 |
2020年 | 13篇 |
2019年 | 14篇 |
2018年 | 17篇 |
2017年 | 18篇 |
2016年 | 22篇 |
2015年 | 18篇 |
2014年 | 22篇 |
2013年 | 48篇 |
2012年 | 76篇 |
2011年 | 22篇 |
2010年 | 26篇 |
2009年 | 42篇 |
2008年 | 42篇 |
2007年 | 47篇 |
2006年 | 49篇 |
2005年 | 48篇 |
2004年 | 31篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 36篇 |
2000年 | 25篇 |
1999年 | 25篇 |
1998年 | 20篇 |
1997年 | 19篇 |
1996年 | 13篇 |
1995年 | 14篇 |
1994年 | 17篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 10篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有933条查询结果,搜索用时 15 毫秒
21.
CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION 总被引:2,自引:0,他引:2
丘京辉 《数学物理学报(B辑英文版)》2007,27(1):211-218
By using cone-directed contingent derivatives, the unified necessary and suffi-cient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set valued optimization. 相似文献
22.
Contingent epiderivatives and set-valued optimization 总被引:24,自引:0,他引:24
In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions. 相似文献
23.
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. 相似文献
24.
D. A. Carlson 《Journal of Optimization Theory and Applications》1986,51(1):41-62
In this paper, we investigate the existence of finitely optimal solutions for the Lagrange problem of optimal control defined on [0, ) under weaker convexity and seminormality hypotheses than those of previous authors. The notion of finite optimality has been introduced into the literature as the weakest of a hierarchy of types of optimality that have been defined to permit the study of Lagrange problems, arising in mathematical economics, whose cost functions either diverge or are not bounded below. Our method of proof requires us to analyze the continuous dependence of finite-interval Lagrange problems with respect to a prescribed terminal condition. Once this is done, we show that a finitely optimal solution can be obtained as the limit of a sequence of solutions to a sequence of corresponding finite-horizon optimal control problems. Our results utilize the convexity and seminormality hypotheses which are now classical in the existence theory of optimal control.This research forms part of the author's doctoral dissertation written at the University of Delaware, Newark, Delaware under the supervision of Professor Thomas S. Angell. 相似文献
25.
Necessary conditions for a given pointx
0 to be a locally weak solution to the Pareto minimization problem of a vector-valued functionF=(f
1,...,f
m
),F:XR
m,XR
m, are presented. As noted in Ref. 1, the classical necessary condition-conv {Df
1(x
0)|i=1,...,m}T
*(X, x
0) need not hold when the contingent coneT is used. We have proven, however, that a properly adjusted approximate version of this classical condition always holds. Strangely enough, the approximation form>2 must be weaker than form=2.The authors would like to thank the anonymous referee for the suggestions which led to an improved presentation of the paper. 相似文献
26.
Chu-In Charles Lee 《Annals of the Institute of Statistical Mathematics》1992,44(1):107-120
The Laplace continued fraction is derived through a power series. It provides both upper bounds and lower bounds of the normal tail probability % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x), it is simple, it converges for x>0, and it is by far the best approximation for x3. The Laplace continued fraction is rederived as an extreme case of admissible bounds of the Mills' ratio, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x)/(x), in the family of ratios of two polynomials subject to a monotone decreasing absolute error. However, it is not optimal at any finite x. Convergence at the origin and local optimality of a subclass of admissible bounds are investigated. A modified continued fraction is proposed. It is the sharpest tail bound of the Mills' ratio, it has a satisfactory convergence rate for x1 and it is recommended for the entire range of x if a maximum absolute error of 10-4 is required.The efforts of the author were supported by the NSERC of Canada. 相似文献
27.
The emerging technology in net-zero building and smart grids drives research moving from centralized operation decisions on a single building to decentralized decisions on a group of buildings, termed a building cluster which shares energy resources locally and globally. However, current research has focused on developing an accurate simulation of single building energy usage which limits its application to building clusters as scenarios such as energy sharing and competition cannot be modeled and studied. We hypothesize that the study of energy usage for a group of buildings instead of one single building will result in a cost effective building system which in turn will be resilient to power disruption. To this end, this paper develops a decision model based on a building cluster simulator with each building modeled by energy consumption, storage and generation sub modules. Assuming each building is interested in minimizing its energy cost, a bi-level operation decision framework based on a memetic algorithm is proposed to study the tradeoff in energy usage among the group of buildings. Two additional metrics, measuring the comfort level and the degree of dependencies on the power grid are introduced for the analysis. The experimental result demonstrates that the proposed framework is capable of deriving the Pareto solutions for the building cluster in a decentralized manner. The Pareto solutions not only enable multiple dimensional tradeoff analysis, but also provide valuable insight for determining pricing mechanisms and power grid capacity. 相似文献
28.
《Optimization》2012,61(4):771-797
In this paper, we consider extended vector-valued mappings defined on a normed linear space. Based on the recent semicontinuous regularizations related to hypographical and/or epigraphical profile mappings of the considered function introduced, we define semicontinuous radial epiderivatives. We, then, demonstrate that the properties of these epiderivatives amount to properties of hypographical and/or epigraphical profile mappings of the corresponding difference quotient of the underlying function, which simplify fairly well the proofs in the radial epiderivative formulaes. In particular, we stress the impact of semicontinuity, hence, we characterize with new arguments the radial epiderivatives in terms of the suprema and/or infima of the interiorly radial cone of the hypograph and/or epigraph of the considered function. Finally, we obtain optimality conditions for general non-convex constrained vector optimization problems. We apply thereafter the obtained pattern to a parametric quasiconvex programming problem for which we derive necessary and sufficient optimality conditions that are not sensitive to perturbation at the nominal level, yielding henceforth more – and strong at least under asymptotically regular constraints – information than the recent stability results obtained under additional conditions on the regularity of the normal cone to the adjusted sublevel sets of the underlying function. 相似文献
29.
This paper presents an exhaustive approach to optimality theory in semi-infinite linear programming, placing a special emphasis on generality. After surveying optimality conditions for general problems, a detailed analysis is made of problems in which the coefficients are continuous functions of a parameter which varies on a compact set, adopting a feasible directions approach. Lastly, the case of analytical coefficients over an interval is considered in some detail. 相似文献
30.
In this paper we present a new approach, based on the Nearest Interval Approximation Operator, for dealing with a multiobjective programming problem with fuzzy-valued objective functions. 相似文献