Merging to Semistable Processes

Merging ETL Processes

Approximate Model for Merging Markovian Arrival Processes

Traffic-based decomposition models encompass procedures required for modelling of the basic network operations of superposition, departure and splitting, arising due to the common sharing of the resources and routing decisions taking place in packetswitched networks. It is desirable to study such models for Markovian Arrival Processes (MAPs), as these processes are able to match correlations an...

Visualization of Splitting and Merging Processes

Information about objects that split or merge is often generated dynamically as a by-product of computation or in the observation of real-world behavior. Visualization tools for such processes must not only reveal temporal patterns and spatial organization but should also accommodate on-the-fly generation of split-merge information. This paper develops a formal structure for split-merge process...

Semistable 3-fold Flips

1 Introduction. In this short note, I will give a proof of the existence of semistable 3-fold flips, which does not use the classification of log terminal (i.e., quotient) surface singularities. This permits us to avoid a calculation, which is a sort of logical bottleneck in all the existing approaches to semistable 3-fold flips ([Ka1 pg. 158–159], [Sh pg. 386–389], [Ka3 pg. 483–486]), however ...

Semistable Lévy Motion

Semistable Lévy motions have stationary independent increments with semistable distributions. They can be realized as scaling limits of simple random walks, extending the familiar Lévy motions. Generators of stable semigroups are fractional derivatives, and the semistable generators provide a new approximation to fractional derivatives. Semistable Lévy motions and semistable generators may be u...