Search

Access to accurate force-field parameters for small molecules is crucial for computational studies of their interactions with proteins. Although a number of general force fields for small molecules exist, e.g., CGenFF, GAFF, and OPLS, they do not cover all common chemical groups and their combinations. The Force Field Toolkit (ffTK) provides a comprehensive graphical interface that streamlines the development of classical parameters for small molecules directly from quantum mechanical (QM) calculations, allowing for force-field generation for almost any chemical group and validation of the fit relative to the target data. ffTK relies on supported external software for the QM calculations, but it can generate the necessary QM input files and parse and analyze the QM output. In previous ffTK versions, support for Gaussian and ORCA QM packages was implemented. Here, we add support for Psi4, an open-source QM package free for all users, thereby broadening user access to ffTK. We also compare the parameter sets obtained with the new ffTK version using Gaussian, ORCA, and Psi4 for three molecules: pyrrolidine, n-propylammonium cation, and chlorobenzene. Despite minor differences between the resulting parameter sets for each compound, most prominently in the dihedral and improper terms, we show that conformational distributions sampled in molecular dynamics simulations using these parameter sets are quite comparable. [ABSTRACT FROM AUTHOR]

This document introduces a special issue of the journal "Scalable Computing: Practice & Experience" focused on next-generation pervasive reconfigurable computing for high-performance real-time applications. The authors discuss the importance of adaptable platforms for real-time tasks and highlight the benefits of reconfigurable computing in accelerating applications like image processing and machine learning. The special issue aims to explore recent advancements in this field and includes research papers on topics such as network security, malware detection, software reliability prediction, and optimization algorithms for wing design. The papers cover a range of computer science and technology topics, showcasing advancements and their potential impact on various computing domains. [Extracted from the article]

With the rapid development of computer vision and deep learning technology, person re-identification(ReID) has attracted widespread attention as an important research area. Most current ReID methods primarily focus on short-term re-identification. In the scenario of pedestrian clothing changes, traditional ReID methods face some challenges due to significant changes in pedestrian appearance. Therefore, this paper proposes a clothes-changing person re-identification(CC-ReID) method, namely SViT-ReID, based on a Vision Transformer and incorporating semantic information. This method integrates semantic segmentation maps to more accurately extract features and representations of pedestrian instances in complex scenes, enabling the model to learn some clues unrelated to clothing. Specifically, we extract clothing-unrelated features (such as the face, arms, legs, and feet) from pedestrian parsing tasks' obtained features. These features are then fused with global features to emphasize the importance of these body features. In addition, the complete semantic features derived from pedestrian parsing are fused with global features. These fused features undergo shuffle and grouping operations to generate local features, which are computed in parallel with global features, thereby enhancing the model's robustness and accuracy. Experimental evaluations on two real-world benchmarks show the proposed SViT-ReID achieves state-of-the-art performance. Extensive ablation studies and visualizations illustrate the effectiveness of our method. Our method achieves a Top-1 accuracy of 55.2% and 43.4% on the PRCC and LTCC datasets, respectively. [ABSTRACT FROM AUTHOR]

Log messages from enterprise-level software systems contain crucial runtime details. Engineers can convert log messages into structured data through log parsing, laying the foundation for downstream tasks such as log anomaly detection. Existing log parsing schemes usually underperform in production environments for several reasons: first, they often ignore the semantics of log messages; second, they are often not adapted to different systems, and their performance varies greatly; and finally, they are difficult to adapt to the complexity and variety of log formats in the real environment. In response to the limitations of current approaches, we introduce IPLog (Intelligent Parse Log), a parsing method designed to address these issues. IPLog samples a limited set of log samples based on the distribution of templates in the system's historical logs, and allows the model to make full use of the small number of log samples to recognize common patterns of keywords and parameters through few-shot learning, and thus can be easily adapted to different systems. In addition, IPLog can further improve the grouping accuracy of log templates through a novel manual feedback merge query strategy based on the longest common prefix, thus enhancing the model's adaptability to handle complex log formats in production environments. We conducted experiments on four newly released public log datasets, and the experimental results show that IPLog can achieve an average grouping accuracy (GA) of 0.987 and parsing accuracy (PA) of 0.914 on the four public datasets, which are the best among the mainstream parsing schemes. These results demonstrate that IPLog is effective for log parsing tasks. [ABSTRACT FROM AUTHOR]

Human parsing aims to partition humans in image or video into multiple pixel-level semantic parts. In the last decade, it has gained significantly increased interest in the computer vision community and has been utilized in a broad range of practical applications, from security monitoring, to social media, to visual special effects, just to name a few. Although deep learning-based human parsing solutions have made remarkable achievements, many important concepts, existing challenges, and potential research directions are still confusing. In this survey, we comprehensively review three core sub-tasks: single human parsing, multiple human parsing, and video human parsing, by introducing their respective task settings, background concepts, relevant problems and applications, representative literature, and datasets. We also present quantitative performance comparisons of the reviewed methods on benchmark datasets. Additionally, to promote sustainable development of the community, we put forward a transformer-based human parsing framework, providing a high-performance baseline for follow-up research through universal, concise, and extensible solutions. Finally, we point out a set of under-investigated open issues in this field and suggest new directions for future study. We also provide a regularly updated project page, to continuously track recent developments in this fast-advancing field: https://github.com/soeaver/awesome-human-parsing. [ABSTRACT FROM AUTHOR]

Logs play an important role in anomaly detection, fault diagnosis, and trace checking of software and network systems. Log parsing, which converts each raw log line to a constant template and a variable parameter list, is a prerequisite for system security analysis. Traditional parsing methods utilizing specific rules can only parse logs of specific formats, and most parsing methods based on deep learning require labels. However, the existing parsing methods are not applicable to logs of inconsistent formats and insufficient labels. To address these issues, we propose a robust Log parsing method based on Self-supervised Learning (LogSL), which can extract templates from logs of different formats. The essential idea of LogSL is modeling log parsing as a multi-token prediction task, which makes the multi-token prediction model learn the distribution of tokens belonging to the template in raw log lines by self-supervision mode. Furthermore, to accurately predict the tokens of the template without labeled data, we construct a Multi-token Prediction Model (MPM) combining the pre-trained XLNet module, the n-layer stacked Long Short-Term Memory Net module, and the Self-attention module. We validate LogSL on 12 benchmark log datasets, resulting in the average parsing accuracy of our parser being 3.9% higher than that of the best baseline method. Experimental results show that LogSL has superiority in terms of robustness and accuracy. In addition, a case study of anomaly detection is conducted to demonstrate the support of the proposed MPM to system security tasks based on logs. [ABSTRACT FROM AUTHOR]

