全文获取类型
收费全文 | 522篇 |
免费 | 12篇 |
国内免费 | 13篇 |
专业分类
化学 | 27篇 |
力学 | 2篇 |
综合类 | 4篇 |
数学 | 500篇 |
物理学 | 14篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 13篇 |
2013年 | 21篇 |
2012年 | 16篇 |
2011年 | 15篇 |
2010年 | 13篇 |
2009年 | 29篇 |
2008年 | 34篇 |
2007年 | 21篇 |
2006年 | 26篇 |
2005年 | 22篇 |
2004年 | 8篇 |
2003年 | 16篇 |
2002年 | 27篇 |
2001年 | 22篇 |
2000年 | 22篇 |
1999年 | 13篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 22篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 12篇 |
1986年 | 4篇 |
1985年 | 11篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有547条查询结果,搜索用时 31 毫秒
1.
We study a model of a queueing system with two complementary products/services. In our model, there is one M/M/1 system and another facility that provides instantaneous service. The two services are complementary and the customer has no benefit from obtaining just one of them. We investigate the model under various price structures and ownership assumptions.AMS subject classification: 90B22, 91A10The authors are equal in their contribution to this paper. This paper is submitted by the first author to the Tokyo Institute of Technology as partial fulfillment of the requirements for the Ph.D. program in the Department of Value and Decision Sciences, and the order of names was chosen in compliance with program conditions. This research was supported by the Israel Science Foundation (grant No. 237/02). 相似文献
2.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
3.
Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate 相似文献
4.
In this paper,the concept of the infinitesimal realization factor is extended to the parameter-dependent performance functions in closed queueing networks. Then the concepts of realization matrix (its elements are called realization factors) and performance potential are introduced,and the relations between infinitesimal realization factors and these two quantities are discussed. This provides a united framework for both IPA and non IPA approaches. Finally,another physical meaning of the service rate is given. 相似文献
5.
We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper. 相似文献
6.
This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production
when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system
including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length.
AMS subject classification: 90B22, 60K25 相似文献
7.
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive
repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain
packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing
the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures
is illustrated by some numerical examples.
This work has been supported by the Interuniversity Attraction Poles Programme–Belgian Science Policy. 相似文献
8.
We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously
assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per
unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize
the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and
NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that
the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound
on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above
by the number of servers.
相似文献
9.
In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian
arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some
interesting numerical examples are presented. 相似文献
10.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献