Comment On 'practical Advice For Avoidance Of Pain Associated With Insertion Of Intrauterine Contraceptives': Authors' Response.

40

Carotenoids Are Effective Inhibitors Of In Vitro Hemolysis Of Human Erythrocytes, As Determined By A Practical And Optimized Cellular Antioxidant Assay.

β-Carotene, zeaxanthin, lutein, β-cryptoxanthin, and lycopene are liposoluble pigments widely distributed in vegetables and fruits and, after ingestion, these compounds are usually detected in human blood plasma. In this study, we evaluated their potential to inhibit hemolysis of human erythrocytes, as mediated by the toxicity of peroxyl radicals (ROO•). Thus, 2,2'-azobis (2-methylpropionamidine) dihydrochloride (AAPH) was used as ROO• generator and the hemolysis assay was carried out in experimental conditions optimized by response surface methodology, and successfully adapted to microplate assay. The optimized conditions were verified at 30 × 10(6) cells/mL, 17 mM of AAPH for 3 h, at which 48 ± 5% of hemolysis was achieved in freshly isolated erythrocytes. Among the tested carotenoids, lycopene (IC(50) = 0.24 ± 0.05 μM) was the most efficient to prevent the hemolysis, followed by β-carotene (0.32 ± 0.02 μM), lutein (0.38 ± 0.02 μM), and zeaxanthin (0.43 ± 0.02 μM). These carotenoids were at least 5 times more effective than quercetin, trolox, and ascorbic acid (positive controls). β-Cryptoxanthin did not present any erythroprotective effect, but rather induced a hemolytic effect at the highest tested concentration (3 μM). These results suggest that selected carotenoids may have potential to act as important erythroprotective agents by preventing ROO•-induced toxicity in human erythrocytes.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.