نتایج جستجو برای: finite buffer
تعداد نتایج: 300002 فیلتر نتایج به سال:
We consider a fluid system composed of multiple buffers in series. The first buffer receives fluid from a finite superposition of independent identical on-off sources. The active and silent periods of sources are exponentially distributed. The ith buffer releases fluid in the (i + 1)th buffer. Assuming that the input rate of one source is greater than the service rate of the first buffer, the o...
We consider a fluid system composed of multiple buffers in series. The first buffer receives fluid from a finite superposition of independent identical on-off sources. The active and silent periods of sources are exponentially distributed. The ith buffer releases fluid in the (i+1)th buffer. Assuming that the input rate of one source is greater than the service rate of the first buffer, the out...
the voltammetric behaviour of sulfadoxine (sdn) was studied at a glassy carbon electrode in 0.2 m phosphate buffer solutions using cyclic, differential-pulse (dpv) and square wave voltammetry (swv). the dependence of the current on ph, concentration, and scan rate was investigated to optimize the experimental conditions for the determination of sdn. the oxidation process was shown to be diffusi...
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. We assume that each packet has value which is either 1 or a, for some a > 1. The buffer management task is to decide which packets to drop so as to minimize the total value of lost packets, subject to the buffer space bou...
In this paper we study optimal estimation design for sampled linear systems where the sensors measurements are transmitted to the estimator site via a generic digital communication network. Sensor measurements are subject to random delay or might even be completely lost. We show that the minimum error covariance estimator is timevarying, stochastic, and it does not converge to a steady state. M...
In the reordering buffer management problem a sequence of requests arrive online in a finite metric space, and have to be processed by a single server. This server is equipped with a request buffer of size k and can decide at each point in time, which request from its buffer to serve next. Servicing of a request is simply done by moving the server to the location of the request. The goal is to ...
A tandem queueing system with a Markovian Arrival Process (MAP) useful in modeling a call center with Interactive Voice Response (IVR) is investigated. The first stage has a finite number of servers without buffer while the second stage of the tandem has a finite buffer and a finite number of servers. The service time at the first (second) stage has an exponential (phase type) distribution. A s...
-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید