全文获取类型
收费全文 | 47846篇 |
免费 | 5520篇 |
国内免费 | 4361篇 |
专业分类
化学 | 11161篇 |
晶体学 | 964篇 |
力学 | 9801篇 |
综合类 | 639篇 |
数学 | 21967篇 |
物理学 | 13195篇 |
出版年
2024年 | 91篇 |
2023年 | 458篇 |
2022年 | 813篇 |
2021年 | 993篇 |
2020年 | 1242篇 |
2019年 | 1123篇 |
2018年 | 1123篇 |
2017年 | 1548篇 |
2016年 | 1768篇 |
2015年 | 1366篇 |
2014年 | 2364篇 |
2013年 | 3305篇 |
2012年 | 2880篇 |
2011年 | 3126篇 |
2010年 | 2737篇 |
2009年 | 3117篇 |
2008年 | 3053篇 |
2007年 | 3089篇 |
2006年 | 2688篇 |
2005年 | 2513篇 |
2004年 | 2115篇 |
2003年 | 1926篇 |
2002年 | 1767篇 |
2001年 | 1478篇 |
2000年 | 1425篇 |
1999年 | 1265篇 |
1998年 | 1160篇 |
1997年 | 999篇 |
1996年 | 853篇 |
1995年 | 751篇 |
1994年 | 670篇 |
1993年 | 554篇 |
1992年 | 567篇 |
1991年 | 456篇 |
1990年 | 368篇 |
1989年 | 276篇 |
1988年 | 255篇 |
1987年 | 180篇 |
1986年 | 162篇 |
1985年 | 222篇 |
1984年 | 186篇 |
1983年 | 78篇 |
1982年 | 117篇 |
1981年 | 91篇 |
1980年 | 61篇 |
1979年 | 71篇 |
1978年 | 74篇 |
1977年 | 83篇 |
1976年 | 38篇 |
1974年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 468 毫秒
41.
42.
A. G. Bratsos 《Numerical Algorithms》2006,43(4):295-308
A three-time level finite-difference scheme based on a fourth order in time and second order in space approximation has been
proposed for the numerical solution of the nonlinear two-dimensional sine-Gordon equation. The method, which is analysed for
local truncation error and stability, leads to the solution of a nonlinear system. To avoid solving it, a predictor–corrector
scheme using as predictor a second-order explicit scheme is proposed. The procedure of the corrector has been modified by
considering as known the already evaluated corrected values instead of the predictor ones. This modified scheme has been tested
on the line and circular ring soliton and the numerical experiments have proved that there is an improvement in the accuracy
over the standard predictor–corrector implementation.
This research was co-funded by E.U. (75%) and by the Greek Government (25%). 相似文献
43.
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. 相似文献
44.
两种拔尿管方法对膀胱功能损伤的临床观察 总被引:2,自引:0,他引:2
为观察两种不同的拔尿管方法对膀胱功能损伤的差异,将80例患者随机分成两组,分别采用改良法(40例)和常规法(40例)拔除留置尿管,分析比较了两组患者排尿顺利率、逼尿肌功能恢复率及尿道刺激症、尿失禁、尿潴留。结果表明,两组患者拔管后上述指标与情况有显著性差异,P<0.05。提示改良组膀胱功能损伤明显低于对照组。改良的拔管方法是一种值得护理推广应用的好方法。 相似文献
45.
Rakhim Aitbayev 《Numerical Methods for Partial Differential Equations》2006,22(4):847-866
Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006 相似文献
46.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
47.
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. 相似文献
48.
49.
In this work we study nonnegativity and positivity of a discrete quadratic functional with separately varying endpoints. We introduce a notion of an interval coupled with 0, and hence, extend the notion of conjugate interval to 0 from the case of fixed to variable endpoint(s). We show that the nonnegativity of the discrete quadratic functional is equivalent to each of the following conditions: The nonexistence of intervals coupled with 0, the existence of a solution to Riccati matrix equation and its boundary conditions. Natural strengthening of each of these conditions yields a characterization of the positivity of the discrete quadratic functional. Since the quadratic functional under consideration could be a second variation of a discrete calculus of variations problem with varying endpoints, we apply our results to obtain necessary and sufficient optimality conditions for such problems. This paper generalizes our recent work in [R. Hilscher, V. Zeidan, Comput. Math. Appl., to appear], where the right endpoint is fixed. 相似文献
50.
Constraint Programming and Operations Research: Comments from an Operations Researcher 总被引:4,自引:0,他引:4
Michel Gendreau 《Journal of Heuristics》2002,8(1):19-24
This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research. 相似文献