Search

Background and Objective: Despite the proven effectiveness of organized PSA-based screening in reducing prostate cancer-related mortality, there is currently no program in Germany covered by statutory health insurance. In accordance with the EU Council Decision (2022/0290(NLE)), the German Society of Urology (DGU) has developed a concept for risk-adapted prostate cancer early detection., Materials and Methods: Based on a literature review of current screening studies, an algorithm for PSA-based prostate cancer early detection was developed., Results: Risk-adapted prostate cancer screening involves PSA testing in the age group of 45-70 years, followed by PSA-based individual risk stratification and stepwise expansion of diagnostics through magnetic resonance imaging (MRI) to biopsy. While initially up to 2.6 million men will undergo PSA testing, a reduction in these initial examinations to fewer than 200,000 men per year will occur from year four onwards., Conclusions: The presented algorithm provides clear recommendations for risk-adapted PSA-based early detection for prostate cancer for urologists and patients. The goal is to improve diagnosis of clinically significant prostate cancer, while reducing overdiagnosis and overtreatment., (© 2024. The Author(s), under exclusive licence to Springer Medizin Verlag GmbH, ein Teil von Springer Nature.)

Background:  With the widespread use of direct oral anticoagulants (DOACs), there is an urgent need for a rapid assay to exclude clinically relevant plasma levels. Accurate and rapid determination of DOAC levels would guide medical decision-making to (1) determine the potential contribution of the DOAC to spontaneous or trauma-induced hemorrhage; (2) identify appropriate candidates for reversal, or (3) optimize the timing of urgent surgery or intervention., Methods and Results:  The DOAC Dipstick test uses a disposable strip to identify factor Xa- or thrombin inhibitors in a urine sample. Based on the results of a systematic literature search followed by an analysis of a simple pooling of five retrieved clinical studies, the test strip has a high sensitivity and an acceptably high negative predictive value when compared with levels measured with liquid chromatography tandem mass spectrometry or calibrated chromogenic assays to reliably exclude plasma DOAC concentrations ≥30 ng/mL., Conclusion:  Based on these data, a simple algorithm is proposed to enhance medical decision-making in acute care indications useful primarily in hospitals not having readily available quantitative tests and 24/7. This algorithm not only determines DOAC exposure but also differentiates between factor Xa and thrombin inhibitors to better guide clinical management., Competing Interests: J.H. is general manager and founder of DOASENSE GmbH, J.D. is CEO of Qualiblood SA. All other authors declare no conflicts of interest., (Thieme. All rights reserved.)

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.)

Background: In the healthcare domain today, despite the substantial adoption of electronic health information systems, a significant proportion of medical reports still exist in paper-based formats. As a result, there is a significant demand for the digitization of information from these paper-based reports. However, the digitization of paper-based laboratory reports into a structured data format can be challenging due to their non-standard layouts, which includes various data types such as text, numeric values, reference ranges, and units. Therefore, it is crucial to develop a highly scalable and lightweight technique that can effectively identify and extract information from laboratory test reports and convert them into a structured data format for downstream tasks., Methods: We developed an end-to-end Natural Language Processing (NLP)-based pipeline for extracting information from paper-based laboratory test reports. Our pipeline consists of two main modules: an optical character recognition (OCR) module and an information extraction (IE) module. The OCR module is applied to locate and identify text from scanned laboratory test reports using state-of-the-art OCR algorithms. The IE module is then used to extract meaningful information from the OCR results to form digitalized tables of the test reports. The IE module consists of five sub-modules, which are time detection, headline position, line normalization, Named Entity Recognition (NER) with a Conditional Random Fields (CRF)-based method, and step detection for multi-column. Finally, we evaluated the performance of the proposed pipeline on 153 laboratory test reports collected from Peking University First Hospital (PKU1)., Results: In the OCR module, we evaluate the accuracy of text detection and recognition results at three different levels and achieved an averaged accuracy of 0.93. In the IE module, we extracted four laboratory test entities, including test item name, test result, test unit, and reference value range. The overall F1 score is 0.86 on the 153 laboratory test reports collected from PKU1. With a single CPU, the average inference time of each report is only 0.78 s., Conclusion: In this study, we developed a practical lightweight pipeline to digitalize and extract information from paper-based laboratory test reports in diverse types and with different layouts that can be adopted in real clinical environments with the lowest possible computing resources requirements. The high evaluation performance on the real-world hospital dataset validated the feasibility of the proposed pipeline., (© 2023. The Author(s).)

Systematic reviews rely on identification of studies, initially through electronic searches yielding potentially thousands of studies, and then reviewer-led screening studies for inclusion. This standard method is time- and resource-intensive. We designed and applied an algorithm written in Python involving computer-aided identification of keywords within each paper for an exemplar systematic review of arm impairment after stroke. The standard method involved reading each abstract searching for these keywords. We compared the methods in terms of accuracy in identification of keywords, abstracts' eligibility, and time taken to make a decision about eligibility. For external validation, we adapted the algorithm for a different systematic review, and compared eligible studies using the algorithm with those included in that review. For the exemplar systematic review, the algorithm failed on 72 out of 2,789 documents retrieved (2.6%). Both methods identified the same 610 studies for inclusion. Based on a sample of 21 randomly selected abstracts, the standard screening took 1.58 ± 0.26 min per abstract. Computer output screening took 0.43 ± 0.14 min per abstract. The mean difference between the two methods was 1.15 min ( P  < 0.0001), saving 73% per abstract. For the other systematic review, use of the algorithm resulted in the same studies being identified. One study was excluded based on the interpretation of the comparison intervention. Our purpose-built software was an accurate and significantly time-saving method for identifying eligible abstracts for inclusion in systematic reviews. This novel method could be adapted for other systematic reviews in future for the benefit of authors, reviewers and editors., (Copyright © 2023 Wolters Kluwer Health, Inc. All rights reserved.)

In recent years, the wide application of deep neural network models has brought serious risks of intellectual property rights infringement. Embedding a watermark in a network model is an effective solution to protect intellectual property rights. Although researchers have proposed schemes to add watermarks to models, they cannot prevent attackers from adding and overwriting original information, and embedding rates cannot be quantified. Therefore, aiming at these problems, this paper designs a high embedding rate and tamper-proof watermarking scheme. We employ wet paper coding (WPC), in which important parameters are regarded as wet blocks and the remaining unimportant parameters are regarded as dry blocks in the model. To obtain the important parameters more easily, we propose an optimized probabilistic selection strategy (OPSS). OPSS defines the unimportant-level function and sets the importance threshold to select the important parameter positions and to ensure that the original function is not affected after the model parameters are changed. We regard important parameters as an unmodifiable part, and only modify the part that includes the unimportant parameters. We selected the MNIST, CIFAR-10, and ImageNet datasets to test the performance of the model after adding a watermark and to analyze the fidelity, robustness, embedding rate, and comparison schemes of the model. Our experiment shows that the proposed scheme has high fidelity and strong robustness along with a high embedding rate and the ability to prevent malicious tampering.

The amount of available scientific literature is increasing, and studies have proposed various methods for evaluating document-document similarity in order to cluster or classify documents for science mapping and knowledge discovery. In this paper, we propose hybrid methods for bibliographic coupling (BC) and linear evaluation of text or content similarity: We combined BC with BM25, Cosine, and PMRA to compare their performances with single methods in paper recommendation tasks using TREC Genomics Track 2005datasets. For paper recommendation, BC and text-based methods complement each other, and hybrid methods were better than single methods. The combinations of BC with BM25 and BC with Cosine performed better than BC with PMRA. The performances were best when the weights of BM25, Cosine, and PMRA were 0.025, 0.2, and 0.2, respectively, in hybrid methods. For paper recommendation, the combinations of BC with text-based methods were better than BC or text-based methods used alone. The choice of method should depend on the actual data and research needs. In the future, the underlying reasons for the differences in performance and the specific part or type of information they complement in text clustering or recommendation need to be examined.

Today, computer graphics and graphic image processing techniques have been widely used in daily life and industrial production. Due to the development of computers, computer graphics has brought more convenience to our daily life. In order to give full play to the value of computers, this paper takes the Hakka paper-cut art with local characteristics as the starting point, first of all its development history, artistic characteristics, compositional forms, expression techniques, cultural connotations, Hakka paper-cut patterns, and the symbolic meaning of folk customs, and then we design a visualization system for the paper-cut works of Gannan Hakka based on computer graphics. In addition, the system provides a solution for the integration of Gannan Hakka paper-cut art and Jiangxi native product packaging design and provides a reference for the theory and practice of modern native product packaging design., Competing Interests: The author declares that he has no conflicts of interest., (Copyright © 2022 Xingping Li.)

Introduction: Participation from racial and ethnic minorities in clinical trials has been burdened by issues surrounding mistrust and access to healthcare. There is emerging use of machine learning (ML) in clinical trial recruitment and evaluation. However, for individuals from groups who are recipients of societal biases, utilisation of ML can lead to the creation and use of biased algorithms. To minimise bias, the design of equitable ML tools that advance health equity could be guided by community engagement processes. The Howard University Partnership with the National Institutes of Health for Equitable Clinical Trial Participation for Racial/Ethnic Communities Underrepresented in Research (HoPeNET) seeks to create an ML-based infrastructure from community advisory board (CAB) experiences to enhance participation of African-Americans/Blacks in clinical trials., Methods and Analysis: This triphased cross-sectional study (24 months, n=56) will create a CAB of community members and research investigators. The three phases of the study include: (1) identification of perceived barriers/facilitators to clinical trial engagement through qualitative/quantitative methods and systems-based model building participation; (2) operation of CAB meetings and (3) development of a predictive ML tool and outcome evaluation. Identified predictors from the participant-derived systems-based map will be used for the ML tool development., Ethics and Dissemination: We anticipate minimum risk for participants. Institutional review board approval and informed consent has been obtained and patient confidentiality ensured., Competing Interests: Competing interests: None declared., (© Author(s) (or their employer(s)) 2022. Re-use permitted under CC BY-NC. No commercial re-use. See rights and permissions. Published by BMJ.)

In the last 15 years, the segmentation of vessels in retinal images has become an intensively researched problem in medical imaging, with hundreds of algorithms published. One of the de facto benchmarking data sets of vessel segmentation techniques is the DRIVE data set. Since DRIVE contains a predefined split of training and test images, the published performance results of the various segmentation techniques should provide a reliable ranking of the algorithms. Including more than 100 papers in the study, we performed a detailed numerical analysis of the coherence of the published performance scores. We found inconsistencies in the reported scores related to the use of the field of view (FoV), which has a significant impact on the performance scores. We attempted to eliminate the biases using numerical techniques to provide a more realistic picture of the state of the art. Based on the results, we have formulated several findings, most notably: despite the well-defined test set of DRIVE, most rankings in published papers are based on non-comparable figures; in contrast to the near-perfect accuracy scores reported in the literature, the highest accuracy score achieved to date is 0.9582 in the FoV region, which is 1% higher than that of human annotators. The methods we have developed for identifying and eliminating the evaluation biases can be easily applied to other domains where similar problems may arise., 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 © 2021 Elsevier B.V. All rights reserved.)

Extracorporeal life support systems (ECLS) are life-sustaining measures for severe cardiovascular diseases, serving as bridging treatment either until cardiovascular function is restored or alternative treatment, such as heart transplantation or the implantation of permanent ventricular assist devices is performed. Given the insufficient evidence and frequent urgency of implantation without initial patient consent, the ethical challenges and psychological burden for patients, relatives and the interprofessional intensive care team are significant. As with any treatment, an appropriate therapeutic goal for ECLS treatment based on the indications and patient informed consent is mandatory. In order to integrate the necessary ethical considerations into everyday clinical practice, a structured algorithm for handling ECLS is proposed here, which takes ethical aspects into due account. [ABSTRACT FROM AUTHOR]

Purpose: We present SCAMPI (Sparsity Constrained Application of deep Magnetic resonance Priors for Image reconstruction), an untrained deep Neural Network for MRI reconstruction without previous training on datasets. It expands the Deep Image Prior approach with a multidomain, sparsity-enforcing loss function to achieve higher image quality at a faster convergence speed than previously reported methods., Methods: Two-dimensional MRI data from the FastMRI dataset with Cartesian undersampling in phase-encoding direction were reconstructed for different acceleration rates for single coil and multicoil data., Results: The performance of our architecture was compared to state-of-the-art Compressed Sensing methods and ConvDecoder, another untrained Neural Network for two-dimensional MRI reconstruction. SCAMPI outperforms these by better reducing undersampling artifacts and yielding lower error metrics in multicoil imaging. In comparison to ConvDecoder, the U-Net architecture combined with an elaborated loss-function allows for much faster convergence at higher image quality. SCAMPI can reconstruct multicoil data without explicit knowledge of coil sensitivity profiles. Moreover, it is a novel tool for reconstructing undersampled single coil k-space data., Conclusion: Our approach avoids overfitting to dataset features, that can occur in Neural Networks trained on databases, because the network parameters are tuned only on the reconstruction data. It allows better results and faster reconstruction than the baseline untrained Neural Network approach., (© 2024 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine.)

Purpose: To introduce a novel deep model-based architecture (DMBA), SPICER, that uses pairs of noisy and undersampled k-space measurements of the same object to jointly train a model for MRI reconstruction and automatic coil sensitivity estimation., Methods: SPICER consists of two modules to simultaneously reconstructs accurate MR images and estimates high-quality coil sensitivity maps (CSMs). The first module, CSM estimation module, uses a convolutional neural network (CNN) to estimate CSMs from the raw measurements. The second module, DMBA-based MRI reconstruction module, forms reconstructed images from the input measurements and the estimated CSMs using both the physical measurement model and learned CNN prior. With the benefit of our self-supervised learning strategy, SPICER can be efficiently trained without any fully sampled reference data., Results: We validate SPICER on both open-access datasets and experimentally collected data, showing that it can achieve state-of-the-art performance in highly accelerated data acquisition settings (up to 10 × $$ 10\times $$ ). Our results also highlight the importance of different modules of SPICER-including the DMBA, the CSM estimation, and the SPICER training loss-on the final performance of the method. Moreover, SPICER can estimate better CSMs than pre-estimation methods especially when the ACS data is limited., Conclusion: Despite being trained on noisy undersampled data, SPICER can reconstruct high-quality images and CSMs in highly undersampled settings, which outperforms other self-supervised learning methods and matches the performance of the well-known E2E-VarNet trained on fully sampled ground-truth data., (© 2024 International Society for Magnetic Resonance in Medicine.)

