The reliability of Underwater Wireless Sensor Networks (UWSNs) is measured in terms of energy consumption (EC), end-to-end delay(E2E) and packet delivery ratio (PDR). The adverse effects of channel may cause data loss. Reducing delay up to possible extend improves the reliability of the network, also increasing the number of nodes in a particular network increase reliability. Besides, increasing the number of nodes improve reliability but also increase power consumption. In order to overcome these shortcomings, the two routing protocols are proposed in this paper, namely Delay and Reliability Aware Routing (DRAR) protocol and Cooperative Delay and Reliability Aware Routing (Co-DRAR) protocol for UWSNs. In DRAR protocol, network is divided into two equal regions where two sink nodes(SNs) are positioned at upper region of the network and two SNs are placed at the mid region of the network. The protocol choose the relay node based on residual energy (RE), distance and Bit Error Rate (BER). These parameters protect the data packets from corruption and also provide stable path (where nodes remain active for longer period and do not die quickly). The protocol uses single link and may get worse sometimes while changing channel circumstances. To address this problem, cooperative routing scheme is added to DRAR protocol in order to developed its enhanced version known as Co-DRAR protocol. The protocol works by allowing the destination to receive multiple copies of data packets in order to decide the quality of packets. The proposed protocols DRAR and Co-DRAR perform routing irrespective to geographical position of sensors nodes conversely to the some of conventional routing protocols that's way our propose protocol better perform than the well-known protocol i.e. Depth base routing (DBR) in terms of EC, E2E, PDR, dead nodes, packet drop ratio and number of alive nodes (ANs).

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multipath protocols which send data to its destination using routes with separate links. One of such protocols is RPL routing protocol. In this paper, this method is improved using composite metrics which chooses the best paths used for separate routes to send packets. We propose Energy and Load aware RPL (ELaM-IoT) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on remaining energy, hop count, Link Expiration Time (LET), load and battery depletion index (BDI) for the route selection. In order to evaluate and report the results, the proposed ELaM-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed ELaM-IoT compared to the ERGID and ADRM-IoT approaches.

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

Cluster-based routing in Mobile Ad-Hoc Networks is considered one of the convenient methods of routing. The existence of Cluster Head (CH) in a group of nodes for data forwarding improves the performance of routing in terms of routing overhead and power consumption. In this paper, a clustering algorithm using hierarchical routing for mobile ad hoc networks is proposed. In the proposed method, first, clusters are formed by the FLOC clustering method with low overlapping. Then, according to the most important network criteria, including hop count, noise ratio, distance, remaining energy, and link expiration time, head clusters are selected based on the weighting algorithm. To transfer data in the proposed method, two types of communication are used, e.g., inter-cluster communication and intra-cluster communication in which the shortest path to the target cluster is selected. The proposed P-METHOD technique is based on hierarchy and clustering as well as using a weighted algorithm that reduces delay in data transmission on the network. Moreover, P-METHOD is evaluated here via extensive simulations carried out in NS-2. The simulation results indicate that the MANET network performance metrics are improved in terms of average throughput, Packet Delivery Ratio (PDR), delay, residual energy, and lifetime.

Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes' meeting probabilities to route packets towards their destinations. The model dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.

Underwater wireless sensor networks (UWSN) have recently been proposed as a way to monitor and explore the water depths' environments. Efficiently delivering the data is still a challenging problem in these networks because of the weaknesses in the acoustic transmission. To tackle such a problem, we propose a novel algorithm provides controlling mechanisms for critical long-term data forwarding underwater sensor networks, called Hop by Hop Power-Efficient Routing Protocol (Hⁿ-PERP). The proposed Hⁿ-PERP is a centralized full-control model that enhances the network's throughput and energy efficiency by a set of solutions depend on power monitoring in UWSN nodes. In particular, the model provides a guaranteed mechanism for scheduling and processing data transmission based on number of nodes, hops between the nodes, energy level and congestion within each node to minimize energy levels or power consumption by avoiding disconnected probability for any node, which in turn maximizing the network lifetime. Simulation results show that our proposed model is consistent with energy level and congestion, and is more accurate for enabling routing and data transmission. Therefore, the data packet delivery ratio and overall throughput also achieves robust scenarios of very sparse or/and weak networks, to keep on Performance stability in UWSN via adjusting hop-by-hop delay and energy consumption during packages delivery.

The Coastal Patrol and Surveillance Application (CPSA) is developed and deployed to detect, track and monitor water vessel traffic using automated devices. Latest advancements of marine technologies, including the Automatic Underwater Vehicles, have allowed the development of this type of applications. To facilitate their operations, installation of a Coastal Patrol and Surveillance Network (CPSN) is mandatory. One of the primary design objectives of this network is to deliver adequate amount of data within an effective time period. This is particularly essential for reporting a detection and notifying the current status of an intruder’s vessel through the adverse underwater communication channels. Additionally, intermittent connectivity of the nodes remain another important obstacle to overcome to allow smooth functioning of CPSA. Taking these objectives and obstacles into account, this work proposes a new protocol, named UDTN-RS, which is developed by ensembling forward error correction technique (namely Reed-Solomon codes or RS) in Underwater Delay Tolerant Network (UDTN) routing protocol with probabilistic spraying technique. In addition, the existing binary packet spraying technique is enhanced for supporting encoded packet exchange between the contacting nodes. A comprehensive simulation campaign is performed in identifying the effectiveness of the proposed protocol. The obtained results suggest that the proposed UDTN-RS protocol can be considered a suitable alternative of the existing protocols for sparse networks like CPSN.

Underwater acoustic sensor network (UASN) plays a crucial role in collecting real-time data from remote areas of the ocean. However, deploying the UASN is a challenging problem due to the harsh environment and high deployment cost. Therefore, it is essential to design an appropriate routing protocol to effectively address the issues of routing void, packet delivery delay, and energy utilization. In this paper, an adaptive support-vector-machine-based routing (ASVMR) protocol is proposed for the UASN to prolong the network lifetime and reduce the end-to-end packet delivery delay. The proposed protocol employs a distributed routing approach that dynamically optimizes the routing path in real-time by considering four types of node state information. Moreover, the ASVMR protocol establishes a "routing vector" spanning from the current node to the sink node, and selects a suitable pipe radius according to the packet delivery ratio (PDR). In addition, the ASVMR protocol incorporates future states of sensor nodes into the decision-making process, along with the adoption of a waiting time mechanism and routing void recovery mechanism. Extensive simulation results demonstrate that the proposed ASVMR protocol performs well, in terms of the PDR, the hop count, the end-to-end delay, and the energy efficiency in dynamic underwater environments.

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

Mobility models are used to evaluated the network protocols of the ad hoc network using the simulation. The random waypoint model is a model for mobility which is usually used for performance evaluation of ad-hoc mobile network. Mobile nodes have the dynamic mobility in the ad hoc network so the mobility model plays an important role to evaluate the protocol performance.In this article, we developed modify random waypoint mobility (MRWM) model based on random waypoint for the mobile ad hoc network. In this article, the comparative analysis of modifying random waypoint mobility and random waypoint model on the ad hoc On-Demand Distance Vector (AODV) routing protocol has been done for large wireless ad hoc network (100 nodes) with the random mobile environment for the 1800s simulation time. To enhance the confidence on the protocol widespread simulations were accomplished under heavy traffic (i.e. 80 nodes) condition. The proposed model protocol has been investigated with the performance metrics: throughput; packet delivery ratio; packet dropping ratio; the end to end delay and normalized routing overhead. The obtained results revealed that proposed modify random waypoint mobility model reduces the mobility as compared to the random waypoint mobility model and it is trace is more realist.

A Wireless Body Area Sensor Network (WBASN) is combination of numerous sense nodes, positioned onto/close or inside a person body. Wireless Body Area Sensor Networks (WBASN) is a developing automation trend that exploits wireless sensor nodes to put instantaneous wearable well-being of ill person to improve individual’s existence. The sensor nodes might be used outwardly to observe abundant health parameters (like heart activity, blood pressure and cholesterol) of an ill person at a vital site within hospital. Hence the goal of WBASN is much crucial, enhancing the lifetime of nodes is compulsory to sustain many issues such as utility and efficiency. It is essential to evaluate time that when the first node will die it we want to refresh or change the battery reason is that loss of crucial information is not tolerable. The lifetime is termed as the time interval when a first node dies out due to battery exhaustion. In our proposed protocol life time of a network is the main concern as well other protocol related issues such as throughput, path loss, and residual energy. Bio-sensors are used for deployment on human body. Poisson distribution and equilibrium model techniques have been used for attaining the required results. Multi-hop network topology and random network node deployment used to achieve minimum energy consumption and longer network lifetime.

Wireless Powered Communication Networks (WPCN), which has attracted much attention of researchers, also been recently recommended in 5^th generation (5G) wireless networks. With the help of the WPCN, the reliability and battery life of wireless low-power devices can be improved. In this paper, we investigate throughput and ergodic capacity in WPCN-assisted amplify-and-forward (AF) relaying system, considering two transmission modes including delay-tolerant and delay-limited. As important achievement, we propose symmetric energy harvesting protocol, namely time power switching relaying (TPSR) in order to find maximal throughput. In particular, both time switching and power switching coefficients in this schemes are considered. Unlike most of the previous works, we further focus on impact of outdated channel state information (CSI) in this WPCN. In order to evaluate information processing efficiency, the performance can be substantially improved by optimally harvesting time and power coefficients of the received signal at relay node for energy and information extraction, and by deploying several scenarios. By deploying Monte Carlo simulation, it is confirmed that the system performance is more sensitive to CSI estimation error, noise variance, signal-to-noise ratio (SNR) and resulting in other reasonable computations of TPSR need be deployed to obtain QoS requirement.

Older adults with obesity have an increased risk for cognitive decline and subsequent Alzheimer’s disease. Previous research has focused on the impact of individual nutrients and overall dietary patterns to improve cognitive function. The Brain and Body Health (BB-Health) study aims to demonstrate the feasibility of a multicomponent nutritional supplement (MCNS) and weight loss (WL) intervention for individuals with overweight and obesity who are not consuming a healthy diet. BB-Health is a parallel-group randomized placebo-controlled 2x2 factorial pilot trial comparing the MCNS, WL, and MCNS+WL with a Control group. Eligible participants are 55 to 85 years of age with a body mass index 27.0 to 39.9 kg/m2. Major exclusion criteria include type 2 diabetes, moderate or severe cognitive impairment, and self-reported healthy dietary pattern. The BB-Health feasibility trial is registered as NCT05542199 at clinicaltrials.gov. The BB-Health objectives are to report: 1) recruitment and enrollment, including pace and descriptive statistics of the study sample; 2) adherence to the administered interventions; 3) successful data collection and performance of outcome assessments, including evaluation of change in key outcomes over time that are powered for this pilot study; and 4) summary statistics on outcomes for use in planning a subsequent, larger trial. The outcomes of interest are age-sensitive cognitive assessments, cerebral hemodynamics, and related health parameters. All measurements are collected at baseline, 3-, 6-, and 12-month visits. If the BB-Health protocol demonstrates feasibility, the novel MCNS with and without a parallel WL intervention has potential to be administered in a confirmatory randomized trial to evaluate ability to prevent age-related cognitive decline and improve brain health. The BB-Health Feasibility Study could significantly contribute to our understanding of the influence of diet and weight management on cognitive health

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

