18 May 2020 in IEEE Access
Aspect-level sentiment classification is a fine-grained task in sentiment analysis. In recent years, researchers have realized the importance of the relationship between aspect term and sentence and many classification models based on deep learning network have been proposed. However, these end-to-end deep neural network models lack flexibility and do not consider the sentiment word information in existing meth-ods. Therefore, we propose a lexicon-enhanced attention network (LEAN) based on bidirectional LSTM. LEAN not only can catch the sentiment words in a sentence but also concentrate on specific aspect infor-mation in a sentence. Moreover, leveraging lexicon information will enhance the model’s flexibility and ro-bustness. We experiment on the SemEval 2014 dataset and results find that our model achieves state-of-the-art performance on aspect-level sentiment classification.
23 September 2022 in Peer-to-Peer Networking and Applications
9 December 2022 in IEEE Internet of Things Journal
When degradation occurs in a dispersed computing network, mitigating the persistent effects of failures and improving the disposal efficiency is an open problem. However, the occurrence of failed nodes in a dispersed computing network is a random and low-probability incident. Further, the resilient resources for emergency allocation are from devices with complex spatial locations in practice. These factors pose challenges to the resource allocation problem using resilience mechanisms. In this article, we explore and analyze a resilience mechanism for dispersed computing networks as an optimization model. We investigate a resilience-aware dynamic resource allocation model to cope with a degraded dispersed computing network and obtain better emergency response at a lower cost. The uncertainties of node failures are uniquely explored to capture failure nodes more precisely and initiate the resilience mechanism for such nodes. In addition, we propose a novel approach to deal with the dynamic and complex coupling characteristics of decision variables in the model. This approach incorporates the induced artificial fish swarm algorithm with dynamic system simulation to generate and improve the scheme for the allocation of resilient resources. Finally, numerical simulation results verify the improved performance of our model and the effectiveness of the algorithm.
8 November 2023 in IEEE Internet of Things Journal
Dense low-power small cell base station (SBS)-based heterogeneous wireless cellular networks (HetNets) have attracted much attention to achieving high-traffic density and peak rate performance. However, the serious energy consumption problem is still a challenge for HetNets. The use of renewable energy (RE) has been considered as one promising solution for the above problem. This article proposes an energy trading scheme among base stations in RE-based HetNets. All SBSs in HetNets are considered as either the energy demander (SBS-ED) or the energy supplier (SBS-ES) based on their abilities in producing RE, and the macro base station (MBS) works as the energy trading manager to control the trading price. A dynamic evolutionary game-based energy trading model between SBS-ES and SBS-ED is established to achieve cooperative energy trading, and the evolutionary stable strategy (ESS) of the proposed model is analyzed. The pricing mechanism of MBS is also investigated, which can effectually affect the EES performance of the proposed model. It is concluded that the MBS’s strategy in the trading price can affect the energy trading strategies of the SBSs. An energy transmission model is proposed, and the minimum energy loss is considered as the goal to obtain the optimal solutions. Numerical results are given to prove the validity and correctness of our proposed method.
5 November 2025 in IEEE Internet of Things Journal
Dispersed computing has provided an important computing paradigm for task offloading and resource allocation of intelligent connected vehicles (ICVs), which can improve the processing efficiency of ICV applications. This article investigates task offloading and resource allocation in ICV scenarios based on dispersed computing. To maximize the efficiency of the computation process of ICV applications, a two-stage optimization model based on a directed task graph is established. We have formulated the optimization problem of task offloading and resource allocation in dispersed computing networks. Then, we prove that the proposed problem is NP-hard by reducing it to the soft-capacity facility location problem (SCFLP). To reduce the complexity of solving, we decompose the proposed problem into two subproblems: task offloading and resource optimization. We first propose a dynamic sorting (DS) algorithm to solve the task offloading problem, using the resources obtained from the previous iteration to solve the task offloading subproblem and obtain the task placement result. Meanwhile, we consider two types of ICV applications with different processing efficiency requirements and design a low-complexity heuristic algorithm (black-headed gulls optimization (BGO) algorithm) to solve the resource optimization problem. Furthermore, we design the numerical simulations and scalability experiments to verify the effectiveness and scalability of the proposed scheme. Compared to baseline schemes, our algorithm can effectively reduce CPU utilization by 14.3%, memory utilization by 5.1%, and processing time by 8.7%. In special scenarios, the processing efficiency is better than baseline schemes by at least 6.85% and 23.79%. The proposed scheme effectively mitigates performance bottlenecks caused by application heterogeneity and network dynamics, thereby improving resource utilization and processing efficiency for heterogeneous ICV applications.
1 January 2024 in Computers, Materials & Continua
With the development of vehicles towards intelligence and connectivity, vehicular data is diversifying and growing dramatically. A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle (ICV) applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points (NCPs). Considering the amount of task data and the idle resources of NCPs, a computing resource scheduling model for NCPs is established. Taking the heterogeneous task execution delay threshold as a constraint, the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs. The proposed problem is proven to be NP-hard by using the method of reduction to a 0–1 knapsack problem. A many-to-many matching algorithm based on resource preferences is proposed. The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs. This enables the filtering out of un-schedulable NCPs in the initial stage of matching, reducing the solution space dimension. To solve the matching problem between ICVs and NCPs, a new many-to-many matching algorithm is proposed to obtain a unique and stable optimal matching result. The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6% compared to the reference scheme, and the total performance can be improved by up to 15.9%.