首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   17282篇
  免费   1538篇
  国内免费   1339篇
化学   4925篇
晶体学   119篇
力学   1586篇
综合类   272篇
数学   9137篇
物理学   4120篇
  2024年   19篇
  2023年   139篇
  2022年   256篇
  2021年   338篇
  2020年   472篇
  2019年   420篇
  2018年   453篇
  2017年   470篇
  2016年   550篇
  2015年   442篇
  2014年   754篇
  2013年   1220篇
  2012年   716篇
  2011年   852篇
  2010年   785篇
  2009年   956篇
  2008年   1086篇
  2007年   1164篇
  2006年   955篇
  2005年   852篇
  2004年   739篇
  2003年   738篇
  2002年   759篇
  2001年   627篇
  2000年   519篇
  1999年   489篇
  1998年   476篇
  1997年   370篇
  1996年   383篇
  1995年   300篇
  1994年   256篇
  1993年   219篇
  1992年   177篇
  1991年   157篇
  1990年   111篇
  1989年   95篇
  1988年   102篇
  1987年   81篇
  1986年   71篇
  1985年   96篇
  1984年   70篇
  1983年   44篇
  1982年   77篇
  1981年   68篇
  1980年   37篇
  1979年   55篇
  1978年   38篇
  1977年   33篇
  1976年   30篇
  1973年   17篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
为提高煤与瓦斯突出矿井瓦斯抽放效果,建立了3个一级指标、14个二级指标的突出矿井瓦斯抽放限制影响因素评价指标体系,利用AHP和熵权法分别确定指标因子主、客观权重.通过实地调研分析和反馈验证了AHP-熵权法的可行性和正确性,利用加权平均法确定评价模型的综合权重.研究表明:封孔方式、钻孔半径、抽放时间、煤体裂隙发育程度和抽放负压是目前影响煤矿瓦斯抽放效果的主控因素.  相似文献   
2.
3.
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.  相似文献   
4.
5.
6.
In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.  相似文献   
7.
8.
We show the short-time existence and nonlinear stability of vortex sheets for the nonisentropic compressible Euler equations in two spatial dimensions, based on the weakly linear stability result of Morando and Trebeschi (2008) [20]. The missing normal derivatives are compensated through the equations of the linearized vorticity and entropy when deriving higher-order energy estimates. The proof of the resolution for this nonlinear problem follows from certain a priori tame estimates on the effective linear problem in the usual Sobolev spaces and a suitable Nash–Moser iteration scheme.  相似文献   
9.
Exposure of cimetidine (CIM) to dry heat (160–180 °C) afforded, upon cooling, a glassy solid containing new and hitherto unknown products. The kinetics of this process was studied by a second order chemometrics-assisted multi-spectroscopic approach. Proton and carbon-13 nuclear magnetic resonance (NMR), as well as ultraviolet and infrared spectroscopic data were jointly used, whereas multivariate curve resolution with alternating least squares (MCR-ALS) was employed as the chemometrics method to extract process information. It was established that drug degradation follows a first order kinetics.  相似文献   
10.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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