Routing a person through a traffic network presents a tension between selecting a fixed route that is easy to navigate and selecting an aggressively adaptive route that minimizes the expected travel time. We propose to create non-aggressive adaptive routes in the middle-ground seeking the best of both these extremes. Specifically, these routes still adapt to changing traffic conditions, however we limit the number of adjustments made in the route. This improves the user experience, by providing a continuum of options between saving travel time and minimizing navigation. We design strategies to model single and multiple route adjustments, and investigate enumerative techniques to solve these models. To alleviate the intractability with handling real-life traffic data, we develop efficient algorithms with easily computable lower and upper bounds. We finally present computational experiments highlighting the benefits of limited adaptability in terms of reducing the expected travel time.

Internet of things (IoT) is a network of smart things. This indicates the ability of these physical things to transfer information with other physical things. The characteristics of these networks, such as topology dynamicity and energy constraint, challenges the routing problem in these networks. Previous routing methods could not achieve the required performance in this type of network. Therefore, developers of this network designed and developed specific methods in order to satisfy the requirements of these networks. One of the routing methods is utilization of multi-path protocols which send data to its destination using routes with separate links. One of such protocols is AOMDV routing protocol. In this paper, this method is improved using gray system theory which chooses the best paths used for separate routes to send packets. To do this, AOMDV packet format is altered and some fields are added to it so that energy criteria, link expiration time, and signal to noise ratio can also be considered while selecting the best route. The proposed method named RMPGST-IoT is introduced which chooses the routes with highest rank for concurrent transmission of data, using a specific routine based on the gray system theory. In order to evaluate and report the results, the proposed RMPGST-IoT method is compared to the ERGID and ADRM-IoT approaches with regard to throughput, packet receiving rate, packet loss rate, average remaining energy, and network lifetime. The results demonstrate the superior performance of the proposed RMPGST-IoT compared to the ERGID and ADRM-IoT approaches.

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on the many-excitation transfer protocol in Ref. , we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

Reservoir routing has been a routine procedure in hydrology, hydraulics and water management. It is typically based on the mass balance (continuity equation) and a conceptual equation relating storage and outflow. If the latter is linear, then there exists an analytical solution of the resulting differential equation, which can directly be utilized to find the outflow from known inflow, and to obtain macroscopic characteristics of the process, such as response and residence times, and their distribution functions. Here we streamline the reservoir routing framework and extend it to find approximate solutions for nonlinear cases. The proposed framework can also be useful for climatic tasks, such as describing the mass balance of atmospheric carbon dioxide and determining characteristic residence times, which have been an issue of controversy. Application of the theoretical framework results in excellent agreement with real world data. In this manner, we easily quantify the atmospheric carbon exchanges, and obtain reliable and intuitive results, without the need to resort to complex climate models. The mean residence time of atmospheric carbon dioxide turns out to be no more than four years and the response time is smaller than that, thus opposing the much longer mainstream estimates.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

Peri-implant diseases are defined as pathological inflammatory reactions in the tissue surrounding the osseointegrated implants. They are classified into two categories: mucositis - defined as peri-implant soft tissue inflammation and peri-implantitis - bone loss in the peri-implant region. A clinical case of a 61-years-old woman with an implant in the 46 anatomical position and a 5-year follow-up is presented. A probe depth of 5mm and a bone defect length of 35% was observed. The Implacure® Protocol was applied, with the main objective of eliminating the biofilm present on the exposed implant surface. There are multiple approaches to treat peri-implant diseases. While non-surgical treatment is essential for mucositis control, the treatment of peri-implantitis surgical treatment should be considered. Regenerative bone reconstruction promotes bone repair in the defect area and reduces bleeding during probing. To achieve that, autologous fibrin combined with Cerasorb M® was used. The proposed approach in the exposed clinical case involves the application of Implacure® Protocol, whose combination of the physical decontamination technique, together with the use of chlorhexidine and orthophosphoric acid, added with the combination Piperacillin + Tazobactam together with hyaluronic acid, provide a base that allows to regenerate bone using platelet-rich fibrin with Cerasorb M® and increase the survival time of the implant.

This paper introduces a new routing and touring service both for outdoor and indoor places of touristic and cultural interest designed to be used in the wider area of ​​Attica, Greece. This service is the result of the work done in OPTORER project and it aspires to offer a range of innovative and thematic routes to several specified points of interest in the selected area of Attica, encouraging the combination of indoors and outdoors routes in a single tour. The aim is to optimize the user experience while promoting specific, user-centric features with safety and social welfare being a priority for every designed tour resulting in enhancing the touristic experience in the area. Using a common smartphone device, as well as common wearable devices (i.e., smartwatches), the OPTORER service will provide an end-to-end solution by developing the algorithms and end-user applications, together with an orchestration platform responsible for managing, operating and executing the service that produces and presents to the end user results derived from solving dynamically complex optimization problems.

This paper presents an in-depth contextualized tutorial on Agricultural IoT (Agri-IoT), covering the fundamental concepts, assessment of routing architectures and protocols, and performance optimization techniques via systematic survey and synthesis of related literature. The negative impacts of climate change and the increasing global population on food security and unemployment threats have motivated the adoption of the wireless sensor network (WSN)-based Agri-IoT as an indispensable underlying technology in precision agriculture and greenhouses to improve food production capacities and quality. However, most related Agri-IoT testbed solutions have failed to achieve their performance expectations due to the lack of an in-depth and contextualized reference tutorial that provides a holistic overview of communication technologies, routing architectures, and performance optimization modalities based on users’ expectations. Thus, although IoT applications are founded on a common idea, each use case (e.g., Agri-IoT) varies based on specific performance and users expectations as well as its technological, architectural, and deployment requirements. Likewise, the agricultural setting is a unique and hostile area where conventional IoT technologies do not apply, hence the need for this tutorial. Consequently, this tutorial addresses these via the following contributions: (1) a systematic overview of the fundamental concepts, technologies, and architectural standards of WSN-based Agri-IoT, (2) an evaluation of the technical design requirements of a robust, location-independent, and affordable Agri-IoT, (3) a comprehensive survey of the benchmarking fault tolerance techniques, communication standards, routing and medium access control (MAC) protocols, and WSN-based Agri-IoT testbed solutions, and (4) an in-depth case study on how to design a self-healing, energy-efficient, affordable, adaptive, stable, autonomous, and cluster-based WSN-specific Agri-IoT from a proposed taxonomy of multi-objective optimization (MOO) metrics that can guarantee an optimized network performance. Furthermore, this tutorial established new taxonomies of faults, architectural layers, and MOO metrics for cluster-based Agri-IoT (CA-IoT) networks and a 3-tier objective framework with remedial measures for designing an efficient associated supervisory protocol for cluster-based Agri-IoT networks.

The widespread proliferation of sensor nodes in the era of Internet of Things (IoT) coupled with increasing usage of wireless spectrums especially the ISM band makes it difficult to deploy real-life IoT. Currently, the cognitive radio technology enables sensor nodes communicate with each other through the licensed spectrum bands as well as the free ISM bands. Cognitive radio networks (CRSNs) are considered as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows secondary users (SUs) to utilize wireless spectrum resources which belong to primary users (PUs) with minimal interference to PUs. Due to the dynamic spectrum availability and quality, routing for SUs in multi-hop CRSNs is a challenge. In this paper, we introduce novel routing metrics that estimate both the future spectrum availability and the average transmission time with the consideration of both the global statistical spectrum usage and local instant spectrum resources. In our novel routing metrics, one retransmission is allowed and considered to reduce the probability of rerouting upon PU's arrival. Then, we propose two routing algorithms for multi-hop CRSNs. Finally, we conduct simulations, whose results show that our proposed algorithms lead to a significant performance improvement over the reference algorithm.

The ABCDEFG Protocol provides an evolving tool for imposing structure on the flow of Covid infection information obtained from community testing, collective policy and individual compliance. ABCDEFG Protocol could not assume soundness, invariance, symmetry and completeness of the available information and relied on signaling game theory to design solutions that could evolve with the variable narratives, theories, individual utilities and pathogen variants. Thus, ABCDEFG Protocol suggests a novel and a very flexible pool-testing and badging protocol in the context of controlling contagious epidemics and tackling the far-reaching associated challenges, including understanding and evaluating individual and collective risks of returning prior infected individuals to normal society and other economic and social arrangements and interventions to protect against disease. AbCDEFG Proto uses both control theoretic and game theoretic mathematical models that may be centralized (an optimizing policy maker mandates behavior based on estimated models) or decentralized (a strategizing individual selects their behavior based on available asymmetric information). ABCDEFG protocol demonstrates how society can continue to carry out plausible economic activities in addition to controlling the prevalence of a contagious disease by keeping the number of infected people below a desired limit without compromising an individuals' privacy despite the presence of deception and selfishness among people, and limitations of available resources. Different types of badges would come with different restrictions. Badges would be reissued periodically by third-party testing centers via suitably frequent pool testing of samples of the participants. The size of the pools, frequency of tests, and allowable activities for people with a given type of badge would depend on the available resources, the prevalence of the disease, and the efficacy of the equipment used in the tests.

The current recommendation to avoid non-steroidal anti-inflammatory drugs (NSAIDs) in management of dengue virus disease is, as it was adopted earlier in COVID-19, scientifically considered of very low to low certainty. In this perspective I argue, for the first time globally, basing on real-life practice that NSAIDs might be lifesaving in early management of dengue virus disease as I originally argued and proved rightful in COVID-19. Moreover, I also argue that the Egyptian immune-modulatory Kelleni’s protocol, including nitazoxanide as an integral component, can be safely and effectively used to early manage COVID-19, human metapneumovirus, dengue virus disease, Zika virus separate or co-infections similar to what has already been experienced and published with separate or conjoined infections with SARS CoV-2, influenza, RSV and Norwalk viruses without the need of prior serological or molecular investigations to determine the causative agent.

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{F}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We show that the public, secret and channel keys become indistinguishable to the eavesdropper under matrix multiplication. Remarkably, for achieving a 512-bit security level, the public key is 1024 bits and the private key is 768 bits, making them the smallest keys among post-quantum key exchange algorithms. Also, we discuss how to achieve key authentication, interdomain certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{Z}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We claim that the unique eavesdropper's opportunity to get the secret/private key is by means of an exhaustive search which is equivalent to the unsorted database search problem. Furthermore, we show that the secret/private keys become indistinguishable to the eavesdropper. Remarkably, to achieve a 512-bit security level, the keys (public/private) are of the same size when matrix multiplication is done over a reduced 8-bit size modulo. Also, we discuss how to achieve key certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.

A simplified version of the quantum teleportation protocol is presented in here. Its experimental confirmation will have deep implications for a better understanding of Quantum Entanglement with a particular projection on Quantum Communications.

The Soil and Water Assessment Tool (SWAT) is one of the most widely used hydrologic models. SWAT has been undergoing constant changes since its development. However, compartment review and testing of SWAT are comparably limited, especially the flood routing functions. In this study, the daily flood routing subroutines of different SWAT versions were reviewed and tested using a well observed segment of the Weser river located in Germany. Results show several problems with the flood routing subroutines of SWAT. The variable storage subroutine of SWAT (revision 664) does not transform the flood wave. Unphysical results could be obtained with the variable storage routing of SWAT (revision 528). The Muskingum subroutine of SWAT (revisions 664 and 528) overestimates channel evaporation (resulting in a bias of 14\% to 19% in streamflow) and underestimates transmission losses. Simulated results show that the timing and shape of the flood wave could be improved with a corrected Muskingum subroutine. Based on the results of this study, we suggest the SWAT user community to review their existing SWAT models to see how the aforementioned issues will affect their methods, findings and conclusions.

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

