全文获取类型
收费全文 | 10656篇 |
免费 | 1063篇 |
国内免费 | 713篇 |
专业分类
化学 | 1620篇 |
晶体学 | 23篇 |
力学 | 738篇 |
综合类 | 192篇 |
数学 | 7771篇 |
物理学 | 2088篇 |
出版年
2024年 | 17篇 |
2023年 | 67篇 |
2022年 | 147篇 |
2021年 | 197篇 |
2020年 | 189篇 |
2019年 | 215篇 |
2018年 | 220篇 |
2017年 | 286篇 |
2016年 | 341篇 |
2015年 | 241篇 |
2014年 | 462篇 |
2013年 | 775篇 |
2012年 | 552篇 |
2011年 | 526篇 |
2010年 | 496篇 |
2009年 | 602篇 |
2008年 | 683篇 |
2007年 | 697篇 |
2006年 | 605篇 |
2005年 | 576篇 |
2004年 | 500篇 |
2003年 | 417篇 |
2002年 | 448篇 |
2001年 | 423篇 |
2000年 | 375篇 |
1999年 | 369篇 |
1998年 | 285篇 |
1997年 | 252篇 |
1996年 | 221篇 |
1995年 | 184篇 |
1994年 | 143篇 |
1993年 | 121篇 |
1992年 | 112篇 |
1991年 | 92篇 |
1990年 | 68篇 |
1989年 | 59篇 |
1988年 | 52篇 |
1987年 | 51篇 |
1986年 | 47篇 |
1985年 | 55篇 |
1984年 | 59篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 22篇 |
1980年 | 21篇 |
1979年 | 27篇 |
1978年 | 12篇 |
1977年 | 22篇 |
1976年 | 14篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
41.
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. 相似文献
42.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
43.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
44.
Siaw-Lynn Ng 《Order》2004,21(1):1-5
We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain.
This revised version was published online in September 2006 with corrections to the Cover Date. 相似文献
45.
We present a characterization of confluence for term rewriting systems, which is then refined for special classes of rewriting systems. The refined characterization is used to obtain a polynomial time algorithm for deciding the confluence of ground term rewrite systems. The same approach also shows the decidability of confluence for shallow and linear term rewriting systems. The decision procedure has a polynomial time complexity under the assumption that the maximum arity of a function symbol in the signature is a constant. 相似文献
46.
Toshihiro Kobayashi 《Mathematical Methods in the Applied Sciences》2004,27(1):79-89
This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
47.
Larbi Berrahmoune 《Mathematical Methods in the Applied Sciences》2004,27(12):1385-1398
We consider an initial and boundary value problem for a homogenous string subject to an internal pointwise control. The solution resulting from a non‐linear feedback is studied. We give various explicit decay estimates depending on the control position and the feedback non‐linearity. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
48.
In this article we prove the existence of the solution to the mixed problem for Euler–Bernoulli beam equation with memory term. The existence is proved by means of the Faedo–Galerkin method and the exponential decay is obtained by making use of the multiplier technique combined with integral inequalities due to Komornik. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
49.
A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
50.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献