Reviewerly/exHarmony huggingface dataset:
Novel optimized crow search algorithm for feature selection

Feature selection techniques have been presented to allow us to choose a small subset of the original components' relevant features by removing irrelevant or redundant features. Feature selection is essential for many reasons such as simplification, performance, computational efficiency, and quality interpretability. Owing to the importance mentioned above, many researchers have proposed and developed many algorithms to solve the feature selection problem. Although these approaches produce useful results, they possess some shortcomings like inadequate feature reduction. In this paper, a novel feature selection algorithm based on the crow search algorithm is presented. The algorithm uses dynamic awareness probability to keep the balance between the local and global search processes. Moreover, a novel neighborhood assigning strategy has been introduced to optimize the local search. Considering the best-selected features in each iteration helps attain more benefits in global search. The main superiority of the proposed algorithm is the significant feature reduction along with retaining the accuracy. Compared to enhanced crow search algorithm, the proposed algorithm has improved the feature reduction metric and fitness metric by 27.12% and 5.16%, respectively, while losing the accuracy metric by only 0.53%. Several popular UCI datasets have been employed to evaluate the proposed feature selection algorithm. The experimental results show that the proposed algorithm outperformed other feature selection algorithms in state-of-the-art related works regarding feature reduction and accuracy.
Towards effective detection of elderly falls with CNN-LSTM neural networks

Fall detection is a very challenging task that has a clear impact in the autonomous living of the elderly individuals: suffering a fall with no support increases the fears of the elderly population to continue living by themselves. This study proposes the use of a non-invasive tri-axial accelerometer device placed on a wrist to measure the movements of the participant. The novelty of this study is two fold: on the one hand, the use of a Long-Short Term Memory Neural Network (LSTM) for classification of the Time Series and, on the other hand, the proposal of a novel data augmentation stage that introduces variability in the training by merging the Time Series gathered from both human activities of daily living. The experimentation shows that the combination of a LSTM model together with the data augmentation produces more robust and accurate models that perfectly cope with the validation stage; the high impact fall event detection can be considered solved.
A novel decentralized federated learning approach to train on globally distributed, poor quality, and protected private medical data

Training on multiple diverse data sources is critical to ensure unbiased and generalizable AI. In healthcare, data privacy laws prohibit data from being moved outside the country of origin, preventing global medical datasets being centralized for AI training. Data-centric, cross-silo federated learning represents a pathway forward for training on distributed medical datasets. Existing approaches typically require updates to a training model to be transferred to a central server, potentially breaching data privacy laws unless the updates are sufficiently disguised or abstracted to prevent reconstruction of the dataset. Here we present a completely decentralized federated learning approach, using knowledge distillation, ensuring data privacy and protection. Each node operates independently without needing to access external data. AI accuracy using this approach is found to be comparable to centralized training, and when nodes comprise poor-quality data, which is common in healthcare, AI accuracy can exceed the performance of traditional centralized training.
Intrinsic decoherence effects on nonclassical correlations in a symmetric spin–orbit model

Nonclassical correlations dynamics of local quantum Fisher information, trace-norm measurement-induced nonlocality, and log-negativity are investigated in a symmetric spin–orbit model. This model is described by a Heisenberg XYZ two-spin system exposed to the magnetic field and Kaplan–Shekhtman–Entin-Wohlman–Aharony (KSEA) interaction under the intrinsic decoherence effects. To evaluate the resourcefulness of this model for the generation and preservation of quantum correlations, we consider two qubits that are initially prepared in two different states, namely uncorrelated and maximally correlated states. The magnetic field is discovered to be effective at generating and preserving nonclassical correlations. Besides, we find that the KSEA interaction can alter the generation, preservation, and revival features of nonclassical correlations in the two-qubit system. However, the bipartite nonclassical correlations become extremely fragile when intrinsic decoherence effects appear.
Bridging 2D and 3D segmentation networks for computation-efficient volumetric medical image segmentation: An empirical study of 2.5D solutions

