一个具有非线性接触率和种群动力学的传染病模型

本文研究了具有非线性接触率和易感类中具有Ｌｏｇｉｓｔｉｃ增长的ＳＩ传染病模型的正不变集，平衡位置以及平衡位置的稳定性。     

具有非线性接触率和时滞的SIRS流行病模型

本文研究了具有非线性接触率βＩ＾ｐｓ／１＋αＩ＾ｑ和恢复类中具有分布时滞的ＳＩＲＳ流行病模型的解的存在性和连续性,正不变集,平衡位置以及平衡位置的稳定性。     

异常情况时的Liapunov-Kozlov法

Kozlov将Liapunov第一方法推广到非线性力学系统,用来研究保守力和耗散力场中,运动力学系统平衡位置的不稳定性.在平衡位置分析惯性张量的异常,或者Rayleigh耗散函数系数矩阵的异常.在稳定性分析中,实际上不可能应用Liapunov逼近法,因为平衡位置的存在条件,和运动微分方程解的唯一性条件,均无法得到满足.Kozlov的广义Liapunov第一方法,不仅适用上面提及的条件,此外,还知道同样的代数表达式得到满足.给出了3个关于平衡位置的不稳定性定理.用一个例子,举例说明了得到的结果.     

一类非完整系统的Lagrange定理及其应用

本文研究一类非完整系统平衡位置流形的稳定性问题·利用Ляпунов直接法和稳定性定义将完整系统的Ｌａｇｒａｎｇｅ定理推广到一类非完整保守系统与耗散系统，并对该类非完整系统平衡位置流形的渐近稳定性与耗散力间的关系作了新的表述，最后举例说明定理的应用·     

亚正定阵在Gilpin-Ayala系统稳定性中的应用

Gilpin-Ayala系统在正的平衡位置的稳定性历来是人们关注的重要问题,许多文献都对此进行过较为深入的研究,并且建立了判定该系统在正的平衡位置稳定的若干新方法.将亚正定阵引入到Gilpin-Ayala系统,获得了判定其稳定、渐近稳定的另一些新方法.     

关于捕食者种群具有阶段结构和疾病的捕食-被捕食模型(英文)

本文研究了捕食者种群具有阶段结构和疾病的捕食-被捕食模型.利用比较定理、分析特征方程和迭代的技巧,得到了模型永久持续生存和模型的非负平衡位置稳定的充分性条件.通过对结果的分析我们可以给出疾病的基本再生数,这对疾病的防治有很大的意义.     

细胞神经网络的数学理论(Ⅰ)

重新系统地研究了细胞神经网络的数学理论,涉及该网络的耗散性、平衡位置的数目及表示、平衡态的全局稳定性等。     

非线性约束下非完整系统的平衡稳定性

Kozlov将Liapunov第一方法推广到非线性力学系统,用来解决保守和耗散力场中,运动力学系统平衡位置的不稳定性.文中讨论的系统运动限于理想的非线性非完整约束.将势能和约束函数展开为Maclaurin级数,对其第一非平凡多项式的阶,确定了相互间关系的5种情况,并对生成的非线性非完整约束方程进行了分析.将3种线性齐次约束下的非完整系统平衡位置的不稳定定理(Kozlov,1986),推广到非线性非完整约束.另外两种情况下的新定理,也是将Kozlov(1994)的结果,拓展到非线性约束下的非完整系统.     

关于非线性系统的非常稳定性及其应用

本文将C.V.Pao研究Liapunov稳定性的内积法改进、推广和发展,研究了非线性系统的非常稳定性、平衡位置的存在唯一性和Liapunov稳定性.将主要结果直接应用到非线性周期系统的稳态振荡的判定.     

一个环境数学模型的一致持久性与稳定性

本文研究一个生态环境数学模型当系统存在正平衡态时,通过利用Hale-Waltman关于一致持久的定理,得到了系统的一致持久性.也证明了当caμ相似文献   

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

Existence and uniqueness of the solution for the bidomain model used in cardiac electrophysiology