This paper proposes an electric vehicle routing problem with considering states of charging stations and suggests solution strategies. Charging of electric vehicles is a main issue in the field of electric vehicle routing problem. There are many studies to find locations of charging stations, recharging functions for batteries of vehicles, and so on. However, states of charging stations significantly affect the routes of electric vehicles, which is not much explored. The states may include open or close of charging stations, occupied or empty of charging slots, and so on. This paper investigates how the states of charging stations are estimated and routing strategies are determined. We formulate a mixed integer programming model and suggest how to solve the problem with exact method. Numerical examples provide the optimal routing strategies of electric vehicles in the changing environments of the states of charging stations.

River flood routing computes changes in shape of a flood wave over time as it travels downstream along a river. Conventional flood routing models, especially hydrodynamic models require high quality and quantity of input data such as measured hydrologic time series, geometric data, hydraulic structures and hydrological parameters. Unlike physically based models, machine learning algorithms, which are data driven models, do not require much knowledge about underlying physical processes and can identify complex nonlinearity between inputs and outputs. Due to the higher performance, less complexity, and low computation cost, novel machine learning methods as a single application or hybrid application were introduced by researchers to achieve more accurate and efficient flood routing. This paper reviews the recent application of machine learning methods in river flood routing.

Transportation is a crucial component of supply chain management, responsible for delivering goods and services to customers. This paper explores the application of game theory concepts, precisely the Shapley value, to cost allocation in transportation operations involving drones and trucks. Our focus is on shortest-path games in which agents own nodes in a network and seek to transport items between nodes at the lowest possible cost. We provide a comprehensive literature review of the Shapley value and its use in shortest-path games, with particular emphasis on transportation networks. Our proposed model includes sets of customers, drones, and trucks and uses binary decision variables to indicate whether a drone or truck serves a given customer. The objective is to minimize the total cost of serving all customers while adhering to capacity and synchronization constraints. We use the Shapley value to determine the contribution and cost-sharing of each drone and truck in serving the customers. Through a combination of denitions, theorems, and examples, we explore the formal meaning of the Shapley value and its relationship to shortest-path games in transportation networks. We highlight exceptional cases and considerations that must be taken into account when applying the Shapley value in such scenarios.

The purpose of this paper is to develop a theoretical predictive model for LNG shipping routes selection process. Strategic decisions about shipping costs could be improved if a deeper knowledge about products economic value is provided. Developments made on the extraction and industrial processes related to this fossil fuel are driving the natural gas sector towards a unique globalised market. Moreover, data analytics applications as well as machine learning are topics presented as perfect catalysers for achieving an unprecedented natural gas globalised market. Additionally, this paper aims at showing the state of the art of new techniques used in transportation engineering that might have synergies with other industries (eg. commodities cost reduction, energy supply…). Finally, this paper aims to provide foundation for further research and development using more sophisticated data and algorithms that will help to close the gap between theoretical and practical scope of this techniques.

Opportunistic Routing is a promising paradigm that has been proposed for efficient and reliable transfer of data packets in mobile ad hoc networks. This routing strategy takes advantage of the broadcasting nature of the wireless medium to increase the number of probable forwarding devices and improves the reliability of data transfer in the network. Opportunistic Routing utilizes the reception of the same broadcasted packet at multiple devices in the network and selects one best forwarder dynamically from the set of multiple receivers. A number of opportunistic routing protocols have been proposed over these years for effective data delivery in ad hoc networks. But as the speed and mobility of devices increases in the network, performances of the existing opportunistic routing protocols degrade considerably, leading to reduced Quality of Service and poor transmission efficiency. The exceptional potential of opportunistic routing is thus underutilized. In this research we introduce Optimized Opportunistic Routing (OOR) strategy that guarantee excellent Quality of Service and high transmission efficiency to the latest applications using opportunistic routing for communication in highly dynamic ad hoc networks. Simulation results show that our method achieve significant performance improvements compared to all other existing opportunistic routing protocols in highly dynamic mobile ad hoc networks.

Paleoclimatic and paleoceanographic studies routinely rely on the usage of foraminiferal calcite through faunal, morphometric and physico-chemical proxies. The application of such proxies presupposes the extraction and cleaning of these biomineralized components from ocean sediments in the most efficient way, a process which is often labor intensive and time consuming. In this respect, in this study we performed a systematic experiment for planktonic foraminiferal specimen cleaning using different chemical treatments and evaluated the resulting data of a Late Quaternary gravity core sample from the Aegean Sea. All cleaning procedures adopted here were made on the basis of their minimum potential bias upon foraminiferal proxies, such as the faunal assemblages, degree of fragmentation, stable isotope composition (δ18O and δ13C) and/or Mg/Ca ratios that are frequently used as proxies for surface-ocean climate parameters (e.g., sea surface temperature, sea surface salinity). Six different protocols were tested, involving washing, sieving, and chemical treatment of the samples with hydrogen peroxide and/or sodium hexametaphosphate (Calgon ®). Single species foraminifera shell weighing was combined with high-resolution Scanning Electron Microscopy (SEM) and synchrotron X-ray Microtomography (SμCT) of the material processed by each of the cleaning protocols, in order to assess the decontamination degree of specimen’s ultrastructure and interior. It appeared that a good compromise between time and cleaning efficiency is the simultaneous treatment of samples with a mixed hydrogen peroxide and Calgon solution, while the most effective way for an almost complete decontaminate of the calcareous components from undesirable sedimentary material is a two-step treatment - initially with hydrogen peroxide and subsequently with Calgon solutions.

With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.

Unmanned aerial vehicle (UAV), or drone is recognized for its potential to improve efficiency and address last-mile delivery issues. As a result, there has been a lot of activity in recent years in the field of drone scheduling and routing. Unlike the vehicle routing problem, drone route design is difficult due to several operational characteristics, such as speed optimization, multitrip operation, and energy consumption estimation. On the one hand, drone energy consumption is a complex nonlinear function of both speed and payload in practice. On the other hand, the high operating speed of drones can significantly curtail the drone range, thereby limiting the efficiency of drone delivery systems. Most of the existing drone delivery models either assume constant drone speed or do not consider the effect of drone speed and parcel weight on energy consumption, leading to costly or energy-infeasible routes. This paper addresses the trade-off between speed and flight range in a multi-trip drone routing problem with variable flight speeds (DRP-VFS), in which a team of homogeneous drones is employed for delivery services. We propose a new model to particularly consider energy constraints using a nonlinear energy consumption model and treat drone speeds as decision variables so that various drone speeds can be adopted in applications. The DRP-VFS is initially formulated as mixed-integer linear programming (MILP) to minimize total energy consumption. To solve large-scale instances, we propose a three-phase adaptive large neighborhood search (ALNS) algorithm. The experimental results demonstrate that suboptimal solutions can be found effectively in practical scenarios using the proposed method. Furthermore, results indicate that operating drones at variable speeds leads to about 21% of energy savings compared to fixed speeds, boasting advantages in cost-savings and range extensions.

Fast convergence routing is an important issue for LEO constellation network, due to its dynamical topology changing and time varying transmission requests. Most of existing research focus on the OSPF routing algorithm, which cannot handle the frequently links state changing of network. In this paper, we propose a Fast-Convergence Reinforcement Learning Satellite Routing Algorithm (FRL-SR) for LEO satellite networks, in which the satellite gets the network links status fast and adjusts its routing strategy. In FRL-SR, each satellite node is regarded as an agent. The agent selects the port for packet forwarding according to its own routing policy. When the satellite network state changes, agent would send ’hello’ packets to the neighbor node to update the neighbor node’s routing policy. Compared with traditional reinforcement learning, FRL-SR can perceive network information faster, and then converge faster. Also, FRL-SR can mask the dynamics of satellite network topology and adaptively adjust the forwarding strategy according to the link state. Various simulation is constructed, the results show that the proposed FRL-SR algorithm out performance the Dijkstra algorithm in performance of average delay, packet arriving ratio, network load balance.

Flood routing in flood forecasting issue, calculation the height of flood bands, determining the river boundaries, and estimation of protective facilities for flood –exposed building is applicable. In many cases, due to the lack of measuring stations, the status of the upstream flood generating hydrograph is not known. The purpose of this study is to present an integrated method comprising of an optimization model and a hydrodynamic numerical model for flood modeling to determine the upstream hydrograph using the provided hydrograph at the downstream measuring station of a river. The routing procedure consists of three steps: (1) generating a hypothetical upstream hydrograph using genetic algorithm method; (2) hydrodynamic modeling using a numerical simulation model for flood routing according to the hypothetical hydrograph which is generated in the first step; (3) compare the calculated and observed hydrograph in downstream by using a fitness function. This recommended procedure was named as Reverse Flood Routing Method (RFRM) and was then applied to Karun River, the largest river in Iran. Comparing the generated upstream hydrograph by the RFRM model with the corresponding measured hydrograph at Ahvaz hydrometric station, as an ungauged river location, shows the high accuracy of the recommended model in this study.

This paper builds on previous work introducing the Secure Remote Update Protocol (SRUP)—a secure communications protocol for Command & Control applications in the Internet of Things, built on top of MQTT. This paper builds on the original protocol, and introduces a number of additional message types: adding additional capabilities to the protocol. We also discuss the difficulty of proving that a physical device has an identity corresponding with a logical device on the network, and propose a mechanism to overcome this within the protocol.

The increase and diversity of low-cost Air Quality (AQ) sensors, as well as their flexibility and low power consumption, offers us the opportunity to integrate them into a broad AQ wireless sensor networks with the aim of enabling real-time monitoring and higher spatial sampling density of pollution in all parts of the cities. Considering that the vast majority of the population lives in these cities and the increase in respiratory/allergic problems in a large part of the population, it is of great interest to offer services and applications to improve their quality of life. In the ECO4RUPA project we focus on this kind of service, proposing an inclusive and intelligent routing ecosystem carried out by using a network of low-cost AQ sensors with the support of 5G communications along with official AQ monitoring stations, assisted with artificial intelligence to improve the AQ monitoring data and by spatial interpolation techniques to enhance its spatial resolution. The goal of this service is to calculate healthy walking and/or cycling routes according to the particular citizen’s profile and needs. We provide and analyse the results of the proposed route planner under different scenarios (different time tables, congestion road traffic and routes) and different user’s profiles, with special interest on citizens with asthma and pregnant women, since both require special needs. In summary, our approach can lead to an approximately average reduction in pollution exposure of 17.82%, while experiencing an approximately average increase in distance travelled of 9.8 %.

