Reviewerly/exHarmony huggingface dataset:
LogicSolver: Towards Interpretable Math Word Problem Solving with Logical Prompt-enhanced Learning

Recently, deep learning models have made great progress in MWP solving on answer accuracy.However, they are uninterpretable since they mainly rely on shallow heuristics to achieve high performance without understanding and reasoning the grounded math logic.To address this issue and make a step towards interpretable MWP solving, we first construct a high-quality MWP dataset named InterMWP which consists of 11,495 MWPs and annotates interpretable logical formulas based on algebraic knowledge as the grounded linguistic logic of each solution equation.Different from existing MWP datasets, our InterMWP benchmark asks for a solver to not only output the solution expressions but also predict the corresponding logical formulas.We further propose a novel approach with logical prompt and interpretation generation, called LogicSolver.For each MWP, our LogicSolver first retrieves some highly-correlated algebraic knowledge and then passes them to the backbone model as prompts to improve the semantic representations of MWPs.With these improved semantic representations, our Logic-Solver generates corresponding solution expressions and interpretable knowledge formulas in accord with the generated solution expressions, simultaneously.Experimental results show that our LogicSolver has stronger logical formula-based interpretability than baselines while achieving higher answer accuracy with the help of logical prompts, simultaneously.The source code and dataset is available at https://github.com/yangzhch6/InterMWP.
CaMeL-Net: Centroid-aware metric learning for efficient multi-class cancer classification in pathology images

Cancer grading in pathology image analysis is a major task due to its importance in patient care, treatment, and management. The recent developments in artificial neural networks for computational pathology have demonstrated great potential to improve the accuracy and quality of cancer diagnosis. These improvements are generally ascribable to the advance in the architecture of the networks, often leading to increase in the computation and resources. In this work, we propose an efficient convolutional neural network that is designed to conduct multi-class cancer classification in an accurate and robust manner via metric learning. We propose a centroid-aware metric learning network for an improved cancer grading in pathology images. The proposed network utilizes centroids of different classes within the feature embedding space to optimize the relative distances between pathology images, which manifest the innate similarities/dissimilarities between them. For improved optimization, we introduce a new loss function and a training strategy that are tailored to the proposed network and metric learning. We evaluated the proposed approach on multiple datasets of colorectal and gastric cancers. For the colorectal cancer, two different datasets were employed that were collected from different acquisition settings. the proposed method achieved an accuracy, F1-score, quadratic weighted kappa of 88.7%, 0.849, and 0.946 for the first dataset and 83.3%, 0.764, and 0.907 for the second dataset, respectively. For the gastric cancer, the proposed method obtained an accuracy of 85.9%, F1-score of 0.793, and quadratic weighted kappa of 0.939. We also found that the proposed method outperforms other competing models and is computationally efficient. The experimental results demonstrate that the prediction results by the proposed network are both accurate and reliable. The proposed network not only outperformed other related methods in cancer classification but also achieved superior computational efficiency during training and inference. The future study will entail further development of the proposed method and the application of the method to other problems and domains.
A Novel AGV Path Planning Approach for Narrow Channels Based on the Bi-RRT Algorithm with a Failure Rate Threshold

The efficiency of the rapidly exploring random tree (RRT) falls short when efficiently guiding targets through constricted-passage environments, presenting issues such as sluggish convergence speed and elevated path costs. To overcome these algorithmic limitations, we propose a narrow-channel path-finding algorithm (named NCB-RRT) based on Bi-RRT with the addition of our proposed research failure rate threshold (RFRT) concept. Firstly, a three-stage search strategy is employed to generate sampling points guided by real-time sampling failure rates. By means of the balance strategy, two randomly growing trees are established to perform searching, which improves the success rate of the algorithm in narrow channel environments, accelerating the convergence speed and reducing the number of iterations required. Secondly, the parent node re-selection and path pruning strategy are integrated. This shortens the path length and greatly reduces the number of redundant nodes and inflection points. Finally, the path is optimized by utilizing segmented quadratic Bezier curves to achieve a smooth trajectory. This research shows that the NCB-RRT algorithm is better able to adapt to the complex narrow channel environment, and the performance is also greatly improved in terms of the path length and the number of inflection points. Compared with the RRT, RRT* and Bi-RRT algorithms, the success rate is increased by 2400%, 1900% and 11.11%, respectively.
Masked Autoencoders in 3D Point Cloud Representation Learning

Transformer-based Self-supervised Representation Learning methods learn generic features from unlabeled datasets for providing useful network initialization parameters for downstream tasks. Recently, methods based upon masking Autoencoders have been explored in the fields. The input can be intuitively masked due to regular content, like sequence words and 2D pixels. However, the extension to 3D point cloud is challenging due to irregularity. In this paper, we propose masked Autoencoders in 3D point cloud representation learning (abbreviated as MAE3D), a novel autoencoding paradigm for self-supervised learning. We first split the input point cloud into patches and mask a portion of them, then use our Patch Embedding Module to extract the features of unmasked patches. Secondly, we employ patch-wise MAE3D Transformers to learn both local features of point cloud patches and high-level contextual relationships between patches, then complete the latent representations of masked patches. We use our Point Cloud Reconstruction Module with multi-task loss to complete the incomplete point cloud as a result. We conduct self-supervised pre-training on ShapeNet55 with the point cloud completion pre-text task and fine-tune the pre-trained model on ModelNet40 and ScanObjectNN (PB_T50_RS, the hardest variant). Comprehensive experiments demonstrate that the local features extracted by our MAE3D from point cloud patches are beneficial for downstream classification tasks, soundly outperforming state-of-the-art methods (93.4% and 86.2% classification accuracy, respectively). <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Our source codes are available at: <uri>https://github.com/Jinec98/MAE3D</uri>.</i>
Effect of Measurement Backaction on Quantum Clock Precision Studied with a Superconducting Circuit

We theoretically and experimentally study the precision of a quantum clock near zero temperature, explicitly accounting for the effect of continuous measurement. The clock is created by a superconducting transmon qubit dispersively coupled to an open coplanar resonator. The cavity and qubit are driven by coherent fields, and the cavity output is monitored with a quantum-noise-limited amplifier. When the continuous measurement is weak, it induces persistent coherent oscillations (with fluctuating periods) in the conditional moments of the qubit's energy probability distribution, which are manifest in the output of the resonator. On the other hand, strong continuous measurement leads to an incoherent cycle of quantum jumps. We theoretically find an equality for the precision of the clock in each regime. Independently from the equalities, we derive a kinetic uncertainty relation for the precision, and find that both equalities satisfy this uncertainty relation. Finally, we experimentally verify that our quantum clock obeys the kinetic uncertainty relation for the precision, thus making an explicit link between the (kinetic) thermodynamic behavior of the clock and its precision, and achieving an experimental test of a kinetic uncertainty relation in the quantum domain.
Approximate Boltzmann distributions in quantum approximate optimization

Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with $n=14--23$ qubits and depth parameter $p\ensuremath{\le}12$, and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. We describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term $T\ensuremath{\sim}{C}_{\mathrm{min}}/n\sqrt{p}$, with ${C}_{\mathrm{min}}$ the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.
A deep CNN architecture with novel pooling layer applied to two Sudanese Arabic sentiment data sets

Arabic sentiment analysis has become an important research field in recent years. Initially, work focused on Modern Standard Arabic (MSA), which is the most widely used form. Since then, work has been carried out on several different dialects, including Egyptian, Levantine and Moroccan. Moreover, a number of data sets have been created to support such work. However, up until now, no work has been carried out on Sudanese Arabic, a dialect which has 32 million speakers. In this article, two new public data sets are introduced, the two-class Sudanese Sentiment Data set (SudSenti2) and the three-class Sudanese Sentiment Data set (SudSenti3). In the preparation phase, we establish a Sudanese stopword list. Furthermore, a convolutional neural network (CNN) architecture, Sentiment Convolutional MMA (SCM), is proposed, comprising five CNN layers together with a novel Mean Max Average (MMA) pooling layer, to extract the best features. This SCM model is applied to SudSenti2 and SudSenti3 and shown to be superior to the baseline models, with accuracies of 92.25% and 85.23% (Experiments 1 and 2). The performance of MMA is compared with Max, Avg and Min and shown to be better on SudSenti2, the Saudi Sentiment Data set and the MSA Hotel Arabic Review Data set by 1.00%, 0.83% and 0.74%, respectively (Experiment 3). Next, we conduct an ablation study to determine the contribution to performance of text normalisation and the Sudanese stopword list (Experiment 4). For normalisation, this makes a difference of 0.43% on two-class and 0.45% on three-class. For the custom stoplist, the differences are 0.82% and 0.72%, respectively. Finally, the model is compared with other deep learning classifiers, including transformer-based language models for Arabic, and shown to be comparable for SudSenti2 (Experiment 5).
Self-Supervised 3D Behavior Representation Learning Based on Homotopic Hyperbolic Embedding

Behavior sequences are generated by a series of spatio-temporal interactions and have a high-dimensional nonlinear manifold structure. Therefore, it is difficult to learn 3D behavior representations without relying on supervised signals. To this end, self-supervised learning methods can be used to explore the rich information contained in the data itself. Context-context contrastive self-supervised methods construct the manifold embedded in Euclidean space by learning the distance relationship between data, and find the geometric distribution of data. However, traditional Euclidean space is difficult to express context joint features. In order to obtain an effective global representation from the relationship between data under unlabeled conditions, this paper adopts contrastive learning to compare global feature, and proposes a self-supervised learning method based on hyperbolic embedding to mine the nonlinear relationship of behavior trajectories. This method adopts the framework of discarding negative samples, which overcomes the shortcomings of the paradigm based on positive and negative samples that pull similar data away in the feature space. Meanwhile, the output of the network is embedded in a hyperbolic space, and a multi-layer perceptron is added to convert the entire module into a homotopic mapping by using the geometric properties of operations in the hyperbolic space, so as to obtain homotopy invariant knowledge. The proposed method combines the geometric properties of hyperbolic manifolds and the equivariance of homotopy groups to promote better supervised signals for the network, which improves the performance of unsupervised learning.
AI in Auditing: A Comprehensive Review of Applications, Benefits and Challenges

The rapid evolution of artificial intelligence (AI) technologies has brought about transformative changes in various industries, and the field of auditing is no exception. This research paper presents a comprehensive review of the integration of AI in auditing practices, highlighting its applications, benefits, and associated challenges. Auditing, a critical process for ensuring the accuracy and reliability of financial information, has traditionally been a labor-intensive and time-consuming endeavor. The emergence of AI technologies, such as machine learning, natural language processing, and data analytics, has revolutionized the way audits are conducted. AI-powered auditing tools offer advanced capabilities for data analysis, pattern recognition, anomaly detection, and risk assessment. These capabilities enhance the effectiveness and efficiency of audits by allowing auditors to focus on high-risk areas and perform more in-depth analysis. The paper explores various applications of AI in auditing, including: Automated Data Analysis, Predictive Analytics, Fraud Detection, and Natural Language Processing (NLP), Continuous Monitoring. While AI brings significant benefits to the auditing process, its adoption also presents certain challenges like Data Quality and Integration, Interpretability, Ethical Considerations, Technical Expertise, Regulatory Frame Work. In conclusion, AI has the potential to revolutionize auditing practices by enhancing efficiency, accuracy, and risk assessment. However, successful integration requires addressing challenges related to data quality, transparency, ethics, skills, and regulations. As AI technologies continue to evolve, auditors and stakeholders must collaborate to harness the full potential of AI while maintaining the integrity and credibility of the auditing process. This paper serves as a comprehensive resource for auditors, researchers, and policymakers seeking to understand the current landscape and future directions of AI in auditing.
Advancement in Bangla Sentiment Analysis: A Comparative Study of Transformer-Based and Transfer Learning Models for E-commerce Sentiment Classification

Background: As a direct result of the Internet's expansion, the quantity of information shared by Internet users across its numerous platforms has increased. Sentiment analysis functions at a higher level when there are more available perspectives and opinions. However, the lack of labeled data significantly complicates sentiment analysis utilizing Bangla natural language processing (NLP). In recent years, nevertheless, due to the development of more effective deep learning models, Bangla sentiment analysis has improved significantly. Objective: This article presents a curated dataset for Bangla e-commerce sentiment analysis obtained solely from the "Daraz" platform. We aim to conduct sentiment analysis in Bangla for binary and understudied multiclass classification tasks. Methods: Transfer learning (LSTM, GRU) and Transformers (Bangla-BERT) approaches are compared for their effectiveness on our dataset. To enhance the overall performance of the models, we fine-tuned them. Results: The accuracy of Bangla-BERT was highest for both binary and multiclass sentiment classification tasks, with 94.5% accuracy for binary classification and 88.78% accuracy for multiclass sentiment classification. Conclusion: Our proposed method performs noticeably better classifying multiclass sentiments in Bangla than previous deep learning techniques. Keywords: Bangla-BERT, Deep Learning, E-commerce, NLP, Sentiment Analysis
Artificial Intelligence-Based Face Transformation in Patient Seizure Videos for Privacy Protection

