An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

A Penrose-like inequality for maximal asymptotically flat spin initial data sets

We prove a Penrose-like inequality for the mass of a large class of constant mean curvature (CMC) asymptotically flat n-dimensional spin manifolds which satisfy the dominant energy condition and have a future converging, or past converging compact and connected boundary of non-positive mean curvature and of positive Yamabe invariant. We prove that for every n ≥ 3 the mass is bounded from below by an expression involving the norm of the linear momentum, the volume of the boundary, dimensionless geometric constants and some normalized Sobolev ratio.     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.     

狭缝式高速摄影机胶片的计算机判读

根据狭缝摄影机胶片的成象原理,运用数字图象处理技术,对狭缝式高速摄影机胶片判读工作的计算机化进行研究.应用结果表明,该技术先进实用,极大地提高了判读的精度和效率,将是这种胶片判读技术的发展方向.     

Controlling global stochasticity of Hamiltonian systems by nonlinear perturbation

A method of controlling global stochasticity in Hamiltonian systems by applying nonlinear perturbation is proposed. With the well-known standard map we demonstrate that this control method can convert global stochasticity into regular motion in a wide chaotic region for arbitrary initial condition, in which the control signal remains very weak after a few kicks. The system in which chaos has been controlled approximates to the original Hamiltonian system, and this approach appears robust against small external noise. The mechanism underlying this high control efficiency is intuitively explained. Received 15 January 2002 Published online 6 June 2002     

Improving the Fundamental Theorem of Algebra

Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.