双层Lengyel-Epstein模型不同耦合形式下的图灵斑图

采用双层Lengyel-Epstein模型研究了2个子系统在不同耦合形式下斑图的形成机制。研究3种不同波数比的条件下,耦合形式和耦合强度对斑图的形成的重要作用。当波数比为1时,2个子系统会出现相同的简单斑图(如简单六边形、四边形和条纹斑图),耦合形式和耦合系数的改变未对斑图的形成产生影响;当波数比大于1时,短波系统出现种类丰富的复杂斑图。由于图灵模间发生共振耦合:线性耦合系统出现白眼超六边和类蜂窝斑图,非线性耦合系统选择环状超六边和白眼等复杂超点阵斑图。另外,2种耦合形式图灵模产生共振所需的耦合强度不同。     

Turing and Hopf Bifurcation in a Diffusive Tumor-immune Model

In order to understand the effect of the diffusion reaction on the interaction between tumor cells and immune cells, we establish a tumor-immune reaction diffusion model with homogeneous Neumann boundary conditions. Firstly, we investigate the existence condition and the stability condition of the coexistence equilibrium solution. Secondly, we obtain the sufficient and necessary conditions for the occurrence of Turing bifurcation and Hopf bifurcation. Thirdly, we perform some numerical simulations to illustrate the complex spatiotemporal patterns near the bifurcation curves. Finally, we explain spatiotemporal patterns in the diffusion action of tumor cells and immune cells.     

Computational examples of reaction–convection–diffusion equations solution under the influence of fluid flow: First example

This paper presents several numerical tests on reaction–diffusion equations in the Turing space, affected by convective fields present in incompressible flows under the Schnakenberg reaction mechanism. The tests are performed in 2D on square unit, to which we impose an advective field from the solution of the problem of the flow in a cavity. The model developed consists of a decoupled system of equations of reaction–advection–diffusion, along with the Navier–Stokes equations of incompressible flow, which is solved simultaneously using the finite element method. The results show that the pattern generated by the concentrations of the reacting system varies both in time and space due to the effect exerted by the advective field.     

Splitting in 2-computably enumerable degrees with avoiding cones

In this paper we show that for any pair of properly 2-c. e. degrees 0 < d < a such that there are no c. e. degrees between d and a, the degree a is splittable in the class of 2-c. e. degrees avoiding the upper cone of d. We also study the possibility to characterize such an isolation in terms of splitting.     

Turing oracle machines, online computing, and three displacements in computability theory

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines (a-machines). To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine (o-machine) and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form.A number of topics arose from Turing functionals including continuous functionals on Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14.     

The influence of domain interpretations on computational models

Computational models are usually defined over specific domains. For example, Turing machines are defined over strings, and the recursive functions over the natural numbers. Nevertheless, one often uses one computational model to compute functions over another domain, in which case, one is obliged to employ a representation, mapping elements of one domain into the other. For instance, Turing machines (or modern computers) are understood as computing numerical functions, by interpreting strings as numbers, via a binary or decimal representation, say.We ask: Is the choice of the domain interpretation important? Clearly, complexity is influenced, but does the representation also affect computability? Can it be that the same model computes strictly more functions via one representation than another? We show that the answer is “yes”, and further analyze the influence of domain interpretation on the extensionality of computational models (that is, on the set of functions computed by the model).We introduce the notion of interpretation-completeness for computational models that are basically unaffected by the choice of domain interpretation, and prove that Turing machines and the recursive functions are interpretation-complete, while two-counter machines are incomplete. We continue by examining issues based on model extensionality that are influenced by the domain interpretation. We suggest a notion for comparing computational power of models operating over arbitrary domains, as well as an interpretation of the Church-Turing Thesis over arbitrary domains.     

一类具有H(o)lling-Ⅲ型捕食模型的Turing不稳定现象

对建立在生态学基础上的一类具有H(o)lling-Ⅲ型功能性响应函数的捕食常微分模型及其对应的偏微分模型,用线性化结合谱分析给出了常微分系统稳定的条件,在此基础上给出偏微分系统不稳定的条件,从而得到Turing不稳定现象.     

Analysis of Dynamic Properties of Forest Beetle Outbreak Model

This paper mainly studies the dynamic properties of the forest beetle outbreak model. The existence of the positive equilibrium point and the local stability of the positive equilibrium point of the system are analyzed, and the relevant conclusions are drawn. After that, the existence of Turing instability, Hopf bifurcation and Turing-Hopf bifurcation are discussed respectively, and the necessary conditions for existence are given. Finally, the normal form of the Turing-Hopf point is calculated, and some dynamic properties at the point are analyzed by numerical simulation.     

Stability and Bifurcation Analysis in a Nonlocal Diffusive Predator-prey Model with Hunting Cooperation

In this paper, we propose a diffusive predator-prey model with hunting cooperation and nonlocal competition. Under a rather general selection of the kernel function, we first study the stability of the positive equilibrium of the model. Then, we obtain the conditions which Hopf bifurcation and Turing bifurcation occur. Our results show that nonlocal competition plays an important role in determining the dynamics of the model.     

Dynamical Property Analysis of a Delayed Diffusive Predator-prey Model with Fear Effect

In this paper, we study a delayed diffusive predator-prey model with fear effect and Holling II functional response. The stability of the positive equilibrium is investigated. We find that time delay can destabilize the stable equilibrium and induce Hopf bifurcation. Diffusion may lead to Turing instability and inhomogeneous periodic solutions. Through the theory of center manifold and normal form, some detailed formulas for determining the of Hopf bifurcation are presented. Some numerical simulations are also provided.