首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13715篇
  免费   1867篇
  国内免费   530篇
化学   5160篇
晶体学   27篇
力学   1982篇
综合类   62篇
数学   6372篇
物理学   2509篇
  2023年   169篇
  2022年   160篇
  2021年   251篇
  2020年   492篇
  2019年   356篇
  2018年   317篇
  2017年   329篇
  2016年   543篇
  2015年   530篇
  2014年   679篇
  2013年   1132篇
  2012年   757篇
  2011年   789篇
  2010年   582篇
  2009年   855篇
  2008年   816篇
  2007年   849篇
  2006年   754篇
  2005年   606篇
  2004年   542篇
  2003年   530篇
  2002年   463篇
  2001年   437篇
  2000年   404篇
  1999年   351篇
  1998年   351篇
  1997年   273篇
  1996年   277篇
  1995年   199篇
  1994年   150篇
  1993年   150篇
  1992年   116篇
  1991年   104篇
  1990年   94篇
  1989年   64篇
  1988年   65篇
  1987年   55篇
  1986年   61篇
  1985年   42篇
  1984年   54篇
  1983年   21篇
  1982年   38篇
  1981年   38篇
  1980年   28篇
  1979年   30篇
  1978年   46篇
  1977年   44篇
  1976年   40篇
  1975年   15篇
  1974年   15篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
In high accuracy long-time integration of differential equations, round-off errors may dominate truncation errors. This article studies the influence of round-off on the conservation of first integrals such as the total energy in Hamiltonian systems. For implicit Runge–Kutta methods, a standard implementation shows an unexpected propagation. We propose a modification that reduces the effect of round-off and shows a qualitative and quantitative improvement for an accurate integration over long times. AMS subject classification (2000)  65L06, 65G50, 65P10  相似文献   
992.
Three algorithms based on the bifurcation method are applied to solving the D4 symmetric positive solutions to the boundary value problem of Henon equation. Taking r in Henon equation as a bi- furcation parameter, the D4-Σd(D4-Σ1, D4-Σ2) symmetry-breaking bifurcation points on the branch of the D4 symmetric positive solutions are found via the extended systems. Finally, Σd(Σ1, Σ2) sym- metric positive solutions are computed by the branch switching method based on the Liapunov-Schmidt reduction.  相似文献   
993.
For Principal Component Analysis in Reproducing Kernel Hilbert Spaces (KPCA), optimization over sets containing only linear combinations of all n-tuples of kernel functions is investigated, where n is a positive integer smaller than the number of data. Upper bounds on the accuracy in approximating the optimal solution, achievable without restrictions on the number of kernel functions, are derived. The rates of decrease of the upper bounds for increasing number n of kernel functions are given by the summation of two terms, one proportional to n −1/2 and the other to n −1, and depend on the maximum eigenvalue of the Gram matrix of the kernel with respect to the data. Primal and dual formulations of KPCA are considered. The estimates provide insights into the effectiveness of sparse KPCA techniques, aimed at reducing the computational costs of expansions in terms of kernel units.  相似文献   
994.
995.
996.
Broyden's method is formulated for the solution of nonlinear operator equations in Hilbert spaces. The algorithm is proven to be well defined and a linear rate of convergence is shown. Under an additional assumption on the initial approximation for the derivative we prove the superlinear rate of convergence.  相似文献   
997.
The problem of the thermal stability of a horizontal incompressible fluid layer with linear and nonlinear temperature distributions is solved by using the sequential gradient-restoration algorithm developed for optimal control problems. The hydrodynamic boundary conditions for the layer include a rigid or free upper surface and a rigid lower surface. The resulting disturbing equations are solved as a Bolza problem in the calculus of variations. The results of the study are compared with the existing works in the literature.The authors acknowledge valuable discussions with Dr. A. Miele.  相似文献   
998.
This paper presents a method for minimizing the sum of a possibly nonsmooth convex function and a continuously differentiable function. As in the convex case developed by the author, the algorithm is a descent method which generates successive search directions by solving quadratic programming subproblems. An inexact line search ensures global convergence of the method to stationary points.  相似文献   
999.
1000.
We study the six-dimensional pseudo-Riemannian spaces with two time-like coordinates that admit non-homothetic infinitesimal projective transformations. The metrics are manifestly obtained and the projective group properties are determined. We also find a generic definition of projective motion in the 6-dimensional rigid h-space. Presented at the International Colloquium “Integrable Systems and Quantum Symmetries”, Prague, 16–18 June 2005.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号