Reviewerly/exHarmony huggingface dataset:
Function-words Adaptively Enhanced Attention Networks for Few-Shot Inverse Relation Classification

The relation classification is to identify semantic relations between two entities in a given text. While existing models perform well for classifying inverse relations with large datasets, their performance is significantly reduced for few-shot learning. In this paper, we propose a function words adaptively enhanced attention framework (FAEA) for few-shot inverse relation classification, in which a hybrid attention model is designed to attend class-related function words based on meta-learning. As the involvement of function words brings in significant intra-class redundancy, an adaptive message passing mechanism is introduced to capture and transfer inter-class differences.We mathematically analyze the negative impact of function words from dot-product measurement, which explains why the message passing mechanism effectively reduces the impact. Our experimental results show that FAEA outperforms strong baselines, especially the inverse relation accuracy is improved by 14.33% under 1-shot setting in FewRel1.0.
Evaluation of physician performance using a concurrent-read artificial intelligence system to support breast ultrasound interpretation

The purpose of this study was to compare the diagnostic performance and the interpretation time of breast ultrasound examination between reading without and with the artificial intelligence (AI) system as a concurrent reading aid.A fully crossed multi-reader and multi-case (MRMC) reader study was conducted. Sixteen participating physicians were recruited and retrospectively interpreted 172 breast ultrasound cases in two reading scenarios, once without and once with the AI system (BU-CAD™, TaiHao Medical Inc.) assistance for concurrent reading. Interpretations of any given case set with and without the AI system were separated by at least 5 weeks. These reading results were compared to the reference standard and the area under the LROC curve (AUCLROC), sensitivity, specificity, positive predictive value (PPV), and negative predictive value (NPV) were calculated for performance evaluations. The interpretation time was also compared between the unaided and aided scenarios.With the help of the AI system, the readers had higher diagnostic performance with an increase in the average AUCLROC from 0.7582 to 0.8294 with statistically significant. The sensitivity, specificity, PPV, and NPV were also improved from 95.77%, 24.07%, 44.18%, and 93.50%-98.17%, 30.67%, 46.91%, and 96.10%, respectively. Of these, the improvement in specificity reached statistical significance. The average interpretation time was significantly reduced by approximately 40% when the readers were assisted by the AI system.The concurrent-read AI system improves the diagnostic performance in detecting and diagnosing breast lesions on breast ultrasound images. In addition, the interpretation time is effectively reduced for the interpreting physicians.
A Trust-Based Hierarchical Consensus Mechanism for Consortium Blockchain in Smart Grid

As the smart grid develops rapidly, abundant connected devices offer various trading data. This raises higher requirements for secure and effective data storage. Traditional centralized data management does not meet the above requirements. Currently, smart grid with conventional consortium blockchain can solve the above issues. However, in the face of a large number of nodes, existing consensus algorithms often perform poorly in terms of efficiency and throughput. In this paper, we propose a trust-based hierarchical consensus mechanism (THCM) to solve this problem. Firstly, we design a hierarchical mechanism to improve the efficiency and throughput. Then, intra-layer nodes use an improved Raft consensus algorithm and inter-layer nodes use the Byzantine Fault Tolerance algorithm. Thirdly, we propose a trust evaluation method to improve the election process of Raft. Finally, we implement a prototype system to evaluate the performance of THCM. The results demonstrate that the consensus efficiency is improved by 19.8%, the throughput is improved by 12.34%, and the storage is reduced by 37.9%.
Achieving fuzzy matching data sharing for secure cloud-edge communication

In this paper, we propose a novel fuzzy matching data sharing scheme named FADS for cloud-edge communications. FADS allows users to specify their access policies, and enables receivers to obtain the data transmitted by the senders if and only if the two sides meet their defined certain policies simultaneously. Specifically, we first formalize the definition and security models of fuzzy matching data sharing in cloud-edge environments. Then, we construct a concrete instantiation by pairing-based cryptosystem and the privacy-preserving set intersection on attribute sets from both sides to construct a concurrent matching over the policies. If the matching succeeds, the data can be decrypted. Otherwise, nothing will be revealed. In addition, FADS allows users to dynamically specify the policy for each time, which is an urgent demand in practice. A thorough security analysis demonstrates that FADS is of provable security under indistinguishable chosen ciphertext attack (IND-CCA) in random oracle model against probabilistic polynomial-time (PPT) adversary, and the desirable security properties of privacy and authenticity are achieved. Extensive experiments provide evidence that FADS is with acceptable efficiency.
Impact of scanner variability on lymph node segmentation in computational pathology

