Search

Introduction: Pen-on-paper pain drawing are an easily administered self-reported measure that enables patients to report the spatial distribution of their pain. The digitalization of pain drawings has facilitated the extraction of quantitative metrics, such as pain extent and location. This study aimed to assess the reliability of pen-on-paper pain drawing analysis conducted by an automated pain-spot recognition algorithm using various scanning procedures., Methods: One hundred pain drawings, completed by patients experiencing somatic pain, were repeatedly scanned using diverse technologies and devices. Seven datasets were created, enabling reliability assessments including inter-device, inter-scanner, inter-mobile, inter-software, intra- and inter-operator. Subsequently, the automated pain-spot recognition algorithm estimated pain extent and location values for each digitized pain drawing. The relative reliability of pain extent analysis was determined using the intraclass correlation coefficient, while absolute reliability was evaluated through the standard error of measurement and minimum detectable change. The reliability of pain location analysis was computed using the Jaccard similarity index., Results: The reliability analysis of pain extent consistently yielded intraclass correlation coefficient values above 0.90 for all scanning procedures, with standard error of measurement ranging from 0.03% to 0.13% and minimum detectable change from 0.08% to 0.38%. The mean Jaccard index scores across all dataset comparisons exceeded 0.90., Conclusions: The analysis of pen-on-paper pain drawings demonstrated excellent reliability, suggesting that the automated pain-spot recognition algorithm is unaffected by scanning procedures. These findings support the algorithm's applicability in both research and clinical practice., Competing Interests: Disclosures and Acknowledgments No conflict of interest exists in the submission of this manuscript, and the manuscript is approved by all authors for publication., (Copyright © 2023 The Authors. Published by Elsevier Inc. All rights reserved.)

Understanding and managing the health effects of Nitrogen Dioxide (NO 2 ) requires high resolution spatiotemporal exposure maps. Here, we developed a multi-stage multi-resolution ensemble model that predicts daily NO 2 concentration across continental France from 2005 to 2022. Innovations of this work include the computation of daily predictions at a 200 m resolution in large urban areas and the use of a spatio-temporal blocking procedure to avoid data leakage and ensure fair performance estimation. Predictions were obtained after three cascading stages of modeling: (1) predicting NO 2 total column density from Ozone Monitoring Instrument satellite; (2) predicting daily NO 2 concentrations at a 1 km spatial resolution using a large set of potential predictors such as predictions obtained from stage 1, land-cover and road traffic data; and (3) predicting residuals from stage 2 models at a 200 m resolution in large urban areas. The latter two stages used a generalized additive model to ensemble predictions of three decision-tree algorithms (random forest, extreme gradient boosting and categorical boosting). Cross-validated performances of our ensemble models were overall very good, with a ten-fold cross-validated R 2 for the 1 km model of 0.83, and of 0.69 for the 200 m model. All three basis learners participated in the ensemble predictions to various degrees depending on time and space. In sum, our multi-stage approach was able to predict daily NO 2 concentrations with a relatively low error. Ensembling the predictions maximizes the chance of obtaining accurate values if one basis learner fails in a specific area or at a particular time, by relying on the other learners. To the best of our knowledge, this is the first study aiming to predict NO 2 concentrations in France with such a high spatiotemporal resolution, large spatial extent, and long temporal coverage. Exposure estimates are available to investigate NO 2 health effects in epidemiological studies., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Inc. All rights reserved.)

A new method for efficiently selecting polypotent natural products is proposed in this study. The method involves using effect-directed HPTLC data and multiobjective optimization algorithms to extract chromatographic signals from HPTLC bioassay images. Three different multiobjective optimization methods, namely Derringer's desirability approach, Technique for order of preference by similarity to ideal solution (TOPSIS), and Sum of ranking differences (SRD), were applied to the chromatographic signals. In combination with jackknife cross-validation, Derringer's approach and TOPSIS demonstrated high similarity in finding the best (most polypotent), next to the best, next to the worst, and worst (least polypotent) extracts, while the SRD resulted in slightly different outcomes. Furthermore, a new method for identifying the chromatographic features that characterize the most polypotent extracts was proposed. This method is based on partial least square regression (PLS) and can be used in combination with HPTLC-chemical fingerprints to predict the desirability of new extracts. The resulting PLS models demonstrated high statistical performance with determination coefficients ranging from R 2 = 0.885 in the case of Derringer's desirability, to 0.986 for TOPSIS. However, the PLS modeling of SRD values was not successful., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier B.V.)

During drug development, chromatography is frequently used for purity and stability testing of both drug substance and drug product. Reversed phase liquid chromatography (RPLC) is one of the most widely used methodologies due to its wide scope of application. In the later stages of drug development, the specified impurities and degradation products that define the critical quality attribute of the final API, also known as Key Predictive Sample Set (KPSS), are usually well defined and controlled. At this point, a method review enables selecting the most appropriate technique which should be the one providing optimal robustness (ICH-Q14[1]), with the support of Quality by Design (QbD) approaches. Supercritical Fluid Chromatography (SFC) is a preferred technique for its proven diversity in selectivity. The adoption of a technique which presents the most favourable environmental impact, such as, but not limited to, SFC, is also becoming increasingly important as laboratories strive to reduce carbon footprint. Re-developing a method requires high resource-demands in terms of staff, materials, and time. Any step of the process that can be automated can facilitate this approach, speeding up the delivery of the method whilst preserving robustness. In this article we describe how an SFC method was developed for the purity profiling of a late-stage oncology candidate, taking advantage of the superior selectivity of SFC towards structurally similar analytes, owed to the high orthogonality with R 2 as low as 0.014 towards the KPSS. We describe two approaches to automate the method development. Firstly, a multifactorial design of experiments (DoE) and secondly, an optimization via a Bayesian algorithm, which was completed in one night, highlighting the potential and limitations, with an insight into the robustness. Both methods achieved baseline separation with varying levels of automation embedded into the process and a large reduction of the resource demands when compared to traditional optimisation methods. Finally, we describe the beneficial environmental impact that implementing SFC methods can yield, with a calculated green score reduced to a value between 17 and 30 % compared to RPLC, depending on the number of runs per sequence., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Background and Objective: Gene Regulatory Network (GRN) inference is a fundamental task in biology and medicine, as it enables a deeper understanding of the intricate mechanisms of gene expression present in organisms. This bioinformatics problem has been addressed in the literature through multiple computational approaches. Techniques developed for inferring from expression data have employed Bayesian networks, ordinary differential equations (ODEs), machine learning, information theory measures and neural networks, among others. The diversity of implementations and their respective customization have led to the emergence of many tools and multiple specialized domains derived from them, understood as subsets of networks with specific characteristics that are challenging to detect a priori. This specialization has introduced significant uncertainty when choosing the most appropriate technique for a particular dataset. This proposal, named MO-GENECI, builds upon the basic idea of the previous proposal GENECI and optimizes consensus among different inference techniques, through a carefully refined multi-objective evolutionary algorithm guided by various objective functions, linked to the biological context at hand., Methods: MO-GENECI has been tested on an extensive and diverse academic benchmark of 106 gene regulatory networks from multiple sources and sizes. The evaluation of MO-GENECI compared its performance to individual techniques using key metrics (AUROC and AUPR) for gene regulatory network inference. Friedman's statistical ranking provided an ordered classification, followed by non-parametric Holm tests to determine statistical significance., Results: MO-GENECI's Pareto front approximation facilitates easy selection of an appropriate solution based on generic input data characteristics. The best solution consistently emerged as the winner in all statistical tests, and in many cases, the median precision solution showed no statistically significant difference compared to the winner., Conclusions: MO-GENECI has not only demonstrated achieving more accurate results than individual techniques, but has also overcome the uncertainty associated with the initial choice due to its flexibility and adaptability. It is shown intelligently to select the most suitable techniques for each case. The source code is hosted in a public repository at GitHub under MIT license: https://github.com/AdrianSeguraOrtiz/MO-GENECI. Moreover, to facilitate its installation and use, the software associated with this implementation has been encapsulated in a Python package available at PyPI: https://pypi.org/project/geneci/., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