Purpose: The aim of this work is to develop a method to solve the ill-posed inverse problem of accelerated image reconstruction while correcting forward model imperfections in the context of subject motion during MRI examinations., Methods: The proposed solution uses a Bayesian framework based on deep generative diffusion models to jointly estimate a motion-free image and rigid motion estimates from subsampled and motion-corrupt two-dimensional (2D) k-space data., Results: We demonstrate the ability to reconstruct motion-free images from accelerated two-dimensional (2D) Cartesian and non-Cartesian scans without any external reference signal. We show that our method improves over existing correction techniques on both simulated and prospectively accelerated data., Conclusion: We propose a flexible framework for retrospective motion correction of accelerated MRI based on deep generative diffusion models, with potential application to other forward model corruptions., (© 2024 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine.)

Purpose: In MRI, motion artifacts can significantly degrade image quality. Motion artifact correction methods using deep neural networks usually required extensive training on large datasets, making them time-consuming and resource-intensive. In this paper, an unsupervised deep learning-based motion artifact correction method for turbo-spin echo MRI is proposed using the deep image prior framework., Theory and Methods: The proposed approach takes advantage of the high impedance to motion artifacts offered by the neural network parameterization to remove motion artifacts in MR images. The framework consists of parameterization of MR image, automatic spatial transformation, and motion simulation model. The proposed method synthesizes motion-corrupted images from the motion-corrected images generated by the convolutional neural network, where an optimization process minimizes the objective function between the synthesized images and the acquired images., Results: In the simulation study of 280 slices from 14 subjects, the proposed method showed a significant increase in the averaged structural similarity index measure by 0.2737 in individual coil images and by 0.4550 in the root-sum-of-square images. In addition, the ablation study demonstrated the effectiveness of each proposed component in correcting motion artifacts compared to the corrected images produced by the baseline method. The experiments on real motion dataset has shown its clinical potential., Conclusion: The proposed method exhibited significant quantitative and qualitative improvements in correcting rigid and in-plane motion artifacts in MR images acquired using turbo spin-echo sequence., (© 2024 International Society for Magnetic Resonance in Medicine.)

Subject motion is a long-standing problem of magnetic resonance imaging (MRI), which can seriously deteriorate the image quality. Various prospective and retrospective methods have been proposed for MRI motion correction, among which deep learning approaches have achieved state-of-the-art motion correction performance. This survey paper aims to provide a comprehensive review of deep learning-based MRI motion correction methods. Neural networks used for motion artifacts reduction and motion estimation in the image domain or frequency domain are detailed. Furthermore, besides motion-corrected MRI reconstruction, how estimated motion is applied in other downstream tasks is briefly introduced, aiming to strengthen the interaction between different research areas. Finally, we identify current limitations and point out future directions of deep learning-based MRI motion correction., (© 2024. The Author(s), under exclusive licence to European Society for Magnetic Resonance in Medicine and Biology (ESMRMB).)

Hidden Markov models (HMMs), which can characterize dynamic heterogeneity, are valuable tools for analyzing longitudinal data. The order of HMMs (ie, the number of hidden states) is typically assumed to be known or predetermined by some model selection criterion in conventional analysis. As prior information about the order frequently lacks, pairwise comparisons under criterion-based methods become computationally expensive with the model space growing. A few studies have conducted order selection and parameter estimation simultaneously, but they only considered homogeneous parametric instances. This study proposes a Bayesian double penalization (BDP) procedure for simultaneous order selection and parameter estimation of heterogeneous semiparametric HMMs. To overcome the difficulties in updating the order, we create a brand-new Markov chain Monte Carlo algorithm coupled with an effective adjust-bound reversible jump strategy. Simulation results reveal that the proposed BDP procedure performs well in estimation and works noticeably better than the conventional criterion-based approaches. Application of the suggested method to the Alzheimer's Disease Neuroimaging Initiative research further supports its usefulness., (© 2024 John Wiley & Sons Ltd.)

Literature screening is the process of identifying all relevant records from a pool of candidate paper records in systematic review, meta-analysis, and other research synthesis tasks. This process is time consuming, expensive, and prone to human error. Screening prioritization methods attempt to help reviewers identify most relevant records while only screening a proportion of candidate records with high priority. In previous studies, screening prioritization is often referred to as automatic literature screening or automatic literature identification. Numerous screening prioritization methods have been proposed in recent years. However, there is a lack of screening prioritization methods with reliable performance. Our objective is to develop a screening prioritization algorithm with reliable performance for practical use, for example, an algorithm that guarantees an 80% chance of identifying at least 80 % of the relevant records. Based on a target-based method proposed in Cormack and Grossman, we propose a screening prioritization algorithm using sampling with replacement. The algorithm is a wrapper algorithm that can work with any current screening prioritization algorithm to guarantee the performance. We prove, with mathematics and probability theory, that the algorithm guarantees the performance. We also run numeric experiments to test the performance of our algorithm when applied in practice. The numeric experiment results show this algorithm achieve reliable performance under different circumstances. The proposed screening prioritization algorithm can be reliably used in real world research synthesis tasks., (© 2024 The Authors. Research Synthesis Methods published by John Wiley & Sons Ltd.)

Analysing data from educational tests allows governments to make decisions for improving the quality of life of individuals in a society. One of the key responsibilities of statisticians is to develop models that provide decision-makers with pertinent information about the latent process that educational tests seek to represent. Mixtures of t $$ t $$ factor analysers (MtFA) have emerged as a powerful device for model-based clustering and classification of high-dimensional data containing one or several groups of observations with fatter tails or anomalous outliers. This paper considers an extension of MtFA for robust clustering of censored data, referred to as the MtFAC model, by incorporating external covariates. The enhanced flexibility of including covariates in MtFAC enables cluster-specific multivariate regression analysis of dependent variables with censored responses arising from upper and/or lower detection limits of experimental equipment. An alternating expectation conditional maximization (AECM) algorithm is developed for maximum likelihood estimation of the proposed model. Two simulation experiments are conducted to examine the effectiveness of the techniques presented. Furthermore, the proposed methodology is applied to Peruvian data from the 2007 Early Grade Reading Assessment, and the results obtained from the analysis provide new insights regarding the reading skills of Peruvian students., (© 2023 British Psychological Society.)

The gig economy and gig work have grown quickly in recent years and have drawn much attention from researchers in different fields. Because the platform mediated gig economy is a relatively new phenomenon, studies have produced a range of interesting findings; of interest here are the socio‐technical issues that this work has surfaced. This systematic literature review (SLR) provides a snapshot of a range of socio‐technical issues raised in the last 12 years of literature focused on the platform mediated gig economy. Based on a sample of 515 papers gathered from nine databases in multiple disciplines, 132 were coded that specifically studied the gig economy, gig work, and gig workers. Three main socio‐technical themes were identified: (1) the digital workplace, which includes information infrastructure and digital labor that are related to the nature of gig work and the user agency; (2) algorithmic management, which includes platform governance, performance management, information asymmetry, power asymmetry, and system manipulation, relying on a diverse set of technological tools including algorithms and big data analytics; (3) ethical design, as a relevant value set that gig workers expect from the platform, which includes trust, fairness, equality, privacy, and transparency. A social informatics perspective is used to rethink the relationship between gig workers and platforms, extract the socio‐technical issues noted in prior research, and discuss the underexplored aspects of the platform mediated gig economy. The results draw attention to understudied yet critically important socio‐technical issues in the gig economy that suggest short‐ and long‐term opportunities for future research directions. [ABSTRACT FROM AUTHOR]

