6 January 2020 in IEEE Transactions on Transportation Electrification
Electric vehicles (EV’s), as part of the sustainable transport, are believed to be helpful to reduce global warming. In this paper, we focus on the fast charging station (FCS) deployment problem, which is one of the key issues of EV ecosystem. Specifically, elastic demand is considered, i.e., charging demand will be suppressed either because of long driving distance to get charging or long waiting time at the station. A fixed-point equation is proposed to capture the nature of EV users’ charging behavior. It takes into consideration both spatial and temporal penalty by establishing a connection between the resulting arrival rate and a combination of driving distance and waiting time. We formulate the FCS deployment problem as a nonlinear integer problem, which seeks to figure out the optimal locations to build FCS’s and the optimal number of charging piles of each selected FCS. A Genetic-Algorithm-based heuristic algorithm is adopted to tackle the problem. Simulation results prove the effectiveness of our proposed algorithm. The importance of a match between the power grid capacity and the amount of charging demand is revealed, both in terms of increasing profit and reducing outage probability.
26 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Hyperbolic space based collaborative filtering has emerged as a popular topic in recommender systems. Compared to the euclidean space, hyperbolic space is more suitable to the tree- like structures in the user-item interactions and can achieve better recommender performance. Although some works have been devoted to this popular topic and made some progresses, they use tangent space as an approximation of hyperbolic space to implement model. Despite the effectiveness, such methods fail to fully exploit the advantages of hyperbolic space and still suffer from the data sparsity issue, which severely limits the recommender performance. To tackle these problems, we refer to the self-supervised learning technique and novelly propose a Hyper bolic Graph C ontrastive L earning ( HyperCL ) framework. Specifically, our framework encodes the augmentation views from both the tangent space and the hyperbolic space, and construct the contrast pairs based on their corresponding learned node representations. Our model not only leverages the geometric advantages of both sides but also achieves seamless information transmission between the two spaces. Extensive experimental results on public benchmark datasets demonstrate that our model is highly competitive and outperforms leading baselines by considerable margins. Further experiments validate the robustness and the superiority of contrastive learning paradigm.
22 August 2018 in IEEE Transactions on Wireless Communications
Cache-enabled wireless networks have gained increasing popularity in recent years for facilitating the delivery of content. Most existing works assumed that the network is static without the change of users and content, which is not the case in the real world. In this paper, we study the content delivery in cache-enabled wireless networks, where the network evolves in terms of users and content. We adopt the affiliation network model to reveal the network evolution process, where new users and content are added into the network randomly and connected with existing nodes via the preferential attachment. Users with strong social relations tend to request the same content objects, thus content popularity is sharply concentrated. Therefore, caching technique is more effective. To maximize the content delivery rate, we formulate the optimization problem of caching replication jointly with routing strategy. We show that network evolution can greatly improve the content delivery rate. In particular, when per-user cache capacity is in the order of Θ(1), per-user delivery rate can achieve constant, i.e., the network can scale. Finally, theoretical results are validated based on a real-world data set from Facebook.
25 September 2024 in Information Processing & Management
7 February 2024 in IEEE Transactions on Computational Social Systems
Diversified recommendation systems have gained increasing popularity in recent years. Nowadays, the emerged graph neural networks (GNNs) have been used to improve the diversity performance. Although some progresses have been made, existing works purely focus on the user–item interactions and overlook the category information, which limits the capability to capture complex diversification among users or items and leads to poor performance. In this article, our target is to integrate full category information into user and item embeddings. To this end, we propose a diversified GNN-based recommendation systems diversified graph recommendation with contrastive learning (DCL). Specifically, we design three key components in our model: 1) the user–item interaction with category-related sampling enhances the interaction of unpopular items; 2) contrastive learning between users and categories shortens the distance of representations between users and their uninteracted categories; and 3) contrastive learning between items and categories diverges the distance of representations between items and their corresponding categories. By applying these three modules, we build a multitask training framework to achieve a balance between accuracy and diversity. Experiments on real-world datasets show that our proposed DCL achieves optimal diversity while paying a little price for accuracy.