scholarly journals Dynamic Modeling and Analysis of the Email Virus Propagation

2012 ◽  
Vol 2012 ◽  
pp. 1-22 ◽  
Author(s):  
Yihong Li ◽  
Jinxiao Pan ◽  
Zhen Jin
Keyword(s):  
Communication Networks ◽  
Optimization Problem ◽  
Virus Propagation ◽  
Modeling And Analysis ◽  
Lmi Optimization ◽  
Effective Strategies ◽  
Bistable Phenomenon ◽  
Dynamical Features ◽  
Parameter Values ◽  
Theoretical Results

A novel deterministic SEIS model for the transmission of email viruses in growing communication networks is formulated. Interestingly, the model is different from classical SEIS models not only in the form, but also in the dynamical features. We study the equilibria and their stability and analyse the bifurcation dynamics of the model. In particular, we find that the virus-free equilibrium is locally asymptotically stable for any parameter values, which may attribute to the absence of the basic reproduction number. It is shown that the model undergoes a saddle-node bifurcation and admits the bistable phenomenon. Moreover, on the basis of the Lyapunov function, the domains of attraction of equilibria are estimated by solving an LMI optimization problem. Based on the above theoretical results, some effective strategies are also provided to control the propagation of the email viruses. Additionally, our results are confirmed by numerical simulations.

scholarly journals Global Bifurcation of a Novel Computer Virus Propagation Model

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Jianguo Ren ◽  
Yonghong Xu ◽  
Jiming Liu
Keyword(s):  
Global Bifurcation ◽  
Computer Virus ◽  
Propagation Model ◽  
Virus Spread ◽  
Virus Propagation ◽  
Virus Prevalence ◽  
Parameter Values ◽  
First Time ◽  
Computer Virus Propagation Model ◽  
Theoretical Results

In a recent paper by J. Ren et al. (2012), a novel computer virus propagation model under the effect of the antivirus ability in a real network is established. The analysis there only partially uncovers the dynamics behaviors of virus spread over the network in the case where around bifurcation is local. In the present paper, by mathematical analysis, it is further shown that, under appropriate parameter values, the model may undergo a global B-T bifurcation, and the curves of saddle-node bifurcation, Hopf bifurcation, and homoclinic bifurcation are obtained to illustrate the qualitative behaviors of virus propagation. On this basis, a collection of policies is recommended to prohibit the virus prevalence. To our knowledge, this is the first time the global bifurcation has been explored for the computer virus propagation. Theoretical results and corresponding suggestions may help us suppress or eliminate virus propagation in the network.

Symmetry-breaking bifurcations in resonant surface waves

1989 ◽  
Vol 199 ◽  
pp. 495-518 ◽  
Author(s):  
Z. C. Feng ◽  
P. R. Sethna
Keyword(s):  
Normal Form ◽  
Symmetry Breaking ◽  
Surface Waves ◽  
Bifurcation Analysis ◽  
Internal Resonance ◽  
Travelling Waves ◽  
Chaotic Behaviour ◽  
Derived Set ◽  
Parameter Values ◽  
Theoretical Results

Surface waves in a nearly square container subjected to vertical oscillations are studied. The theoretical results are based on the analysis of a derived set of normal form equations, which represent perturbations of systems with 1:1 internal resonance and with D4 symmetry. Bifurcation analysis of these equations shows that the system is capable of periodic and quasi-periodic standing as well as travelling waves. The analysis also identifies parameter values at which chaotic behaviour is to be expected. The theoretical results are verified with the aid of some experiments.

scholarly journals Entropy Balancing is Doubly Robust

2016 ◽  
Vol 5 (1) ◽  
Author(s):  
Qingyuan Zhao ◽  
Daniel Percival
Keyword(s):  
Propensity Score ◽  
Observational Studies ◽  
Optimization Problem ◽  
Entropy Maximization ◽  
Entropy Balancing ◽  
Covariate Balance ◽  
Original Proposal ◽  
Variance Bound ◽  
Doubly Robust ◽  
Theoretical Results