Computer-aided diagnostics in histopathology are based on the digitization of glass slides. However, heterogeneity between the images generated by different slide scanners can unfavorably affect the performance of computational algorithms. Here, we evaluate the impact of scanner variability on lymph node segmentation due to its clinical importance in colorectal cancer diagnosis. 100 slides containing 276 lymph nodes were digitized using 4 different slide scanners, and 50 of the lymph nodes containing metastatic cancer cells. These 400 scans were subsequently annotated by 2 experienced pathologists to precisely label lymph node boundary. Three different segmentation methods were then applied and compared: Hematoxylin-channel-based thresholding (HCT), Hematoxylin-based active contours (HAC), and a convolution neural network (U-Net). Evaluation of U-Net trained from both a single scanner and an ensemble of all scanners was completed. Mosaic images based on representative tiles from a scanner were used as a reference image to normalize the new data from different test scanners to evaluate the performance of a pre-trained model. Fine-tuning was carried out by using weights of a model trained on one scanner to initialize model weights for other scanners. To evaluate the domain generalization, domain adversarial learning and stain mix-up augmentation were also implemented. Results show that fine-tuning and domain adversarial learning decreased the impact of scanner variability and greatly improved segmentation across scanners. Overall, U-Net with stain mix-up (Matthews correlation coefficient (MCC) = 0.87), domain adversarial learning (MCC = 0.86), and HAC (MCC = 0.87) were shown to outperform HCT (MCC = 0.81) for segmentation of lymph nodes when compared against the ground truth. The findings of this study should be considered for future algorithms applied in diagnostic routines.
SARPointNet: An Automated Feature Learning Framework for Spaceborne SAR Image Registration

Accurate registration between SAR images is the basis for high-precision geometric correction of SAR images. The feature points extracted by conventional feature extraction methods is unsatisfactory, which is affected by imaging geometric characteristics and speckle noise of SAR images. This paper innovatively proposes a spaceborne SAR image feature learning framework to realize automatic sample generation and model training. It mainly includes two modules: The feature sample generation module based on the initial geometric information of spaceborne SAR. The initial RPC parameters of the spaceborne SAR are adopted to realize the initial positioning of SAR image, and a variety of feature extraction operators are used to match the overlapping areas to obtain high-precision matching points, which are employed as training samples for image-pairs; Pseudo-Siamese feature learning network SARPointNet for SAR image feature learning. The pseudo-siamese network is used to extract the feature points and descriptors of the sample image-pairs. The feature optimization process is realized through the descriptor constraints between image pairs, which promotes the network to improve the accuracy of feature extraction. The proposed method has been tested in mountain, hilly, flatland and urban scenarios, respectively. The results demonstrate that the correspondence points extracted by SARPointNet are evenly distributed, large quantities (at least 10 times that of other methods) and achieve high precision (The root mean square error is less than 1 pixels), which shows great advantages over other methods.
Integrating Python into an Undergraduate Mathematics for Chemists Course

Many upper-level undergraduate chemistry courses, particularly quantum chemistry, thermodynamics, kinetics, and statistical mechanics, benefit from mathematical concepts beyond standard calculus, including differential equations, linear algebra, probability, statistics, operators, complex numbers, multivariate integrals, and partial derivatives. Moreover, while mathematics courses often focus on abstract problems, physical sciences, and particularly physical chemistry, offer concrete applications often with complicated functions. A one-semester course in “Mathematics for Chemists” offers a tailored syllabus specifically to address common challenges in physical and analytical courses. By including basic Python programming, students can focus on core concepts, rather than worry about common calculation or mathematical mistakes. The course includes an introduction to core Python concepts, including numpy, scipy, matplotlib, and sympy. All Jupyter notebooks and course materials are available under a Creative Commons license from https://github.com/ghutchis/chem1000.
Progressive Motion Coherence for Remote Sensing Image Matching

In this article, we present a feature-based remote sensing (RS) image matching method termed progressive motion coherence (PMC). We formulate the matching problem into a mathematical model and derive a closed-form solution. The objective function is only based on two novel coherence constraints, namely, efficient neighborhood element coherence and relative order-aware motion coherence, and hence, it is general enough and can be applied to RS image matching with different image types and degradations. The efficient neighborhood element coherence uses the Jaccard distance to measure the dissimilarity of two neighborhoods, which are lists composed of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> nearest neighbors of feature points. To prevent overpenalization on the outliers, we combine it with an exponential function, which is simple yet efficient. The relative order-aware motion coherence is an alternative to motion smoothness, which is based on the observation that the relative order of neighboring matches for inliers in a small region can be well preserved, while for outliers, the relative order changes greatly. The above two coherences are robust to large rotation changes and low ratio inliers. Extensive experiments on five RS image datasets compared with seven state of the arts demonstrate that our PMC is more efficient and robust than the competitors.
Robust mobile robot navigation in cluttered environments based on hybrid adaptive neuro-fuzzy inference and sensor fusion

Collision-free navigation of mobile robots is a challenging task, especially in unknown environments, and various studies have been carried out in this regard. However, the previous studies have shortcomings, such as low performance in cluttered and unknown environments, high computational costs, and multiple controller models for navigation. This paper proposes an adaptive neuro-fuzzy inference system (ANFIS) and global positioning system (GPS) for control and navigation to overcome these problems. The proposed method automates the navigation of a mobile robot while averting obstacles in unknown and densely cluttered environments. Furthermore, the mobile robots’ global path planning and steering are controlled using GPS and heading sensor data fusion to achieve the target coordinates. A fuzzy inference system (FIS) is adopted to model obstacle avoidance where distance sensors data is converted into fuzzy linguistics. Moreover, a type-1 Takagi–Sugeno FIS is used to train a five-layered neural network for the local planning of the robot, and ANFIS parameters are tuned using a hybrid learning method. In addition, an algorithm is designed to generate a dataset for testing and training the ANFIS controller. All the testing and training are conducted in MATLAB, while simulations are carried out using CoppeliaSim. Comprehensive experiments are performed to validate the robustness of the proposed method. The results of the experiments show that the proposed approach outperforms various state-of-the-art neuro-fuzzy, CS-ANFIS, multi-ANFIS, and hybrid ANFIS navigation and obstacle avoidance methods in finding a near-optimal path in unknown environments.
DisCo

Current co-speech gestures synthesis methods struggle with generating diverse motions and typically collapse to single or few frequent motion sequences, which are trained on original data distribution with customized models and strategies. We tackle this problem by temporally clustering motion sequences into content and rhythm segments and then training on content-balanced data distribution. In particular, by clustering motion sequences, we have observed for each rhythm pattern, some motions appear frequently, while others appear less. This imbalance results in the difficulty of generating low frequent occurrence motions and it cannot be easily solved by resampling, due to the inherent many-to-many mapping between content and rhythm. Therefore, we present DisCo, which disentangles motion into implicit content and rhythm features by contrastive loss for adopting different data balance strategies. Besides, to model the inherent mapping between content and rhythm features, we design a diversity-and-inclusion network (DIN), which firstly generates content features candidates and then selects one candidate by learned voting. Experiments on two public datasets, Trinity and S2G-Ellen, justify that DisCo generates more realistic and diverse motions than state-of-the-art methods. Code and data are available at https://pantomatrix.github.io/DisCo/
TextBlock

Scene text spotting systems which integrate text detection and recognition modules have witnessed a lot of success in recent years. Existing works mostly follow the framework of word/character-level fine-grained detection and isolated-instance recognition, which overemphasize the role of detector and ignore the rich context information in recognition. After rethinking the conventional framework, and inspired by the glimpse-focus spotting pipeline of human beings, we ask:1) "can machine spot text without accurate detection just like human beings?", and if yes, 2) "is text block another alternative for scene text spotting other than word or character?". Based on these questions, we propose a new perspective of coarse-grained detection with multi-instance recognition for text spotting. Specifically, a pioneering network termed TextBlock is developed, and a heuristic text block generation method as well as a multi-instance block-level recognition module are proposed. In this way, the burden of detection is relieved, and the contextual semantic information is well explored for recognition. To train the block-level recognizer, a synthetic dataset including about 800K images is formed. As a by-product of attention, fine-grained detection can be recovered with the recognizer. Equipped with a detector without many bells and whistles (e.g., Faster R-CNN), TextBlock achieves competitive or even better performance compared with previous sophisticated text spotters on several public benchmarks. As a primary attempt, we expect this framework will have a potential impact on scene text spotting research in the future.
Coherence requirements for quantum communication from hybrid circuit dynamics

