The aim of this study was to increase the precision of assessment of the number of round cells observed in the per- oxidase test for detection of seminal leukocytes （granulocytes）. The dilution of semen was reduced ...The aim of this study was to increase the precision of assessment of the number of round cells observed in the per- oxidase test for detection of seminal leukocytes （granulocytes）. The dilution of semen was reduced and the volume of suspension examined was increased for semen samples containing between 0.6 and 6 million round cells per mL. A 1 ＋ 5 （1：6） dilution was compatible with measurable peroxidase activity and a sufficiently clear background for cell assessment. At this dilution, and with assessment of all 18 grids on both sides of the Neubauer-improved counting chamber, only three of the 10 samples （nominal cell concentrations of 1.9 ×10^-6-3.3×10^-6 mL-1） presented 400 round cells or more. As lower seminal dilutions were incompatible with easy detection of round cells or their peroxidase reaction product, it was not pos- sible to provide precise measurements （sampling error 5%） of the suggested lower reference limit of 1 ×10^-6 cells per mL. The results indicate that this poor precision of measuring 1×10^-6 round cells per mL could explain the discrepant reports on the acceptability of the cut-off values for leukocytospermia. Such reference limits need to be established with statistically sound methods.展开更多
In this paper, we mainly consider the complexity of the k-splittable flow minimizing congestion problem. We give some complexity results. For the k-splittable flow problem, the existence of a feasible solution is stro...In this paper, we mainly consider the complexity of the k-splittable flow minimizing congestion problem. We give some complexity results. For the k-splittable flow problem, the existence of a feasible solution is strongly NP-hard. When the number of the source nodes is an input, for the uniformly exactly k-splittable flow problem, obtaining an approximation algorithm with performance ratio better than (√5+1)/2 is NP-hard. When k is an input, for single commodity k-splittable flow problem, obtaining an algorithm with performance ratio better than is NP-hard. In the last of the paper, we study the relationship of minimizing congestion and minimizing number of rounds in the k-splittable flow problem. The smaller the congestion is, the smaller the number of rounds.展开更多
文摘The aim of this study was to increase the precision of assessment of the number of round cells observed in the per- oxidase test for detection of seminal leukocytes （granulocytes）. The dilution of semen was reduced and the volume of suspension examined was increased for semen samples containing between 0.6 and 6 million round cells per mL. A 1 ＋ 5 （1：6） dilution was compatible with measurable peroxidase activity and a sufficiently clear background for cell assessment. At this dilution, and with assessment of all 18 grids on both sides of the Neubauer-improved counting chamber, only three of the 10 samples （nominal cell concentrations of 1.9 ×10^-6-3.3×10^-6 mL-1） presented 400 round cells or more. As lower seminal dilutions were incompatible with easy detection of round cells or their peroxidase reaction product, it was not pos- sible to provide precise measurements （sampling error 5%） of the suggested lower reference limit of 1 ×10^-6 cells per mL. The results indicate that this poor precision of measuring 1×10^-6 round cells per mL could explain the discrepant reports on the acceptability of the cut-off values for leukocytospermia. Such reference limits need to be established with statistically sound methods.
文摘In this paper, we mainly consider the complexity of the k-splittable flow minimizing congestion problem. We give some complexity results. For the k-splittable flow problem, the existence of a feasible solution is strongly NP-hard. When the number of the source nodes is an input, for the uniformly exactly k-splittable flow problem, obtaining an approximation algorithm with performance ratio better than (√5+1)/2 is NP-hard. When k is an input, for single commodity k-splittable flow problem, obtaining an algorithm with performance ratio better than is NP-hard. In the last of the paper, we study the relationship of minimizing congestion and minimizing number of rounds in the k-splittable flow problem. The smaller the congestion is, the smaller the number of rounds.