Pretrained language models have achieved great success in various natural language understanding (NLU) tasks due to their capacity to capture deep contextualized information in text using pretraining on large-scale corpora. Tokenization plays a significant role in the process of lexical analysis. Tokens become the input for other natural language processing (NLP) tasks, like semantic parsing and language modeling. However, there is a lack of research on the evaluation of the impact of tokenization on the Arabic language model. Therefore, this study aims to address this gap in the literature by evaluating the performance of various tokenizers on Arabic large language models (LLMs). In this paper, we analyze the differences between WordPiece, SentencePiece, and BBPE tokenizers by pretraining three BERT models using each tokenizer while measuring the performance of each model on seven different NLP tasks using 29 different datasets. Overall, the model pretrained with text tokenized using the SentencePiece tokenizer significantly outperforms the other two models that utilize WordPiece and BBPE tokenizers. The results of this paper will assist researchers in developing better models, making better decisions in selecting the best tokenizers, improving feature engineering, and making models more efficient, thus ultimately leading to advancements in various NLP applications. [ABSTRACT FROM AUTHOR]

Context: Cross-project defect prediction (CPDP), due to the potential of adaption by industry in realistic scenarios, had gained significant attention from the research community. Currently, existing CPDP studies use static statistical features designed by experts, which might not capture the semantic and structural aspects of software, resulting in low accuracy in defect prediction. Meanwhile, they tend to overlook the valuable iterative information brought about by version updates in mature software projects. Objective: This paper introduces DETECTOR, a novel CPDP approach based on coDE semanTic and cross-vErsion struCTural infORmation to leverage cross-versions features of the software and improve the performance of CPDP. Methods: DETECTOR parses source code to exploit Abstract Syntax Trees (ASTs) and cross-version software network (Cross-SN) that consists of internal class dependency network and cross-version class dependency edges. It utilizes Attention-based Bi-LSTM and simplified graph convolutional neural networks to automatically extract software features from ASTs and Cross-SN. The extracted features are fused using gate(⋅) to generate more effective cross-version features. Finally the source project is selected to carry out the data used to train the classifier to predict the defects. Results: Empirical studies on seven open-source Java projects, the experiment results show that: (1) DETECTOR outperforms the state-of-the-art models in CPDP; (2) our proposed cross-version dependent edges positively contribute to DETECTOR performance; (3) gate(⋅) outperforms existing strategies in fusion features; (4) more multi-versions information enhance DETECTOR's performance. Conclusion: DETECTOR can predict more defects in CPDP and improve the accuracy and effectiveness of prediction. [ABSTRACT FROM AUTHOR]

A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages. If, in the process of folding, the order among edges is discarded so that the result is an unordered graph, then two applications of a fold operation are enough to make the associated parsing problem NP-complete. However, if the order is kept, then the problem is solvable in non-uniform polynomial time. In this paper, we address the remaining case, where only one fold operation is applied, but the order among the edges is discarded. We show that, under these conditions, the problem is solvable in non-uniform polynomial time. [ABSTRACT FROM AUTHOR]

With the rapid convergence of the Internet of Things (IoT) and command and control communication networks, there is a swift surge in computation-intensive applications and heterogenous devices. Building an edge computing network near the protocol gateway not only facilitates network protocol conversion, but also alleviates computational load on the gateway. Nevertheless, traditional protocol gateways necessitate the inclusion of conversion methods for all communication protocols in the network for data interoperability with other devices. Consequently, constructing low-complexity protocol conversion programs, and the more efficient and equitable allocation of edge server resources, are critical challenges that need to be addressed. This paper investigates the joint problem of task offloading and heterogeneous protocol device access in command and control communication networks, deriving the benefit parameters of task offloading. We propose a real-time data unified access platform, which, by distributing configuration files, enables the IoT gateway to generate protocol conversion programs, thereby transforming all device protocols into a unified common protocol. Furthermore, to enhance the efficiency of heterogeneous device access to the network, we design a data parsing/encapsulation algorithm based on the real-time data unified access platform, supporting bidirectional mapping of two types of data. Experimental validation confirms the reasonability and effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

In addition to providing critical knowledge of the accurate mass of ions, ion mobility‐mass spectrometry (IM‐MS) delivers complementary data relating to the conformation and size of ions in the form of an ion mobility spectrum and derived parameters, namely, the ion's mobility (K) and the IM‐derived collision cross section (CCS). However, the maximum amount of information obtained in IM‐MS measurements is not currently transferred into analytical databases including the full mobility spectra (CCS distributions) as well as capturing of additional ion species (e.g., adducts) into the same compound entry. We introduce CCSfind, a new tool for building comprehensive databases from experimental IM‐MS measurements of small molecules. CCSfind allows predicted ion species to be chosen for input chemical formulae, which are then targeted by CCSfind after parsing open source mzML input files to provide a unified set of results within a single data processing step. CCSfind can handle both chromatographically separated isomers and IM separation of isomeric ions (e.g., "protomers" or conformers of the same ion species) with simple user control over the output for new database entries in SQL format. Files of up to 1 GB can be processed in less than 2 min on a desktop computer with 32 GB RAM with computational time scaling linearly with the size of the input mzML file or the number of input molecular formulae. Results are manually reviewed, annotated with experimental settings, before committing the database where the full dataset can be retrieved. [ABSTRACT FROM AUTHOR]

The existing image semantic segmentation models have low accuracy in detecting tiny targets or multi-targets at overlapping regions. This work proposes a hybrid vision transformer with unified-perceptual-parsing network (ViT-UperNet) for medical image segmentation. A self-attention mechanism is embedded in a vision transformer to extract multi-level features. The image features are extracted hierarchically from low to high dimensions using 4 groups of Transformer blocks with different numbers. Then, it uses a unified-perceptual-parsing network based on a feature pyramid network (FPN) and a pyramid pooling module (PPM) for the fusion of multi-scale contextual features and semantic segmentation. FPN can naturally use hierarchical features, and generate strong semantic information on all scales. PPM can better use the global prior knowledge to understand complex scenes, and extract features with global context information to improve segmentation results. In the training process, a scalable self-supervised learner named masked autoencoder is used for pre-training, which strengthens the visual representation ability and improves the efficiency of the feature learning. Experiments are conducted on cardiac magnetic resonance image segmentation where the left and right atrium and ventricle are selected for segmentation. The pixels accuracy is 93.85%, the Dice coefficient is 92.61% and Hausdorff distance is 11.16, which are improved compared with the other methods. The results show the superiority of Vit-UperNet in medical images segmentation, especially for the low-recognition and serious-occlusion targets. [ABSTRACT FROM AUTHOR]