Objective: Identifying cancer driver genes, especially rare or patient-specific cancer driver genes, is a primary goal in cancer therapy. Although researchers have proposed some methods to tackle this problem, these methods mostly identify cancer driver genes at single gene level, overlooking the cooperative relationship among cancer driver genes. Identifying cooperating cancer driver genes in individual patients is pivotal for understanding cancer etiology and advancing the development of personalized therapies., Methods: Here, we propose a novel Personalized Cooperating cancer Driver Genes (PCoDG) method by using hypergraph random walk to identify the cancer driver genes that cooperatively drive individual patient cancer progression. By leveraging the powerful ability of hypergraph in representing multi-way relationships, PCoDG first employs the personalized hypergraph to depict the complex interactions among mutated genes and differentially expressed genes of an individual patient. Then, a hypergraph random walk algorithm based on hyperedge similarity is utilized to calculate the importance scores of mutated genes, integrating these scores with signaling pathway data to identify the cooperating cancer driver genes in individual patients., Results: The experimental results on three TCGA cancer datasets (i.e., BRCA, LUAD, and COADREAD) demonstrate the effectiveness of PCoDG in identifying personalized cooperating cancer driver genes. These genes identified by PCoDG not only offer valuable insights into patient stratification correlating with clinical outcomes, but also provide an useful reference resource for tailoring personalized treatments., Conclusion: We propose a novel method that can effectively identify cooperating cancer driver genes for individual patients, thereby deepening our understanding of the cooperative relationship among personalized cancer driver genes and advancing the development of precision oncology., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Several fully continuous probabilistic genotyping software (PGS) use Markov chain Monte Carlo algorithms (MCMC) to assign weights to different proposed genotype combinations at a locus. Replicate interpretations of the same profile in these software are expected not to produce identical weights and likelihood ratio (LR) values due to the Monte Carlo aspect. This paper reports a detailed precision study under reproducibility conditions conducted as a collaborative exercise across the National Institute of Standards and Technology (NIST), Federal Bureau of Investigation (FBI), and Institute of Environmental Science and Research (ESR). Replicate interpretations generated across the three laboratories used the same input files, software version, and settings but different random number seed and different computers. This work demonstrates that using different computers to analyze replicate interpretations does not contribute to any variations in LR values. The study quantifies the magnitude of differences in the assigned LRs that is only due to run-to-run MCMC variability and addresses the potential explanations for the observed differences., Competing Interests: Declaration of Competing Interest The authors declare no conflict of interest, (Copyright © 2024 Elsevier B.V. All rights reserved.)

Background: Segmentation of white matter hyperintensities (WMH) in CADASIL, one of the most severe cerebral small vessel disease of genetic origin, is challenging., Method: We adapted and validated an automatic method based on a convolutional neural network (CNN) algorithm and using a large dataset of 2D and/or 3D FLAIR and T1-weighted images acquired in 132 patients, to measure the progression of WMH in this condition., Results: The volume of WMH measured using this method correlated strongly with reference data validated by experts. WMH segmentation was also clearly improved compared to the BIANCA segmentation method. Combining two successive learning models was found to be of particular interest, reducing the number of false-positive voxels and the extent of under-segmentation detected after a single-stage process. With the two-stage approach, WMH progression correlated with measures derived from the reference masks for lesions increasing with age, and with the variable WMH progression trajectories at individual level. We also confirmed the expected effect of the initial load of WMH and the influence of the type of MRI acquisition on measures of this progression., Conclusion: Altogether, our findings suggest that WMH progression in CADASIL can be measured automatically with adequate confidence by a CNN segmentation algorithm., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Background: Cognitive assessment plays a pivotal role in the early detection of cognitive impairment, particularly in the prevention and management of cognitive diseases such as Alzheimer's and Lewy body dementia. Large-scale screening relies heavily on cognitive assessment scales as primary tools, with some low sensitivity and others expensive. Despite significant progress in machine learning for cognitive function assessment, its application in this particular screening domain remains underexplored, often requiring labor-intensive expert annotations., Aims: This paper introduces a semi-supervised learning algorithm based on pseudo-label with putback (SS-PP), aiming to enhance model efficiency in predicting the high risk of cognitive impairment (HR-CI) by utilizing the distribution of unlabeled samples., Data: The study involved 189 labeled samples and 215,078 unlabeled samples from real world. A semi-supervised classification algorithm was designed and evaluated by comparison with supervised methods composed by 14 traditional machine-learning methods and other advanced semi-supervised algorithms., Results: The optimal SS-PP model, based on GBDT, achieved an AUC of 0.947. Comparative analysis with supervised learning models and semi-supervised methods demonstrated an average AUC improvement of 8% and state-of-art performance, repectively., Conclusion: This study pioneers the exploration of utilizing limited labeled data for HR-CI predictions and evaluates the benefits of incorporating physical examination data, holding significant implications for the development of cost-effective strategies in relevant healthcare domains., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

The RIME optimization algorithm is a newly developed physics-based optimization algorithm used for solving optimization problems. The RIME algorithm proved high-performing in various fields and domains, providing a high-performance solution. Nevertheless, like many swarm-based optimization algorithms, RIME suffers from many limitations, including the exploration-exploitation balance not being well balanced. In addition, the likelihood of falling into local optimal solutions is high, and the convergence speed still needs some work. Hence, there is room for enhancement in the search mechanism so that various search agents can discover new solutions. The authors suggest an adaptive chaotic version of the RIME algorithm named ACRIME, which incorporates four main improvements, including an intelligent population initialization using chaotic maps, a novel adaptive modified Symbiotic Organism Search (SOS) mutualism phase, a novel mixed mutation strategy, and the utilization of restart strategy. The main goal of these improvements is to improve the variety of the population, achieve a better balance between exploration and exploitation, and improve RIME's local and global search abilities. The study assesses the effectiveness of ACRIME by using the standard benchmark functions of the CEC2005 and CEC2019 benchmarks. The proposed ACRIME is also applied as a feature selection to fourteen various datasets to test its applicability to real-world problems. Besides, the ACRIME algorithm is applied to the COVID-19 classification real problem to test its applicability and performance further. The suggested algorithm is compared to other sophisticated classical and advanced metaheuristics, and its performance is assessed using statistical tests such as Wilcoxon rank-sum and Friedman rank tests. The study demonstrates that ACRIME exhibits a high level of competitiveness and often outperforms competing algorithms. It discovers the optimal subset of features, enhancing the accuracy of classification and minimizing the number of features employed. This study primarily focuses on enhancing the equilibrium between exploration and exploitation, extending the scope of local search., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Purpose: The technological advancements in surgical robots compatible with magnetic resonance imaging (MRI) have created an indispensable demand for real-time deformable image registration (DIR) of pre- and intra-operative MRI, but there is a lack of relevant methods. Challenges arise from dimensionality mismatch, resolution discrepancy, non-rigid deformation and requirement for real-time registration., Methods: In this paper, we propose a real-time DIR framework called MatchMorph, specifically designed for the registration of low-resolution local intraoperative MRI and high-resolution global preoperative MRI. Firstly, a super-resolution network based on global inference is developed to enhance the resolution of intraoperative MRI to the same as preoperative MRI, thus resolving the resolution discrepancy. Secondly, a fast-matching algorithm is designed to identify the optimal position of the intraoperative MRI within the corresponding preoperative MRI to address the dimensionality mismatch. Further, a cross-attention-based dual-stream DIR network is constructed to manipulate the deformation between pre- and intra-operative MRI, real-timely., Results: We conducted comprehensive experiments on publicly available datasets IXI and OASIS to evaluate the performance of the proposed MatchMorph framework. Compared to the state-of-the-art (SOTA) network TransMorph, the designed dual-stream DIR network of MatchMorph achieved superior performance with a 1.306 mm smaller HD and a 0.07 mm smaller ASD score on the IXI dataset. Furthermore, the MatchMorph framework demonstrates an inference speed of approximately 280 ms., Conclusions: The qualitative and quantitative registration results obtained from high-resolution global preoperative MRI and simulated low-resolution local intraoperative MRI validated the effectiveness and efficiency of the proposed MatchMorph framework., Competing Interests: Declaration of competing interest All authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Deep cascaded networks have been extensively studied and applied to accelerate Magnetic Resonance Imaging (MRI) and have shown promising results. Most existing works employ a large cascading number for the sake of superior performances. However, due to the lack of proper guidance, the reconstruction performance can easily reach a plateau and even face degradation if simply increasing the cascading number. In this paper, we aim to boost the reconstruction performance from a novel perspective by proposing a parallel architecture called DIRECTION that fully exploits the guiding value of the reconstruction residual of each subnetwork. Specifically, we introduce a novel Reconstruction Residual-Based Feature Modulation Mechanism (RRFMM) which utilizes the reconstruction residual of the previous subnetwork to guide the next subnetwork at the feature level. To achieve this, a Residual Attention Modulation Block (RAMB) is proposed to generate attention maps using multi-scale residual features to modulate the image features of the corresponding scales. Equipped with this strategy, each subnetwork within the cascaded network possesses its unique optimization objective and emphasis rather than blindly updating its parameters. To further boost the performance, we introduce the Cross-Stage Feature Reuse Connection (CSFRC) and the Reconstruction Dense Connection (RDC), which can reduce information loss and enhance representative ability. We conduct sufficient experiments and evaluate our method on the fastMRI knee dataset using multiple subsampling masks. Comprehensive experimental results show that our method can markedly boost the performance of cascaded networks and significantly outperforms other compared state-of-the-art methods quantitatively and qualitatively., (Copyright © 2024. Published by Elsevier Inc.)