The coherent superposition of quantum states is an important resource for quantum information processing which distinguishes quantum dynamics and information from their classical counterparts. In this article we determine the coherence requirements to communicate quantum information in a broad setting encompassing monitored quantum dynamics and quantum error correction codes. We determine these requirements by considering hybrid circuits that are generated by a quantum information game played between two opponents, Alice and Eve, who compete by applying unitaries and measurements on a fixed number of qubits. Alice applies unitaries in an attempt to maintain quantum channel capacity, while Eve applies measurements in an attempt to destroy it. By limiting the coherence generating or destroying operations available to each opponent, we determine Alice’s coherence requirements. When Alice plays a random strategy aimed at mimicking generic monitored quantum dynamics, we discover a coherence-tuned phase transitions in entanglement and quantum channel capacity. We then derive a theorem giving the minimum coherence required by Alice in any successful strategy, and conclude by proving that coherence sets an upper bound on the code distance in any stabelizer quantum error correction code. Such bounds provide a rigorous quantification of the coherence resource requirements for quantum communication and error correction.
Is neuro-symbolic AI meeting its promises in natural language processing? A structured review

Advocates for Neuro-Symbolic Artificial Intelligence (NeSy) assert that combining deep learning with symbolic reasoning will lead to stronger AI than either paradigm on its own. As successful as deep learning has been, it is generally accepted that even our best deep learning systems are not very good at abstract reasoning. And since reasoning is inextricably linked to language, it makes intuitive sense that Natural Language Processing (NLP), would be a particularly well-suited candidate for NeSy. We conduct a structured review of studies implementing NeSy for NLP, with the aim of answering the question of whether NeSy is indeed meeting its promises: reasoning, out-of-distribution generalization, interpretability, learning and reasoning from small data, and transferability to new domains. We examine the impact of knowledge representation, such as rules and semantic networks, language structure and relational structure, and whether implicit or explicit reasoning contributes to higher promise scores. We find that systems where logic is compiled into the neural network lead to the most NeSy goals being satisfied, while other factors such as knowledge representation, or type of neural architecture do not exhibit a clear correlation with goals being met. We find many discrepancies in how reasoning is defined, specifically in relation to human level reasoning, which impact decisions about model architectures and drive conclusions which are not always consistent across studies. Hence we advocate for a more methodical approach to the application of theories of human reasoning as well as the development of appropriate benchmarks, which we hope can lead to a better understanding of progress in the field. We make our data and code available on github for further analysis.
Multimodel Phishing URL Detection Using LSTM, Bidirectional LSTM, and GRU Models

In today’s world, phishing attacks are gradually increasing, resulting in individuals losing valuables, assets, personal information, etc., to unauthorized parties. In phishing, attackers craft malicious websites disguised as well-known, legitimate sites and send them to individuals to steal personal information and other related private details. Therefore, an efficient and accurate method is required to determine whether a website is malicious. Numerous methods have been proposed for detecting malicious uniform resource locators (URLs) using deep learning, machine learning, and other approaches. In this study, we have used malicious and benign URLs datasets and have proposed a detection mechanism for detecting malicious URLs using recurrent neural network models such as long short-term memory (LSTM), bidirectional long short-term memory (Bi-LSTM), and the gated recurrent unit (GRU). Experimental results have shown that the proposed mechanism achieved an accuracy of 97.0% for LSTM, 99.0% for Bi-LSTM, and 97.5% for GRU, respectively.
On the Use of eXplainable Artificial Intelligence to Evaluate School Dropout

The school dropout problem has been recurrent in different educational areas, which has reinforced important challenges when pursuing education objectives. In this scenario, technical schools have also suffered from considerable dropout levels, even when considering a still increasing need for professionals in areas associated to computing and engineering. Actually, the dropout phenomenon may be not uniform and thus it has become urgent the identification of the profile of those students, putting in evidence techniques such as eXplainable Artificial Intelligence (XAI) that can ensure more ethical, transparent, and auditable use of educational data. Therefore, this article applies and evaluates XAI methods to predict students in school dropout situation, considering a database of students from the Federal Institute of Rio Grande do Norte (IFRN), a Brazilian technical school. For that, a checklist was created comprising explanatory evaluation metrics according to a broad literature review, resulting in the proposal of a new explainability index to evaluate XAI frameworks. Doing so, we expect to support the adoption of XAI models to better understand school-related data, supporting important research efforts in this area.