Pub Date : 2012-10-01DOI: 10.1109/WICT.2012.6409062
M. Bokhari, F. Masoodi
This paper presents BOKHARI; a new proposed software-oriented stream cipher constructed using a Non-linear feedback shift register and a Non linear filter function and is designed for a secret key that is up to 128 bits in length. The BOKHARI stream cipher uses both basic design principles from the stream cipher SOBER-Ü6 and transformations derived from the steam cipher DRAGON.
{"title":"BOKHARI: A new software oriented stream cipher: A proposal","authors":"M. Bokhari, F. Masoodi","doi":"10.1109/WICT.2012.6409062","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409062","url":null,"abstract":"This paper presents BOKHARI; a new proposed software-oriented stream cipher constructed using a Non-linear feedback shift register and a Non linear filter function and is designed for a secret key that is up to 128 bits in length. The BOKHARI stream cipher uses both basic design principles from the stream cipher SOBER-Ü6 and transformations derived from the steam cipher DRAGON.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130681809","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409241
Tao Sun, Weiheng Chen, Yang Liu, Hongfeng Sun
Anomaly detection is always a challenge for wireless sensor network (WSN). In some applications, researchers compare the number of abnormal nodes with the pre-provided threshold to detect the anomaly. But, it involves the whole abnormal nodes in WSN and consumes lots of resources. In this paper, we proposed a probability-based algorithm for anomaly detection which reduces involved nodes and consumes fewer resources. The experimental results demonstrate that, the algorithm can satisfies demand of query and is effective to reduce the cost of communication band and power energy by choosing appropriate parameters.
{"title":"A probability-based approximate algorithm for anomaly detection in WSN","authors":"Tao Sun, Weiheng Chen, Yang Liu, Hongfeng Sun","doi":"10.1109/WICT.2012.6409241","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409241","url":null,"abstract":"Anomaly detection is always a challenge for wireless sensor network (WSN). In some applications, researchers compare the number of abnormal nodes with the pre-provided threshold to detect the anomaly. But, it involves the whole abnormal nodes in WSN and consumes lots of resources. In this paper, we proposed a probability-based algorithm for anomaly detection which reduces involved nodes and consumes fewer resources. The experimental results demonstrate that, the algorithm can satisfies demand of query and is effective to reduce the cost of communication band and power energy by choosing appropriate parameters.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131010207","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409182
Mohamed Sami, Nashwa El-Bendary, A. Hassanien
This paper presents an automatic image annotation approach that integrates the Naive Bayes classifier with particle swarm optimization algorithm for classes' probabilities weighting. The proposed hybrid approach refines the output of multi-class classification that is based on the usage of Naive Bayes classifier for automatically labeling images with a number of words. Each input image is segmented using the normalized cuts segmentation algorithm in order to create a descriptor for each segment. One Naive Bayes classifier is trained for all the classes. Particle swarm optimization algorithm is employed as a search strategy in order to identify an optimal weighting for classes probabilities from Naive Bayes classifier. The proposed approach has been applied on Corel5K benchmark dataset. Experimental results and comparative performance evaluation, for results obtained from the proposed approach and other related researches, demonstrate that the proposed approach outperforms the performance of the other approaches, considering annotation accuracy, for the experimented dataset.
{"title":"Automatic image annotation via incorporating Naive Bayes with particle swarm optimization","authors":"Mohamed Sami, Nashwa El-Bendary, A. Hassanien","doi":"10.1109/WICT.2012.6409182","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409182","url":null,"abstract":"This paper presents an automatic image annotation approach that integrates the Naive Bayes classifier with particle swarm optimization algorithm for classes' probabilities weighting. The proposed hybrid approach refines the output of multi-class classification that is based on the usage of Naive Bayes classifier for automatically labeling images with a number of words. Each input image is segmented using the normalized cuts segmentation algorithm in order to create a descriptor for each segment. One Naive Bayes classifier is trained for all the classes. Particle swarm optimization algorithm is employed as a search strategy in order to identify an optimal weighting for classes probabilities from Naive Bayes classifier. The proposed approach has been applied on Corel5K benchmark dataset. Experimental results and comparative performance evaluation, for results obtained from the proposed approach and other related researches, demonstrate that the proposed approach outperforms the performance of the other approaches, considering annotation accuracy, for the experimented dataset.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130422432","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409205
D. Vir, S. Agarwal, S. A. Imam
Mobile Ad hoc Network (MANET) is the collection of the mobile nodes without the aid of fixed infrastructure. The communication in MANET is therefore completely dependent on the nodes of the network. For the efficient working of the network various routing protocols have been developed. These protocols improve the efficiency of MANET by providing the path between distant nodes through multi-hop links. The performance of the protocols is affected by the various factors. One such factor is the mobility of the nodes. This paper provides the comparative analysis of various routing protocols used in day to day scenario under the effect of various mobility models: viz File, Group and Random Way Point Mobility Model. The results show significant impact of mobility models on performance of routing protocols.
{"title":"Quantitative analyses and evaluation of MANET routing protocols in effect of varying mobility model using Qual-Net simulator","authors":"D. Vir, S. Agarwal, S. A. Imam","doi":"10.1109/WICT.2012.6409205","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409205","url":null,"abstract":"Mobile Ad hoc Network (MANET) is the collection of the mobile nodes without the aid of fixed infrastructure. The communication in MANET is therefore completely dependent on the nodes of the network. For the efficient working of the network various routing protocols have been developed. These protocols improve the efficiency of MANET by providing the path between distant nodes through multi-hop links. The performance of the protocols is affected by the various factors. One such factor is the mobility of the nodes. This paper provides the comparative analysis of various routing protocols used in day to day scenario under the effect of various mobility models: viz File, Group and Random Way Point Mobility Model. The results show significant impact of mobility models on performance of routing protocols.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830734","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409248
Xiaoqing Weng, Shimin Qin
Multivariate time series (MTS) are used in very broad areas such as finance, medicine, multimedia and speech recognition. Most of existing approaches for MTS classification are not designed for preserving the within-class local structure of the MTS dataset. The within-class local structure is important when a classifier is used for classification. In this paper, a new feature extraction method for MTS classification based on supervised locally linear embedding (LLE) and generalized regression network is proposed. MTS samples in training dataset are projected into a low dimensional space by using the supervised LLE, its mapping function can be learned by generalized regression network. Experimental results performed on six real-world datasets demonstrate the effectiveness of our proposed approach for MTS classification.
{"title":"Classification of multivariate time series using supervised locally linear embedding","authors":"Xiaoqing Weng, Shimin Qin","doi":"10.1109/WICT.2012.6409248","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409248","url":null,"abstract":"Multivariate time series (MTS) are used in very broad areas such as finance, medicine, multimedia and speech recognition. Most of existing approaches for MTS classification are not designed for preserving the within-class local structure of the MTS dataset. The within-class local structure is important when a classifier is used for classification. In this paper, a new feature extraction method for MTS classification based on supervised locally linear embedding (LLE) and generalized regression network is proposed. MTS samples in training dataset are projected into a low dimensional space by using the supervised LLE, its mapping function can be learned by generalized regression network. Experimental results performed on six real-world datasets demonstrate the effectiveness of our proposed approach for MTS classification.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115941711","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409228
Xingxing Huo, Jiangqiang Hu, Zeyu Li
A new kind of algorithm of controller for ship is proposed. BP neural network based PID control is one of artificial neural networks which can emulate ship's manual steering as autopilot for ship steering. This paper introduces the principle, characteristics and learning algorithm of the BP neural network. Getting BP neural network based PID control for ship steering by combining BP neural network and traditional PID. Making use of MATLAB, simulate this new kind of controller for ship in consideration of disturbances of wind, wave and current and without them respectively. The simulation shows that the BP neural network based PID control for ship steering can improve the robustness of the system and has better adapt ability to the ship model etc.
{"title":"BP neural network based PID control for ship steering","authors":"Xingxing Huo, Jiangqiang Hu, Zeyu Li","doi":"10.1109/WICT.2012.6409228","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409228","url":null,"abstract":"A new kind of algorithm of controller for ship is proposed. BP neural network based PID control is one of artificial neural networks which can emulate ship's manual steering as autopilot for ship steering. This paper introduces the principle, characteristics and learning algorithm of the BP neural network. Getting BP neural network based PID control for ship steering by combining BP neural network and traditional PID. Making use of MATLAB, simulate this new kind of controller for ship in consideration of disturbances of wind, wave and current and without them respectively. The simulation shows that the BP neural network based PID control for ship steering can improve the robustness of the system and has better adapt ability to the ship model etc.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681942","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409165
Md. Iqbal Quraishi, J. P. Choudhury, M. De, G. Das, A. Bhattacharjee
Our paper is based on the glimpse of comparative analysis of Image Enhancement techniques via different soft computing techniques, i.e Differential Evolution, Harmony Search, Bacterial Foraging Optimization and a hybrid Particle Swarm Adapted Bacterial Forgaing Optimization algorithm. Particle Swarm Adapted Bacterial Foraging (PS-BFO) is a new algorithm that has shown superior results in proportional integral derivative controller tuning application. In order to examine the global search capability of PS-BFO, we evaluate the performance of BFOA and PS-BFO on 23 numerical benchmark functions. In PS-BFO, the search directions of tumble behavior for each bacterium are oriented by the individual's best location and the global best location. The experimental results show that PS-BFO performs much better than BFOA for almost all test functions. That's approved that the PSO oriented BFO by strategy improve its global optimization capability. Results are compared with other recognition techniques like Differential Evolution, Harmony Search algorithm based image enhancement.
{"title":"A comparative study for Image Enhancement using soft computing models","authors":"Md. Iqbal Quraishi, J. P. Choudhury, M. De, G. Das, A. Bhattacharjee","doi":"10.1109/WICT.2012.6409165","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409165","url":null,"abstract":"Our paper is based on the glimpse of comparative analysis of Image Enhancement techniques via different soft computing techniques, i.e Differential Evolution, Harmony Search, Bacterial Foraging Optimization and a hybrid Particle Swarm Adapted Bacterial Forgaing Optimization algorithm. Particle Swarm Adapted Bacterial Foraging (PS-BFO) is a new algorithm that has shown superior results in proportional integral derivative controller tuning application. In order to examine the global search capability of PS-BFO, we evaluate the performance of BFOA and PS-BFO on 23 numerical benchmark functions. In PS-BFO, the search directions of tumble behavior for each bacterium are oriented by the individual's best location and the global best location. The experimental results show that PS-BFO performs much better than BFOA for almost all test functions. That's approved that the PSO oriented BFO by strategy improve its global optimization capability. Results are compared with other recognition techniques like Differential Evolution, Harmony Search algorithm based image enhancement.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122731032","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409078
Rishabh Dev Chandna, P. Chaubey, S. C. Gupta
Robots.txt non cooperating web crawlers are unwanted by any website as they can create serious negative impact in terms of denial of service, privacy and cost. Defense mechanisms such as automated content access protocol, captcha, web crawler trap, real time bot detection etc. have been proposed to protect websites from unwanted crawler access. Although, the extent of these mechanisms being practically applied against such crawlers is not known clearly. In this paper we present an investigation carried out to get insights about defense mechanisms used by websites against robots.txt non cooperating web crawlers. This investigation is limited only to search engine class of websites. MBot, a self-developed non cooperating web crawler is the primary tool used for investigation. On investigation we find that search engine websites do have defense mechanisms to prevent non cooperating crawler access on them. Although, absence of any kind of defense phenomena to prevent MBot's access is also observed on some of the investigated websites. Robustness in observed defense mechanisms to basic network and application parameters like proxy, port number, user agent, IP address etc. is also observed.
{"title":"Defense response of search engine websites to non cooperating crawlers","authors":"Rishabh Dev Chandna, P. Chaubey, S. C. Gupta","doi":"10.1109/WICT.2012.6409078","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409078","url":null,"abstract":"Robots.txt non cooperating web crawlers are unwanted by any website as they can create serious negative impact in terms of denial of service, privacy and cost. Defense mechanisms such as automated content access protocol, captcha, web crawler trap, real time bot detection etc. have been proposed to protect websites from unwanted crawler access. Although, the extent of these mechanisms being practically applied against such crawlers is not known clearly. In this paper we present an investigation carried out to get insights about defense mechanisms used by websites against robots.txt non cooperating web crawlers. This investigation is limited only to search engine class of websites. MBot, a self-developed non cooperating web crawler is the primary tool used for investigation. On investigation we find that search engine websites do have defense mechanisms to prevent non cooperating crawler access on them. Although, absence of any kind of defense phenomena to prevent MBot's access is also observed on some of the investigated websites. Robustness in observed defense mechanisms to basic network and application parameters like proxy, port number, user agent, IP address etc. is also observed.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134473469","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409117
M. S. Kumar, Satyajit Das, M. Reza
Black Scholes(B-S) model is one of the popular methods of calculating the option prices. It consists of the closed form solution of the linear Black Scholes equation. Researchers have also found the numerical solutions of the Black Scholes equation which is much more intuitive compared to its closed form solution. In this paper, we have compared the analytical solution with the numerical solution of linear Black-Scholes equation governing option pricing. Finite Difference methods (FDMs) are used to discretize B-S equation base on three different schemes namely, Explicit, Implicit and the Crank Nicholson scheme. We have also tried to found out whether this solution are validate to compute the price the options of the higher strike prices such as those of BANKNIFTY options. It is also showed that numerical solutions are independent of number of grids.
Black Scholes(B-S)模型是计算期权价格的常用方法之一。它由线性Black Scholes方程的封闭形式解组成。研究人员还发现了Black Scholes方程的数值解,它比封闭形式的解更直观。本文比较了控制期权定价的线性Black-Scholes方程的解析解和数值解。利用有限差分法(FDMs)对B-S方程进行了显式、隐式和曲克尼克尔森三种不同格式的离散化。我们还试图找出这个解决方案是否有效,以计算更高的执行价格的期权,如BANKNIFTY期权的价格。数值解与网格数无关。
{"title":"A comparison between analytic and numerical solution of linear Black-Scholes equation governing option pricing: Using BANKNIFTY","authors":"M. S. Kumar, Satyajit Das, M. Reza","doi":"10.1109/WICT.2012.6409117","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409117","url":null,"abstract":"Black Scholes(B-S) model is one of the popular methods of calculating the option prices. It consists of the closed form solution of the linear Black Scholes equation. Researchers have also found the numerical solutions of the Black Scholes equation which is much more intuitive compared to its closed form solution. In this paper, we have compared the analytical solution with the numerical solution of linear Black-Scholes equation governing option pricing. Finite Difference methods (FDMs) are used to discretize B-S equation base on three different schemes namely, Explicit, Implicit and the Crank Nicholson scheme. We have also tried to found out whether this solution are validate to compute the price the options of the higher strike prices such as those of BANKNIFTY options. It is also showed that numerical solutions are independent of number of grids.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508743","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 : 2012-10-01DOI: 10.1109/WICT.2012.6409153
K. Patii, B. P. Vijayakumar
Ubiquitous computing is shifting healthcare from treatment by professionals in hospitals to self-care, mobile care, home care and preventive care. In order to support the healthcare evolution. a global healthcare system, which links healthcare service providers to an individual's personal and physical spaces, is expected to provide personalized healthcare services at the right time, right place and right manner. Developing a personalized, user-centric system to provide a peaceful and a better quality life is one of today's challenging issue. This paper discusses on Cognition based context-aware personal medical assistance application. The idea of how we can use a smart phone to learn about the user's daily life pattern in a cognitive way and provide him assistance wherein a smartphone learns about user's daily life pattern in a cognitive way and provide him assistance based on contextual input. This research work describes design and development of mobile application based on cognitive algorithm. The project is designed, developed and being tested at Nokia N-900 device.
{"title":"A cognitive based context-aware personalized medical assistance, A mobile application","authors":"K. Patii, B. P. Vijayakumar","doi":"10.1109/WICT.2012.6409153","DOIUrl":"https://doi.org/10.1109/WICT.2012.6409153","url":null,"abstract":"Ubiquitous computing is shifting healthcare from treatment by professionals in hospitals to self-care, mobile care, home care and preventive care. In order to support the healthcare evolution. a global healthcare system, which links healthcare service providers to an individual's personal and physical spaces, is expected to provide personalized healthcare services at the right time, right place and right manner. Developing a personalized, user-centric system to provide a peaceful and a better quality life is one of today's challenging issue. This paper discusses on Cognition based context-aware personal medical assistance application. The idea of how we can use a smart phone to learn about the user's daily life pattern in a cognitive way and provide him assistance wherein a smartphone learns about user's daily life pattern in a cognitive way and provide him assistance based on contextual input. This research work describes design and development of mobile application based on cognitive algorithm. The project is designed, developed and being tested at Nokia N-900 device.","PeriodicalId":445333,"journal":{"name":"2012 World Congress on Information and Communication Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115684780","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}