全文获取类型
收费全文 | 3480篇 |
免费 | 353篇 |
国内免费 | 364篇 |
专业分类
化学 | 139篇 |
晶体学 | 3篇 |
力学 | 182篇 |
综合类 | 106篇 |
数学 | 3500篇 |
物理学 | 267篇 |
出版年
2024年 | 5篇 |
2023年 | 25篇 |
2022年 | 51篇 |
2021年 | 66篇 |
2020年 | 66篇 |
2019年 | 87篇 |
2018年 | 78篇 |
2017年 | 131篇 |
2016年 | 157篇 |
2015年 | 81篇 |
2014年 | 169篇 |
2013年 | 271篇 |
2012年 | 183篇 |
2011年 | 193篇 |
2010年 | 193篇 |
2009年 | 237篇 |
2008年 | 260篇 |
2007年 | 261篇 |
2006年 | 226篇 |
2005年 | 201篇 |
2004年 | 149篇 |
2003年 | 147篇 |
2002年 | 135篇 |
2001年 | 105篇 |
2000年 | 91篇 |
1999年 | 84篇 |
1998年 | 69篇 |
1997年 | 80篇 |
1996年 | 64篇 |
1995年 | 41篇 |
1994年 | 34篇 |
1993年 | 25篇 |
1992年 | 26篇 |
1991年 | 29篇 |
1990年 | 14篇 |
1989年 | 12篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 21篇 |
1981年 | 15篇 |
1980年 | 17篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1973年 | 3篇 |
排序方式: 共有4197条查询结果,搜索用时 15 毫秒
1.
2.
In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper. 相似文献
3.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
4.
5.
This paper solves the problem of the duration of the total eclipseof a satellite of a body, provided that (a) the body is sphericalin shape and the mass distribution inside the body is sphericallysymmetrical; (b) the satellite is a very small object; (c) thesatellite's orbit around a body is circular and the satellitecan pass through the centre of its shadow; (d) a source of lightis the source of the conical body's shadow (umbra) and it doesnot change its apparent position in the sky; (e) there are noperturbations on the satellite's orbit. The solution presentedrepresents the general discussion of the problem based on utilizationof some parts of the theory of contraction mappings. 相似文献
6.
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies. 相似文献
7.
8.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
9.
曾六川 《高等学校计算数学学报(英文版)》2003,12(1)
The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors. 相似文献
10.