Traditional federated learning faces challenges such as high communication costs, structural heterogeneity,and insufficient privacy protection. To address these issues, this paper proposes a federated learning evolutionary algorithm that applies sparse evolutionary training algorithm to reduce communication costs and integrates local differential privacy protection for participants’ privacy. Additionally, it utilizes the NSGA-Ⅲ algorithm to optimize the network structure and sparsity of the global federated learning model, adjusting the relationship between data availability and privacy protection. This achieves a balance between the effectiveness, communication costs, and privacy of the global federated learning model. Experimental results under unstable communication environments demonstrate that, on the MNIST and CIFAR-10 datasets, compared to the solution with the lowest error rate using the FNSGA-Ⅲ algorithm, the proposed algorithm improves communication efficiency by 57. 19% and 52. 17%, respectively. The participants also achieved（3. 46, 10-4） and（6. 52, 10-4）-local differential privacy. This algorithm can effectively reduce communication costs and protect participant privacy without significantly compromising the accuracy of the global model. [ABSTRACT FROM AUTHOR]

The rapid development of technology has resulted in a surge in the volume of digital data available. This situation creates a problem for users who need assistance in locating specific information within this massive collection of data, resulting in a time-consuming process. Automatic Text Summarization systems have been developed as a more effective solution than traditional summarization techniques to address this problem and improve user access to relevant information. It is well known that researchers in the health sciences find it difficult to keep up with the latest literature due to their busy schedules. This study aims to produce comprehensive abstracts of Turkish-language scientific papers in the field of health sciences. Although abstracts of scientific papers are already available, more thorough summaries are still needed. To the best of our knowledge, no previous attempt has been made to automatically summarize Turkish language health science papers. For this purpose, a dataset of 105 Turkish papers was collected from DergiPark. Term Frequency, Term Frequency-Inverse Document Frequency, Latent Semantic Analysis, TextRank, and Latent Dirichlet Allocation algorithms were chosen as extractive text summarization methods due to their frequent use in this field. The performance of the text summarization models was evaluated using recall, precision, and F-score metrics, and the algorithms gave satisfactory results for Turkish. [ABSTRACT FROM AUTHOR]

There is increasing focus on applying deep learning methods to electrocardiograms (ECGs), with recent studies showing that neural networks (NNs) can predict future heart failure or atrial fibrillation from the ECG alone. However, large numbers of ECGs are needed to train NNs, and many ECGs are currently only in paper format, which are not suitable for NN training. We developed a fully-automated online ECG digitisation tool to convert scanned paper ECGs into digital signals. Using automated horizontal and vertical anchor point detection, the algorithm automatically segments the ECG image into separate images for the 12 leads and a dynamical morphological algorithm is then applied to extract the signal of interest. We then validated the performance of the algorithm on 515 digital ECGs, of which 45 were printed, scanned and redigitised. The automated digitisation tool achieved 99.0% correlation between the digitised signals and the ground truth ECG (n = 515 standard 3-by-4 ECGs) after excluding ECGs with overlap of lead signals. Without exclusion, the performance of average correlation was from 90 to 97% across the leads on all 3-by-4 ECGs. There was a 97% correlation for 12-by-1 and 3-by-1 ECG formats after excluding ECGs with overlap of lead signals. Without exclusion, the average correlation of some leads in 12-by-1 ECGs was 60–70% and the average correlation of 3-by-1 ECGs achieved 80–90%. ECGs that were printed, scanned, and redigitised, our tool achieved 96% correlation with the original signals. We have developed and validated a fully-automated, user-friendly, online ECG digitisation tool. Unlike other available tools, this does not require any manual segmentation of ECG signals. Our tool can facilitate the rapid and automated digitisation of large repositories of paper ECGs to allow them to be used for deep learning projects. [ABSTRACT FROM AUTHOR]

Interaction between proteins and nucleic acids is crucial to many cellular activities. Accurately detecting nucleic acid-binding residues (NABRs) in proteins can help researchers better understand the interaction mechanism between proteins and nucleic acids. Structure-based methods can generally make more accurate predictions than sequence-based methods. However, the existing structure-based methods are sensitive to protein conformational changes, causing limited generalizability. More effective and robust approaches should be further explored. In this study, we propose iNucRes-ASSH to identify nucleic acid-binding residues with a self-attention-based structure-sequence hybrid neural network. It improves the generalizability and robustness of NABR prediction from two levels: residue representation and prediction model. Experimental results show that iNucRes-ASSH can predict the nucleic acid-binding residues even when the experimentally validated structures are unavailable and outperforms five competing methods on a recent benchmark dataset and a widely used test dataset., (© 2023 Wiley Periodicals LLC.)

The pipeline of drug discovery consists of a number of processes; drug-target interaction determination is one of the salient steps among them. Computational prediction of drug-target interactions can facilitate in reducing the search space of experimental wet lab-based verifications steps, thus considerably reducing time and other resources dedicated to the drug discovery pipeline. While machine learning-based methods are more widespread for drug-target interaction prediction, network-centric methods are also evolving. In this chapter, we focus on the process of the drug-target interaction prediction from the perspective of using machine learning algorithms and the various stages involved for developing an accurate predictor., (© 2024. The Author(s), under exclusive license to Springer Science+Business Media, LLC, part of Springer Nature.)

The development and maintenance of the item bank is a critical element to a CD-CAT (cognitive diagnostic computerized adaptive testing; Cheng, 2009) system. For continuous testing, it is important to replenish the item bank with new items that have been calibrated. This requires pretesting to estimate the parameters of the new items. For CD-CAT, the structural parameters that need to be estimated include both item parameters and attribute vectors. In this paper, we propose three residual-statistic-based methods: RMA, ROEM, and RMEM, to estimate the attribute vectors and item parameters all together for new items. An iterative two-step online calibration procedure is developed to estimate the attribute vectors for the new items in the first step, and estimate the item parameters in the second step, then proceed iteratively until convergence is reached. An extensive simulation study was conducted to evaluate the performance of the three proposed methods and compare them with two existing methods, namely the Joint Estimation Algorithm (JEA; Chen & Xin, 2011) and Single Item Estimation (SIE; Chen et al., 2015) methods. In terms of the estimation of the attribute vector, the RMEM method performs the best in most of the cases. In terms of item parameter estimation, RMEM still has some advantages, and RMA outperforms JEA and SIE. Taken together, results suggest that the RMEM is superior to the other methods, especially when sample size is relatively small. A real-data example is provided to illustrate the application of RMEM in practice., (© 2022. The Psychonomic Society, Inc.)

