Pruritus in hemodialysis patients: The problem remains

Pruritus is still one of the most common and disturbing symptoms of end-stage renal disease. The objective of this study is to analyze the prevalence of pruritus in hemodialysis patients and the possible factors implicated in its genesis. In a cross-sectional study, 101 patients on hemodialysis at our center were screened for pruritus. The relationship of various factors with pruritus was evaluated. Of the 101 patients included, 31(30.7%) had pruritus at the time of examination. Patients with pruritus were significantly older than those without pruritus (P=0.0027). Pruritus tended to be more prevalent in patients undergoing dialysis 3 times a week than in those undergoing daily dialysis, but the difference did not reach statistical significance (P=0.0854). Lower transferrin saturation levels were found in patients with pruritus than in those without pruritus (P=0.0144). C-reactive protein levels were significantly higher in patients with pruritus than in those without pruritus (P=0.0013). There was no significant difference between the groups in the levels of the other inflammatory biomarkers measured. However, there was a tendency toward a correlation between the levels of alpha-1-glycoprotein and the intensity of pruritus (P=0.0834). Our results suggest a possible relationship of the inflammatory response upregulation to pruritus. Additionally, there was a positive relationship between pruritus and iron deficiency, possibly associated with inflammatory elevation of hepcidin. A better understanding of the factors implicated in the genesis of pruritus related to end-stage renal disease is crucial in the development of more effective treatments for this symptom.

The application of adaptive partitioned random search in feature selection problem

Feature selection is one of important and frequently used techniques in data preprocessing. It can improve the efficiency and the effectiveness of data mining by reducing the dimensions of feature space and removing the irrelevant and redundant information. Feature selection can be viewed as a global optimization problem of finding a minimum set of M relevant features that describes the dataset as well as the original N attributes. In this paper, we apply the adaptive partitioned random search strategy into our feature selection algorithm. Under this search strategy, the partition structure and evaluation function is proposed for feature selection problem. This algorithm ensures the global optimal solution in theory and avoids complete randomness in search direction. The good property of our algorithm is shown through the theoretical analysis.

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.