Dissipativity of Fractional Navier–Stokes Equations with Variable Delay

We use classical Galerkin approximations, the generalized Aubin–Lions Lemma as well as the Bellman–Gronwall Lemma to study the asymptotical behavior of a two-dimensional fractional Navier–Stokes equation with variable delay. By modifying the fractional Halanay inequality and the comparison principle, we investigate the dissipativity of the corresponding system, namely, we obtain the existence of global absorbing set. Besides, some available results are improved in this work. The existence of a global attracting set is still an open problem.

The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network

We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).

On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks

In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed 319/15k3+116/5k2+29/5kopt+29/3k3+116/5k2+87/5k+13/15, where opt is the size of an MCDAS and k denotes the ratio of rmax to rmin in the ad hoc network with transmission range rmin,rmax. Our simulations show the feasibility of the algorithm proposed in this paper.

The Cocycle for the Non-autonomous Stochastic Damped Wave Equations with White Noises

This paper is devoted to the cocycle of solutions of the non-autonomous stochastic damped wave equations with multiplicative white noises defined on unbounded domains. And we obtain the existence of a pullback absorbing set of the cocycle in a certain parameter region.

Pullback Absorbing Set for the Stochastic Lattice Selkov Equations

Aims/ Objectives: To prove the existence of a pullback Absorbing set.Study Design: Ornstein-Uhlenbeck process.Place and Duration of Study: College of Management, Shanghai University of Engineering Science.Methodology: A transformation of addition involved with an Ornstein-Uhlenbeck process is used.Results: In this paper, pullback absorbing property for the stochastic reversible Selkov system in an innite lattice with additive noises is proved.

Geometry of balanced and absorbing subsets of topological modules

We define the concepts of balanced set and absorbing set in modules over topological rings, which coincide with the usual concepts when restricting to topological vector spaces. We show that in a topological module over an absolute semi-valued ring whose invertibles approach [Formula: see text], every neighborhood of [Formula: see text] is absorbing. We also introduce the concept of total closed unit neighborhood of zero (total closed unit) and prove that the only total closed unit of the quaternions [Formula: see text] is its closed unit ball [Formula: see text]. On the other hand, we also prove that if [Formula: see text] is an absolute semi-valued unital real algebra, then its closed unit ball [Formula: see text] is a total closed unit. Finally, we study the geometry of modules via the extreme points and the internal points, showing that no internal point can be an extreme point and that absorbance is equivalent to having [Formula: see text] as an internal point.