bifurcation analysis of a delayed worm propagation model with saturated incidence

This paper is concerned with a delayed SVEIR worm propagation model with saturated incidence. The main objective is to investigate the effect of the time delay on the model. Sufficient conditions for local stability of the positive equilibrium and existence of a Hopf bifurcation are obtained by choosing the time delay as the bifurcation parameter. Particularly, explicit formulas determining direction of the Hopf bifurcation and stability of the bifurcating periodic solutions are derived by using the normal form theory and the center manifold theorem. Numerical simulations for a set of parameter values are carried out to illustrate the analytical results

Preliminary Study on Air Injection in Annuli to Manage Pressure during Cementing

AbstractAlong with the development of low permeability reservoirs, underbalanced drilling technology is applied more and more widely. During the cementing operation of underbalanced drilling wells, cementing liquid can flow into the reservoir more easily for the absence of the mud cake, which certainly weakens the reservoir protection advantage of underbalanced drilling. Based on the methods of underbalanced drilling and managed pressure drilling, a new method of cement technology, Balanced Pressure Cementing Technology by Air Injection in Annuli, was put forward. The calculation models of the maximum depth of injection point and the maximum start-up pressure were built. Considering the power limitation of the pump, valves of gas lift were introduced and the calculation method of valve location was developed. This technology could effectively control the annulus pressure of wellbore, assure the cementing quality and protect the hydrocarbon reservoir, thus reduces the exploration and development cost

A transcriptomic and epigenomic cell atlas of the mouse primary motor cortex

Single-cell transcriptomics can provide quantitative molecular signatures for large, unbiased samples of the diverse cell types in the brai

Efficient Meta Neural Heuristic for Multi-Objective Combinatorial Optimization

Recently, neural heuristics based on deep reinforcement learning have exhibited promise in solving multi-objective combinatorial optimization problems (MOCOPs). However, they are still struggling to achieve high learning efficiency and solution quality. To tackle this issue, we propose an efficient meta neural heuristic (EMNH), in which a meta-model is first trained and then fine-tuned with a few steps to solve corresponding single-objective subproblems. Specifically, for the training process, a (partial) architecture-shared multi-task model is leveraged to achieve parallel learning for the meta-model, so as to speed up the training; meanwhile, a scaled symmetric sampling method with respect to the weight vectors is designed to stabilize the training. For the fine-tuning process, an efficient hierarchical method is proposed to systematically tackle all the subproblems. Experimental results on the multi-objective traveling salesman problem (MOTSP), multi-objective capacitated vehicle routing problem (MOCVRP), and multi-objective knapsack problem (MOKP) show that, EMNH is able to outperform the state-of-the-art neural heuristics in terms of solution quality and learning efficiency, and yield competitive solutions to the strong traditional heuristics while consuming much shorter time.Comment: Accepted at NeurIPS 202

Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more solutions in the neighborhood of each subproblem, we present a multiple Pareto optima strategy to sample and preserve desirable solutions. Experimental results on classic MOCO problems show that our NHDE is able to generate a Pareto front with higher diversity, thereby achieving superior overall performance. Moreover, our NHDE is generic and can be applied to different neural methods for MOCO.Comment: Accepted at NeurIPS 202

A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-antenna Adversary

Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary's reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to Kullback-Leibler (KL) divergence constraint. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer's power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. In addition, the transmission strategy without jammer deception is studied as a benchmark. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in face of imperfect CSI.Comment: 33 pages, 8 Figure