Precision and Robust Models on Healthcare Institution Federated Learning for Predicting HCC on Portal Venous CT Images.

Hepatocellular carcinoma (HCC), the most common type of liver cancer, poses significant challenges in detection and diagnosis. Medical imaging, especially computed tomography (CT), is pivotal in non-invasively identifying this disease, requiring substantial expertise for interpretation. This research introduces an innovative strategy that integrates two-dimensional (2D) and three-dimensional (3D) deep learning models within a federated learning (FL) framework for precise segmentation of liver and tumor regions in medical images. The study utilized 131 CT scans from the Liver Tumor Segmentation (LiTS) challenge and demonstrated the superior efficiency and accuracy of the proposed Hybrid-ResUNet model with a Dice score of 0.9433 and an AUC of 0.9965 compared to ResNet and EfficientNet models. This FL approach is beneficial for conducting large-scale clinical trials while safeguarding patient privacy across healthcare settings. It facilitates active engagement in problem-solving, data collection, model development, and refinement. The study also addresses data imbalances in the FL context, showing resilience and highlighting local models' robust performance. Future research will concentrate on refining federated learning algorithms and their incorporation into the continuous implementation and deployment (CI/CD) processes in AI system operations, emphasizing the dynamic involvement of clients. We recommend a collaborative human-AI endeavor to enhance feature extraction and knowledge transfer. These improvements are intended to boost equitable and efficient data collaboration across various sectors in practical scenarios, offering a crucial guide for forthcoming research in medical AI.

Recurrent Neural Network Methods for Extracting Dynamic Balance Variables during Gait from a Single Inertial Measurement Unit.

Monitoring dynamic balance during gait is critical for fall prevention in the elderly. The current study aimed to develop recurrent neural network models for extracting balance variables from a single inertial measurement unit (IMU) placed on the sacrum during walking. Thirteen healthy young and thirteen healthy older adults wore the IMU during walking and the ground truth of the inclination angles (IA) of the center of pressure to the center of mass vector and their rates of changes (RCIA) were measured simultaneously. The IA, RCIA, and IMU data were used to train four models (uni-LSTM, bi-LSTM, uni-GRU, and bi-GRU), with 10% of the data reserved to evaluate the model errors in terms of the root-mean-squared errors (RMSEs) and percentage relative RMSEs (rRMSEs). Independent t-tests were used for between-group comparisons. The sensitivity, specificity, and Pearson's r for the effect sizes between the model-predicted data and experimental ground truth were also obtained. The bi-GRU with the weighted MSE model was found to have the highest prediction accuracy, computational efficiency, and the best ability in identifying statistical between-group differences when compared with the ground truth, which would be the best choice for the prolonged real-life monitoring of gait balance for fall risk management in the elderly.

A Trustable and Secure Usage-Based Insurance Policy Auction Mechanism and Platform Using Blockchain and Smart Contract Technologies.

This study presents an architectural framework for the blockchain-based usage-based insurance (UBI) policy auction mechanism in the internet of vehicles (IoV) applications. The main objective of this study is to analyze and design the specific blockchain architecture and management considerations for the UBI environment. An auction mechanism is developed for the UBI blockchain platform to enhance consumer trust. The study identifies correlations between driving behaviors and associated risks to determine a driver's score. A decentralized bidding algorithm is proposed and implemented on a blockchain platform using elliptic curve cryptography and first-price sealed-bid auctions. Additionally, the model incorporates intelligent contract functionality to prevent unauthorized modifications and ensure that insurance prices align with the prevailing market value. An experimental study evaluates the system's efficacy by expanding the participant pool in the bidding process to identify the winning bidder and is investigated under scenarios where varying numbers of insurance companies submit bids. The experimental results demonstrate that as the number of insurance companies increases exponentially, the temporal overhead incurred by the system exhibits only marginal growth. Moreover, the allocation of bids is accomplished within a significantly abbreviated timeframe. These findings provide evidence that supports the efficiency of the proposed algorithm.

A Near-Optimal Energy Management Mechanism Considering QoS and Fairness Requirements in Tree Structure Wireless Sensor Networks.

The rapid development of AIOT-related technologies has revolutionized various industries. The advantage of such real-time sensing, low costs, small sizes, and easy deployment makes extensive use of wireless sensor networks in various fields. However, due to the wireless transmission of data, and limited built-in power supply, controlling energy consumption and making the application of the sensor network more efficient is still an urgent problem to be solved in practice. In this study, we construct this problem as a tree structure wireless sensor network mathematical model, which mainly considers the QoS and fairness requirements. This study determines the probability of sensor activity, transmission distance, and transmission of the packet size, and thereby minimizes energy consumption. The Lagrangian Relaxation method is used to find the optimal solution with the lowest energy consumption while maintaining the network's transmission efficiency. The experimental results confirm that the decision-making speed and energy consumption can be effectively improved.

Novel Lagrange interpolation polynomials for dynamic access control in a healthcare cloud system.

