首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2095篇
  免费   195篇
  国内免费   87篇
化学   486篇
晶体学   5篇
力学   60篇
综合类   37篇
数学   1178篇
物理学   611篇
  2024年   2篇
  2023年   22篇
  2022年   85篇
  2021年   92篇
  2020年   56篇
  2019年   72篇
  2018年   57篇
  2017年   92篇
  2016年   110篇
  2015年   60篇
  2014年   148篇
  2013年   190篇
  2012年   124篇
  2011年   117篇
  2010年   97篇
  2009年   140篇
  2008年   144篇
  2007年   101篇
  2006年   99篇
  2005年   87篇
  2004年   58篇
  2003年   57篇
  2002年   61篇
  2001年   41篇
  2000年   38篇
  1999年   37篇
  1998年   36篇
  1997年   18篇
  1996年   18篇
  1995年   14篇
  1994年   10篇
  1993年   12篇
  1992年   10篇
  1991年   14篇
  1990年   4篇
  1989年   4篇
  1988年   7篇
  1987年   7篇
  1986年   7篇
  1985年   11篇
  1984年   4篇
  1982年   5篇
  1981年   2篇
  1979年   1篇
  1978年   2篇
  1977年   1篇
  1976年   1篇
  1975年   1篇
  1957年   1篇
排序方式: 共有2377条查询结果,搜索用时 15 毫秒
81.
刘辉军  吕进  林敏  余良子 《分析测试学报》2007,26(5):679-681,685
利用遗传算法(GA)提取茶叶的近红外吸收特征波长的方法,研究建立了绿茶水分和氨基酸的近红外分析模型,并对波长选择前后两种成分的模型进行了比较分析。结果表明,经遗传算法波长选择后,简化了分析模型,同时模型的稳健性增强。氨基酸预测集的均方根误差(SEP)减小82.1%,水分预测集的均方根误差减小(SEP)76.6%,它们在波长选择前后对应的分析波长数之比分别为995∶7和1990∶33。  相似文献   
82.
本文结合次梯度选取技术及割平面法和强次可行方向法的思想,提出了一个求解目标函数非光滑约束优化问题的强次可行方向算法.通过设计一个新的寻找搜索方向子问题和构造新型线搜索,算法不仅能接受不可行的初始点,而且能保持迭代点的强次可行性,同时避免在可行域外目标函数值的不适度增加.算法具备全局收敛性,且初步的数值试验表明算法是稳定有效的.  相似文献   
83.
We have investigated the influence of a weak radial temperature gradient in a wide gap and large aspect ratio Couette-Taylor system. The inner cylinder is rotating and can be heated or cooled, the outer cylinder is at rest and immersed in a large thermal bath. We found that a radial temperature gradient destabilizes the Couette flow leading to a pattern of traveling helicoidal vortices occurring only near the bottom of the system. The size of the pattern increases as the rotation frequency of the cylinder is increased. We have characterized the spatiotemporal properties of the pattern and we have shown that it behaves as a wall mode found in the simulation of the complex Ginzburg-Landau equation with homogeneous boundary conditions.  相似文献   
84.
This paper investigates a genotype selection model subjected to both a multiplicative coloured noise and an additive coloured noise with different correlation time τ1 and τ2 by means of the numerical technique. By directly simulating the Langevin Equation, the following results are obtained. (1) The multiplicative coloured noise dominates, however, the effect of the additive coloured noise is not neglected in the practical gene selection process. The selection rate μ decides that the selection is propitious to gene A haploid or gene B haploid. (2) The additive coloured noise intensity and the correlation time τ2 play opposite roles. It is noted that α and τ2 can not separate the single peak, while can make the peak disappear and ~-2 can make the peak be sharp. (3) The multiplicative coloured noise intensity D and the correlation time τ1 can induce phase transition, at the same time they play opposite roles and the reentrance phenomenon appears. In this case, it is easy to select one type haploid from the group with increasing D and decreasing τ1.  相似文献   
85.
86.
In this paper, the idea of random selection in the theorem on gambling system is extended to Markov chains, by using the notion likelihood ratio and an analytic technique. A strong limit theorem on the relative frequency of ordered couple under random selection is established.AMS Subject Classification (2001) primary 60F15 Secondary 60J10  相似文献   
87.
In this paper, we derive a stochastic model for the HIV epidemic in homosexual populations involving age and race. To account for effects of different mixing patterns, a low risk selection rule is introduced. The model is then formulated in terms of chain multinomial distributions by means of which the means are derived. Some simulation studies by computer indicate clearly that age and race have a significant impact on the HIV epidemic.  相似文献   
88.
This paper introduces a new approach for generating school bus routes in a dense urban area. First, a districting algorithm is used to determine clusters including appropriate numbers of students. Then, for each cluster, a route and the stops along this route are determined. Numerical results are reported and compared with those obtained previously. Although the algorithm has been developped and tested in a specific context, it could easily be extended to more general vehicle routing problems.  相似文献   
89.
A model for polar filaments interacting via molecular motor complexes is investigated which exhibits bifurcations to spatial patterns. It is shown that the homogeneous distribution of filaments, such as actin or microtubules, may become either unstable with respect to an orientational instability of a finite wave number or with respect to modulations of the filament density, where long-wavelength modes are amplified as well. Above threshold nonlinear interactions select either stripe patterns or periodic asters. The existence and stability ranges of each pattern close to threshold are predicted in terms of a weakly nonlinear perturbation analysis, which is confirmed by numerical simulations of the basic model equations. The two relevant parameters determining the bifurcation scenario of the model can be related to the concentrations of the active molecular motors and of the filaments, respectively, which both could be easily regulated by the cell.  相似文献   
90.
In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog2n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n2log2n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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