IEEE Transactions on Network Science and Engineering最新文献_第9页

Fully Distributed Adaptive Resilient Control of Networked Heterogeneous Battery Systems With Unknown Parameters 具有未知参数的联网异构电池系统的全分布式自适应弹性控制

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-29 DOI: 10.1109/TNSE.2024.3434957

Yangyang Qian;Zongli Lin;Yacov A. Shamash

{"title":"Fully Distributed Adaptive Resilient Control of Networked Heterogeneous Battery Systems With Unknown Parameters","authors":"Yangyang Qian;Zongli Lin;Yacov A. Shamash","doi":"10.1109/TNSE.2024.3434957","DOIUrl":"10.1109/TNSE.2024.3434957","url":null,"abstract":"We investigate the distributed state-of-charge (SoC) balancing control problem of networked heterogeneous battery systems with unknown battery parameters in the presence of actuator attacks. Existing distributed SoC balancing control algorithms often rely on assumptions such as having homogeneous or known battery parameters, operating under undirected communication topologies and knowing global information of the communication topology, and lack resilience against actuator attacks. In this article, we aim to relax these assumptions by developing a fully distributed adaptive resilient control algorithm for each battery unit. It is shown that under a strongly connected directed communication topology, the control objectives of SoC balancing and proportional power sharing are achieved among battery units with heterogeneous and unknown battery parameters without using any global information, even in the presence of actuator attacks. Through simulation results in MATLAB/Simulink, we validate the effectiveness of the proposed control algorithm in discharging or charging mode and highlight its superiority in enhancing resilience against actuator attacks.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6448-6460"},"PeriodicalIF":6.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141866355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Novel Proactive Cache Decision Algorithm Based on Prior Knowledge and Aerial Cloud Assistance in Internet of Vehicles 车联网中基于先验知识和空中云辅助的新型主动缓存决策算法

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-25 DOI: 10.1109/TNSE.2024.3433544

Geng Chen;Jingli Sun;Yuxiang Zhou;Qingtian Zeng;Fei Shen

{"title":"A Novel Proactive Cache Decision Algorithm Based on Prior Knowledge and Aerial Cloud Assistance in Internet of Vehicles","authors":"Geng Chen;Jingli Sun;Yuxiang Zhou;Qingtian Zeng;Fei Shen","doi":"10.1109/TNSE.2024.3433544","DOIUrl":"10.1109/TNSE.2024.3433544","url":null,"abstract":"In recent years, mobile data has grown explosively due to the rapid development of Internet of Vehicles (IoV). However, resources of IoV are limited, in order to alleviate the problem of resource shortage, it is necessary to combine the resource rich aerial cloud and the ground edge nodes. In order to improve efficiency of proactive cache, we propose a proactive cache decision algorithm based on prior knowledge and aerial cloud assistance. Firstly, we divide requests into two types: content download requests and task calculation requests. Then the dynamic request graph based on relationship between users and requests is constructed, temporal graph network and long short term memory are used to predict prior information and caching benefit function is proposed based on popularity and supplemented by prior information to indicate cache location of request content. Finally, the problem of maximizing cache benefit is proposed and the theoretical solution is obtained using Lagrange multiplier method as well as simulation solution is obtained based on Deep Deterministic Policy Gradient. The simulation results demonstrate that the proposed caching scheme can greatly improve caching efficiency, reduce latency and energy consumption.Compared to D3QN, Dueling DQN, and Double DQN, system revenue of proposed algorithm has increased by 66.65%, 177.71% and 36.08%.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5280-5297"},"PeriodicalIF":6.7,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An Adaptive Pricing Framework for Real-Time AI Model Service Exchange 实时人工智能模型服务交换的自适应定价框架

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-24 DOI: 10.1109/TNSE.2024.3432917

Jiashi Gao;Ziwei Wang;Xuetao Wei

{"title":"An Adaptive Pricing Framework for Real-Time AI Model Service Exchange","authors":"Jiashi Gao;Ziwei Wang;Xuetao Wei","doi":"10.1109/TNSE.2024.3432917","DOIUrl":"10.1109/TNSE.2024.3432917","url":null,"abstract":"Artificial intelligence (AI) model services offer remarkable efficiency and automation, engaging customers across various tasks. However, not all AI consumers possess sufficient data to drive AI model training or the specialized knowledge to construct high-performance AI model structures; this has led to a trend in AI model service transactions, a novel facet of the digital economy. Unlike conventional digital products, AI models undergo performance degradation over time. This phenomenon occurs as the training data becomes outdated, leading to a “distribution shift” away from the target distribution of the most recent downstream tasks. This degradation decreases consumer demand, making the AI model less competitive and lowering provider revenue. In this work, we analyze the impact of performance degradation on consumers' demand for AI model services and propose an adaptive pricing framework for service providers to maximize revenue in real-time AI model service exchange. Specifically, We propose an optimal transport (OT) distance-based approach to estimate model performance degradation effectively. Building on this methodology, we implement several practical solutions for predicting changes in future demand rates resulting from current pricing configurations. We then propose a demand-driven AI model update mechanism for service providers to maintain high product demand rates while reducing retraining AI models' costs. We finally propose a reinforcement learning-based pricing mechanism that facilitates adaptive and rapid pricing responses to achieve revenue maximization. Extensive experiments in both 2-competitor and multi-competitor markets validate our framework, showing a significant revenue advantage over baseline pricing strategies in AI model service transactions.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 5","pages":"5114-5129"},"PeriodicalIF":6.7,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributionally Robust Chance-Constrained Transmission Expansion Planning Using a Distributed Solution Method 使用分布式解决方案的分布式稳健机会约束输电扩展规划

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-23 DOI: 10.1109/TNSE.2024.3432754

Sanaz Mahmoudi;Behnam Alizadeh;Shahab Dehghan

{"title":"Distributionally Robust Chance-Constrained Transmission Expansion Planning Using a Distributed Solution Method","authors":"Sanaz Mahmoudi;Behnam Alizadeh;Shahab Dehghan","doi":"10.1109/TNSE.2024.3432754","DOIUrl":"10.1109/TNSE.2024.3432754","url":null,"abstract":"Determining cost-effective transmission expansion plans in interconnected multi-region power systems requires a computationally tractable methodology that successfully characterizes major uncertainty sources and preserves the information privacy of regions (agents) reasonably. However, previous approaches usually fail to offer computational tractability and preserve privacy reasonably across different regions for multi-regional investment planning under uncertainty. To address these essential points, this paper first proposes a distributionally robust chance-constrained framework for transmission expansion planning (DR-TEP), which characterizes uncertainties of load demands and renewable power productions by a moment-based ambiguity set. The ambiguity set is constructed based on the first- and second-moment information and guarantees the robustness of the expansion plan against different probability distributions. Then, the alternating direction method of multipliers with a novel data exchange scheme is utilized to reformulate the proposed DR-TEP for each region with a central coordinator concerning local characteristics and interactions. The proposed information exchange is limited to power flows through existing and candidate inter-regional lines, Lagrangian multipliers, as well as output powers of thermal units to protect each region's privacy reasonably. Finally, three case studies on IEEE 24-bus and 118-bus test systems as well as the real-world Brazilian system validate the performance of the presented mathematical formulations.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6431-6447"},"PeriodicalIF":6.7,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

LURK-T: Limited Use of Remote Keys With Added Trust in TLS 1.3 LURK-T：TLS 1.3 中增加信任的远程密钥的有限使用

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-23 DOI: 10.1109/TNSE.2024.3432836

Behnam Shobiri;Sajjad Pourali;Daniel Migault;Ioana Boureanu;Stere Preda;Mohammad Mannan;Amr Youssef

{"title":"LURK-T: Limited Use of Remote Keys With Added Trust in TLS 1.3","authors":"Behnam Shobiri;Sajjad Pourali;Daniel Migault;Ioana Boureanu;Stere Preda;Mohammad Mannan;Amr Youssef","doi":"10.1109/TNSE.2024.3432836","DOIUrl":"10.1109/TNSE.2024.3432836","url":null,"abstract":"In many web applications, such as Content Delivery Networks (CDNs), TLS credentials are shared, e.g., between the website's TLS origin server and the CDN's edge servers, which can be distributed around the globe. To enhance the security and trust for TLS 1.3 in such scenarios, we propose LURK-T, a provably secure framework which allows for limited use of remote keys with added trust in TLS 1.3. We efficiently decouple the server side of TLS 1.3 into a LURK-T Crypto Service (\u0000<inline-formula><tex-math>$mathit {CS}$</tex-math></inline-formula>\u0000) and a LURK-T Engine (\u0000<inline-formula><tex-math>$mathit {E}$</tex-math></inline-formula>\u0000). \u0000<inline-formula><tex-math>$mathit {CS}$</tex-math></inline-formula>\u0000 executes all cryptographic operations in a Trusted Execution Environment (TEE), upon \u0000<inline-formula><tex-math>$mathit {E}$</tex-math></inline-formula>\u0000’s requests. \u0000<inline-formula><tex-math>$mathit {CS}$</tex-math></inline-formula>\u0000 and \u0000<inline-formula><tex-math>$mathit {E}$</tex-math></inline-formula>\u0000 together provide the whole TLS-server functionality. A major benefit of our construction is that it is application agnostic; the LURK-T Crypto Service could be collocated with the LURK-T Engine, or it could run on different machines. Thus, our design allows for in situ attestation and protection of the cryptographic side of the TLS server, as well as for all setups of CDNs over TLS. To support such a generic decoupling, we provide a full Application Programming Interface (API) for LURK-T. To this end, we implement our LURK-T Crypto Service using Intel SGX and integrate it with OpenSSL. We also test LURK-T's efficiency and show that, from a TLS-client's perspective, HTTPS servers using LURK-T instead a traditional TLS-server have no noticeable overhead when serving files greater than 1 MB. In addition, we provide cryptographic proofs and formal security verification using ProVerif.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6313-6327"},"PeriodicalIF":6.7,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced Emergency Communication Services for Post–Disaster Rescue: Multi-IRS Assisted Air-Ground Integrated Data Collection 增强灾后救援应急通信服务：多红外系统辅助空地一体化数据收集

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-23 DOI: 10.1109/TNSE.2024.3432746

Yi Zhou;Zhanqi Jin;Huaguang Shi;Lei Shi;Ning Lu;Mianxiong Dong

{"title":"Enhanced Emergency Communication Services for Post–Disaster Rescue: Multi-IRS Assisted Air-Ground Integrated Data Collection","authors":"Yi Zhou;Zhanqi Jin;Huaguang Shi;Lei Shi;Ning Lu;Mianxiong Dong","doi":"10.1109/TNSE.2024.3432746","DOIUrl":"10.1109/TNSE.2024.3432746","url":null,"abstract":"Cellular networks are difficult to meet emergency rescue due to the destruction of base stations and infrastructure caused by natural disasters. Unmanned Ground Vehicles (UGVs) and other mobile communication devices encounter significant challenges when operating in disaster areas due to limited coverage and resources. To tackle this problem, this paper integrates Unmanned Aerial Vehicles (UAVs) into the emergency communication network and constructs an air-ground integration network architecture with UAV-UGV collaboration. Specifically, multi-UGV collaborate to collect disaster information, and multi-aerial intelligent reflecting surfaces with high maneuverability can effectively assist UGVs in transmitting the collected data to the remote control center. However, there is also a serious challenge to optimize the collaboration strategy between UGVs and UAVs. To address the concern, the collaboration between UAVs and UGVs is modeled as bipartite graph, where UAVs and UGVs belong to different sets of nodes, respectively. The problem is transformed into a matching game based on the bipartite graph. A stable Bidirectional Matching Game (BMG) algorithm is proposed, where matching players maximize the utility by adjusting the selection strategy. Extensive experimental results show that the proposed BMG algorithm outperforms other benchmark algorithms in terms of utility for both UAVs and UGVs.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 5","pages":"4651-4664"},"PeriodicalIF":6.7,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Hybrid Multi-Server Computation Offloading in Air–Ground Vehicular Networks Empowered by Federated Deep Reinforcement Learning 由联合深度强化学习驱动的空地车载网络中的混合多服务器计算卸载

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-23 DOI: 10.1109/TNSE.2024.3432765

Xiaoqin Song;Quan Chen;Shumo Wang;Tiecheng Song;Lei Xu

{"title":"Hybrid Multi-Server Computation Offloading in Air–Ground Vehicular Networks Empowered by Federated Deep Reinforcement Learning","authors":"Xiaoqin Song;Quan Chen;Shumo Wang;Tiecheng Song;Lei Xu","doi":"10.1109/TNSE.2024.3432765","DOIUrl":"10.1109/TNSE.2024.3432765","url":null,"abstract":"The proliferation of computation-intensive and delay-sensitive services in intelligent transportation systems, such as autonomous driving and vehicle-mounted infotainment services, presents a significant challenge for vehicular users (VUs) with limited resources. To address this issue, multi-access edge computing (MEC) has been considered a favorable solution to mitigate computation delay. This paper considers computation offloading for an air-ground integrated computing platform in vehicular networks. Specifically, we first propose a multi-agent twin delayed deep deterministic policy gradient (MATD3) algorithm to optimize the trajectory of UAVs. Then, an algorithm named federated upgraded dueling double deep Q network (FUD3QN) is proposed to meet quality of service (QoS) requirements. The algorithm allocates cross-domain resources after offloading decision-making, aiming to minimize delay and energy consumption while meeting reliability requirements, maximum tolerable delay, communication requirements, and computing limitations. Addressing the non-deterministic polynomial (NP)-hard problem, we employ a multi-agent federated learning and upgraded dueling double deep Q network algorithm (UD3QN) with centralized training and distributed execution. Simulation results illustrate that the MATD3-FUD3QN algorithm proposed significantly surpasses the baselines, highlighting the advantages of introducing UAVs to enhance transmission quality.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"5175-5189"},"PeriodicalIF":6.7,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Aperiodically Intermittent Pinning Event-Triggered Synchronization of Stochastic Heterogeneous Complex Networks 随机异构复杂网络的非周期性间歇引脚事件触发同步化

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-18 DOI: 10.1109/TNSE.2024.3428869

Dongsheng Xu;Chao Li;Xufan Wang;Huan Su

引用次数: 0

Novel Blockchain-Integrated Quantum-Resilient Self-Certified Authentication Protocol for Cross-Industry Communications 用于跨行业通信的新型区块链集成量子弹性自我认证协议

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-16 DOI: 10.1109/TNSE.2024.3428916

Hadi Ghaemi;Dariush Abbasinezhad-Mood

{"title":"Novel Blockchain-Integrated Quantum-Resilient Self-Certified Authentication Protocol for Cross-Industry Communications","authors":"Hadi Ghaemi;Dariush Abbasinezhad-Mood","doi":"10.1109/TNSE.2024.3428916","DOIUrl":"10.1109/TNSE.2024.3428916","url":null,"abstract":"The Fourth Industrial Revolution (4IR) aims at improving the manufacturing cost and quality by inter-connection of Industrial Internet of Things (IIoT) devices. In the 4IR, IIoT-based machines need to collaborate securely and autonomously through the insecure Internet channel. Although various blockchain-based protocols have been introduced for securing cross-industry Machine-to-Machine (M2M) communications, they, are insecure to some cyberattacks, rely on some intermediary servers for successful M2M authentication, are not efficient enough to be employed in the context of IIoT environments, and are not resilient to quantum computers. To address these weaknesses, this paper suggests a novel quantum-resilient self-certified authentication protocol for cross-industry communications using the cutting-edge blockchain technology. Thanks to the blockchain ledger, the cross-industry connections have been facilitated and thanks to the self-certified approach, the blockchain referrals have been reduced to only one ledger reading. In our protocol, no intermediary server needs to involve and IIoT machines can directly authenticate each other. The advantages and efficiency enhancements of our protocol, compared to top-related ones, are shown, respectively, by comparative property and performance analyses. Specifically, our protocol indicates 13% and 91% improvements in communication and computation overheads over the most efficient protocol.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 5","pages":"4493-4502"},"PeriodicalIF":6.7,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141721549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Pushing the Performance Limits of Datacenter Networks With Fine-Grained Priority Assignment 利用细粒度优先级分配提升数据中心网络的性能极限

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2024-07-16 DOI: 10.1109/TNSE.2024.3429402

Rui Zhuang;Jiangping Han;Kaiping Xue;Jian Li;David S.L. Wei;Ruidong Li;Qibin Sun;Jun Lu

{"title":"Pushing the Performance Limits of Datacenter Networks With Fine-Grained Priority Assignment","authors":"Rui Zhuang;Jiangping Han;Kaiping Xue;Jian Li;David S.L. Wei;Ruidong Li;Qibin Sun;Jun Lu","doi":"10.1109/TNSE.2024.3429402","DOIUrl":"10.1109/TNSE.2024.3429402","url":null,"abstract":"Priority plays a crucial role in distinguishing the diverse demands of applications and improving the performance of underlying networks. However, application-provided priority is insufficient to cope with wide variations in traffic characteristics and dynamic network conditions. When assigning priorities to flows, existing proposals are limited to constrained dimensions, rendering them inadequate for accurately and rapidly identifying flow importance. To address this problem, we present Firapam, a novel priority assignment strategy that systematically combines important traffic states to achieve fine-grained and dynamic priority assignments. Firapam employs convex optimization to adaptively respond to changes in requirements and the environment, and implements admission control for flow priority in a distributed manner. Consequently, Firapam significantly reduces the flow completion time and deadline miss rate. We analytically and experimentally demonstrate that Firapam can effectively support existing priority assignments with significant performance improvements. Compared to state-of-the-art priority assignment methods, Firapam exhibits a remarkable decrease in deadline miss rate by 14.5% to 52.3%, across diverse traffic patterns. Moreover, it reduces the flow completion tail by 17.9% and ensures a minimum reduction of 72.3% in deadline miss rate under high network loads.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"11 6","pages":"6298-6312"},"PeriodicalIF":6.7,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141721550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0