This study develops an explicit two-step Lagrangian scheme based on the renewal-reward process to capture transient anomalous diffusion with mixed retention and early arrivals in multidimensional media. The resulting 3-D anomalous transport simulator provides a flexible platform for modeling transport. The first step explicitly models retention due to mass exchange between one mobile zone and a...

[1] We computed cross-correlations of seismic waves generated by Long-Period (LP) events in the frequency band [0.8–2.2 Hz]. The data were recorded in the vicinity of Mount St Helens (MSH) during an eruptive period from September to December 2004. The time symmetric coherent coda arrivals of the time-derivative of the cross-correlation function (DCF), resulting from scattering and topographic e...

Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of wide-area TCP arrival processes (session and connection arrivals, FTP data connection arrivals within FTP sessions, and TELNET packet arrivals) to...

We present a new method for data interpolation and signal/noise separation of teleseismic wavefields recorded by regional seismic arrays. The method exploits the plane wave nature of direct arrivals and receiver-side arrivals from regional scale structure by decomposing the recorded wavefield into a plane wave basis using the linear radon transform. Casting the radon transform as an inversion p...

Predictions of call center arrivals are a key input to staff scheduling models. It is, therefore, surprising that simplistic forecasting methods dominate practice, and that the research literature on forecasting arrivals is so small. In this paper, we evaluate univariate time series methods for forecasting intraday arrivals for lead times from one half-hour ahead to two weeks ahead. We analyze ...

Dynamic job shop scheduling (DJSS) problems are combinatorial optimisation problems that have been extensively studied in the literature due to their difficulty and their applicability to real-world manufacturing systems, e.g., car manufacturing systems. In a DJSS problem instance, jobs arrive on the shop floor to be processed on specific sequences of machines on the shop floor and unforeseen e...

In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanakis-Tsybakov-Mikhailov's protocol in the context of communication networks with random access is an example of such an algorithm. In computer science, this corresponds to a trie structure with a dynamic input. Mathematically, it is related to a stopped branching process with exogeneous arrivals (im...

Throughout this internship report, polling systems play a central role. Polling systems are queueing systems consisting of multiple queues, attended by a single server. The server can only serve one queue at a time. Whenever the server moves from one queue to another, a stochastic, non-zero switch-over time is incurred. The server never idles; even when there are no customers waiting in the who...

Most research in queueing theory is typically based on the steady-state analysis. In today’s dynamically changing traffic environment, the steady-state analysis may not provide enough information to operators regarding Quality of Service (QoS) requirements and dynamic design. In addition, the steady state analysis is not practical for nonstationary arrivals. In this paper, we consider the time-...

The throughput optimality ofpriority management strategies in a single buffer has been studiedfor a general aggregate arrival law. The tight upper bounds found are useful to understand optimality in utilization of specijic priority schemes such as push-out buffer (POB) and partial buffer sharing (PBS). This paper further focuses on the maximum allowable load pmaa versus the priority mix a for a...