<h2>Abstract</h2><h3>Objective</h3> To investigate the feasibility and accuracy of artificial intelligence (AI) methods of facial deidentification in hospital-recorded epileptic seizure videos, for improved patient privacy protection while preserving clinically important features of seizure semiology. <h3>Patients and Methods</h3> Videos of epileptic seizures displaying seizure-related involuntary facial changes were selected from recordings at Taipei Veterans General Hospital Epilepsy Unit (between August 1, 2020 and February 28, 2023), and a single representative video frame was prepared per seizure. We tested 3 AI transformation models: (1) morphing the original facial image with a different male face; (2) substitution with a female face; and (3) cartoonization. Facial deidentification and preservation of clinically relevant facial detail were calculated based on: (1) scoring by 5 independent expert clinicians and (2) objective computation. <h3>Results</h3> According to the clinician scoring of 26 facial frames in 16 patients, the best compromise between deidentification and preservation of facial semiology was the cartoonization model. A male facial morphing model was superior to the cartoonization model for deidentification, but clinical detail was sacrificed. Objective similarity testing of video data reported deidentification scores in agreement with the clinicians' scores; however, preservation of semiology gave mixed results likely due to inadequate existing comparative databases. <h3>Conclusion</h3> Artificial intelligence-based face transformation of medical seizure videos is feasible and may be useful for patient privacy protection. In our study, the cartoonization approach provided the best compromise between deidentification and preservation of seizure semiology.
Fast Attack Detection for Cyber–Physical Systems Using Dynamic Data Encryption

To defend the cyber–physical system (CPSs) from cyber-attacks, this work proposes an unified intrusion detection mechanism which is capable to fast hunt various types of attacks. Focusing on securing the data transmission, a novel dynamic data encryption scheme is developed and historical system data is used to dynamically update a secret key involved in the encryption. The core idea of the dynamic data encryption scheme is to establish a dynamic relationship between original data, secret key, ciphertext and its decrypted value, and in particular, this dynamic relationship will be destroyed once an attack occurs, which can be used to detect attacks. Then, based on dynamic data encryption, a unified fast attack detection method is proposed to detect different attacks, including replay, false data injection (FDI), zero-dynamics, and setpoint attacks. Extensive comparison studies are conducted by using the power system and flight control system. It is verified that the proposed method can immediately trigger the alarm as soon as attacks are launched while the conventional <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\chi^{2}$</tex-math> </inline-formula> detection could only capture the attacks after the estimation residual goes over the predetermined threshold. Furthermore, the proposed method does not degrade the system performance. Last but not the least, the proposed dynamic encryption scheme turns to normal operation mode as the attacks stop.
MLcps: machine learning cumulative performance score for classification problems

Assessing the performance of machine learning (ML) models requires careful consideration of the evaluation metrics used. It is often necessary to utilize multiple metrics to gain a comprehensive understanding of a trained model's performance, as each metric focuses on a specific aspect. However, comparing the scores of these individual metrics for each model to determine the best-performing model can be time-consuming and susceptible to subjective user preferences, potentially introducing bias.We propose the Machine Learning Cumulative Performance Score (MLcps), a novel evaluation metric for classification problems. MLcps integrates several precomputed evaluation metrics into a unified score, enabling a comprehensive assessment of the trained model's strengths and weaknesses. We tested MLcps on 4 publicly available datasets, and the results demonstrate that MLcps provides a holistic evaluation of the model's robustness, ensuring a thorough understanding of its overall performance.By utilizing MLcps, researchers and practitioners no longer need to individually examine and compare multiple metrics to identify the best-performing models. Instead, they can rely on a single MLcps value to assess the overall performance of their ML models. This streamlined evaluation process saves valuable time and effort, enhancing the efficiency of model evaluation. MLcps is available as a Python package at https://pypi.org/project/MLcps/.
Cross-Modal Learning with 3D Deformable Attention for Action Recognition

An important challenge in vision-based action recognition is the embedding of spatiotemporal features with two or more heterogeneous modalities into a single feature. In this study, we propose a new 3D deformable transformer for action recognition with adaptive spatiotemporal receptive fields and a cross-modal learning scheme. The 3D deformable transformer consists of three attention modules: 3D deformability, local joint stride, and temporal stride attention. The two cross-modal tokens are input into the 3D deformable attention module to create a cross-attention token with a reflected spatiotemporal correlation. Local joint stride attention is applied to spatially combine attention and pose tokens. Temporal stride attention temporally reduces the number of input tokens in the attention module and supports temporal expression learning without the simultaneous use of all tokens. The deformable transformer iterates L-times and combines the last cross-modal token for classification. The proposed 3D deformable transformer was tested on the NTU60, NTU120, FineGYM, and PennAction datasets, and showed results better than or similar to pre-trained state-of-the-art methods even without a pre-training process. In addition, by visualizing important joints and correlations during action recognition through spatial joint and temporal stride attention, the possibility of achieving an explainable potential for action recognition is presented.