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

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]

Methods to rank documents in large-scale citation data are increasingly assessed in terms of their ability to identify small sets of expert-selected papers. Here, we propose an algorithm for the accurate identification of milestone papers from citation networks. The algorithm combines an influence propagation process with game theory concepts. It outperforms state-of-the-art metrics in the identification of milestone papers in aggregate citation network data, while potentially mitigating the ranking's temporal bias compared with metrics that have similar milestone identification performance. The proposed method sheds light on the interplay between ranking accuracy and temporal bias. • We transform citation networks into influence propagation networks by reversing the citation relationships. • We propose a novel diffusion-based metric for ranking papers, combining influence propagation and game theory. • Experiments on APS and DBLP datasets demonstrate the effectiveness of our metric in identifying milestone papers. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal Algorithms, featuring selected papers from the journal's editorial board members from 2022 and 2023. The issue includes 16 research papers covering a range of topics such as game theory, fault detection in cellular networks, optimization algorithms, machine learning, cryptocurrency trading, and more. Each paper presents its own unique research findings and methodologies. The issue aims to showcase the diverse research interests and expertise of the journal's editorial board members. [Extracted from the article]

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

Copyright of Lijecnicki Vjesnik is the property of Croatian Medical Association and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Firstly, this paper analyzes the role of AI in the reading management of English language and literature, establishes the implicit knowledge base of neural network, designs the auxiliary reading system for learning English language and literature, and optimizes the English language and literature management model of AI. The experimental results show that its reading efficiency is increased by 0.48%, and the performance of the credibility model is improved by 0.53% compared with the original system, which greatly optimizes the running time of the system. To some extent, it helps users to manage their time in English language and literature reading, and greatly improves users' reading efficiency and quality. Based on this advantage of AI algorithm, this paper introduces that the algorithm optimizes the reading management model and the training process of neural grid, and constructs a model of English language and literature assisted reading system based on AI. The system can better meet the needs of users in English language and literature reading management.

In this paper, we continue describing the project and the experimentation of "Ricerca Operativa Applicazioni Reali" (ROAR; in English, Real Applications of Operations Research), a three-year project for higher secondary schools, introduced. ROAR is composed of three teaching units, addressed to Grades 10, 11, and 12, respectively, having the main aim to improve students' interest, motivation, and skills related to Science, Technology, Engineering, and Mathematics disciplines by integrating mathematics and computer science through operations research. In a previous paper, we reported on the design and implementation of the first unit, started in Spring 2021 at the scientific high school IIS Antonietti in Iseo (Brescia, Italy), in a Grade-10 class. Here, we focus on the second unit, carried out in Winter/Spring 2022 with the same students, now in a Grade-11 class. In particular, we describe objectives, prerequisites, topics and methods, the organization of the lectures, digital technologies used, and a challenging final project. Moreover, we analyze the feedback from students and teachers involved in the experimentation.

The innovation capability largely determines the initiative for future development of a region. Higher school is the main position for training innovative talents. Accurate and comprehensive assessment of innovation cultivation capability is an important basis of higher schools for continuous improvement. Thus, this paper focuses on assessing innovative talent cultivation capability. First, by CIPP model (Context, Input, Process and Product Evaluation), an assessment indicator system is built, consisting of 89 indicators in 21 categories. Then, based on indicator characteristics, this paper uses public data statistics, database retrieving, student survey, teacher survey, support personnel and expert investigation, to collect indicator values. After this, by a powerful machine learning algorithm, gradient Boosting regression tree, a capability assessment model is established. And based on collected data, established model is compared with several regression models in innovative talent cultivation capability assessing. Results confirm the performance superiority of our solution.

Systematic reviews and meta-analyses are crucial for advancing research, yet they are time-consuming and resource-demanding. Although machine learning and natural language processing algorithms may reduce this time and these resources, their performance has not been tested in education and educational psychology, and there is a lack of clear information on when researchers should stop the reviewing process. In this study, we conducted a retrospective screening simulation using 27 systematic reviews in education and educational psychology. We evaluated the sensitivity, specificity, and estimated time savings of several learning algorithms and heuristic stopping criteria. The results showed, on average, a 58% (SD = 19%) reduction in the screening workload of irrelevant records when using learning algorithms for abstract screening and an estimated time savings of 1.66 days (SD = 1.80). The learning algorithm random forests with sentence bidirectional encoder representations from transformers outperformed other algorithms. This finding emphasizes the importance of incorporating semantic and contextual information during feature extraction and modeling in the screening process. Furthermore, we found that 95% of all relevant abstracts within a given dataset can be retrieved using heuristic stopping rules. Specifically, an approach that stops the screening process after classifying 20% of records and consecutively classifying 5% of irrelevant papers yielded the most significant gains in terms of specificity (M = 42%, SD = 28%). However, the performance of the heuristic stopping criteria depended on the learning algorithm used and the length and proportion of relevant papers in an abstract collection. Our study provides empirical evidence on the performance of machine learning screening algorithms for abstract screening in systematic reviews in education and educational psychology.

Purpose: This paper aims to center the experiences of three cohorts (n = 40) of Black high school students who participated in a critical race technology course that exposed anti-blackness as the organizing logic and default setting of digital and artificially intelligent technology. This paper centers the voices, experiences and technological innovations of the students, and in doing so, introduces a new type of digital literacy: critical race algorithmic literacy. Design/methodology/approach: Data for this study include student interviews (called "talk backs"), journal reflections and final technology presentations. Findings: Broadly, the data suggests that critical race algorithmic literacies prepare Black students to critically read the algorithmic word (e.g. data, code, machine learning models, etc.) so that they can not only resist and survive, but also "rebuild" and "reimagine" the algorithmic world. Originality/value: While critical race media literacy draws upon critical race theory in education - a theorization of race, and a critique of white supremacy and multiculturalism in schools - critical race algorithmic literacy is rooted in critical race technology theory, which is a theorization of blackness as a technology and a critique of algorithmic anti-blackness as the organizing logic of schools and AI systems.

This paper proposes an online learning platform learner DM method based on the improved fuzzy C clustering (FCM) algorithm, constructs a learner feature database, and combines clustering analysis and SPSS statistical methods to statistically summarize the big data of law, thus improving the deficiencies of static and absolute classification of students in the student model. In the experiment paper, the improved algorithm is implemented and the experimental data is analyzed. The results show that the learner behavior feature extraction model in this paper has fewer errors and higher recall rate. Compared with the traditional CF algorithm, the error rate is reduced by 19.64% and the recall rate is increased by 22.85%. This study provides better targeted teaching programs and case resources for legal case teaching and promotes the innovation of legal case teaching mode.

The application of computer technology has revolutionized and promoted the traditional mode of piano teaching. Nowadays, many companies and institutions have begun to apply computer technology to online piano teaching. This paper analyzes the difficulties faced by students in piano teaching and the development of piano assistant practice and summarizes the demands of parents, teachers, students, and principals for online piano teaching system. Based on this, this paper designs and implements an online piano teaching system without special hardware. This system improves the existing maximum logarithm MPa algorithm and improves the detection performance while keeping the complexity low. Combined with the special structure of parallel projection, a generalized automaton model of hybrid system is proposed, and five elements are used to describe the continuous and discrete behaviors in the hybrid subsystem. It not only keeps the advantage of low complexity of the original Max log MPa algorithm, but also obtains better detection performance.