Water covers a greater part of the earth's surface. Even though we know very little about the underwater world as most parts of it remain unexplored. Oceans including other water bodies hold huge natural resources and also the aquatic lives. These are mostly unexplored and very few of those are known due to unsuited and hazardous environments for the human to explore. This vast underwater world can be monitored remotely from a distant location with much ease and less risk. To monitor water-bodies remotely in real-time, sensor networking has been playing a great role. It is needed to deploy a wireless sensor network over the volume which we want to surveil. For vast water bodies like oceans, rivers and large lakes, data is collected from the different heights of the water level which is sent to the surface sink. Unlike terrestrial communication, radio waves and other conventional mediums can't serve the purpose of underwater communication as they pose high attenuation and very reduced transmission range. Rather an acoustic medium can transmit data more efficiently and reliably in comparison to other mediums. To transmit data reliably from the bottom of the sea to the sinks at the surface, multi-hop communication is needed which must involve a certain scheme. For seabed to surface sink communication, leading researchers have proposed different routing protocols. The goal of these routing protocols is to make underwater communication more reliable, energy-efficient and delay efficient thus to improve the performance of the overall communication. This paper surveys the advancement and applications of the routing protocols which eventually helps in finding the most efficient routing protocol for the Underwater Wireless Sensor Network (UWSN).

Opportunistic routing is the latest technique that uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network. This, in turn improves the delivery rate and reliability of data transmission in the network. Compared to all previous classes of routing protocols, opportunistic routing offers numerous advantages which is exploited by the latest applications for efficient communication and resource sharing in dynamic ad hoc networks. These applications provide dynamic communication in disaster recovery environments. The objective of this research work is to review and classify all the major opportunistic routing protocols proposed for dynamic ad hoc networks. Further the issues and challenges with each of these existing protocol is discussed and future research directions are put forward

A novel high-voltage powerline inspection system is investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline for inspection within limited endurance. This inspection system enables the drone to inspect powerline networks in a very large area. Both vehicle’ route in the road network and drone’s routes along the powerline network have to be optimized for improving the inspection efficiency, which generates a new two-layer point-arc routing problem. Two constructive heuristics are designed based on “Cluster First, Rank Second” and “Rank First, Split Second”. Then local search strategies are developed to further improve the quality of the solution. To test the performance of the proposed algorithms, practical cases with different-scale are designed based on the road network and powerline network of Ji’an, China. Sensitivity analysis on the parameters related with the drone’s inspection speed and battery capacity is conducted. Computational results indicate that technical improvement on the inspection sensor is more important for the cooperated ground vehicle and drone system.

COVID-19 has become a pandemic which resulted in measures being taken for health and safety of people. The spreading of the disease was particularly evident in indoor spaces, where people tend to get overcrowded. One such place is the airport where a plethora of passengers flow to common places, such as coffee shops, duty free shops as well as toilets and gates. Guiding the passengers to less overcrowded places within the airport may be a solution to less spreading. In this paper we suggest a passenger routing algorithm whereby the passengers are guided to less crowded places by using a weighting factor, which is minimised to accomplish the desired goal. We modeled a number of shops in an airport using the AnyLogic software and we tested the algorithm showing that the exposure time is less with routing and that the people get appropriately spread to the common spaces, thus, preventing overcrowding.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various social-based algorithms that have been designed for Delay Tolerant Networks.

Wireless Body Area Networks are composed of sensor nodes that may be implanted in the body or worn on it. A node is composed of a sensing unit, a processor and a radio unit. One of the nodes, the sink, acts as a gateway between the body area network and other networks such as the Internet. We propose a routing protocol that constructs paths between nodes such that the final network topology is a tree rooted at the sink. The protocol's aim is to increase network lifetime and reliability, and to adapt to network conditions dynamically. Moreover, the protocol enables communications between nodes and sink both in the upstream direction, from nodes to sink, and in the downstream direction from sink to nodes. When the network tree is constructed, a node chooses its parent, i.e., next hop to sink, by using one of various criteria. Namely, these are the number of hops between parent and sink, energy level of parent, received signal strength from parent, number of current parent's children, and a fuzzy logic function that combines multiple criteria. Moreover, as time progresses the tree structure may dynamically change to adapt to conditions such as the near-depletion of a routing node's energy. Simulation results show improvements in network lifetime and energy consumption over the older version of the protocol.

Demand responsive transport (DRT) is operated according to flexible routes, dispatch intervals, and dynamic demand, is attracting a lot of attention. The biggest characteristic of DRT service is that the vehicle routes and schedules are operated optimally based on real-time travel requests of using passengers without fixed operating schedules. Today, the smart-city era has arrived, particularly because of progress in the wireless communications technology and technology related to location information service and real-time passenger demands and requests, and services that change the vehicles’ operating schedules in real-time according to dynamic demand have attracted more attention. In this study, we analyze the effects of the DRT system to solve the first mile/last mile problem based on a proposed DRT routing algorithm considering real-time travel behavior. The algorithm is modified from the dynamic vehicle routing problem (DVRP), in which a DRT-based routing algorithm tends to minimize users’ cost and providers’ operation cost. So far, the DVRP has only been able to serve a single request per vehicle at a time. However, this needs to be extended for the purpose of DRT, wherein several passengers board a vehicle at the same time. The routing algorithm can serve multiple requests at a time and schedule picks ups, drop offs, and rides according to the requests and as calculated by the dispatch algorithm. The basic principle of routing is as follows. The DRT vehicle moves on an attractive path and picks up a passenger if boarding is requested, but it does not simply hang around as a DVRP would. In this step, if another DRT vehicle is present near another passenger, the vehicle that would minimize that passenger’s total travel time picks up the passenger. The optimal routing algorithm developed in this study is applied to the activity-based model; that is, a microscopic traffic demand estimation method is implemented through an activity-based model by using an open-source, activity-based model package called Multi-Agent Transport Simulation (MATSim). MATSim is used for the simulation, because it combines a multi-modal traffic flow simulation with a scoring model for agents, and it provides co-evolutionary algorithms that can alter agents’ daily routines. This process is applied to a type of mode choice and route choice repeatedly over several iterations until some form of user equilibrium has been reached. This study analyzed the feasibility of implementing the DRT service by analyzing the benefits for the users and cost of the operator from the effects of increasing public transportation use and providing personalized mobility service based on DRT implementation by the introduction of DRT will be analyzed according to the scale of DRT supply. Through the simulation, the DRT is expected to provide convenient, fast, and cost-effective mobility services to customers; provide an optimal vehicle scale to providers; and, ultimately, achieve a safe and efficient transportation system.

The recent provision of energy-harvesting capabilities to wireless sensor networks has entailed the redefinition of design objectives. Specifically, the traditional goal of maximizing network lifetime has been replaced by optimizing network performance, namely delay and throughput. The present paper contributes to this reformulation by considering the routing problem for the class of time-driven energy-harvesting WSN (EH-WSN) under regular or quasi-periodic energy sources. In particular, this paper shows that the minimum hop count (MHC) criterion maximizes the average duty cycle that can be sustained by nodes in this type of scenarios. This is a primary objective in EH-WSN, since large duty cycles lead to enhanced performance. Based on a previous result, a general expression is first obtained which gives mathematical form to the relationship between duty cycle and traffic load for any node in a time-driven EH-WSN fed by a regular energy source. This expression reveals that the duty cycle achievable by a node decreases as its traffic load increases. Then, it is shown that MHC minimizes the average traffic load over the network, and thus it maximizes the average duty cycle of nodes. This result is numerically validated via simulation by comparison with other well-known routing strategies. Accordingly, this paper suggests assigning top priority to the MHC criterion in the development of routing protocols for time-driven EH-WSN under regular energy sources.

Cellular Vehicle-to-Everything (C-V2X) is a communication technology that supports various safety, mobility, and environmental applications given its higher reliability properties compared to other communication technologies. The performance of these C-V2X-enabled Intelligent Transportation System (ITS) applications is affected by the performance of the C-V2X communication technology (mainly packet loss). Similarly, the performance of the C-V2X communication is dependent on the vehicular traffic density which is affected by the traffic mobility patterns, and vehicle routing strategies. Consequently, it is critical to develop a tool that can simulate, analyze, and evaluate the mutual interactions of the transportation and communication systems at the application level and to the evaluate the benefits of the C-V2X enabled ITS applications. In this paper, we demonstrate the benefits gained when using C-V2X Vehicle-to-Infrastructure (V2I) communication technology in an energy-efficient dynamic routing application. Specifically, we develop a Connected Energy-Efficient Dynamic Routing (C-EEDR) application using C-V2X as a communication medium in an integrated vehicular traffic and communication simulator (INTEGRATION). The results demonstrate that the C-EEDR application achieves fuel savings of up to 16.6% and 14.7% in the IDEAL and C-V2X communication cases, respectively for a peak hour demand on the downtown Los Angeles network considering a 50% level of market penetration of connected vehicles. The results demonstrate that the fuel savings increase with increasing levels of market penetration at lower traffic demand levels (25% and 50% the peak demand). At higher traffic demand levels (75% and 100%) the fuel savings increase with increasing levels of market penetration with maximum benefits at a 50% market penetration rate. Although the communication system is affected by the high density of vehicles at the high traffic demand levels (75% and 100% the peak demand), the C-EEDR application manages to perform reliably producing system-wide fuel consumption savings.The C-EEDR application achieves fuel savings of 15.2% and 11.7% for the IDEAL communication and 14% and 9% for the C-V2X communication at the 75% and 100% market penetration rates, respectively. Finally, the paper demonstrates that the C-V2X communication constraints only affect the performance of the C-EEDR application at the full demand level when the market penetration of connected vehicles exceeds 25%. This degradation, however is minimal (less than a 2.5% reduction in fuel savings).

In recent years, the management of health systems is a main concern of governments and decision makers. Home health care is one of the newest methods of providing services to patients in developed societies that can respond to the individual lifestyle of modern age and the increase of life expectancy. The home health care routing and scheduling problem is a generalized version of the vehicle routing problem, which is extended to a complex problem by adding special features and constraints of health care problems. In this problem, there are multiple stakeholders such as nurses for which an increase of their satisfaction level is very important. In this study, a mathematical model is developed to expand traditional home health care routing and scheduling models to downgrading cost aspects by adding the objective of minimizing the difference between the actual and potential skills of the nurses. Downgrading can lead to a dissatisfaction of the nurses. In addition, skillful nurses have higher salaries and high-level services increase equipment costs and need more expensive trainings and nursing certificates. Therefore, downgrading can enforce hidden huge costs to the managers of a company. To solve the bi-objective model, an -constraint based approach is suggested and the model applicability and its ability to solve the problem in various sizes are discussed. A sensitivity analysis on the Epsilon parameter is conducted to analyze the effect of this parameter on the problem. Finally, some managerial insights are presented to help the managers in this field, and some directions for future studies are mentioned as well.

To facilitate wireless communication, ocean exploration, and various environmental and research applications, the underwater Internet of Things has been developed with an infrastructure of acoustic sensor networks. There has been a significant increase in failures and a decrease in the efficiency of the network due to the fluid and challenging underwater environment. Consequently, achieving quality of service (QoS) in underwater networks remains a research area. Supporting QoS in underwater sensor networks is challenging due to resource limitations such as processing power, memory, bandwidth, and power sources. The purpose of this study was to examine the service quality requirements as well as protocols that have been implemented in recent years. Finally, based on quality criteria, we have presented a routing solution based on fuzzy logic, which is more efficient than other recent methods regarding energy consumption rate, JFI, efficiency, and reliability.

