Dataset Information

Lightweight Proof of Game (LPoG): A Proof of Work (PoW)'s Extended Lightweight Consensus Algorithm for Wearable Kidneys.

ABSTRACT: In healthcare, interoperability is widely adopted in the case of cross-departmental or specialization cases. As the human body demands multiple specialized and cross-disciplined medical experiments, interoperability of business entities like different departments, different specializations, the involvement of legal and government monitoring issues etc. are not sufficient to reduce the active medical cases. A patient-centric system with high capability to collect, retrieve, store or exchange data is the demand for present and future times. Such data-centric health processes would bring automated patient medication, or patient self-driven trusted and high satisfaction capabilities. However, data-centric processes are having a huge set of challenges such as security, technology, governance, adoption, deployment, integration etc. This work has explored the feasibility to integrate resource-constrained devices-based wearable kidney systems in the Industry 4.0 network and facilitates data collection, liquidity, storage, retrieval and exchange systems. Thereafter, a Healthcare 4.0 processes-based wearable kidney system is proposed that is having the blockchain technology advantages. Further, game theory-based consensus algorithms are proposed for resource-constrained devices in the kidney system. The overall system design would bring an example for the transition from the specialization or departmental-centric approach to data and patient-centric approach that would bring more transparency, trust and healthy practices in the healthcare sector. Results show a variation of 0.10 million GH/s to 0.18 million GH/s hash rate for the proposed approach. The chances of a majority attack in the proposed scheme are statistically proved to be minimum. Further Average Packet Delivery Rate (ADPR) lies between 95% to 97%, approximately, without the presence of outliers. In the presence of outliers, network performance decreases below 80% APDR (to a minimum of 41.3%) and this indicates that there are outliers present in the network. Simulation results show that the Average Throughput (AT) value lies between 120 Kbps to 250 Kbps.

SUBMITTER: Kumar A

PROVIDER: S-EPMC7287825 | biostudies-literature | 2020 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Lightweight Proof of Game (LPoG): A Proof of Work (PoW)'s Extended Lightweight Consensus Algorithm for Wearable Kidneys.

Kumar Adarsh A Kumar Sharma Deepak D Nayyar Anand A Singh Saurabh S Yoon Byungun B

Sensors (Basel, Switzerland) 20200519 10

In healthcare, interoperability is widely adopted in the case of cross-departmental or specialization cases. As the human body demands multiple specialized and cross-disciplined medical experiments, interoperability of business entities like different departments, different specializations, the involvement of legal and government monitoring issues etc. are not sufficient to reduce the active medical cases. A patient-centric system with high capability to collect, retrieve, store or exchange data ...[more]

PMID: 32438545

Similar Datasets

Project description:Object detection based on deep learning has made great progress in the past decade and has been widely used in various fields of daily life. Model lightweighting is the core of deploying target detection models on mobile or edge devices. Lightweight models have fewer parameters and lower computational costs, but are often accompanied by lower detection accuracy. Based on YOLOv5s, this article proposes an improved lightweight target detection model, which can achieve higher detection accuracy with smaller parameters. Firstly, utilizing the lightweight feature of the Ghost module, we integrated it into the C3 structure and replaced some of the C3 modules after the upsample layer on the neck network, thereby reducing the number of model parameters and expediting the model's inference process. Secondly, the coordinate attention (CA) mechanism was added to the neck to enhance the model's ability to pay attention to relevant information and improved detection accuracy. Finally, a more efficient Simplified Spatial Pyramid Pooling-Fast (SimSPPF) module was designed to enhance the stability of the model and shorten the training time of the model. In order to verify the effectiveness of the improved model, experiments were conducted using three datasets with different features. Experimental results show that the number of parameters of our model is significantly reduced by 28% compared with the original model, and mean average precision (mAP) is increased by 3.1%, 1.1% and 1.8% respectively. The model also performs better in terms of accuracy compared to existing lightweight state-of-the-art models. On three datasets with different features, mAP of the proposed model achieved 87.2%, 77.8% and 92.3%, which is better than YOLOv7tiny (81.4%, 77.7%, 90.3%), YOLOv8n (84.7%, 77.7%, 90.6%) and other advanced models. When achieving the decreased number of parameters, the improved model can successfully increase mAP, providing great reference for deploying the model on mobile or edge devices.

