首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9029篇
  免费   643篇
  国内免费   731篇
化学   1632篇
晶体学   5篇
力学   402篇
综合类   105篇
数学   4376篇
物理学   1754篇
综合类   2129篇
  2023年   55篇
  2022年   80篇
  2021年   86篇
  2020年   120篇
  2019年   137篇
  2018年   118篇
  2017年   149篇
  2016年   176篇
  2015年   159篇
  2014年   278篇
  2013年   552篇
  2012年   374篇
  2011年   436篇
  2010年   371篇
  2009年   477篇
  2008年   505篇
  2007年   537篇
  2006年   539篇
  2005年   425篇
  2004年   366篇
  2003年   338篇
  2002年   337篇
  2001年   306篇
  2000年   268篇
  1999年   259篇
  1998年   236篇
  1997年   189篇
  1996年   193篇
  1995年   145篇
  1994年   137篇
  1993年   129篇
  1992年   109篇
  1991年   81篇
  1990年   87篇
  1989年   68篇
  1988年   76篇
  1987年   47篇
  1986年   30篇
  1985年   34篇
  1984年   35篇
  1982年   55篇
  1981年   159篇
  1980年   177篇
  1979年   159篇
  1978年   192篇
  1977年   158篇
  1976年   169篇
  1974年   46篇
  1973年   105篇
  1972年   64篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
用泊松变换的方法研究了由二叉分裂算法所产生的随机树上的随机路径的长度,首次得到了关于其数学期望的确切表达式.在此基础上,对该期望的渐近性状进行了分析,证明了当被分裂的集合的大小n趋于无穷时,随机路径长度的期望具有log2n的阶.  相似文献   
92.
陈刚  陈子栋 《中国物理》2004,13(4):445-447
According to calculation of the energy spectrum of ring-shape oscillator potential by using the supersymmetric WKB approximation, it is shown that the energy spectrum of some noncentral separable potentials can be exactly obtained in r and θ dimensions by above method.  相似文献   
93.
A new numerical method called linearized and rational approximation method is presented to solve non‐linear evolution equations. The utility of the method is demonstrated for the case of differentiation of functions involving steep gradients. The solution of Burgers' equation is presented to illustrate the effectiveness of the technique for the solution of non‐linear evolution equations exhibiting nearly discontinuous solutions. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
94.
An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

  相似文献   

95.
We apply a method analogous to the eikonal approximation to the Maxwell wave equations in an inhomogeneous anisotropic medium and geodesic motion in a three dimensional Riemannian manifold, using a method which identifies the symplectic structure of the corresponding mechanics, to the five dimensional generalization of Maxwell theory required by the gauge invariance of Stueckelberg's covariant classical and quantum dynamics. In this way, we demonstrate, in the eikonal approximation, the existence of geodesic motion for the flow of mass in a four dimensional pseudo-Riemannian manifold. These results provide a foundation for the geometrical optics of the five dimensional radiation theory and establish a model in which there is mass flow along geodesics. We then discuss the interesting case of relativistic quantum theory in an anisotropic medium as well. In this case the eikonal approximation to the relativistic quantum mechanical current coincides with the geodesic flow governed by the pseudo-Riemannian metric obtained from the eikonal approximation to solutions of the Stueckelberg–Schrödinger equation. The locally symplectic structure which emerges is that of a generally covariant form of Stueckelberg's mechanics on this manifold.  相似文献   
96.
Using the linearization of Einstein's equations for weak gravitational fields, a specific model of gravito-magnetofluid is elaborated. The study of wave formation and propagation in such a medium is necessarily connected to the existence of the cosmological constant.  相似文献   
97.
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.  相似文献   
98.
99.
研究了Stancu-Kantorovich算子在Orlicz空间的逼近估计  相似文献   
100.
The article provides a refinement for the volume-corrected Laplace-Metropolis estimator of the marginal likelihood of DiCiccioet al. The correction volume of probability α in DiCiccioet al. is fixed and suggested to take the value α=0.05. In this article α is selected based on an asymptotic analysis to minimize the mean square relative error (MSRE). This optimal choice of α is shown to be invariant under linear transformations. The invariance property leads to easy implementation for multivariate problems. An implementation procedure is provided for practical use. A simulation study and a real data example are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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