Oceans cover about 70% of the Earth's surface, and about 95% remain unexplored for various reasons. Underwater wireless communication has been revolutionised with the help of Internet of Things networks. Recently, applications such as collecting marine data, marine monitoring, disaster prevention, historical exploration, oil and gas exploration, shipwreck exploration, maritime security, and monitoring of aquatic species and water pollution, and several applications have become possible. However, the problem of routing, information transfer, and resource preservation in the fluid underwater environment remains unsolved. In this research, we were looking for a solution to make routing more efficient, considering the various and practical criteria for the quality of service of the underwater IoT network. One of the outstanding features of this research is the possibility of dynamically weighing the parameters involved in routing and taking optimal and distributed decisions between network components. The proposed method has achieved acceptable results in terms of quality of service compared to recent methods.

Several factors influence traffic congestion and overall traffic dynamics. Simulation modeling has been utilized to understand the traffic performance parameters during traffic congestions. This paper focuses on driver behavior of route selection by differentiating three distinguishable decisions, which are shortest distance routing, shortest time routing and less crowded road routing. This research generated 864 different scenarios to capture various traffic dynamics under collective driving behavior of route selection. Factors such as vehicle arrival rate, behaviors at system boundary and traffic light phasing were considered. The simulation results revealed that shortest time routing scenario offered the best solution considering all forms of interactions among the factors. Overall, this routing behavior reduces traffic wait time and total time (by 69.5% and 65.72%) compared to shortest distance routing.

Breast cancer is a multifaceted disease that has many subcategories characterized by unique genetic features. This research focuses on two important subgroups, including ER+ and HER2-. We conducted an analysis of gene expression data obtained from reliable sources (Array Express: E-GEOD-52194, E-GEOD-75367, and E-GEOD-58135) in order to reveal the complex molecular details of these subtypes. The computational pipeline we used identified 396 genes that exhibited distinct patterns of gene expression in ER+ and HER2- breast cancers. The diagnostic and prognostic significance of these genes was evaluated using machine learning methods, namely SVM and decision tree models. Metrics like as accuracy, sensitivity, and specificity provide insights into their usefulness. Furthermore, the use of the STRING database for network analysis revealed significant signaling pathways and biological processes associated with the development of ER+ and HER2- breast cancer. The results of our research enhance our comprehension of these subcategories, which might possibly facilitate more accurate diagnoses and focused treatment interventions. To summarize, this work provides valuable information on the genetic foundations of ER+ and HER2- breast cancer, which has potential implications for enhancing patient treatment and outcomes.

Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes for increased performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the Cache Coding was proposed. This protocol only allows recoding at the relays when the relay has received enough packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key allowing for the system to detect and minimize the effect of pollution attacks and make relays accountable for changes on the data. This paper analyzes the delay performance of Cache Coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an Absorbing Markov Chain and a approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that Cache Coding can overcome security issues of unrestricted recoding with only a moderate decrease in system performance.

Wireless Mesh Networks (WMN) are a solution with a reasonable cost/benefit ratio when provid-ing broadband internet access. The concept is being used not only in IEEE networks but also in other wireless networks such as cellular networks (4G/5G) and Low Power Wide Area Network (LPWAN). IEEE 802.11s is the facto standard and is well known for working with WMN. The standard defines Hybrid Wireless Mesh Protocol (HWMP) as a layer 2 routing protocol. The met-ric proposed by the protocol is Air Time Link (ALM), and the IEEE 802.11 standard proposes an equation for its calculation. This work proposes a new methodology for the calculation of ALM which has been developed in the following way: through several scripts, which simulate various WMN scenarios in NS-3, collect information in several databases, and then take the data to RStu-dio, where different statistical tests are developed, such as linear models (LM), generalized linear models (GLM), and other statistical tests for both the original and new model proposals. The result is a new methodology for the calculation of metrics, using statistical techniques in the selection and validation of model regressors, presenting an a priori tool to improve the per-formance of the WMS's.

Opportunistic routing uses the broadcasting nature of the wireless medium to increase the number of potential forwarding nodes in the network. This, in turn improves the delivery rate and reliability of data transmission in the network. Compared to all previous classes of protocols, opportunistic routing offers numerous advantages which is exploited by the latest applications for efficient communication and resource sharing in dynamic ad hoc networks. The objective of this research work is to review and classify all the major opportunistic routing protocols proposed for dynamic ad hoc networks. Further the issues and challenges with each of these existing protocol is discussed and future research directions are put forward.

Traditional methods for discovery and development of new drugs can be a very time-consuming and expensive process because it includes several stages such as compound identification, pre-clinical and clinical trials before the drug is approved by the US Food and Drug Administration (FDA). Therefore, drug repurposing, namely using currently FDA-approved drugs as therapeutics for other diseases than what they are originally prescribed for, is emerging to be a faster and more cost-effective alternative to current drug discovery methods. In this paper, we have described a three-step in silico protocol for analyzing transcriptomics data using online databases and bioinformatics tools for identifying potentially repurposable drugs. The efficacy of this protocol was evaluated by comparing its predictions with the findings of two case studies of recently reported repurposed drugs: HIV treating drug Zidovudine for the treatment of Dry Age-Related Macular Degeneration and the antidepressant Imipramine for Small-Cell Lung Carcinoma. The proposed protocol successfully identified the published findings, thus demonstrating the efficacy of this method. In addition, it also yielded several novel predictions that have not yet been published, including the finding that Imipramine could potentially treat Severe Acute Respiratory Syndrome (SARS), a disease that currently does not have any treatment or vaccine. Since this in-silico protocol is simple to use and does not require advanced computer skills, we believe any motivated participant with access to these databases and tools would be able to apply it to large datasets to identify other potentially repurposable drugs in the future.

Current scientific knowledge and guidelines in bone and soft tissue augmentation, suggest the use of
staged surgical workflows as gold standards in regenerative procedures during implant therapy. In this
context, the process is always the same regardless of the techniques applied: an
alternate series of surgical acts is following one another after the completion of a specific period of
osseointegration or graft maturation. As a result, the overall surgical treatment is often long, invasive and
induce scar tissue formation.
This article proposes a novel, fast and less invasive biphasic protocol with the use of a well documented
cortical barrier mounted on stock healing abutments that are further replaced by customised abutments
on an early second stage. 2 cases are reported, one for an upper maxillary edentulous area and the other
for a mandibular, with a total of 4 implants placed.
Results at 4 months post op, showed an optimal soft tissue configuration for both cases with adequate
cervical profile generation and sufficient supracrestal complex height above the implant platforms.
Significant bone gains were also recorded through CBCT data collection either with alveolar width
measurements on axial slices, superposition of preop and postop datasets and 3D visualization after bone
volume segmentation.
Further studies will be needed in the future to evaluate the efficacy of this protocol in both hard and soft
tissue augmentation for edentulous sites in need of implant rehabilitation.

In this paper, we present a novel Two-Echelon Ground Vehicle and Its Mounted Unmanned Aerial Vehicle Cooperated Routing Problem (2E-GUCRP). The 2E-GUCRP arises in the field of Unmanned Aerial Vehicle (UAV) Routing Problem such as those encountered in the context of city logistics. In a typical cooperated system, the UAV is launched from the Ground Vehicle (GV) and automatically flies to the designated target. Meanwhile, acting as a mobile base station, the GV can charge or change the UAV’s battery on the designated landing points to enable the UAV to continue its mission. The objective is to design efficient GV and UAV routes to minimize the total mission time while meeting the operational constraints. A Mixed Integer Programming (MIP) model, which could be solved by commercial software, is constructed to describe this problem. In order to quickly solve the medium-scale problems, two existing heuristics to solve 2E-VRP are improved. The computational experiments are set up to compare our model with the 2E-VRP. The results indicate that the 2E-GUCRP obtains a better efficiency. Further discussion of the practical instance points out that the increase in efficiency is related to the speed relationship between the GV and the UAV.

Unmanned delivery technology using unmanned aerial vehicles (UAVs) has the potential to solve issues such as traffic congestion and labor shortages. We investigated a method to construct a route between the source and destination nodes in a wireless multi-hop network by installing a radio terminal in each house. If the relay functions of all nodes in the network are in operation, the number of control messages for route construction increases, and the message relay forwarding load of each node increases. Keeping all node pairs multi-hop connectivity, we establish a method to operate the relay function with as few nodes as possible. End nodes that have not activated the relay function connect to the relay node with the closest physical distance. In this paper, we propose methods for selecting nodes to operate the relay function. Specifically, one method is based on random selection, another method is based on the number of adjacent nodes, and a third method is based on the Multipoint Relay (MPR) of the Optimized Link State Routing Protocol (OLSR). For each method, we evaluate whether the route construction is available, the number of relay nodes, the total distance of constructed routes, and the distance in population-dense regions. We clarify the characteristics of each method, and the method based on MPR is the best for constructing a network suitable for UAV navigation routes. In addition, the smaller the number of relay nodes, the more unexpected collisions on the links due to route conflicts. We clarify the minimum node density required to apply the MPR method which reduces the number of relay nodes suppressing route conflicts.

The Mine Internet of Things (MIoT), as a key technology for reconstructing post-disaster communication networks, enables to realize the safety monitoring and controlling of the affected roadway. However, due to the challenging underground mine environment, the MIoT suffers from severe signal attenuation, vulnerable nodes, and limited energy, which result in low network reliability of the post-disaster MIoT. To improve the transmission reliability as well as to reduce energy consumption, a directional-area-forwarding-based energy-efficient opportunistic routing (DEOR) for the post-disaster MIoT is proposed. DEOR defines a forwarding zone (FZ) for each node to route packets toward the sink. The candidate forwarding set (CFS) is constructed by the nodes within the FZ that satisfy the energy constraint and the neighboring node degree constraint. The nodes in CFS are prioritized based on the routing quality evaluation by taking the local attributes of nodes into consideration, such as the directional angle, transmission distance, and residual energy. DEOR adopts a recovery mechanism to address the issue of void nodes. The simulation results validate that the proposed DEOR outperforms ORR, OBRN and ECSOR in terms of energy consumption, average hop count, packet delivery rate, and network lifetime.

The development of wireless sensor networks (WSNs) technology comes with inherent limitations and vulnerabilities that make it exploitable by intruders. The fundamental goal of this article is to solve security problems related to black hole attacks, which interfere with the proper performance of the network and can lead to data leakage and loss. The proposed solution in this article is to apply IDS to a WSN for the first time. We also used the NS2.35 simulator to compare the three routing protocols, AODV, AODV under Hacker Node (HNAODV), and the proposed solution (IDSHNAODV) in the WSN model to reduce the effects of black hole attacks.

This paper proposes a hybrid medium access control (MAC) protocol for wireless sensor network (WSN) data gathering, employing unmanned aerial vehicles (UAV). The UAV sends a beacon frame periodically to inform sensor nodes regarding its presence. Afterward, each sensor node which receives beacon frame contends to send registration frame to the UAV. The UAV will transmit the second beacon frame to the registered nodes to notify their transmission schedule. The time-slot scheme is used for the transmission schedule. The transmission schedule of each sensor is determined based on their priority. Specifically, the priority of each sensor is determined during the registration process. Furthermore, the architecture of UAV-WSN data gathering system is introduced in this paper. Simulations are performed, showing that the proposed MAC protocol achieves fairness while enhancing network performance.

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implement FQ-AGO on the NS-3 simulator and compare the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we consider various network metrics to compare the performance of the routing protocols. Our simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay.