Summary: JSON is a popular standard for data interchange on the Internet. Ingesting JSON documents can be a performance bottleneck. A popular parsing strategy consists in converting the input text into a tree‐based data structure—sometimes called a Document Object Model or DOM. We designed and implemented a novel JSON parsing interface—called On‐Demand—that appears to the programmer like a conventional DOM‐based approach. However, the underlying implementation is a pointer iterating through the content, only materializing the results (objects, arrays, strings, numbers) lazily. On recent commodity processors, an implementation of our approach provides superior performance in multiple benchmarks. To ensure reproducibility, our work is freely available as open source software. Several systems use On Demand: for example, Apache Doris, the Node.js JavaScript runtime, Milvus, and Velox. [ABSTRACT FROM AUTHOR]

Occluded person re‐identification (Re‐ID) is to identify a particular person when the person's body parts are occluded. However, challenges remain in enhancing effective information representation and suppressing background clutter when considering occlusion scenes. This paper proposes a novel attention map‐driven network (AMD‐Net) for occluded person Re‐ID. In AMD‐Net, human parsing labels are introduced to supervise the generation of partial attention maps, while a spatial‐frequency interaction module is suggested to complement the higher‐order semantic information from the frequency domain. Furthermore, a Taylor‐inspired feature filter for mitigating background disturbance and extracting fine‐grained features is proposed. Moreover, a part‐soft triplet loss, which is robust to non‐discriminative body partial features is also designed. Experimental results on Occluded‐Duke, Occluded‐Reid, Market‐1501, and Duke‐MTMC datasets show that this method outperforms existing state‐of‐the‐art methods. The code is available at: https://github.com/ISCLab‐Bistu/SA‐ReID. [ABSTRACT FROM AUTHOR]

Question generation (QG) aims to generate natural questions from relevant input. Existing state-of-the-art QG approaches primarily leverage pre-trained language models (PLMs) to encode the deep semantics within the input. Meanwhile, studies show that the input's dependency parse tree (referred to as syntactic information) is promising in improving NLP-oriented tasks. However, how to incorporate syntactic information in PLMs to guide a QG process effectively still needs to be settled. This paper introduces a syntax-guided sentence-level QG model based on prompt learning. Specifically, we model the syntactic information by utilizing soft prompt learning, jointly considering the syntactic information from a constructed dependency parse graph and PLM to guide question generation. We conduct experiments on two benchmark datasets, SQuAD1.1 and MS MARCO. Experiment results show that our model exceeded both automatic and human evaluation metrics compared with mainstream approaches. Moreover, our case study shows that the model can generate more fluent questions with richer information. [ABSTRACT FROM AUTHOR]

Introduction: Aspect-based sentiment classification is a fine-grained sentiment classification task. State-of-the-art approaches in this field leverage graph neural networks to integrate sentence syntax dependency. However, current methods fail to exploit the data augmentation in encoding and ignore the syntactic relation in sentiment delivery. Methods: In this work, we propose a novel graph neural network-based architecture with dual contrastive learning and syntax label enhancement. Specifically, a contrastive learning-based contextual encoder is designed, integrating sentiment information for semantics learning. Moreover, a weighted label-enhanced syntactic graph neural network is established to use both the syntactic relation and syntax dependency, which optimizes the syntactic weight between words. A syntactic triplet between words is generated. A syntax label-based contrastive learning scheme is developed to map the triplets into a unified feature space for syntactic information learning. Results: Experiments on five publicly available datasets show that our model substantially outperforms the baseline methods. Discussion: As such, the proposed method shows its effectiveness in aspect-based sentiment classification tasks. [ABSTRACT FROM AUTHOR]

Aspect-based sentiment analysis aims to recognize the sentiment polarities for opinion words with the aid of some machine learning or deep learning-based sentiment classification models. Dependency parsing has been considered as an efficient tool for identifying the opinion words in the sentiment text. However, many dependency-based methods might be susceptible to the dependency tree, which inevitably introduces noisy information due to that the rich relation information between words is neglected. In this paper, we propose a multi-feature fusion approach based on domain adaptive pretraining to reduce dependency-based noisy information for aspect-based sentiment classification (ASC). First, we utilize multi-task learning (MTL) for domain adaptive pretraining, which combines biaffine attention model (BAM) and mask language model (MLM) by jointly considering the structure, the relation semantics of edges, and the linguistic feature in the sentiment text. Second, to fully consider these different features affected with each other, a double graph fusion model is proposed, which takes as input the pretrained dependency graph into a message passing neural network (MPNN) initialized with the optimal parameters of the pretrained BAM for training. Lastly, extensive experiments were made against the state-of-the-art competitors over four benchmark datasets, and the results illustrate that our approach outperforms these competitors over most of the four datasets and achieves an accuracy of up to 92.69% and a macro-averaged F1 value of up to 85.79%. The MTL-based domain adaptive pretraining is efficient to achieve high-quality dependency parsing contributing to improving the performance of ASC, while maintaining lower computational cost. [ABSTRACT FROM AUTHOR]

With the advent of the Fourth Industrial Revolution, Artificial Intelligence (AI) has become increasingly prevalent and is expected to replace a range of human tasks. In this context, this study seeks to identify occupations that are vulnerable to AI, and focuses on their occupational and spatial characteristics. Korean patent data within Google Patents and tasks of occupations based on ISCO-08 were collected and analyzed via dependency parsing to reveal the corresponding tasks and occupations with AI's technical characteristics. Our analysis highlights the vulnerability of tasks that have remained unchanged for a long time, while managerial professions and other occupations involving new and complex tasks based on know-how are less susceptible to the influence of AI. The study also shows significant regional disparities in labor distribution according to AI vulnerability in Korea, forming a strong spatial cluster. While previous waves of automation primarily affected manual labor involving unskilled work and low levels of education, AI is expected to replace various forms of middle and high skilled and educated human work. As such, this study recommends that local governments prepare for the polarization of the labor market by AI based on the understanding of their employment structure. [ABSTRACT FROM AUTHOR]

The Intelligent Data Analysis (IDA) Journal's fourth issue of volume 28 covers a range of theoretical and applied topics in the field of Intelligent Data Analysis. The first half of the issue focuses on theoretical and methodological contributions, including outlier detection methods, unsupervised learning, time-series classifications, image analysis, and text analysis. The second half of the issue features several application papers in areas such as time-series analysis, music genre classification, online product reviews, credit fraud detection, and cybersecurity. The papers present innovative approaches and techniques that demonstrate improved performance and effectiveness in their respective fields. [Extracted from the article]

