Pub Date : 2019-12-01DOI: 10.1142/s0129626419500166
Ajay Arora, E. Cheng, Colton Magnant
An path that is edge-colored is called proper if no two consecutive edges receive the same color. A general graph that is edge-colored is called properly connected if, for every pair of vertices in the graph, there exists a properly colored path from one to the other. Given two vertices u and v in a properly connected graph G, the proper distance is the length of the shortest properly colored path from u to v. By considering a specific class of colorings that are properly connected for Cartesian products of complete and cyclic graphs, we present results on the proper distance between all pairs of vertices in the graph.
{"title":"Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles","authors":"Ajay Arora, E. Cheng, Colton Magnant","doi":"10.1142/s0129626419500166","DOIUrl":"https://doi.org/10.1142/s0129626419500166","url":null,"abstract":"An path that is edge-colored is called proper if no two consecutive edges receive the same color. A general graph that is edge-colored is called properly connected if, for every pair of vertices in the graph, there exists a properly colored path from one to the other. Given two vertices u and v in a properly connected graph G, the proper distance is the length of the shortest properly colored path from u to v. By considering a specific class of colorings that are properly connected for Cartesian products of complete and cyclic graphs, we present results on the proper distance between all pairs of vertices in the graph.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124536662","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 : 2019-10-01DOI: 10.1142/s0129626419500129
Tianlong Ma, Jinling Wang, Mingzu Zhang
The restricted edge-connectivity of a connected graph [Formula: see text], denoted by [Formula: see text], if exists, is the minimum number of edges whose deletion disconnects the graph such that each connected component has at least two vertices. The Kronecker product of graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text], where two vertices [Formula: see text] and [Formula: see text] are adjacent in [Formula: see text] if and only if [Formula: see text] and [Formula: see text]. In this paper, it is proved that [Formula: see text] for any graph [Formula: see text] and a complete graph [Formula: see text] with [Formula: see text] vertices, where [Formula: see text] is minimum edge-degree of [Formula: see text], and a sufficient condition such that [Formula: see text] is [Formula: see text]-optimal is acquired.
{"title":"The Restricted Edge-Connectivity of Kronecker Product Graphs","authors":"Tianlong Ma, Jinling Wang, Mingzu Zhang","doi":"10.1142/s0129626419500129","DOIUrl":"https://doi.org/10.1142/s0129626419500129","url":null,"abstract":"The restricted edge-connectivity of a connected graph [Formula: see text], denoted by [Formula: see text], if exists, is the minimum number of edges whose deletion disconnects the graph such that each connected component has at least two vertices. The Kronecker product of graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the graph with vertex set [Formula: see text], where two vertices [Formula: see text] and [Formula: see text] are adjacent in [Formula: see text] if and only if [Formula: see text] and [Formula: see text]. In this paper, it is proved that [Formula: see text] for any graph [Formula: see text] and a complete graph [Formula: see text] with [Formula: see text] vertices, where [Formula: see text] is minimum edge-degree of [Formula: see text], and a sufficient condition such that [Formula: see text] is [Formula: see text]-optimal is acquired.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134149714","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 : 2019-10-01DOI: 10.1142/s0129626419500130
Shane Carroll, Wei-Ming Lin
In this paper, we propose a machine learning algorithm to control instruction fetch bandwidth in a simultaneous multithreaded CPU. In a simultaneous multithreaded CPU, multiple threads occupy pools of hardware resources in the same clock cycle. Under some conditions, one or more threads may undergo a period of inefficiency, e.g., a cache miss, thereby inefficiently using shared resources and degrading the performance of other threads. If these inefficiencies can be identified at runtime, the offending thread can be temporarily blocked from fetching new instructions into the pipeline and given time to recover from its inefficiency, and prevent the shared system resources from being wasted on a stalled thread. In this paper, we propose a machine learning approach to determine when a thread should be blocked from fetching new instructions. The model is trained offline and the parameters embedded in a CPU, which can be queried with runtime statistics to determine if a thread is running inefficiently and should be temporarily blocked from fetching. We propose two models: a simple linear model and a higher-capacity neural network. We test each model in a simulation environment and show that system performance can increase by up to 19% on average with a feasible implementation of the proposed algorithm.
{"title":"Applied On-Chip Machine Learning for Dynamic Resource Control in Multithreaded Processors","authors":"Shane Carroll, Wei-Ming Lin","doi":"10.1142/s0129626419500130","DOIUrl":"https://doi.org/10.1142/s0129626419500130","url":null,"abstract":"In this paper, we propose a machine learning algorithm to control instruction fetch bandwidth in a simultaneous multithreaded CPU. In a simultaneous multithreaded CPU, multiple threads occupy pools of hardware resources in the same clock cycle. Under some conditions, one or more threads may undergo a period of inefficiency, e.g., a cache miss, thereby inefficiently using shared resources and degrading the performance of other threads. If these inefficiencies can be identified at runtime, the offending thread can be temporarily blocked from fetching new instructions into the pipeline and given time to recover from its inefficiency, and prevent the shared system resources from being wasted on a stalled thread. In this paper, we propose a machine learning approach to determine when a thread should be blocked from fetching new instructions. The model is trained offline and the parameters embedded in a CPU, which can be queried with runtime statistics to determine if a thread is running inefficiently and should be temporarily blocked from fetching. We propose two models: a simple linear model and a higher-capacity neural network. We test each model in a simulation environment and show that system performance can increase by up to 19% on average with a feasible implementation of the proposed algorithm.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126241029","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 : 2019-10-01DOI: 10.1142/s0129626419500105
R. Alonso-Sanz, Haozhen Situ
This article studies quantum games with imprecise payoffs simulated by means of fuzzy numbers. Three two-person game-types are scrutinized via the iterated confronting of a large number of players laying in a two-dimensional lattice. In every iteration, every player interacts with his nearest neighbours and adopts the strategy of his best paid mate. Variable degree of quantum entanglement and of optimism in the fuzzy payoffs are taken into consideration in the study.
{"title":"Quantum Fuzzy Game Simulation","authors":"R. Alonso-Sanz, Haozhen Situ","doi":"10.1142/s0129626419500105","DOIUrl":"https://doi.org/10.1142/s0129626419500105","url":null,"abstract":"This article studies quantum games with imprecise payoffs simulated by means of fuzzy numbers. Three two-person game-types are scrutinized via the iterated confronting of a large number of players laying in a two-dimensional lattice. In every iteration, every player interacts with his nearest neighbours and adopts the strategy of his best paid mate. Variable degree of quantum entanglement and of optimism in the fuzzy payoffs are taken into consideration in the study.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134363845","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 : 2019-09-26DOI: 10.1142/S0129626420400058
Yingzhi Tian, Huaping Ma, Liyun Wu
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see text] is called a Nordhaus-Gaddum type inequality or relation. The Nordhaus-Gaddum type inequalities for connectivity have been studied by several authors. For a bipartite graph [Formula: see text] with bipartition ([Formula: see text]), its bipartite complementary graph [Formula: see text] is a bipartite graph with [Formula: see text] and [Formula: see text] and [Formula: see text]. In this paper, we obtain the Nordhaus-Gaddum type inequalities for connectivity of bipartite graphs and its bipartite complementary graphs. Furthermore, we prove that these inequalities are best possible.
{"title":"The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph","authors":"Yingzhi Tian, Huaping Ma, Liyun Wu","doi":"10.1142/S0129626420400058","DOIUrl":"https://doi.org/10.1142/S0129626420400058","url":null,"abstract":"In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see text] is called a Nordhaus-Gaddum type inequality or relation. The Nordhaus-Gaddum type inequalities for connectivity have been studied by several authors. For a bipartite graph [Formula: see text] with bipartition ([Formula: see text]), its bipartite complementary graph [Formula: see text] is a bipartite graph with [Formula: see text] and [Formula: see text] and [Formula: see text]. In this paper, we obtain the Nordhaus-Gaddum type inequalities for connectivity of bipartite graphs and its bipartite complementary graphs. Furthermore, we prove that these inequalities are best possible.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123539725","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}
The independent number and domination number are two essential parameters to assess the resilience of the interconnection network of multiprocessor systems which is usually modeled by a graph. The independent number, denoted by [Formula: see text], of a graph [Formula: see text] is the maximum cardinality of any subset [Formula: see text] such that no two elements in [Formula: see text] are adjacent in [Formula: see text]. The domination number, denoted by [Formula: see text], of a graph [Formula: see text] is the minimum cardinality of any subset [Formula: see text] such that every vertex in [Formula: see text] is either in [Formula: see text] or adjacent to an element of [Formula: see text]. But so far, determining the independent number and domination number of a graph is still an NPC problem. Therefore, it is of utmost importance to determine the number of independent and domination number of some special networks with potential applications in multiprocessor system. In this paper, we firstly resolve the exact values of independent number and upper and lower bound of domination number of the [Formula: see text]-graph, a common generalization of various popular interconnection networks. Besides, as by-products, we derive the independent number and domination number of [Formula: see text]-star graph [Formula: see text], [Formula: see text]-arrangement graph [Formula: see text], as well as three special graphs.
{"title":"A Note of Independent Number and Domination Number of Qn, k, m-Graph","authors":"Jiafei Liu, Shuming Zhou, Zhendong Gu, Yihong Wang, Qianru Zhou","doi":"10.1142/s0129626419500117","DOIUrl":"https://doi.org/10.1142/s0129626419500117","url":null,"abstract":"The independent number and domination number are two essential parameters to assess the resilience of the interconnection network of multiprocessor systems which is usually modeled by a graph. The independent number, denoted by [Formula: see text], of a graph [Formula: see text] is the maximum cardinality of any subset [Formula: see text] such that no two elements in [Formula: see text] are adjacent in [Formula: see text]. The domination number, denoted by [Formula: see text], of a graph [Formula: see text] is the minimum cardinality of any subset [Formula: see text] such that every vertex in [Formula: see text] is either in [Formula: see text] or adjacent to an element of [Formula: see text]. But so far, determining the independent number and domination number of a graph is still an NPC problem. Therefore, it is of utmost importance to determine the number of independent and domination number of some special networks with potential applications in multiprocessor system. In this paper, we firstly resolve the exact values of independent number and upper and lower bound of domination number of the [Formula: see text]-graph, a common generalization of various popular interconnection networks. Besides, as by-products, we derive the independent number and domination number of [Formula: see text]-star graph [Formula: see text], [Formula: see text]-arrangement graph [Formula: see text], as well as three special graphs.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128353637","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 : 2019-09-01DOI: 10.1142/s0129626419500142
Diego Mendez, David Arevalo, Diego Patino, E. Gerlein, Ricardo Quintana
Filtered-x Least Mean Squares (FxLMS) is an algorithm commonly used for Active Noise Control (ANC) systems in order to cancel undesired acoustic waves from a sound source. There is a small number of hardware designs reported in the literature, that in turn only use one reference signal, one error signal and one output control signal. In this paper, it is proposed a 3-dimensional hardware-based version of the widely used FxLMS algorithm, using one reference microphone, 18 error microphones, one output and a FIR filter of 400[Formula: see text] order. The FxLMS algorithm was implemented in a Xilinx Artix 7 FPGA running at 25 MHz, which allowed to update the filter coefficients in 32.44[Formula: see text] s. The main idea behind this work is to propose a pipelined parallelized architecture to achieve processing times faster than real time for the filter coefficients update. The main contribution of this work is not the ANC technique itself, but rather the proposed hardware implementation that utilizes integer arithmetic, which provided an acceptable error when benchmarked with a software implementation. This parallel system allows a scalable implementation as an advantage of using FPGA without compromising the computational cost and, consequently, the latency.
{"title":"Parallel Architecture of Reconfigurable Hardware for Massive Output Active Noise Control","authors":"Diego Mendez, David Arevalo, Diego Patino, E. Gerlein, Ricardo Quintana","doi":"10.1142/s0129626419500142","DOIUrl":"https://doi.org/10.1142/s0129626419500142","url":null,"abstract":"Filtered-x Least Mean Squares (FxLMS) is an algorithm commonly used for Active Noise Control (ANC) systems in order to cancel undesired acoustic waves from a sound source. There is a small number of hardware designs reported in the literature, that in turn only use one reference signal, one error signal and one output control signal. In this paper, it is proposed a 3-dimensional hardware-based version of the widely used FxLMS algorithm, using one reference microphone, 18 error microphones, one output and a FIR filter of 400[Formula: see text] order. The FxLMS algorithm was implemented in a Xilinx Artix 7 FPGA running at 25 MHz, which allowed to update the filter coefficients in 32.44[Formula: see text] s. The main idea behind this work is to propose a pipelined parallelized architecture to achieve processing times faster than real time for the filter coefficients update. The main contribution of this work is not the ANC technique itself, but rather the proposed hardware implementation that utilizes integer arithmetic, which provided an acceptable error when benchmarked with a software implementation. This parallel system allows a scalable implementation as an advantage of using FPGA without compromising the computational cost and, consequently, the latency.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121031568","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 : 2019-08-01DOI: 10.1142/S0129626419500063
Stefan Kehrer, W. Blochinger
With on-demand access to compute resources, pay-per-use, and elasticity, the cloud evolved into an attractive execution environment for High Performance Computing (HPC). Whereas elasticity, which is often referred to as the most beneficial cloud-specific property, has been heavily used in the context of interactive (multi-tier) applications, elasticity-related research in the HPC domain is still in its infancy. Existing parallel computing theory as well as traditional metrics to analytically evaluate parallel systems do not comprehensively consider elasticity, i.e., the ability to control the number of processing units at runtime. To address these issues, we introduce a conceptual framework to understand elasticity in the context of parallel systems, define the term elastic parallel system, and discuss novel metrics for both elasticity control at runtime as well as the ex-post performance evaluation of elastic parallel systems. Based on the conceptual framework, we provide an in-depth analysis of existing research in the field to describe the state-of-the-art and compile our findings into a research agenda for future research on elastic parallel systems.
{"title":"Elastic Parallel Systems for High Performance Cloud Computing: State-of-the-Art and Future Directions","authors":"Stefan Kehrer, W. Blochinger","doi":"10.1142/S0129626419500063","DOIUrl":"https://doi.org/10.1142/S0129626419500063","url":null,"abstract":"With on-demand access to compute resources, pay-per-use, and elasticity, the cloud evolved into an attractive execution environment for High Performance Computing (HPC). Whereas elasticity, which is often referred to as the most beneficial cloud-specific property, has been heavily used in the context of interactive (multi-tier) applications, elasticity-related research in the HPC domain is still in its infancy. Existing parallel computing theory as well as traditional metrics to analytically evaluate parallel systems do not comprehensively consider elasticity, i.e., the ability to control the number of processing units at runtime. To address these issues, we introduce a conceptual framework to understand elasticity in the context of parallel systems, define the term elastic parallel system, and discuss novel metrics for both elasticity control at runtime as well as the ex-post performance evaluation of elastic parallel systems. Based on the conceptual framework, we provide an in-depth analysis of existing research in the field to describe the state-of-the-art and compile our findings into a research agenda for future research on elastic parallel systems.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114249116","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 : 2019-08-01DOI: 10.1142/S0129626419500051
Jinho Ahn
The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.
{"title":"Scalable Sender-Based Message Logging Protocol with Little Communication Overhead for Distributed Systems","authors":"Jinho Ahn","doi":"10.1142/S0129626419500051","DOIUrl":"https://doi.org/10.1142/S0129626419500051","url":null,"abstract":"The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988737","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 : 2019-06-25DOI: 10.1142/s012962642050005x
Y. Sudo, T. Masuzawa
This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.
{"title":"Leader Election Requires Logarithmic Time in Population Protocols","authors":"Y. Sudo, T. Masuzawa","doi":"10.1142/s012962642050005x","DOIUrl":"https://doi.org/10.1142/s012962642050005x","url":null,"abstract":"This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115213129","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
扫码关注我们
求助内容：
应助结果提醒方式：