During the postpartum period, psychological disorders may emerge. Aims and objectives: 1 With the current study, we aim to raise awareness among healthcare professionals about postpartum depression (PPD) in women. To reach the aim we will perform the following tasks: (i) identify biological peripartum risk factors and calculate pooled prevalence of PPD for each of them; (ii) explore the strength of relationship between peripartum risk factors and PPD; (iii) rank the predictors by their prevalence and magnitude of association with PPD. The knowledge obtained will support the development and implementation of early diagnostic and preventive strategies. Methods and analysis: we will systematically go through peer-reviewed publications available in the PubMed search engine and online databases: Scopus, Web of Science, EMBASE. The scope of the review will include articles published any time in English, Arabic, or Polish. We will deduplicate literature sources with the Covidence software, evaluate heterogeneity between the study results, and critically assess credibility of selected articles with the Joanna Briggs Institute’s bias evaluation tool. The information to extract is incidence rate, prevalence, and odds ratio between each risk factor and PPD. A comprehensive analysis of the extracted data will allow us to achive the objectives. The study findings will contribute to risk stratification and more effective management of PPD in women.

This research proposes an algorithm to sign messages using the ElGamal asymmetric cryptosystem, called: Digital signature algorithm based on ElGamal, Diffie-Hellman protocol and the number π (DSAπ). This proposal has a high level of security like the DSA standard, in addition, execution times are reduced in relation to it. The Diffie-Hellman protocol and the number π were used in the construction of the digital signature algorithm in conjunction with the Hash-Sha-512 function. Some experiments are presented to provide evidence that the bits on the right side of the decimal point of π appear randomly, such as: a color image was constructed of a string of consecutive bits chosen at random, of the number π. Subsequently, parameters such as: entropy, correlation, discrete Fourier transform, goodness-of-fit test χ2 were evaluated. It is mentioned that an S-box 8×8 is involved in the signature. The sensitivity of the signature was measured, that is, when small changes are made to the sender’s private key, or small changes to the message. Finally, an image was constructed using the signatures of random texts, and subsequently the randomness of its pixels was obtained, to verify that there is no relationship between the different signatures.

In recent years, drones have become increasingly prevalent in a wide range of applications, performing complex and critical tasks. To accomplish these tasks, drones cooperate by forming a Fly Ad-hoc Network (FANET) using specific routing protocols for communication. However, most of the routing protocols used in this type of network lack appropriate built-in security mechanisms, which creates numerous security challenges and concerns. To reduce the resulting security vulnerabilities and mitigate the impact of potential attacks, it is crucial to address these challenges before any deployment of FANETs. In this paper, we address two of the most harmful routing attacks - Sybil and Gray Hole and propose mitigating techniques to alleviate these attacks on FANET routing protocols. The proposed solution is secGPSR a secure version of the Greedy Perimeter Stateless Routing Protocol (GPSR). We validate the robustness of secGPSR through simulation using Omnet++ and present the results which show its effectiveness against Sybil and Gray Hole attacks.

Background: When we talk about zoonoses, it is undeniable that we have a human and animal population that has been isolated in studies over time. Besides human and animal health, zoonoses also impact the economy and society. Therefore, the integration of the analysis in this area is essential to optimize resources in public health decisions. We have new challenges in public health that we need to overcome in a more comprehensive method such as One Health. For better measures in public health, the dual burden of zoonoses seems a logical way to determine the integral impact of such diseases in society and thus take better measures to prevent and reduce the impact of these diseases. Methods: We follow the guidelines for “Preferred Reporting Items for Systematic reviews and Meta-Analyses (PRISMA). We search human and animal zoonoses on Embase, Ovid Medline, Scopus, Web of Science, and Google Scholar, from an unrestricted period until November 2021. For the search, we consider the Disability Adjusted Life Years (DALYs) for the human zoonotic burden and the animal zoonotic burden in monetary terms. A librarian collaborates to optimize the search string for the databases, and two reviewers screen eligible articles (first by title, then by abstracts, and finally, by full-text assessment.) For the analysis, we aim to convert the burden of zoonoses of all selected studies into the zoonotic Disability Adjusted Life Years (zDALYs) – including the human and animal components. Discussion: The study results will provide information on published studies that have accounted for the dual burden of zoonoses (both human and animal health aspects.) In addition, the synthesis of the available literature will address the knowledge gap in this area in order to know to what extent it is possible to convert the burden of human zoonoses to the animal burden of zoonoses and integrate them into a more comprehensive approach (dual burden of zoonoses.)

Background: The gut microbiome plays a major role in chronic diseases, of which several are characterized by an altered composition and diversity of bacterial communities. Large-scale sequencing projects allowed characterizing the perturbations of these communities. However, translating these discoveries into clinical applications remains a challenges. To facilitate routine implementation of microbiome profiling in clinical settings, portable, real-time, and low-cost sequencing technologies are needed. Results: Here, we propose a computational and experimental protocol for whole genome quantitative metagenomics studies of human gut microbiome with Oxford Nanopore sequencing technology (ONT) that could be applied to other microbial ecosystems. We developed a bioinformatic protocol to analyse ONT sequences taxonomically and functionally and optimized pre-analytic protocols including stool collection and DNA extraction methods to maximize read length. This is a critical parameter for the sequence alignment and classification. Our protocol was evaluated using simulations of metagenomic communities which reflect naturally occuring compositional variations. Next, we validated both protocols using stool samples from a bariatric surgery cohort, sequenced with ONT, Illumina and SOLiD technologies. Results revealed similar diversity and microbial composition profiles. Conclusion: This protocol can be implemented in the clinical or research setting, bringing rapid personalized whole genome profiling of target microbiome species.

Various heterogeneous devices or objects shall be integrated for transplant and seamless communication under the umbrella of internet of things (IoT). It would facilitate the open accession of data for the growth of a glut of digital services. To build a general framework of IoT is very complex task because of heterogeneity in devices, technologies, platforms and services, operating in the same system. In this paper, we mainly focus on the framework for big data analytics in smart city applications , which being a broad category specifies the different domains for each application. IoT is intended to support the vision of Smart City, where advance technologies will be used for communication for the quality life of citizens. A novel approach used in this paper, is for enhancing the energy conservation and to reduce the delay in big data gathering at tiny sensor nodes used in IoT framework. To implement the smart city scenario in terms of big data in IoT, an efficient (optimized in quality of service) WSN is required where communication of nodes is energy effcient. That is why, a new protocol QoS-IoT is proposed on the top layer of the architecture which is validated over the traditional protocols.

Using multi-color flow cytometry analysis, we studied the immunophenotypical differences between leukemic blasts/LSCs from patients with AML/MDS and hematopoietic stem and progenitor cells (HSPCs) from patients in complete remission (CR) following their successful treatment. The panel of markers included CD34, CD38, CD45RA, CD123 as representatives for a hierarchical hematopoietic stem and progenitor cell (HSPC) classification as well as programmed death ligand 1 (PD-L1). Rather than restricting the evaluation on a 2- or 3-dimensional analysis, we applied a t-distributed stochastic neighbor embedding (t-SNE) approach to get a deeper insight and segregation between leukemic and normal HPSCs. For that purpose, we created a t-SNE map, which resulted in the visualization of 27 cell clusters based on their similarity concerning the composition and intensity of antigen expression. Two of these clusters were “leukemia-related” containing a great proportion of CD34⁺/CD38^- hematopoietic stem cells (HSCs) or CD34⁺ cells with a strong coexpression of CD45RA/CD123, respectively. CD34⁺ cells within the latter cluster were also highly positive for PD-L1 reflecting their immunosuppressive capacity. Beyond this proof of principle study, the inclusion of additional markers will be helpful to refine the differentiation between normal HSPCs and leukemic cells, particularly in the context of minimal disease detection and antigen-targeted therapeutic interventions. Furthermore, we suggest a protocol for the assignment of new cell ensembles in quantitative terms, via a numerical value, the Pearson coefficient, based on a similarity comparison of the t-SNE pattern with a reference.

Due to the broadening of services from industrial enterprises to customers, the industrial network has gained more significance than what is really thought. As a part of this revolution, this paper tried to introduce the best suitable routing option for the healthcare, banking and internet services industries to optimize the routing department of their enterprises. RIP is not associated with this study, being out of favor in the industries due to hop count limitation. The idea behind doing such a thing is to avoid improper implantation of routing inside the enterprises which causes lack of optimization in routing department. The method which is selected for this paper is qualitative case study of banking, healthcare and internet services industries with unstructured interviews of IT experts of the respected industries in an open-ended questions fashion. The results were illustrated based on the stories and the discussion of the stories is the main contributor to the result of the study. The evaluation results of the stories have illustrated, that EIGRP is a suitable routing option for health care and banking, while OSPF can be suitable for the internet services industry. The implication of the study can be optimized network of industries such as healthcare, banking and internet services and it introduces the best suitable routing option for the demanded industries with the case study method and narrative analysis of the stories, which start from load balancing type and ends to demanded routing protocol, while reaching to demanded routing protocol, it introduces the best suitable routing option of that industry

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.

In this paper, a model of the hub covering the location-routing problem with simultaneous delivery and pickup should be designed in order to minimize the total costs, minimize the maximum vehicles travel time and minimize the amount of CO_2 gas emissions. Two-stage stochastic programming is used in this paper to control the uncertainty parameters of the problem. The mathematical model aims to decide the appropriate location of hubs and vehicle routing for simultaneous delivery and pickup of products. In this regard, the results obtained from the LP-Metric method show that there is a conflict between the objective functions, and with the reduction of the amount of CO_2 gas emissions and the reduction of the maximum vehicles travel time, the total costs have increased. On the other hand, by examining the economical factor, it was observed that by reducing this factor, the robustness factors are changed and the total costs of the network are reduced. MOIWO and MOALO were used to solve the problem in large scale, the result of which was the existence of a significant difference between the calculation time averages. Also, the efficiency of these methods was very high compared to the LP-Metric method and the maximum relative difference was less than 2.83%. The results of numerical examples show a higher efficiency of the MOALO than the MOIWO.

A lot of previous research have proposed various frameworks and algorithms to optimize routes to reduce the total transportation cost, which accounts for over 70% of overall logistics cost. However, it is very hard to find the cases applied the mathematical models or algorithms to the practical business environment cases, especially daily operating logistics services like convenient stores. Most of previous research have considered the developing an optimal algorithm which can solve the mathematical problem within the practical time while satisfying all constraints such as the capacity of delivery and pick-up, and time windows. For the daily pick-up and delivery service like supporting several convenient stores, it is required to consider the unit transporting container as well as the demand, capacity of trucks, traveling distance and traffic congestion. Especially, the reusable transporting container, trays, should be regarded as the important asset of logistics center. However, if the mathematical model focuses on only satisfying constraints related delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this research, it has been proposed to build the mathematical model for optimizing pick-up and delivery plans by extending the general vehicle routing problem of simultaneous delivery and pickup with time windows while considering left-over cost. With the numerical experiments, it has been proved that the proposed model may reduce the total delivery cost. It may be possible to apply the proposed approach to the various logistics business which uses the reusable transporting container like shipping containers, refrigerating containers, trays, and pallets.