Background: Radiation dose reduction has been the focus of many research activities in x-ray CT. Various approaches were taken to minimize the dose to patients, ranging from the optimization of clinical protocols, refinement of the scanner hardware design, and development of advanced reconstruction algorithms. Although significant progress has been made, more advancements in this area are needed to minimize the radiation risks to patients., Purpose: Reconstruction algorithm-based dose reduction approaches focus mainly on the suppression of noise in the reconstructed images while preserving detailed anatomical structures. Such an approach effectively produces synthesized high-dose images (SHD) from the data acquired with low-dose scans. A representative example is the model-based iterative reconstruction (MBIR). Despite its widespread deployment, its full adoption in a clinical environment is often limited by an undesirable image texture. Recent studies have shown that deep learning image reconstruction (DLIR) can overcome this shortcoming. However, the limited availability of high-quality clinical images for training and validation is often the bottleneck for its development. In this paper, we propose a novel approach to generate SHD with existing low-dose clinical datasets that overcomes both the noise texture issue and the data availability issue., Methods: Our approach is based on the observation that noise in the image can be effectively reduced by performing image processing orthogonal to the imaging plane. This process essentially creates an equivalent thick-slice image (TSI), and the characteristics of TSI depend on the nature of the image processing. An advantage of this approach is its potential to reduce impact on the noise texture. The resulting image, however, is likely corrupted by the anatomical structural degradation due to partial volume effects. Careful examination has shown that the differential signal between the original and the processed image contains sufficient information to identify regions where anatomical structures are modified. The differential signal, unfortunately, contains significant noise and has to be removed. The noise removal can be accomplished by performing iterative noise reduction to preserve structural information. The processed differential signal is subsequently subtracted from TSI to arrive at SHD., Results: The algorithm was evaluated extensively with phantom and clinical datasets. For better visual inspection, difference images between the original and SHD were generated and carefully examined. Negligible residual structure could be observed. In addition to the qualitative inspection, quantitative analyses were performed on clinical images in terms of the CT number consistency and the noise reduction characteristics. Results indicate that no CT number bias is introduced by the proposed algorithm. In addition, noise reduction capability is consistent across different patient anatomical regions. Further, simulated water phantom scans were utilized in the generation of the noise power spectrum (NPS) to demonstrate the preservation of the noise-texture., Conclusions: We present a method to generate SHD datasets from regularly acquired low-dose CT scans. Images produced with the proposed approach exhibit excellent noise-reduction with the desired noise-texture. Extensive clinical and phantom studies have demonstrated the efficacy and robustness of our approach. Potential limitations of the current implementation are discussed and further research topics are outlined., (© 2023 American Association of Physicists in Medicine.)

Image processing (IP) in digital radiography has been steadily refined to improve image quality. Adaptable settings enable users to adjust systems to their specific requirements. This prospective, analytical study aimed to investigate the influence of different IP settings and dose reductions on image quality. Included were 20 cadaveric equine limb specimens distal to the metacarpophalangeal and metatarsophalangeal joints. Images were processed with the Dynamic Visualization II system (Fujifilm) using five different IP settings including multiobjective frequency processing, flexible noise control (FNC), and virtual grid processing (VGP). Seven criteria were assessed by three veterinary radiology Diplomates and one veterinary radiology resident in a blinded study using a scoring system. Algorithm comparison was performed using an absolute visual grading analysis. The rating of bone structures was improved by VGP at full dose (P < .05; AUC VGC  = 0.45). Überschwinger artifact perception was enhanced by VGP (P < .001; AUC VGC  = 0.66), whereas image noise perception was suppressed by FNC (P < .001; AUC VGC  = 0.29). The ratings of bone structures were improved by FNC at 50% dose (P < .05; AUC VGC  = 0.44), and 25% dose (P < .001; AUC VGC  = 0.32), and clinically acceptable image quality was maintained at 50% dose (mean rating 2.16; 95.8% ratings sufficient or better). The favored IP setting varied among observers, with higher agreement at lower dose levels. These findings supported using individualized IP settings based on the radiologist's preferences and situational image requirements, rather than using default settings., (© 2023 The Authors. Veterinary Radiology & Ultrasound published by Wiley Periodicals LLC on behalf of American College of Veterinary Radiology.)

Purpose: It has been reported that the estimate of ultrasound attenuation coefficient (AC) is affected by depth of measurement, with linear decrease of values with depth. It is unknown whether backscatter coefficient (BSC) has similar behavior., Methods: This retrospective study was performed with Sequoia US system equipped with ultrasound derived fat fraction (UDFF) algorithm (Siemens Healthineers, Issaquah, WA, USA) that combines BSC with AC. UDFF was obtained positioning upper edge of the region of interest at 1.5,2,3,4,5 cm below liver capsule. BSC data were extracted from UDFF offline. A fractional polynomial regression, which selects the best model considering the polynomial development of the variables of interest, was used. Covariates included were age, sex, skin-to-liver-capsule distance, stiffness. Distance was included as linear factor or with a power ranging from - 2 to 3, and the best fitting model was chosen according to partial F test. Body mass index (BMI) was not included because of collinearity with skin-to-liver capsule distance., Results: 104 individuals (56 females; age: 57.9 ± 13.0 years; BMI: 29.0 ± 6.5 kg/m 2 ; skin-to-liver-capsule distance: 2.3 ± 0.7 cm; liver stiffness: 7.5 ± 5.5 kiloPascal) were studied. Best fitting model for BSC included a combination of depth as linear factor and square root. BSC showed a decrease of - 13.98 dB/cm-steradian for each logarithmic increase of 1 cm depth (coefficient: - 13.98; 95% CI: - 21.016; - 5.379; p = .001). Skin-to-liver-capsule distance and stiffness also were independent predictors of BSC., Conclusions: The estimation of the BSC in the liver exhibits a depth dependence that significantly affects results. A standardized acquisition protocol is needed to compare results and reliably assess changes over time., (© 2024. The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.)

Purpose: MR-STAT is a relatively new multiparametric quantitative MRI technique in which quantitative paramater maps are obtained by solving a large-scale nonlinear optimization problem. Managing reconstruction times is one of the main challenges of MR-STAT. In this work we leverage GPU hardware to reduce MR-STAT reconstruction times. A highly optimized, GPU-compatible Bloch simulation toolbox is developed as part of this work that can be utilized for other quantitative MRI techniques as well., Methods: The Julia programming language was used to develop a flexible yet highly performant and GPU-compatible Bloch simulation toolbox called BlochSimulators.jl. The runtime performance of the toolbox is benchmarked against other Bloch simulation toolboxes. Furthermore, a (partially matrix-free) modification of a previously presented (matrix-free) MR-STAT reconstruction algorithm is proposed and implemented using the Julia language on GPU hardware. The proposed algorithm is combined with BlochSimulators.jl and the resulting MR-STAT reconstruction times on GPU hardware are compared to previously presented MR-STAT reconstruction times., Results: The BlochSimulators.jl package demonstrates superior runtime performance on both CPU and GPU hardware when compared to other existing Bloch simulation toolboxes. The GPU-accelerated partially matrix-free MR-STAT reconstruction algorithm, which relies on BlochSimulators.jl, allows for reconstructions of 68 seconds per two-dimensional (2D slice)., Conclusion: By combining the proposed Bloch simulation toolbox and the partially matrix-free reconstruction algorithm, 2D MR-STAT reconstructions can be performed in the order of one minute on a modern GPU card. The Bloch simulation toolbox can be utilized for other quantitative MRI techniques as well, for example for online dictionary generation for MR Fingerprinting., (© 2024 The Authors. Magnetic Resonance in Medicine published by Wiley Periodicals LLC on behalf of International Society for Magnetic Resonance in Medicine.)

Objectives: This study was designed to investigate clinical differences between pediatric patients who presented with chest pain, tachycardia, and/or tachypnea who subsequently were or were not diagnosed with myocarditis. The results were used to develop a decision tree to aid in rapid diagnosis of pediatric myocarditis., Methods: A retrospective case-control study was performed using the electronic medical records of children aged 0 to 18 years between the years 2003 and 2020 with a complaint of chest pain, tachycardia, and/or tachypnea. Patients included in the study were those diagnosed with myocarditis and those with suspected myocarditis, which was ultimately ruled out. Demographic and clinical differences between the research groups were analyzed. A decision tree was rendered using the rpart (Recursive Partitioning and Regression Trees) package., Results: Four thousand one hundred twenty-five patients were screened for eligibility. Seventy-three myocarditis patients and 292 nonmyocarditis patients were included. Compared with the control group, the study group was found to have a higher mean respiratory rate (37 ± 23 vs 23 ± 7 breaths per minute) and mean heart rate (121 ± 44 vs 97 ± 25 beats per minute) and lower mean systolic and diastolic blood pressure (102 ± 27/56 ± 17 mm Hg vs 114 ± 14/67 ± 10 mm Hg). The mean white blood cell count was greater in the case group (13 ± 6 vs 10 ± 5 × 10 3 /μL). A decision tree was rendered using simple demographic and clinical variables. The accuracy of the algorithm was 85.2%, with 100% accuracy in patients aged 0 to 2.5 years and 69% in patients aged 2.5 to 18 years., Conclusion: The clinical and laboratory characteristics described in this study were similar to what is described in the literature. The decision tree may aid in the diagnosis of myocarditis in patients 2.5 years and younger. In the population aged 2.5 to 18 years, the decision tree did not constitute an adequate tool for detecting myocarditis., Competing Interests: Disclosure: The authors declare no conflict of interest., (Copyright © 2024 Wolters Kluwer Health, Inc. All rights reserved.)

Cox models with time-dependent coefficients and covariates are widely used in survival analysis. In high-dimensional settings, sparse regularization techniques are employed for variable selection, but existing methods for time-dependent Cox models lack flexibility in enforcing specific sparsity patterns (ie, covariate structures). We propose a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules. Our method can adapt to arbitrary grouping structures, including interaction selection, temporal, spatial, tree, and directed acyclic graph structures. It achieves accurate estimation with low false alarm rates. We develop the sox package, implementing a network flow algorithm for efficiently solving models with complex covariate structures. sox offers a user-friendly interface for specifying grouping structures and delivers fast computation. Through examples, including a case study on identifying predictors of time to all-cause death in atrial fibrillation patients, we demonstrate the practical application of our method with specific selection rules., (© 2024 John Wiley & Sons Ltd.)

Estimating causal effects from large experimental and observational data has become increasingly prevalent in both industry and research. The bootstrap is an intuitive and powerful technique used to construct standard errors and confidence intervals of estimators. Its application however can be prohibitively demanding in settings involving large data. In addition, modern causal inference estimators based on machine learning and optimization techniques exacerbate the computational burden of the bootstrap. The bag of little bootstraps has been proposed in non-causal settings for large data but has not yet been applied to evaluate the properties of estimators of causal effects. In this article, we introduce a new bootstrap algorithm called causal bag of little bootstraps for causal inference with large data. The new algorithm significantly improves the computational efficiency of the traditional bootstrap while providing consistent estimates and desirable confidence interval coverage. We describe its properties, provide practical considerations, and evaluate the performance of the proposed algorithm in terms of bias, coverage of the true 95% confidence intervals, and computational time in a simulation study. We apply it in the evaluation of the effect of hormone therapy on the average time to coronary heart disease using a large observational data set from the Women's Health Initiative., (© 2024 John Wiley & Sons Ltd.)

The U.S. Food and Drug Administration (FDA) has launched Project Optimus to shift dose selection from the maximum tolerated dose (MTD) to the dose that produces the optimal risk-benefit tradeoff. One approach highlighted in the FDA's guidance involves conducting a randomized phase II trial following the completion of a phase I trial, where multiple doses (typically including the MTD and one or two doses lower than the MTD) are compared to identify the optimal dose that maximizes the benefit-risk tradeoff. This article focuses on the design of such a multiple-dose randomized trial, specifically the determination of the sample size. We generalized the standard definitions of type I error and power to accommodate the unique characteristics of dose optimization and derived a decision rule along with an algorithm to determine the optimal sample size. The resulting design is referred to as MERIT (Multiple-dosE RandomIzed Trial design for dose optimization based on toxicity and efficacy). Simulation studies demonstrate that MERIT has desirable operating characteristics, and a sample size between 20 and 40 per dosage arm often offers reasonable power and type I errors to ensure patient safety and benefit. To facilitate the implementation of the MERIT design, we provide software, available at https://www.trialdesign.org., (© 2024 John Wiley & Sons Ltd.)

