We present the Cauchy-Maruyama (CM) approximation scheme and establish the existence theory of stochastic functional differential equations driven by G-Brownian motion (G-SFDEs). Several useful properties of Cauchy-Maruyama (CM) approximate solutions $X^k$ of G-SFDEs are given. We show that the unique solution of G-SFDEs gets convergence from Cauchy-Maruyama (CM) approximate solutions. The existence theorem for G-SFDEs is developed with the above mentioned scheme.

The wireless mesh network (WMN) is an emerging and cost-effective alternative paradigm for the next generation wireless networks in many diverse applications. In the performance evaluation of routing protocol for the WMN, it is essential that it should be evaluated under realistic conditions. The usefulness of specific mobility protocol can be determined by selection of mobility model. This paper introduces a coloured Petri nets (CP-nets) based formal model for implementation, simulation, and analysis of most widely used random waypoint (RWP) mobility model for WMNs. The formal semantics of hierarchical timed CP-nets allow us to investigate the terminating behavior of the transitions using state space analysis techniques. The proposed implementation improves the RWP mobility model by removing the “border effect” and resolves the “speed decay” problem.

A higher order compact difference (HOC) scheme with uniform mesh sizes in different coordinate directions is employed to discretize a two- and three-dimensional Helmholtz equation. In case of two dimension, the stencil is of 9 points while in three-dimensional case, the scheme has 27 points and has fourth- to fifth-order accuracy. Multigrid method using Gauss-Seidel relaxation is designed to solve the resulting sparse linear systems. Numerical experiments were conducted to test the accuracy of the sixth-order compact difference scheme with Multigrid method and to compare it with the standard second-order finite-difference scheme and fourth-order compact difference scheme. Performance of the scheme is tested through numerical examples. Accuracy and efficiency of the new scheme are established by using the errors norms $l_2$.

Logo recognition is an important issue in document image, advertisement, and intelligent transportation. Although there are many approaches to study logos in these fields, logo recognition is an essential subprocess. Among the methods of logo recognition, the descriptor is very vital. The results of moments as powerful descriptors were not discussed before in terms of logo recognition. So it is unclear which moments are more appropriate to recognize which kind of logos. In this paper we find out the relations between logos with different transforms and moments, which moments are fit for logos with different transforms. The open datasets are employed from the University of Maryland. The comparisons based on moments are carried out from the aspects of logos with noise, and rotation, scaling, rotation and scaling.

Evolution problem is now a hot topic in the mathematical biology field. This paper investigates the adaptive evolution of pathogen virulence in a susceptible-infected (SI) model under drug treatment. We explore the evolution of a continuous trait, virulence of a pathogen, and consider virulence-dependent cure rate (recovery rate) that dramatically affects the outcome of evolution. With the methods of critical function analysis and adaptive dynamics, we identify the evolutionary conditions for continuously stable strategies, evolutionary repellers, and evolutionary branching points. First, the results show that a high-intensity strength drug treatment can result in evolutionary branching and the evolution of pathogen strains will tend towards a higher virulence with the increase of the strength of the treatment. Second, we use the critical function analysis to investigate the evolution of virulence-related traits and show that evolutionary outcomes strongly depend on the shape of the trade-off between virulence and transmission. Third, after evolutionary branching, the two infective species will evolve to an evolutionarily stable dimorphism at which they can continue to coexist, and no further branching is possible, which is independent of the cure rate function.

In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruence $\text{m}\text{o}\text{d}\hspace{0.17em}p$ to polynomial congruence $\text{m}\text{o}\text{d}\hspace{0.17em}{p}^k$. For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the form $a{x}^n\equiv b(\text{m}\text{o}\text{d}\hspace{0.17em}{p}^k)$, $k\ge \mathrm{1,}$ where $a,\mathrm{b,}$ and $n>0$ are integers which are not divisible by an odd prime $p$. It is shown that the algorithms suggested in this paper drastically reduce the complexity for such computations to a logarithmic scale. The efficacy of the proposed technique for solving negative exponent equations of the form $a{x}^{-n}\equiv b(\text{m}\text{o}\text{d}\hspace{0.17em}{p}^k)$ has also been addressed.