全文获取类型
收费全文 | 19438篇 |
免费 | 1576篇 |
国内免费 | 664篇 |
专业分类
化学 | 1486篇 |
晶体学 | 28篇 |
力学 | 1951篇 |
综合类 | 231篇 |
数学 | 15088篇 |
物理学 | 2894篇 |
出版年
2024年 | 27篇 |
2023年 | 185篇 |
2022年 | 374篇 |
2021年 | 474篇 |
2020年 | 437篇 |
2019年 | 440篇 |
2018年 | 478篇 |
2017年 | 578篇 |
2016年 | 582篇 |
2015年 | 421篇 |
2014年 | 804篇 |
2013年 | 1571篇 |
2012年 | 1010篇 |
2011年 | 915篇 |
2010年 | 843篇 |
2009年 | 1087篇 |
2008年 | 1107篇 |
2007年 | 1174篇 |
2006年 | 965篇 |
2005年 | 878篇 |
2004年 | 675篇 |
2003年 | 672篇 |
2002年 | 610篇 |
2001年 | 577篇 |
2000年 | 578篇 |
1999年 | 436篇 |
1998年 | 498篇 |
1997年 | 416篇 |
1996年 | 303篇 |
1995年 | 298篇 |
1994年 | 268篇 |
1993年 | 223篇 |
1992年 | 210篇 |
1991年 | 168篇 |
1990年 | 141篇 |
1989年 | 117篇 |
1988年 | 111篇 |
1987年 | 96篇 |
1986年 | 100篇 |
1985年 | 129篇 |
1984年 | 117篇 |
1983年 | 50篇 |
1982年 | 76篇 |
1981年 | 62篇 |
1980年 | 69篇 |
1979年 | 83篇 |
1978年 | 58篇 |
1977年 | 70篇 |
1976年 | 58篇 |
1974年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
71.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
72.
A. J. Zaslavski 《Journal of Optimization Theory and Applications》2004,123(3):695-712
In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations. 相似文献
73.
M. A. Diniz-Ehrhardt M. A. Gomes-Ruggiero J. M. Martínez S. A. Santos 《Journal of Optimization Theory and Applications》2004,123(3):497-517
The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP. 相似文献
74.
For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions. 相似文献
75.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
76.
Patrick Guidotti 《Mathematische Nachrichten》2004,272(1):32-45
We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
77.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
78.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
79.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
80.
We present a new approach to the a posteriori error analysis of stable Galerkin approximations of reaction–convection–diffusion problems. It relies upon a non-standard variational formulation of the exact problem, based on the anisotropic wavelet decomposition of the equation residual into convection-dominated scales and diffusion-dominated scales. The associated norm, which is stronger than the standard energy norm, provides a robust (i.e., uniform in the convection limit) control over the streamline derivative of the solution. We propose an upper estimator and a lower estimator of the error, in this norm, between the exact solution and any finite dimensional approximation of it. We investigate the behaviour of such estimators, both theoretically and through numerical experiments. As an output of our analysis, we find that the lower estimator is quantitatively accurate and robust. 相似文献