全文获取类型
收费全文 | 1063篇 |
免费 | 109篇 |
国内免费 | 29篇 |
专业分类
化学 | 105篇 |
晶体学 | 1篇 |
力学 | 20篇 |
综合类 | 67篇 |
数学 | 956篇 |
物理学 | 52篇 |
出版年
2023年 | 8篇 |
2022年 | 35篇 |
2021年 | 29篇 |
2020年 | 21篇 |
2019年 | 27篇 |
2018年 | 22篇 |
2017年 | 25篇 |
2016年 | 27篇 |
2015年 | 18篇 |
2014年 | 54篇 |
2013年 | 82篇 |
2012年 | 40篇 |
2011年 | 45篇 |
2010年 | 45篇 |
2009年 | 66篇 |
2008年 | 79篇 |
2007年 | 47篇 |
2006年 | 56篇 |
2005年 | 35篇 |
2004年 | 21篇 |
2003年 | 39篇 |
2002年 | 38篇 |
2001年 | 18篇 |
2000年 | 34篇 |
1999年 | 26篇 |
1998年 | 25篇 |
1997年 | 17篇 |
1996年 | 30篇 |
1995年 | 18篇 |
1994年 | 25篇 |
1993年 | 15篇 |
1992年 | 19篇 |
1991年 | 10篇 |
1990年 | 24篇 |
1989年 | 16篇 |
1988年 | 9篇 |
1987年 | 23篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1201条查询结果,搜索用时 0 毫秒
91.
In modern telephone exchanges, subscriber lines are usually connected to the so-called subscriber line modules. These modules serve both incoming and outgoing traffic. An important difference between these two types of calls lies in the fact that in the case of blocking due to all channels busy in the module, outgoing calls can be queued whereas incoming calls get busy signal and must be re-initiated in order to establish the required connection. The corresponding queueing model was discussed recently by Lederman, but only the model with losses has been studied analytically. In the present contribution, we study the model which takes into account subscriber retrials and investigate some of its properties such as existence of stationary regime, derive explicit formulas for the system characteristics, limit theorems for systems under high repetition intensity of blocked calls and limit theorems for systems under heavy traffic. 相似文献
92.
Susan H. Xu 《Queueing Systems》1994,18(3-4):273-300
This paper studies theadmission andscheduling control problem in anM/M/2 queueing system with nonidentical processors. Admission control renders when a newly arrived job should be accepted, whereas scheduling control determines when an available processor should be utilized. The system received a rewardR when a job completes its service and pays a unit holding costC while a job is in the system. The main goal of the paper is to obtain the admission/scheduling policy that maximizes the expected discounted and long-run average profits (reward minus cost). We convert the system into its dual, a stochastically identical system subject toexpulsion/scheduling control, and prove that the individually optimal policy in the dual system is socially optimal in the original system. In contrast with the dynamic programming (DP) technique which considers the system as a whole, we adopt the viewpoint of an individual job and analyze the impact of its behavior on the social outcome. The key properties which simplify the analysis are that under the individually optimal policy the profit of a job under the preemptive last-come first-priority service discipline (LCFP-P) is independent of jobs arrived earlier than itself and that the system is insensitive to service discipline imposed. The former makes possible to bypass complex dynamic programming analyses and the latter serves as a vehicle in connecting the social and individual optimality. We also exploit system operational characteristics under LCFP-P to obtain simple and close approximations of the optimal thresholds. 相似文献
93.
A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 ≤ k ≤ ∞. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions. 相似文献
94.
95.
In this paper we study queueing networks which allow multiple changes at a given time. The model has a natural application
to discrete-time queueing networks but describes also queueing networks in continuous time.
It is shown that product-form results which are known to hold when there are single changes at a given instant remain valid
when multiple changes are allowed. 相似文献
96.
We consider the control of an infinite capacity shuttle which transports passengers between two terminals. The passengers
arrive at each terminal according to a compound Poisson process and the travel time from one terminal to the other is a random
variable following an arbitrary distribution. The following control limit policy is considered: dispatch the shuttle at terminali, at the instant that the total number of passengers waiting at terminali reaches or exceeds a predetermined control limitm
i
. The objective of this paper is to obtain the mean waiting time of an arbitrary passenger at each terminal for given control
valuesm
1 andm
2. We also discuss a search procedure to obtain the optimal control values which minimize the total expected cost per unit
time under a linear cost structure. 相似文献
97.
A class of single server queues with Poisson arrivals and a gated server is considered. Whenever the server becomes idle the gate separating it from the waiting line opens, admitting all the waiting customers into service, and then closes again. The batch admitted into service may be served according to some arbitrary scheme. The equilibrium waiting time distribution is provided for the subclass of conservative schemes with arbitrary service times and the processor-sharing case is treated in some detail to produce the equilibrium time-in-service and response time distributions, conditional on the length of required service. The LIFO and random order of service schemes and the case of compound Poisson arrivals are treated briefly as examples of the effectiveness of the proposed method of analysis. All distributions are provided in terms of their Laplace transforms except for the case of exponential service times where the L.T. of the waiting time distribution is inverted. The first two moments of the equilibrium waiting and response times are provided for most treated cases and in the exponential service times case the batch size distribution is also presented. 相似文献
98.
《Indagationes Mathematicae》2023,34(5):990-1013
We investigate Markovian queues that are examined by a controller at random times determined by a Poisson process. Upon examination, the controller sets the service speed to be equal to the minimum of the current number of customers in the queue and a certain maximum service speed; this service speed prevails until the next examination time. We study the resulting two-dimensional Markov process of queue length and server speed, in particular two regimes with time scale separation, specifically for infinitely frequent and infinitely long examination times. In the intermediate regime the analysis proves to be extremely challenging. To gain further insight into the model dynamics we then analyse two variants of the model in which the controller is just an observer and does not change the speed of the server. 相似文献
99.
We derive the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive Lévy input. The priority of an infinitesimal customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. To this end we introduce a new method that relies on the construction of a workload overtaking process and solving a first-passage problem using an appropriate stopping time. 相似文献
100.
本文对气固冲蚀和浆体冲蚀条件下耐磨环氧胶粘涂层的磨损特性进行了研究。结果表明,这种涂层的冲蚀磨损是由粘结剂的磨损和抗磨填料的磨损所组成;填料粒度和磨料粒度都对涂层的气固冲蚀磨损有影响,但在给定的试验条件下,填料粒度对涂层的浆体冲蚀磨损影响甚微。文章指出,耐磨环氧胶粘涂层在气固冲蚀和浆体冲蚀下的磨损机理相似,但磨损规律却有所不同;耐磨环氧胶粘涂层尤其适用于浆体冲蚀的场合,可以明显地提高机械过流部件的使用寿命。 相似文献