首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11964篇
  免费   1481篇
  国内免费   992篇
化学   3278篇
晶体学   71篇
力学   881篇
综合类   246篇
数学   4902篇
物理学   5059篇
  2024年   11篇
  2023年   84篇
  2022年   284篇
  2021年   310篇
  2020年   260篇
  2019年   238篇
  2018年   255篇
  2017年   337篇
  2016年   376篇
  2015年   315篇
  2014年   617篇
  2013年   847篇
  2012年   613篇
  2011年   700篇
  2010年   613篇
  2009年   723篇
  2008年   812篇
  2007年   802篇
  2006年   694篇
  2005年   649篇
  2004年   518篇
  2003年   501篇
  2002年   489篇
  2001年   345篇
  2000年   362篇
  1999年   341篇
  1998年   338篇
  1997年   262篇
  1996年   211篇
  1995年   190篇
  1994年   194篇
  1993年   125篇
  1992年   121篇
  1991年   99篇
  1990年   74篇
  1989年   87篇
  1988年   78篇
  1987年   68篇
  1986年   50篇
  1985年   80篇
  1984年   49篇
  1983年   36篇
  1982年   53篇
  1981年   25篇
  1980年   27篇
  1979年   37篇
  1978年   40篇
  1977年   21篇
  1976年   21篇
  1973年   15篇
排序方式: 共有10000条查询结果,搜索用时 8 毫秒
61.
对高能闪光机光源性能用Monte-Carlo方法模拟研究发现:并非击靶电子束半径越小、发射度越低, 闪光机的照相性能就会越好. 研究结果表明:为了使闪光照相图像视面上照射量分布比较均匀, 对束半径与电子束归一发射度有一个联合限制, 对于20MeV闪光机, 如果击靶电子束有效半径是0.12cm, 那么仅当束归一发射度≥550cm.mrad时,在2°内的照射量不均匀性才小于5%.  相似文献   
62.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.   相似文献   
63.
Satya Prakash 《Pramana》1989,33(1):109-131
This article summarizes the recent radiochemical investigations on mass, charge kinetic energy and fragment angular distributions in low energy fission of actinides.  相似文献   
64.
Skew Models II     
If g and G are the pdf and the cdf of a distribution symmetric around 0 then the pdf 2g(u)G(λ u) is said to define a skew distribution. In this paper, we provide a mathematical treatment of the skew distributions when g and G are taken to come from one of Pearson type II, Pearson type VII or the generalized t distribution.   相似文献   
65.
介绍一种二元阈值方法在股票指数上的应用   总被引:4,自引:0,他引:4  
二元极值的阈值方法的一个发展是用来考虑两个变量的联合分布。这个方法是建立在二元极值的点过程表示法的基础上。本文用参数 (Logistic模型 )和非参数模型对 1992 1999年的上海、深圳日收盘指数对数收益进行分析并给出分析结果。  相似文献   
66.
王炳章  方小娟 《数学进展》2002,31(5):467-475
本文研究了未知分布的逼近问题,利用随机加权法,给出了有Edgeworth展式的一类(未知)分布的模拟分布,证明了在一定条件下,模拟分布与未知分布的逼近精度达到O(n^-1√lnlnn),称之为随机加权逼近的重对数律。  相似文献   
67.
We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PHL,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ LN. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures. AMS Subject Classification: Primary 60K25 Secondary 68M20 90B22.  相似文献   
68.
The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.  相似文献   
69.
A method to approximate the eigenvalues of linear operators depending on an unknown distribution is introduced and applied to weighted sums of squared normally distributed random variables. This area of application includes the approximation of the asymptotic null distribution of certain degenerated U- and V-statistics.

  相似文献   

70.
相型同步启动时间的M/M/c排队系统   总被引:4,自引:0,他引:4  
本文研究带有同步启动时间的M/M/c系统,其中启动时间是相型变量,给出了稳态和等待时间分布等结果。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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