由于个体差异以及因疾病引起的心脏、肝脏和肾脏功能的改变,使得治疗浓度范围狭窄的药物通常的标准剂量对于一些人可能血药浓度偏低,达不到联期的疗效;而对于另一些人则可能浓度过高,导致毒性及副反应的发生。为了临床用药的安垒与有效...由于个体差异以及因疾病引起的心脏、肝脏和肾脏功能的改变,使得治疗浓度范围狭窄的药物通常的标准剂量对于一些人可能血药浓度偏低,达不到联期的疗效;而对于另一些人则可能浓度过高,导致毒性及副反应的发生。为了临床用药的安垒与有效,需要开展治疗血药浓度的临测工作。根据测得的血药浓度,计算出病人的具体的药物动力学参数,从而制订出该病人适合的给药方案,这就是常说的治疗药物监测(Therapeutic Drug Mon(?)oring)。在治疗药物监测中。展开更多
Discovery of service nodes in flows is a challenging task, especially in large ISPs or campus networks where the amount of traffic across net-work is rmssive. We propose an effective data structure called Round-robin ...Discovery of service nodes in flows is a challenging task, especially in large ISPs or campus networks where the amount of traffic across net-work is rmssive. We propose an effective data structure called Round-robin Buddy Bloom Filters （RBBF） to detect duplicate elements in flows. A two-stage approximate algorithm based on RBBF which can be used for detecting service nodes from NetFlow data is also given and the perfonmnce of the algorithm is analyzed. In our case, the proposed algorithm uses about 1% memory of hash table with false positive error rate less than 5%. A proto-type system, which is compatible with both IPv4 and IPv6, using the proposed data structure and al-gorithm is introduced. Some real world case studies based on the prototype system are discussed.展开更多
文摘由于个体差异以及因疾病引起的心脏、肝脏和肾脏功能的改变,使得治疗浓度范围狭窄的药物通常的标准剂量对于一些人可能血药浓度偏低,达不到联期的疗效;而对于另一些人则可能浓度过高,导致毒性及副反应的发生。为了临床用药的安垒与有效,需要开展治疗血药浓度的临测工作。根据测得的血药浓度,计算出病人的具体的药物动力学参数,从而制订出该病人适合的给药方案,这就是常说的治疗药物监测(Therapeutic Drug Mon(?)oring)。在治疗药物监测中。
基金supported by the National Basic Research Program of China under Grant No. 2009CB320505
文摘Discovery of service nodes in flows is a challenging task, especially in large ISPs or campus networks where the amount of traffic across net-work is rmssive. We propose an effective data structure called Round-robin Buddy Bloom Filters （RBBF） to detect duplicate elements in flows. A two-stage approximate algorithm based on RBBF which can be used for detecting service nodes from NetFlow data is also given and the perfonmnce of the algorithm is analyzed. In our case, the proposed algorithm uses about 1% memory of hash table with false positive error rate less than 5%. A proto-type system, which is compatible with both IPv4 and IPv6, using the proposed data structure and al-gorithm is introduced. Some real world case studies based on the prototype system are discussed.