Background: Risk prediction plays a crucial role in planning for prevention, monitoring, and treatment. Electronic Health Records (EHRs) offer an expansive repository of temporal medical data encompassing both risk factors and outcome indicators essential for effective risk prediction. However, challenges emerge due to the lack of readily available gold-standard outcomes and the complex effects of various risk factors. Compounding these challenges are the false positives in diagnosis codes, and formidable task of pinpointing the onset timing in annotations., Objective: We develop a Semi-supervised Double Deep Learning Temporal Risk Prediction (SeDDLeR) algorithm based on extensive unlabeled longitudinal Electronic Health Records (EHR) data augmented by a limited set of gold standard labels on the binary status information indicating whether the clinical event of interest occurred during the follow-up period., Methods: The SeDDLeR algorithm calculates an individualized risk of developing future clinical events over time using each patient's baseline EHR features via the following steps: (1) construction of an initial EHR-derived surrogate as a proxy for the onset status; (2) deep learning calibration of the surrogate along gold-standard onset status; and (3) semi-supervised deep learning for risk prediction combining calibrated surrogates and gold-standard onset status. To account for missing onset time and heterogeneous follow-up, we introduce temporal kernel weighting. We devise a Gated Recurrent Units (GRUs) module to capture temporal characteristics. We subsequently assess our proposed SeDDLeR method in simulation studies and apply the method to the Massachusetts General Brigham (MGB) Biobank to predict type 2 diabetes (T2D) risk., Results: SeDDLeR outperforms benchmark risk prediction methods, including Semi-parametric Transformation Model (STM) and DeepHit, with consistently best accuracy across experiments. SeDDLeR achieved the best C-statistics ( 0.815, SE 0.023; vs STM +.084, SE 0.030, P-value .004; vs DeepHit +.055, SE 0.027, P-value .024) and best average time-specific AUC (0.778, SE 0.022; vs STM + 0.059, SE 0.039, P-value .067; vs DeepHit + 0.168, SE 0.032, P-value <0.001) in the MGB T2D study., Conclusion: SeDDLeR can train robust risk prediction models in both real-world EHR and synthetic datasets with minimal requirements of labeling event times. It holds the potential to be incorporated for future clinical trial recruitment or clinical decision-making., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Automated identification of cardiac vortices is a formidable task due to the complex nature of blood flow within the heart chambers. This study proposes a novel approach that algorithmically characterizes the identification criteria of these cardiac vortices based on Lagrangian Averaged Vorticity Deviation (LAVD). For this purpose, the Recurrent All-Pairs Field Transforms (RAFT) is employed to assess the optical flow over the Phase Contrast Magnetic Resonance Imaging (PC-MRI), and to construct a continuous blood flow velocity field and reduce errors that arise from the integral process of LAVD. Additionally, Generalized Hough Transform (GHT) is applied for automated depiction of the structure of cardiac vortices. The effectiveness of this method is demonstrated and validated by the computation of the acquired cardiac flow data. The results of this comprehensive visual and analytical study show that the evolution of cardiac vortices can be effectively described and displayed, and the RAFT framework for optical flow can synthesize the in-between PC-MRIs with high accuracy. This allows cardiologists to acquire a deeper understanding of intracardiac hemodynamics and its impact on cardiac functional performance., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Image segmentation plays a pivotal role in medical image analysis, particularly for accurately isolating tumors and lesions. Effective segmentation improves diagnostic precision and facilitates quantitative analysis, which is vital for medical professionals. However, traditional segmentation methods often struggle with multilevel thresholding due to the associated computational complexity. Therefore, determining the optimal threshold set is an NP-hard problem, highlighting the pressing need for efficient optimization strategies to overcome these challenges. This paper introduces a multi-threshold image segmentation (MTIS) method that integrates a hybrid approach combining Differential Evolution (DE) and the Crayfish Optimization Algorithm (COA), known as HADECO. Utilizing two-dimensional (2D) Kapur's entropy and a 2D histogram, this method aims to enhance the efficiency and accuracy of subsequent image analysis and diagnosis. HADECO is a hybrid algorithm that combines DE and COA by exchanging information based on predefined rules, leveraging the strengths of both for superior optimization results. It employs Latin Hypercube Sampling (LHS) to generate a high-quality initial population. HADECO introduces an improved DE algorithm (IDE) with adaptive and dynamic adjustments to key DE parameters and new mutation strategies to enhance its search capability. In addition, it incorporates an adaptive COA (ACOA) with dynamic adjustments to the switching probability parameter, effectively balancing exploration and exploitation. To evaluate the effectiveness of HADECO, its performance is initially assessed using CEC'22 benchmark functions. HADECO is evaluated against several contemporary algorithms using the Wilcoxon signed rank test (WSRT) and the Friedman test (FT) to integrate the results. The findings highlight HADECO's superior optimization abilities, demonstrated by its lowest average Friedman ranking of 1.08. Furthermore, the HADECO-based MTIS method is evaluated using MRI images for knee and CT scans for brain intracranial hemorrhage (ICH). Quantitative results in brain hemorrhage image segmentation show that the proposed method achieves a superior average peak signal-to-noise ratio (PSNR) and feature similarity index (FSIM) of 1.5 and 1.7 at the 6-level threshold. In knee image segmentation, it attains an average PSNR and FSIM of 1.3 and 1.2 at the 5-level threshold, demonstrating the method's effectiveness in solving image segmentation problems., Competing Interests: Declaration of competing interest No conflict of interest exists. No funding was received for this work. The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. We confirm that the manuscript has been read and approved by all named authors., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Objectives: It has become increasingly common for multiple computable phenotypes from electronic health records (EHR) to be developed for a given phenotype. However, EHR-based association studies often focus on a single phenotype. In this paper, we develop a method aiming to simultaneously make use of multiple EHR-derived phenotypes for reduction of bias due to phenotyping error and improved efficiency of phenotype/exposure associations., Materials and Methods: The proposed method combines multiple algorithm-derived phenotypes with a small set of validated outcomes to reduce bias and improve estimation accuracy and efficiency. The performance of our method was evaluated through simulation studies and real-world application to an analysis of colon cancer recurrence using EHR data from Kaiser Permanente Washington., Results: In settings where there was no single surrogate performing uniformly better than all others in terms of both sensitivity and specificity, our method achieved substantial bias reduction compared to using a single algorithm-derived phenotype. Our method also led to higher estimation efficiency by up to 30% compared to an estimator that used only one algorithm-derived phenotype., Discussion: Simulation studies and application to real-world data demonstrated the effectiveness of our method in integrating multiple phenotypes, thereby enhancing bias reduction, statistical accuracy and efficiency., Conclusions: Our method combines information across multiple surrogates using a statistically efficient seemingly unrelated regression framework. Our method provides a robust alternative to single-surrogate-based bias correction, especially in contexts lacking information on which surrogate is superior., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Magnetic resonance imaging produces detailed anatomical and physiological images of the human body that can be used in the clinical diagnosis and treatment of diseases. However, MRI suffers its comparatively longer acquisition time than other imaging methods and is thus vulnerable to motion artifacts, which ultimately lead to likely failed or even wrong diagnosis. In order to perform faster reconstruction, deep learning-based methods along with traditional strategies such as parallel imaging and compressed sensing come into play in recent years in this field. Meanwhile, in order to better analyze the diseases, it is also often necessary to acquire images in the same region of interest under different modalities, which yield images with different contrast levels. However, most of these aforementioned methods tend to use single-modal images for reconstruction, neglecting the correlation and redundancy information embedded in MR images acquired with different modalities. While there are works on multi-modal reconstruction, the information is yet to be efficiently explored. In this paper, we propose an end-to-end neural network called MLMFNet, which helps the reconstruction of the target modality by using information from the auxiliary modality across feature channels and layers. Specifically, this is highlighted by three components: (I) An encoder based on UNet with a single-stream strategy that fuses auxiliary and target modalities; (II) a decoder that tends to multi-level features from all layers of the encoder, and (III) a channel attention module. Quantitative and qualitative analyses are performed on a public brain dataset and knee brain dataset, which show that the proposed method achieves satisfying results in MRI reconstruction within the multi-modal context, and also demonstrate its effectiveness and potential to be used in clinical practice., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023. Published by Elsevier Inc.)