AbstractCovariate balance is a conventional key diagnostic for methods estimating causal effects from observational studies. Recently, there is an emerging interest in directly incorporating covariate balance in the estimation. We study a recently proposed entropy maximization method called Entropy Balancing (EB), which exactly matches the covariate moments for the different experimental groups in its optimization problem. We show EB is doubly robust with respect to linear outcome regression and logistic propensity score regression, and it reaches the asymptotic semiparametric variance bound when both regressions are correctly specified. This is surprising to us because there is no attempt to model the outcome or the treatment assignment in the original proposal of EB. Our theoretical results and simulations suggest that EB is a very appealing alternative to the conventional weighting estimators that estimate the propensity score by maximum likelihood.

The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids

2020 ◽  
Vol 20 (01) ◽  
pp. 2050004
Author(s):  
LAN LIN ◽  
YIXUN LIN
Keyword(s):  
Communication Networks ◽  
Spanning Tree ◽  
Optimization Problem ◽  
Maximum Distance ◽  
Np Hard ◽  
Graph Invariant ◽  
Minimum Value ◽  
Higher Dimensional ◽  
Hamming Graphs

The minimum stretch spanning tree problem for a graph G is to find a spanning tree T of G such that the maximum distance in T between two adjacent vertices is minimized. The minimum value of this optimization problem gives rise to a graph invariant σ(G), called the tree-stretch of G. The problem has been proved NP-hard. In this paper we present a general approach to determine the exact values σ(G) for a series of typical graphs arising from communication networks, such as Hamming graphs and higher-dimensional grids (including hypercubes).

scholarly journals Robust Tracking Control of Mobile Robot Formation with Obstacle Avoidance

2007 ◽  
Vol 2007 ◽  
pp. 1-10 ◽  
Author(s):  
Tiantian Yang ◽  
Zhiyuan Liu ◽  
Hong Chen ◽  
Run Pei
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Formation Control ◽  
Optimization Problem ◽  
Reference Trajectory ◽  
Robust Tracking Control ◽  
Wheeled Mobile Robots ◽  
Lmi Optimization ◽  
Control Scheme

We consider the formation control problem of multiple wheeled mobile robots with parametric uncertainties and actuator saturations in the environment with obstacles. First, a nonconvex optimization problem is introduced to generate the collision-free trajectory. If the robots tracking along the reference trajectory find themselves moving close to the obstacles, a new collision-free trajectory is generated automatically by solving the optimization problem. Then, a distributed control scheme is proposed to keep the robots tracking the reference trajectory. For each interacting robot, optimal control problem is generated. And in the framework of LMI optimization, a distributed moving horizon control scheme is formulated as online solving each optimal control problem at each sampling time. Moreover, closed-loop properties inclusive of stability andH∞performance are discussed. Finally, simulation is performed to highlight the effectiveness of the proposed control law.

scholarly journals Modeling and Analysis of Rumor Spreading with Social Reinforcement Mechanism

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Yuan Xu ◽  
Renjie Mei ◽  
Yujie Yang ◽  
Zhengmin Kong
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Diffusion Mechanism ◽  
Practical Significance ◽  
Propagation Mechanism ◽  
Spreading Process ◽  
Rumor Spreading ◽  
Modeling And Analysis ◽  
Reinforcement Mechanism ◽  
Theoretical Results

It is of great practical significance to figure out the propagation mechanism and outbreak condition of rumor spreading on online social networks. In our paper, we propose a multi-state reinforcement diffusion model for rumor spreading, in which the reinforcement mechanism is introduced to depict individual willingness towards rumor spreading. Multiple intermediate states are introduced to characterize the process that an individual's diffusion willingness is enhanced step by step. We study the rumor spreading process with the proposed reinforcement diffusion mechanism on two typical networks. The outbreak thresholds of rumor spreading on both two networks are obtained. Numerical simulations and Monte Carlo simulations are conducted to illustrate the spreading process and verify the correctness of theoretical results. We believe that our work will shed some light on understanding how human sociality affects the rumor spreading on online social networks.

scholarly journals A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1389
Author(s):  
Ricardo Soto ◽  
Broderick Crawford ◽  
Rodrigo Olivares ◽  
César Carrasco ◽  
Eduardo Rodriguez-Tello ◽  
...  
Keyword(s):  
Swarm Intelligence ◽  
Manufacturing Systems ◽  
Manufacturing Industry ◽  
Optimization Problem ◽  
Local Optimum ◽  
Cell Manufacturing ◽  
Intelligence Algorithm ◽  
Autonomous Search ◽  
Parameter Values ◽  
Swarm Intelligence Algorithm

