Analysis of a geometric catastrophe model with discrete-time batch renewal arrival process

2020 ◽  
Vol 54 (5) ◽  
pp. 1249-1268
Author(s):  
Nitin Kumar ◽  
Farida P. Barbhuiya ◽  
Umesh C. Gupta

Discrete-time stochastic models have been extensively studied since the past few decades due to its huge application in areas of computer-communication networks and telecommunication systems. However, the growing use of the internet often makes these systems vulnerable to catastrophe/ virus attack leading to the removal of some or all the elements from the system. Taking note of this, we consider a discrete-time model where the population (in the form of packets, data, etc.) is assumed to grow in batches according to renewal process and is likely to be affected by catastrophes which occur according to Bernoulli process. The catastrophes have a sequential impact on the population and it destroys each individual at a time with probability p. This destruction process stops as soon as an individual survives or when the entire population becomes extinct. We analyze both late and early arrival systems independently and using supplementary variable and shift operator methods obtain explicit expressions of steady-state population size distribution at pre-arrival and arbitrary epochs. We deduce some important performance measures and further show that for both the systems the tail probabilities at pre-arrival epoch can be well approximated using a single root of the characteristic equation. In order to illustrate the computational procedure, we present some numerical results and also investigate the change in the behavior of the model with the change in parameter values.

2002 ◽  
Vol 11 (02) ◽  
pp. 187-211
Author(s):  
PETER H. BAUER ◽  
MIHAIL L. SICHITIU ◽  
KAMAL PREMARATNE

This paper introduces a discrete time model for time-variant delays and investigates the very nature of such delays. It is shown that a linear system-delay interface is a system theoretic necessity for the construction of composite linear systems with time-variant delays. Based on this analysis, two interfaces of particular importance are presented and used to obtain new, simple to check stability results for queue control systems. The relevance of the presented modeling and stability results on queue control systems to QoS control in modern communication networks is illustrated via several examples.


Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1709
Author(s):  
Freek Verdonck ◽  
Herwig Bruneel ◽  
Sabine Wittevrongel

In this paper, we consider a discrete-time multiserver queueing system with correlation in the arrival process and in the server availability. Specifically, we are interested in the delay characteristics. The system is assumed to be in one of two different system states, and each state is characterized by its own distributions for the number of arrivals and the number of available servers in a slot. Within a state, these numbers are independent and identically distributed random variables. State changes can only occur at slot boundaries and mark the beginnings and ends of state periods. Each state has its own distribution for its period lengths, expressed in the number of slots. The stochastic process that describes the state changes introduces correlation to the system, e.g., long periods with low arrival intensity can be alternated by short periods with high arrival intensity. Using probability generating functions and the theory of the dominant singularity, we find the tail probabilities of the delay.


Cancers ◽  
2021 ◽  
Vol 13 (13) ◽  
pp. 3106
Author(s):  
Yogesh Kalakoti ◽  
Shashank Yadav ◽  
Durai Sundar

The utility of multi-omics in personalized therapy and cancer survival analysis has been debated and demonstrated extensively in the recent past. Most of the current methods still suffer from data constraints such as high-dimensionality, unexplained interdependence, and subpar integration methods. Here, we propose SurvCNN, an alternative approach to process multi-omics data with robust computer vision architectures, to predict cancer prognosis for Lung Adenocarcinoma patients. Numerical multi-omics data were transformed into their image representations and fed into a Convolutional Neural network with a discrete-time model to predict survival probabilities. The framework also dichotomized patients into risk subgroups based on their survival probabilities over time. SurvCNN was evaluated on multiple performance metrics and outperformed existing methods with a high degree of confidence. Moreover, comprehensive insights into the relative performance of various combinations of omics datasets were probed. Critical biological processes, pathways and cell types identified from downstream processing of differentially expressed genes suggested that the framework could elucidate elements detrimental to a patient’s survival. Such integrative models with high predictive power would have a significant impact and utility in precision oncology.


1990 ◽  
Vol 112 (4) ◽  
pp. 774-781 ◽  
Author(s):  
R. J. Chang

A practical technique to derive a discrete-time linear state estimator for estimating the states of a nonlinearizable stochastic system involving both state-dependent and external noises through a linear noisy measurement system is presented. The present technique for synthesizing a discrete-time linear state estimator is first to construct an equivalent reference linear model for the nonlinearizable system such that the equivalent model will provide the same stationary covariance response as that of the nonlinear system. From the linear continuous model, a discrete-time state estimator can be directly derived from the corresponding discrete-time model. The synthesizing technique and filtering performance are illustrated and simulated by selecting linear, linearizable, and nonlinearizable systems with state-dependent noise.


2009 ◽  
Vol 33 (6) ◽  
pp. 713-732
Author(s):  
Adam Bobrowski ◽  
Marek Kimmel ◽  
Małgorzata Kubalińska

Sign in / Sign up

Export Citation Format

Share Document