"Cutting for love": genital incisions to enhance sexual desirability and commitment in KwaZulu-Natal, South Africa

Several studies have documented women's use of vaginal practices in South Africa to enhance their desirability to men. This article describes a little known practice of this kind among women in KwaZulu-Natal. It involves the use of small incisions in the genital area (and often abdomen and breasts) to introduce herbal substances, described as love medicines, into the body through the incisions. In-depth interviews were carried out with 20 key informants and 20 women, and eight focus group discussions with women and men, in a rural and urban site in 2005-06. A province-wide household survey was then conducted using a multi-stage cluster sample design among 867 women aged 18-60. Forty-two per cent of the women in the household survey had heard of genital incisions; only 3% had actually used them. The main motivation was the enhancement of sexual attractiveness and long-term partner commitment. It appears to be a very recent practice, but may be an extension of an older healing practice not involving the genitals. It was most prevalent among rural women aged 24-29 (although not significant), those with less education, and those who suspected their partners of having other partners. It is linked to the modern popularity of love medicines, which in turn illustrates the troubling state of gender relations in KwaZulu-Natal today.

Parallel recusive algorithms for inverse discrete Legendre transform and inverse discrete Laguerre transform

This paper presents parallel recursive algorithms for the computation of the inverse discrete Legendre transform (DPT) and the inverse discrete Laguerre transform (IDLT). These recursive algorithms are derived using Clenshaw's recurrence formula, and they are implemented with a set of parallel digital filters with time-varying coefficients.

The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.