Unmanned swarm systems are now employed in a wide range of applications. Agriculture, commerce, and the military will all benefit from the advancement of unmanned swarm technology. Scenarios should have a standardized description and definition as system input to support numerous applications and accelerate scenario validation, allowing for more precise and specialized processing to standardize the validation process. A scenario description language for unmanned swarm (SL4U) is introduced in order to implement the unmanned swarm scenario. The scenario is divided into environment and task. The environment is defined, including the task space, target, and home locations, and the initial settings of the unmanned swarm. In terms of tasks, four categories of tasks, four temporal relationship constraints, the event handler, as well as other elements are identified. The dual engines of parsing and micro-embedded collaboration we developed will handle the SL4U. We employ a search and rescue scenario in both simulation and physics to test SL4U. Through the processing of the dual engines, the unmanned swarm's search and rescue operations in a predefined environment are accomplished successfully. In more complex scenarios, just add more descriptions to SL4U and implement them in dual engines rather than starting from scratch. The use of SL4U in verification minimizes the cost and time consumption of unmanned swarm, particularly in physical verification. [ABSTRACT FROM AUTHOR]

In the modern world, structured and semi-structured knowledge bases hold a considerable amount of data. There-fore, people who are familiar with formal query languages should not be the only ones who can efficiently and clearly query them. Semantic Parsing (SP) is converting natural language utterances into formal meaning representations. The paper suggests a model for SP that uses a novel method of utilizing the Semi-Supervised Generative Adversarial Network (SS-GAN) to enhance the classifier performance. The proposed SS-GAN extends the fine-tuning of word embedding architectures using unlabeled examples in a generative adversarial environment. We provide a regularization strategy for addressing the mode missing problem and unstable training in SS-GAN. The main viewpoint is to use the extracted feature vectors from the discriminator. Hence, the generator produces outputs by aiding the discriminator's learned features. A reconstruction loss is added to the loss function of the SS-GAN to drive the genera-tor to reconstruct outputs from the discriminator's features, hence steering the generator toward actual data configurations. The proposed reconstruction loss improves the performance of SS-GAN, produces high-quality outputs, and may be combined with other regularization loss functions to improve the performance of diverse GANs. We employ BERT word embedding for our model, which can be included in a downstream task and fine-tuned as a model, while the pre-trained BERT model can capture various linguistic properties. We examine the suggested model using the WikiSQL and SparC datasets, and the analysis findings reveal our model outperforms its rivals. The findings from our experiments indicate that the need for labeled samples can be minimized, down to as few as 100 instances, while still achieving commendable classification outcomes. [ABSTRACT FROM AUTHOR]

Identification of stance has recently gained a lot of attention with the extreme growth of fake news and filter bubbles. Over the last decade, many feature-based and deep-learning approaches have been proposed to solve stance detection. However, almost none of the existing works focus on providing a meaningful explanation for their prediction. In this work, we study stance detection with an emphasis on generating explanations for the predicted stance by capturing the pivotal argumentative structure embedded in a document. We propose to build a stance tree that utilizes rhetorical parsing to construct an evidence tree and to use Dempster Shafer Theory to aggregate the evidence. Human studies show that our unsupervised technique of generating stance explanations outperforms the SOTA extractive summarization method in terms of informativeness, non-redundancy, coverage, and overall quality. Furthermore, experiments show that our explanation-based stance prediction excels or matches the performance of the SOTA model on various benchmark datasets. [ABSTRACT FROM AUTHOR]

Geographic spaces is a vast and complex system involving multiple elements and nonlinear interactions of these elements, and rich in geographical phenomena, processes and patterns. Artificial intelligence methods (AI) are increasingly utilized to extract information of interest, patterns and insights from massive remote sensing (RS) images. Among them, two representative paradigms for RS interpretation are knowledge-driven symbolism and data-driven connectionism. Knowledge-driven approaches are certain and theoretically sound, which consider the regularities, formulae with accompanying theorems, and expert knowledge. However, it is difficult to address huge-scale RS data and complex nonlinear problems. The data-driven paradigm has stronger data learning and representation ability, yet poor interpretability, low trustworthiness of interpretation results, and reliance on massive labeled data. To address these limitations, we argue that current RS intelligent interpretation requires the guidance of geographic ideas and a unified theoretical framework rather than the independent use of remotely sensed data, duplicative development of interpretation models, or isolated applications of geographic information extraction. Thus, we introduce the concepts of trustworthy RS interpretation (TRSI) with multi-granularity of space, time, and attribute to facilitate the understanding of the morphology, types, and indicators (visual perception) and the perspective of the structure, evolution, and trends (geographical cognition) of complex geographical space. Second, integrated technologies of the TRSI with multiple scales and stages are developed, including a pixel-level visual perception, a geo-parcel-level quantitative inversion, and a scene-level geographical cognition. Finally, a RS big data interpretation system with quantitative semantic parsing is designed to support precise applications with cloud–edge-end collaboration. Rather than a simple overview and accumulation of traditional RS intelligent interpretation methods, this paper analyzes current challenges in RS interpretation and proposes new concepts, technologies, and applications of TRSI. It will empower us to perceive the complex geographical space comprehensibly and reveal its structural composition and evolutionary mechanism, serving geospatial decision applications such as evaluation, planning, and forecasting. [ABSTRACT FROM AUTHOR]

This paper introduces an effective method for improving dependency parsing which is based on a graph embedding model. The model helps extract local and global connectivity patterns between tokens. This method allows neural network models to perform better on dependency parsing benchmarks. We propose to incorporate node embeddings trained by a graph embedding algorithm into a bidirectional recurrent neural network scheme. The new model outperforms a baseline reference using a state-of-the-art method on three dependency treebanks for both low-resource and high-resource natural languages, namely Indonesian, Vietnamese and English. We also show that the popular pretraining technique of BERT would not pick up on the same kind of signal as graph embeddings. The new parser together with all trained models is made available under an open-source license, facilitating community engagement and advancement of natural language processing research for two low-resource languages with around 300 million users worldwide in total. [ABSTRACT FROM AUTHOR]

