On an Application of Newton's Method to Nonlinear Operators with w-Conditioned Second Derivative

We present a new approach to study the convergence of Newton's method in Banach spaces, which relax the conditions appearing in the usual studies. The approach is based on the bound required for the second derivative of the operator involved. An application to a nonlinear integral equation is presented.     

随机环境中多物种分枝随机游动

引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件.     

Analytical study of a flattened Gaussian beam through multi-apertured optical imaging systems of B = 0

By using the methods of the matrix decomposition and expansion of the hard-edged aperture function into a finite sum of complex Gaussian functions, the recurrence propagation expressions for a flattened Gaussian beam (FGB) through multi-apertured optical imaging systems of B = 0 are derived and illustrated with numerical examples. Comparisons with the straightforward numerical integration of the Collins formula and with the previous work are made. It is shown that the main advantages of our methods and results are the more accuracy and great reduction of computer time.     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

一类随机环境中的随机游动

在Solomn的模型的基础上对一类随机环境中随机游动进行了讨论，并得出了一个常返性准则和一些极限性质。     

半直线上随机环境中的随机游动的常返性

本文讨论半直线上随机环境中的随机游动的常返性。在独立环境下，主要通过强大数定律，找到了非常返和正常返的一个充分条件下，并将这一结果推广到一些特殊情情形。在一般的随机环境下，主要通过数列的有界性，给出了常返与零常返的一个充分条件。     

How likely is Polya's drunkard to stay in x⩾ y⩾z?

In his celebrated paper, Polya has considered the random walk in the three-dimensional (cubic) lattice and showed that the probability of return to the origin is less than 1. Subsequent authors have shown that the probability is %34.053.... Here we consider the same random walk, with the restriction that the drunkard is only allowed to stay inxyz. It is shown that his probability of returning to the originand staying in the allowed region is %6.4844....     

Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.     

The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

Camptothecin@HMSNs/thermosensitive hydrogel composite for applications in preventing local breast cancer recurrence

The CPT was loaded into the HMSNs with the high loading capacity. Then the CPT@HMSNs were loaded into the PLEL thermosensitive hydrogels for local therapy to prevent the recurrence of breast cancer after the tumor was resected.