Background: For bone morphology and biomechanics analysis, landmarks are essential to define position, orientation, and shape. These landmarks define bone and joint coordinate systems and are widely used in these research fields. Currently, no method is known for automatically identifying landmarks on virtual 3D bone models of the radius and ulna. This paper proposes a knowledge-based method for locating landmarks and calculating a coordinate system for the radius, ulna, and combined forearm bones, which is essential for measuring forearm function. This method does not rely on pre-labeled data., Validation: The algorithm is validated by comparing the landmarks placed by the algorithm with the mean position of landmarks placed by a group of experts on cadaveric specimens regarding distance and orientation., Results: The median Euclidean distance differences between all the automated and reference landmarks range from 0.4 to 1.8 millimeters. The median angular differences of the coordinate system of the radius and ulna range from -1.4 to 0.6 degrees. The forearm coordinate system's median errors range from -0.2 to 2.0 degrees. The median error in calculating the rotational position of the radius relative to the ulna is 1.8 degrees., Conclusion: The automatic method's applicability depends on the use context and desired accuracy. However, the current method is a validated first step in the automatic analysis of the three-dimensional forearm anatomy., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

Background: Periodontal disease constitutes a widely prevalent category of non-communicable diseases and ranks among the top 10 causes of disability worldwide. Little however is known about diagnostic errors in dentistry. In this work, by retrospectively deploying an electronic health record (EHR)-based trigger tool, followed by gold standard manual review, we provide epidemiological estimates on the rate of diagnostic misclassification in dentistry through a periodontal use case., Methods: An EHR-based trigger tool (a retrospective record review instrument that uses a list of triggers (or clues), i.e., data elements within the health record, to alert reviewers to the potential presence of a wrong diagnosis) was developed, tested and run against the EHR at the two participating sites to flag all cases having a potential misdiagnosis. All cases flagged as potentially misdiagnosed underwent extensive manual reviews by two calibrated domain experts. A subset of the non-flagged cases was also manually reviewed., Results: A total of 2,262 patient charts met the study's inclusion criteria. Of these, the algorithm flagged 1,124 cases as potentially misclassified and 1,138 cases as potentially correctly diagnosed. When the algorithm identified a case as potentially misclassified, compared to the diagnosis assigned by the gold standard, the kappa statistic was 0.01. However, for cases the algorithm marked as potentially correctly diagnosed, the review against the gold standard showed a kappa statistic of 0.9, indicating near perfect agreement. The observed proportion of diagnostic misclassification was 32 %. There was no significant difference by clinic or provider characteristics., Conclusion: Our work revealed that about a third of periodontal cases are misclassified. Diagnostic errors have been reported to happen more frequently than other types of errors, and to be more preventable. Benchmarking diagnostic quality is a first step. Subsequent research endeavor will delve into comprehending the factors that contribute to diagnostic errors in dentistry and instituting measures to prevent them., Clinical Significance: This study sheds light on the significance of diagnostic excellence in the delivery of dental care, and highlights the potential role of technology in aiding diagnostic decision-making at the point of care., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

Problem: Therapeutic planning strategies have been developed to enhance the effectiveness of cancer drugs. Nevertheless, their performance is highly limited by the inefficient biological representativeness of predictive tumor growth models, which hinders their translation to clinical practice., Objective: This study proposes a disruptive approach to oncology based on nature-inspired control using realistic Black Hole physical laws, in which tumor masses are trapped to experience attraction dynamics on their path to complete remission or to become a chronic disease. This control method is designed to operate independently of individual patient idiosyncrasies, including high tumor heterogeneities and highly uncertain tumor dynamics, making it a promising avenue for advancing beyond the limitations of the traditional survival probabilistic paradigm., Design: Here, we provide a multifaceted study of chemotherapy therapeutic planning that includes: (1) the design of a pioneering controller algorithm based on physical laws found in the Black Holes; (2) investigation of the ability of this controller algorithm to ensure stable equilibrium treatments; and (3) simulation tests concerning tumor volume dynamics using drugs with significantly different pharmacokinetics (Cyclophosphamide and Atezolizumab), tumor volumes (200 mm 3 and 12 732 mm 3 ) and modeling characterizations (Gompertzian and Logistic tumor growth models)., Results: Our results highlight the ability of this new astrophysical-inspired control algorithm to perform effective chemotherapy treatments for multiple tumor-treatment scenarios, including tumor resistance to chemotherapy, clinical scenarios modelled by time-dependent parameters, and highly uncertain tumor dynamics., Conclusions: Our findings provide strong evidence that cancer therapy inspired by phenomena found in black holes can emerge as a disruptive paradigm. This opens new high-impacting research directions, exploring synergies between astrophysical-inspired control algorithms and Artificial Intelligence applied to advanced personalized cancer therapeutics., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Computed tomography (CT) denoising is a challenging task in medical imaging that has garnered considerable attention. Supervised networks require a lot of noisy-clean image pairs, which are always unavailable in clinical settings. Existing self-supervised algorithms for suppressing noise with paired noisy images have limitations, such as ignoring the residual between similar image pairs during training and insufficiently learning the spectrum information of images. In this study, we propose a Residual Image Prior Network (RIP-Net) to sufficiently model the residual between the paired similar noisy images. Our approach offers new insights into the field by addressing the limitations of existing methods. We first establish a mathematical theorem clarifying the non-equivalence between similar-image-based self-supervised learning and supervised learning. It helps us better understand the strengths and limitations of self-supervised learning. Secondly, we introduce a novel regularization term to model a low-frequency residual image prior. This can improve the accuracy and robustness of our model. Finally, we design a well-structured denoising network capable of exploring spectrum information while simultaneously sensing context messages. The network has dual paths for modeling high and low-frequency compositions in the raw noisy image. Additionally, context perception modules capture local and global interactions to produce high-quality images. The comprehensive experiments on preclinical photon-counting CT, clinical brain CT, and low-dose CT datasets, demonstrate that our RIP-Net is superior to other unsupervised denoising methods., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

The fine identification of sleep apnea events is instrumental in Obstructive Sleep Apnea (OSA) diagnosis. The development of sleep apnea event detection algorithms based on polysomnography is becoming a research hotspot in medical signal processing. In this paper, we propose an Inverse-Projection based Visualization System (IPVS) for sleep apnea event detection algorithms. The IPVS consists of a feature dimensionality reduction module and a feature reconstruction module. First, features of blood oxygen saturation and nasal airflow are extracted and used as input data for event analysis. Then, visual analysis is conducted on the feature distribution for apnea events. Next, dimensionality reduction and reconstruction methods are combined to achieve the dynamic visualization of sleep apnea event feature sets and the visual analysis of classifier decision boundaries. Moreover, the decision-making consistency is explored for various sleep apnea event detection classifiers, which provides researchers and users with an intuitive understanding of the detection algorithm. We applied the IPVS to an OSA detection algorithm with an accuracy of 84% and a diagnostic accuracy of 92% on a publicly available dataset. The experimental results show that the consistency between our visualization results and prior medical knowledge provides strong evidence for the practicality of the proposed system. For clinical practice, the IPVS can guide users to focus on samples with higher uncertainty presented by the OSA detection algorithm, reducing the workload and improving the efficiency of clinical diagnosis, which in turn increases the value of trust., Competing Interests: Declaration of competing interest The authors declare that there are no conflict of interests,we do not have any possible conflicts of interest., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Background: Osteoarthritis (OA) is a prevalent joint disorder characterized by cartilage degeneration and joint inflammation. Liquid-liquid phase separation (LLPS), a biophysical process involved in cellular organization, has recently gained attention in OA research. However, the relationship between LLPS and OA remains poorly understood., Methods: We analyzed gene expression data from the GSE48556 dataset to identify LLPS-related genes associated with OA. Differential expression analysis, enrichment analyses, and machine learning algorithms were employed to explore the functional significance of LLPS-related genes in OA and then construct a diagnostic model for OA. In addition, IL-1β as a pro-inflammatory factor to establish an in vitro OA model, and the protein expression levels of OA biomarkers were detected by western blot., Results: A total of 145 LLPS-related genes were screened in OA samples. Enrichment analyses revealed these genes were mainly enriched in mRNA metabolic processes, cytoplasmic granules, and insulin resistance. Four characteristic genes for OA were selected by using machine learning algorithms, including ADRB2, H3F3B, GNL3L, and PELO. These genes showed satisfactory diagnostic values. Furthermore, there were association between these biomarkers and immune cells, including T cells CD8 and monocytes. In vitro experiments showed that IL-1β stimulation significantly inhibited the cell viability of chondrocytes and enhanced the levels of pro-inflammatory factors, that could mimic the inflammatory state of OA. The expression levels of GNL3L and H3F3B proteins in IL-1β group were obviously lower than those in control group, while levels of ADRB2 and PELO were higher, which was consistent with the results of bioinformatics analysis., Conclusion: Our study identifies LLPS-related genes as potential diagnostic biomarkers for OA. These findings provide insights into the molecular mechanisms underlying OA pathogenesis and offer opportunities for the development of novel therapeutic strategies., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier GmbH.. All rights reserved.)

