1 April 2019 in Applied Mathematics and Computation
3 June 2017 in Soft Computing
25 July 2022 in Frontiers in Public Health
Eosinophils are differentiated by bone marrow multipotent progenitor cells and are further released into peripheral blood after maturation. Human eosinophils can exhibit unique multi-leaf nuclear morphology, which are filled with cytoplasmic granules that contain cytotoxicity and immune regulatory proteins. In recent years, many studies focused on the origin, differentiation and development process of eosinophils. It has been discovered that the eosinophils have the regulatory functions of innate and adaptive immunity, and can also function in several diseases, including asthma, chronic obstructive pulmonary diseases, acute respiratory distress syndrome, malignant tumors and so on. Hence, the role and effects of eosinophils in various diseases are emphasized. In this review, we comprehensively summarized the development and differentiation process of eosinophils, the research progress of their related cytokines, diseases and current clinical treatment options, and discussed the potential drug target, aiming to provide a theoretical and practical basis for the clinical prevention and treatment of eosinophil-related diseases, especially respiratory diseases. To conclude, the guiding significance of future disease treatment is proposed based on the recent updated understandings into the cell functions of eosinophils.
11 November 2020 in IEEE Transactions on Wireless Communications
The burgeoning network traffic imposes a huge burden on the network backbone. Caching popular files at the wireless network edge is promising to address the problem. In practice, file popularity is very unlikely to know in advance. Online learning algorithms are effective to learn this uncertainty in a sequential way. In each slot, the learning agent generates a caching policy (i.e., the to-be-cached files) and can observe users’ feedback about the caching policy within the same slot. This method implicitly requires that all of the users are able to provide feedback promptly. However, in practice, the availability of each individual user is affected by many factors, e.g., users are moving out of the service area temporarily, or they may still consume files in the previous slots, which may result in the feedback delay. In this paper, we propose a delay-tolerant wireless caching system that takes both the feedback delay and users’ availability into consideration. We frame the content caching problem as a stochastic combinatorial multi-armed bandit problem with delayed feedback and forced-to-sleep arms, and devise an intelligent caching algorithm called CFAUD to solve the problem. Also, we show that CFAUD is effective and efficient both theoretically and practically. Finally, experiments are conducted to compare the performance of the proposed algorithm with other well-known algorithms.
27 May 2021 in IEEE Transactions on Wireless Communications
Routing is a fundamental problem and has been extensively studied in various networks. However, in highly dynamic networks (e.g., wireless ad hoc networks), nodes have limited transmission opportunities due to high mobility, noise and interference, where traditional routing is often not the best approach. Opportunistic routing (OR) , on the other hand, can effectively minimize the routing cost (e.g., the number of hops) and improve the success of routing by utilizing link metrics. However, the link metrics are usually unknown in advance and changing. In this paper, we design an adaptive algorithm called Thompson sampling-based opportunistic routing (TSOR) motivated by the distributed Bellman-Ford algorithms. TSOR is able to learn the link metrics and route packets simultaneously to reduce the overall cost. Theoretically, we show a lower bound and an upper bound of the cumulative regret (i.e., performance gap) between TSOR and the optimal routing algorithm that knows all link metrics in advance. The regret increases sublinearly with respect to the number of packets, and has a lower order in terms of the network size than the best-known results. Furthermore, we compare TSOR with the state-of-the-art algorithms, and the evaluation results show that TSOR has a lower regret and a faster convergence rate to the optimal policy than the state-of-the-art algorithms.
15 October 2019 in IEEE Transactions on Vehicular Technology