Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843473
S. E. Ayeb, B. Hemery, Fabrice Jeanne, E. Cherrier, Christophe Charrier
Networks have provided a representation for a wide range of real systems, including communication flow, money transfer or biological systems, to mention just a few. Communities represent fundamental structures for understanding the organization of real-world networks. Uncovering coherent groups in these networks is the goal of community detection. A community is a mesoscopic structure with nodes heavily connected within their groups by comparison to the nodes in other groups. Communities might also overlap as they may share one or multiple nodes. Evaluating the results of a community detection algorithm is an equally important task. This paper introduces metrics for evaluating overlapping community detection. The idea of introducing new metrics comes from the lack of efficiency and adequacy of state-of-the-art metrics for overlapping communities. The new metrics are tested both on simulated data and standard datasets and are compared with existing metrics.
{"title":"Evaluation Metrics for Overlapping Community Detection","authors":"S. E. Ayeb, B. Hemery, Fabrice Jeanne, E. Cherrier, Christophe Charrier","doi":"10.1109/LCN53696.2022.9843473","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843473","url":null,"abstract":"Networks have provided a representation for a wide range of real systems, including communication flow, money transfer or biological systems, to mention just a few. Communities represent fundamental structures for understanding the organization of real-world networks. Uncovering coherent groups in these networks is the goal of community detection. A community is a mesoscopic structure with nodes heavily connected within their groups by comparison to the nodes in other groups. Communities might also overlap as they may share one or multiple nodes. Evaluating the results of a community detection algorithm is an equally important task. This paper introduces metrics for evaluating overlapping community detection. The idea of introducing new metrics comes from the lack of efficiency and adequacy of state-of-the-art metrics for overlapping communities. The new metrics are tested both on simulated data and standard datasets and are compared with existing metrics.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115677805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843516
Abdelrahman Elewah, Walid M. Ibrahim, Khalid Elgazzar
Today, the world has become crowded with sensing devices that are connected to the Internet, making the Internet of Things (IoT) a mainstream paradigm. A decade earlier, the Public Sensing term appeared to utilize a limited network of sensing devices that collect information from the surrounding for a specific purpose. The limited connectivity, heterogeneity of the sensing devices, and the immaturity of technologies hindered the widespread implementation of Public Sensing as a Service (PSaaS) in real-world scenarios. To date, there is no clear definition for Public Sensing, and it is frequently confused with other terms such as mobile crowdsensing and crowdsourcing. In this paper, we redefine Public Sensing in the context of the widespread IoT and propose a new architecture for Public Sensing as a Service. The conclusion of the discussion demonstrates that the proposed PSaaS holds a considerable promise for public adoption and will offer real-time smart services to inform decision-making and improve quality of life.
{"title":"Paving the Way for Massive Public Sensing as a Service","authors":"Abdelrahman Elewah, Walid M. Ibrahim, Khalid Elgazzar","doi":"10.1109/LCN53696.2022.9843516","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843516","url":null,"abstract":"Today, the world has become crowded with sensing devices that are connected to the Internet, making the Internet of Things (IoT) a mainstream paradigm. A decade earlier, the Public Sensing term appeared to utilize a limited network of sensing devices that collect information from the surrounding for a specific purpose. The limited connectivity, heterogeneity of the sensing devices, and the immaturity of technologies hindered the widespread implementation of Public Sensing as a Service (PSaaS) in real-world scenarios. To date, there is no clear definition for Public Sensing, and it is frequently confused with other terms such as mobile crowdsensing and crowdsourcing. In this paper, we redefine Public Sensing in the context of the widespread IoT and propose a new architecture for Public Sensing as a Service. The conclusion of the discussion demonstrates that the proposed PSaaS holds a considerable promise for public adoption and will offer real-time smart services to inform decision-making and improve quality of life.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115516296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843364
Michael Niebisch, D. Pfaller, Reinhard German, Anatoli Djanatliev
With the vast increase in software and digital services in the vehicular domain, communication networks play an increasingly important role. While some applications rely on fast data transfers, other tasks can be offloaded and delayed. For those, cooperative downloading schemes have been proposed, which utilize opportunistic communication, heterogeneous networks, and extended deadlines in a best effort approach. The efficiency of such communication depends on the chosen protocol and strategies, which impact the performance. We, therefore, introduce a novel hybrid encoding scheme for the encoding of relevant data. Additionally, we study the impact of reacting to data requests and initial distribution of data. We introduce a protocol logic for cooperative downloading and evaluate the overall downloading efficiency in simulation. A comparison between strategies reveals improvements of up to 31.8% in downloading progress and a time reduction averaging 46.4% for the best set of parameters, while also reducing the channel load significantly.
{"title":"Performance Improvements in Cooperative Downloading: Encoding and Strategies for Heterogeneous Vehicular Networks","authors":"Michael Niebisch, D. Pfaller, Reinhard German, Anatoli Djanatliev","doi":"10.1109/LCN53696.2022.9843364","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843364","url":null,"abstract":"With the vast increase in software and digital services in the vehicular domain, communication networks play an increasingly important role. While some applications rely on fast data transfers, other tasks can be offloaded and delayed. For those, cooperative downloading schemes have been proposed, which utilize opportunistic communication, heterogeneous networks, and extended deadlines in a best effort approach. The efficiency of such communication depends on the chosen protocol and strategies, which impact the performance. We, therefore, introduce a novel hybrid encoding scheme for the encoding of relevant data. Additionally, we study the impact of reacting to data requests and initial distribution of data. We introduce a protocol logic for cooperative downloading and evaluate the overall downloading efficiency in simulation. A comparison between strategies reveals improvements of up to 31.8% in downloading progress and a time reduction averaging 46.4% for the best set of parameters, while also reducing the channel load significantly.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843482
Lennart Buhl
The ClusterDuck Protocol is presented which provides a robust method of communication which does not depend on wires in the ground or mains voltage and can service areas which suffered from natural disasters of many kinds. An evaluation of the basic operation is performed and improvements and further adaptations are postulated.
{"title":"The ClusterDuck Protocol put to the test: Evaluating and Enhancing a Communication Network for Disaster Management","authors":"Lennart Buhl","doi":"10.1109/LCN53696.2022.9843482","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843482","url":null,"abstract":"The ClusterDuck Protocol is presented which provides a robust method of communication which does not depend on wires in the ground or mains voltage and can service areas which suffered from natural disasters of many kinds. An evaluation of the basic operation is performed and improvements and further adaptations are postulated.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123889413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843678
Peter Detzner, Jana Godeke, Steffen Bondorf
A Peer-to-Peer (P2P) network consists of a large number of nodes, where each node may have different capabilities and properties. Finding peers with specific capabilities and properties is challenging. Thus, we propose a practical solution to the problem of peer discovery, which is finding peers in the network according to a specified query. We contribute a peer discovery for an m-ary tree-structured P2P network by utilizing a connected dominating set (CDS), a technique that is typically used in unstructured networks. Our approach of constructing the CDS requires no additional communication cost, while nodes can insert, update and remove data within ${mathcal{O}}(1)$. Each node of the CDS – a dominating set node – maintains only a limited number of nodes. We confirm the properties of our proposed solution by using the ns-3 discrete-event simulator. This includes, besides the degree of decentralism of the peer discovery, also the heterogeneity of peers.
{"title":"Peer Discovery in Tree-Structured P2P Overlay Networks by Means of Connected Dominating Sets","authors":"Peter Detzner, Jana Godeke, Steffen Bondorf","doi":"10.1109/LCN53696.2022.9843678","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843678","url":null,"abstract":"A Peer-to-Peer (P2P) network consists of a large number of nodes, where each node may have different capabilities and properties. Finding peers with specific capabilities and properties is challenging. Thus, we propose a practical solution to the problem of peer discovery, which is finding peers in the network according to a specified query. We contribute a peer discovery for an m-ary tree-structured P2P network by utilizing a connected dominating set (CDS), a technique that is typically used in unstructured networks. Our approach of constructing the CDS requires no additional communication cost, while nodes can insert, update and remove data within ${mathcal{O}}(1)$. Each node of the CDS – a dominating set node – maintains only a limited number of nodes. We confirm the properties of our proposed solution by using the ns-3 discrete-event simulator. This includes, besides the degree of decentralism of the peer discovery, also the heterogeneity of peers.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123513321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843372
Oscar G. Bautista, K. Akkaya
Secure multi-party computation (SMPC) allows mutually distrusted parties to evaluate a function jointly without revealing their private inputs. This technique helps organizations collaborate on a common goal without disclosing confidential or protected data. Despite its suitability for privacy-preserving computation, SMPC suffers from network-based performance limitations. Specifically, the SMPC parties perform the techniques in rounds, where they execute a local computation and then share their round output with the other parties. This network interchange creates a bottleneck as parties need to wait until the data propagates before resuming the execution. To reduce the SMPC execution time, we propose a pipelining-like approach for each round’s computation and communication by dividing the data and readjusting the execution order. Targeting deep learning applications, we propose strategies for the case of matrix multiplication, a core component of such applications. Our results on a distributed cloud deployment show a significant reduction in the SMPC execution time.
{"title":"Network-Efficient Pipelining-Based Secure Multiparty Computation for Machine Learning Applications","authors":"Oscar G. Bautista, K. Akkaya","doi":"10.1109/LCN53696.2022.9843372","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843372","url":null,"abstract":"Secure multi-party computation (SMPC) allows mutually distrusted parties to evaluate a function jointly without revealing their private inputs. This technique helps organizations collaborate on a common goal without disclosing confidential or protected data. Despite its suitability for privacy-preserving computation, SMPC suffers from network-based performance limitations. Specifically, the SMPC parties perform the techniques in rounds, where they execute a local computation and then share their round output with the other parties. This network interchange creates a bottleneck as parties need to wait until the data propagates before resuming the execution. To reduce the SMPC execution time, we propose a pipelining-like approach for each round’s computation and communication by dividing the data and readjusting the execution order. Targeting deep learning applications, we propose strategies for the case of matrix multiplication, a core component of such applications. Our results on a distributed cloud deployment show a significant reduction in the SMPC execution time.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121510176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843631
Muhammad Khairul Ali Hassan, Davide Pesavento, L. Benmohamed
The 5G research community is increasingly leveraging the innovative features offered by Information Centric Networking (ICN). However, ICN’s fundamental features, such as in-network caching, make access control enforcement more challenging in an ICN-based 5G deployment. To address this shortcoming, we propose a Blockchain-based Decentralized Authentication Protocol (BDAP) which enables efficient and secure mobile user authentication in an ICN-based 5G network. We show that BDAP is robust against a variety of attacks to which mobile networks and blockchains are particularly vulnerable. Moreover, a preliminary performance analysis suggests that BDAP can reduce the authentication delay compared to the standard 5G authentication protocols.
{"title":"Blockchain-Based Decentralized Authentication for Information-Centric 5G Networks","authors":"Muhammad Khairul Ali Hassan, Davide Pesavento, L. Benmohamed","doi":"10.1109/LCN53696.2022.9843631","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843631","url":null,"abstract":"The 5G research community is increasingly leveraging the innovative features offered by Information Centric Networking (ICN). However, ICN’s fundamental features, such as in-network caching, make access control enforcement more challenging in an ICN-based 5G deployment. To address this shortcoming, we propose a Blockchain-based Decentralized Authentication Protocol (BDAP) which enables efficient and secure mobile user authentication in an ICN-based 5G network. We show that BDAP is robust against a variety of attacks to which mobile networks and blockchains are particularly vulnerable. Moreover, a preliminary performance analysis suggests that BDAP can reduce the authentication delay compared to the standard 5G authentication protocols.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126306456","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843585
Vijaya Durga Chemalamarri, M. Abolhasan, R. Braun
The Software Defined Network paradigm deviates from traditional networks by logically centralising and physically separating the control plane from the data plane. In this work, we present the idea of a modular, agent-based SDN controller. We first highlight issues with current SDN controller designs, followed by a description of the proposed framework. We present a prototype for our design to demonstrate the controller in action using a few common use-cases. We continue the discussion by highlighting areas that require further research.
{"title":"An agent-based approach to disintegrate and modularise Software Defined Networks controller","authors":"Vijaya Durga Chemalamarri, M. Abolhasan, R. Braun","doi":"10.1109/LCN53696.2022.9843585","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843585","url":null,"abstract":"The Software Defined Network paradigm deviates from traditional networks by logically centralising and physically separating the control plane from the data plane. In this work, we present the idea of a modular, agent-based SDN controller. We first highlight issues with current SDN controller designs, followed by a description of the proposed framework. We present a prototype for our design to demonstrate the controller in action using a few common use-cases. We continue the discussion by highlighting areas that require further research.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115904596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a novel problem of cross-regional friendship inference to solve the geographically restricted friends recommendation. Traditional approaches rely on a fundamental assumption that friends tend to be co-location, which is unrealistic for inferring friendship across regions. By reviewing a large-scale Location-based Social Networks (LBSNs) dataset, we spot that cross-regional users are more likely to form a friendship when their mobility neighbors are of high similarity. To this end, we propose Category-Aware Multi-Bipartite Graph Embedding (CMGE for short) for cross-regional friendship inference. We first utilize multi-bipartite graph embedding to capture users’ Point of Interest (POI) neighbor similarity and activity category similarity simultaneously, then the contributions of each POI and category are learned by a category-aware heterogeneous graph attention network. Experiments on the real-world LBSNs datasets demonstrate that CMGE outperforms state-of-the-art baselines.
{"title":"Cross-Regional Friendship Inference via Category-Aware Multi-Bipartite Graph Embedding","authors":"Linfei Ren, Ruimin Hu, Dengshi Li, Junhang Wu, Yilong Zang, Wenyi Hu","doi":"10.1109/LCN53696.2022.9843580","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843580","url":null,"abstract":"This paper proposes a novel problem of cross-regional friendship inference to solve the geographically restricted friends recommendation. Traditional approaches rely on a fundamental assumption that friends tend to be co-location, which is unrealistic for inferring friendship across regions. By reviewing a large-scale Location-based Social Networks (LBSNs) dataset, we spot that cross-regional users are more likely to form a friendship when their mobility neighbors are of high similarity. To this end, we propose Category-Aware Multi-Bipartite Graph Embedding (CMGE for short) for cross-regional friendship inference. We first utilize multi-bipartite graph embedding to capture users’ Point of Interest (POI) neighbor similarity and activity category similarity simultaneously, then the contributions of each POI and category are learned by a category-aware heterogeneous graph attention network. Experiments on the real-world LBSNs datasets demonstrate that CMGE outperforms state-of-the-art baselines.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131373085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, multi-access edge computing (MEC) has become a hot topic. In this paper, we study a task offloading problem combined with bandwidth allocation in multi-access edge computing. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Then, we formulate the task offloading decision-making to minimize the delay. The delay consists of communication delay and execution delay. To solve the offloading problem, we convert the dissatisfaction of alliance into a vector, and obtain the Pareto optimal through multi-objective particle swarm algorithm. Then, we use Branch and Bound method to construct the propagation tree to facilitate decision-making. To evaluate the edge servers in the tree, we build an evaluation matrix and transform the matrix to a set of evaluation index which is used on task offloading decision-making. A large number of experimental results show that our algorithm is better than compared algorithm.
{"title":"Delay-sensitive Task offloading combined with Bandwidth Allocation in Multi-access Edge Computing","authors":"Shudian Song, Shuyue Ma, X. Zhu, Yumei Li, Feng Yang, Linbo Zhai","doi":"10.1109/LCN53696.2022.9843342","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843342","url":null,"abstract":"In recent years, multi-access edge computing (MEC) has become a hot topic. In this paper, we study a task offloading problem combined with bandwidth allocation in multi-access edge computing. Based on alliance game, we formulate bandwidth allocation to minimize the dissatisfaction of alliances. Then, we formulate the task offloading decision-making to minimize the delay. The delay consists of communication delay and execution delay. To solve the offloading problem, we convert the dissatisfaction of alliance into a vector, and obtain the Pareto optimal through multi-objective particle swarm algorithm. Then, we use Branch and Bound method to construct the propagation tree to facilitate decision-making. To evaluate the edge servers in the tree, we build an evaluation matrix and transform the matrix to a set of evaluation index which is used on task offloading decision-making. A large number of experimental results show that our algorithm is better than compared algorithm.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133231715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：