Water exchange is increasingly recognized as an important biological process that can affect the study of biological tissue using diffusion MR. Methods to measure exchange, however, remain immature as opposed to those used to characterize restriction, with no consensus on the optimal pulse sequence (s) or signal model (s). In general, the trend has been towards data-intensive fitting of highly parameterized models. We take the opposite approach and show that a judicious sub-sample of diffusion exchange spectroscopy (DEXSY) data can be used to robustly quantify exchange, as well as restriction, in a data-efficient manner. This sampling produces a ratio of two points per mixing time: (i) one point with equal diffusion weighting in both encoding periods, which gives maximal exchange contrast, and (ii) one point with the same total diffusion weighting in just the first encoding period, for normalization. We call this quotient the Diffusion EXchange Ratio (DEXR). Furthermore, we show that it can be used to probe time-dependent diffusion by estimating the velocity autocorrelation function (VACF) over intermediate to long times (∼2-500ms). We provide a comprehensive theoretical framework for the design of DEXR experiments in the case of static or constant gradients. Data from Monte Carlo simulations and experiments acquired in fixed and viable ex vivo neonatal mouse spinal cord using a permanent magnet system are presented to test and validate this approach. In viable spinal cord, we report the following apparent parameters from just 6 data points: τ k =17±4ms, f NG =0.72±0.01, R eff =1.05±0.01μm, and κ eff =0.19±0.04μm/ms, which correspond to the exchange time, restricted or non-Gaussian signal fraction, an effective spherical radius, and permeability, respectively. For the VACF, we report a long-time, power-law scaling with ≈t -2.4 , which is approximately consistent with disordered domains in 3-D. Overall, the DEXR method is shown to be highly efficient, capable of providing valuable quantitative diffusion metrics using minimal MR data., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Published by Elsevier Inc.)

Accurately differentiating indeterminate pulmonary nodules remains a significant challenge in clinical practice. This challenge becomes increasingly formidable when dealing with the vast radiomic features obtained from low-dose computed tomography, a lung cancer screening technique being rolling out in many areas of the world. Consequently, this study proposed the Altruistic Seagull Optimization Algorithm (AltSOA) for the selection of radiomic features in predicting the malignancy risk of pulmonary nodules. This innovative approach incorporated altruism into the traditional seagull optimization algorithm to seek a global optimal solution. A multi-objective fitness function was designed for training the pulmonary nodule prediction model, aiming to use fewer radiomic features while ensuring prediction performance. Among global radiomic features, the AltSOA identified 11 interested features, including the gray level co-occurrence matrix. This automatically selected panel of radiomic features enabled precise prediction (area under the curve = 0.8383 (95 % confidence interval 0.7862-0.8863)) of the malignancy risk of pulmonary nodules, surpassing the proficiency of radiologists. Furthermore, the interpretability, clinical utility, and generalizability of the pulmonary nodule prediction model were thoroughly discussed. All results consistently underscore the superiority of the AltSOA in predicting the malignancy risk of pulmonary nodules. And the proposed malignant risk prediction model for pulmonary nodules holds promise for enhancing existing lung cancer screening methods. The supporting source codes of this work can be found at: https://github.com/zzl2022/PBMPN., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier Ltd.)

Real-time state estimation in chromatography is a useful tool to improve monitoring of biopharmaceutical downstream processes, combining mechanistic model predictions with real-time data acquisition to obtain an estimation that surpasses that of either approach individually. One common technique for real-time state estimation is Kalman filtering. However, non-linear adsorption isotherms pose a significant challenge to Kalman filters, which are dependent on fast algorithm execution to function. In this work, we apply Kalman filtering of non-constant elution conditions using a non-linear adsorption isotherm using a novel approach where dual Kalman filters are used to estimate the states of the adsorption modifier, salt, and the components to be separated. We performed offline tuning of the Kalman filters on real chromatogram data from a linear gradient, ion-exchange separation of two proteins. The tuning was then validated by running the Kalman filters in parallel with a chromatographic separation in real time. The resulting, tuned, dual Kalman filters improved the L2 norm by 53 % over the open-loop model prediction, when compared to the true elution profiles. The Kalman filters were also applicable in real-time with a signal sampling frequency of 5 s, enabling accurate and robust estimation and paving the way for future applications beyond monitoring, such as real-time optimal pooling control., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier B.V. All rights reserved.)

Full-length spectral data analysis has a big problem that the variables are highly in collinearity and correlation. Spectral wavelength selection is a continuing hot topic in quantitative or qualitative analysis. In this paper, we propose a new approach for near-infrared (NIR) wavelength selection. The novel strategy mainly refers to the modification of maximum information coefficient (MIC) method and an improvement of firefly evolutionary algorithm. We introduce the orthogonal decomposition to modify the MIC method, so as to search the informative signals conceived in projection vectors. We also raise the common firefly algorithm (FA) as in the discretized mode, and design a novel adaptive mapping function to improve its intelligent computing effect. In experiment, the modified MIC (MIC m ) method and the adaptive discrete FA algorithm (DFA adp ) are joint together for combined optimization of the NIR calibration model. The proposed combined modeling strategy is applied for quantitative analysis of the fishmeal samples, in the concern to select their informative variables/wavelengths. Experimental results indicate that the combination of MIC m and DFA adp perform better than traditional MIC method and common DFA. We conclude that the proposed combined optimization strategy is beneficial for wavelength selection in NIR spectral analysis. It is anticipated to be validated for further applications in a wide range., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Inspired by significant technical advancements, a rapidly growing stream of research explores human lay beliefs and reactions surrounding AI tools, which employ algorithms to mimic elements of human intelligence. This literature predominantly documents negative reactions to these tools or the underlying algorithms, often referred to as algorithm aversion or, alternatively, a preference for humans. This article proposes a third interpretation: people may be averse to their labels, but appreciative of their output. This perspective offers three core insights for how we study people's reactions to algorithms. Research would benefit from (1) carefully considering the labeling of AI tools, (2) broadening the scope of study to include interactions with these tools, and (3) accounting for their technical configuration., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Background: The utilization of non-invasive techniques for fetal cardiac health surveillance is pivotal in evaluating fetal well-being throughout the gestational period. This process requires clean and interpretable fetal Electrocardiogram (fECG) signals., Method: The proposed work is the novel framework for the elicitation of fECG signals from abdominal ECG (aECG) recordings of the pregnant mother. The comprehensive approach encompasses pre-processing of the raw ECG signal, Blind Source Separation techniques (BSS), Decomposition techniques like Empirical Mode Decomposition (EMD), and its variants like Ensemble Empirical Mode Decomposition (EEMD), and Complete Ensemble Empirical Mode Decomposition with Additive Noise (CEEMDAN). The Robust Set Membership Affine Projection (RSMAP) Algorithm is deployed for the enhancement of the obtained fECG signal., Result: The results show significant improvements in the elicited fECG signal with a maximum Signal Noise Ratio (SNR) of 31.72 dB and correlation coefficient = 0.899, Maximum Heart Rate(MHR) obtained in the range of 108-142 bpm for all the records of abdominal ECG signals. The statistical test gave a p-value of 0.21 accepting the null hypothesis. The Abdominal and Direct Fetal Electrocardiogram Database (ABDFECGDB) from PhysioNet has been used for this analysis., Conclusion: The proposed framework demonstrates a robust and effective method for the elicitation and enhancement of fECG signals from the abdominal recordings., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

