Int. J. Pervasive Comput. Commun.最新文献

{"title":"Enhanced RSA key encryption application for metering data in smart grid","authors":"Anita Philips, J. Jayaraj, T. JoshF., P. Venkateshkumar","doi":"10.1108/ijpcc-07-2021-0172","DOIUrl":"https://doi.org/10.1108/ijpcc-07-2021-0172","url":null,"abstract":"\u0000Purpose\u0000Digitizing of the electrical power grid promotes the advantages of efficient energy management alongside the possibilities of major vulnerabilities. A typical inadequacy that needs critical attention to ensure the seamless operation of the smart grid system remains in the data transmission between consumer premises smart devices and the utility centres. Many researches aim at establishing security protocols to ensure secure and efficient energy management resulting in perfect demand–supply balance.\u0000\u0000\u0000Design/methodology/approach\u0000In this paper, the authentication of the smart meter data has been proposed with enhanced Rivest–Shamir–Adleman (RSA) key encryption using an efficient way of generating large prime numbers. The trapdoor one-way function applied in the RSA algorithm makes it almost impossible for the reverse engineering attempts of cracking the key pair.\u0000\u0000\u0000Findings\u0000The algorithm for generating prime numbers has been tested both with the convention method and with the enhanced method of including a low-level primality test with a first few hundred primes. The combination of low-level and high-level primality tests shows an improvement in execution time of the algorithm.\u0000\u0000\u0000Originality/value\u0000There is a considerable improvement in the time complexities when using the combination method. This efficient generation of prime numbers can be successfully applied to the smart meter systems, thereby increasing the strength and speed of the key encryption.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321119","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}

{"title":"A framework for scheduling IoT application jobs on fog computing infrastructure based on QoS parameters","authors":"Mandeep Kaur, Rajinder Sandhu, R. Mohana","doi":"10.1108/ijpcc-08-2020-0108","DOIUrl":"https://doi.org/10.1108/ijpcc-08-2020-0108","url":null,"abstract":"\u0000Purpose\u0000The purpose of this study is to verify that if applications categories are segmented and resources are allocated based on their specific category, how effective scheduling can be done?.\u0000\u0000\u0000Design/methodology/approach\u0000This paper proposes a scheduling framework for IoT application jobs, based upon the Quality of Service (QoS) parameters, which works at coarse grained level to select a fog environment and at fine grained level to select a fog node. Fog environment is chosen considering availability, physical distance, latency and throughput. At fine grained (node selection) level, a probability triad (C, M, G) is anticipated using Naïve Bayes algorithm which provides probability of newly submitted application job to fall in either of the categories Compute (C) intensive, Memory (M) intensive and GPU (G) intensive.\u0000\u0000\u0000Findings\u0000Experiment results showed that the proposed framework performed better than traditional cloud and fog computing paradigms.\u0000\u0000\u0000Originality/value\u0000The proposed framework combines types of applications and computation capabilities of Fog computing environment, which is not carried out to the best of knowledge of authors.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131167694","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}

{"title":"Enhanced packet reordering procedure to improve TCP communication","authors":"Sai Prasanthi Kasimsetti, Asdaque Hussain","doi":"10.1108/ijpcc-05-2021-0116","DOIUrl":"https://doi.org/10.1108/ijpcc-05-2021-0116","url":null,"abstract":"\u0000Purpose\u0000The research work is attained by Spurious Transmission–based Enhanced Packet Reordering Method (ST-EPRM). The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss.\u0000\u0000\u0000Design/methodology/approach\u0000Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission.\u0000\u0000\u0000Findings\u0000The research work which is attained by ST-EPRM. The packet reordering necessity is evaded by presenting random linear network coding process on wireless network physical layer which function on basis of sequence numbers. The spurious retransmission happening over wireless network is obtained by presenting monitoring concept for reducing number of spurious retransmissions because it might need more than three DUPACKs for triggering fast retransmit. This monitoring node performs as centralized node as well variation amid buffer length and number of packets being sent can be predicted. This information helps in differentiating spurious retransmission from the packet loss.\u0000\u0000\u0000Originality/value\u0000Based on transmission detection, action is accomplished whether to retransmit or evade transmission. Monitoring node selection is achieved by presenting improved cuckoo search algorithm. The modified support vector machine algorithm is greatly used for variation-based spurious transmission.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128204788","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}

{"title":"Multi-viewpoints visual models for efficient modeling and analysis of Twitter based health-care services","authors":"Noorullah R. Mohammed, Moulana Mohammed","doi":"10.1108/IJPCC-06-2021-0140","DOIUrl":"https://doi.org/10.1108/IJPCC-06-2021-0140","url":null,"abstract":"","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132354149","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}

{"title":"Task scheduling and resource allocation of seasonal requests of users in cloud using NMKA and CM-GA techniques","authors":"S. Prathiba, S. Sankar","doi":"10.1108/ijpcc-04-2021-0089","DOIUrl":"https://doi.org/10.1108/ijpcc-04-2021-0089","url":null,"abstract":"\u0000Purpose\u0000The purpose of this paper is to provide energy-efficient task scheduling and resource allocation (RA) in cloud data centers (CDC).\u0000\u0000\u0000Design/methodology/approach\u0000Task scheduling and RA is proposed in this paper for cloud environment, which schedules the user’s seasonal requests and allocates resources in an optimized manner. The proposed study does the following operations: data collection, feature extraction, feature reduction and RA. Initially, the online streaming data of seasonal requests of multiple users were gathered. After that, the features are extracted based on user requests along with the cloud server, and the extracted features are lessened using modified principal component analysis. For RA, the split data of the user request is identified and that data is pre-processed by computing closed frequent itemset along with entropy values. After that, the user requests are scheduled using the normalized K-means algorithm (NKMA) centered on the entropy values. Finally, the apt resources are allotted to that scheduled task using the Cauchy mutation-genetic algorithm (CM-GA). The investigational outcomes exhibit that the proposed study outruns other existing algorithms in respect to response time, execution time, clustering accuracy, precision and recall.\u0000\u0000\u0000Findings\u0000The proposed NKMA and CM-GA technique’s performance is analyzed by comparing them with the existing techniques. The NKMA performance is analyzed with KMA and Fuzzy C-means regarding Prc (Precision), Rca (Recall), F ms (f measure), Acr (Accuracy)and Ct (Clustering Time). The performance is compared to about 500 numbers of tasks. For all tasks, the NKMA provides the highest values for Prc, Rca, Fms and Acr, takes the lowest time (Ct) for clustering the data. Then, the CM-GA optimization for optimally allocating the resource in the cloud is contrasted with the GA and particle swarm optimization with respect to Rt (Response Time), Pt (Process Time), Awt (Average Waiting Time), Atat (Average Turnaround Time), Lcy (Latency) and Tp (Throughput). For all number of tasks, the proposed CM-GA gives the lowest values for Rt, Pt, Awt, Atat and Lcy and also provides the highest values for Tp. So, from the results, it is known that the proposed technique for seasonal requests RA works well and the method optimally allocates the resources in the cloud.\u0000\u0000\u0000Originality/value\u0000The proposed approach provides energy-efficient task scheduling and RA and it paves the way for the development of effective CDC.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115261293","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}

{"title":"QoS aware web service selection using orthogonal array learning on fruit fly optimization approach","authors":"Manik Chandra, R. Niyogi","doi":"10.1108/ijpcc-08-2020-0101","DOIUrl":"https://doi.org/10.1108/ijpcc-08-2020-0101","url":null,"abstract":"\u0000Purpose\u0000This paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue.\u0000\u0000\u0000Design/methodology/approach\u0000In this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism.\u0000\u0000\u0000Findings\u0000To test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability.\u0000\u0000\u0000Originality/value\u0000In this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122413146","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}

{"title":"Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks","authors":"N. Jain, A. Payal, Aarti Jain","doi":"10.1108/IJPCC-02-2021-0036","DOIUrl":"https://doi.org/10.1108/IJPCC-02-2021-0036","url":null,"abstract":"\u0000Purpose\u0000The purpose of this study is to calculate the effect of different packet sizes 256, 512, 1,024 and 2,048 bytes on a large-scale hybrid network and analysis and identifies which routing protocol is best for application throughput, application delay and network link parameters for different packet sizes. As the routing protocol is used to select the optimal path to transfer data packets from source to destination. It is always important to consider the performance of the routing protocol before the final network configuration. From the literature, it has been observed that RIP (Routing Information Protocol) and OSPF (Open Shortest Path First) are the most popular routing protocols, and it has always been a challenge to select between these routing protocols, especially for hybrid networks. The efficiency of routing protocol mainly depends on resulting throughput and delay. Also, it has been observed that data packet size also plays an essential role in determining the efficiency of routing protocol.\u0000\u0000\u0000Design/methodology/approach\u0000To analyse the effect of different packet sizes using two routing protocols, routing information protocol (RIP) and open shortest path first (OSPF) on the hybrid network, require detailed planning. Designing the network for simulate and then finally analysing the results requires proper study. Each stage needs to be understood well for work accomplishment. Thus, the network’s simulation and evaluation require implementing the proposed work step by step, saving time and cost. Here, the proposed work methodology is defined in six steps or stages.\u0000\u0000\u0000Findings\u0000The simulation results show that both routing protocols – RIP and OSPF are equally good in terms of network throughput for all different packet sizes. However, OSPF performs better in terms of network delay than RIP routing protocol in different packet size scenarios.\u0000\u0000\u0000Research limitations/implications\u0000In this paper, a fixed network of 125 objects and only RIP and OSPF routing protocol have been used for analysis. Therefore, in the future, a comparison of different network sizes can be considered by increasing or decreasing the number of objects in the proposed network. Furthermore, the other routing protocols can be used for performance evaluation on the same proposed network.\u0000\u0000\u0000Originality/value\u0000The analysis can be conducted by simulation of the network, enabling us to develop a network environment without restricting the selection of parameters as it minimizes cost, network deployment overhead, human resources, etc. The results are analysed, calculated and compared for each packet size on different routing protocol networks individually and the conclusion is made.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121302738","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}

{"title":"An enhanced network intrusion detection system for malicious crawler detection and security event correlations in ubiquitous banking infrastructure","authors":"Sivaraman Eswaran, Vakula Rani, Daniel Dominic, Jayabrabu Ramakrishnan, S. Selvakumar","doi":"10.1108/ijpcc-04-2021-0102","DOIUrl":"https://doi.org/10.1108/ijpcc-04-2021-0102","url":null,"abstract":"\u0000Purpose\u0000In the recent era, banking infrastructure constructs various remotely handled platforms for users. However, the security risk toward the banking sector has also elevated, as it is visible from the rising number of reported attacks against these security systems. Intelligence shows that cyberattacks of the crawlers are increasing. Malicious crawlers can crawl the Web pages, crack the passwords and reap the private data of the users. Besides, intrusion detection systems in a dynamic environment provide more false positives. The purpose of this research paper is to propose an efficient methodology to sense the attacks for creating low levels of false positives.\u0000\u0000\u0000Design/methodology/approach\u0000In this research, the authors have developed an efficient approach for malicious crawler detection and correlated the security alerts. The behavioral features of the crawlers are examined for the recognition of the malicious crawlers, and a novel methodology is proposed to improvise the bank user portal security. The authors have compared various machine learning strategies including Bayesian network, support sector machine (SVM) and decision tree.\u0000\u0000\u0000Findings\u0000This proposed work stretches in various aspects. Initially, the outcomes are stated for the mixture of different kinds of log files. Then, distinct sites of various log files are selected for the construction of the acceptable data sets. Session identification, attribute extraction, session labeling and classification were held. Moreover, this approach clustered the meta-alerts into higher level meta-alerts for fusing multistages of attacks and the various types of attacks.\u0000\u0000\u0000Originality/value\u0000This methodology used incremental clustering techniques and analyzed the probability of existing topologies in SVM classifiers for more deterministic classification. It also enhanced the taxonomy for various domains.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122861670","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}

{"title":"Design and analysis of buffer and bufferless routing based NoC for high throughput and low latency communication on FPGA","authors":"B. SujataS., Anuradha M. Sandi","doi":"10.1108/ijpcc-05-2021-0115","DOIUrl":"https://doi.org/10.1108/ijpcc-05-2021-0115","url":null,"abstract":"\u0000Purpose\u0000The small area network for data communication within routers is suffering from storage of packet, throughput, latency and power consumption. There are a lot of solutions to increase speed of commutation and optimization of power consumption; one among them is Network-on-chip (NoC). In the literature, there are several NoCs which can reconfigurable dynamically and can easily test and validate the results on FPGA. But still, NoCs have limitations which are regarding chip area, reconfigurable time and throughput.\u0000\u0000\u0000Design/methodology/approach\u0000To address these limitations, this research proposes the dynamically buffered and bufferless reconfigurable NoC (DB2R NoC) using X-Y algorithm for routing, Torus for switching and Flexible Direction Order (FDOR) for direction finding between source and destination nodes. Thus, the 3 × 3 and 4 × 4 DB2R NoCs are made free from deadlock, low power and latency and high throughput. To prove the applicability and performance analysis of DB2R NoC for 3 × 3 and 4 × 4 routers on FPGA, the 22 bits for buffered and 19 bit for bufferless designs have been successfully synthesized using Verilog HDL and implemented on Artix-7 FPGA development bond. The virtual input/output chips cope pro tool has been incorporated in the design to verify and debug the complete design on Artix-7 FPGA.\u0000\u0000\u0000Findings\u0000In the obtained result, it has been found that 35% improvement in throughput, 23% improvement in latency and 47% optimization in area has been made. The complete design has been tested for 28 packets of injection rate 0.01; the packets have been generated by using NLFSR.\u0000\u0000\u0000Originality/value\u0000In the obtained result, it has been found that 35% improvement in throughput, 23% improvement in latency and 47% optimization in area has been made. The complete design has been tested for 28 packets of injection rate 0.01; the packets have been generated by using NLFSR.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128168413","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}

{"title":"A novel design layout of three disjoint paths multistage interconnection network & its reliability analysis","authors":"Vipin Sharma, Abdul Q. Ansari, Rajesh Mishra","doi":"10.1108/ijpcc-04-2021-0094","DOIUrl":"https://doi.org/10.1108/ijpcc-04-2021-0094","url":null,"abstract":"\u0000Purpose\u0000The purpose of this paper is to design a efficient layout of Multistage interconnection network which has cost effective solution with high reliability and fault-tolerence capability. For parallel computation, various multistage interconnection networks (MINs) have been discussed hitherto in the literature, however, these networks always required further improvement in reliability and fault-tolerance capability. The fault-tolerance capability of the network can be achieved by increasing the number of disjoint paths as a result the reliability of the interconnection networks is also improved.\u0000\u0000\u0000Design/methodology/approach\u0000This proposed design is a modification of gamma interconnection network (GIN) and three disjoint path gamma interconnection network (3-DGIN). It has a total seven number of paths for all tag values which is uniform out of these seven paths, three paths are disjoint paths which increase the fault tolerance capability by two faults. Due to the presence of more paths than the GIN and 3-DGIN, this proposed design is more reliable.\u0000\u0000\u0000Findings\u0000In this study, a new design layout of a MIN has been proposed which provides three disjoint paths and uniformity in terms of an equal number of paths for all source-destination (S-D) pairs. The new layout contains fewer nodes as compared to GIN and 3-DGIN. This design provides a symmetrical structure, low cost, better terminal reliability and provides an equal number of paths for all tag values (|S-D|) when compared with existing MINs of this class.\u0000\u0000\u0000Originality/value\u0000A new design layout of MINs has been purposed and its two terminal reliability is calculated with the help of the reliability block diagram technique.\u0000","PeriodicalId":210948,"journal":{"name":"Int. J. Pervasive Comput. Commun.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631904","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}