Mathematical modelling is of interest to study the dynamics of coronavirus disease 2019 (COVID-19), and models such as SEIR (Susceptible-Exposed-Infected-Recovered) have been considered. This article describes the development of a compartmental transmission network model - Susceptible-Exposed-Quarantine-Infectious-Infectious, undetected-Infectious, home-based care-Hospitalized-Vaccinated-Recovered-Dead - to simulate the dynamics of COVID-19 in order to account for specific measures put into place by the Government of Rwanda to prevent further spread of the disease. The compartments of this model are connected by parameters, some of which are known from the literature, and others are estimated from available data using the least squares method. For the stability of the model, equilibrium points were determined and the basic reproduction number was studied; R0 is an indicator for contagiousness. The model showed that secondary infections are generated from the exposed group, the asymptomatic group, the infected (symptomatic) group, the infected (undetected) group, the infected (home-based care) group and the hospitalized group. The formulated model was reliable and fit the data. Furthermore, the estimated of 2.16 shows that COVID-19 will persist without the application of control measures. This article presents results regarding predicted spread of COVID-19 in Rwanda.
Due to the multi-technology advancements, internet of things (IoT) applications are in high demand to create smarter environments. Smart objects communicate by exchanging many messages, and this creates interference on receivers. Collection tree algorithms are applied to only reduce the nodes/paths’ interference but cannot fully handle the interference across the underlying IoT. This paper models and analyzes the interference spread in the IoT setting, where the collection tree routing algorithm is adopted. Node interference is treated as a real-life contamination of a disease, where individuals can migrate across compartments such as susceptible, attacked and replaced. The assumed typical collection tree routing model is the least interference beaconing algorithm (LIBA), and the dynamics of the interference spread is studied. The underlying network’s nodes are partitioned into groups of nodes which can affect each other and based on the partition property, the susceptible–attacked–replaced (SAR) model is proposed. To analyze the model, the system stability is studied, and the compartmental based trends are experimented in static, stochastic and predictive systems. The results shows that the dynamics of the system are dependent groups and all have points of convergence for static, stochastic and predictive systems.
When classifying an observation using a decision rule, there is always a risk of misclassification. The primary objective of this paper is to calculate the first two moments for the plug-in quadratic classifier applied to growth curves with unknown normal distributions, and to use the moments to estimate the misclassification probability. To approximate the misclassification probability, the derived moments are used in an Edgeworth-type expansion of the density for the quadratic classifier. Simulation results demonstrate that as the distance between the groups increases, the probability of misclassification decreases, highlighting the improved classification accuracy when the groups are more clearly separated. Simulations further show that the Edgeworth-type approximation closely matches the Monte Carlo simulated misclassification probability, and consequently, the true misclassification probability.
Quadratic discriminant analysis is a well-established supervised classification method, which extends the linear the linear discriminant analysis by relaxing the assumption of equal variances across classes. In this study, quadratic discriminant analysis is used to develop a quadratic classification rule based on repeated measurements. We employ a bilinear regression model to assign new observations to predefined populations and approximate the misclassification probability. Through weighted estimators, we estimate unknown mean parameters and derive moments of the quadratic classifier. We then conduct numerical simulations to compare misclassification probabilities using true and estimated mean parameters, as well as probabilities computed through simulation. Our findings suggest that as the distance between groups widens, the misclassification probability curve decreases, indicating that classifying observations is easier in widely separated groups compared to closely clustered ones.