No abstract

The effects of recombinant human interleukin 11 (rhIL11) on thrombocytopenia and neutropenia in irradiated rhesus monkeys were evaluated after administration different doses at different times. Twenty-three rhesus monkeys were exposed to a total-body irradiation (TBI) with a single dose of 3 Gy 60Co gamma rays. Either placebo, rhIL11 at a dose of 30, 60 or 120 microg/kg day(-1) on days 0-13, or rhIL11 at a dose of 60 microg/kg day(-1) on days 13-26 after TBI was administered to the animals. The results showed that the immediate treatment with rhIL11 but not treatment on days 13-26 resulted in much higher platelet nadirs than in the placebo-treated group. The accelerated recovery of platelets to normal levels after TBI was demonstrated in all groups treated with rhIL11, but the effects of rhIL11 were independent of dose. However, rhIL11 treatment could also accelerate the recovery of leukocytes to normal levels. The numbers of colony-forming bone marrow cells (CFU-E, CFU-Mix, CFU-MK and CFU-GM) in all groups treated with rhIL11 were increased 4- to 14-fold relative to those of the placebo group on day 30. We conclude that rhIL11 may directly promote megakaryocyte development and ameliorate myelosuppression in irradiated monkeys.

No abstract

Reconfigurable intelligent surface (RIS) has been recognized as a potential technology for 5G beyond and attracted tremendous research attention. However, channel estimation in RIS-aided system is still a critical challenge due to the excessive amount of parameters in cascaded channel. The existing compressive sensing (CS)-based RIS estimation schemes only adopt incomplete sparsity, which induces redundant pilot consumption. In this paper, we exploit the specific triple-structured sparsity of the cascaded channel, i.e., the common column sparsity, structured row sparsity after offset compensation and the common offsets among all users. Then a novel multi-user joint estimation algorithm is proposed. Simulation results show that our approach can significantly reduce pilot overhead in both ULA and UPA scenarios.

This study considers a wireless network where multiple nodes transmit status updates to a base station (BS) via a shared, error-free channel with limited bandwidth. The status updates arrive at each node randomly. We use the Age of Synchronization (AoS) as a metric to measure the information freshness of the updates. The AoS of each node has a timelyvarying importance which follows a Markov chain. Our objective is to minimize the weighted sum AoS of the system. The optimization problem is relaxed and formulated as a constrained Markov decision process (CMDP). Solving the relaxed CMDP by a linear programming algorithm yields a stationary policy, which helps us propose a near-stationary policy for the original problem. Numerical simulations show that in most configurations, the AoS performance of our policy outperforms the policy choosing the maximum AoS regardless of weight variations.