The benefits of parenting: Government financial support for families with children since 1975

This commentary describes the changes to the structure of child-contingent support through the tax and benefit system since 1975. It also presents new results, which were produced to quantify explicitly the amount of government support for families with children, using representative samples of families from over the past three decades. With these data, it is possible to examine whether child-contingent support has become more or less progressive, or more or less slanted towards large families, lone-parents families or families with young children

Long-Time Dynamics of Variable Coefficient mKdV Solitary Waves

We study the Korteweg-de Vries-type equation dt u=-dx(dx^2 u+f(u)-B(t,x)u), where B is a small and bounded, slowly varying function and f is a nonlinearity. Many variable coefficient KdV-type equations can be rescaled into this equation. We study the long time behaviour of solutions with initial conditions close to a stable, B=0 solitary wave. We prove that for long time intervals, such solutions have the form of the solitary wave, whose centre and scale evolve according to a certain dynamical law involving the function B(t,x), plus an H^1-small fluctuation.Comment: 19 page

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using a multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area

A VLSI pipeline design of a fast prime factor DFT on a finite field

A conventional prime factor discrete Fourier transform (DFT) algorithm is used to realize a discrete Fourier-like transform on the finite field, GF(q sub n). A pipeline structure is used to implement this prime factor DFT over GF(q sub n). This algorithm is developed to compute cyclic convolutions of complex numbers and to decode Reed-Solomon codes. Such a pipeline fast prime factor DFT algorithm over GF(q sub n) is regular, simple, expandable, and naturally suitable for VLSI implementation. An example illustrating the pipeline aspect of a 30-point transform over GF(q sub n) is presented

Collective synchronization in populations of globally coupled phase oscillators with drifting frequencies

We generalize the Kuramoto model for coupled phase oscillators by allowing the frequencies to drift in time according to Ornstein-Uhlenbeck dynamics. Such drifting frequencies were recently measured in cellular populations of circadian oscillator and inspired our work. Linear stability analysis of the Fokker-Planck equation for an infinite population is amenable to exact solution and we show that the incoherent state is unstable passed a critical coupling strength K_c(\ga, \sigf), where \ga is the inverse characteristic drifting time and \sigf the asymptotic frequency dispersion. Expectedly $K_c$ agrees with the noisy Kuramoto model in the large \ga (Schmolukowski) limit but increases slower as \ga decreases. Asymptotic expansion of the solution for \ga\to 0 shows that the noiseless Kuramoto model with Gaussian frequency distribution is recovered in that limit. Thus varying a single parameter allows to interpolate smoothly between two regimes: one dominated by the frequency dispersion and the other by phase diffusion.Comment: 5 pages, 5 figures, accepted in Phys. Rev.

A parallel VLSI architecture for a digital filter of arbitrary length using Fermat number transforms

A parallel architecture for computation of the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (FNT) is described. In particular a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required. A standard barrel shifter circuit is modified so that it performs the required bit rotation operation. The overlap-save method is generalized for the FNT to compute a linear convolution of arbitrary length. A parallel architecture is developed to realize this type of overlap-save method using one FNT and several inverse FNTs of 128 points. The generalized overlap save method alleviates the usual dynamic range limitation in FNTs of long transform lengths. Its architecture is regular, simple, and expandable, and therefore naturally suitable for VLSI implementation

Financing the Cotton Crop

n/