Search

A cross-sectional survey was conducted in neonatal and maternity units of five Kenyan district public hospitals. Data for 1 year were obtained: 3999 maternal and 1836 neonatal records plus tallies of maternal deaths, deliveries and stillbirths. There were 40 maternal deaths [maternal mortality ratio: 276 per 100 000 live births, 95% confidence interval (CI): 197-376]. Fresh stillbirths ranged from 11 to 43 per 1000 births. A fifth (19%, 263 of 1384, 95% CI: 11-30%) of the admitted neonates died. Compared with normal birth weight, odds of death were significantly higher in all of the low birth weight (LBW, <2500 g) categories, with the highest odds for the extremely LBW (<1000 g) category (odds ratio: 59, 95% CI: 21-158, p < 0.01). The observed maternal mortality, stillbirths and neonatal mortality call for implementation of the continuum of care approach to intervention delivery with particular emphasis on LBW babies. [ABSTRACT FROM AUTHOR]

The transition towards full network virtualization will see services for smart ecosystems including smart metering, healthcare and transportation among others, being deployed as Service Function Chains (SFCs) comprised of an ordered set of virtual network functions. However, since such services are usually deployed in remote cloud networks, the SFCs may transcend multiple domains belonging to different Infrastructure Providers (InPs), possibly with differing policies regarding billing and Quality-of-service (QoS) guarantees. Therefore, efficiently allocating the exhaustible network resources to the different SFCs while meeting the stringent requirements of the services such as delay and QoS among others, remains a complex challenge, especially under limited information disclosure by the InPs. In this work, we formulate the SFC deployment problem across multiple domains focusing on delay constraints, and propose a framework for SFC orchestration which adheres to the privacy requirements of the InPs. Then, we propose a reinforcement learning (RL)-based algorithm for partitioning the SFC request across the different InPs while considering service reliability across the participating InPs. Such RL-based algorithms have the intelligence to infer undisclosed InP information from historical data obtained from past experiences. Simulation results, considering both online and offline scenarios, reveal that the proposed algorithm results in up to 10% improvement in terms of acceptance ratio and provisioning cost compared to the benchmark algorithms, with up to more than 90% saving in execution time for large networks. In addition, the paper proposes an enhancement to a state-of-the-art algorithm which results in up to 5% improvement in terms of provisioning cost. [ABSTRACT FROM AUTHOR]