Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 33 - 48 of 30770

  • Atlas of meteorites, by M. M. Grady, G. Pratesi and V. Moggi Cecchi

    Esposito, Salvatore  

    Download Collect
  • Atlas of meteorites, by M. M. Grady, G. Pratesi and V. Moggi Cecchi

    Esposito   Salvatore  

    Download Collect
  • Potentials Method for M/G/1/m Systems with Threshold Operating Strategies

    Zhernovyi, Yu. V.; Zhernovyi, K. Yu.  

    We propose a method to analyze M/G/1/m queuing systems with the function of random dropping of customers and service time distribution dependent on the queue length. We obtain formulas to determine the Laplace transforms of the distribution of the number of customers in the system during busy period and of the distribution function of the busy period and to calculate the stationary characteristics. The relations for the stationary characteristics are tested using simulation models constructed with the use of the GPSS World tools. The results of the use of various control tools of system parameters are compared in the example.
    Download Collect
  • PERFECT SIMULATION OF M/G/c QUEUES

    Connor, Stephen B.   Kendall, Wilfrid S.  

    In this paper we describe a perfect simulation algorithm for the stable M/G/c queue. Sigman (2011) showed how to build a dominated coupling-from-the-past algorithm for perfect simulation of the super-stable M/G/c queue operating under first-come-first-served discipline. Sigman's method used a dominating process provided by the corresponding M/G/1 queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service). The method exploited the fact that the workload process for the M/G/1 queue remains the same under different queueing disciplines, in particular under the processor sharing discipline, for which a dynamic reversibility property holds. We generalise Sigman's construction to the stable case by comparing the M/G/c queue to a copy run under random assignment. This allows us to produce a naive perfect simulation algorithm based on running the dominating process back to the time it first empties. We also construct a more efficient algorithm that uses sandwiching by lower and upper processes constructed as coupled M/G/c queues started respectively from the empty state and the state of the M/G/c queue under random assignment. A careful analysis shows that appropriate ordering relationships can still be maintained, so long as service durations continue to be coupled in order of initiation of service. We summarise statistical checks of simulation output, and demonstrate that the mean run-time is finite so long as the second moment of the service duration distribution is finite.
    Download Collect
  • Philippe M. Soriano Awarded 2017 Edwin G. Conklin Medal

    Lucas, Marsha E.  

    Download Collect
  • Paul and the Gift by John M. G. Barclay

    Giambrone, Anthony  

    Download Collect
  • Paul and the Gift by John M. G. Barclay

    Giambrone, Anthony  

    Download Collect
  • Analysis of the loss probability in the M/G/1+G queue

    Inoue, Yoshiaki   Takine, Tetsuya  

    We consider the loss probability in the stationary M/G/1+G queue, i.e., the stationary M/G/1 queue with impatient customers whose impatience times are generally distributed. It is known that the loss probability is given in terms of the probability density function v(x) of the virtual waiting time and that v(x) is given by a formal series solution of a Volterra integral equation. In this paper, we show that the series solution of v(x) can be interpreted as the probability density function of a random sum of dependent random variables and we reveal its dependency structure through the analysis of a last-come first-served, preemptive-resume M/G/1 queue with workload-dependent loss. Furthermore, based on this observation, we show some properties of the loss probability.
    Download Collect
  • Perfect simulation of M/G/c queues

    Connor, Stephen B.   Kendall, Wilfrid S.  

    Download Collect
  • Perfect simulation of M/G/c queues

    Connor, Stephen B.   Kendall, Wilfrid S.  

    Download Collect
  • Letters from E. M. Edmonds to Nikolaos G. Politis

    Gotsi, Georgia  

    This article presents the letters sent by the late nineteenth-century English writer Elizabeth Mayhew Edmonds to the Greek folklorist Nikolaos G. Politis. While a preoccupation with folklore and ethnology predisposed the Victorian public to take a narrow view of Greek society, Edmonds's interest in both vernacular culture and the literary, social and political life of modern Greece enriched the complex cultural exchange that developed between European (Neo)Hellenists and Greek scholars. This European-wide discourse promoted modern Greece as an autonomous subject of study, worthy of intellectual pursuit.
    Download Collect
  • On the effective cone of (M)over-bar(g,n)

    Mullane, Scott  

    For every g >=3D 2 and n >=3D g + 1 we exhibit infinitely many extremal effective divisors in (M) over bar (g,n,) coming from the strata of abelian differentials. (C) 2017 Elsevier Inc. All rights reserved.
    Download Collect
  • IJBF (2014) () || G – M

    Download Collect
  • A Low-Power Mixed-Mode SIMO Universal G(m)-C Filter

    Parvizi, Mostafa   Taghizadeh, Abouzar   Mahmoodian, Hamid   Kozehkanani, Ziaadin Daei  

    This paper describes a new single-input multiple-output (SIMO) mixed-mode universal biquad Gm-C filter. It can realize all kinds of filter responses including high-pass, band-pass, low-pass, band-stop and all-pass filters, simultaneously. Moreover, in this structure, all of these filters in all states of voltage mode, current mode, transresistance mode and transconductance mode are achieved by the same topology without any convertor. The proposed filter employs three operational transconductance amplifiers (OTAs) with four inputs and one output, three fully differential OTAs and two grounded capacitors. In other words, this filter is composed of six Gm blocks and two grounded capacitors. The grounded capacitors are suitable for integrated circuit implementation. In order to reduce the power consumption, the OTAs are biased in subthreshold region. In addition, sensitivity analysis is included to show the low active and passive sensitivity performances of the filter. This filter is designed and simulated in HSPICE with 0.18 mu m model CMOS technology parameters. The simulation results show that the filter consumes only 75 mu W and operates at 1.5 MHz with +/- 0.5 V supply voltages and capacitors C-1 =3D C-2 =3D 2 pF.
    Download Collect
  • Potentials Method for M/G/1/m Systems with Hysteretic Operating Strategies

    Yu. V. Zhernovyi  

    Download Collect
  • A finite-source M/G/1 retrial queue with outgoing calls

    Dragieva, Velika I.; Phung-Duc, Tuan  

    Download Collect
1 2 3 4 5 6 7 8 9 10

Contact

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback