With the rise of Web 2.0 and microservices, the increasing availability of Web APIs has intensified the need for effective recommendation systems. Existing approaches are generally categorized into two methods: recommendation-type methods, which classify APIs using labels, and match-type methods, which retrieve APIs through matching with mashups. However, three significant challenges remain: 1) semantic ambiguities in comparing API and mashup descriptions, 2) a lack of progressive semantic refinement between mashup requirements and individual API descriptions, and 3) computational inefficiency of exhaustive mashup-API comparisons in large-scale repositories. To tackle these challenges, we propose WARBERT, a hierarchical model based on BERT for Web API recommendation. WARBERT utilizes dual-component feature fusion and attention mechanisms to create accurate semantic representations. It consists of WARBERT(R) for initial candidate filtering using recommendation methods, and WARBERT(M), which focuses on refined similarity matching. The final likelihood of an API-mashup pairing combines predictions from both components, with WARBERT(R) further enhanced by an auxiliary task of predicting mashup categories. Experiments conducted on the ProgrammableWeb dataset demonstrate WARBERT outperforms existing baselines, achieving notable improvements in both accuracy and efficiency.

Wearable electroencephalogram (EEG) devices have shown great potential in enabling real-time monitoring of subtle changes in brain activity, providing new possibilities for the assessment and management of chronic pain. However, recognizing pain-related biomarkers from EEG data remains a complex, multitask challenge. Most existing research focuses on single-task approaches and rarely addresses this issue within a unified framework. In this article, we propose a novel deep neural network (DNN) model called multiscale frequency domain MetaFormer (MFDFormer), which is designed to simultaneously predict the presence, type, and intensity of chronic pain. The proposed MFDFormer comprises two primary subnetworks: 1) multiscale feature extractor (MFE) and 2) frequency domain MetaFormer (FDFormer) encoder. The MFE extracts diverse EEG features through convolutions with different kernel sizes, while a self-attention mechanism is integrated into MFE to emphasize the importance of interdependency among these features. The FDFormer encoder refines the output MFE features using causal convolutions to capture local patterns and projects them into a higher dimensional representation domain. Additionally, it incorporates spatial and temporal frequency domain learners (TFDLs) in parallel to effectively capture the spatial-temporal information of EEG data. Based on the publicly available brain function in chronic pain (BFCP) dataset, the proposed MFDFormer demonstrates superior performance over state-of-the-art algorithms, achieving accuracies of 97.59%, 96.02%, and 83.48% in pain or nonpain state classification (P/NSC), pain type classification (PTC), and pain intensity classification (PIC) tasks, respectively. This article proposes a unified, end-to-end DNN-based framework for multitask chronic pain recognition, providing a reliable solution with the potential to advance pain diagnosis and management in IoT and smart wearable applications.

Entity Resolution (ER) links entities that refer to the same real-world entity from different sources. Existing work usually takes pairs of entities as input and judges those pairs independently. However, there is often interdependence between different pairs of ER decisions, e.g., the entities from the same data source are usually semantically related to each other. Furthermore, current ER approaches are mainly based on attribute similarity comparison, but ignore interdependence between attributes. To address the limits of existing methods, we propose HierGAT, a new method for ER based on a Hierarchical Graph Attention Transformer Network, which can model and exploit the interdependence between different ER decisions. The benefit of our method comes from: 1) The graph attention network model for joint ER decisions; 2) The graph-attention capability to identify the discriminative words from attributes and find the most discriminative attributes. Furthermore, we propose to learn contextual embeddings to enrich word embeddings for better performance. The experimental results on publicly available benchmark datasets show that HierGAT outperforms DeepMatcher by up to 32.5% of F1 score and up to 8.7% of F1 score compared with Ditto.

The uniform representation of 2-dimensional arrays serially in Morton order (or {\eee} order) supports both their iterative scan with cartesian indices and their divide-and-conquer manipulation as quaternary trees. This data structure is important because it relaxes serious problems of locality and latency, and the tree helps to schedule multi-processing. Results here show how it facilitates algorithms that avoid cache misses and page faults at all levels in hierarchical memory, independently of a specific runtime environment.