The authority of user personal health records (PHRs) is usually determined by the owner of a cloud computing system. When a PHR file is accessed, a dynamic access control algorithm must be used to authenticate the users. The proposed dynamic access control algorithm is based on a novel Lagrange interpolation polynomial with timestamps, mainly functioning to authenticate the users with key information. Moreover, the inclusion of timestamps allows user access within an approved time slot to enhance the security of the healthcare cloud system. According to the security analysis results, this healthcare cloud system can effectively resist common attacks, including external attacks, internal attacks, collaborative attacks and equation-based attacks. Furthermore, the overall computational complexity of establishing and updating the polynomials is O(n*m* (log m)2), which is a promising result, where m denotes the degree of $ polynomial~G\left(x, y\right) $ and n denotes the number of secure users in the hierarchy.

A deep learning-based precision and automatic kidney segmentation system using efficient feature pyramid networks in computed tomography images.

This paper proposes an encoder-decoder architecture for kidney segmentation. A hyperparameter optimization process is implemented, including the development of a model architecture, selecting a windowing method and a loss function, and data augmentation. The model consists of EfficientNet-B5 as the encoder and a feature pyramid network as the decoder that yields the best performance with a Dice score of 0.969 on the 2019 Kidney and Kidney Tumor Segmentation Challenge dataset. The proposed model is tested with different voxel spacing, anatomical planes, and kidney and tumor volumes. Moreover, case studies are conducted to analyze segmentation outliers. Finally, five-fold cross-validation and the 3D-IRCAD-01 dataset are used to evaluate the developed model in terms of the following evaluation metrics: the Dice score, recall, precision, and the Intersection over Union score. A new development and application of artificial intelligence algorithms to solve image analysis and interpretation will be demonstrated in this paper. Overall, our experiment results show that the proposed kidney segmentation solutions in CT images can be significantly applied to clinical needs to assist surgeons in surgical planning. It enables the calculation of the total kidney volume for kidney function estimation in ADPKD and supports radiologists or doctors in disease diagnoses and disease progression.

A deep learning-based precision volume calculation approach for kidney and tumor segmentation on computed tomography images.

Previously, doctors interpreted computed tomography (CT) images based on their experience in diagnosing kidney diseases. However, with the rapid increase in CT images, such interpretations were required considerable time and effort, producing inconsistent results. Several novel neural network models were proposed to automatically identify kidney or tumor areas in CT images for solving this problem. In most of these models, only the neural network structure was modified to improve accuracy. However, data pre-processing was also a crucial step in improving the results. This study systematically discussed the necessary pre-processing methods before processing medical images in a neural network model. The experimental results were shown that the proposed pre-processing methods or models significantly improve the accuracy rate compared with the case without data pre-processing. Specifically, the dice score was improved from 0.9436 to 0.9648 for kidney segmentation and 0.7294 for all types of tumor detections. The performance was suitable for clinical applications with lower computational resources based on the proposed medical image processing methods and deep learning models. The cost efficiency and effectiveness were also achieved for automatic kidney volume calculation and tumor detection accurately.

Optimization-Based Approaches for Minimizing Deployment Costs for Wireless Sensor Networks with Bounded Estimation Errors.

As wireless sensor networks have become more prevalent, data from sensors in daily life are constantly being recorded. Due to cost or energy consumption considerations, optimization-based approaches are proposed to reduce deployed sensors and yield results within the error tolerance. The correlation-aware method is also designed in a mathematical model that combines theoretical and practical perspectives. The sensor deployment strategies, including XGBoost, Pearson correlation, and Lagrangian Relaxation (LR), are determined to minimize deployment costs while maintaining estimation errors below a given threshold. Moreover, the results significantly ensure the accuracy of the gathered information while minimizing the cost of deployment and maximizing the lifetime of the WSN. Furthermore, the proposed solution can be readily applied to sensor distribution problems in various fields.

Optimization-Based Resource Management Algorithms with Considerations of Client Satisfaction and High Availability in Elastic 5G Network Slices.

A combined edge and core cloud computing environment is a novel solution in 5G network slices. The clients' high availability requirement is a challenge because it limits the possible admission control in front of the edge cloud. This work proposes an orchestrator with a mathematical programming model in a global viewpoint to solve resource management problems and satisfying the clients' high availability requirements. The proposed Lagrangian relaxation-based approach is adopted to solve the problems at a near-optimal level for increasing the system revenue. A promising and straightforward resource management approach and several experimental cases are used to evaluate the efficiency and effectiveness. Preliminary results are presented as performance evaluations to verify the proposed approach's suitability for edge and core cloud computing environments. The proposed orchestrator significantly enables the network slicing services and efficiently enhances the clients' satisfaction of high availability.

An Optimization-Based Orchestrator for Resource Access and Operation Management in Sliced 5G Core Networks.

