Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017064
Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li
The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.
{"title":"GPU acceleration of finding LPRs in DNA sequence based on SUA index","authors":"Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li","doi":"10.1109/PCCC.2014.7017064","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017064","url":null,"abstract":"The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116420976","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017098
Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang
Content Delivery Network (CDN) is proposed for replicating data objects at multiple locations in the network and encounters vast potential for future development, as a result of which, a number of replica placement techniques have been proposed over the last decade. However, most of the existing works on replica placement (RP) ignore the statistical property of the demands and the restricted service rate of the servers. In this paper, we investigate the techniques of replica placement in CDNs with stochastic demands and M/M/1 servers to optimize the overall performance in the network. We first model the demands and the servers as independent Poisson streams and simple M/M/1 queueing systems, respectively. Then, a formal definition and formalization of RP problem will be given. We show that RP problem is NP-complete and propose two heuristic algorithms: Greedy Dropping (GD) and Tabu Search (TS). We conduct abundant simulation experiments to evaluate the performance of our proposed algorithms. According to our simulation results, both of the two algorithms are efficient in finding a feasible solution with high probability. Especially, the TS decreases the average delay of the demands about 50% on average.
{"title":"Replica placement in content delivery networks with stochastic demands and M/M/1 servers","authors":"Chenkai Yang, Liusheng Huang, Bing Leng, Hongli Xu, Xinglong Wang","doi":"10.1109/PCCC.2014.7017098","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017098","url":null,"abstract":"Content Delivery Network (CDN) is proposed for replicating data objects at multiple locations in the network and encounters vast potential for future development, as a result of which, a number of replica placement techniques have been proposed over the last decade. However, most of the existing works on replica placement (RP) ignore the statistical property of the demands and the restricted service rate of the servers. In this paper, we investigate the techniques of replica placement in CDNs with stochastic demands and M/M/1 servers to optimize the overall performance in the network. We first model the demands and the servers as independent Poisson streams and simple M/M/1 queueing systems, respectively. Then, a formal definition and formalization of RP problem will be given. We show that RP problem is NP-complete and propose two heuristic algorithms: Greedy Dropping (GD) and Tabu Search (TS). We conduct abundant simulation experiments to evaluate the performance of our proposed algorithms. According to our simulation results, both of the two algorithms are efficient in finding a feasible solution with high probability. Especially, the TS decreases the average delay of the demands about 50% on average.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"41 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114039600","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017046
Jeremiah D. Deng
Delay tolerant networks under wireless intermittent settings have gathered growing research interests in recent years. There remains, however, a lacking of performance modelling results for DTN protocols. In this paper, we propose to model the system-level performance of DTN protocols using the Erlang B queueing model, and profile the performance metrics such as message delivery ratios under different traffic conditions using the system capacity measurements. A number of common DTN protocols are evaluated using a scenario based on map-based mobility under different settings.
{"title":"Empirical capacity modeling and evaluation of delay tolerant network routing protocols","authors":"Jeremiah D. Deng","doi":"10.1109/PCCC.2014.7017046","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017046","url":null,"abstract":"Delay tolerant networks under wireless intermittent settings have gathered growing research interests in recent years. There remains, however, a lacking of performance modelling results for DTN protocols. In this paper, we propose to model the system-level performance of DTN protocols using the Erlang B queueing model, and profile the performance metrics such as message delivery ratios under different traffic conditions using the system capacity measurements. A number of common DTN protocols are evaluated using a scenario based on map-based mobility under different settings.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673329","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017023
Timothy Matti, Yuntao Zhu, Kuai Xu
Detecting financial fraud is a daunting challenge for banks and credit card companies due to massive amount of transaction data and wide diversity of user behaviors [1]. In recent years social media has demonstrated the capability of crowdsourcing in a broad range of applications, e.g., disseminating breaking news, launching marketing campaigns, and tracking the flu [2], [3], [4]. Inspired by these novel applications, this paper explores the benefits of social media crowdsourcing, in particularly the tweets, re-tweets and comments from Twitter online social network for effectively detecting financial fraud events.
{"title":"Financial fraud detection using social media crowdsourcing","authors":"Timothy Matti, Yuntao Zhu, Kuai Xu","doi":"10.1109/PCCC.2014.7017023","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017023","url":null,"abstract":"Detecting financial fraud is a daunting challenge for banks and credit card companies due to massive amount of transaction data and wide diversity of user behaviors [1]. In recent years social media has demonstrated the capability of crowdsourcing in a broad range of applications, e.g., disseminating breaking news, launching marketing campaigns, and tracking the flu [2], [3], [4]. Inspired by these novel applications, this paper explores the benefits of social media crowdsourcing, in particularly the tweets, re-tweets and comments from Twitter online social network for effectively detecting financial fraud events.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114816746","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017092
B. Barrefors, Ying Lu, Shivashis Saha, J. Deogun
Next-generation multiprocessor real-time systems consume less energy at the cost of increased power density. This increase in power density results in high heat density and may affect the reliability and performance of real-time systems. Thus, incorporating maximum temperature constraints in scheduling of real-time task sets is an important challenge. This paper investigates a novel algorithm for thermal-constrained energy-aware partitioning of periodic real-time tasks in heterogeneous multiprocessor systems. When designing our new algorithm, we have applied insights gained from a famous knapsack problem solution. Both simulation and experimental results show that our new branch-and-bound based partitioning algorithm can significantly reduce the total energy consumption of multiprocessor real-time systems.
{"title":"A novel thermal-constrained energy-aware partitioning algorithm for heterogeneous multiprocessor real-time systems","authors":"B. Barrefors, Ying Lu, Shivashis Saha, J. Deogun","doi":"10.1109/PCCC.2014.7017092","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017092","url":null,"abstract":"Next-generation multiprocessor real-time systems consume less energy at the cost of increased power density. This increase in power density results in high heat density and may affect the reliability and performance of real-time systems. Thus, incorporating maximum temperature constraints in scheduling of real-time task sets is an important challenge. This paper investigates a novel algorithm for thermal-constrained energy-aware partitioning of periodic real-time tasks in heterogeneous multiprocessor systems. When designing our new algorithm, we have applied insights gained from a famous knapsack problem solution. Both simulation and experimental results show that our new branch-and-bound based partitioning algorithm can significantly reduce the total energy consumption of multiprocessor real-time systems.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117173430","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017047
Tiantian Ren, Xinli Huang
With the increasing scale of cloud datacenters, the volumes of traffic flows inside a single datacenter become larger. An effective virtual machine (VM) replacement among physical machines (PMs) can improve resource utilization rate and reduce overall network cost in cloud datacenters. In this paper, we propose a Modified Max-Min Ant Colony Optimization (M3ACO) algorithm which can be used to solve the VMs replacement problem. Furthermore, we apply the M3ACO algorithm into a new framework based on Software Defined Network (SDN), which provides an integrated solution for resource optimization problem in cloud datacenters.
{"title":"A modified max-min ant colony optimization algorithm for virtual machines replacement in cloud datacenter§","authors":"Tiantian Ren, Xinli Huang","doi":"10.1109/PCCC.2014.7017047","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017047","url":null,"abstract":"With the increasing scale of cloud datacenters, the volumes of traffic flows inside a single datacenter become larger. An effective virtual machine (VM) replacement among physical machines (PMs) can improve resource utilization rate and reduce overall network cost in cloud datacenters. In this paper, we propose a Modified Max-Min Ant Colony Optimization (M3ACO) algorithm which can be used to solve the VMs replacement problem. Furthermore, we apply the M3ACO algorithm into a new framework based on Software Defined Network (SDN), which provides an integrated solution for resource optimization problem in cloud datacenters.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123048148","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017033
Mario J. Illera, S. Sepulveda
A key parameter in the analysis of electronic devices behavior is their current-voltage curve, also known as characteristic curve. This information allows the designer to select the type of components required for a given application in order to obtain an optimal system performance. This paper presents a low-cost and low-power consumption embedded system able to accurately generate the characteristic curve of electronic devices. Microcontroller PIC18F4550 effectively handles different serial communication protocols to exchange data between a Java application running on a computer and different peripheral devices. The firmware within the microcontroller receives data from the Java interface and executes an algorithm to send a series of analog voltages to the element being characterized and it also measures the resultant current for each voltage; then, the pair of data points is sent back to the Java application to build the plot. The resultant data can be exported to a spreadsheet to be further analyzed. We characterized different electronic devices to evaluate the performance of the prototype. Successful repeatability tests and validation of theoretical models with experimental data indicated that the embedded system developed is accurate and reliable.
{"title":"Embedded system based on microcontroller for generating I-V curves of electronic devices","authors":"Mario J. Illera, S. Sepulveda","doi":"10.1109/PCCC.2014.7017033","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017033","url":null,"abstract":"A key parameter in the analysis of electronic devices behavior is their current-voltage curve, also known as characteristic curve. This information allows the designer to select the type of components required for a given application in order to obtain an optimal system performance. This paper presents a low-cost and low-power consumption embedded system able to accurately generate the characteristic curve of electronic devices. Microcontroller PIC18F4550 effectively handles different serial communication protocols to exchange data between a Java application running on a computer and different peripheral devices. The firmware within the microcontroller receives data from the Java interface and executes an algorithm to send a series of analog voltages to the element being characterized and it also measures the resultant current for each voltage; then, the pair of data points is sent back to the Java application to build the plot. The resultant data can be exported to a spreadsheet to be further analyzed. We characterized different electronic devices to evaluate the performance of the prototype. Successful repeatability tests and validation of theoretical models with experimental data indicated that the embedded system developed is accurate and reliable.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493640","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017034
Hayala Nepomuceno Curto, A. Ziviani, J. Caetano, Carlos Henrique S. Malab, J. Almeida, H. T. Marques-Neto
The high popularity of human communication based on mobile phone services exhibits different behaviors in different places and time. Large-scale events, such as the FIFA World Cup, create an auspicious atmosphere for the attendees to use such services to share their experiences with relatives and friends. This work characterizes the workload dynamics of a major mobile phone network on different days when major soccer matches took place in Rio de Janeiro, Brazil. We analyze the usage behavior of three profiles of attendees of two major matches of the FIFA 2014 World Cup, including the final between Germany and Argentina on July 13, 2014. We compare these profiles with similar results computed on a dataset of calls and SMS collected on the day of the final match of 2013 Brazilian Cup, which happened at the same stadium of the World Cup final. We note that users of each analyzed profile, i.e. (i) attendees who made cellphone calls and sent SMS messages, (ii) attendees who only made calls, and (iii) attendees who only sent SMS, have different behaviors in different periods of the event.
{"title":"Characterizing the workload dynamics of a mobile phone network during the FIFA 2014 World Cup","authors":"Hayala Nepomuceno Curto, A. Ziviani, J. Caetano, Carlos Henrique S. Malab, J. Almeida, H. T. Marques-Neto","doi":"10.1109/PCCC.2014.7017034","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017034","url":null,"abstract":"The high popularity of human communication based on mobile phone services exhibits different behaviors in different places and time. Large-scale events, such as the FIFA World Cup, create an auspicious atmosphere for the attendees to use such services to share their experiences with relatives and friends. This work characterizes the workload dynamics of a major mobile phone network on different days when major soccer matches took place in Rio de Janeiro, Brazil. We analyze the usage behavior of three profiles of attendees of two major matches of the FIFA 2014 World Cup, including the final between Germany and Argentina on July 13, 2014. We compare these profiles with similar results computed on a dataset of calls and SMS collected on the day of the final match of 2013 Brazilian Cup, which happened at the same stadium of the World Cup final. We note that users of each analyzed profile, i.e. (i) attendees who made cellphone calls and sent SMS messages, (ii) attendees who only made calls, and (iii) attendees who only sent SMS, have different behaviors in different periods of the event.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124069210","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 : 2014-12-01DOI: 10.1109/PCCC.2014.7017082
Z. Zhao, Xuanxuan Wu, Xin Zhang, Jing Zhao, Xiangyang Li
Wireless coexistence is crucial with the explosive development of wireless technologies in recent years. The coexistence issues of IEEE 802.11 b/g and IEEE 802.15.4 have been well studied, however few work focused on 802.11n new features including MIMO, channel bonding and frame aggregation. In this paper, we conducted extensive experiments to understand how 802.11n impact on 802.15.4 and vice versa in a systematic way. We consider primary features of 802.11n both in symmetric and asymmetric scenarios. The goal of our work is to gain more insights into the coexistence issues of 802.11n and 802.15.4 and thus to help protocol design and co-located network deployments.
{"title":"ZigBee vs WiFi: Understanding issues and measuring performances of their coexistence","authors":"Z. Zhao, Xuanxuan Wu, Xin Zhang, Jing Zhao, Xiangyang Li","doi":"10.1109/PCCC.2014.7017082","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017082","url":null,"abstract":"Wireless coexistence is crucial with the explosive development of wireless technologies in recent years. The coexistence issues of IEEE 802.11 b/g and IEEE 802.15.4 have been well studied, however few work focused on 802.11n new features including MIMO, channel bonding and frame aggregation. In this paper, we conducted extensive experiments to understand how 802.11n impact on 802.15.4 and vice versa in a systematic way. We consider primary features of 802.11n both in symmetric and asymmetric scenarios. The goal of our work is to gain more insights into the coexistence issues of 802.11n and 802.15.4 and thus to help protocol design and co-located network deployments.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545121","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}
Application launch time is an important performance metric to user experience in desktop environment. The launch time mostly depends on the performance of secondary storage. There is a cost-performance trade-off in using hard disk drive (HDD) or solid-state drive (SSD). Thus, application launch times can be reduced by utilizing SSDs as caches for slow HDDs. We propose a new SSD caching scheme which migrates data blocks from HDDs to SSDs. Since our scheme operates entirely in the file system level and does not require an extra layer for mapping SSD-cached data, which is essential in most other schemes, our scheme does not incur mapping overheads that cause significant burdens on main memory, CPU, and SSD cache itself. Experimental results demonstrate our scheme yields 56% of performance gain in application launch.
{"title":"File-system-level flash caching for improving application launch time on logical hybrid disks","authors":"Chang-Hycok Han, Junhee Ryu, Dongeun Lee, Jaemyoun Lee, Kyungtae Kang, Heonshik Shin","doi":"10.1109/PCCC.2014.7017019","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017019","url":null,"abstract":"Application launch time is an important performance metric to user experience in desktop environment. The launch time mostly depends on the performance of secondary storage. There is a cost-performance trade-off in using hard disk drive (HDD) or solid-state drive (SSD). Thus, application launch times can be reduced by utilizing SSDs as caches for slow HDDs. We propose a new SSD caching scheme which migrates data blocks from HDDs to SSDs. Since our scheme operates entirely in the file system level and does not require an extra layer for mapping SSD-cached data, which is essential in most other schemes, our scheme does not incur mapping overheads that cause significant burdens on main memory, CPU, and SSD cache itself. Experimental results demonstrate our scheme yields 56% of performance gain in application launch.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133593","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
扫码关注我们
求助内容：
应助结果提醒方式：