全文获取类型
收费全文 | 680篇 |
免费 | 13篇 |
国内免费 | 32篇 |
专业分类
综合类 | 7篇 |
数学 | 702篇 |
物理学 | 16篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 17篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 3篇 |
2014年 | 22篇 |
2013年 | 37篇 |
2012年 | 19篇 |
2011年 | 28篇 |
2010年 | 32篇 |
2009年 | 27篇 |
2008年 | 40篇 |
2007年 | 51篇 |
2006年 | 49篇 |
2005年 | 36篇 |
2004年 | 17篇 |
2003年 | 35篇 |
2002年 | 25篇 |
2001年 | 24篇 |
2000年 | 27篇 |
1999年 | 15篇 |
1998年 | 10篇 |
1997年 | 21篇 |
1996年 | 14篇 |
1995年 | 17篇 |
1994年 | 28篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有725条查询结果,搜索用时 15 毫秒
121.
Single server retrial queueing models in which customers arrive according to a batch Poisson process are considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit (the orbital customers) try to reach the server subsequently with the inter-retrial times exponentially distributed. Additionally, at each service completion epoch, two different search mechanisms, that is, type I and type II search, to bring the orbital customers by the system to service, are switched on. Thus, when the server is idle, a competition takes place among primary customers, customers who come by retrial and by two types of searches. The type I search selects a single customer whereas the type II search considers a batch of customers from the orbit. Depending on the maximum size of the batch being considered for service by a type II search, two cases are addressed here. In the first case, no restriction on batch size is assumed, whereas in the second case, maximum size of the batch is restricted to a pre-assigned value. We call the resulting models as model 1 and model 2 respectively. In all service modes other than type II search, only a single customer is qualified for service. Service times of the four types of customers, namely, primary, repeated, and those who come by two types of searches are arbitrarily distributed (with different distributions which are independent of each other). Steady state analysis is performed and stability conditions are established. A control problem for model 2 is considered and numerical illustrations are provided. 相似文献
122.
It has been shown by (R.O. Al-Seedy, A.A. El-Sherbiny, S.A. El-Shehawy, S.I. Ammar, Transient solution of the M/M/c queue with balking and reneging, Comput. Math. Appl. 57 (2009) 1280–1285) that a generating function technique can be successfully applied to derive the transient solution for an M/M/c queueing system. In this paper, we further illustrate how this technique can be used to obtain the busy period density function of an M/M/1 queue with balking and reneging. Finally, numerical calculations are presented. 相似文献
123.
Abstract In this article, we study a queueing system M x /G/1 with multiple vacations. The probability generating function (P.G.F.) of stationary queue length and its expectation expression are deduced by using an embedded Markov chain of the queueing process. The P.G.F. of stationary system busy period and the probability of system in service state and vacation state also are obtained by the same method. At last we deduce the LST and mean of stationary waiting time in the service order FCFS and LCFS, respectively. 相似文献
124.
125.
An M[X]/G/1 retrial G-queue with single vacation and unreliable server is investigated in this paper. Arrivals of positive customers form a compound Poisson process, and positive customers receive service immediately if the server is free upon their arrivals; Otherwise, they may enter a retrial orbit and try their luck after a random time interval. The arrivals of negative customers form a Poisson process. Negative customers not only remove the customer being in service, but also make the server under repair. The server leaves for a single vacation as soon as the system empties. In this paper, we analyze the ergodical condition of this model. By applying the supplementary variables method, we obtain the steady-state solutions for both queueing measures and reliability quantities. 相似文献
126.
Wojciech M. Kempa 《随机分析与应用》2013,31(1):26-43
A batch arrival queueing system with a single vacation between two successive busy periods and with exhaustive service is considered. The departure process h(t) is studied first on a single vacation cycle. The approach based on renewal theory is applied to obtain results in the general case. In particular, the explicit representation for the generating function of Laplace transform of the probability function of h(t) is derived. All formulae are written in terms of input parameters of the system and factors of a certain canonical factorization of Wiener–Hopf type. A numerical approach to results is discussed as well. 相似文献
127.
Dariusz Marek Adam Domaski Joanna Domaska Jakub Szygua Tadeusz Czachrski Jerzy Klamka 《Entropy (Basel, Switzerland)》2021,23(5)
In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature. 相似文献
128.
We study an assembly-like queueing system one of whose queues has items with generally distributed time-constraints, where this system has a single server providing services using each item individually. It is well-known that analysis of a queueing system which has items with time-constraint (i.e., impatient items) is difficult since the analytical model must involve all the departure times of these impatient items. We therefore propose to employ the techniques of Whitt’s approximation and show the method for obtaining the stationary distribution of the model. Through some simulation experiments, we discuss the validation of our approximation model, and show that the approximation is accurate in various kinds of situations (e.g., service time distribution and the number of queues). 相似文献
129.
《Operations Research Letters》2014,42(6-7):388-393
Fluid models, in particular their equilibrium states, have become an important tool for the study of many-server queues with general service and patience time distributions. However, it remains an open question whether the solution to a fluid model converges to the equilibrium state and under what condition. We show in this paper that the convergence holds under some conditions. Our method builds on the framework of measure-valued processes, which keeps track of the remaining patience and service times. 相似文献
130.
The problem of estimating diffusion coefficients has been considered extensively in both discrete and continuous time. We consider here an approach based on counting occupation numbers of diffusing particles. The problem, and our approach, are motivated by statistical mechanics. 相似文献