Patent Entity and Relation Extraction (PERE) aims to extract entities and entity-relation triples from unstructured patent texts. PERE is one of the fundamental tasks in patent text mining, providing crucial technical support for patent retrieval and technology opportunity discovery. Previous works struggle to capture the implicit semantic information hidden within overlapping triples, especially a large number of overlapping triples existing in patent texts. A Patent Entity and Relation Extraction model based on Context query and Axial attention is proposed, named PERE-CA. As for entity recognition, the text segment is regarded as candidate entity span and entity types are acquired by span classification. Subsequently, the semantic context related to an entity pair is calculated by a context query method. And the semantic context is integrated into entity pair representation. For relation extraction, axial attention is implemented to get the implicit semantic information among overlapping entity pairs. And then, the model outputs all valid entity-relation triples. Experimental results on the patent dataset TFH-2020 and the public dataset SciERC demonstrate that the implementation of context query and axial attention can effectively improve extraction performance.

Currently, the main challenges of the frameworks for healthcare monitoring are as follows: minimising latency, especially for delay-sensitive diseases such as sudden heart disease; identifying health situation in a timely and accurate manner when correlating physiological indicators and context information; reducing the risk of exposure because health data are highly private. In response to the above, this paper proposes a framework for 5G-secure-smart healthcare monitoring (5GSS) to achieve the following goals: fast and accurate identification of context-aware health situation, blockchain-based secure data sharing, and low-latency services for emergent patients. The framework consists of a data acquisition layer, a diagnosis and security layer (edge cloud), and a health service layer. The proposed framework adopts the following key technologies: a 5G-IPv6 communication network, context-aware health situation identification-based similarity measure, and blockchain-based secure data sharing mechanism. Finally, a prototype system has been implemented to monitor hypertensive heart disease, confirming its effectiveness with respect to a real scenario. Combined with the data of 45 patients, the prototype system can identify health situations with an accuracy of 96.34% at a sensitivity of 92.46% and a specificity of 93.62%, while significantly reducing the latency and improving the data sharing security.

Traffic forecasting is highly challenging due to its complex spatial and temporal dependencies in the traffic network. Graph Convolutional Neural Network (GCN) has been effectively used for traffic forecasting due to its excellent performance in modelling spatial dependencies. In most existing approaches, GCN models spatial dependencies in the traffic network with a fixed adjacency matrix. However, the spatial dependencies change over time in the actual situation. In this paper, we propose a graph learning-based spatial-temporal graph convolutional neural network (GLSTGCN) for traffic forecasting. To capture the dynamic spatial dependencies, we design a graph learning module to learn the dynamic spatial relationships in the traffic network. To save training time and computation resources, we adopt dilated causal convolution networks with a gating mechanism to capture long-term temporal correlations in traffic data. We conducted extensive experiments using two real-world traffic datasets. Experimental results demonstrate that the proposed GLSTGCN achieves superior performance than all state-of-art baselines.

Personalised recommendation is a difficult problem that has received a lot of attention to academia and industry. Because of the sparse user–item interaction, cold-start recommendation has been a particularly difficult problem. Some efforts have been made to solve the cold-start problem by using model-agnostic meta-learning on the level of the model and heterogeneous information networks on the level of data. Moreover, using the memory-augmented meta-optimisation method effectively prevents the meta-learning model from entering the local optimum. As a result, this paper proposed memory-augmented meta-learning on meta-path, a new meta-learning method that addresses the cold-start recommendation on the meta-path furthered. The meta-path builds at the data level to enrich the relevant semantic information of the data. To achieve fast adaptation, semantic-specific memory is utilised to conduct the model with semantic parameter initialisation, and the method is optimised by a meta-optimisation method. We put this method to the test using two widely used recommended data set and three cold-start scenarios. The experimental results demonstrate the efficiency of our proposed method.

Nowadays, broadband wireless networks and 5G have improvements in the quality and dependability of network services for high-speed mobile vehicles. Within an open communication environment on the Internet of vehicles named IoV, personal details will be revealed on the Wi-Fi network. Considering information security and privacy, this research concentrates on how to protect secure information transmission in real time through IoV, and also wants to avoid illegal vehicles, passers-by or drivers from joining connection and planting or altering significant data. This research provides a multilevel security infrastructure with M-tree based elliptic curve digital signature algorithm (ECDSA) for securing data transmission in both IoV and cloud environments. While transmitting, this study provides several flexible and scalable schemes to manage security issues, which dynamically adjust the framework depending on the rapidly changing IoV topology and speed up the time to synchronise the reconstruction of the system key, and decrease the quantity of phases to resynchronise the system key. Moreover, most research of key management without secure data transmission, we integrate the M-tree key management with secure data transmission to achieve the secure IoV. Simultaneously, the provided key management for the multi-level security is quite appropriate to adaptable and expandable IoV.