We study the well-posedness of the bidomain model that is commonly used to simulate electrophysiological wave propagation in the heart. We base our analysis on a formulation of the bidomain model as a system of coupled parabolic and elliptic PDEs for two potentials and ODEs representing the ionic activity. We first reformulate the parabolic and elliptic PDEs into a single parabolic PDE by the introduction of a bidomain operator. We properly define and analyze this operator, basically a non-differential and non-local operator. We then present a proof of existence, uniqueness and regularity of a local solution in time through a semigroup approach, but that applies to fairly general ionic models. The bidomain model is next reformulated as a parabolic variational problem, through the introduction of a bidomain bilinear form. A proof of existence and uniqueness of a global solution in time is obtained using a compactness argument, this time for an ionic model reading as a single ODE but including polynomial nonlinearities. Finally, the hypothesis behind the existence of that global solution are verified for three commonly used ionic models, namely the FitzHugh–Nagumo, Aliev–Panfilov and MacCulloch models.     

A coupled system of ODEs and quasilinear hyperbolic PDEs arising in a multiscale blood flow model

We study a coupled system of ordinary differential equations and quasilinear hyperbolic partial differential equations that models a blood circulatory system in the human body. The mathematical system is a multiscale model in which a part of the system, where the flow can be regarded as Newtonian and homogeneous, and the vessels are long and large, is modeled by a set of hyperbolic PDEs in a one-spatial-dimensional network, and in the other part, where either vessels are too thin or the flow pattern is too complicated (such as in the heart), the flow is modeled as a lumped element by a set of ordinary differential equations as an analog of an electric circuit. The mathematical system consists of pairs of PDEs, one pair for each vessel, coupled at each junction through a system of ODEs. This model is a generalization of the widely studied models of arterial networks. We give a proof of the well-posedness of the initial-boundary value problem by showing that the classical solution exists, is unique, and depends continuously on initial, boundary and forcing functions and their derivatives.     

Mean-variance optimization problems for an accumulation phase in a defined benefit plan

In this paper we deal with contribution rate and asset allocation strategies in a pre-retirement accumulation phase. We consider a single cohort of workers and investigate a retirement plan of a defined benefit type in which an accumulated fund is converted into a life annuity. Due to the random evolution of a mortality intensity, the future price of an annuity, and as a result, the liability of the fund, is uncertain. A manager has control over a contribution rate and an investment strategy and is concerned with covering the random claim. We consider two mean-variance optimization problems, which are quadratic control problems with an additional constraint on the expected value of the terminal surplus of the fund. This functional objectives can be related to the well-established financial theory of claim hedging. The financial market consists of a risk-free asset with a constant force of interest and a risky asset whose price is driven by a Lévy noise, whereas the evolution of a mortality intensity is described by a stochastic differential equation driven by a Brownian motion. Techniques from the stochastic control theory are applied in order to find optimal strategies.     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

CONSENSUS ANALYSIS AND DESIGN OF LINEAR INTERCONNECTED MULTI-AGENT SYSTEMS

We deal with the state consensus problem of a general Linear Interconnected Multi-Agent System(LIMAS) under a time-invariant and directed communication topology.Firstly,we propose a linear consensus protocol in a general form,which consists of state feedback of the agent itself and feedback form of the relative states between the agent and its neighbors.Secondly,a state-linear-transformation is applied to equivalently transform the state consensus problem into a partial stability problem.Based on the partial stability theory,we derive a sufficient and necessary criterion of consensus convergence,which is expressed via the Hurwitz stability of a real matrix constructed from the parameters of the agent models and the protocols,and present an analytical formula of the consensus function.Lastly,we propose a design procedure of the gain matrices in the protocol by solving a bilinear matrix inequality.     

Partnership formation based on multiple traits

A model of partnership formation based on two traits, called beauty and character, is presented. There are two classes of individual and partners must be of different classes. Individuals prefer prospective partners with a high beauty measure and of a similar character. This problem may be interpreted as e.g. a job search problem in which the classes are employer and employee, or a mate choice problem in which the classes are male and female. Beauty can be observed instantly. However, a costly date (or interview) is required to observe the character of a prospective partner. On observing the beauty of a prospective partner, an individual decides whether he/she wishes to date. During a date, the participants observe each other’s character and then decide whether to form a pair. Mutual acceptance is required both for a date to occur and pair formation. On finding a partner, an individual stops searching. Beauty has a continuous distribution on a finite interval, while character ‘forms a circle’ and has a uniform distribution. Criteria based on the concept of a subgame perfect Nash equilibrium are used to define a symmetric equilibrium of this game. It is argued that this equilibrium is unique. When dating costs are high, this equilibrium is a block separating equilibrium as in more classical formulations of two-sided job search problems. However, for sufficiently small dating costs the form of this equilibrium is essentially different.