Network slicing is a promising technology that network operators can deploy the services by slices with heterogeneous quality of service (QoS) requirements. However, an orchestrator for network operation with efficient slice resource provisioning algorithms is essential. This work stands on Internet service provider (ISP) to design an orchestrator analyzing the critical influencing factors, namely access control, scheduling, and resource migration, to systematically evolve a sustainable network. The scalability and flexibility of resources are jointly considered. The resource management problem is formulated as a mixed-integer programming (MIP) problem. A solution approach based on Lagrangian relaxation (LR) is proposed for the orchestrator to make decisions to satisfy the high QoS applications. It can investigate the resources required for access control within a cost-efficient resource pool and consider allocating or migrating resources efficiently in each network slice. For high system utilization, the proposed mechanisms are modeled in a pay-as-you-go manner. Furthermore, the experiment results show that the proposed strategies perform the near-optimal system revenue to meet the QoS requirement by making decisions.

Breathing Sound Segmentation and Detection Using Transfer Learning Techniques on an Attention-Based Encoder-Decoder Architecture.

This paper focuses on the use of an attention-based encoder-decoder model for the task of breathing sound segmentation and detection. This study aims to accurately segment the inspiration and expiration of patients with pulmonary diseases using the proposed model. Spectrograms of the lung sound signals and labels for every time segment were used to train the model. The model would first encode the spectrogram and then detect inspiratory or expiratory sounds using the encoded image on an attention-based decoder. Physicians would be able to make a more precise diagnosis based on the more interpretable outputs with the assistance of the attention mechanism.The respiratory sounds used for training and testing were recorded from 22 participants using digital stethoscopes or anti-noising microphone sets. Experimental results showed a high 92.006% accuracy when applied 0.5 second time segments and ResNet101 as encoder. Consistent performance of the proposed method can be observed from ten-fold cross-validation experiments.

Utilizing joint routing and capacity assignment algorithms to achieve inter- and intra-group delay fairness in multi-rate multicast wireless sensor networks.

Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

An efficient Lagrangean relaxation-based object tracking algorithm in wireless sensor networks.

In this paper we propose an energy-efficient object tracking algorithm in wireless sensor networks (WSNs). Such sensor networks have to be designed to achieve energy-efficient object tracking for any given arbitrary topology. We consider in particular the bi-directional moving objects with given frequencies for each pair of sensor nodes and link transmission cost. This problem is formulated as a 0/1 integer-programming problem. A Lagrangean relaxation-based (LR-based) heuristic algorithm is proposed for solving the optimization problem. Experimental results showed that the proposed algorithm achieves near optimization in energy-efficient object tracking. Furthermore, the algorithm is very efficient and scalable in terms of the solution time.

A Novel Energy-Efficient MAC Aware Data Aggregation Routing in Wireless Sensor Networks.

Embedding data-aggregation capabilities into sensor nodes of wireless networks could save energy by reducing redundant data flow transmissions. Existing research describes the construction of data aggregation trees to maximize data aggregation times in order to reduce data transmission of redundant data. However, aggregation of more nodes on the same node will incur significant collisions. These MAC (Media Access Control) layer collisions introduce additional data retransmissions that could jeopardize the advantages of data aggregation. This paper is the first to consider the energy consumption tradeoffs between data aggregation and retransmissions in a wireless sensor network. By using the existing CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) MAC protocol, the retransmission energy consumption function is well formulated. This paper proposes a novel non-linear mathematical formulation, whose function is to minimize the total energy consumption of data transmission subject to data aggregation trees and data retransmissions. This solution approach is based on Lagrangean relaxation, in conjunction with optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithms could construct MAC aware data aggregation trees that are up to 59% more energy efficient than existing data aggregation algorithms.

Delay QoS and MAC Aware Energy-Efficient Data-Aggregation Routing in Wireless Sensor Networks.

By eliminating redundant data flows, data aggregation capabilities in wireless sensor networks could transmit less data to reduce the total energy consumption. However, additional data collisions incur extra data retransmissions. These data retransmissions not only increase the system energy consumption, but also increase link transmission delays. The decision of when and where to aggregate data depends on the trade-off between data aggregation and data retransmission. The challenges of this problem need to address the routing (layer 3) and the MAC layer retransmissions (layer 2) at the same time to identify energy-efficient data-aggregation routing assignments, and in the meantime to meet the delay QoS. In this paper, for the first time, we study this cross-layer design problem by using optimization-based heuristics. We first model this problem as a non-convex mathematical programming problem where the objective is to minimize the total energy consumption subject to the data aggregation tree and the delay QoS constraints. The objective function includes the energy in the transmission mode (data transmissions and data retransmissions) and the energy in the idle mode (to wait for data from downstream nodes in the data aggregation tree). The proposed solution approach is based on Lagrangean relaxation in conjunction with a number of optimization-based heuristics. From the computational experiments, it is shown that the proposed algorithm outperforms existing heuristics that do not take MAC layer retransmissions and the energy consumption in the idle mode into account.