Plant DNA extraction techniques are well-established, featuring a variety of protocols tailored to the needs of individual laboratories or research goals. Currently, there is a strong demand for plant DNA extraction methods that are rapid, cost-effective, and uncomplicated. We have devised an optimized protocol for plant DNA extraction that eliminates the need for liquid nitrogen. DNA was extracted from leaves of Inga feuilleei (pacae) in the Cañete Valley using a basic cetyltrimethylammonium bromide method. Subsequently, the extracted DNA was quantified and assessed for quality through agarose gel electrophoresis. This protocol holds the potential to significantly reduce costs in laboratories engaged in routine DNA extraction for genetic diversity and gene expression analyses. It addresses challenges encountered by other conventional methods, particularly in situations where they have proven ineffective due to issues related to explant, sample conditions, and the quantity and quality of nucleic acids. This is especially pertinent for numerous laboratories in developing countries where constraints related to the cost and availability of liquid nitrogen may be a limiting factor. Furthermore, this is the first study reported in this species for genomic studies.

Background: Fingertip injuries with volar pulp tissue defects are challenging to manage due to the complex anatomy and critical role of the fingertip in sensory and motor functions. Traditional surgical approaches are associated with donor site morbidity, prolonged immobilization, and suboptimal functional outcomes. This study aimed to evaluate the efficacy of a conservative treatment protocol using artificial dermis and semi-occlusive dressing for these injuries. Methods: A single-center, prospective study was conducted on 31 patients with fingertip injuries involving volar pulp defects. The treatment protocol involved wound debridement, application of artificial dermis (Pelnac®), and semi-occlusive dressing (IV3000®). Outcomes were assessed using subjective questionnaires and objective measures, including fingerprint regeneration, sensory function, pain, and cosmetic appearance. The impact of injury characteristics on outcomes and treatment duration was evaluated. Complications were recorded, and patient satisfaction was assessed. Results: The mean treatment duration was 45.29 days (SD=17.53), with no significant differences based on injury characteristics. Complications were minimal, with only one case (3.22%) directly attributable to the treatment. Fingerprint regeneration was considerable (mean score=2.58, SD=0.67), with slightly better scores in bone-exposed injuries. Sensory disturbances were minimal, with no significant differences across injury types. Post-treatment pain was low (mean=0.45, SD=0.67), and cosmetic satisfaction was high (mean=4.09, SD=0.94). Overall patient satisfaction was high (mean=4.41, SD=0.67), regardless of injury severity. Discussion: This study demonstrates the efficacy of a conservative approach using artificial dermis and semi-occlusive dressing for fingertip injuries with volar pulp defects. The treatment protocol achieved favorable outcomes in tissue regeneration, sensory recovery, pain management, and cosmetic appearance while minimizing complications and morbidity associated with traditional surgical interventions. The high patient satisfaction across all injury types highlights the patient-centered nature of this approach. Conclusions: The conservative treatment protocol using artificial dermis and semi-occlusive dressing is a promising strategy for managing fingertip injuries with volar pulp defects. This approach harnesses the body's regenerative potential, minimizes surgical morbidity, and achieves excellent functional and aesthetic outcomes. Further research is needed to optimize treatment protocols and investigate long-term outcomes.

Background: Nearly two-thirds of acute stroke patients have dysphagia. Dysphagia is difficulty to swallow food or liquids. Early detection of dysphagia is crucial in stroke patients as a result of increased morbidity and mortality due to malnutrition and respiratory tract infections. Aim: Our purpose was to conduct a literature review of dysphagia screening for stroke patient. Methods: We used the bolean operator to search articles of “or” and “and” with the key words were "Dysphagia" or “Screening”, AND "Stroke" or Acute Stroke” AND "Nursing". Data based used were Scopus, Proquest and Science Direct with inclusion criteria using full text in English which published from 2019 to 2021. We obtained 240 articles and then we screened by reading the main focus of articles with paying attention to the topics and the suitability of article content.Result: Twenty five publications relating to dysphagia screening met the inclusion criteria. There are five methods of dysphagia screening performed by nurses or other health workers: 1) a simple Questionnaire Test (4QT) method; 2) Water Swallow Test (WST) method; 3) Bed Side Screening Tool for Dysphagia (BSTD) method; 4) Volume Viscosity Swallow Test (V-VST) method; 5) EAT-10 method.Conclusion: screening is the first step in the identification of swallowing impairment or dysphagia of stroke patient. Dysphagia is an independent predictor of poor patient outcome and prolonged recovery time. Nurse has an important role to conduct a screening and must ensure that the selected tools has high reliability and concurrent validity. Key Words: Dysphagia, Nursing, Screening, Stroke

ABSTRACT Background: Nearly two-thirds of acute stroke patients have dysphagia. Dysphagia defined as difficulty in swallowing of liquids or food, vary in severity with symptoms ranging from mild throat discomfort to inability to eat. It’s well known that dysphagia is associated with aspiration pneumonia, dehydration, malnutrition, prolonged length of stay, and increased mortality. Early screening reduces pneumonia rates in stroke and it is usually performed by nurses. Dysphagia screening is recommended but no protocol or tool is pointed.Aim: the aim of this study is to conduct a literature review of dysphagia screening for stroke patient Methods: Literature search three databases (Scopus, Proquest, and Science Direct), with the keywords "Dysphagia" AND "Stroke" AND "Nursing", published in English between 2019 and 2021. Result: Twenty five publications relating to dysphagia screening met the inclusion criteria. There are five methods of dysphagia screening performed by nurses or other health workers: 1) a simple Questionnaire Test (4QT) method, which is by asking the following four questions: does the patient cough or choke while eating or drinking; whether the patient takes longer than usual to eat; does the patient change the thickness of the food to be able to swallow, and whether the voice turns hoarse after eating or drinking; 2) Water Swallow Test (WST) method; 3) Bed Side Screening Tool for Dysphagia (BSTD) method; 4) Volume Viscosity Swallow Test (V-VST) method, namely modification of feeding with first pudding, nectar and finally water; 5) Simplified Cough Test Method. The five screening methods for dysphagia above have been tested for sensitivity and specificity, as well as positive and negative predictive valuesConclusion: screening is a first step in the identification of swallowing impairment or dysphagia of stroke patient. Dysphagia is an independent predictor of poor patient outcome and prolonged recovery time. Nurse has an important role to conduct a screening and must ensure that the selected tools has high reliability and concurrent validity. Key Words: Stroke, Dysphagia, Screening, Nursing

Product counterfeiting is an on-going problem in supply chains and retail environments, Recently an anti-counterfeiting protocol to address this issue via cost-effective use of auto-identification technologies such as radio-frequency identification (RFID) was proposed by researchers.Yet the use case of re-selling the same product was not been fully addressed which might cause serious problem for the exciting and proposed schemes and transactions. This paper proposes an extended RFID-based anti-counterfeiting to address the use case of the original buyer reselling the same item to a second buyer. The extended scheme will be followed by a formal security analysis to show that the proposed protocol satisfies the requirements of security correctness and is resistant to compromise through security attacks.

Cooperative non-orthogonal multiple access (CNOMA) has been recently adapted with energy harvesting (EH) to increase energy efficiency and extend the lifetime of energy-constrained wireless networks. In EH, two protocols are usually used for CNOMA, namely, power splitting (PS) and time switching (TS). In order to improve the existing EH protocols, this paper investigates a hybrid EH protocol-assisted CNOMA, which is a combination of the two aforementioned main existing EH protocols. The end-to-end bit error rate (BER) and outage probability (OP) expressions of users in our scheme are derived over Nakagami-m fading channels. For the sake of comparison and to highlight the achievable gains, the performance of the hybrid EH (HEH) protocol is compared with the benchmark schemes (i.e., existing EH protocols and no-EH). Based on extensive simulations, it is shown that the analytical results match perfectly with simulations which demonstrates the correctness of the derivations. Numerical results clearly indicate the superiority of the proposed scheme over all the considered benchmarks. In addition, we discuss the optimum value of EH factors to minimize the error and outage in the proposed scheme and show that an optimum value can be obtained according to channel parameters.

The high-speed railway operation environment monitoring network system has a wide variety of sensors and inconsistent business requirements, which have certain requirements for data transmission delay and network life. Most of the previous research focuses only on prolonging network lifetime or reducing data transmission delays when designing or optimizing routing protocols, without co-designing the two. In addition, due to the harsh operating environment of high-speed railways, when the network changes dynamically, the traditional routing algorithm will generate unnecessary redesigns and lead to high overhead. Based on the actual needs of high-speed railway operation environment monitoring, this paper proposes a novel Double Q-values adaptive model combined with the existing reinforcement learning method, which considers the energy balance of the network and real-time data transmission, and constructs energy saving and delay. The two-dimensional reward avoids the extra overhead of maintaining a global routing table while capturing network dynamics. In addition, the adaptive weight coefficient is used to ensure the adaptability of the model to each business of the high-speed railway operation environment monitoring system. Finally, simulations and performance evaluations are carried out and compared with previous studies.Finally, simulations and performance evaluations are carried out and compared with previous studies. The results show that the proposed routing algorithm successfully extends the network’s life cycle and gets good real-time data performance. It also saves energy and has fewer delays than the other three routing protocols in different situations.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

(1) Background: The proportion of fully mechanized harvesting systems in Austria is constantly increasing especially because of the technological development of the machines, which allows them to drive on increasingly steep terrain. This leads to additional challenges and potential hazards for the operators, which may also cause higher stress levels. The purpose of this study is to develop and debate a new set of methodologies for determining time and space resolved psychophysiology data to analyze stressful and non-stressful work situations for harvester and forwarder operators; (2) Methods: we suggest a study protocol to analyze a) tasks performed by the driver, b) environmental factors, like slope gradient, c) the psychophysiological response of experts during these tasks, and d) evaluate the worker´s subjective stress and fatigue before and after a harvest operation. (3) Results: Within this manuscript we present a study protocol based on quantitative and qualitative methods, like time and space resolved psychophysiology, questionnaires, qualitative interviews, as well as video and sensor-based analysis of environmental and machine data. The first results from real measurements of a forwarder driver are presented; (4) Conclusions: This multimodal research protocol serves to explore the relationship between stress, fatigue, and performed tasks. Through our quantitative and qualitative methodology, researchers can improve the health and safety of forest workers at work, improve their productivity and reduce damage to remaining trees.

The use of the un-indexed web, commonly known as the deep web and dark web, to commit or facilitate criminal activity has drastically increased over the past decade. The dark web is an infamously dangerous place where all kinds of criminal activities take place, despite advances in web forensics techniques, tools, and methodologies, few studies have formally tackled the dark and deep web forensics and the technical differences in terms of investigative techniques and artefacts identification and extraction. This research proposes a novel and comprehensive protocol to guide and assist digital forensics professionals in investigating crimes committed on or via the deep and dark web, the protocol named D2WFP establishes a new sequential approach for performing tasks and subtasks to improve the accuracy and effectiveness of current tools' output. Quantitative and qualitative research has been conducted by testing the protocol following a comprehensive and rigorous process in different scenarios and the obtained results show an apparent increase in the number of artefacts recovered when adopting D2WFP. The second contribution of D2WFP is the artefacts correlation and cross-validation which enables Digital Forensics professionals to better document and structure their analysis of host-based deep and dark web browsing artefacts.