Nowadays, information explosion happens in every field. In the stock market of China, automatically understanding the market dynamics is extremely important. However, the information and datasets in Chinese are overwhelming for researchers in the field. How to extract useful information and understand the underlying logic in the Chinese corpus are the research hotspot. Causal relation identification is one of the most central tasks. Many works have made important progress in finding the causal relations in open-domain text, however, there is still space for further explorations in the specific domain of the financial field. In this paper, we propose to use the graph convolution network (GCN) to help represent the dependency relations among the entities in the logical networks provided by the Chinese dependency parsing tool, language technology platform(LTP). The motivation for using the GCN method to help represent the dependency relations is that the causal relations are highly correlated with language structures. Besides, we also choose to use the domain-specific pre-trained model FinBERT because this pre-trained model is specific to the financial field. Results show that the GCN-based method and pertained models of FinBERT in our proposed model play a key role in outperforming the baseline model of the traditional sequential labeling method and the start of art method from F1 of 0.4573 and 0.5506 to 0.6254. Our approach also wins third place in the Eastern District of software service outsourcing competition in China in the year 2021. We believe the proposed methods can contribute as at least an alternative option in future relation extraction tasks. [ABSTRACT FROM AUTHOR]

Image animation creates visually compelling effects by animating still source images according to driving videos. Recent work performs animation on arbitrary objects using unsupervised methods and can relatively robustly perform motion transfer on human bodies. However, the complex representation of motion and unknown correspondence between human bodies often lead to issues such as distorted limbs and missing semantics, which make human animation challenging. In this paper, we propose a semantically guided, unsupervised method of motion transfer, which uses semantic information to model motion and appearance. Specifically, we use a pre-trained human parsing network to encode the rich and diverse foreground semantic information, thus generating fine details. Secondly, we use a cross-modal attention layer to learn the semantic region's correspondence between human bodies to guide the network in selecting appropriate input features, prompting the network to generate accurate results. Experiments demonstrate that our method outperforms state-of-the-art methods in motion-related metrics, while effectively addressing the problems of semantic missing and unclear limb structures prevalent in human motion transfer. These improvements can facilitate its applications in various fields, such as education and entertainment. [Display omitted] • Proposes a novel framework for human image animation using semantic features and cross-modal attention. • Introduces semantic segmentation features to represent motion and identity information. • Employs a cross-modal attention mechanism to establish correspondences between semantic regions. • Achieves state-of-the-art performance on complex human motions like TaiChi poses. • Reduces issues of missing semantics and distorted limbs common in human animation. [ABSTRACT FROM AUTHOR]

Human parsing is very important in a diverse range of industrial applications. Despite the considerable progress that has been achieved, the performance of existing methods is still less than satisfactory, since these methods learn the shared features of various parsing labels at the image level. This limits the representativeness of the learnt features, especially when the distribution of parsing labels is imbalanced or the scale of different labels is substantially different. To address this limitation, a Region‐level Parsing Refiner (RPR) is proposed to enhance parsing performance by the introduction of region‐level parsing learning. Region‐level parsing focuses specifically on small regions of the body, for example, the head. The proposed RPR is an adaptive module that can be integrated with different existing human parsing models to improve their performance. Extensive experiments are conducted on two benchmark datasets, and the results demonstrated the effectiveness of our RPR model in terms of improving the overall parsing performance as well as parsing rare labels. This method was successfully applied to a commercial application for the extraction of human body measurements and has been used in various online shopping platforms for clothing size recommendations. The code and dataset are released at this link https://github.com/applezhouyp/PRP. [ABSTRACT FROM AUTHOR]

It is important to establish solid mathematical knowledge throughout the education period. Matrices are important mathematical objects commonly used in many diverse disciplines, including mathematics, engineering, and science. Most problems encountered in such disciplines are represented by mathematical models with various types of matrices, and solved through some applications of matrix algebra. Although simple or advanced operations of matrices can be performed by using modern programming languages, it usually results in a large fragment of code with a low level of readability due to a complicated sequence of control statements. On the other hand, special-purpose languages handle these operations via library functions, presenting poor integration with other programming environments, and less programming flexibility and practice. This paper addresses the design and development of a programming language, called MxPL, which supports matrix-related mathematics with the provision of some basic structures and functions. Firstly, a grammar that is compatible with the usual notations of matrices is constructed and the parser is produced. Then, the code verifier and interpreter for MxPL programs are implemented. Some code examples are presented to illustrate the performance of several sophisticated matrix operations. The comparative analysis of MxPL is conducted with modern programming languages based on language features. [ABSTRACT FROM AUTHOR]

In the Internet era, the industrial Internet platform has become a bridge between customers and enterprises. In addition, with the continuous improvement of customers' living standards, customers not only meet the basic needs for the functionality of products, but also yearn to participate in the production process of products and interactive experience activities with enterprises while pursuing high quality. In view of the difficulties in identifying and capturing the dynamically changing needs of customer- product interaction whole life cycle under the new environment of industrial Internet, and the problem of large amount and redundancy of demand data, this paper develops a set of models and methods covering the identification, definition, acquisition and parsing of customer needs, which provides theoretical support and decision-making basis for enterprises to accurately capture and predict customer needs, excavates potential market customers of enterprises, and realizes value-added of the value chain. Moreover, the methodology of personalized requirements for CILC proposed in this paper is helpful to the transformation of enterprise manufacturing model from mass manufacturing to mass customization and even to mass personalization. It can reduce enterprise production costs, and improve customer satisfaction and service experience. [ABSTRACT FROM AUTHOR]

Context: Computational materials science (CMS) focuses on in silico experiments to compute the properties of known and novel materials, where many software packages are used in the community. The NOMAD Laboratory (Draxl C, Scheffler) offers to store the input and output files in its FAIR data repository. Since the file formats of these software packages are non‐standardized, parsers are used to provide the results in a normalized format. Objective: The main goal of this article is to report experience and findings of using grammar‐based fuzzing on these parsers. Method: We have constructed an input grammar for four common software packages in the CMS domain and performed an experimental evaluation on the capabilities of grammar‐based fuzzing to detect failures in the Novel Materials Discovery (NOMAD) parsers. Results: With our approach, we were able to identify three unique critical bugs concerning service availability, as well as several additional syntactic, semantic, logical, and downstream bugs in the investigated NOMAD parsers. We reported all issues to the developer team prior to publication. Conclusion: Based on the experience gained, we can recommend grammar‐based fuzzing also for other research software packages to improve the trust level in the correctness of the produced results. [ABSTRACT FROM AUTHOR]

