全文获取类型
收费全文 | 11653篇 |
免费 | 1303篇 |
国内免费 | 416篇 |
专业分类
化学 | 5161篇 |
晶体学 | 28篇 |
力学 | 1188篇 |
综合类 | 31篇 |
数学 | 4988篇 |
物理学 | 1976篇 |
出版年
2023年 | 155篇 |
2022年 | 156篇 |
2021年 | 216篇 |
2020年 | 406篇 |
2019年 | 297篇 |
2018年 | 271篇 |
2017年 | 242篇 |
2016年 | 466篇 |
2015年 | 465篇 |
2014年 | 600篇 |
2013年 | 963篇 |
2012年 | 648篇 |
2011年 | 687篇 |
2010年 | 472篇 |
2009年 | 749篇 |
2008年 | 687篇 |
2007年 | 728篇 |
2006年 | 622篇 |
2005年 | 471篇 |
2004年 | 446篇 |
2003年 | 422篇 |
2002年 | 353篇 |
2001年 | 348篇 |
2000年 | 323篇 |
1999年 | 268篇 |
1998年 | 280篇 |
1997年 | 217篇 |
1996年 | 223篇 |
1995年 | 156篇 |
1994年 | 117篇 |
1993年 | 115篇 |
1992年 | 78篇 |
1991年 | 75篇 |
1990年 | 60篇 |
1989年 | 52篇 |
1988年 | 52篇 |
1987年 | 40篇 |
1986年 | 52篇 |
1985年 | 33篇 |
1984年 | 47篇 |
1983年 | 16篇 |
1982年 | 27篇 |
1981年 | 29篇 |
1980年 | 20篇 |
1979年 | 25篇 |
1978年 | 41篇 |
1977年 | 41篇 |
1976年 | 40篇 |
1975年 | 15篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
The theoretical investigation of the image states in front of an ultrathin iron film grown on copper has been performed by means of the embedding method and a recently developed procedure for the inclusion of the image potential tail in a first principle calculation. From the electronic response to an applied electric field, the image plane position has been evaluated. This also allows one to obtain useful information about the spin dependent screening properties of the system. Exchange splitting, effective mass, and lifetime of such surface states result in good agreement with recently performed two-photon photoemission experiments [see A.B. Schmidt, M. Pickel, M. Wiemhöfer, M. Donath, M. Weinelt, Phys. Rev. Lett. 95 (2005) 107402]. 相似文献
72.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
73.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
74.
Gerhard Starke 《Numerische Mathematik》1997,78(1):103-117
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES
or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of
values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from
the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular,
the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations
of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners
which constitute popular preconditioning strategies for such problems.
Received May 3, 1996 相似文献
75.
We extend an earlier method for solving kinetic boundary layer problems to the case of particles moving in aspatially inhomogeneous background. The method is developed for a gas mixture containing a supersaturated vapor and a light carrier gas from which a small droplet condenses. The release of heat of condensation causes a temperature difference between droplet and gas in the quasistationary state; the kinetic equation describing the vapor is the stationary Klein-Kramers equation for Brownian particles diffusing in a temperature gradient. By means of an expansion in Burnett functions, this equation is transformed into a set of coupled algebrodifferential equations. By numerical integration we construct fundamental solutions of this equation that are subsequently combined linearly to fulfill appropriate mesoscopic boundary conditions for particles leaving the droplet surface. In view of the intrinsic numerical instability of the system of equations, a novel procedure is developed to remove the admixture of fast growing solutions to the solutions of interest. The procedure is tested for a few model problems and then applied to a slightly simplified condensation problem with parameters corresponding to the condensation of mercury in a background of neon. The effects of thermal gradients and thermodiffusion on the growth rate of the droplet are small (of the order of 1%), but well outside of the margin of error of the method. 相似文献
76.
77.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
78.
Philip T. Keenan 《Numerical Algorithms》1994,7(2):269-293
We describe a new family of discrete spaces suitable for use with mixed methods on certain quadrilateral and hexahedral meshes. The new spaces are natural in the sense of differential geometry, so all the usual mixed method theory, including the hybrid formulation, carries over to these new elements with proofs unchanged. Because transforming general quadrilaterals into squares introduces nonlinearity and because mixed methods involve the divergence operator, the new spaces are more complicated than either the corresponding Raviart-Thomas spaces for rectangles or corresponding finite element spaces for quadrilaterals. The new spaces are also limited to meshes obtained from a rectangular mesh through the application of a single global bilinear transformation. Despite this limitation, the new elements may be useful in certain topologically regular problems, where initially rectangular grids are deformed to match features of the physical region. They also illustrate the difficulties introduced into the theory of mixed methods by nonlinear transformations. 相似文献
79.
Gisella Facchinetti 《Fuzzy Optimization and Decision Making》2002,1(3):313-327
In this paper we present two definitions of possibilistic weighted average of fuzzy numbers, and by them we introduce two different rankings on the set of real fuzzy numbers. The two methods are dependent on several parameters. In the first case, the parameter is constant and the results generalize what Carlsson and Fuller have obtained in (2001). In the second case, the parameter is a function, not fixed a priori by the decision maker, but it depends on the position of the interval on the real axe. In all the two cases we call the parameter degree of risk, which takes into account of a risk-tendency or aversion of the decision maker. 相似文献
80.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献