Underwater Wireless Sensor Networks (UWSN) enables various oceanic applications which require effective packet transmission. In this case, sparse node distribution, dynamic network topology and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a Relay based Void Hole Prevention and Repair protocol (ReVOHPR) by multiple Autonomous Underwater Vehicles (AUV) for UWSN. ReVOHPR efficiently identifies and avoids void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as Ocean Depth (levels) based Equal Cluster Formation, Dynamic Sleep Scheduling, Virtual Graph based Routing, and Relay Assisted Void Hole Repair. For energy efficient cluster forming, Entropy based Eligibility Ranking (E2R) is presented which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented Dynamic Kernel Kalman Filter (DK2F) algorithm in which Sleep and Active modes based on the nodes current status. Inter Cluster Routing is performed by maximum matching nodes which selects by Dual criteria and also data transmitted to AUV. Finally, void holes are detected and repair by Bi-Criteria Mayfly Optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes, data packet loss and maximizes Quality of Service (QoS) and energy efficiency of the networks. This protocol is timely deal with node failures in packet transmission via multi-hop routing. Simulation is implemented by NS3 (AquaSim module) simulator that evaluates the performance in network simulation for following metrics as average energy consumption, delay, packet delivery rate and throughput.

Smart grid capabilities have grown significantly in recent years. The smart grid provides advanced real-time handling of faults, advanced automatic control for efficient electricity transmission, monitoring and collection of the electrical system's capacity, and communication for information sharing. Unfortunately, its exposure to public networks makes it increasingly vulnerable to privacy breaches, vulnerabilities, and cyber-attacks. Cyber security threats and vulnerabilities in smart grid networks have become a primary concern that needs to be addressed before deploying a smart grid. Furthermore, the wide range of protocols increases the attack surface of a smart grid. This study focuses on the vulnerability of Modbus, which is regarded as one of the most prevalent protocols in smart grid communication networks. This paper presents preliminary findings of analyzing cyber-attacks against the Modbus protocol using a virtual testbed to investigate its effects on the smart grid network protocol. The concept incorporates an emulated Modbus/TCP network environment built from open-source software components that imitate fundamental industrial control features of the smart grid. Finally, we analyze the cycle of a cyber-attack leading through Reconnaissance to a DoS attack on the Modbus/TCP protocol and propose improvements to the test bed for protocol attack detection and mitigation.

In videos, the human's actions are of three-dimensional (3D) signals. These videos investigate the spatiotemporal knowledge of human behavior. The promising ability is investigated using 3D convolution neural networks (CNNs). The 3D CNNs have not yet achieved high output for their well-established two-dimensional (2D) equivalents in still photographs. Board 3D Convolutional Memory and Spatiotemporal fusion face training difficulty preventing 3D CNN from accomplishing remarkable evaluation. In this paper, we implement Hybrid Deep Learning Architecture that combines STIP and 3D CNN features to enhance the performance of 3D videos effectively. After implementation, the more detailed and deeper charting for training in each circle of space-time fusion. The training model further enhances the results after handling complicated evaluations of models. The video classification model is used in this implemented model. Intelligent 3D Network Protocol for Multimedia Data Classification using Deep Learning is introduced to further understand space-time association in human endeavors. In the implementation of the result, the well-known dataset, i.e., UCF101 to, evaluates the performance of the proposed hybrid technique. The results beat the proposed hybrid technique that substantially beats the initial 3D CNNs. The results are compared with state-of-the-art frameworks from literature for action recognition on UCF101 with an accuracy of 95%.

This paper presents the development, comparison and analysis of several implementations of the B92 Quantum Key Distribution (QKD) protocol. In order to achieve this objective a prototype which consists of traditional (non-quantum) simulators was created, one for B92 protocol, one for B92 protocol with eavesdropper and one for B92 protocol with Quantum Bit Travel Time (QBTT) eavesdropper detection method. The principles of quantum mechanics were studied, as a foundation of quantum cryptography, for the realization of simulation programs that were written in C ++, focusing mainly on the B92 protocol and QBTT eavesdropper detection method. We compared the Quantum Bit Error Rate (QBER) for implementation of B92 protocol without eavesdropper, B92 protocol with eavesdropper and B92 protocol with QBTT eavesdropper detection method and found that QBTT eavesdropper detection method significantly reduces the QBER from the final key.

In recent years, the internet of things has been widely utilized in various fields, such as in smart factories or connected cars. As its domain of application has expanded, it has begun to be employed using multi-server architectures for a more efficient use of resources. However, because users wishing to receive IoT services connect to multi-servers over wireless networks, this can expose systems to various attacks and result in serious security risks. To protect systems (and users) from potential security vulnerabilities, a secure authentication technology is necessary. In this paper, we propose a smart card-based authentication protocol, which performs the authentication for each entity by allowing users to go through the authentication process using a smart card transmitted from an authentication server, and to login to a server connected to the IoT. Furthermore, the security of our proposed authentication protocol is verified by simulating a formal verification scenario using AVISPA, a security protocol-verification tool.

In airborne sensor networks (ASNs), the media access control (MAC) protocol is facing with serious unfairness problem due to the traditional protection mechanism of air-to-air communications among aircrafts. Actually by using the binary exponential back-off algorithm at high traffic loads to minimize collisions among users, the latest successful node can always benefit from this kind of MAC to obtain channel resources. Moreover, when taking the existence of the hidden nodes in ASNs into account, the inaccurate traffic load information will further aggravate the system’s unfairness. In this paper, a neighbor-channel-aware (NCA) protocol is proposed to improve the fairness of MAC protocol in ASNs. In the proposal, the NCA frame is firstly added and exchanged between neighbor nodes periodically, which helps to resolve the inaccurate traffic load information, so as to avoid reducing the probability of successful message transmission. Then a traffic-loading based back-off algorithm is involved to make the neighbor nodes cooperatively adjust the inter-frame space (IFS) interval to further reduce the unfairness. The simulation results show that, the proposed MAC protocol can guarantee the satisfied fairness, simultaneously avoiding heavy network overloads to protect key messages’ successful transmissions in ASNs.

Introduction: Postpartum hypertension (PPHT) is hypertension that persists or develops directly after pregnancy. PPHT affects 10% of pregnancies and is the most common cause for re-hospitalization after giving birth. In general, PPHT stems from hypertensive disorders of pregnancy (HDP). The aim of the current interim report of the Basel PPHT registry is to describe the cohort, and to determine feasibility and acceptance of a home-based telemonitoring management strategy (HBTMS) in women with PPHT. Methods: Enrollment in the cohort began in June 2020 during the SARS-CoV-2 pandemic at the University Hospital Basel. Women in the maternity ward were screened for preexisting hypertension, HDP, and de novo postpartum hypertension and after consenting, were enrolled. In this pragmatic non-randomized prospective trial, women in the PPHT cohort could choose, between a HBTMS or usual care which consisted of in-hospital appointments at the hypertension clinic. HBTMS was defined as a smartphone application or a programmed spreadsheet to report blood pressure followed by telephone consultations. Standard of care was hospital-based visits as clinically needed after discharge. All participants were assessed three months after delivery with a standardized clinical visit including a 24-hour blood pressure measurement, blood, biomarker, and urine analysis. Results: 311 participants were enrolled from 06/20-08/23. Mean age was 34±5.3 years. Regarding pregnancy-related medical history: 10 % had preexisting hypertension, 27.3 % gestational hypertension, 53% preeclampsia (PE), 0.3% eclampsia, 6% HELLP (Hemolysis, Elevated Liver enzymes and Low Platelets) and 18.3% had de novo PPHT. More than one diagnosis was possible. Family history of cardiovascular disease was seen in 49.5%, 7.5% had a family history of PE. 23.3% were determined as high risk for PE during pregnancy. The most common type of delivery was C-Section (68.5%), mean hospital stay was 6.3 days (±3.9) and IUGR (intrauterine growth restriction) was seen in 21% of the newborns. 99% of participants chose a home-based management strategy. Conclusion: This first description of the Basel PPHT Cohort showed that a HBTMS is well accepted. This is particularly relevant in the direct postpartum period and even more pertinent when the exposure of hospital visits should be avoided when possible.

An enormous interest in the development of efficient protocols for cellulose extraction has been demonstrated in the last years, however, they were usually based on non-sustainable chemical and thermal approaches. In this work we describe a new and more sustainable method for cellulose extraction from eucalyptus and pine tree wood waste products exclusively performed using microwave-assisted radiation. The methodology includes 3 main steps: i) alkaline treatment; ii) bleaching I, using H2O2; and iii) bleaching II, an acidic treatment. Samples obtained in each step were characterized by Fourier-transform Infrared (FTIR) spectroscopy, powder X-ray diffraction (PXRD), thermogravimetric analysis (TGA) and differential scanning calorimetry (DSC). The results were compared with those of starting materials, with the commercially available microcrystalline cellulose and with an industrial paper pulp. Results confirmed that for both type of wood wastes, cellulose was retained during the extractions procedures and that the removal of hemicellulose was achieved at the last step as seen by the FTIR spectra and TGA curves. The developed protocol is innovative since it constitutes an easy and quick approach to extract cellulose, from eucalyptus and pine tree wood waste using mild chemical and thermal conditions, microwave irradiation, and environmentally friendly purification steps. This approach offers the possibility of a future scale-up study to potentially apply the develop protocol to the extraction of cellulose in an industrial scale.

Background: Malnutrition has negative consequences in hospitals, like poor disease recovery, increased mortality, length of hospitalization, readmission, and health care costs.Aims: This review was designed to determine malnutrition prevalence in hospitals located in eastern Mediterranean region (EMR).Study design: To conduct this systematic review, papers, including original articles, related references and conference proceedings on the prevalence of malnutrition in adult hospitalized patients published in international journals and scientific databases from 1 Jan 2017 to 31 Jan 2022 will be included. The following keywords and their alternatives will be used in the literature search: malnutrition, patient, and EMR. The protocol has been registered at PROSPERO (code: CRD42022339426).Methods: After initial screening based on inclusion and exclusion criteria, the full text articles will be read carefully and eligible documents will be selected according to the defined objectives. Afterward, the selected papers will be reviewed for methodological quality and the required information will be extracted. Finally, in case of sufficient data, a meta-analysis will be performed. Screening, selection, quality assessment, and data extraction will be done by at least two independent reviewers.Results: This review is ongoing and will be completed until the end of year 2023.Conclusion: This review aims to provide comprehensive evidence about the prevalence of malnutrition among adult inpatients in EMR hospitals. This can provide regional authorities, health managers and policy makers good information regarding current status to make appropriate decisions for promoting the health status in hospitals.

Communication infrastructures may be partially or completely destroyed due to the natural disasters, especially the disruption of a few critical network devices, leading to the collapse of communication services.To address this issue, we constructed a layered, multi-domain data transmission architecture based on a UAV-assisted resilient network. Initially, the UAV controllers perceived the network status and learning the temporal- spatial characteristics of air-to-ground networks links. Subsequently, we developed a multi-domain routing algorithm based on federated reinforcement distillation, called FedRDR, enhancing the generalization capabilities of routing decision model through the augmentation of training data samples.We conducted simulation experiments, and the results indicate that the FedRDR algorithm has an average communication data volume of approximately 45.3KB between each domain controller and server. Compared to parameter transmission through the federated reinforcement learning algorithm, FedRDR can reduce the amount of transmitted parameters by approximately 29\%. Therefore, the FedRDR routing algorithm promotes knowledge transfer, accelerates the training process of intra-domain intelligent agents, and decreases the communication data volume between domain controllers and servers.