Background: Knowledge graphs are well-suited for modeling complex, unstructured, and multi-source data and facilitating their analysis. During the COVID-19 pandemic, adverse event data were integrated into a knowledge graph to support vaccine safety surveillance and nimbly respond to urgent health authority questions. Here, we provide details of this post-marketing safety system using public data sources. In addition to challenges with varied data representations, adverse event reporting on the COVID-19 vaccines generated an unprecedented volume of data; an order of magnitude larger than adverse events for all previous vaccines. The Patient Safety Knowledge Graph (PSKG) is a robust data store to accommodate the volume of adverse event data and harmonize primary surveillance data sources. Methods: We designed a semantic model to represent key safety concepts. We built an extract-transform-load (ETL) data pipeline to parse and import primary public data sources; align key elements such as vaccine names; integrated the Medical Dictionary for Regulatory Activities (MedDRA); and applied quality metrics. PSKG is deployed in a Neo4J graph database, and made available via a web interface and Application Programming Interfaces (APIs). Results: We import and align adverse event data and vaccine exposure data from 250 countries on a weekly basis, producing a graph with 4,340,980 nodes and 30,544,475 edges as of July 1, 2022. PSKG is used for ad-hoc analyses and periodic reporting for several widely available COVID-19 vaccines. Analysis code using the knowledge graph is 80% shorter than an equivalent implementation written entirely in Python, and runs over 200 times faster. Conclusions: Organizing safety data into a concise model of nodes, properties, and edge relationships has greatly simplified analysis code by removing complex parsing and transformation algorithms from individual analyses and instead managing these centrally. The adoption of the knowledge graph transformed how the team answers key scientific and medical questions. Whereas previously an analysis would involve aggregating and transforming primary datasets from scratch to answer a specific question, the team can now iterate easily and respond as quickly as requests evolve (e.g., "Produce vaccine-X safety profile for adverse event-Y by country instead of age-range"). [ABSTRACT FROM AUTHOR]

Most cropping-and-segmenting pattern parsers typically establish a single metric/scheme to reason diverse inner correlations, resulting in over-general and redundant representations. To make pattern parsing more streamlined and efficient, a fragile correlation pruner network (FCPN) with correlation-steered attention shifters (CSASs) and graph attention expectation-maximum routing agreement (GAEMRA) is proposed. CSASs prune fragile (weak and substitutable) part-to-whole correlations. They stipulate that only those primary entities (representing components) fulfilling the criteria of inter-part diversity and intra-object cohesiveness can update senior entities (representing the whole/intermediate composites). To further boost effects, GAEMRA is defined to shield the redundant voting signals of conventional routing agreement. With CSASs and GAEMRA, FCPN gradually parses objective semantic patterns by clustering highly associated secondary entities in a bottom-up "part backtracking" manner. Quantitative and ablation experiments surrounding face and human parsing demonstrate the superiority of FCPN over the state-of-the-arts, especially for the definition of fine-grained semantic boundaries. [ABSTRACT FROM AUTHOR]

Code commenting plays an important role in program comprehension. Automatic comment generation helps improve software maintenance efficiency. The code comments to annotate a method mainly include header comments and snippet comments. The header comment aims to describe the functionality of the entire method, thereby providing a general comment at the beginning of the method. The snippet comment appears at multiple code segments in the body of a method, where a code segment is called a code snippet. Both of them help developers quickly understand code semantics, thereby improving code readability and code maintainability. However, existing automatic comment generation models mainly focus more on header comments, because there are public datasets to validate the performance. By contrast, it is challenging to collect datasets for snippet comments, because it is difficult to determine their scope. Even worse, code snippets are often too short to capture complete syntax and semantic information. To address this challenge, we propose a novel Snippet Comment Generation approach called SCGen. First, we utilize the context of the code snippet to expand the syntax and semantic information. Specifically, 600,243 snippet code-comment pairs are collected from 959 Java projects. Then, we capture variables from code snippets and extract variable-related statements from the context. After that, we devise an algorithm to parse and traverse abstract syntax tree (AST) information of code snippets and corresponding context. Finally, SCGen generates snippet comments after inputting the source code snippet and corresponding AST information into a sequence-to-sequence-based model. We conducted extensive experiments on the dataset we collected to evaluate our SCGen. Our approach obtains 18.23 in BLEU-4 metrics, 18.83 in METEOR, and 23.65 in ROUGE-L, which outperforms state-of-the-art comment generation models. [ABSTRACT FROM AUTHOR]

Abstract Meaning Representation (AMR) parsing aims to translate sentences to semantic AMR graphs and has recently been empowered by pre-trained Transformer models (e.g., BART). We argue that explicitly encoding syntactic knowledge is beneficial for AMR parsing, since the AMR graph of a sentence has similar substructures to those of its corresponding syntactic dependency tree. However, the effect of integrating syntactic dependency knowledge into pre-trained Transformer-based AMR parsers, as well as how to better infuse them, remains unclear. Therefore, we conduct a systematic study to explore the utility of incorporating dependency trees into pre-trained Transformers for AMR parsing. Specifically, we propose and compare two distinct syntax-infused AMR parsers for injecting dependency structures: the Syntax-Aware Self-Attention (SASA) network, which extends the self-attention mechanism of the Transformer encoder with syntax-aware constraints, and the Syntax-Aware Graph Attention (SAGAT) network, which augments the pre-trained Transformer by encoding the syntax with a graph attention network. Extensive experiments conducted on different benchmarks demonstrate that both proposed syntax-infused AMR parsers achieve remarkable and explainable improvements. Specifically, SASA significantly outperforms the strong baseline by up to 1.2% and 0.9% Smatch scores on the AMR2.0 and AMR3.0 datasets, respectively. Furthermore, the proposed models alleviate the performance degradation caused by long-distance dependencies (LDDs), particularly in complex and long sentences. In addition, our proposed models achieve a new state-of-the-art performance level on out-of-distribution and low-resource benchmarks. The source code is available at https://github.com/Hi-ANONYMOUS/Syntax-Aware_AMR. [ABSTRACT FROM AUTHOR]

Automated log parsing is essential for many log-mining applications, as logs provide a vast range of information on events and variations within an operating system or software at runtime. Over the years, various methods have been proposed for log parsing. With improved log-parsing methods, log-mining applications can gain deeper insights into system behaviors and identify anomalies or failures promptly. However, current log parsers still face limitations, such as insufficient parsing of log templates and a lack of parallelism, as well as inaccurate log template parsing. To overcome these limitations, we have designed Polo, a parser that leverages a prefix forest composed of ternary search trees to mine templates from logs. We then conducted extensive experiments to evaluate the accuracy of Polo on nine representative system logs, achieving an average accuracy of 0.987. It is 9.93% to 40.95% faster than the state-of-the-art parsing methods. Furthermore, we evaluated our approach on a downstream log analysis task, specifically anomaly detection. The experimental results demonstrated that, in terms of F1-score, our parser outperformed Deeplog, LogAnomaly, CNN, and LogRobust by 11.5%, 4%, 1%, and 19.1%, respectively, exhibiting a promising recall score of 0.971. These results indicate the effectiveness of Polo for anomaly detection. [ABSTRACT FROM AUTHOR]

