Journal of Network and Computer Applications最新文献_第3页

CASLO: Joint scaling and deployment for microservices leveraging context-aware SLO assignment CASLO：利用上下文感知的SLO分配来联合扩展和部署微服务

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-03-01 Epub Date: 2025-12-19 DOI: 10.1016/j.jnca.2025.104417

Shuang Zeng, Haitao Zhang, Zezhong Yan

{"title":"CASLO: Joint scaling and deployment for microservices leveraging context-aware SLO assignment","authors":"Shuang Zeng, Haitao Zhang, Zezhong Yan","doi":"10.1016/j.jnca.2025.104417","DOIUrl":"10.1016/j.jnca.2025.104417","url":null,"abstract":"<div><div>Service Level Objective (SLO) assignment involves distributing an application’s end-to-end latency SLO among its microservices, guiding each microservice’s resource allocation based on its assigned sub-SLO. However, existing SLO assignment methods primarily focus on horizontal scaling, overlooking the significant impact of varying resource usage contexts across nodes and container configurations on microservice latency characteristics. Moreover, these methods fail to consider how scaling decisions affect node resource usage. This oversight creates discrepancies between decision-time and runtime latency characteristics, which can lead to SLO violations or resource wastage. This paper proposes CASLO, a joint scaling and deployment method based on context-aware SLO assignment that aims to meet application SLOs with minimal resource usage. It characterizes microservice latency by categorizing influencing factors into node and container contexts, which enables the model to capture dynamic performance under varying conditions. Building on this characterization, CASLO employs Particle Swarm Optimization (PSO) to iteratively estimate each microservice’s tolerance to contextual resource conditions. For each tolerance, it determines the resource usage of each node post-scaling and deployment, addressing discrepancies of latency characteristics between decision-time and runtime and distinguishing latency characteristics across nodes. Based on the determined resource context, CASLO assigns SLOs to each microservice, dynamically configuring container resources to derive scaling and deployment decisions. Resource usage is then calculated to provide feedback to PSO for iterative optimization. Compared to state-of-the-art methods, CASLO achieves 32% reduction in resource usage and decreases the frequency of SLO violations by 61%.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"247 ","pages":"Article 104417"},"PeriodicalIF":8.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145785050","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

DACS: Distributed adjustable computation scheme in highly scalable data center networks based on multi-protection routing DACS：基于多保护路由的高可扩展数据中心网络分布式可调计算方案

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-03-01 Epub Date: 2025-12-24 DOI: 10.1016/j.jnca.2025.104425

Wanling Lin , Jou-Ming Chang , Xiao-Yan Li

{"title":"DACS: Distributed adjustable computation scheme in highly scalable data center networks based on multi-protection routing","authors":"Wanling Lin , Jou-Ming Chang , Xiao-Yan Li","doi":"10.1016/j.jnca.2025.104425","DOIUrl":"10.1016/j.jnca.2025.104425","url":null,"abstract":"<div><div>In data center networks (DCNs), many value-added services involving multiple tenants and distributed sites can be naturally modeled as multi-party communication (MPC) processes, where participants exchange information across infrastructures to support collaborative computation. For MPC, it usually ensures that the private data of the multiple parties involved in the collaborative computation are safe, the computational results maintain acceptable accuracy, and all participants are in the same fair position in a distributed environment. This article considers an unexplored application based on MPC called the distributed adjustable computation scheme (DACS), which allows computation to be invoked when the collected data reaches a specified threshold in the communication. We developed a distributed algorithm using secure multi-protection routing to enable DACS. The proposed algorithm guarantees that each private data can be successfully delivered to the desired recipient even if any faulty component (including server or link) exists in the network. Also, no other than the destination can receive the complete private data. We implement DACS on highly scalable data center networks. Through simulation, experimental results show that DACS is highly reliable and achieves high security efficiency.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"247 ","pages":"Article 104425"},"PeriodicalIF":8.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145823154","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

The DPC-LSTM-MD scheme for detecting selective forwarding attack under variable environment in event-driven wireless sensor networks 事件驱动无线传感器网络中可变环境下选择性转发攻击检测的DPC-LSTM-MD方案

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-03-01 Epub Date: 2025-12-29 DOI: 10.1016/j.jnca.2025.104411

Yilun Ma, Yuanming Wu

{"title":"The DPC-LSTM-MD scheme for detecting selective forwarding attack under variable environment in event-driven wireless sensor networks","authors":"Yilun Ma, Yuanming Wu","doi":"10.1016/j.jnca.2025.104411","DOIUrl":"10.1016/j.jnca.2025.104411","url":null,"abstract":"<div><div>In an event-driven wireless sensor network (EWSN), events occur randomly, prompting sensor nodes within the event area to detect and transmit data packets to a sink via router nodes (RNs) through multi-hop communication. Some RNs, referred to as malicious nodes, may launch selective forwarding attacks by selectively dropping part or all of the received packets. Additionally, harsh environmental conditions can degrade channel quality, sometimes forcing RNs to abandon forwarding data packets. Under these conditions, it becomes challenging to distinguish malicious nodes from normal nodes solely based on their packet forwarding rates. To address this issue, we propose the DPC-LSTM-MD scheme to detect selective forwarding attacks. This approach utilizes the time series of nodes’ packet forwarding behaviors as a dataset. The Density Peaks Clustering (DPC) method is employed to extract features representative of normal node behavior. Subsequently, a Long Short-Term Memory (LSTM) network predicts the single round forwarding rate (SFR) of nodes in the next time series interval. Based on the prediction error, we apply the minimum density (MD) method combined with the 3-sigma rule to identify and isolate malicious nodes. Our results demonstrate that the DPC-LSTM-MD scheme achieves a low false detection rate (FDR) of 2% and a low missed detection rate (MDR) of 3%, significantly improving network throughput.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"247 ","pages":"Article 104411"},"PeriodicalIF":8.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145893775","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 digital twin-based reputation assessment model for JointCloud computing 基于数字孪生的联合云计算信誉评估模型

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-11-24 DOI: 10.1016/j.jnca.2025.104395

Yadi Wu , Lina Wang , Rongwei Yu , Xiuwen Huang , Jiatong Liu

{"title":"A digital twin-based reputation assessment model for JointCloud computing","authors":"Yadi Wu , Lina Wang , Rongwei Yu , Xiuwen Huang , Jiatong Liu","doi":"10.1016/j.jnca.2025.104395","DOIUrl":"10.1016/j.jnca.2025.104395","url":null,"abstract":"<div><div>JointCloud Computing (JCC) supports a collaborative model of multiple cloud service providers to provide users with robust performance and adequate services. Reputation is an important aspect for the stable development of the JCC system, affecting the cooperation among service providers and users’ choice of services. Most of the existing reputation assessment solutions only consider a single factor of user feedback or service quality, and cannot provide an accurate reputation assessment for the complex system of JCC. In addition, JointCloud services are provided by multiple service providers in cooperation, and existing solutions do not consider this service characteristic, making it difficult to accurately measure the reputation of the service. In order to provide a comprehensive reputation assessment for JCC, we proposed a reputation assessment model based on digital twins. A reputation calculation module is embedded in the digital twin, and a hybrid subjective–objective-based reputation assessment method and a split-integration-based reputation assessment method are designed for different JointCloud subjects to achieve a comprehensive and accurate reputation assessment. We conducted a series of experiments to evaluate the performance of the proposed reputation evaluation model and present the experimental results. The proposed method achieves a reputation assessment bias of 0.0112, which reduces the average bias by 0.2184 compared to existing researches. In real-world scenarios, the proposed model incurs a communication overhead of 93.7735 ms, with a digital twin data acquisition frequency of 36.4273 ms. The evaluation results show that our reputation evaluation model is feasible in terms of performance and accuracy.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104395"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145593076","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 robust eclipse attack detection framework for Ethereum networks 一个健壮的eclipse攻击检测框架用于以太坊网络

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-12-19 DOI: 10.1016/j.jnca.2025.104416

Zubaida Rehman , Iqbal Gondal , Hai Dong , Mengmeng Ge , Mark A. Gregory , Ikram ul Haq

{"title":"A robust eclipse attack detection framework for Ethereum networks","authors":"Zubaida Rehman , Iqbal Gondal , Hai Dong , Mengmeng Ge , Mark A. Gregory , Ikram ul Haq","doi":"10.1016/j.jnca.2025.104416","DOIUrl":"10.1016/j.jnca.2025.104416","url":null,"abstract":"<div><div>Eclipse attacks, which isolate victim nodes by monopolizing their peer connections, remain a critical threat to Ethereum’s consensus mechanism. To address this, we present a principled framework for detecting Eclipse attacks in Ethereum peer-to-peer networks, grounded in a formal adversarial model. Existing defenses are either ad-hoc or lack provable guarantees, leaving open questions about their reliability under adaptive adversaries. Our work aims to bridge this gap by formally defining eclipse attack detection as a security property. We specify soundness, completeness, and robustness theorems under bounded adversarial drift, and derive formal guarantees within false positive and false negative bounds, resilience to adversarial manipulation, and multi-node compositional reliability. We then instantiate a lightweight detection framework that maps packet-level traffic features to predictions using ensemble classifiers (Random Forest, XGBoost). The system was validated using a controlled Ethereum testbed and extended with CTGAN-generated synthetic traces to emulate networks of up to 100 nodes. Empirical evaluation shows that our framework achieves up to 96% F1-score with sub-second inference latency, well within Ethereum’s 12-second Proof-of-Stake validator time slots. These findings demonstrate that lightweight statistical features, when coupled with formal analysis, enable accurate, efficient, and scalable detection of network-level partitioning attacks. Our work establishes a deployable and theoretically grounded defense foundation for securing modern blockchain systems against eclipse adversaries.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104416"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145785055","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

BlackoutADR: Exploiting adaptive data rate vulnerabilities in LoRaWAN-based FANETs BlackoutADR：利用基于lorawan的fanet中的自适应数据速率漏洞

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-12-08 DOI: 10.1016/j.jnca.2025.104409

Khaoula Hidawi , Sabrine Ennaji , Elena Ferrari

引用次数: 0

Network-assisted relay selection in mmWave D2D communication under presence of dynamic obstacles with unknown orientation 存在未知方向动态障碍物的毫米波D2D通信中网络辅助中继选择

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-12-15 DOI: 10.1016/j.jnca.2025.104394

Durgesh Singh , Sasthi C. Ghosh

{"title":"Network-assisted relay selection in mmWave D2D communication under presence of dynamic obstacles with unknown orientation","authors":"Durgesh Singh , Sasthi C. Ghosh","doi":"10.1016/j.jnca.2025.104394","DOIUrl":"10.1016/j.jnca.2025.104394","url":null,"abstract":"<div><div>Millimeter wave (mmWave) D2D communication is highly vulnerable to blockages from dynamic obstacles leading to severe packet loss and deterioration in quality of service. User equipments (UEs) acting as relays are chosen to divert the communication path in case of blockage. However, relays themselves are vulnerable to be blocked due to their and obstacles’ motion. Thus mobility parameters of dynamic obstacles must be captured effectively, but it is challenging as they might not be connected to the network. Additionally, instantaneous change in their orientation in motion is difficult to measure which might vary abruptly compared to their speed which can be sensed with high accuracy. A probabilistic model is developed considering the obstacle’s orientation in motion is <em>unknown</em>. Later the geometrical structure of the problem is analyzed and then exploited to devise a novel technique to derive closed form blockage expression for a given pair of UE. The proposed technique can be applied across exhaustive scenarios of motion of a given UE pair which may get blocked due to dynamic obstacles. Through extensive simulations, we have observed that our proposed approach outperforms both classical received signal strength (RSS) based approach and two recent state of the art approaches. We have also validated our results against an oracle which has complete speed and orientation information regarding UEs and obstacles.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104394"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760433","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

PE-Chain: An efficient hierarchical sharding architecture for dynamically participating node models PE-Chain：用于动态参与节点模型的高效分层分片架构

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-12-19 DOI: 10.1016/j.jnca.2025.104415

Junfeng Tian , Yujian Wu , Jin Tian , Liuling Qi

{"title":"PE-Chain: An efficient hierarchical sharding architecture for dynamically participating node models","authors":"Junfeng Tian , Yujian Wu , Jin Tian , Liuling Qi","doi":"10.1016/j.jnca.2025.104415","DOIUrl":"10.1016/j.jnca.2025.104415","url":null,"abstract":"<div><div>Sharding is a widely adopted technique for enhancing blockchain scalability by partitioning the network into multiple sub-shards, thereby distributing the workload. However, traditional dynamic sharding schemes often suffer from delayed adjustments to the shard count, hindering rapid convergence to an optimal workload distribution in practical deployments and limiting overall scalability. Furthermore, the dynamic participation of nodes is frequently overlooked. To address these challenges, this paper proposes PolyembryonyChain (PE-Chain), a novel and efficient hierarchical sharding architecture designed for environments with dynamically participating nodes, with the goal of achieving elastic scalability. Its core innovations are twofold. First, it introduces a dynamic threshold sharding algorithm that adaptively adjusts the number of shards and optimizes the network topology to enable elastic expansion. Second, it incorporates a validator assignment and reconfiguration scheme, specifically tailored for dynamic hierarchical environments, to ensure system security. A comprehensive security analysis and simulation results demonstrate that PE-Chain significantly outperforms state-of-the-art baselines, achieving approximately 28% higher throughput while maintaining low latency, which underscores its superior scalability and practical value.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104415"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145785051","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

ARProof: A cross-protocol approach to detect and mitigate ARP-spoofing attacks in smart home networks ARProof：一种在智能家庭网络中检测和减轻arp欺骗攻击的跨协议方法

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-11-24 DOI: 10.1016/j.jnca.2025.104396

Md Mizanur Rahman , Faycal Bouhafs , Sayed Amir Hoseini , Frank den Hartog

{"title":"ARProof: A cross-protocol approach to detect and mitigate ARP-spoofing attacks in smart home networks","authors":"Md Mizanur Rahman , Faycal Bouhafs , Sayed Amir Hoseini , Frank den Hartog","doi":"10.1016/j.jnca.2025.104396","DOIUrl":"10.1016/j.jnca.2025.104396","url":null,"abstract":"<div><div>Smart homes are increasingly vulnerable to cyberattacks that lead to network instability, causing homeowners to lodge complaints with their Broadband Service Providers (BSPs). Therefore, effective and timely detection of cyberattacks is crucial for both customers and BSPs. Address Resolution Protocol (ARP) spoofing is one of the most common attacks that can facilitate larger and more severe follow-up attacks. Unfortunately, there are currently no methods that can effectively detect and mitigate ARP spoofing in smart homes from a BSP’s perspective. Current Machine Learning (ML)-based methods often rely on a single dataset from a controlled lab environment designed to mimic a single home, assuming that the results will generalize to all smart homes. Our findings indicate that this assumption is flawed. They are also unsuitable for smart homes from a BSP’s perspective, as they require custom applications, introduce additional overhead, and often rely on the injection of probing traffic into the network. To address these issues, we developed an algorithm that can detect ARP spoofing in smart home networks, regardless of the network structure or connected devices. It uses a cross-protocol strategy by correlating ARP packets with Dynamic Host Configuration Protocol (DHCP) messages to validate address bindings. We evaluated our method using four public datasets and two real-world testbeds, achieving 100% detection accuracy in all scenarios. In addition, the algorithm requires only little computational overhead, confirming its suitability for use by BSPs to detect and mitigate ARP spoofing attacks in smart homes.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104396"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145593077","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

SELB: Self-Evolution Load Balancing Based on Temporal Graph Convolutional Network in Software-Defined Data Center Networks 软件定义数据中心网络中基于时间图卷积网络的自进化负载平衡

IF 8 2区计算机科学

Journal of Network and Computer Applications Pub Date : 2026-02-01 Epub Date: 2025-12-02 DOI: 10.1016/j.jnca.2025.104401

Yong Liu , Guisheng Liu , Tianyi Yu , Qian Meng

{"title":"SELB: Self-Evolution Load Balancing Based on Temporal Graph Convolutional Network in Software-Defined Data Center Networks","authors":"Yong Liu , Guisheng Liu , Tianyi Yu , Qian Meng","doi":"10.1016/j.jnca.2025.104401","DOIUrl":"10.1016/j.jnca.2025.104401","url":null,"abstract":"<div><div>Software-Defined Networking (SDN) is a network architecture that separates the control plane and data plane of the traditional data center network, resulting in enhanced network scalability and flexibility. The conventional Equal Cost MultiPath (ECMP) load balancing algorithm, which relies on static hash mapping, has limitations when applied to data center networks, leading to issues such as hash conflicts and congestion between mouse and elephant flows. Therefore, load balancing based on flowlet granularity has been proposed. This approach divides flows into flowlets, leveraging the burstiness of traffic to enhance load balancing capabilities. However, these approaches encounter several challenges, such as the lack of real-time feedback on network load situations, the inability of static flowlet timeouts to adapt to dynamic changes in the network, and inadequate consideration of load distribution. To address these challenges, we propose a novel load balancing strategy called Self-Evolution Load Balancing (SELB) based on Temporal Graph Convolutional Network (T-GCN). SELB utilizes the T-GCN to dynamically predict the network load state for real-time feedback. Meanwhile, the adaptive flow splitting algorithm is employed to dynamically adjust the timeout of flowlets, effectively adapting to changes in network dynamics. Moreover, SELB incorporates a load-aware route planning strategy that considers the overall network load distribution. By doing so, it can intelligently route flowlets along equivalent multipaths, enhancing load balancing capabilities. The simulation results demonstrate that SELB effectively reduces Flow Completion Time (FCT), enhances average throughput, and improves load balancing performance in comparison to existing schemes.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"246 ","pages":"Article 104401"},"PeriodicalIF":8.0,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145657738","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