首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1024篇
  免费   194篇
  国内免费   19篇
化学   265篇
力学   28篇
综合类   81篇
数学   693篇
物理学   170篇
  2023年   13篇
  2022年   77篇
  2021年   88篇
  2020年   58篇
  2019年   53篇
  2018年   53篇
  2017年   63篇
  2016年   63篇
  2015年   39篇
  2014年   68篇
  2013年   82篇
  2012年   43篇
  2011年   57篇
  2010年   36篇
  2009年   49篇
  2008年   61篇
  2007年   40篇
  2006年   39篇
  2005年   30篇
  2004年   19篇
  2003年   27篇
  2002年   24篇
  2001年   17篇
  2000年   21篇
  1999年   13篇
  1998年   12篇
  1997年   9篇
  1996年   12篇
  1995年   4篇
  1994年   10篇
  1993年   5篇
  1992年   7篇
  1991年   2篇
  1990年   7篇
  1989年   7篇
  1988年   4篇
  1987年   8篇
  1986年   3篇
  1985年   3篇
  1984年   2篇
  1983年   2篇
  1979年   3篇
  1978年   1篇
  1977年   1篇
  1959年   2篇
排序方式: 共有1237条查询结果,搜索用时 968 毫秒
1.
An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.  相似文献   
2.
Glazebrook  K.D.  Lumley  R.R.  Ansell  P.S. 《Queueing Systems》2003,45(2):81-111
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs.  相似文献   
3.
本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。  相似文献   
4.
We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20  相似文献   
5.
van der Mei  R.D.  Levy  H. 《Queueing Systems》1997,27(3-4):227-250
We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
6.
We define and analyze anM/G/1/N vacation model that uses a service discipline that we call theE-limited with limit variation discipline. According to this discipline, the server provides service until either the system is emptied (i.e. exhausted) or a randomly chosen limit ofl customers has been served. The server then goes on a vacation before returning to service the queue again. The queue length distribution and the Laplace-Stieltjes transforms of the waiting time, busy period and cycle time distributions are found. Further, an expression for the mean waiting time is developed. Several previously analyzed service disciplines, including Bernoulli scheduling, nonexhaustive service and limited service, are special cases of the general varying limit discipline that is analyzed in this paper.  相似文献   
7.
Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle inM/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dualGI/M/1. In this note, we generalize this duality relation toGI/G/1 queues with modified first services; this clarifies the original result, and shows that the generalized ballot theorem is superfluous for the duality relation.  相似文献   
8.
In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments.  相似文献   
9.
燃气汽车规模化发展是解决城市环境污染的一个主要途径.以西安市燃气出租车发展问卷调查结果为依据,利用因子分析法对影响燃气出租车发展的变量进行分类.总结出影响燃气出租车发展的八个重要指标,覆涵了政府、加气站、司机个人等方面.  相似文献   
10.
张梅 《应用光学》2006,27(6):594-597
为构造出与理想梯形滤波器接近的滤波形状,在单级光纤马赫-德尔交叉复用器的基础上,引入在线滤波技术;通过增加干涉级数和调整2对干涉臂的干涉长度和耦合器的耦合比,实现了逼近宽带陡沿的滤波输出。通过与梯形滤波器傅里叶展开式的比较,计算得到了器件的最佳参数,器件的滤波性能以及温度稳定性相对于单级结构得到了明显提高。根据理论计算,成功制作出通道间隔为50GHz的样品器件。其输出为-0.5dB,带宽大于0.185nm,相邻通道隔离度大于30dB,满足了DWDM系统指标要求。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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