随机环境中双移民生灭过程的极限性质

引入了随机环境中双移民生灭过程的概念，定义了过程的模态指示函数，在此基础上研究了其转移矩阵的平稳分布，给出了平稳分布众数的位置与模态指示函数之间的关系．研究了平稳分布的众数与边界关系．     

Reductions of interval noncooperative games

Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered.     

Mechanistic Insights into the Reversible Formation of Iodosylarene–Iron Porphyrin Complexes in the Reactions of Oxoiron(IV) Porphyrin π‐Cation Radicals and Iodoarenes: Equilibrium,Epoxidizing Intermediate,and Oxygen Exchange

We have shown previously that iodosylbenzene–iron(III ) porphyrin intermediates ( 2 ) are generated in the reactions of oxoiron(IV ) porphyrin π‐cation radicals ( 1 ) and iodobenzene (PhI), that 1 and 2 are at equilibrium in the presence of PhI, and that the epoxidation of olefins by 2 affords high yields of epoxide products. In the present work, we report detailed mechanistic studies on the nature of the equilibrium between 1 and 2 in the presence of iodoarenes (ArI), the determination of reactive species responsible for olefin epoxidation when two intermediates (i.e., 1 and 2 ) are present in a reaction solution, and the fast oxygen exchange between 1 and H₂¹⁸O in the presence of ArI. In the first part, we have provided strong evidence that 1 and 2 are indeed at equilibrium and that the equilibrium is controlled by factors such as the electronic nature of iron porphyrins, the electron richness of ArI, and the concentration of ArI. Secondly, we have demonstrated that 1 is the sole active oxidant in olefin epoxidation when 1 and 2 are present concurrently in a reaction solution. Finally, we have shown that the presence of ArI in a reaction solution containing 1 and H₂¹⁸O facilitates the oxygen exchange between the oxo group of 1 and H₂¹⁸O and that the oxygen exchange is markedly influenced by factors such as ArI incubation time, the amounts of ArI and H₂¹⁸O used, and the electronic nature of ArI. The latter results are rationalized by the formation of an undetectable amount of 2 from the reaction of 1 and ArI through equilibrium that leads to a fast oxygen exchange between 2 and H₂¹⁸O.     

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.     

基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

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

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

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

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.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

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.