全文获取类型
收费全文 | 9238篇 |
免费 | 372篇 |
国内免费 | 692篇 |
专业分类
化学 | 758篇 |
晶体学 | 7篇 |
力学 | 378篇 |
综合类 | 54篇 |
数学 | 7946篇 |
物理学 | 1159篇 |
出版年
2023年 | 97篇 |
2022年 | 80篇 |
2021年 | 99篇 |
2020年 | 160篇 |
2019年 | 179篇 |
2018年 | 223篇 |
2017年 | 215篇 |
2016年 | 239篇 |
2015年 | 163篇 |
2014年 | 357篇 |
2013年 | 625篇 |
2012年 | 407篇 |
2011年 | 397篇 |
2010年 | 379篇 |
2009年 | 590篇 |
2008年 | 700篇 |
2007年 | 596篇 |
2006年 | 533篇 |
2005年 | 470篇 |
2004年 | 332篇 |
2003年 | 395篇 |
2002年 | 366篇 |
2001年 | 276篇 |
2000年 | 277篇 |
1999年 | 292篇 |
1998年 | 232篇 |
1997年 | 260篇 |
1996年 | 147篇 |
1995年 | 140篇 |
1994年 | 115篇 |
1993年 | 80篇 |
1992年 | 71篇 |
1991年 | 68篇 |
1990年 | 72篇 |
1989年 | 53篇 |
1988年 | 56篇 |
1987年 | 41篇 |
1986年 | 40篇 |
1985年 | 59篇 |
1984年 | 62篇 |
1983年 | 25篇 |
1982年 | 45篇 |
1981年 | 38篇 |
1980年 | 47篇 |
1979年 | 29篇 |
1978年 | 36篇 |
1977年 | 41篇 |
1976年 | 26篇 |
1974年 | 16篇 |
1973年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
221.
We generalize the well-known Baker's superstability result for exponential mappings with values in the field of complex numbers to the case of an arbitrary commutative complex semisimple Banach algebra. It was shown by Ger that the superstability phenomenon disappears if we formulate the stability question for exponential complex-valued functions in a more natural way. We improve his result by showing that the maximal possible distance of an -approximately exponential function to the set of all exponential functions tends to zero as tends to zero. In order to get this result we have to prove a stability theorem for real-valued functions additive modulo the set of all integers .
222.
Jun-ichi Tanaka 《Transactions of the American Mathematical Society》1996,348(10):4113-4129
Using the Stone-\v{C}ech compactification of integers, we introduce a free extension of an almost periodic flow. Together with some properties of outer functions, we see that, in a certain class of ergodic Hardy spaces , , the corresponding subspaces are all singly generated. This shows the existence of maximal weak- Dirichlet algebras, different from of the disc, for which the single generator problem is settled.
223.
R. A. Poliquin R. T. Rockafellar 《Transactions of the American Mathematical Society》1996,348(5):1805-1838
The class of prox-regular functions covers all l.s.c., proper, convex functions, lower- functions and strongly amenable functions, hence a large core of functions of interest in variational analysis and optimization. The subgradient mappings associated with prox-regular functions have unusually rich properties, which are brought to light here through the study of the associated Moreau envelope functions and proximal mappings. Connections are made between second-order epi-derivatives of the functions and proto-derivatives of their subdifferentials. Conditions are identified under which the Moreau envelope functions are convex or strongly convex, even if the given functions are not.
224.
Pravin M. Vaidya 《Mathematical Programming》1996,73(3):291-341
Let
be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ
n
the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid
of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global
convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts
to the convex optimization problem. 相似文献
225.
D. Y. Ye 《Journal of Optimization Theory and Applications》1993,76(2):287-304
LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR
m
, and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper. 相似文献
226.
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. 相似文献
227.
G. Schütz 《Journal of statistical physics》1993,71(3-4):471-505
We present a model for a one-dimensional anisotropic exclusion process describing particles moving deterministically on a ring of lengthL with a single defect, across which they move with probability 0 p 1. This model is equivalent to a two-dimensional, six-vertex model in an extreme anisotropic limit with a defect line interpolating between open and periodic boundary conditions. We solve this model with a Bethe ansatz generalized to this kind of boundary condition. We discuss in detail the steady state and derive exact expressions for the currentj, the density profilen(x), and the two-point density correlation function. In the thermodynamic limitL the phase diagram shows three phases, a low-density phase, a coexistence phase, and a high-density phase related to the low-density phase by a particle-hole symmetry. In the low-density phase the density profile decays exponentially with the distance from the boundary to its bulk value on a length scale . On the phase transition line diverges and the currentj approaches its critical valuej
c = p as a power law,j
c – j –1/2. In the coexistence phase the width of the interface between the high-density region and the low-density region is proportional toL
1/2 if the density
f 1/2 and=0 independent ofL if = 1/2. The (connected) two-point correlation function turns out to be of a scaling form with a space-dependent amplitude n(x1, x2) =A(x2)A
Ke–r/ withr = x
2 –x
1 and a critical exponent = 0. 相似文献
228.
Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h
j
(x)g(x),j=1, ,m, xX}, wheref(·),h
j
(·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday. 相似文献
229.
In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171. 相似文献
230.
We propose an algorithm for the computation ofL
1 (LAD) smoothing splines in the spacesW
M
(D), with
. We assume one is given data of the formy
i
=(f(t
i
) +
i
, i=1,...,N with {itti}
i=1
N D
, the
i
are errors withE(
i
)=0, andf is assumed to be inW
M
. The LAD smoothing spline, for fixed smoothing parameter0, is defined as the solution,s
, of the optimization problem
(1/N)
i=1
N
¦y
i
–g(t
i
¦+J
M
(g), whereJ
M
(g) is the seminorm consisting of the sum of the squaredL
2 norms of theMth partial derivatives ofg. Such an LAD smoothing spline,s
, would be expected to give robust smoothed estimates off in situations where the
i
are from a distribution with heavy tails. The solution to such a problem is a thin plate spline of known form. An algorithm for computings
is given which is based on considering a sequence of quadratic programming problems whose structure is guided by the optimality conditions for the above convex minimization problem, and which are solved readily, if a good initial point is available. The data driven selection of the smoothing parameter is achieved by minimizing aCV() score of the form
.The combined LAD-CV smoothing spline algorithm is a continuation scheme in 0 taken on the above SQPs parametrized in, with the optimal smoothing parameter taken to be that value of at which theCV() score first begins to increase. The feasibility of constructing the LAD-CV smoothing spline is illustrated by an application to a problem in environment data interpretation. 相似文献