Recently, deep convolutional neural networks have achieved great success for medical image segmentation. However, unlike segmentation of natural images, most medical images such as MRI and CT are volumetric data. In order to make full use of volumetric information, 3D CNNs are widely used. However, 3D CNNs suffer from higher inference time and computation cost, which hinders their further clinical applications. Additionally, with the increased number of parameters, the risk of overfitting is higher, especially for medical images where data and annotations are expensive to acquire. To issue this problem, many 2.5D segmentation methods have been proposed to make use of volumetric spatial information with less computation cost. Despite these works lead to improvements on a variety of segmentation tasks, to the best of our knowledge, there has not previously been a large-scale empirical comparison of these methods. In this paper, we aim to present a review of the latest developments of 2.5D methods for volumetric medical image segmentation. Additionally, to compare the performance and effectiveness of these methods, we provide an empirical study of these methods on three representative segmentation tasks involving different modalities and targets. Our experimental results highlight that 3D CNNs may not always be the best choice. Despite all these 2.5D methods can bring performance gains to 2D baseline, not all the methods hold the benefits on different datasets. We hope the results and conclusions of our study will prove useful for the community on exploring and developing efficient volumetric medical image segmentation methods.
Breast Cancer Prediction Empowered with Fine-Tuning

In the world, in the past recent five years, breast cancer is diagnosed about 7.8 million women's and making it the most widespread cancer, and it is the second major reason for women's death. So, early prevention and diagnosis systems of breast cancer could be more helpful and significant. Neural networks can extract multiple features automatically and perform predictions on breast cancer. There is a need for several labeled images to train neural networks which is a nonconventional method for some types of data images such as breast magnetic resonance imaging (MRI) images. So, there is only one significant solution for this query is to apply fine-tuning in the neural network. In this paper, we proposed a fine-tuning model using AlexNet in the neural network to extract features from breast cancer images for training purposes. So, in the proposed model, we updated the first and last three layers of AlexNet to detect the normal and abnormal regions of breast cancer. The proposed model is more efficient and significant because, during the training and testing process, the proposed model achieves higher accuracy 98.44% and 98.1% of training and testing, respectively. So, this study shows that the use of fine-tuning in the neural network can detect breast cancer using MRI images and train a neural network classifier by feature extraction using the proposed model is faster and more efficient.
EQC

Variational quantum algorithm (VQA), which is comprised of a classical optimizer and a parameterized quantum circuit, emerges as one of the most promising approaches for harvesting the power of quantum computers in the noisy intermediate scale quantum (NISQ) era. However, the deployment of VQAs on contemporary NISQ devices often faces considerable system and time-dependant noise and prohibitively slow training speeds. On the other hand, the expensive supporting resources and infrastructure make quantum computers extremely keen on high utilization.
Using Rogers' diffusion of innovation theory to conceptualize the mobile-learning adoption process in teacher education in the COVID-19 era

Using mobile learning (ML) has become exceedingly relevant in times of distant teaching. Although much is known about the factors affecting ML usage, less is known about the ML adoption process under constraints such as the COVID-19 pandemic. The aim of this exploratory case study was to gain insight into the ML adoption process using the lens of Rogers' Diffusion of Innovation Theory. Participants were in-service (32) and preservice (29) teachers who attended ML training. Data were collected using semi-structured interviews (20), focus groups (6), and participants' reflections (183) at three time points. Data underwent multilevel analysis (content and linguistic analysis), revealing 12 themes that denote the ML adoption process and demonstrated intergroup similarities and differences. The study provides theoretical insight into the ML adoption process under crisis and highlights the features that must be addressed to promote optimal ML adoption in teacher education in both routine and emergency conditions.
Weakly supervised deep learning for prediction of treatment effectiveness on ovarian cancer from histopathology images

Despite the progress made during the last two decades in the surgery and chemotherapy of ovarian cancer, more than 70 % of advanced patients are with recurrent cancer and decease. Surgical debulking of tumors following chemotherapy is the conventional treatment for advanced carcinoma, but patients with such treatment remain at great risk for recurrence and developing drug resistance, and only about 30 % of the women affected will be cured. Bevacizumab is a humanized monoclonal antibody, which blocks VEGF signaling in cancer, inhibits angiogenesis and causes tumor shrinkage, and has been recently approved by FDA as a monotherapy for advanced ovarian cancer in combination with chemotherapy. Considering the cost, potential toxicity, and finding that only a portion of patients will benefit from these drugs, the identification of new predictive method for the treatment of ovarian cancer remains an urgent unmet medical need. In this study, we develop weakly supervised deep learning approaches to accurately predict therapeutic effect for bevacizumab of ovarian cancer patients from histopathological hematoxylin and eosin stained whole slide images, without any pathologist-provided locally annotated regions. To the authors' best knowledge, this is the first model demonstrated to be effective for prediction of the therapeutic effect of patients with epithelial ovarian cancer to bevacizumab. Quantitative evaluation of a whole section dataset shows that the proposed method achieves high accuracy, 0.882 ± 0.06; precision, 0.921 ± 0.04, recall, 0.912 ± 0.03; F-measure, 0.917 ± 0.07 using 5-fold cross validation and outperforms two state-of-the art deep learning approaches Coudray et al. (2018), Campanella et al. (2019). For an independent TMA testing set, the three proposed methods obtain promising results with high recall (sensitivity) 0.946, 0.893 and 0.964, respectively. The results suggest that the proposed method could be useful for guiding treatment by assisting in filtering out patients without positive therapeutic response to suffer from further treatments while keeping patients with positive response in the treatment process. Furthermore, according to the statistical analysis of the Cox Proportional Hazards Model, patients who were predicted to be invalid by the proposed model had a very high risk of cancer recurrence (hazard ratio = 13.727) than patients predicted to be effective with statistical signifcance (p < 0.05).
Assessment of floating solar photovoltaic potential in India’s existing hydropower reservoirs

The hydropower share of the Indian electrical sector has declined significantly over time, and a greater reliance on the complementation of thermoelectric power plants to meet energy demand. This issue has led to an increase in greenhouse gas emissions, which has exacerbated climate change and altered rainfall regimes in numerous sections of the country, as well as increased potential evapotranspiration. Installing floating solar photovoltaic (FSPV) plants in existing hydropower reservoirs would increase the hydropower share and reduce evaporation losses. FSPV is also assisting the country in meeting the net-zero carbon emission target and India's rapidly rising population's current and future energy needs. Using very accurate water surface data from the country's 117 hydroelectric reservoirs, this study presents a comprehensive analysis of the potential of FSPV installations in Indian hydropower reservoirs. In addition to electricity generation, CO2 savings and evaporation savings are calculated. The additional hydropower generated, as well as the number of people who could be able to benefit due to these water savings, are also estimated at reservoir level for four different scenarios considering pontoon type of floating structure. The results show that with total coverage of less than 4% area of hydroelectric reservoirs, existing hydropower plants can double their installed power capacity and increase their electricity output by 52%, producing an additional 66.56 TWh per year. In this case, water savings could total 837 million m3/year, resulting in a 1.566 TWh of additional annual hydroelectricity generation.
Energy saving evaluation of an energy efficient data center using a model-free reinforcement learning approach

To reduce cooling energy consumption, data centers are recommended to raise temperature setpoints of server intake. However, in tropical climates, Data Center operators are still found to be operating at lower temperatures. In this paper, we demonstrate that using a floating setpoint with a lowered temperature value for tropical climates reduces the overall energy consumption of Data Centers as opposed to raising the temperature in a static manner. We achieve this by applying a deep reinforcement learning algorithm to a hybrid data center model that was built from data collected off a highly efficient data center. This generates an optimal control strategy which minimizes the costs of energy consumption while operating within the required set of operational constraints. Following which, we evaluate the behavior of the control strategy to account for the exact sources of energy savings. The deep reinforcement learning algorithm learns by continually interacting with the built Data Center model without any prior knowledge of the Data Center. The algorithm is trained under the full-load and the part-load configuration of the Data Center. Testing results show that further energy savings of up to 3% and 5.5% (under full load and part load respectively) can be achieved with targeted cooling provisioning while operating within constraints in an already cooling-efficient Data Center. We find that while building level optimization studies of Data Centers generally improve energy efficiency, the source of energy savings is not well accounted for. Consequently, our studies show that the reduction of server fan usage and not the reduction of cooling energy consumption is the main contributor of energy savings in a deep reinforcement learning-driven data center operating in the tropics.
Optimal PID control for hovering stabilization of quadcopter using long short term memory

Drones are a type of unmanned aerial vehicle. They use several rotors to control their flight motion and stabilize their attitude. This study aims to determine the optimal proportional-integral–differential (PID) gain values that can stabilize a quadcopter with four rotors quickly when its attitude is disturbed. Generally, expert knowledge and a great deal of time and money are required to obtain the PID gain values to stabilize the attitude of a drone. However, in this study, long short-term memory (LSTM), which is a type of neural network algorithm, was used to evaluate the flight motions based on PID gain values without expert knowledge of quadcopters (quadcopter flight motion, PID control algorithms, and quadcopter expert experience). To obtain the optimal values of the PID gain for stabilizing the attitude of a drone, a PID simulator algorithm was developed in this study. The developed algorithm used dynamic equations of motion for the drones. Simulations were used to acquire the drone stabilization data, and a back-propagation neural network was applied to establish an approximate model. Subsequently, the non-dominated sorting genetic algorithm-II was used to obtain the optimal PID gain values that could restore the attitude of the drone quickly. The drone motion data obtained using the simulations were used as the LSTM training data, and the optimal PID gain values obtained using the genetic algorithm were used by the LSTM to predict the motion. To verify the results, a drone was constructed, and the LSTM and dynamic simulation values were compared with the drone experimental values using an experimental device that allowed the motion of the drone to be examined. The results indicated that the motions resulting from the optimal values and the experimental results were in agreement.
Does distrust in humans predict greater trust in AI? Role of individual differences in user responses to content moderation

When evaluating automated systems, some users apply the “positive machine heuristic” (i.e. machines are more accurate and precise than humans), whereas others apply the “negative machine heuristic” (i.e. machines lack the ability to make nuanced subjective judgments), but we do not know much about the characteristics that predict whether a user would apply the positive or negative machine heuristic. We conducted a study in the context of content moderation and discovered that individual differences relating to trust in humans, fear of artificial intelligence (AI), power usage, and political ideology can predict whether a user will invoke the positive or negative machine heuristic. For example, users who distrust other humans tend to be more positive toward machines. Our findings advance theoretical understanding of user responses to AI systems for content moderation and hold practical implications for the design of interfaces to appeal to users who are differentially predisposed toward trusting machines over humans.
TGL

Many real world graphs contain time domain information. Temporal Graph Neural Networks capture temporal information as well as structural and contextual information in the generated dynamic node embeddings. Researchers have shown that these embeddings achieve state-of-the-art performance in many different tasks. In this work, we propose TGL, a unified framework for large-scale offline Temporal Graph Neural Network training where users can compose various Temporal Graph Neural Networks with simple configuration files. TGL comprises five main components, a temporal sampler, a mailbox, a node memory module, a memory updater, and a message passing engine. We design a Temporal-CSR data structure and a parallel sampler to efficiently sample temporal neighbors to form training mini-batches. We propose a novel random chunk scheduling technique that mitigates the problem of obsolete node memory when training with a large batch size. To address the limitations of current TGNNs only being evaluated on small-scale datasets, we introduce two large-scale real-world datasets with 0.2 and 1.3 billion temporal edges. We evaluate the performance of TGL on four small-scale datasets with a single GPU and the two large datasets with multiple GPUs for both link prediction and node classification tasks. We compare TGL with the open-sourced code of five methods and show that TGL achieves similar or better accuracy with an average of 13X speedup. Our temporal parallel sampler achieves an average of 173X speedup on a multi-core CPU compared with the baselines. On a 4-GPU machine, TGL can train one epoch of more than one billion temporal edges within 1-10 hours. To the best of our knowledge, this is the first work that proposes a general framework for large-scale Temporal Graph Neural Networks training on multiple GPUs.
Self-Supervised Transformer for Sparse and Irregularly Sampled Multivariate Clinical Time-Series

Multivariate time-series data are frequently observed in critical care settings and are typically characterized by sparsity (missing information) and irregular time intervals. Existing approaches for learning representations in this domain handle these challenges by either aggregation or imputation of values, which in-turn suppresses the fine-grained information and adds undesirable noise/overhead into the machine learning model. To tackle this problem, we propose a S elf-supervised Tra nsformer for T ime- S eries (STraTS) model, which overcomes these pitfalls by treating time-series as a set of observation triplets instead of using the standard dense matrix representation. It employs a novel Continuous Value Embedding technique to encode continuous time and variable values without the need for discretization. It is composed of a Transformer component with multi-head attention layers, which enable it to learn contextual triplet embeddings while avoiding the problems of recurrence and vanishing gradients that occur in recurrent architectures. In addition, to tackle the problem of limited availability of labeled data (which is typically observed in many healthcare applications), STraTS utilizes self-supervision by leveraging unlabeled data to learn better representations by using time-series forecasting as an auxiliary proxy task. Experiments on real-world multivariate clinical time-series benchmark datasets demonstrate that STraTS has better prediction performance than state-of-the-art methods for mortality prediction, especially when labeled data is limited. Finally, we also present an interpretable version of STraTS, which can identify important measurements in the time-series data. Our data preprocessing and model implementation codes are available at https://github.com/sindhura97/STraTS .