An inspection in tablet appearance integrity before bottling is regarded as a routine task in a pharmaceutical factory. Although some methods such as automated optical instrument, video or artificial intelligence (AI) are currently available in industry, it usually pays for a complex computational process as well as high cost. Based on the symmetry of tablet appearance in reality, this study develops a biaxial scanning slope symmetry algorithm to realize a dynamic real-time tablet defect detection with a simple arithmetic operation. First, the tablet is discretely scanned using image sensor in two axes, i.e. X and Y directions, simultaneously. Second, the analogy output signals generated from the sensor during the scanning process is discretely digitized and stored in an array. Third, the coordinate of center point in the series data array is identified from every line scanning. Fourth, every section slope between two nearby center points from the first to last lines is formulated and calculated sequentially. Finally, the square mean error (SME) is used to evaluate the shape defect situation according to all accumulated errors from every slope variation. The experimental results verify that the proposed algorithm can achieve both fast and accurate detection performance., Competing Interests: Declaration of competing interest The authors declare that there is no conflict of interest regarding the publication of this paper., (Copyright © 2024. Published by Elsevier Inc.)

In the medical field, datasets are mostly integrated across sites due to difficult data acquisition and insufficient data at a single site. The domain shift problem caused by the heterogeneous distribution among multi-site data makes autism spectrum disorder (ASD) hard to identify. Recently, domain adaptation has received considerable attention as a promising solution. However, domain adaptation on graph data like brain networks has not been fully studied. It faces two major challenges: (1) complex graph structure; and (2) multiple source domains. To overcome the issues, we propose an end-to-end structure-aware domain adaptation framework for brain network analysis (BrainDAS) using resting-state functional magnetic resonance imaging (rs-fMRI). The proposed approach contains two stages: supervision-guided multi-site graph domain adaptation with dynamic kernel generation and graph classification with attention-based graph pooling. We evaluate our BrainDAS on a public dataset provided by Autism Brain Imaging Data Exchange (ABIDE) which includes 871 subjects from 17 different sites, surpassing state-of-the-art algorithms in several different evaluation settings. Furthermore, our promising results demonstrate the interpretability and generalization of the proposed method. Our code is available at https://github.com/songruoxian/BrainDAS., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

The recent advances in artificial intelligence modern approaches can play vital roles in the Internet of Medical Things (IoMT). Automatic diagnosis is one of the most important topics in the IoMT, including cancer diagnosis. Breast cancer is one of the top causes of death among women. Accurate diagnosis and early detection of breast cancer can improve the survival rate of patients. Deep learning models have demonstrated outstanding potential in accurately detecting and diagnosing breast cancer. This paper proposes a novel technology for breast cancer detection using CrossViT as the deep learning model and an enhanced version of the Growth Optimizer algorithm (MGO) as the feature selection method. CrossVit is a hybrid deep learning model that combines the strengths of both convolutional neural networks (CNNs) and transformers. The MGO is a meta-heuristic algorithm that selects the most relevant features from a large pool of features to enhance the performance of the model. The developed approach was evaluated on three publicly available breast cancer datasets and achieved competitive performance compared to other state-of-the-art methods. The results show that the combination of CrossViT and the MGO can effectively identify the most informative features for breast cancer detection, potentially assisting clinicians in making accurate diagnoses and improving patient outcomes. The MGO algorithm improves accuracy by approximately 1.59% on INbreast, 5.00% on MIAS, and 0.79% on MiniDDSM compared to other methods on each respective dataset. The developed approach can also be utilized to improve the Quality of Service (QoS) in the healthcare system as a deployable IoT-based intelligent solution or a decision-making assistance service, enhancing the efficiency and precision of the diagnosis., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

This article studies the passive tracking problem of a wearable exoskeleton for lower limb rehabilitation therapy in the face of unmodeled dynamics, interactive friction, disturbance, prescribed performance constraints, and actuator faults. Adaptive neural networks and a smooth performance function are incorporated to establish a novel fault-tolerant tracking scheme, which can not only compensate for the nonlinear uncertainties and disturbance, but also handle the actuator fault with guaranteed tracking performance. A state feedback controller is presented by using the full state information and an output feedback controller is developed when the angular velocity is unavailable. The differential explosion issue of the backstepping technique is resolved by constructing a first-order filter and the unmeasurable velocity is estimated by a nonlinear observer. Semiglobal uniform boundedness stabilities of the exoskeleton system are proved via the Lyapunov direct method. The tracking performances of the designed control approaches are tested by comparative simulations., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 ISA. Published by Elsevier Ltd. All rights reserved.)

In this study, we develop a numerical optimization approach to address the challenge of optimal control in the spread of COVID-19. We evaluate the impact of various control strategies aimed at reducing the number of exposed and infectious individuals. Our novel approach employs Legendre wavelets, their derivative operational matrix, and a collocation method to transform the COVID-19 transmission optimal control model into a nonlinear programming (NLP) problem. To solve this problem, we employ a coronavirus optimization algorithm (COVIDOA) to determine the optimal control, state variables, and objective value. We investigate three control plans for this highly contagious disease, focusing on individual protection, rapid detection and treatment, detection with delay in treatment, and environmental viral dispersion as time-based control functions. These strategies are applied within an SEIR-type control model specific to COVID-19 in China, designed to mitigate disease spread. Lastly, we analyze the effects of various parameters within the COVID-19 spread model. Our numerical results highlight the significant impact of strategies that minimize the number of exposed and infectious individuals, particularly those related to rapid detection, detection delay, and environmental viral dispersion, in controlling and preventing the transmission of the COVID-19 virus., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Although identifying human skin types is essential in dermatology, cosmetology, and facial recognition, the classification of human skin types is challenging due to the complex nature, varied characteristics, and the influence of external factors. Traditional methods for skin type identification often rely on subjective assessments, leading to inconsistent and inaccurate results. Therefore, this paper proposes a novel method named a distance-based integration method to identify skin types based on the Fitzpatrick skin scale, also known as the Fitzpatrick skin type. This study focuses on the objective distance measurement, integrated with the Fuzzy Analytic Hierarchy Process (AHP). The objective distance was utilized to determine the distance between each HEX color code for a clinical image and each target skin type. The Fuzzy AHP algorithm was employed to calculate the total score for each target class to identify human skin type. For this study, 1,022 images of human skin were used in the experiment. The results indicated that the proposed method achieved a high average accuracy of 93 %, precision of 80 %, and specificity of 96 %., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Lung diseases are almost invariably heterogeneous and progressive, making it imperative to capture temporally and spatially explicit information to understand the disease initiation and progression. Imaging the lung with MRI-particularly in the preclinical setting-has historically been challenging because of relatively low lung tissue density, rapid cardiac and respiratory motion, and rapid transverse (T 2 *) relaxation. These limitations can largely be mitigated using ultrashort-echo-time (UTE) sequences, which are intrinsically robust to motion and avoid significant T 2 * decay. A significant disadvantage of common radial UTE sequences is that they require inefficient, center-out k-space sampling, resulting in long acquisition times relative to conventional Cartesian sequences. Therefore, pulmonary images acquired with radial UTE are often undersampled to reduce acquisition time. However, undersampling reduces image SNR, introduces image artifacts, and degrades true image resolution. The level of undersampling is further increased if offline gating techniques like retrospective gating are employed, because only a portion (∼40-50%) of the data is used in the final image reconstruction. Here, we explore the impact of undersampling on SNR and T 2 * mapping in mouse lung imaging using simulation and in-vivo data. Increased scatter in both metrics was noticeable at around 50% sampling. Parenchymal apparent SNR only decreased slightly (average decrease ∼ 1.4) with as little as 10% sampling. Apparent T 2 * remained similar across undersampling levels, but it became significantly increased (p < 0.05) below 80% sampling. These trends suggest that undersampling can generate quantifiable, but moderate changes in the apparent value of T 2 *. Moreover, these approaches to assess the impact of undersampling are straightforward to implement and can readily be expanded to assess the quantitative impact of other MR acquisition and reconstruction parameters., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Image-guided surgery collocates patient-specific data with the physical environment to facilitate surgical decision making. Unfortunately, these guidance systems commonly become compromised by intraoperative soft-tissue deformations. Nonrigid image-to-physical registration methods have been proposed to compensate for deformations, but clinical utility requires compatibility of these techniques with data sparsity and temporal constraints in the operating room. While finite element models can be effective in sparse data scenarios, computation time remains a limitation to widespread deployment. This paper proposes a registration algorithm that uses regularized Kelvinlets, which are analytical solutions to linear elasticity in an infinite domain, to overcome these barriers. This algorithm is demonstrated and compared to finite element-based registration on two datasets: a phantom liver deformation dataset and an in vivo breast deformation dataset. The regularized Kelvinlets algorithm resulted in a significant reduction in computation time compared to the finite element method. Accuracy as evaluated by target registration error was comparable between methods. Average target registration errors were 4.6 ± 1.0 and 3.2 ± 0.8 mm on the liver dataset and 5.4 ± 1.4 and 6.4 ± 1.5 mm on the breast dataset for the regularized Kelvinlets and finite element method, respectively. Limitations of regularized Kelvinlets include the lack of organ-specific geometry and the assumptions of linear elasticity and infinitesimal strain. Despite limitations, this work demonstrates the generalizability of regularized Kelvinlets registration on two soft-tissue elastic organs. This method may improve and accelerate registration for image-guided surgery, and it shows the potential of using regularized Kelvinlets on medical imaging data., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier B.V.)