➤ No single test has demonstrated absolute accuracy for the diagnosis of periprosthetic joint infection (PJI).➤ Physicians rely on a combination of serological tests, synovial markers, and clinical findings plus clinical judgment to help to guide preoperative decision-making.➤ Several organizations have proposed criteria for the diagnosis of hip or knee PJI on which we now rely.➤ Given that shoulder arthroplasty has only recently become popular, it is possible that a shoulder-specific definition of PJI will be introduced in the coming years.➤ Although a number of serum and synovial markers have demonstrated high accuracy for the diagnosis of PJI of the hip and knee, further research is needed in order to identify markers that may be more suitable for the diagnosis of shoulder PJI and for the potential development and identification of specific serological tests as screening tools for PJI., Competing Interests: Disclosure: The Disclosure of Potential Conflicts of Interest forms are provided with the online version of the article ( http://links.lww.com/JBJS/I24 )., (Copyright © 2024 by The Journal of Bone and Joint Surgery, Incorporated.)

Background: Quantification of metabolites concentrations in institutional unit (IU) is important for inter-subject and long-term comparisons in the applications of magnetic resonance spectroscopy (MRS). Recently, deep learning (DL) algorithms have found a variety of applications on the process of MRS data. A quantification strategy compatible to DL base MRS spectral processing method is, therefore, useful., Materials and Methods: This study aims to investigate whether metabolite concentrations quantified using a convolutional neural network (CNN) based method, coupled with a scaling procedure that normalizes spectral signals for CNN input and linear regression, can effectively reflect variations in metabolite concentrations in IU across different brain regions with varying signal-to-noise ratios (SNR) and linewidths (LW). An error index based on standard error (SE) is proposed to indicate the confidence levels associated with metabolite predictions. In vivo MRS spectra were acquired from three brain regions of 43 subjects using a 3T system., Results: The metabolite concentrations in IU of five major metabolites, quantified using CNN and LCModel, exhibit similar ranges with Pearson's correlation coefficients ranging from 0.24 to 0.78. The SE of the metabolites shows a positive correlation with Cramer-Rao lower bound (CRLB) (r=0.46) and  absolute CRLB (r=0.81), calculated by multiplying CRLBs with the quantified metabolite content., Conclusion: In conclusion, the CNN based method with the proposed scaling procedures can be employed to quantify in vivo MRS spectra and derive metabolites concentrations in IU. The SE can be used as error index, indicating predicted uncertainties for metabolites and sharing information similar to the absolute CRLB., (© 2023. The Author(s), under exclusive licence to European Society for Magnetic Resonance in Medicine and Biology (ESMRMB).)

Purpose: Clinical benefits result from electronic patient-reported outcome (ePRO) systems that enable remote symptom monitoring. Although clinically useful, real-time alert notifications for severe or worsening symptoms can overburden nurses. Thus, we aimed to algorithmically identify likely non-urgent alerts that could be suppressed., Methods: We evaluated alerts from the PRO-TECT trial (Alliance AFT-39) in which oncology practices implemented remote symptom monitoring. Patients completed weekly at-home ePRO symptom surveys, and nurses received real-time alert notifications for severe or worsening symptoms. During parts of the trial, patients and nurses each indicated whether alerts were urgent or could wait until the next visit. We developed an algorithm for suppressing alerts based on patient assessment of urgency and model-based predictions of nurse assessment of urgency., Results: 593 patients participated (median age = 64 years, 61% female, 80% white, 10% reported never using computers/tablets/smartphones). Patients completed 91% of expected weekly surveys. 34% of surveys generated an alert, and 59% of alerts prompted immediate nurse actions. Patients considered 10% of alerts urgent. Of the remaining cases, nurses considered alerts urgent more often when patients reported any worsening symptom compared to the prior week (33% of alerts with versus 26% without any worsening symptom, p = 0.009). The algorithm identified 38% of alerts as likely non-urgent that could be suppressed with acceptable discrimination (sensitivity = 80%, 95% CI [76%, 84%]; specificity = 52%, 95% CI [49%, 55%])., Conclusion: An algorithm can identify remote symptom monitoring alerts likely to be considered non-urgent by nurses, and may assist in fostering nurse acceptance and implementation feasibility of ePRO systems., (© 2024. The Author(s), under exclusive licence to Springer Nature Switzerland AG.)

Contemporary pose estimation methods enable precise measurements of behavior via supervised deep learning with hand-labeled video frames. Although effective in many cases, the supervised approach requires extensive labeling and often produces outputs that are unreliable for downstream analyses. Here, we introduce 'Lightning Pose', an efficient pose estimation package with three algorithmic contributions. First, in addition to training on a few labeled video frames, we use many unlabeled videos and penalize the network whenever its predictions violate motion continuity, multiple-view geometry and posture plausibility (semi-supervised learning). Second, we introduce a network architecture that resolves occlusions by predicting pose on any given frame using surrounding unlabeled frames. Third, we refine the pose predictions post hoc by combining ensembling and Kalman smoothing. Together, these components render pose trajectories more accurate and scientifically usable. We released a cloud application that allows users to label data, train networks and process new videos directly from the browser., (© 2024. The Author(s), under exclusive licence to Springer Nature America, Inc.)

Objective: The Visiopharm artificial intelligence (AI) algorithm for oestrogen receptor (ER) immunohistochemistry (IHC) in whole slide images (WSIs) has been successfully validated in surgical pathology. This study aimed to assess its efficacy in cytology specimens., Methods: The study cohort comprised 105 consecutive cytology specimens with metastatic breast carcinoma. ER IHC WSIs were seamlessly integrated into the Visiopharm platform from the Image Management System (IMS) during our routine digital workflow, and an AI algorithm was employed for analysis. ER AI scores were compared with pathologists' manual consensus scores. Optimization steps were implemented and evaluated to reduce discordance., Results: The overall concordance between pathologists' scores and AI scores was excellent (99/105, 94.3%). Six cases exhibited discordant results, including two false-negative (FN) cases due to abundant histiocytes incorrectly counted as negatively stained tumour cells by AI, two FN cases owing to weak staining, and two false-positive (FP) cases where pigmented macrophages were erroneously counted as positively stained tumour cells by AI. The Pearson correlation coefficient of ER-positive percentages between pathologists' and AI scores was 0.8483. Optimization steps, such as lowering the cut-off threshold and additional training using higher input magnification, significantly improved accuracy., Conclusions: The automated ER AI algorithm demonstrated excellent concordance with pathologists' assessments and accurately differentiated ER-positive from ER-negative metastatic breast carcinoma cytology cases. However, precision in identifying tumour cells in cytology specimens requires further enhancement., (© 2024 John Wiley & Sons Ltd.)

In view of the problems of data sparsity and the diversity in academic paper recom-mender systems,based on CONVNCF, this paper proposed an algorithm of convolution with word and heterogeneous information network for academic paper recommendation ( WN -APR) . Firstly, WN -APR algorithm learned user and paper' s diverse features from different semantics to alleviate the sparsity problem. Then it designed an outer product fusing way to seamlessly combine user features with paper features. Replacing of 2D CNN, this algorithm applied 3 D convolution to mine the influence of different features on the performance. Finally, it modified the BPR loss function to enhance diversity in recommendations. Experimental results on CiteULike-a and CiteULike-t datasets show that WN-APR improves the performance of accuracy and diversity over the baseline models. [ABSTRACT FROM AUTHOR]

Background: Image registration technology has become an important medical image preprocessing step with the wide application of computer-aided diagnosis technology in various medical image analysis tasks., Purpose: We propose a multiscale feature fusion registration based on deep learning to achieve the accurate registration and fusion of head magnetic resonance imaging (MRI) and solve the problem that general registration methods cannot handle the complex spatial information and position information of head MRI., Methods: Our proposed multiscale feature fusion registration network consists of three sequentially trained modules. The first is an affine registration module that implements affine transformation; the second is to realize non-rigid transformation, a deformable registration module composed of top-down and bottom-up feature fusion subnetworks in parallel; and the third is a deformable registration module that also realizes non-rigid transformation and is composed of two feature fusion subnetworks in series. The network decomposes the deformation field of large displacement into multiple deformation fields of small displacement by multiscale registration and registration, which reduces the difficulty of registration. Moreover, multiscale information in head MRI is learned in a targeted manner, which improves the registration accuracy, by connecting the two feature fusion subnetworks., Results: We used 29 3D head MRIs for training and seven volumes for testing and calculated the values of the registration evaluation metrics for the new algorithm to register anterior and posterior lateral pterygoid muscles. The Dice similarity coefficient was 0.745 ± 0.021, the Hausdorff distance was 3.441 ± 0.935 mm, the Average surface distance was 0.738 ± 0.098 mm, and the Standard deviation of the Jacobian matrix was 0.425 ± 0.043. Our new algorithm achieved a higher registration accuracy compared with state-of-the-art registration methods., Conclusions: Our proposed multiscale feature fusion registration network can realize end-to-end deformable registration of 3D head MRI, which can effectively cope with the characteristics of large deformation displacement and the rich details of head images and provide reliable technical support for the diagnosis and analysis of head diseases., (© 2023 American Association of Physicists in Medicine.)

Background: Recent developments in alpha and beta emitting radionuclide therapy highlight the importance of developing efficient methods for patient-specific dosimetry. Traditional tabulated methods such as Medical Internal Radiation Dose (MIRD) estimate the dose at the organ level while more recent numerical methods based on Monte Carlo (MC) simulations are able to calculate dose at the voxel level. A precalculated MC (PMC) approach was developed in this work as an alternative to time-consuming fully simulated MC. Once the spatial distribution of alpha and beta emitters is determined using imaging and/or numerical methods, the PMC code can be used to achieve an accurate voxelized 3D distribution of the deposited energy without relying on full MC calculations., Purpose: To implement the PMC method to calculate energy deposited by alpha and beta particles emitted from the Ra-224 decay chain., Methods: The GEANT4 (version 10.7) MC toolkit was used to generate databases of precalculated tracks to be integrated in the PMC code as well as to benchmark its output. In this regard, energy spectra of alpha and beta particles emitted by the Ra-224 decay chain were generated using GAMOS (version 6.2.0) and imported into GEANT4 macro files. Either alpha or beta emitting sources were defined at the center of a homogeneous phantom filled with various materials such as soft tissue, bone, and lung where particles were emitted either mono-directionally (for database generation) or isotropically (for benchmarking). Two heterogeneous phantoms were used to demonstrate PMC code compatibility with boundary crossing events. Each precalculated database was generated step-by-step by storing particle track information from GEANT4 simulations followed by its integration in a PMC code developed in MATLAB. For a user-defined number of histories, one of the tracks in a given database was selected randomly and rotated randomly to reflect an isotropic emission. Afterward, deposited energy was divided between voxels based on step length in each voxel using a ray-tracing approach. The radial distribution of deposited energy was benchmarked against fully simulated MC calculations using GEANT4. The effect of the GEANT4 parameter StepMax on the accuracy and speed of the code was also investigated., Results: In the case of alpha decay, primary alpha particles show the highest contribution (>99%) in deposited energy compared to their secondary particles. In most cases, protons act as the main secondary particles in the deposition of energy. However, for a lung phantom, using a range cutoff parameter of 10 µm on primary alpha particles yields a higher contribution of secondary electrons than protons. Differences between deposited energy calculated by PMC and fully simulated MC are within 2% for all alpha and beta emitters in homogeneous and heterogeneous phantoms. Additionally, statistical uncertainties are less than 1% for voxels with doses higher than 5% of the maximum dose. Moreover, optimization of the parameter StepMax is necessary to achieve the best tradeoff between code accuracy and speed., Conclusions: The PMC code shows good performance for dose calculations deposited by alpha and beta emitters. As a stand-alone algorithm, it is suitable to be integrated into clinical treatment planning systems., (© 2023 The Authors. Medical Physics published by Wiley Periodicals LLC on behalf of American Association of Physicists in Medicine.)

Recently, artificial intelligence (AI) techniques have been increasingly used to overcome the challenges in drug discovery. Although traditional AI techniques generally have high accuracy rates, there may be difficulties in explaining the decision process and patterns. This can create difficulties in understanding and making sense of the outputs of algorithms used in drug discovery. Therefore, using explainable AI (XAI) techniques, the causes and consequences of the decision process are better understood. This can help further improve the drug discovery process and make the right decisions. To address this issue, Explainable Artificial Intelligence (XAI) emerged as a process and method that securely captures the results and outputs of machine learning (ML) and deep learning (DL) algorithms. Using techniques such as SHAP (SHApley Additive ExPlanations) and LIME (Locally Interpretable Model-Independent Explanations) has made the drug targeting phase clearer and more understandable. XAI methods are expected to reduce time and cost in future computational drug discovery studies. This review provides a comprehensive overview of XAI-based drug discovery and development prediction. XAI mechanisms to increase confidence in AI and modeling methods. The limitations and future directions of XAI in drug discovery are also discussed., (© 2023 John Wiley & Sons Ltd.)

The so-coined fourth paradigm in science has reached the sensing area, with the use of machine learning (ML) toward data-driven improvements in sensitivity, reproducibility, and accuracy, along with the determination of multiple targets from a single measurement using multi-output regression models. Particularly, the use of supervised ML models trained on large data sets produced by electrical and electrochemical bio/sensors has emerged as an impacting trend in the literature by allowing accurate analyses even in the presence of usual issues such as electrode fouling, poor signal-to-noise ratio, chemical interferences, and matrix effects. In this trend article, apart from an outlook for the coming years, we present examples from the literature that demonstrate how helpful ML algorithms can be for dispensing the adoption of experimental methods to address the aforesaid interfering issues, ultimately contributing to translate testing technologies into on-site, practical, and daily applications., (© 2023. Springer-Verlag GmbH Germany, part of Springer Nature.)

Objective: To describe the development of a platform for image collection and annotation that resulted in a multi-sourced international image dataset of oral lesions to facilitate the development of automated lesion classification algorithms., Materials and Methods: We developed a web-interface, hosted on a web server to collect oral lesions images from international partners. Further, we developed a customised annotation tool, also a web-interface for systematic annotation of images to build a rich clinically labelled dataset. We evaluated the sensitivities comparing referral decisions through the annotation process with the clinical diagnosis of the lesions., Results: The image repository hosts 2474 images of oral lesions consisting of oral cancer, oral potentially malignant disorders and other oral lesions that were collected through MeMoSA ® UPLOAD. Eight-hundred images were annotated by seven oral medicine specialists on MeMoSA ® ANNOTATE, to mark the lesion and to collect clinical labels. The sensitivity in referral decision for all lesions that required a referral for cancer management/surveillance was moderate to high depending on the type of lesion (64.3%-100%)., Conclusion: This is the first description of a database with clinically labelled oral lesions. This database could accelerate the improvement of AI algorithms that can promote the early detection of high-risk oral lesions., (© 2022 Wiley Periodicals LLC.)

The electrocardiogram (ECG) signal describes the heart's electrical activity, allowing it to detect several health conditions, including cardiac system abnormalities and dysfunctions. Nowadays, most patient medical records are still paper-based, especially those made in past decades. The importance of collecting digitized ECGs is twofold: firstly, all medical applications can be easily implemented with an engineering approach if the ECGs are treated as signals; secondly, paper ECGs can deteriorate over time, therefore a correct evaluation of the patient's clinical evolution is not always guaranteed. The goal of this paper is the realization of an automatic conversion algorithm from paper-based ECGs (images) to digital ECG signals. The algorithm involves a digitization process tested on an image set of 16 subjects, also with pathologies. The quantitative analysis of the digitization method is carried out by evaluating the repeatability and reproducibility of the algorithm. The digitization accuracy is evaluated both on the entire signal and on six ECG time parameters (R-R peak distance, QRS complex duration, QT interval, PQ interval, P-wave duration, and heart rate). Results demonstrate the algorithm efficiency has an average Pearson correlation coefficient of 0.94 and measurement errors of the ECG time parameters are always less than 1 mm. Due to the promising experimental results, the algorithm could be embedded into a graphical interface, becoming a measurement and collection tool for cardiologists. [ABSTRACT FROM AUTHOR]

With the exponential growth in the number of academic researchers, it is crucial for editors of scientific journals to identify the highest-quality papers. While several measures exist to evaluate a paper's impact post-publication, the challenge of determining the potential impact of a manuscript during the review process remains an understudied issue. In this paper, we propose a reviewer-reputation ranking algorithm to identify high-quality papers based on paper citations, where a reviewer's reputation is computed from the correlation between their past ratings and the current number of citations received by the papers they have evaluated. During the review process, reviewers with high reputation scores are given more weight to determine the quality of papers. We test the algorithm on an artificial network with 200 reviewers and 600 papers, as well as on the American Physical Society (APS) data set, including in the analysis 308,243 papers and 274,154 mutual citations. We compare our approach with two existing methods, demonstrating that our algorithm significantly outperforms the others in identifying manuscripts with the highest quality. Our findings can help improve the impact of scientific journals, thereby contributing to academic and scientific progress. • We propose an algorithm to identify the papers with the highest quality from a large number of submissions. • We compare our new algorithm with other existing methods of aggregating user ratings in various online services. • We test our algorithm both with an artificial network and with the empirical data of the APS data set. • We show that our algorithm outperforms the other methods in identifying the papers with the highest quality. [ABSTRACT FROM AUTHOR]