Sentiment classification can provide the decision support of social applications such as trend judgment, public opinion monitoring, etc. However, the accuracy of sentiment classification for Chinese Weibo is still not satisfactory due to the complexity of Chinese. In addition, affected by the different organisational structure levels, the sentiment tendency of fewer Weibo Comments may be judged to be the opposite. To solve the problem above, this paper presents a Chinese sentiment classification model based on extended sentiment dictionary and organisational structure of comments. First, the sentiment dictionary can be extended by using seven dictionaries, which include the base sentiment dictionary and six additional dictionaries. Then, the sets of rules are constructed, which include inter-sentence rules and organisational structure rules. Finally, comments on three hot topics are crawled and used to make the data sets for sentiment calculation. Accordingly, based on the result of sentiment calculation, sentiment classification is completed. The effectiveness of the proposed model is verified through comparison experiments, and the experimental results are also discussed.

When the ambient temperature is low, a large amount of water mist and dust will inevitably appear around the zinc flotation cell, forming haze, which seriously affects the extraction of flotation froth image features. General defogging methods of natural image are difficult to obtain satisfactory results for such industrial haze image. Therefore, we propose a real-time defogging method based on ASM-VoFD (Atmospheric Scattering Model and the Variable-order Fractional Differential). First, the dark pixel ratio is used to detect fog in froth image, which solves the redundant calculation caused by unnecessary defogging operations. Second, the linear transformation of the atmospheric scattering model is used to calculate the initial transmission map, and the gaussian filter is used to optimize the initial transmittance, and the haze-free image is restored with atmospheric light estimation. Finally, a variable order fractional differential operator is used to enhance the edges and texture details of the restored froth image, which solves the problems of blurred edges and low contrast. The experiments show that the algorithm has a good defogging effect on the industrial images, enhance the edges of the image, and can be effectively implemented in O(N) time to meet the application requirements of real-time flotation monitoring.

The existing Emotion-Cause Pair Extraction (ECPE) has made some achievements, and it is applied in many tasks, such as criminal investigations. Previous approaches realised extraction by constructing different networks, but they did not fully exploit the original information of the data, which led to low extraction precision. Moreover, the extraction precision will also be decreased when the model is attacked by adversarial samples. To address the above problems, a new model CL-ECPE is proposed in this article to improve the extraction precision through contrastive learning. First, contrastive sets are constructed by adversarial samples. The contrastive sets are used as the raw data of adversarial training and the test data of the pilot experiment. Then, adversarial training is used to get contrastive features according to the training target. The acquisition of contrastive features can improve extraction precision. Experimental results on the benchmark emotion cause corpus show our method outperforms the state-of-the-art method by over 12.49%, as well as demonstrates the strong robustness of CL-ECPE.

As a novel Internet architecture focused on data contents, Named Data Networking (NDN) has been proven to be of great value in supporting the Internet of Things, Edge computing, Blockchain, and other popular topics. They can benefit mainly from NDN's intrinsic properties, such as flexible multicasting, in-network caching, among several others. However, once NDN's forwarding plane suffers Denial of Service (DoS) attacks, the overall system performance would be affected significantly. In NDN data transmission, interest forwarding is the most time-consuming operation and thus opens a possible vector of DoS attacks. It is proposed in this paper a fast name lookup algorithm for NDN interest forwarding, which selects feature prefixes instead of lengths to filter out interest packets in NDN interest forwarding. Due to the excellent filtration with feature prefixes, the algorithm accelerates NDN forwarding processes. Compared with other existing solutions, the proposed algorithm shows more than 70% of time improvement in forwarding malicious interests, while remaining at the same performance level in standard cases.

Semantic segmentation plays a vital role in image understanding. Recent studies have attempted to achieve precise pixel-level classification by using deep networks that provide hierarchical features. These methods are trying to effectively utilise multi-level features that are extracted from the data and precisely reconstruct some characteristics of objects that are lost in producing high-level features. In this paper, we propose a multi-scale context U-net (MSCU-net) for semantic image segmentation. This network uses a multi-scale context block (MSCB) to aggregate multi-level features and employs the CRF layer to explicitly model the dependencies among pixels. This network significantly outperforms other state-of-the-art methods on both the PASCAL VOC 2012 and Cityscapes datasets.

Web service composition has become a prevalent software development method that enables developing powerful Mashups by effectively combining Web services with different functions. However, as the number of Web services increases, it becomes challenging for developers to select appropriate services to develop Web applications that satisfy functional requirements. In order to recommend Web services considering user's preferences, a composition pattern-aware Web service recommendation method called EWACP-DeepFM is proposed, which combines the composition patterns between Web services and Mashups and the co-occurrence and popularity of Web services. By constructing a multi-dimensional feature matrix, which is further trained by the depth factorisation machine (DeepFM) model to learn potential link relationships between Web services and Mashup applications, and recommend Top-N best services for the target Mashup application. Experiments performed using the real datasets from ProgrammableWeb show that the proposed method outperforms others with better recommendation effectiveness.