Pub Date : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652903
Nathan Daughety, Marcus Pendleton, Shouhuai Xu, L. Njilla, John Franco
With the paradigm shift to cloud-based operations, reliable and secure access to and transfer of data between differing security domains has never been more essential. A Cross Domain Solution (CDS) is a guarded interface which serves to execute the secure access and/or transfer of data between isolated and/or differing security domains defined by an administrative security policy. Cross domain security requires trustworthiness at the confluence of the hardware and software components which implement a security policy. Security components must be relied upon to defend against widely encompassing threats – consider insider threats and nation state threat actors which can be both onsite and offsite threat actors – to information assurance. Current implementations of CDS systems use suboptimal Trusted Computing Bases (TCB) without any formal verification proofs, confirming the gap between blind trust and trustworthiness. Moreover, most CDSs are exclusively operated by Department of Defense agencies and are not readily available to the commercial sectors, nor are they available for independent security verification. Still, more CDSs are only usable in physically isolated environments such as Sensitive Compartmented Information Facilities and are inconsistent with the paradigm shift to cloud environments. Our purpose is to address the question of how trustworthiness can be implemented in a remotely deployable CDS that also supports availability and accessibility to all sectors. In this paper, we present a novel CDS system architecture which is the first to use a formally verified TCB. Additionally, our CDS model is the first of its kind to utilize a computation-isolation approach which allows our CDS to be remotely deployable for use in cloud-based solutions.
{"title":"vCDS: A Virtualized Cross Domain Solution Architecture","authors":"Nathan Daughety, Marcus Pendleton, Shouhuai Xu, L. Njilla, John Franco","doi":"10.1109/MILCOM52596.2021.9652903","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652903","url":null,"abstract":"With the paradigm shift to cloud-based operations, reliable and secure access to and transfer of data between differing security domains has never been more essential. A Cross Domain Solution (CDS) is a guarded interface which serves to execute the secure access and/or transfer of data between isolated and/or differing security domains defined by an administrative security policy. Cross domain security requires trustworthiness at the confluence of the hardware and software components which implement a security policy. Security components must be relied upon to defend against widely encompassing threats – consider insider threats and nation state threat actors which can be both onsite and offsite threat actors – to information assurance. Current implementations of CDS systems use suboptimal Trusted Computing Bases (TCB) without any formal verification proofs, confirming the gap between blind trust and trustworthiness. Moreover, most CDSs are exclusively operated by Department of Defense agencies and are not readily available to the commercial sectors, nor are they available for independent security verification. Still, more CDSs are only usable in physically isolated environments such as Sensitive Compartmented Information Facilities and are inconsistent with the paradigm shift to cloud environments. Our purpose is to address the question of how trustworthiness can be implemented in a remotely deployable CDS that also supports availability and accessibility to all sectors. In this paper, we present a novel CDS system architecture which is the first to use a formally verified TCB. Additionally, our CDS model is the first of its kind to utilize a computation-isolation approach which allows our CDS to be remotely deployable for use in cloud-based solutions.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123227318","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9653091
D. L. Hall, D. Jenkins
This paper proposes conditioning angle of arrival (AOA) algorithms for pseudo-spectrum fingerprint acquisition based on line of sight (LOS) and non-LOS detection schema for optimizing indoor localization. The proposed approach merges two AOA based methods being that of the MUltiple Signal Classsification (MUSIC) algorithm and virtual MUSIC algorithm into a conditional based localization approach with a uniform circular array (UCA). The paper begins by demonstrating the environmental dependencies of the two AOA approaches based on the Rician $K$-factor metric. The $K$-factor is then exploited as an algorithm selection metric to arrive at improved localization performance in a realistic indoor environment.
{"title":"Conditional Rician $K$-Factor Discrimination for Indoor Localization via AOA Estimation","authors":"D. L. Hall, D. Jenkins","doi":"10.1109/MILCOM52596.2021.9653091","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653091","url":null,"abstract":"This paper proposes conditioning angle of arrival (AOA) algorithms for pseudo-spectrum fingerprint acquisition based on line of sight (LOS) and non-LOS detection schema for optimizing indoor localization. The proposed approach merges two AOA based methods being that of the MUltiple Signal Classsification (MUSIC) algorithm and virtual MUSIC algorithm into a conditional based localization approach with a uniform circular array (UCA). The paper begins by demonstrating the environmental dependencies of the two AOA approaches based on the Rician $K$-factor metric. The $K$-factor is then exploited as an algorithm selection metric to arrive at improved localization performance in a realistic indoor environment.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121613099","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9653033
Tianyuan Yu, Philipp Moll, Zhiyi Zhang, A. Afanasyev, Lixia Zhang
“Plug-and-play” is a highly desired property in networking, which enables new entities to be plugged into a networked system following a systematic, and automated if possible, process to start playing, i.e. sending and receiving packets. In IP networks, DHCP services provide the plug function to enable an IP host to play. In this paper we discuss the plug step in an NDN network, articulate the fundamental differences in NDN's plug step as compared to that of IP, and describe our initial designs for plugging new entities into an NDN network in three different use case scenarios. These design exercises show that NDN's plug process requires mutual authentication between the configurer and the configuree (the entity to be plugged in), which is context specific and represents a major challenge in the plug process. We addressed this challenge by making use of existing authentication systems.
{"title":"Enabling Plug-n-Play in Named Data Networking","authors":"Tianyuan Yu, Philipp Moll, Zhiyi Zhang, A. Afanasyev, Lixia Zhang","doi":"10.1109/MILCOM52596.2021.9653033","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653033","url":null,"abstract":"“Plug-and-play” is a highly desired property in networking, which enables new entities to be plugged into a networked system following a systematic, and automated if possible, process to start playing, i.e. sending and receiving packets. In IP networks, DHCP services provide the plug function to enable an IP host to play. In this paper we discuss the plug step in an NDN network, articulate the fundamental differences in NDN's plug step as compared to that of IP, and describe our initial designs for plugging new entities into an NDN network in three different use case scenarios. These design exercises show that NDN's plug process requires mutual authentication between the configurer and the configuree (the entity to be plugged in), which is context specific and represents a major challenge in the plug process. We addressed this challenge by making use of existing authentication systems.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132359527","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 : 2021-11-29DOI: 10.1109/milcom52596.2021.9652999
Xianfeng Zhao, Hyoung Joon Kim
The 21st IEEE International NEWCAS Conference will be held in Edinburgh, Scotland, on June 26 – 28, 2023. The program of the conference will be tailored to reflect the wide spectrum of topics and research interest shared among the organizing entities. This collaboration will be oriented towards advanced research in adaptive systems which constitutes the highlights of the NEWCAS conference, but also areas related to analog and digital signal processing, low power consumption, circuits and systems designs.
{"title":"Technical Program Chairs","authors":"Xianfeng Zhao, Hyoung Joon Kim","doi":"10.1109/milcom52596.2021.9652999","DOIUrl":"https://doi.org/10.1109/milcom52596.2021.9652999","url":null,"abstract":"The 21st IEEE International NEWCAS Conference will be held in Edinburgh, Scotland, on June 26 – 28, 2023. The program of the conference will be tailored to reflect the wide spectrum of topics and research interest shared among the organizing entities. This collaboration will be oriented towards advanced research in adaptive systems which constitutes the highlights of the NEWCAS conference, but also areas related to analog and digital signal processing, low power consumption, circuits and systems designs.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129372167","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652971
Xiaofei Chen, E. Venosa, F. Harris
The chirp spread spectrum (CSS) has gained much attention over the recent years due to its wide adoption in low power wide area network technologies (LPWANs). It is one of the promising physical layer (PHY) options for fulfilling long range and low data rate communication that occur in many of today's Internet of Things (IoT) devices, i.e., LORA and etc. This paper discusses the low complexity and low power implementation of a CSS modem from synchronization perspectives. We address the CSS receiver architecture with consideration to its unique synchronization steps under low Signal to Noise Ratio (SNR) environment.
{"title":"Synchronization Steps for Low Complexity Chirp Spread Spectrum (CSS) Receivers","authors":"Xiaofei Chen, E. Venosa, F. Harris","doi":"10.1109/MILCOM52596.2021.9652971","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652971","url":null,"abstract":"The chirp spread spectrum (CSS) has gained much attention over the recent years due to its wide adoption in low power wide area network technologies (LPWANs). It is one of the promising physical layer (PHY) options for fulfilling long range and low data rate communication that occur in many of today's Internet of Things (IoT) devices, i.e., LORA and etc. This paper discusses the low complexity and low power implementation of a CSS modem from synchronization perspectives. We address the CSS receiver architecture with consideration to its unique synchronization steps under low Signal to Noise Ratio (SNR) environment.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"58 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132865038","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652896
Mohammed Elbadry, F. Ye, Peter Milder
Edge nodes deployed in edge environments (e.g., IoT) have two common use cases: i) access control and ii) disseminating data. An address based paradigm is suitable for sending access control commands to specific nodes, yet a name based one excels at filtering and disseminating data based on content regardless of who has the data. Current address based communication mandates grouping among nodes (e.g., using BSSID), incurring high overheads (e.g., periodic beacons); whereas name based discovery is much more efficient and flexible. However, the name based paradigm needs many assets possessed in the address based paradigm (e.g., frame rate adaptation). Such complementary strengths and needs call for unification of both paradigms to meet current edge environment needs. In this paper, we introduce a unified medium access control design that combines both paradigms. Our unified design eliminates the need for grouping in address based communication by a name based discovery protocol, enabling filtering based on address or data attributes. It leverages address based unicast rate adaptation to benefit name based communication through Our experiments show the system's ability to discover neighbor addresses based on application attributes, and filter thousands of both name and address based entries efficiently. It reduces latency of name based communication by 30X, and loss rate from 10-20% to 0% through address based rate adaptation algorithm with reliability.
{"title":"Unifying Address and Name Based Communication in Wireless Medium Access Control","authors":"Mohammed Elbadry, F. Ye, Peter Milder","doi":"10.1109/MILCOM52596.2021.9652896","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652896","url":null,"abstract":"Edge nodes deployed in edge environments (e.g., IoT) have two common use cases: i) access control and ii) disseminating data. An address based paradigm is suitable for sending access control commands to specific nodes, yet a name based one excels at filtering and disseminating data based on content regardless of who has the data. Current address based communication mandates grouping among nodes (e.g., using BSSID), incurring high overheads (e.g., periodic beacons); whereas name based discovery is much more efficient and flexible. However, the name based paradigm needs many assets possessed in the address based paradigm (e.g., frame rate adaptation). Such complementary strengths and needs call for unification of both paradigms to meet current edge environment needs. In this paper, we introduce a unified medium access control design that combines both paradigms. Our unified design eliminates the need for grouping in address based communication by a name based discovery protocol, enabling filtering based on address or data attributes. It leverages address based unicast rate adaptation to benefit name based communication through Our experiments show the system's ability to discover neighbor addresses based on application attributes, and filter thousands of both name and address based entries efficiently. It reduces latency of name based communication by 30X, and loss rate from 10-20% to 0% through address based rate adaptation algorithm with reliability.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132940991","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652901
Xinyuan Wang
The Supply chain attack is the stealthy and sophisticated cyberattack that aims to compromise a target by exploiting weaknesses and vulnerabilities in its supply chain. Recent supply chain attacks (e.g., SolarWinds attack) have compromised some of the most secured IT infrastructures of government agencies and enterprises. The European Union Agency for Cybersecurity, ENISA, has predicted that there will be 3 times more supply chain attacks in 2021 than in 2020. In this paper, we look into the problem of supply chain attacks, the challenges of defending software supply chain attacks. We analyze what it takes to effectively prevent software supply chain attacks, and show that it is indeed feasible and practical for the customers to detect certain software supply chain attacks. We propose an information flow based detection approach that enables end users to detect many software supply chain attacks without dealing with any of the underlying software suppliers.
{"title":"On the Feasibility of Detecting Software Supply Chain Attacks","authors":"Xinyuan Wang","doi":"10.1109/MILCOM52596.2021.9652901","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652901","url":null,"abstract":"The Supply chain attack is the stealthy and sophisticated cyberattack that aims to compromise a target by exploiting weaknesses and vulnerabilities in its supply chain. Recent supply chain attacks (e.g., SolarWinds attack) have compromised some of the most secured IT infrastructures of government agencies and enterprises. The European Union Agency for Cybersecurity, ENISA, has predicted that there will be 3 times more supply chain attacks in 2021 than in 2020. In this paper, we look into the problem of supply chain attacks, the challenges of defending software supply chain attacks. We analyze what it takes to effectively prevent software supply chain attacks, and show that it is indeed feasible and practical for the customers to detect certain software supply chain attacks. We propose an information flow based detection approach that enables end users to detect many software supply chain attacks without dealing with any of the underlying software suppliers.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133353466","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9653017
J. Macker, Caleb Bowers, S. Kompella, C. Kam, Jeffery W. Weston
We consider the problem of wireless topology control with adjustable k-resilience and we evaluate related unicast and multicast network traffic delivery statistics across a series of initial simulation experiments. Our main goal is to examine design tradeoffs between resilient topology control, transmission power requirements, and resultant network throughput characteristics. We also present newly developed extensions to the network simulator, NS3, supporting multicast traffic experimentation. Our results for the random geometric networks studied demonstrate that moderate levels of $k$-resilience result in improvements in unicast traffic delivery while managing the growth of transmission power requirements across the network. These same trends were also observed for multicast experiments with connected dominating set (CDS) based forwarding, but traffic delivery did not improve for higher $k$ connectivities in the case of basic multicast flooding. Overall, we conclude that topology control edge connectivity resilience adds significant traffic delivery improvements in addition to providing other benefits, but the additional cost for establishing topological resiliency needs to be carefully considered against other defined system constraints. To address transmit power increases associated with resiliency and to improve traffic capacity in lower $k$ network topologies, further research is planned in applying network directivity components and multi-channel network architectures to the problem space.
{"title":"Wireless Network Topology Control: Adjustable Resiliency and Network Traffic Delivery","authors":"J. Macker, Caleb Bowers, S. Kompella, C. Kam, Jeffery W. Weston","doi":"10.1109/MILCOM52596.2021.9653017","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653017","url":null,"abstract":"We consider the problem of wireless topology control with adjustable k-resilience and we evaluate related unicast and multicast network traffic delivery statistics across a series of initial simulation experiments. Our main goal is to examine design tradeoffs between resilient topology control, transmission power requirements, and resultant network throughput characteristics. We also present newly developed extensions to the network simulator, NS3, supporting multicast traffic experimentation. Our results for the random geometric networks studied demonstrate that moderate levels of $k$-resilience result in improvements in unicast traffic delivery while managing the growth of transmission power requirements across the network. These same trends were also observed for multicast experiments with connected dominating set (CDS) based forwarding, but traffic delivery did not improve for higher $k$ connectivities in the case of basic multicast flooding. Overall, we conclude that topology control edge connectivity resilience adds significant traffic delivery improvements in addition to providing other benefits, but the additional cost for establishing topological resiliency needs to be carefully considered against other defined system constraints. To address transmit power increases associated with resiliency and to improve traffic capacity in lower $k$ network topologies, further research is planned in applying network directivity components and multi-channel network architectures to the problem space.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133838400","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 : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652949
C. Kam, J. Macker, Caleb Bowers, S. Kompella
The purpose of this work is to connect wireless nodes to form an ad hoc network, while trying to limit the interference to a node or device that is external to the network. Specifically, we consider two forms of the problem of limiting interference caused by the emitted power required to form the connections within a network. First, we consider a case where the interference at the external node cannot exceed some power threshold, and we would like to connect as many nodes together to form a tree without exceeding that threshold. We call this the Largest Constrained Tree (LCT) problem, which we model as a graph where the cost to connect a pair of nodes is the sum of the interference caused by transmitting in each direction. The second form of the problem we consider is the case where the power incident on the external node must be minimized, and we would like to connect nodes to form a network backbone, specifically a connected dominating set (CDS). As an approximation, we model the power emitted by the leaf nodes to the CDS as a smaller fixed amount, due to the transmission being out of band or having directionality gain. To solve these problems, we formulate them as mixed integer linear programs, and we demonstrate their performance through Monte Carlo simulation for various network sizes, node densities, external node distances, and network activity levels.
{"title":"Ad Hoc Networking Under Limitations on Sum Power Interference to an External Node","authors":"C. Kam, J. Macker, Caleb Bowers, S. Kompella","doi":"10.1109/MILCOM52596.2021.9652949","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652949","url":null,"abstract":"The purpose of this work is to connect wireless nodes to form an ad hoc network, while trying to limit the interference to a node or device that is external to the network. Specifically, we consider two forms of the problem of limiting interference caused by the emitted power required to form the connections within a network. First, we consider a case where the interference at the external node cannot exceed some power threshold, and we would like to connect as many nodes together to form a tree without exceeding that threshold. We call this the Largest Constrained Tree (LCT) problem, which we model as a graph where the cost to connect a pair of nodes is the sum of the interference caused by transmitting in each direction. The second form of the problem we consider is the case where the power incident on the external node must be minimized, and we would like to connect nodes to form a network backbone, specifically a connected dominating set (CDS). As an approximation, we model the power emitted by the leaf nodes to the CDS as a smaller fixed amount, due to the transmission being out of band or having directionality gain. To solve these problems, we formulate them as mixed integer linear programs, and we demonstrate their performance through Monte Carlo simulation for various network sizes, node densities, external node distances, and network activity levels.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122071862","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
扫码关注我们
求助内容：
应助结果提醒方式：