In this paper, we integrate the autonomous search paradigm on a swarm intelligence algorithm in order to incorporate the auto-adjust capability on parameter values during the run. We propose an independent procedure that begins to work when it detects a stagnation in a local optimum, and it can be applied to any population-based algorithms. For that, we employ the autonomous search technique which allows solvers to automatically re-configure its solving parameters for enhancing the process when poor performances are detected. This feature is dramatically crucial when swarm intelligence methods are developed and tested. Finding the best parameter values that generate the best results is known as an optimization problem itself. For that, we evaluate the behavior of the population size to autonomously be adapted and controlled during the solving time according to the requirements of the problem. The proposal is testing on the dolphin echolocation algorithm which is a recent swarm intelligence algorithm based on the dolphin feature to navigate underwater and identify prey. As an optimization problem to solve, we test a machine-part cell formation problem which is a widely used technique for improving production flexibility, efficiency, and cost reduction in the manufacturing industry decomposing a manufacturing plant in a set of clusters called cells. The goal is to design a cell layout in such a way that the need for moving parts from one cell to another is minimized. Using statistical non-parametric tests, we demonstrate that the proposed approach efficiently solves 160 well-known cell manufacturing instances outperforming the classic optimization algorithm as well as other approaches reported in the literature, while keeping excellent robustness levels.

Mathematical Model of Seismoexplosion in Tunnel Surrounding

2015 ◽  
Vol 744-746 ◽  
pp. 1021-1026
Author(s):  
Pavel Svoboda ◽  
Alexander N. Kravtsov
Keyword(s):  
Communication Networks ◽  
Laminated Composite ◽  
Critical Infrastructures ◽  
Material Damage ◽  
Composite Cylinder ◽  
Underground Structures ◽  
Governing Equations ◽  
Modeling And Analysis ◽  
Structure Damage ◽  
Hydromechanical Process

The construction of objects of critical infrastructures such as a new roads, utility tunnels, communication networks, underground parks and other structures is associated by the way with generation of vibrations in the vicinity of the underground structures, and not only human lives can be lost but also extensive material damage can be expected due to technological and natural hazards based on vibrations. This paper presents the general governing equations for coupled thermo-hydromechanical process in the tunnel surrounds. Modeling and analysis of laminated composite cylinder applied for the objective analysis of shock wave propagation in the soils and possibilities to estimates of the tunnel structure damage.

Modeling and Analysis of Zone-Based Registration in Mobile Communication Network by Considering Busy-Line Effect and Implicit Registration

2016 ◽  
Vol 33 (04) ◽  
pp. 1650024 ◽  
Author(s):  
Jong Hun Park ◽  
Jihee Jung ◽  
Janghyun Baek
Keyword(s):  
Mathematical Modeling ◽  
Communication Networks ◽  
Mobile Communication ◽  
Modeling And Analysis ◽  
Network Database ◽  
Incoming Call ◽  
Mobile Communication Networks ◽  
And Performance ◽  
Current Zone ◽  
Paging Cost

In this study, we consider zone-based registration (ZBR) in mobile communication networks. In ZBR, when a mobile moves to a new zone, it registers its zone to the network database to keep the mobile’s current zone, and to connect an incoming call to the mobile when it is generated. A mobile can store one zone, or more than one zones. Among various types of ZBR, we focus on two-zone-based registration (TZR), which is known to have good performance. In TZR, a mobile can store two zones that it has recently registered, and does not register when it crosses either zone that it has already kept. In general, in TZR, a mobile registers its zone less often than in single-zone-based registration (SZR). However, TZR increases the paging cost, because the network may not know the exact zone where the mobile is. Mathematical modeling and performance analysis are performed to obtain the exact performance of SZR and TZR, by considering the busy-line effect and implicit registration effect of outgoing calls from a mobile. From numerical results for various circumstances, it is shown that TZR is superior to SZR in most cases.

Sign in / Sign up

Export Citation Format

Share Document