Functional sample path properties of subsequence's C-R increments for a Wiener process in Hlder norm

In this paper, with the aid of large deviation formulas established in strong topology of functional space generated by H¨older norm, we discuss the functional sample path properties of subsequence's C-R increments for a Wiener process in H¨older normThe obtained results,generalize the corresponding results of Chen and the classic Strassen's law of iterated logarithm for a Wiener process.     

复合函数极限的应用

利用复合函数极限的运算法则给出收敛数列与其子列的关系、海涅定理以及数列重排的另一种证明,把三个重要的定理归结为复合函数极限的应用,将大学数学里三个重要但理解起来相对困难的定理纳入统一简单的框架.     

模糊值二人零和对策的Nash均衡策略

我们将在Ramik定义的模糊最大序关系基础上研究模糊环境中的二人零和对策。在非对称模糊数基础上,引入模糊环境中的几种Nash均衡策略,讨论各种均衡策略存在的充要条件。并引入含参变量确定性矩阵对策及其均衡策略的概念,讨论含参变量确定性矩阵对策的Nash均衡策略和模糊值矩阵对策的均衡策略的关系。     

Restricted signed permutations counted by the Schröder numbers

Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displaying isomorphisms with the classical Schröder generating tree, and one by giving an isomorphism with a new Schröder generating tree. When combined with a result of Egge and a computer search, this completes the classification of restricted signed permutations counted by the large Schröder numbers in which the set of restrictions consists of two patterns of length 2 and two of length 3.     

Two-dimensional pursuit-evasion game with penalty on turning rates

An approach, both analytical and numerical, is used to solve a two-dimensional pursuit-evasion game characterized by a difficulty level intermediate between that of thesimple motion game (with freely and instantaneously oriented velocities) and that of thegame of two cars (with lower bounds on curvature radii). Each player's velocity has a constant modulus. The maneuvers are penalized by introducing, in the performance index, an integral term for the squared velocity turning rate.The local problem solution is relatively easy to find: the equations of motion and the adjoint equations can be integrated by means of elliptic functions and integrals. The global problem is more delicate to solve, because of the existence of a dispersal singular surface requiring an important numerical search to be determined. Thesynthesis problem (how to express the optimal strategies as functions of state) is not explicitly solvable, but a numerical approach using successive approximations can be developed. Illustrative interception trajectories are given.The authors are grateful to Mr. J. P. Peltier, Head, Guidance Group, Aerospace Mechanics Division, Systems Department, ONERA, Châtillon, France, for his suggestions and his efficient assistance in the numerical aspect of this study.     

On the Law of The Iterated Logarithm for Rapidly Increasing Subsequences

The usual law of the iterated logarithm states that the partial sums S_n of independent and identically distributed random variables can be normalized by the sequence a_n = √nlog log n, such that limsup_n→∞ S_n/a_n = √2 a.s. As has been pointed out by Gut (1986) the law fails if one considers the limsup along subsequences which increase faster than exponentially. In particular, for very rapidly increasing subsequences {n_k≥1} one has limsup_k→∞ S_nk/a_nk = 0 a.s. In these cases the normalizing constants a_nk have to be replaced by √nk log k to obtain a non-trivial limiting behaviour: limsup_k→∞ S_nk/ √nk log k = √2 a.s. We will present an intelligible argument for this structural change and apply it to related results.     

关于Hunt－Yorke猜想的证明

考虑具有ｎ个变时滞的泛函微分方程其中ｑ＿ｉ（ｔ），Ｔ＿ｉ（ｔ）∈Ｃ（［０，＋∞），Ｒ￣＋），ｉ＝１，２，…，ｎ。本文证明了Ｈｕｎｔ－Ｙｏｒｋｅ猜想；同时还得到了在Ｋｗｏｎｇ－Ｐａｔｕｌａ意义下泛函微分方程强振动的充分条件。     

A note on the ‘loser wins’ game

A simple explanation if provided for the ‘loser wins paradox’ and properties of the corresponding game are explored.     

An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample

Given a sequence of n independent random variables with common continuous distribution, we propose a simple adaptive online policy that selects a monotone increasing subsequence. We show that the expected number of monotone increasing selections made by such a policy is within of optimal. Our construction provides a direct and natural way for proving the ‐optimality gap. An earlier proof of the same result made crucial use of a key inequality of Bruss and Delbaen [5] and of de‐Poissonization.