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.     

Characteristics of transmission of electrons in a quantum wire tangentially attached to a superconductor ring threaded by magnetic flux

We present numerical investigations of the transmission properties of electrons in a normal quantum wire tangentially attached to a superconductor ring threaded by magnetic flux. A point scatterer with a δ -function potential is placed at node to model scattering effect. We find that the transmission characteristics of electrons in this structure strongly depend on the normal or superconducting state of the ring. The transmission probability as a function of the energy of incident electrons, in the case of a superconductor ring threaded by one quantum magnetic flux, emerges one deep dip, imposed upon the first broad bump in spectrum. This intrinsic conductance dip originates from the superconductor state of the ring. When increasing the magnetic flux from one quantum magnetic flux to two, the spectrum shifts toward higher energy region in the whole. This conductance dip accordingly shifts and appears in the second bump. In the presence of a point-scatterer at the node, the spectrum is substantially modified. Based on the condition of the formation of the standing wave functions in the ring and the broken of the time-reserve symmetry of Schr?dinger equation after switching magnetic flux, the characteristics of transmission of electrons in this structure can be well understood. Received 6 November 2001     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

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.      

Developing professional judgement with the aid of a ‘low-profile’ group support system

This paper reports positive results from an application of one type of group support system (GSS) to a training application. Reviews of the findings of other trials of GSS have been mixed, and inconclusive. We describe the results of a series of seven training sessions in a field-based application of group process support. The subjects were professionals working in various agencies concerned with the welfare of older people. A ‘low-profile’ type of group support system, based on wireless handsets, was used. This design enabled responses from each participant to be input and displayed anonymously. Each session was aimed at stimulating a dialogue focused on the reasons for differences of judgement, as displayed on a single projected feedback screen. Changes of individual judgements were recorded for subsequent analysis and comparison with already known ‘expert judgements’. Frequent changes of judgement were recorded. A significant proportion of these were related to an improvement, which could not be explained as simply the result of conforming behaviour. We propose that the mode of operation and design of a ‘low-profile’ GSS have the potential to create a learning environment by reducing personal anxieties while encouraging group-based learning with focussed conversation. We conclude that this type of GSS design is particularly suited to ‘selective’-type tasks in groups.