• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • Tagged with
  • 4
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Waiting Time Distribution for the Emergence of Superpatterns

Godbole, Anant P., Liendo, Martha 01 June 2016 (has links)
Consider a sequence (Formula presented.) of i.i.d. uniform random variables taking values in the alphabet set {1, 2,…, d}. A k-superpattern is a realization of (Formula presented.) that contains, as an embedded subsequence, each of the non-order-isomorphic subpatterns of length k. We focus on the (non-trivial) case of d = k = 3 and study the waiting time distribution of (Formula presented.). Our restricted set-up leads to proofs that are very combinatorial in nature, since we are essentially conducting a string analysis.
2

Scaling, Power-Law First Return Times, and Non-Ergodicity

Lambert, David Robert 08 1900 (has links)
This dissertation is a collection of papers on anomalous phenomena in physics, biology, and sociology. These phenomena are primarily analyzed in terms of their temporal and spatiotemporal statistical properties. The analysis is based on both numerical simulations and, in some cases, real-world physiological and sociological data. The primary methods of analysis are diffusion entropy analysis, power spectral analysis, multifractal analysis, and survival (or waiting-time) analysis.
3

Queueing Analysis of a Priority-based Claim Processing System

Ibrahim, Basil January 2009 (has links)
We propose a situation in which a single employee is responsible for processing incoming claims to an insurance company that can be classified as being one of two possible types. More specifically, we consider a priority-based system having separate buffers to store high priority and low priority incoming claims. We construct a mathematical model and perform queueing analysis to evaluate the performance of this priority-based system, which incorporates the possibility of claims being redistributed, lost, or prematurely processed.
4

Queueing Analysis of a Priority-based Claim Processing System

Ibrahim, Basil January 2009 (has links)
We propose a situation in which a single employee is responsible for processing incoming claims to an insurance company that can be classified as being one of two possible types. More specifically, we consider a priority-based system having separate buffers to store high priority and low priority incoming claims. We construct a mathematical model and perform queueing analysis to evaluate the performance of this priority-based system, which incorporates the possibility of claims being redistributed, lost, or prematurely processed.

Page generated in 0.1295 seconds