Searcharxiv⌕ Search

arXiv subjects

Min Zhu

Publications and source records attributed to Min Zhu.

62 records · Page 4Linked to original sources

Population pharmacokinetics and dosing regimen optimization of tacrolimus in Chinese lung transplant recipients

We aimed to develop a population pharmacokinetic model of tacrolimus in Chinese lung transplant recipients, and propose model based dosing regimens for individualized treatment. We obtained 807 tacrolimus whole blood concentrations from 52 lung transplant patients and genotyped CYP3A5*3. Population pharmacokinetic analysis was performed using nonlinear mixed effects modeling. Monte Carlo simulations were employed to design initial dosing regimens. Tacrolimus pharmacokinetics was described by a one compartment model with first order absorption and elimination process. The mean estimated apparent clearance was 13.1 l/h with 20.1% inter subject variability in CYP3A5*3/*3 70kg patients with 30% hematocrit and voriconazole free therapy, which is lower than that in Caucasian(17.5 to 36.5 l/h). Hematocrit, postoperative days, tacrolimus daily dose, voriconazole cotherapy, and CYP3A5*3 genotype were identified as significant covariates for tacrolimus clearance. To achieve the target trough concentration (10 to 15 ng/ml) on the 8th day after transplantation, CYP3A5*1/*3 patients with voriconazole free cotherapy, a higher initial dosage than the current regimen of 0.04 mg/kg q12h should be recommened. Given the nonlinear kinetics of tacrolimus and large variability, population pharmacokinetic model should be combined with therapeutic drug monitoring to optimize individualized therapy.

q-bio.TO↗

Umbrella: Enabling ISPs to Offer Readily Deployable and Privacy-Preserving DDoS Prevention Services

Defending against distributed denial of service (DDoS) attacks in the Internet is a fundamental problem. However, recent industrial interviews with over 100 security experts from more than ten industry segments indicate that DDoS problems have not been fully addressed. The reasons are twofold. On one hand, many academic proposals that are provably secure witness little real-world deployment. On the other hand, the operation model for existing DDoS-prevention service providers (e.g., Cloudflare, Akamai) is privacy invasive for large organizations (e.g., government). In this paper, we present Umbrella, a new DDoS defense mechanism enabling Internet Service Providers (ISPs) to offer readily deployable and privacy-preserving DDoS prevention services to their customers. At its core, Umbrella develops a multi-layered defense architecture to defend against a wide spectrum of DDoS attacks. In particular, the flood throttling layer stops amplification-based DDoS attacks; the congestion resolving layer, aiming to prevent sophisticated attacks that cannot be easily filtered, enforces congestion accountability to ensure that legitimate flows are guaranteed to receive their fair shares regardless of attackers' strategies; and finally the userspecific layer allows DDoS victims to enforce self-desired traffic control policies that best satisfy their business requirements. Based on Linux implementation, we demonstrate that Umbrella is capable to deal with large scale attacks involving millions of attack flows, meanwhile imposing negligible packet processing overhead. Further, our physical testbed experiments and large scale simulations prove that Umbrella is effective to mitigate various DDoS attacks.

cs.CR↗

Combating Error Propagation in Window Decoding of Braided Convolutional Codes

In this paper, we study sliding window decoding of braided convolutional codes (BCCs) in the context of a streaming application, where decoder error propagation can be a serious problem. A window extension algorithm and a resynchronization mechanism are introduced to mitigate the effect of error propagation. In addition, we introduce a soft bit-error-rate stopping rule to reduce computational complexity, and the tradeoff between performance and complexity is examined. Simulation results show that, using the proposed window extension algorithm and resynchronization mechanism, the error performance of BCCs can be improved by up to three orders of magnitude with reduced computational complexity.

cs.IT↗

Predicting the Popularity of Topics based on User Sentiment in Microblogging Websites

Behavioral economics show us that emotions play an important role in individual behavior and decision-making. Does this also affect collective decision making in a community? Here we investigate whether the community sentiment energy of a topic is related to the spreading popularity of the topic. To compute the community sentiment energy of a topic, we first analyze the sentiment of a user on the key phrases of the topic based on the recent tweets of the user. Then we compute the total sentiment energy of all users in the community on the topic based on the Markov Random Field (MRF) model and graph entropy model. Experiments on two communities find the linear correlation between the community sentiment energy and the real spreading popularity of topics. Based on the finding, we proposed two models to predict the popularity of topics. Experimental results show the effectiveness of the two models and the helpful of sentiment in predicting the popularity of topics. Experiments also show that community sentiment affects collective decision making of spreading a topic or not in the community.

cs.SI↗

A Note on Implementing a Special Case of the LEAR Covariance Model in Standard Software

Repeated measures analyses require proper choice of the correlation model to ensure accurate inference and optimal efficiency. The linear exponent autoregressive (LEAR) correlation model provides a flexible two-parameter correlation structure that accommodates a variety of data types in which the correlation within-sampling unit decreases exponentially in time or space. The LEAR model subsumes three classic temporal correlation structures, namely compound symmetry, continuous-time AR(1), and MA(1), while maintaining parsimony and providing appealing statistical and computational properties. It also supplies a plausible correlation structure for power analyses across many experimental designs. However, no commonly used statistical packages provide a straightforward way to implement the model, limiting its use to those with the appropriate programming skills. Here we present a reparameterization of the LEAR model that allows easily implementing it in standard software for the special case of data with equally spaced temporal or spatial intervals.

stat.ME↗

Tight-binding parametrization for the chromium nitride: A NMTO study

We investigate the band structure of chromium nitride using the $N$th-order muffin-tin orbitals (NMTO) based downfolding technique. We obtain downfolded Cr $d$ bands including both $e_{g}$ and $t_{2g}$ states and the hopping integrals of the tight-binding Cr $d$ bands for both cubic and orthorhombic lattice. We further analyze the chemical bonding and tight-binding parameters from the NMTO produced tight-binding Hamiltonian. The effect of lattice distortion is also discussed according to the downfolded tight-binding parameters.

cond-mat.mtrl-sci↗

On the wave-breaking phenomena and global existence for the generalized periodic Camassa-Holm equation

Considered herein is the initial-value problem for the generalized periodic Camassa-Holm equation which is related to the Camassa-Holm equation and the Hunter-Saxton equation. Sufficient conditions guaranteeing the development of breaking waves in finite time are demonstrated. On the other hand, the existence of strong permanent waves is established with certain initial profiles depending on the linear dispersive parameter in a range of the Sobolev spaces. Moreover, the admissible global weak solution in the energy space is obtained.

math.AP↗