Objective: Develop a new method for continuous prediction that utilizes a single temporal pattern ending with an event of interest and its multiple instances detected in the temporal data., Methods: Use temporal abstraction to transform time series, instantaneous events, and time intervals into a uniform representation using symbolic time intervals (STIs). Introduce a new approach to event prediction using a single time intervals-related pattern (TIRP), which can learn models to predict whether and when an event of interest will occur, based on multiple instances of a pattern that end with the event., Results: The proposed methods achieved an average improvement of 5% AUROC over LSTM-FCN, the best-performed baseline model, out of the evaluated baseline models (RawXGB, Resnet, LSTM-FCN, and ROCKET) that were applied to real-life datasets., Conclusion: The proposed methods for predicting events continuously have the potential to be used in a wide range of real-world and real-time applications in diverse domains with heterogeneous multivariate temporal data. For example, it could be used to predict panic attacks early using wearable devices or to predict complications early in intensive care unit patients., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

The classification of gigapixel Whole Slide Images (WSIs) is an important task in the emerging area of computational pathology. There has been a surge of interest in deep learning models for WSI classification with clinical applications such as cancer detection or prediction of cellular mutations. Most supervised methods require expensive and labor-intensive manual annotations by expert pathologists. Weakly supervised Multiple Instance Learning (MIL) methods have recently demonstrated excellent performance; however, they still require large-scale slide-level labeled training datasets that require a careful inspection of each slide by an expert pathologist. In this work, we propose a fully unsupervised WSI classification algorithm based on mutual transformer learning. The instances (i.e., patches) from gigapixel WSIs are transformed into a latent space and then inverse-transformed to the original space. Using the transformation loss, pseudo labels are generated and cleaned using a transformer label cleaner. The proposed transformer-based pseudo-label generator and cleaner modules mutually train each other iteratively in an unsupervised manner. A discriminative learning mechanism is introduced to improve normal versus cancerous instance labeling. In addition to the unsupervised learning, we demonstrate the effectiveness of the proposed framework for weakly supervised learning and cancer subtype classification as downstream analysis. Extensive experiments on four publicly available datasets show better performance of the proposed algorithm compared to the existing state-of-the-art methods., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Characteristics such as low contrast and significant organ shape variations are often exhibited in medical images. The improvement of segmentation performance in medical imaging is limited by the generally insufficient adaptive capabilities of existing attention mechanisms. An efficient Channel Prior Convolutional Attention (CPCA) method is proposed in this paper, supporting the dynamic distribution of attention weights in both channel and spatial dimensions. Spatial relationships are effectively extracted while preserving the channel prior by employing a multi-scale depth-wise convolutional module. The ability to focus on informative channels and important regions is possessed by CPCA. A segmentation network called CPCANet for medical image segmentation is proposed based on CPCA. CPCANet is validated on two publicly available datasets. Improved segmentation performance is achieved by CPCANet while requiring fewer computational resources through comparisons with state-of-the-art algorithms. Our code is publicly available at https://github.com/Cuthbert-Huang/CPCANet., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier Ltd.)

We introduce the open-source software MUedit and we describe its use for identifying the discharge timing of motor units from all types of electromyographic (EMG) signals recorded with multi-channel systems. MUedit performs EMG decomposition using a blind-source separation approach. Following this, users can display the estimated motor unit pulse trains and inspect the accuracy of the automatic detection of discharge times. When necessary, users can correct the automatic detection of discharge times and recalculate the motor unit pulse train with an updated separation vector. Here, we provide an open-source software and a tutorial that guides the user through (i) the parameters and steps of the decomposition algorithm, and (ii) the manual editing of motor unit pulse trains. Further, we provide simulated and experimental EMG signals recorded with grids of surface electrodes and intramuscular electrode arrays to benchmark the performance of MUedit. Finally, we discuss advantages and limitations of the blind-source separation approach for the study of motor unit behaviour during tonic muscle contractions., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024. Published by Elsevier Ltd.)

Objective: Comprehensive analysis of histopathology images and transcriptomics data enables the identification of candidate biomarkers and multimodal association patterns. Most existing multimodal data association studies are derived from extensions of the joint nonnegative matrix factorization model for identifying complex data associations, which can make full use of clinical prior information. However, the raw data were usually taken as the input without considering the underlying complex multi-subspace structure, influencing the subsequent integration analysis results., Methods: This study proposed a deep-self reconstructed joint nonnegative matrix factorization (DSRJNMF) model to use self-expressive properties to reconstruct the raw data to characterize the similarity structure associated with clinical labels. Then, the sparsity, orthogonality, and regularization constraints constructed from prior information are added to the DSRJNMF model to determine the sparse set of biologically relevant features across modalities., Results: The algorithm has been applied to identify the imaging genetic association of triple negative breast cancer (TNBC). Multilevel experimental results demonstrate that the proposed algorithm better estimates potential associations between pathological image features and miRNA-gene and identifies consistent multimodal imaging genetic biomarkers to guide the interpretation of TNBC., Conclusion: The propose method provides a novel idea of data association analysis oriented to complex diseases., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Colon adenocarcinoma (COAD) is a type of colon cancers with a high mortality rate. Its early symptoms are not obvious, and its late stage is accompanied by various complications that seriously endanger patients' lives. To assist in the early diagnosis of COAD and improve the detection efficiency of COAD, this paper proposes a multi-level threshold image segmentation (MIS) method based on an enhanced particle swarm algorithm for segmenting COAD images. Firstly, this paper proposes a multi-strategy fusion particle swarm optimization algorithm (DRPSO) with a replacement mechanism. The non-linear inertia weight and sine-cosine learning factors in DRPSO help balance the exploration and exploitation phases of the algorithm. The population reorganization strategy incorporating MGO enhances population diversity and effectively prevents the algorithm from stagnating prematurely. The mutation-based final replacement mechanism enhances the algorithm's ability to escape local optima and helps the algorithm to obtain highly accurate solutions. In addition, comparison experiments on the CEC2020 and CEC2022 test sets show that DRPSO outperforms other state-of-the-art algorithms in terms of convergence accuracy and speed. Secondly, by combining the non-local mean 2D histogram and 2D Renyi entropy, this paper proposes a DRPSO algorithm based MIS method, which is successfully applied to the segments the COAD pathology image problem. The results of segmentation experiments show that the above method obtains relatively higher quality segmented images with superior performance metrics: PSNR = 23.556, SSIM = 0.825, and FSIM = 0.922. In conclusion, the MIS method based on the DRPSO algorithm shows great potential in assisting COAD diagnosis and in pathology image segmentation., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