Project description:Motivation:Protein coding genes can be studied using long-read next generation sequencing. However, high rates of indel sequencing errors are problematic, corrupting the reading frame. Even the consensus of multiple independent sequence reads retains indel errors. To solve this problem, we introduce Reference-Informed Frame-Resolving multiple-Alignment Free template inference algorithm (RIFRAF), a sequence consensus algorithm that takes a set of error-prone reads and a reference sequence and infers an accurate in-frame consensus. RIFRAF uses a novel structure, analogous to a two-layer hidden Markov model: the consensus is optimized to maximize alignment scores with both the set of noisy reads and with a reference. The template-to-reads component of the model encodes the preponderance of indels, and is sensitive to the per-base quality scores, giving greater weight to more accurate bases. The reference-to-template component of the model penalizes frame-destroying indels. A local search algorithm proceeds in stages to find the best consensus sequence for both objectives. Results:Using Pacific Biosciences SMRT sequences from an HIV-1 env clone, NL4-3, we compare our approach to other consensus and frame correction methods. RIFRAF consistently finds a consensus sequence that is more accurate and in-frame, especially with small numbers of reads. It was able to perfectly reconstruct over 80% of consensus sequences from as few as three reads, whereas the best alternative required twice as many. RIFRAF is able to achieve these results and keep the consensus in-frame even with a distantly related reference sequence. Moreover, unlike other frame correction methods, RIFRAF can detect and keep true indels while removing erroneous ones. Availability and implementation:RIFRAF is implemented in Julia, and source code is publicly available at https://github.com/MurrellGroup/Rifraf.jl. Supplementary information:Supplementary data are available at Bioinformatics online.

Project description:In this paper, Squid Game Optimizer (SGO) is proposed as a novel metaheuristic algorithm inspired by the primary rules of a traditional Korean game. Squid game is a multiplayer game with two primary objectives: attackers aim to complete their goal while teams try to eliminate each other, and it is usually played on large, open fields with no set guidelines for size and dimensions. The playfield for this game is often shaped like a squid and, according to historical context, appears to be around half the size of a standard basketball court. The mathematical model of this algorithm is developed based on a population of solution candidates with a random initialization process in the first stage. The solution candidates are divided into two groups of offensive and defensive players while the offensive player goes among the defensive players to start a fight which is modeled through a random movement toward the defensive players. By considering the winning states of the players of both sides which is calculated based on the objective function, the position updating process is conducted and the new position vectors are produced. To evaluate the effectiveness of the proposed SGO algorithm, 25 unconstrained mathematical test functions with 100 dimensions are used, alongside six other commonly used metaheuristics for comparison. 100 independent optimization runs are conducted for both SGO and the other algorithms with a pre-determined stopping condition to ensure statistical significance of the results. Statistical metrics such as mean, standard deviation, and mean of required objective function evaluations are calculated. To provide a more comprehensive analysis, four prominent statistical tests including the Kolmogorov-Smirnov, Mann-Whitney, and Kruskal-Wallis tests are used. Meanwhile, the ability of the suggested SGOA is assessed through the cutting-edge real-world problems on the newest CEC like CEC 2020, while the SGO demonstrate outstanding performance in dealing with these complex optimization problems. The overall assessment of the SGO indicates that the proposed algorithm can provide competitive and remarkable outcomes in both benchmark and real-world problems.

Dataset Information

Lightweight Proof of Game (LPoG): A Proof of Work (PoW)'s Extended Lightweight Consensus Algorithm for Wearable Kidneys.

Publications

Lightweight Proof of Game (LPoG): A Proof of Work (PoW)'s Extended Lightweight Consensus Algorithm for Wearable Kidneys.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets