With the rapid advancement of the intelligent Internet of Vehicles (IoV), accurate traffic sign classification is essential to ensure driving safety and improve environmental perception. However, conventional image classification models often rely on local features and spatial domain processing, lacking global context modeling and facing computational limitations. To address these challenges, this paper proposes a quantum discrete Fourier transform-based hierarchical self-attention Vision Transformer (QHSA-ViT). Using the parallelism and high-dimensional feature extraction capabilities of quantum computing, the proposed model enhances the quality and efficiency of representation. Specifically, a quantum frequency domain feature representation (QFDFR) module based on a quantum discrete Fourier transform (QDFT) is introduced to capture rich spectral features, while a quantum self-attention fusion (QSAF) module built on a linear combination of unitaries (LCU) and generalized quantum singular value transformation (GQSVT) integrates multilevel attention. The experimental results on five benchmark datasets, including GTSRB, show that QHSA-ViT outperforms baseline models with an average improvement of 9.01% in accuracy and 8.48% in the F1 score. These results validate the effectiveness of the proposed model and highlight its practical applicability and scalability for understanding traffic scenes in intelligent IoV.

Nanorobots have been used in smart health to collect time series data such as electrocardiograms and electroencephalograms. Real-time classification of dynamic time series signals in nanorobots is a challenging task. Nanorobots in the nanoscale range require a classification algorithm with low computational complexity. First, the classification algorithm should be able to dynamically analyze time series signals and update itself to process the concept drift (CD). Second, the classification algorithm should have the ability to handle catastrophic forgetting (CF) and classify historical data. Most importantly, the classification algorithm should be energy-efficient to use less computing power and memory to classify signals in real-time on a smart nanorobot. To solve these challenges, we design an algorithm that can Prevent Concept Drift in Online continual Learning for time series classification (PCDOL). The prototype suppression item in PCDOL can reduce the impact caused by CD. It also solves the CF problem through the replay feature. The computation per second and the memory consumed by PCDOL are only 3.572 M and 1 KB, respectively. The experimental results show that PCDOL is better than several state-of-the-art methods for dealing with CD and CF in energy-efficient nanorobots.

The development of supply chain systems demands optimization of various technologies in terms of efficiency and resource conservation. As an emerging technology, cross-chain technology in blockchain aims to achieve interoperability and resource sharing between different blockchain networks, enhancing data liquidity and system efficiency. However, relay chains in cross-chain interactions require storing a large number of transaction records, leading to excessive communication and storage loads, which can cause network performance degradation, storage resource exhaustion, and low transaction processing efficiency. To address these issues, this paper proposes a supply chain system-driven efficient quantum blockchain cross-chain transaction scheme (SCS-QBCT). Firstly, SCS-QBCT uses the quantum Fourier transform (QFT) to convert transaction records on relay chains from the time domain to the frequency domain, reducing data redundancy and significantly lowering storage space consumption. Secondly, a multifunctional smart contract, designed to include conventional functions, enables value transfer, transaction withdrawal, transaction query, node identity management, and transaction type identification. Furthermore, inverse quantum Fourier transform (IQFT) is used to restore quantum state transaction records in blocks to classical records, supporting transaction query requests. Finally, the experimental results and theoretical analysis show that SCS-QBCT performs excellently in reducing storage consumption, improving system efficiency, practicality, and security, and meeting the optimization goals of supply chain systems.

Traffic sign recognition is essential for autonomous driving, enhancing driving efficiency and ensuring road safety. Traffic signs utilize colors and patterns to relay critical information, with color accuracy being especially significant. Traditional models, reliant on extensive data and computing resources, struggle to meet the efficiency demands of electric vehicles with carbon-intelligent computing. Leveraging the physical properties of quantum superposition states, quantum computing offers a solution with its unique parallel computing capabilities, potentially enhancing recognition efficiency and facilitating real-time processing. Quantum convolutional neural networks (QCNNs) show promise in processing large-scale image data with improved efficiency and accuracy. However, most of QCNN researches focus on grayscale image classification, with limited studies on multichannel data. This article introduces the quantum channel attention convolutional neural network (QCACNN), which incorporates a quantum channel attention layer (QCAL) to enhance multichannel data classification. The experimental results demonstrate that QCACNNs surpasses traditional QCNNs in traffic sign recognition, performing comparably to conventional CNNs and SENet models with fewer computing resources. Detailed performance analysis and ablation studies validate the effectiveness of each component within this architecture. Quantum noise resistance tests confirm the robustness of QCACNN, making it a viable solution for electric vehicles with enhanced scalability.

Federated learning (FL) is a privacy-preserving alternative to centralized machine learning, where model training is performed on local devices and only global model updates are shared, effectively addressing challenges, such as data silos and privacy protection. Recently, quantum FL (QFL), an emerging FL branch, has garnered significant attention in many industry applications. However, existing QFL algorithms predominantly employ average weighting for global model training, which shows poor performance on heterogeneous healthcare data. To address this challenge, this study proposes a dynamic aggregation QFL algorithm (DAQFL) for intelligent diagnosis. Specifically, it utilizes quantum neural networks (QNNs) as local training models and designs corresponding variational quantum circuits (VQC). To mitigate performance degradation caused by the heterogeneity of medical industrial data, a dynamic aggregation method based on accuracy is proposed to enhance global model performance effectively. Extensive experiments with three distribution settings, including independent and identically distributed (IID), non-independent and identically distributed (Non-IID), and long-tail datasets, show that DAQFL outperforms baseline algorithms in accuracy and training speed. It also performs well in privacy protection and robustness of anti-noise, improving its suitability for real-world medical applications.

With the increasing number of distributed edge intelligence (DEI) sensors in cities, Internet of Vehicles (IoV) systems can obtain more fine-grained information. The information plays a crucial role in tasks, such as road monitoring and traffic forecasting. However, graph-based methods used in IoV systems mainly have two limitations: i) They struggle to achieve both efficiency and high prediction performance, and ii) Most lack user-friendly interfaces to intuitively display data collected by DEI sensors and prediction results. To alleviate the first limitation, we propose a novel deep learning model, the gating memory network multilayer perceptron (GMMLP). In the model, the traditional time-consuming graph-based operations are replaced with multilayer perceptrons (MLPs). A gating mechanism is employed to help reduce redundant information from raw input. An integrated memory network is utilized to memorize common patterns implicitly. To alleviate the second limitation and make GMMLP more accessible, we design a DEI-based human-computer interaction and visualization system called the traffic easy access system (TEAS). Traffic departments and ordinary users can access roads in the state recorded by DEI sensors on multiple terminals. Professionals can easily train and test traffic forecasting models by using this system. We validate the performance of our proposed model on multiple datasets. The experimental results demonstrate that our model achieves excellent performance in both inference efficiency and prediction accuracy.

In recent years, more and more scholars have begun to focus on sentiment analysis on social media. Current sentiment analysis collects all relevant data, including public thoughts, opinions, and feelings, from a variety of open sources. In addition, it automatically predicts different aspects of outcomes or trends based on information collected globally in real time. This research area explores how to extract sentiment information from different modalities (e.g., text, images, and audio). However, the currently existing techniques face several challenges. It is difficult to achieve effective interaction with completely heterogeneous data, and these techniques cannot adequately guarantee data security during data interaction, which is particularly important when dealing with sensitive information. Therefore, this article introduces existing methods for protecting data privacy. Based on this foundation, we propose a novel algorithm called collaborative dynamic hierarchical federated learning with hypernetwork aggregation (CDHFL-HA), which is suitable for sentimental analysis. CDHFL-HA ensures that the data remain local to each participant while leveraging the data similarity between participants on the server and processing interference data on the participant to enhance the accuracy of the current sentimental analysis. In addition, an essential aspect considered in the proposed algorithm is explainability. Understanding the decisions and predictions made by sentiment analysis models is crucial for gaining trust and acceptance in real-world applications. CDHFL-HA incorporates explainability features, providing insights into the decision-making process, thus enhancing the interpretability of sentiment analysis results. Numerous experimental results show that the algorithm outperforms existing algorithms in complex scenarios, with a minimum accuracy of 0.6007 and a maximum of 0.9962. In addition, it can be seen from the experimental results in this article, that the communication parameters in the experiments are similar to those of other federated learning, while the number of training rounds is improved by up to 50% (i.e., 20 rounds faster) relative to other algorithms.

Images captured under low-light conditions suffer from poor visibility and clarity due to insufficient light. The emergence of deep learning has greatly boosted the development of low-light enhancement techniques and achieved promising results. However, while these low-light enhancement methods have enhanced the perceptual effects of human vision, their results in high-level visual tasks (e.g., object detection and semantic segmentation) are still unstable and even sometimes bring negative effects. Therefore, in this work, we propose a new model, KANformer, which uses a semantic-gradient prior as a guide to recover pixels relevant to the image subject from both high-frequency and low-frequency perspectives. Specifically, our model consists of three key components: Low-Frequency Enhancement (LFE) module, which aims to enhance the restoration of the image subject via the semantic prior obtained from SAM; Low-Frequency-Based High-Frequency Enhancement (LFHE) module, which utilizes the KAN module to obtain information from the low-frequency features conducive to the enhancement of high-frequency features; and Gradient-Based High-Frequency Enhancement (GHE) module, which aims to utilize the original gradient as prior to further enhance the structural information of the image and reduce the effect of noise. In addition, we introduce the discrete wavelet transform as down-sampling method while transforming the spatial domain features to the frequency domain for processing. Experiments on multiple paired and unpaired datasets show that our method achieves better visualization and image fidelity compared to other state-of-the-art methods. In addition, experiments on object detection and segmentation show that our method provides better enhancement in improving low-light high-level vision tasks.

Continuously analyzing medical time series as new classes emerge is meaningful for health monitoring and medical decision-making. Few-shot class-incremental learning (FSCIL) explores the classification of few-shot new classes without forgetting old classes. However, little of the existing research on FSCIL focuses on medical time series classification, which is more challenging to learn due to its large intra-class variability. In this paper, we propose a framework, the Meta self-Attention Prototype Incrementer (MAPIC) to address these problems. MAPIC contains three main modules: an embedding encoder for feature extraction, a prototype enhancement module for increasing inter-class variation, and a distance-based classifier for reducing intra-class variation. To mitigate catastrophic forgetting, MAPIC adopts a parameter protection strategy in which the parameters of the embedding encoder module are frozen at incremental stages after being trained in the base stage. The prototype enhancement module is proposed to enhance the expressiveness of prototypes by perceiving inter-class relations using a self-attention mechanism. We design a composite loss function containing the sample classification loss, the prototype non-overlapping loss, and the knowledge distillation loss, which work together to reduce intra-class variations and resist catastrophic forgetting. Experimental results on three different time series datasets show that MAPIC significantly outperforms state-of-the-art approaches by 27.99%, 18.4%, and 3.95%, respectively.

Cognitive computing endeavors to construct models that emulate brain functions, which can be explored through electroencephalography (EEG). Developing precise and robust EEG classification models is crucial for advancing cognitive computing. Despite the high accuracy of supervised EEG classification models, they are constrained by labor-intensive annotations and poor generalization. Self-supervised models address these issues but encounter difficulties in matching the accuracy of supervised learning. Three challenges persist: 1) capturing temporal dependencies in EEG; 2) adapting loss functions to describe feature similarities in self-supervised models; and 3) addressing the prevalent issue of data imbalance in EEG. This study introduces the DreamCatcher Network (DCNet), a self-supervised EEG classification framework with a two-stage training strategy. The first stage extracts robust representations through contrastive learning, and the second stage transfers the representation encoder to a supervised EEG classification task. DCNet utilizes time-series contrastive learning to autonomously construct representations that comprehensively capture temporal correlations. A novel loss function, SelfDreamCatcherLoss, is proposed to evaluate the similarities between these representations and enhance the performance of DCNet. Additionally, two data augmentation methods are integrated to alleviate class imbalances. Extensive experiments show the superiority of DCNet over the current state-of-the-art models, achieving high accuracy on both the Sleep-EDF and HAR datasets. It holds substantial promise for revolutionizing sleep disorder detection and expediting the development of advanced healthcare systems driven by cognitive computing.

Deep learning-based time series classification in 6G-supported Intelligent Transportation Systems (ITS) helps transport decision-making. Deep learning classifier training necessitates a large amount of labeled data for feature extraction. Labeling time series data in 6G-supported ITS is tough. Meta-learning can be used to train deep classifiers with limited data. However, in meta-learning, the tasks are frequently modeled by a low-complexity base learner. It is unable to use more complicate and powerful structures. The meta-learning-pretrained classifier can only perform new classification problems with the same number of classes. Most pre-training strategies do not prioritize enhancing the pre-training phase’s convergence rate and lowering the computational cost. Most research work aims to improve classification performance by increasing the complexity of the classification model. However, this raises computing costs. In this paper, we propose a one-dimensional Multi-Scale Dilated Convolution Neural Network time series classifier (MSDCNN). MSDCNN combines multi-scale CNN and dilated CNN. It can extract multi-scale characteristics from time series and reduce the complexity of the classifier. Furthermore, we propose a pre-training strategy, called Meta-transfer metric Learning using Scale function (MLS). MLS allows the classifier to gain experience from different tasks with various numbers of classes. Experiments show that MLS reduces pre-training computation costs during the pre-training phase. The pre-trained classifier, without using any fine tuning techniques, achieves the highest accuracy by comparing with the state-of-the-art methods. Finally, we present a case study of applying MSDCNN and MLS to detect road accidents in 6G-supported transportation systems.

Graph learning is widely applied to process various complex data structures (e.g., time series) in different domains. Due to multidimensional observations and the requirement for accurate data representation, time series are usually represented in the form of multilabels. Accurately classifying multilabel time series can provide support for personalized predictions and risk assessments. It requires effectively capturing complex label relevance and overcoming imbalanced label distributions of multilabel time series. However, the existing methods are unable to model label relevance for multilabel time series or fail to fully exploit it. In addition, the existing multilabel classification balancing strategies suffer from limitations, such as disregarding label relevance, information loss, and sampling bias. This article proposes a dynamic graph attention autoencoder-based multitask (DGAAE-MT) learning framework for multilabel time series classification. It can fully and accurately model label relevance for each instance by using a dynamic graph attention-based graph autoencoder to improve multilabel classification accuracy. DGAAE-MT employs a dual-sampling strategy and cooperative training approach to improve the classification accuracy of low-frequency classes while maintaining the classification accuracy of high-frequency and mid-frequency classes. It avoids information loss and sampling bias. DGAAE-MT achieves a mean average precision (mAP) of 0.955 and an F1 score of 0.978 on a mixed medical time series dataset. It outperforms state-of-the-art works in the past two years.

Digital Twins for Mobile Networks (DTMN) can enhance mobile health (mHealth) by increasing diagnostic and monitoring capabilities. Classifying multi-label time series mHealth data in DTMN is challenging due to complex class relevance and feature extraction difficulties. This paper proposes a Class-Driven Graph Attention network learning framework (C-DGAM) for Multi-label classification of mHealth data in DTMN. C-DGAM captures the complex class relationships by constructing a unique class relevance graph for each time series. It uses a temporal context attention module to generates class representation vectors by fusing multi-dimensional features of time and class. Then, it dynamically models different relevance among the class representation vectors through a dynamic graph attention module which improves the performance of multi-label time series classification while maintaining a smaller parameter size and lower computational complexity. The mean Average Precision achieved by C-DGAM on two different multi-label time series datasets are 0.955 and 0.776, respectively, with corresponding F1 scores of 0.867 and 0.80. It demonstrates leading performance compared to existing state-of-art works. It provides more accurate and generalized algorithmic support for DMTN systems.

Recently, deep neural networks (DNNs) promote mainly by network architectures and loss functions; however, the development of neuron models has been quite limited. In this study, inspired by the mechanism of human cognition, a hyper-sausage coverage function (HSCF) neuron model possessing a high flexible plasticity. Then, a novel cross-entropy and volume-coverage (CE_VC) loss is defined, which compresses the volume of the hyper-sausage to the hilt, and helps alleviate confusion among different classes, thus ensuring the intra-class compactness of the samples. Finally, a divisive iteration method is introduced, which considers each neuron model as a weak classifier, and iteratively increases the number of weak classifiers. Thus, the optimal number of the HSCF neuron is adaptively determined and an end-to-end learning framework is constructed. In particular, to improve the classification performance, the HSCF neuron can be applied to classical DNNs. Comprehensive experiments on eight datasets in several domains demonstrate the effectiveness of the proposed method. The proposed method exhibits the feasibility of boosting DNNs with neuron plasticity and provides a novel perspective for further developments in DNNs. The source code is available at https://github.com/Tough2011/HSCFNet.git .

Building a quality service-based system (SBS) is one of the most important research topics in software engineering. Many studies investigate intelligent methods to simplify the process of building SBSs. In particular, some keyword-based SBS building methods allow service users to automatically build an SBS by only providing a few of keywords. This type of work usually constructs a directed weighted graph of a service repository. A set of minimum-weight group Steiner trees (MSTs) is extracted from the graph to represent the service functions and their relations. However, to the best of our knowledge, none of the existing keyword-based SBS building methods allow the relaxation of the function requirements for a user. A relaxed SBS may achieve a comparable functionality versus a complete SBS containing all the query functions. To fill in the above gap, we define a new problem: a bounded skyline SBS building problem, whose solution is more adaptive and less limited than the traditional keyword-based SBS building methods. To solve this problem, we propose two algorithms based on skyline query, dynamic programming, and lower bound pruning. In the experiments, we collect real-world datasets and label the nodes with keywords. We conduct a comprehensive study to demonstrate the time efficiency of our algorithms on automatically finding SBSs. We make the annotated real-world datasets and our source code open to peer researchers.

With the development of Internet of Medical Things, massive healthcare sensor data (HSD) are transmitted in the Internet, which faces various security problems. Healthcare data are sensitive and important for patients. Automatic classification of HSD has significant value for protecting the privacy of patients. Recently, the edge computing-based federated learning has brought new opportunities and challenges. It is difficult to develop a lightweight HSD classification system for edge computing. In particular, the classification system should consider the dynamic characteristics of HSD, e.g., the change of data distributions and the appearance of initially unknown classes. To solve these problems, the paper proposes a scalable and transferable classification system, called SCALT. It is a one-classifier-per-class system based on federated learning. It comprises a one-dimensional convolution-based network for feature extraction, and an individual mini-classifier for each class. It is easy to be scaled when new class appears since only a mini-classifier will be trained. The feature extractor is updated only when it is transferred to a new task. SCALT has a parameter protection mechanism, which can avoid catastrophic forgetting in sequential HSD classification tasks. We conduct comprehensive experiments to evaluate SCALT on three different physiological signal datasets: Electrocardiogram, Electroencephalogram and Photoplethysmograph. The accuracies on the three datasets are 98.65%, 91.10% and 89.93% respectively, which are higher than the compared state-of-the-art works. At last, an application of applying SCALT to protect the privacy of patients is presented.

Automatic text spotting can help unmanned vehicles read human texts, thus improving the safety and reliability of autonomous driving. Some existing text spotting models use inefficient region proposal networks or modules based on the recurrent neural network. Region proposal networks produce redundant anchors. Recurrent neural networks cannot perform parallel operations well. The existence of these inefficient modules prevents these models from applying in autonomous unmanned vehicles. In this paper, we propose an end-to-end two-stage text spotting model named Center TextSpotter, which is a convolution model that does not involve region proposal networks and recurrent neural network. Moreover, we develop a weakly supervised training method and a feature fusion module. The weakly supervised training method adjusts the loss by weighting the predicted labels to improve the performance of text recognition. The feature fusion module fuses the features of the proposal with the features of the proposal-context to enhance the overall performance. Our model follows the modular design principle. So it can be easily extended and modified. This paper presents an extension scheme based on graph neural network. By adding the graph neural network before the fully connected layer, the model learns better features. Experiments demonstrate that Center TextSpotter can complete the task of text spotting for autonomous unmanned vehicles commendably.

With the rapid development of the Internet of Things (IoT), it becomes convenient to use mobile devices to remotely monitor the physiological signals (e.g., Arrhythmia diseases) of patients with chronic diseases [e.g., cardiovascular diseases (CVDs)]. High classification accuracy of interpatient electrocardiograms is extremely important for diagnosing Arrhythmia. The Supraventricular ectopic beat (S) is especially difficult to be classified. It is often misclassified as Normal (N) or Ventricular ectopic beat (V). Class imbalance is another common and important problem in electronic health (eHealth), as abnormal samples (i.e., samples of specific diseases) are usually far less than normal samples. To solve these problems, we propose a sustainable deep learning-based heart beat classification system, called BeatClass. It contains three main components: two stacked bidirectional long short-term memory networks (Bi-LSTMs), called Rist and Morst, and a generative adversarial network (GAN), called MorphGAN. Rist first classifies the heartbeats into five common Arrhythmia classes. The heartbeats classified as S and V by Rist are further classified by Morst to improve the classification accuracy. MorphGAN is used to augment the morphological and contextual knowledge of heartbeats in infrequent classes. In the experiment, BeatClass is compared with several state-of-the-art works for interpatient arrhythmia classification. The$F1$-scores of classifying N, S, and V heartbeats are 0.6%, 16.0%, and 1.8% higher than the best baseline method. The experimental result demonstrates that taking multiple classification models to improve classification results step-by-step may significantly improve the classification performance. We also evaluate the classification sustainability of BeatClass. Based on different physical signal data sets, a trained BeatClass can be updated to classify heartbeats with different sampling rates. Finally, an engineering application indicates that BeatClass can promote the sustainable development of IoT-based eHealth.

The blend of topics in computational social science enhances the research complexity in developing efficient computational social systems (CSSs). Electronic health (E-health) is a critical branch of CSS. Artificial intelligence-based cognitive computing is especially appropriate for solving E-health problems in social science. The development of the Internet of Things (IoT) and sensor technologies is triggering data explosion in E-health CSS. The IoT-based edge computing has been applied in the field of E-health to reduce the latency of data transmission. However, small edge devices have limited resources (e.g., computational and storage resources). There is an urgent need to develop lightweight and efficient classification models to classify E-health sensor data in edge computing. Automatic health sensor data classification can help medical workers make correct clinical decisions. Also, patient-specific modeling in E-health is important. Using personalized classification model can achieve higher diagnose accuracy than the generic models trained based on historical datasets. To address the above problems, we propose a lightweight personalized sensor data classification model, called LPClass. It embeds the shallow recurrent neural network as a kernel, which makes it lightweight enough to be deployed on edge devices. In addition, a transfer learning algorithm is proposed to build personalized models for individuals. We conduct comprehensive experiments to evaluate LPClass from different aspects. Compared with the generic models, the personalized models in LPClass can achieve a fast convergence rate while maintaining high classification accuracy.

With the development of the Augmented and Virtual Reality (AR/VR) technologies, massive biometric data are collected by different organizations. These data have great significance but also worsen the privacy risks. Electro-CardioGram (ECG)-based Identity Recognition (EIR) is a popular Biometric technology. An ECG record is an internal Biology feature of a person and has time continuity. Thus, compared with traditional Biometric methods like face recognition, EIR may be less vulnerable to attack. We propose an Autoencoder-based EIR system, called Personalized AutoEncoder (PerAE). PerAE maintains a small autoencoder model (called Attention-MemAE) for each registered user of a system. The Attention-MemAE enhances the autoencoder by using a memory module and two attention mechanisms. A user's Attention-MemAE classifies the hearbeats of other users as anomalies. An Attention-MemAE can be updated when the distribution of the user's ECG data is changed. By using personalized autoencoder, PerAE can improve the time efficiency and reduce the memory overhead. It improves the adaptability, scalability, and maintainability of EIR systems. Experiment results show that to train an Attention-MemAE with 90 % identification accuracy for a user, we can just take five minutes to collect the user's ECG data (around 500 heartbeat samples).

Spatial-spectral kernel (SSK) has proven to be one of state-of-the-art tools for producing precise classification results for hyperspectral images (HSIs). However, how to exactly identify the neighborhood pixels within a given cubic patch of HSI is one of the critical tasks for constructing an accurate spatial-spectral kernel (SSK). In this paper, a novel low-rank component induced SSK (LRCISSK) method is proposed to deliver more accurate classification results for HSI. It explores the low-rank properties within each HSI patch in spectral domain to adaptively identify the precise neighborhood pixels with regards to the centroid pixel. Then, the neighborhood pixels associated with the centroid pixel are embedded into the SSK framework to easily map the spectra into the nonlinear complex manifolds and enable the support vector machine (SVM) classifier to effectively discriminate them. Experiments on Indian Pines and Pavia University datasets demonstrate the superiority of the proposed LRCISSK classifier when compared to other state-of-the-art approaches.

There are a variety of well-designed specification-modelling-languages serving Internet services, however, none of them is capable of describing the special features of cloud services, from both technical and business points of view. The Unified Service Description Language (USDL) provides a new way to describe Internet services from business, operational, and technical perspectives. Nevertheless, there are various issues with USDL: it lacks a comprehensive specification model, particularly for cloud services, lacks a user-centric specification modeling paradigm, lacks a mechanism to measure cloud service attributes and to present the association relationship and re-usability of the attributes, and lacks semantic representation of cloud services. Based on the above issues, we propose a unified semantic Cloud Service Description Model (CSDM) in this paper. The proposed model will be extended from the basic structure of USDL, by defining cloud-service-specific attributes. Furthermore, an additional module, named transaction module, will be defined, which models the rating system of cloud services from several aspects, such as risk, trust, and reputation. The transaction module facilitates the capability of CSDM with regard to service ranking, and enhances its flexibility and extensibility by providing an extensible sub-module. In addition, we design an OWL-based annotation system to enrich the semantic expressivity of this model. Finally, a case study is provided to explain the application of this model in actual cloud services.

The tag collision problem is considered as one of the critical issues in RFID system. Recently, bit tracking technology has been proposed for query tree (QT) based protocols to resolve tag collision efficiently. However, the performance of these protocols remain to be improved due to unused collided bits and idle slots. In this paper, a query method Bit query is presented, which requires the tag to respond a mapped bit string instead of its ID sequence. Compared with traditional ID query, it not only can eliminate idle queries, but also can separate collided tags into many small subsets and make full use of the collided bits as well. Based on this method, a novel query tree protocol Bit Query based M-ary Tree (BMQT) protocol is proposed, which recursively resolves collisions by forming a M-ary tree, and optimally switches from Bit query mode to ID query mode for quickly identifying the tags when tag is readable. Theoretical analysis and simulation results show that the system efficiency of BMQT is closed to 0.89, which outperforms the other existing QT-based and hybrid algorithms.

Uncertain data streams have been widely generated in many Web applications. The uncertainty in data streams makes anomaly detection from sensor data streams far more challenging. In this article, we present a novel framework that supports anomaly detection in uncertain data streams. The proposed framework adopts the wavelet soft-thresholding method to remove the noises or errors in data streams. Based on the refined data streams, we develop effective period pattern recognition and feature extraction techniques to improve the computational efficiency. We use classification methods for anomaly detection in the corrected data stream. We also empirically show that the proposed approach shows a high accuracy of anomaly detection on several real datasets.

With the advent of Cloud computing and subsequent big data, online decision makers usually find it difficult to make informed decisions because of the great amount of irrelevant, uncertain, or inaccurate information. In this paper, we explore the application of multicriteria decision-making (MCDM) techniques in the area of Cloud computing and big data, to find an efficient way of dealing with criteria relations and fuzzy knowledge based on a great deal of information. We propose a MCDM framework, which combines the ISM-based and ANP-based techniques, to model the interactive relations between evaluation criteria, and to handle data uncertainties. We present an application of Cloud service selection to prove the efficiency of the proposed framework, in which a user-oriented sigmoid utility function is designed to evaluate the performance of each criterion.

QoS-based service rating has made positive contributions to the area of service selection. Especially for Cloud service users, the right decision when choosing suitable Cloud services can help them improve user satisfaction and trading revenues. This work aims to address the issue of uncertainty in service requests, service descriptions, user and expert preferences, as well as evaluation criteria in a MCDM-based service selection procedure. A hybrid fuzzy framework for Cloud service selection is proposed, addressing the challenge using three approaches: a fuzzy-ontology-based approach for function matching and service filtering, a fuzzy AHP technique for informed criterion weighting, and, a fuzzy TOPSIS approach for service ranking.

Cloud computing is a new paradigm for service-based computing and is gaining popularity. An efficient way for the assurances of the expected service levels in cloud computing is to establish a tailor-made Service Level Agreement (SLA) and to ensure the commitment of SLAs by service providers. In this paper, we conduct a survey of the state of the art in cloud SLA assurance from two aspects -- pre- and post-interaction phases, based on which research gaps in existing approaches are identified. New research requirements for SLA assurance are then presented.