Use of cholesterol-rich nanoparticles that bind to lipoprotein receptors as a vehicle to paclitaxel in the treatment of breast cancer: pharmacokinetics, tumor uptake and a pilot clinical study

Purpose In animal experiments paclitaxel oleate associated with a cholesterol-rich nanoemulsion concentrated in the neoplastic tissues and showed reduced toxicity and increased antitumor activity compared with paclitaxel-Cremophor EL. Here, a clinical study was performed in breast cancer patients to evaluate the tumoral uptake, pharmacokinetics and toxicity of paclitaxel associated to nanoemulsions. Methods Twenty-four hours before mastectomy [(3)H]paclitaxel oleate associated with [(14)C]-cholesteryl oleatenanoemulsion or [(3)H]- paclitaxel in Cremophor EL were injected into five patients for collection of blood samples and fragments of tumor and normal breast tissue. A pilot clinical study of paclitaxel-nanoemulsion administered at 3-week intervals was performed in four breast cancer patients with refractory advanced disease at 175 and 220 mg/m(2) dose levels. Results T(1/2) of paclitaxel oleate associated to the nanoemulsion was greater than that of paclitaxel (t(1/2) = 15.4 +/- 4.7 and 3.5 +/- 0.80 h). Uptake of the [(14)C]-cholesteryl ester nanoemulsion and [(3)H]- paclitaxel oleate by breast malignant tissue was threefold greater than the normal breast tissue and toxicity was minimal at the two dose levels. Conclusions Our results suggest that the paclitaxel-nanoemulsion preparation can be advantageous for use in the treatment of breast cancer because the pharmacokinetic parameters are improved, the drug is concentrated in the neoplastic tissue and the toxicity of paclitaxel is reduced.

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.

Relation between alcohol consumption and traffic violations and accidents in the region of Ribeirao Preto, Sao Paulo State

In recent years, alcohol consumption has been considered an important public health problem. Ethanol, the alcohol used in beverages, is a drug that affects the central nervous system (CNS) and impairs driving skills and co-ordination, increasing risk of deaths and injuries derived from crashes and road accidents. Consumption of alcoholic beverages is implicated with premature deaths, injuries and damages caused by motor vehicle crashes, which result in high costs to government and society. Considering that alcohol consumption is the main responsible factor for deaths and disabilities in young people, the aim of this work was to evaluate the prevalence of blood alcohol in offenders and/or fatal and non-fatal victims of traffic occurrences in the region of Ribeirao Preto, Sao Paulo State, from 2005 to 2007. The results revealed that in 2134 cases investigated, blood alcohol positivity was generally found in young adults, 25-45 years old and male. The study showed the high risk of drinking and driving and the importance in establishing actions of prevention and intervention to promote the reduction in the number of traffic occurrences related to consumption of alcoholic beverages. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

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.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.