We study a generalised version of the logistic map of the unit interval $(0,1)$, in which the point $x$ is taken to $1-|2x-1|^nu$. Here, $nu 0$ is a parameter of the map, which has received attention only when $nu =1$ and 2. We obtain the invariant density when $nu = frac12$, and derive...

Simple kernel-type estimators of integrals of general powers of general derivatives of probability densities are proposed. They are based on two simple properties, and in many circumstances enjoy optimal convergence rate.

Statistical scientists have recently focused sharp attention on properties of iterated chaotic maps, with a view to employing such processes to model naturally occurring phenomena. In the present paper we treat the logistic map, which has earlier been studied in the context of modelling...

One aspect of the unemployment crisis which has not received much attention in South Africa is the spatial distribution of unemployment within cities. Concentrated unemployment within cities may be seen primarily as a product of market and non-market housing allocation processes or of the...

The challenge of implementing high cost innovative technologies in health care systems operating under significant budgetary pressure has seen a radical shift in the health technology reimbursement landscape. New reimbursement strategies attempt to reduce the risk of making the wrong decision;...

In this paper we ask how a shrinking city responds when faced with a perforated urban fabric. Drawing on Manchester's response to its perforated eastern flank —and informed by a parallel study of Leipzig—we use the city's current approach to critique urban regeneration policy in England....

Healthcare systems are increasingly under pressure to provide funding for innovative technologies. These technologies tend to be characterized by their potential to make valued contributions to patient health in areas of relative unmet need, and have high acquisition costs and uncertainty within...

For high-dimensional data, most feature-selection methods, such as SIS and the lasso, involve ranking and selecting features individually. These methods do not require many computational resources, but they ignore feature interactions. A simple recursive approach, which, without requiring many...