Ekeland’s principle for vector equilibrium problems

In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains.     

病毒感染群体动力学模型分析

本文构建并讨论了一类病毒感染的群体动力学模型,得到了模型存在轨道稳定周 期解的充分条件,较好地解释了在病毒持续感染者体内观察到的病毒载量波动现象.     

Dynamic Model of R&D,Spillovers, and Efficiency of Bertrand and Cournot Equilibria

Using an infinite-horizon two-player differential game, we derive and compare Bertrand and Cournot equilibria for a differentiated duopoly engaging in the process of R&D competition. The main findings of this study are as follows. First, Bertrand competition is more efficient if either R&D productivity is low or products are very different. Second, Cournot competition is more efficient provided that R&D productivity is high, products are close substitutes, and spillovers are not close to zero. This last result is different from what has been obtained in the literature. Hence, this shows that considering a dynamic model and more general investment costs does have an impact on the efficiency results.     

Parametric multiple sequence alignment and phylogeny construction

Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.     

The Chaotic Mixmaster and the Suppression of Chaos in Scalar–Tensor Cosmologies

We show that there is a threshold in energy for the onset of chaos in cosmology for the Universe described as a dynamical system derived from the Einstein equations of General Relativity (GR). In the case of the mixmaster model (homogeneous and anisotropic cosmology with a Bianchi IX metric), the chaos occurs precisely at the prescribed necessary value H _vac=0 of the GR for the energy of the Universe while the system is found to be regular for H<0 and chaotic for H>0 with respect to its pure vacuum part. In the case of generalized scalar tensor theories within the Bianchi IX model, we show using the ADM formalism and a conformal transformation that the energy of the dynamical system as compared to vacuum lies below the zero energy threshold. The system is thus not exhibiting chaos and the conclusion still holds in the presence of ordinary matter as well. The suppression of chaos occurs in a similar way for stiff matter alone.     

Equilibrium States in the Quadruple–Kerr Solution

The extended quadruple–Kerr metric is used to consider equilibrium states of four collinear Kerr particles. We explain our previous failure to solve numerically the full set of the balance equations, and we derive a self–consistent system of the axis conditions leading to the equilibrium of all four constituents which can be black holes or hyperextreme objects. The equilibrium configurations obtained in this paper exhibit similar features with those occurring in the systems of two Kerr particles, for instance, the balance of four Kerr black holes with positive masses does not seem possible. Equilibrium states of two identical compound Kerr objects are also discussed.     

Optimized prefactored compact schemes

The numerical simulation of aeroacoustic phenomena requires high-order accurate numerical schemes with low dispersion and dissipation errors. In this paper we describe a strategy for developing high-order accurate prefactored compact schemes, requiring very small stencil support. These schemes require fewer boundary stencils and offer simpler boundary condition implementation than existing compact schemes. The prefactorization strategy splits the central implicit schemes into forward and backward biased operators. Using Fourier analysis, we show it is possible to select the coefficients of the biased operators such that their dispersion characteristics match those of the original central compact scheme and their numerical wavenumbers have equal and opposite imaginary components. This ensures that when the forward and backward stencils are added, the original central compact scheme is recovered. To extend the resolution characteristic of the schemes, an optimization strategy is employed in which formal order of accuracy is sacrificed in preference to enhanced resolution characteristics across the range of wavenumbers realizable on a given mesh. The resulting optimized schemes yield improved dispersion characteristics compared to the standard sixth- and eighth-order compact schemes making them more suitable for high-resolution numerical simulations in gas dynamics and computational aeroacoustics. The efficiency, accuracy and convergence characteristics of the new optimized prefactored compact schemes are demonstrated by their application to several test problems.     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

燃煤烟气中As、Se、Pb的形态分布及S、Cl元素对其形态分布的影响

基于化学热力学平衡分析方法，计算分析了燃煤烟气中重金属As、Se、Pb的形态分布规律，研究了S、Cl等元素对As、Se、Pb的形态分布规律的影响。结果表明，氧化性气氛下，As以As₂O₅、As₄O₆、AsO等氧化物的形式存在；Se主要以SeO₂形式存在；Pb在1000 K以下主要是固态PbSO₄，1200 K以上为气态PbO。还原性气氛下，As在较低温度时为固态As₂S₂，900-1400 K以As₂、AsS、AsN气体共存，2000 K以上全部转化为气态AsO。Se在1100 K以下主要以气态H₂Se存在，1100 K开始生成SeS和Se₂气体，1800 K时主要是气态Se和少量气态SeO；Pb在中低温时主要是PbS，1800 K以上气态Pb为主要存在形态。S在还原性气氛下增大了AsS（g）、PbS（g）、SeS（g）的比例，氧化性气氛下对As、Se、Pb形态分布基本无影响；Cl无论在氧化还是还原气氛下对As、Se影响均较小，但对Pb的形态分布影响较大。     

Packing two disks into a polygonal environment

We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on any input, is O(nlogn). This is optimal in the algebraic decision tree model of computation.