One of the main challenges in target-dependent sentiment classification (TDSC) is dealing with sentences that contain multiple targets with varying polarities. Traditional sentiment analysis has shown the effectiveness of language characteristics. Therefore, we propose a method to extract target semantic-related tokens from sentences in order to simplify the sentiment classification task. To achieve this, we establish six grammatical principles that utilize grammatical knowledge to filter the relevant descriptions of targets. Since a target is typically a noun and acts as a subject, we summarize the six rules to extract the contexts contained in the objects and subordinate clauses. We use dependency parsing to analyze the grammatical relations between the target and its context. We design a data pre-processing method called Text Filtering (TF) to automate this procedure. After executing the TF algorithm, we pass the target-related words to a simple classifier to predict their sentiment polarities. Rather than feeding these features directly to a network and letting it learn features on its own, our approach employs dependency relations to extract context linked to the target. This provides the network with meaningful and representative features, resulting in superior results. We conduct ablation studies to investigate the effectiveness of the proposed TF algorithm. In the restaurant hard dataset, our approach improves accuracy by 13.76% and macro-F1 by 14.65% compared to a CNN-based method where TF is not implemented. • Incorporate linguistic knowledge to the model by a two-step framework for effective handling of multiple targets. • Target-related contexts were extracted by the summarized rules which distinguish content and function words. • A hierarchical and recursive data process method was designed specifically for TDSC named Text filtering (TF). [ABSTRACT FROM AUTHOR]

Artificial Intelligence is finding increased applications in communication networks. In particular, the field of text-to-Structured Query Language (SQL) translation has great potential to improve customer experience by allowing the querying of network performance databases using natural language. Such adoption, however, is challenging, in general. On one hand, live production systems may have databases with non-semantic table and column names, which makes natural language parsing and text-to-SQL translation difficult. On the other hand, noisy input texts may lead to the generation of incorrect queries. Moreover, inaccurate transcription of speech input into text may further aggravate the problem. Motivated by these aspects, we investigate the problem of natural language-based querying of network performance databases used by Wireless Mesh Networks (WMNs). In particular, we fine-tune a state-of-the-art model to translate natural language questions into appropriate SQL queries. In order to mitigate the problem of non-semantic names, we generate database views with semantic column names, based on the existing tables. In addition, we make domain-specific corrections in the text in order to help generate accurate queries. We also design the Natural Language Interface for Network Query (NLINQ) prototype for a real-life industrial WMN solution. The results of the performance evaluation indicate that natural language text can be translated into SQL queries with an accuracy of 89.021–92.663%, on average. Moreover, the average turnaround time of NLINQ ranges between 1.263–2.013 seconds. The results indicate that NLINQ is suitable for real-time, interactive querying of network performance databases. [ABSTRACT FROM AUTHOR]

In the realm of programming languages, interpreters fundamentally rely on syntax analysis (parsing) for establishing a correct evaluation hierarchy. Traditional parsing methods, however, present limitations in terms of optimization. This study introduces an innovative approach that circumvents syntax analysis in the interpretation of functional programming languages. The proposed method employs a novel subroutine, transforming program expressions into a series of atomic expressions, herein referred to as the "molecular program." Each atomic expression within this molecular program constitutes an element of the program's lexicon, assigned a unique identifier that supplants its role in the original expression. The evaluation process adopts a recursive methodology, where the evaluation of a single variable invariably leads to the sequential evaluation of related variables. For the purposes of clarity and demonstration, this approach is exemplified using Lucid, a notable functional programming language. It is posited that this syntax-free interpretation method can be universally applied to any functional programming language that operates on the principles of expressions, functions, or formulas. The efficacy of this method is validated through rigorous testing, suggesting an enhancement in the efficiency of programming language interpretation. [ABSTRACT FROM AUTHOR]

Popular methods of causality extraction work well for simple and explicit single causal relations, but it remains challenging to extract causal relations from the complex sentences of natural texts due to ambiguity concerning the locations of the causal subject and object as well as the complexity of the relevant dependencies. To solve these problems, this paper proposes a five-tuple annotation scheme that defines a scoring function to iteratively parse out the causal pairs from multiple entity pairs in a sentence, and to thus transform the task of extracting causal relations into that of automatic annotation. First, this study uses this scheme to propose a multi-headed, self-attentive mechanism that incorporates encoded information on relative position to increase the capability of the model to perceive causal features. Second, the authors combine information from a dependency tree while assigning the appropriate weights, and finally use a bidirectional GCN network to parse the weights of features of the tree from multiple perspectives and splice the dependency-related features. This joint model of extraction improves the bounds of cause–effect pairs of entities while considering the dependency relationships between them, which renders the extracted, fine-grained causal terms more accurate. Experiments on the SemEval 2010 task 8 and the ADE datasets show that our approach significantly outperforms prevalent methods in terms of the accuracy of solving complex causal extraction compared with state-of-the-art approaches to modeling. [ABSTRACT FROM AUTHOR]

In the era of GeoAI, Geospatial Intelligent Question Answering (GeoIQA) represents the ultimate pursuit for everyone. Even generative AI systems like ChatGPT-4 struggle to handle complex GeoIQA. GeoIQA is domain complex IQA, which aims at understanding and answering questions accurately. The core of IQA is the Question Classification (QC), which mainly contains four types: content-based, template-based, calculation-based and method-based classification. These IQA_QC frameworks, however, struggle to be compatible and integrate with each other, which may be the bottleneck restricting the substantial improvement of IQA performance. To address this problem, this paper reviewed recent advances on IQA with the focus on solving question classification and proposed a comprehensive IQA_QC framework for understanding user query intention more accurately. By introducing the basic idea of the IQA mechanism, a three-level question classification framework consisting of essence, form and implementation is put forward which could cover the complexity and diversity of geographical questions. In addition, the proposed IQA_QC framework revealed that there are still significant deficiencies in the IQA evaluation metrics in the aspect of broader dimensions, which led to low answer performance, functional performance and systematic performance. Through the comparisons, we find that the proposed IQA_QC framework can fully integrate and surpass the existing classification. Although our proposed classification can be further expanded and improved, we firmly believe that this comprehensive IQA_QC framework can effectively help researchers in both semantic parsing and question querying processes. Furthermore, the IQA_QC framework can also provide a systematic question-and-answer pair/library categorization system for AIGCs, such as GPT-4. In conclusion, whether it is explicit GeoAI or implicit GeoAI, the IQA_QC can play a pioneering role in providing question-and-answer types in the future. [ABSTRACT FROM AUTHOR]

