A mathematical model of the systemic circulatory system with logistically defined nervous system regulatory mechanisms

A mathematical model is developed that accurately describes the pressure, volume and flow dynamics of the systemic circulatory system over the full physiological range of human pressures and volumes. At the heart of this model are mathematical representations for the autonomic and central nervous system reflexes which maintain arterial pressure, cardiac output and cerebral blood flow. These representations involve functions in which a maximum effect and a minimum effect are smoothly connected by a logistic transition. A new approach to modelling the pressure – volume relationship in a vessel with smooth muscle contraction is also presented. To test the model, simulations of cardiac arrest and various haemorrhagic situations were conducted, and predicted results were compared with clinical observations. Near-perfect agreement was obtained between predicted and observed values of the mean circulatory filling pressure, cardiac output and arterial pressure decay in the face of significant haemorrhage, and the critical values delineating progressive from non-progressive hypovolaemic shock.     

The central limit theorem for stationary Markov processes with normal generator—with applications to hypergroups

We extend the central limit theorem for additive functionals of a stationary, ergodic Markov chain with normal transition operator due to Gordin and Lif?ic, 1981 [A remark about a Markov process with normal transition operator, In: Third Vilnius Conference on Probability and Statistics 1, pp. 147–48] to continuous-time Markov processes with normal generators. As examples, we discuss random walks on compact commutative hypergroups as well as certain random walks on non-commutative, compact groups.     

On statistical properties of the lyapunov exponent of the generalized skew tent map

The statistical properties of the Lyapunov exponent of the chaotic generalized skew tent map is studied. Expressions of the mean and the variance of this Lyapunov exponent at each discrete time index are obtained. A sufficient condition for weakly mixing of the chaotic generalized skew tent map is derived, and the asymptotic distribution of its Lyapunov exponent is provided.     

一类具有两个抛物线解的中心对称三次系统存在极限环的条件

本文给出了具有两个抛线解的中心对称三次系统存在在极限环的条件，它可能也是充要条件。     

快递企业航空货运网络的构建

快递业竞争激烈,构建高效合理的航空货运网络是快递企业提高竞争力的重要手段。“枢纽—辐射”式航空货运网络是整合航空快递资源、提高航空快递资源利用效率、提高快递企业竞争力的有效模式。本文以降低航空快递网络成本、加快航空快递处理时间为目标,从航空快递网络枢纽的选取、指派关系的确定、枢纽个数的选择三个方面研究了航空快递网络模型建立问题,选用遗传算法求解不同枢纽个数下航空快递网络的运输成本,并据此进行枢纽的选取,运用重力模型法进行指派关系的确定,在此基础上运用超效率DEA模型确定枢纽个数。接着,以包含17个节点的顺丰航空快递网络的规划为例,对本文所提出的模型和算法进行了验证,验证结果证实了模型的合理性。本文的研究为快递企业构建航空货运网络提供了科学实用的方法,该方法的使用可以降低航空货运成本,提高效率,从而提高快递企业的竞争力。     

һ��ǿ����������ļ��޶����ע��

本文在{ξi}为强混合样本,{ani}是实三角阵列下,得到了一个新的关于线性和n∑i=1aniξi的中心极限定理.并利用该中心极限定理,进一步建立了线性过程部分和的中心极限定理.     

On the Weak Invariance Principle for Stationary Sequences under Projective Criteria

In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables with respect to the distant past. The results contribute to the clarification of the central limit question for stationary sequences. Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the NSA grant H98230-05-1-0066.     

A note on commutators of Hardy operators

Fu and Lu et al. 7 showed that the commutator $mathcal {H}_{beta ,b}$ generated by the fractional Hardy operator and a locally integrable function b is bounded on the homogenous Herz spaces if and only if b is a central bounded mean oscillation function. We show that their result is optimal by giving a counterexample.     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

Euclidean algorithms are Gaussian

We obtain a central limit theorem for a general class of additive parameters (costs, observables) associated to three standard Euclidean algorithms, with optimal speed of convergence. We also provide very precise asymptotic estimates and error terms for the mean and variance of such parameters. For costs that are lattice (including the number of steps), we go further and establish a local limit theorem, with optimal speed of convergence. We view an algorithm as a dynamical system restricted to rational inputs, and combine tools imported from dynamics, such as transfer operators, with various other techniques: Dirichlet series, Perron's formula, quasi-powers theorems, and the saddle-point method. Such dynamical analyses had previously been used to perform the average-case analysis of algorithms. For the present (dynamical) analysis in distribution, we require estimates on transfer operators when a parameter varies along vertical lines in the complex plane. To prove them, we adapt techniques introduced recently by Dolgopyat in the context of continuous-time dynamics (Ann. Math. 147 (1998) 357).