首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   44042篇
  免费   5143篇
  国内免费   2811篇
化学   5607篇
晶体学   66篇
力学   4655篇
综合类   529篇
数学   28904篇
物理学   12235篇
  2024年   89篇
  2023年   420篇
  2022年   573篇
  2021年   724篇
  2020年   1246篇
  2019年   1237篇
  2018年   1169篇
  2017年   1190篇
  2016年   1284篇
  2015年   1091篇
  2014年   1940篇
  2013年   3754篇
  2012年   2047篇
  2011年   2445篇
  2010年   2301篇
  2009年   2617篇
  2008年   2798篇
  2007年   2798篇
  2006年   2429篇
  2005年   2374篇
  2004年   1952篇
  2003年   1944篇
  2002年   1844篇
  2001年   1451篇
  2000年   1353篇
  1999年   1251篇
  1998年   1194篇
  1997年   971篇
  1996年   783篇
  1995年   666篇
  1994年   545篇
  1993年   399篇
  1992年   392篇
  1991年   343篇
  1990年   283篇
  1989年   195篇
  1988年   190篇
  1987年   178篇
  1986年   182篇
  1985年   208篇
  1984年   188篇
  1983年   93篇
  1982年   164篇
  1981年   153篇
  1980年   111篇
  1979年   115篇
  1978年   76篇
  1977年   66篇
  1976年   62篇
  1973年   27篇
排序方式: 共有10000条查询结果,搜索用时 390 毫秒
1.
This paper is concerned with the Cauchy problem on the Boltzmann equation without angular cutoff assumption for hard potential in the whole space. When the initial data is a small perturbation of a global Maxwellian, the global existence of solution to this problem is proved in unweighted Sobolev spaces HN(Rx,v6) with N2. But if we want to obtain the optimal temporal decay estimates, we need to add the velocity weight function, in this case the global existence and the optimal temporal decay estimate of the Boltzmann equation are all established. Meanwhile, we further gain a more accurate energy estimate, which can guarantee the validity of the assumption in Chen et al. (0000).  相似文献   
2.
Weijin Li 《中国物理 B》2022,31(8):80503-080503
Aiming at training the feed-forward threshold neural network consisting of nondifferentiable activation functions, the approach of noise injection forms a stochastic resonance based threshold network that can be optimized by various gradient-based optimizers. The introduction of injected noise extends the noise level into the parameter space of the designed threshold network, but leads to a highly non-convex optimization landscape of the loss function. Thus, the hyperparameter on-line learning procedure with respective to network weights and noise levels becomes of challenge. It is shown that the Adam optimizer, as an adaptive variant of stochastic gradient descent, manifests its superior learning ability in training the stochastic resonance based threshold network effectively. Experimental results demonstrate the significant improvement of performance of the designed threshold network trained by the Adam optimizer for function approximation and image classification.  相似文献   
3.
4.
We study the existence of a time‐periodic solution with pointwise decay properties to the Navier–Stokes equation in the whole space. We show that if the time‐periodic external force is sufficiently small in an appropriate sense, then there exists a time‐periodic solution { u , p } of the Navier–Stokes equation such that | ? j u ( t , x ) | = O ( | x | 1 ? n ? j ) and | ? j p ( t , x ) | = O ( | x | ? n ? j ) ( j = 0 , 1 , ) uniformly in t R as | x | . Our solution decays faster than the time‐periodic Stokes fundamental solution and the faster decay of its spatial derivatives of higher order is also described.  相似文献   
5.
We show that the differential structure of the orbit space of a proper action of a Lie group on a smooth manifold is weakly reflexive. This implies that the orbit space is a differentiable space in the sense of Smith, which ensures that the orbit space has an exterior algebra of differential forms, that satisfies Smith’s version of de Rham’s theorem. Because the orbit space is a locally closed subcartesian space, it has vector fields and their flows.  相似文献   
6.
7.
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.  相似文献   
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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