The rapid development of information technology has made the amount of information in massive texts far exceed human intuitive cognition, and dependency parsing can effectively deal with information overload. In the background of domain specialization, the migration and application of syntactic treebanks and the speed improvement in syntactic analysis models become the key to the efficiency of syntactic analysis. To realize domain migration of syntactic tree library and improve the speed of text parsing, this paper proposes a novel approach—the Double-Array Trie and Multi-threading (DAT-MT) accelerated graph fusion dependency parsing model. It effectively combines the specialized syntactic features from small-scale professional field corpus with the generalized syntactic features from large-scale news corpus, which improves the accuracy of syntactic relation recognition. Aiming at the problem of high space and time complexity brought by the graph fusion model, the DAT-MT method is proposed. It realizes the rapid mapping of massive Chinese character features to the model's prior parameters and the parallel processing of calculation, thereby improving the parsing speed. The experimental results show that the unlabeled attachment score (UAS) and the labeled attachment score (LAS) of the model are improved by 13.34% and 14.82% compared with the model with only the professional field corpus and improved by 3.14% and 3.40% compared with the model only with news corpus; both indicators are better than DDParser and LTP 4 methods based on deep learning. Additionally, the method in this paper achieves a speedup of about 3.7 times compared to the method with a red-black tree index and a single thread. Efficient and accurate syntactic analysis methods will benefit the real-time processing of massive texts in professional fields, such as multi-dimensional semantic correlation, professional feature extraction, and domain knowledge graph construction. [ABSTRACT FROM AUTHOR]

Due to the boom of Internet of Things (IoT) in recent years, various IoT devices are connected to the Internet and communicate with each other through network protocols such as the Constrained Application Protocol (CoAP). These protocols are typically defined and described in specification documents, such as Request for Comments (RFC), which are written in natural or semi-formal languages. Since developers largely follow the specification documents when implementing web protocols, they have become the de facto protocol specifications. Therefore, it must be ensured that the descriptions in them are consistent to avoid technological issues, incompatibility, security risks, or even legal concerns. In this work, we propose Neural RFC Knowledge Graph (NRFCKG), a neural network-generated knowledge graph based contradictions detection tool for IoT protocol specification documents. Our approach can automatically parse the specification documents and construct knowledge graphs from them through entity extraction, relation extraction, and rule extraction with large language models. It then conducts an intra-entity and inter-entity contradiction detection over the generated knowledge graph. We implement NRFCKG and apply it to the most extensively used messaging protocols in IoT, including the main RFC (RFC7252) of CoAP, the specification document of MQTT, and the specification document of AMQP. Our evaluation shows that NRFCKG generalizes well to other specification documents and it manages to detect contradictions from these IoT protocol specification documents. [ABSTRACT FROM AUTHOR]

The workflow scheduling on edge computing platforms in industrial scenarios aims to efficiently utilize the computing resources of edge platforms to meet user service requirements. Compared to ordinary task scheduling, tasks in workflow scheduling come with predecessor and successor constraints. The solutions to scheduling problems typically include traditional heuristic methods and modern deep reinforcement learning approaches. For heuristic methods, an increase in constraints complicates the design of scheduling rules, making it challenging to devise suitable algorithms. Additionally, whenever the environment undergoes updates, it necessitates the redesign of the scheduling algorithms. For existing deep reinforcement learning-based scheduling methods, there are often challenges related to training difficulty and computation time. The addition of constraints makes it challenging for neural networks to make decisions while satisfying those constraints. Furthermore, previous methods mainly relied on RNN and its variants to construct neural network models, lacking a computation time advantage. In response to these issues, this paper introduces a novel workflow scheduling method based on reinforcement learning, which utilizes neural networks for direct decision-making. On the one hand, this approach leverages deep reinforcement learning, eliminating the need for researchers to define complex scheduling rules. On the other hand, it separates the parsing of the workflow and constraint handling from the scheduling decisions, allowing the neural network model to focus on learning how to schedule without the necessity of learning how to handle workflow definitions and constraints among sub-tasks. The method optimizes resource utilization and response time, as its objectives and the network are trained using the PPO algorithm combined with Self-Critic, and the parameter transfer strategy is utilized to find the balance point for multi-objective optimization. Leveraging the advantages of reinforcement learning, the network can be trained and tested using randomly generated datasets. The experimental results indicate that the proposed method can generate different scheduling outcomes to meet various scenario requirements without modifying the neural network. Furthermore, when compared to other deep reinforcement learning methods, the proposed approach demonstrates certain advantages in scheduling performance and computation time. [ABSTRACT FROM AUTHOR]

Most natural language processing (NLP) tasks operationalize an input sentence as a sequence with token-level embeddings and features, despite its clausal structure. Taking abstract meaning representation (AMR) parsing as an example, recent parsers are empowered by transformers and pre-trained language models, but long-distance dependencies (LDDs) introduced by long sequences are still open problems. We argue that LDDs are not actually to blame for the sequence length but are essentially related to the internal clause hierarchy. Typically, non-verb words in a clause cannot depend on words outside of it, and verbs from different but related clauses have much longer dependencies than those in the same clause. With this intuition, we introduce a type of clausal feature, hierarchical clause annotation (HCA), into AMR parsing and propose two HCA-based approaches, HCA-based self-attention (HCA-SA) and HCA-based curriculum learning (HCA-CL), to integrate HCA trees of complex sentences for addressing LDDs. We conduct extensive experiments on two in-distribution (ID) AMR datasets (AMR 2.0 and AMR 3.0) and three out-of-distribution (OOD) ones (TLP, New3, and Bio). Experimental results show that our HCA-based approaches achieve significant and explainable improvements (0.7 Smatch score in both ID datasets; 2.3, 0.7, and 2.6 in three OOD datasets, respectively) against the baseline model and outperform the state-of-the-art (SOTA) model (0.7 Smatch score in the OOD dataset, Bio) when encountering sentences with complex clausal structures that introduce most LDD cases. [ABSTRACT FROM AUTHOR]