In drug development and clinical application, drug-drug interaction (DDI) prediction is crucial for patient safety and therapeutic efficacy. However, traditional methods for DDI prediction often overlook the structural features of drugs and the complex interrelationships between them, which affect the accuracy and interpretability of the model. In this paper, a novel dual-view DDI prediction framework, DAS-DDI is proposed. Firstly, a drug association network is constructed based on similarity information among drugs, which could provide rich context information for DDI prediction. Subsequently, a novel drug substructure extraction method is proposed, which could update the features of nodes and chemical bonds simultaneously, improving the comprehensiveness of the feature. Furthermore, an attention mechanism is employed to fuse multiple drug embeddings from different views dynamically, enhancing the discriminative ability of the model in handling multi-view data. Comparative experiments on three public datasets demonstrate the superiority of DAS-DDI compared with other state-of-the-art models under two scenarios., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Inc. All rights reserved.)

Early detection of breast cancer and its molecular subtyping is crucial for guiding clinical treatment and improving survival rate. Current diagnostic methods for breast cancer are invasive, time consuming and complicated. In this work, an optical detection method integrating surface-enhanced Raman spectroscopy (SERS) technology with feature selection and deep learning algorithm was developed for identifying serum components and building diagnostic model, with the aim of efficient and accurate noninvasive screening of breast cancer. First, the high quality of serum SERS spectra from breast cancer (BC), breast benign disease (BBD) patients and healthy controls (HC) were obtained. Chi-square tests were conducted to exclude confounding factors, enhancing the reliability of the study. Then, LightGBM (LGB) algorithm was used as the base model to retain useful features to significantly improve classification performance. The DNN algorithm was trained through backpropagation, adjusting the weights and biases between neurons to improve the network's predictive ability. In comparison to traditional machine learning algorithms, this method provided more accurate information for breast cancer classification, with classification accuracies of 91.38 % for BC and BBD, and 96.40 % for BC, BBD, and HC. Furthermore, the accuracies of 90.11 % for HR+/HR- and 88.89 % for HER2+/HER2- can be reached when evaluating BC patients' molecular subtypes. These results demonstrate that serum SERS combined with powerful LGB-DNN algorithm would provide a supplementary method for clinical breast cancer screening., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier B.V. All rights reserved.)

Zebrafish are considered as model organisms in biological and medical research because of their high degree of homology with human genes. Automatic behavioral analysis of multiple zebrafish based on visual tracking is expected to improve research efficiency. However, vision-based multi-object tracking algorithms often suffer from data loss owing to mutual occlusion. In addition, simply tracking zebrafish as points is not sufficient-more detailed information, which is required for research on zebrafish behavior. In this paper, we propose Zebrafishtracker3D, which utilizes a skeleton stability strategy to reduce detection error caused by frequent overlapping of multiple zebrafish effectively and estimates zebrafish skeletons using head coordinates in the top view. Further, we transform the front- and top-view matching task into an optimization problem and propose a particle-matching method to perform 3D tracking. The robustness of the algorithm with respect to occlusion is estimated on the dataset comprising two and three zebrafish. Experimental results demonstrate that the proposed algorithm exhibits a multiple object tracking accuracy (MOTA) exceeding 90% in the top view and a 3D tracking matching accuracy exceeding 90% in the complex videos with frequent overlapping. It is noteworthy that each instance in the trace saves its skeleton. In addition, Zebrafishtracker3D is applied in the zebrafish courtship experiment, establishes the stability of the method in applications of life science, and proves that the data can be used for behavioral analysis. Zebrafishtracker3D is the first algorithm that realizes 3D skeleton tracking of multiple zebrafish simultaneously., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 ISA. Published by Elsevier Ltd. All rights reserved.)

Estimating treatment effects from observational data in medicine using causal inference is a very relevant task due to the abundance of observational data and the ethical and cost implications of conducting randomized experiments or experimental interventions. However, how could we estimate the effect of a treatment in a hospital that has very restricted access to treatment? In this paper, we want to address the problem of distributed causal inference, where hospitals not only have different distributions of patients, but also different treatment assignment criteria. Furthermore, it is necessary to take into account that due to privacy restrictions, personal patient data cannot be shared between hospitals. To address this problem, we propose an adaptation of the federated learning algorithm FederatedAveraging to one of the most advanced models for the prediction of treatment effects based on neural networks, TEDVAE. Our algorithm adaptation takes into account the shift in the treatment distribution between hospitals and is therefore called Propensity WeightedFederatedAveraging (PW FedAvg). As the distributions of the assignment of treatments become more unbalanced between the nodes, the estimation of causal effects becomes more challenging. The experiments show that PW FedAvg manages to reduce errors in the estimation of individual causal effects when imbalances are large, compared to VanillaFedAvg and other federated learning-based causal inference algorithms based on the application of federated learning to linear parametric models, Gaussian Processes and Random Fourier Features., Competing Interests: Declaration of competing interest The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: Alejandro Almodovar, Juan Parras, Santago Zazo reports financial support was provided by European Commission. If there are other authors, they declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier Ltd.. All rights reserved.)

Objective: Guidance on how to evaluate accuracy and algorithmic fairness across subgroups is missing for clinical models that flag patients for an intervention but when health care resources to administer that intervention are limited. We aimed to propose a framework of metrics that would fit this specific use case., Methods: We evaluated the following metrics and applied them to a Veterans Health Administration clinical model that flags patients for intervention who are at risk of overdose or a suicidal event among outpatients who were prescribed opioids (N = 405,817): Receiver - Operating Characteristic and area under the curve, precision - recall curve, calibration - reliability curve, false positive rate, false negative rate, and false omission rate. In addition, we developed a new approach to visualize false positives and false negatives that we named 'per true positive bars.' We demonstrate the utility of these metrics to our use case for three cohorts of patients at the highest risk (top 0.5 %, 1.0 %, and 5.0 %) by evaluating algorithmic fairness across the following age groups: <=30, 31-50, 51-65, and >65 years old., Results: Metrics that allowed us to assess group differences more clearly were the false positive rate, false negative rate, false omission rate, and the new 'per true positive bars'. Metrics with limited utility to our use case were the Receiver - Operating Characteristic and area under the curve, the calibration - reliability curve, and the precision - recall curve., Conclusion: There is no "one size fits all" approach to model performance monitoring and bias analysis. Our work informs future researchers and clinicians who seek to evaluate accuracy and fairness of predictive models that identify patients to intervene on in the context of limited health care resources. In terms of ease of interpretation and utility for our use case, the new 'per true positive bars' may be the most intuitive to a range of stakeholders and facilitates choosing a threshold that allows weighing false positives against false negatives, which is especially important when predicting severe adverse events., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Published by Elsevier Inc.)

The sit-to-stand (STS) movement is fundamental in daily activities, involving coordinated motion of the lower extremities and trunk, which leads to the generation of joint moments based on joint angles and limb properties. Traditional methods for determining joint moments often involve sensors or complex mathematical approaches, posing limitations in terms of movement restrictions or expertise requirements. Machine learning (ML) algorithms have emerged as promising tools for joint moment estimation, but the challenge lies in efficiently selecting relevant features from diverse datasets, especially in clinical research settings. This study aims to address this challenge by leveraging metaheuristic optimization algorithms to predict joint moments during STS using minimal input data. Motion analysis data from 20 participants with varied mass and inertia properties are utilized, and joint angles are computed alongside simulations of joint moments. Feature selection is performed using the Manta Ray Foraging Optimization (MRFO), Marine Predators Algorithm (MPA), and Equilibrium Optimizer (EO) algorithms. Subsequently, Decision Tree Regression (DTR), Random Forest Regression (RFR), Extra Tree Regression (ETR), and eXtreme Gradient Boosting Regression (XGBoost Regression) ML algorithms are deployed for joint moment prediction. The results reveal EO-ETR as the most effective algorithm for ankle, knee, and neck joint moment prediction, while MPA-ETR exhibits superior performance for hip joint prediction. This approach demonstrates potential for enhancing accuracy in joint moment estimation with minimal feature input, offering implications for biomechanical research and clinical applications., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Ewald sphere curvature correction, which extends beyond the projection approximation, stretches the shallow depth of field in cryo-EM reconstructions of thick particles. Here we show that even for previously assumed thin particles, reconstruction artifacts which we refer to as ghosts can appear. By retrieving the lost phases of the electron exitwaves and accounting for the first Born approximation scattering within the particle, we show that these ghosts can be effectively eliminated. Our simulations demonstrate how such ghostbusting can improve reconstructions as compared to existing state-of-the-art software. Like ptychographic cryo-EM, our Ghostbuster algorithm uses phase retrieval to improve reconstructions, but unlike the former, we do not need to modify the existing data acquisition pipelines., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 The Author(s). Published by Elsevier B.V. All rights reserved.)