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.     

Bayesian Prediction Analysis for Growth Curve Model Using Noninformative Priors

We apply a Bayesian approach to the problem of prediction in an unbalanced growth curve model using noninformative priors. Due to the complexity of the model, no analytic forms of the predictive densities are available. We propose both approximations and a prediction-oriented Metropolis-Hastings sampling algorithm for two types of prediction, namely the prediction of future observations for a new subject and the prediction of future values for a partially observed subject. They are illustrated and compared through real data and simulation studies. Two of the approximations compare favorably with the approximation in Fearn (1975, Biometrika, 62, 89–100) and are very comparable to the more accurate Rao-Blackwellization from Metropolis-Hastings sampling algorithm.     

Single chain force spectroscopy - Reading the sequence of HP protein models

We study the elastic properties of single A/B random copolymer chains, with a specific sequence and use them as theoretical model for so called HP proteins. HP proteins carry hydrophilic (P) and hydrophobic (H) monomers. We predict a rich structure in the force-extension relations which can be attributed to the information in the sequence. The variational method is used to probe local minima on the path of stretching and releasing for the chain molecules. At a given force, we find multiple configurations which are separated by energy barriers. A collapsed globular configuration consists of several domains which unravel cooperatively. Upon stretching, the unfolding path shows a stepwise pattern corresponding to the unfolding of each domain. While releasing, several cores can be created simultaneously in the middle of the chain, resulting in a different path of collapse. The long-range interactions and stiffness of the chain simplify the potential landscape given by the disorder in sequence. Received 5 March 2002 / Received in final form 16 May 2002 Published online 13 August 2002     

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     

Fabrication of patterned gold electrodes with spin-coated-and-fired Au(1 1 1) film by the soft lithography

We prepared high quality Au(1 1 1) film on Si wafer through the spin coating and thermal decomposition of a gold ink, spin-coated-and-fired (SCAF) Au film. The X-ray measurements, XRD and pole-figure analysis, showed that the SCAF Au film has a (1 1 1) out-of-plane orientation with a random in-plane orientation. In order to confirm the chemical activity of the SCAF Au film, we demonstrate the formation of patterned structures with the film by using soft lithography technique. The chemical activities of this physically stable SCAF Au film to the alkanethiols were at least equivalent those of physically deposited the Au films. The possibility of the mass production of micro patterned structure with the SCAF Au film was also demonstrated over the wide region on Si wafer by the microcontact lithography. These suggest that the Au film will help the easy fabrication of various nanosized devices on Si wafer and other substrates.     

An efficient construction of period-2 bulbs in the cubic Mandelbrot set with parametric boundaries

A parametric boundary equation is established for the principal period-2 bulb in the cubic Mandelbrot set. Using its geometry, an efficient escape-time algorithm which reduces the construction time for the period-2 bulbs in the cubic Mandelbrot set is introduced and the implementation graphic results display the fascinating fractal beauty