全文获取类型
收费全文 | 33858篇 |
免费 | 3587篇 |
国内免费 | 3590篇 |
专业分类
化学 | 11022篇 |
晶体学 | 136篇 |
力学 | 3136篇 |
综合类 | 321篇 |
数学 | 14184篇 |
物理学 | 12236篇 |
出版年
2024年 | 103篇 |
2023年 | 363篇 |
2022年 | 887篇 |
2021年 | 940篇 |
2020年 | 974篇 |
2019年 | 937篇 |
2018年 | 946篇 |
2017年 | 1113篇 |
2016年 | 1243篇 |
2015年 | 1065篇 |
2014年 | 1670篇 |
2013年 | 2561篇 |
2012年 | 1891篇 |
2011年 | 2011篇 |
2010年 | 1649篇 |
2009年 | 2117篇 |
2008年 | 2157篇 |
2007年 | 2263篇 |
2006年 | 1858篇 |
2005年 | 1598篇 |
2004年 | 1286篇 |
2003年 | 1283篇 |
2002年 | 1193篇 |
2001年 | 980篇 |
2000年 | 992篇 |
1999年 | 812篇 |
1998年 | 768篇 |
1997年 | 616篇 |
1996年 | 424篇 |
1995年 | 444篇 |
1994年 | 366篇 |
1993年 | 345篇 |
1992年 | 323篇 |
1991年 | 263篇 |
1990年 | 271篇 |
1989年 | 248篇 |
1988年 | 212篇 |
1987年 | 206篇 |
1986年 | 173篇 |
1985年 | 192篇 |
1984年 | 187篇 |
1983年 | 91篇 |
1982年 | 134篇 |
1981年 | 124篇 |
1980年 | 111篇 |
1979年 | 127篇 |
1978年 | 96篇 |
1977年 | 100篇 |
1976年 | 87篇 |
1973年 | 62篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
43.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
44.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
45.
DING Bin-Gang ZHANG Da-Li LU Ding-Hui 《理论物理通讯》2006,46(1):113-118
We calculate the binding energies of Ni, Cu, Xe, Cs, Pt, Au, Np, Pu isotope chains using two interaction parameter sets NL-3 and NL-Z, and compared the relative errors of the even-even nuclei with those of odd-even nuclei and odd-odd nuclei. We find that the errors of binding energy of odd-even and odd-odd nuclei are not bigger than the one of even-even nuclei. The result shows that comparing with even-even nuclei, there is no systematic error and approximation in the calculations of the binding energy of odd-even and odd-odd nuclei with relativistic mean-field theory. In addition, the result is explained theoretically. 相似文献
46.
A. V. Bobylev 《Journal of statistical physics》2006,124(2-4):371-399
It is well-known that the classical Chapman-Enskog procedure does not work at the level of Burnett equations (the next step after the Navier-Stokes equations). Roughly speaking, the reason is that the solutions of higher equations of hydrodynamics (Burnett's, etc.) become unstable with respect to short-wave perturbations. This problem was recently attacked by several authors who proposed different ways to deal with it. We present in this paper one of possible alternatives. First we deduce a criterion for hyperbolicity of Burnett equations for the general molecular model and show that this criterion is not fulfilled in most typical cases. Then we discuss in more detail the problem of truncation of the Chapman-Enskog expansion and show that the way of truncation is not unique. The general idea of changes of coordinates (based on analogy with the theory of dynamical systems) leads finally to nonlinear Hyperbolic Burnett Equations (HBEs) without using any information beyond the classical Burnett equations. It is proved that HBEs satisfy the linearized H-theorem. The linear version of the problem is studied in more detail, the complete Chapman-Enskog expansion is given for the linear case. A simplified proof of the Slemrod identity for Burnett coefficients is also given. 相似文献
47.
Cai Xiaochun 《Annals of Differential Equations》2006,22(1):1-6
In this paper, we apply a critical point theorem and obtain the condition for the existence of three solutions to two-point boundary value problem of a second order nonlinear difference equation. 相似文献
48.
We propose a framework, based on classical mixture theory, to describe the isothermal flow of an incompressible fluid through a deformable inelastic porous solid. The modeling of the behavior of the inelastic solid takes into account changes in the elastic response due to evolution in the microstructure of the material. We apply the model to a compression layer problem. The mathematical problem generated by the model is a free boundary problem. 相似文献
49.
50.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献