首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   45140篇
  免费   3502篇
  国内免费   2236篇
化学   23722篇
晶体学   268篇
力学   4310篇
综合类   757篇
数学   10331篇
物理学   11490篇
  2024年   66篇
  2023年   448篇
  2022年   890篇
  2021年   1382篇
  2020年   1212篇
  2019年   1101篇
  2018年   979篇
  2017年   1346篇
  2016年   1790篇
  2015年   1326篇
  2014年   1988篇
  2013年   3298篇
  2012年   2659篇
  2011年   2401篇
  2010年   2098篇
  2009年   2640篇
  2008年   2582篇
  2007年   2878篇
  2006年   2398篇
  2005年   2120篇
  2004年   2027篇
  2003年   1719篇
  2002年   1373篇
  2001年   1121篇
  2000年   1103篇
  1999年   972篇
  1998年   901篇
  1997年   806篇
  1996年   743篇
  1995年   673篇
  1994年   612篇
  1993年   510篇
  1992年   449篇
  1991年   388篇
  1990年   355篇
  1989年   229篇
  1988年   231篇
  1987年   148篇
  1986年   137篇
  1985年   158篇
  1984年   130篇
  1983年   68篇
  1982年   108篇
  1981年   62篇
  1980年   44篇
  1979年   78篇
  1978年   33篇
  1977年   19篇
  1976年   22篇
  1972年   8篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
61.
Algebraic methods in quantum mechanics: from molecules to polymers   总被引:2,自引:0,他引:2  
We present a brief review of algebraic techniques developed and applied in molecular spectroscopy in the last five years. We also outline perspectives for new applications of the Lie algebraic method in the first decade of the new century. Received 21 November 2001  相似文献   
62.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.  相似文献   
63.
主要介绍了利用兰州重离子加速器提供的270 MeV的40Ar离子束轰击238U靶,通过熔合蒸发反应进行试合成Z=110附近的新同位素的实验情况。分析了目前关于超重核研究的现状并描述了这次实验的目的、 可行性分析、 实验装置以及实验过程等。本次实验仍然用氦喷嘴技术对产物进行传输, 并用一套具有数对探测器组的转轮收集探测系统对产物进行收集和测量。 The state of the experiment to produce the new isotopes around Z=110 are presented in this paper. The emphasis is laid upon introducing the experiment purpose, the set up and the feasibility for producing this objective nuclide. In the experiment the new isotopes were produced by the complete fusion evaporation reaction of 238U with 270 MeV 40Ar at the Sector Focus Cyclotron (SFC) of Heavy Ion Research Facility in Lanzhou(HIRFL). The reaction products were also transported and collected by using the helium jet technique and rotating wheel apparatus.  相似文献   
64.
中国股市长记忆的修正R/S分析   总被引:6,自引:1,他引:5  
本文在比较各种长记忆检验方法优缺点的基础上,采用修正的R/S分析检验我国沪深两股市日收益和日绝对收益序列的长记忆性。结果表明在0.05的显著水平下,两股市的日收益序列均无长记忆,但深圳成指日收益序列的记忆长度比上证综指日收益序列的记忆长度长;以日绝对收益序列为代表的波动序列具有较强的长记忆性。  相似文献   
65.
环保意识调查问卷的Logistic模型   总被引:1,自引:0,他引:1  
本文应用多元统计分析中的方差分析 ,logistic模型等方法对环保意识调查问卷反馈的信息进行统计分析 ,建立被调查企业对环境保护意识的logistic模型 ,进而可对企业家的环境保护意识的好坏进行判断。  相似文献   
66.
Toward Fuzzy Optimization without Mathematical Ambiguity   总被引:15,自引:0,他引:15  
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed.  相似文献   
67.
差分吸收光谱法测量大气污染的测量误差分析   总被引:20,自引:12,他引:8  
差分吸收光谱技术被广泛地应用于测量大气中微量元素的浓度,尽管该技术利用最小二乘法来反演待测气体的浓度,能够得到很高的测量精度。但是,由于仪器本身的噪声以及测量波段其它气体的干扰等,使得仪器的测量有一定的误差,而且上述因素还决定着仪器的测量下限。对差分吸收光谱方法的测量误差以及引起误差的原因作了详细的分析。  相似文献   
68.
The high-temperature cubic phase of non-stoichiometric strontium ferrite SrFeOx (2.5≤x≤3.0) has been studied by in situ neutron powder diffraction in air over the temperature range 300-1273 K. The composition of SrFeOx changes within the range 2.56≤x≤2.81 from 1273 to 673 K, respectively.Rietveld refinements of the diffraction patterns show that the high-temperature cubic phase of SrFeOx is consistent with a face-centred Fm3c structure. This structure leads to agreement with previous density measurements. This cell allows the high-temperature structure of SrFeOx to be described in terms of a solid solution of the composition end members. Cubic SrFeOx at high temperature is found to closely obey Vegard's law. The density of cubic SrFeOx is also found to exhibit a linear relationship with composition.  相似文献   
69.
研究了制备的掺钕螯合物Nd(DBM)3Phen材料的吸收光谱、激发光谱、荧光光谱,应用Judd-Ofelt理论计算了该材料的强度参量.分析了钕离子激发态4F3/2的辐射寿命(631 μs)和4F3/2→4IJ′跃迁的受激发射截面和荧光分支比.  相似文献   
70.
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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