Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238397
Samita Rout, M. R. Panda, S. Bisoy, Debapriaya Panda
Performance of routing protocols rely on the node mobility, network size, traffic volume, and connectivity patterns. Increasing number of connections in the wireless network creates more data section and incurs more collision. Therefore, there is a need of identifying efficient routing protocol to provide call services in such network. In this paper, we analyze the performance of routing protocols like dynamic source routing (DSR), ad hoc on demand distance vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) for different network sizes creating multiple TCP connections for different mobile nodes considering random way point (RWP) mobility model. Result shows that AODV protocol achieves higher throughput and packet delivery ratio (PDR) at the cost of more packet loss and routing overhead and DSR achieves lower delay as compared to others.
{"title":"Impact of multiple TCP connections in mobile ad-hoc network considering different network sizes","authors":"Samita Rout, M. R. Panda, S. Bisoy, Debapriaya Panda","doi":"10.1109/ICCIC.2014.7238397","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238397","url":null,"abstract":"Performance of routing protocols rely on the node mobility, network size, traffic volume, and connectivity patterns. Increasing number of connections in the wireless network creates more data section and incurs more collision. Therefore, there is a need of identifying efficient routing protocol to provide call services in such network. In this paper, we analyze the performance of routing protocols like dynamic source routing (DSR), ad hoc on demand distance vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) for different network sizes creating multiple TCP connections for different mobile nodes considering random way point (RWP) mobility model. Result shows that AODV protocol achieves higher throughput and packet delivery ratio (PDR) at the cost of more packet loss and routing overhead and DSR achieves lower delay as compared to others.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"20 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":"114901263","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/ICCIC.2014.7238565
J. Arun, M. Karthikeyan
Cognitive Radio (CR) is an efficient means to improve the under employment of scarce spectrum resource [1]. The proposed A-BPRS (Altruistic Bit Perk Running Scheme) controller, which in turn detects and terminates the presence of Malicious users and it let the white space to be filled by the neighboring reconfigurable secondary users, thereby maximizing the throughput and minimizing the under employment of scarce spectrum resource [2]. In this paper, in conducive to minimize the communication overhead, only one bit decision is consigned to the Fusion center, when the value exists between the decision threshold levels (0 to 70) thereby utilizing the spectrum holes in an efficient way.
认知无线电(Cognitive Radio, CR)是改善稀缺频谱资源利用不足的有效手段[1]。提出的A-BPRS (Altruistic Bit Perk Running Scheme)控制器，该控制器检测并终止恶意用户的存在，并让相邻的可重构辅助用户填充空白，从而最大化吞吐量并最小化稀缺频谱资源的未充分利用[2]。在本文中，为了使通信开销最小化，当决策阈值(0 ~ 70)之间存在时，仅将1位决策委托给Fusion中心，从而有效地利用了频谱孔。
{"title":"Fortification of malicious onslaughts using enhanced fusion centre","authors":"J. Arun, M. Karthikeyan","doi":"10.1109/ICCIC.2014.7238565","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238565","url":null,"abstract":"Cognitive Radio (CR) is an efficient means to improve the under employment of scarce spectrum resource [1]. The proposed A-BPRS (Altruistic Bit Perk Running Scheme) controller, which in turn detects and terminates the presence of Malicious users and it let the white space to be filled by the neighboring reconfigurable secondary users, thereby maximizing the throughput and minimizing the under employment of scarce spectrum resource [2]. In this paper, in conducive to minimize the communication overhead, only one bit decision is consigned to the Fusion center, when the value exists between the decision threshold levels (0 to 70) thereby utilizing the spectrum holes in an efficient way.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"48 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":"116470482","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/ICCIC.2014.7238555
P. Bhuvaneswari, J. Kumar
Understanding cognitive responses of human brain is one of the significant research fields where electroencephalography plays vital role in analyzing brain functionality with respect to brain signals. Electromyography is another modality to understand cognitive responses with respect to muscle activation. In this research work, a data set consists of healthy and myopathy has been considered from physionet data repository. Signal has been decomposed using wavelet transformation. Features such as Shannon, spectral and approximate entropy have been extracted from decomposed signal. Support vector machine has been used for classification. Result shows that first level and third level coefficient shows better classification accuracy than other components. Spectral entropy has good classification results than Shannon and approximate entropy.
{"title":"Classification of electromyography signal using wavelet decomposition method","authors":"P. Bhuvaneswari, J. Kumar","doi":"10.1109/ICCIC.2014.7238555","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238555","url":null,"abstract":"Understanding cognitive responses of human brain is one of the significant research fields where electroencephalography plays vital role in analyzing brain functionality with respect to brain signals. Electromyography is another modality to understand cognitive responses with respect to muscle activation. In this research work, a data set consists of healthy and myopathy has been considered from physionet data repository. Signal has been decomposed using wavelet transformation. Features such as Shannon, spectral and approximate entropy have been extracted from decomposed signal. Support vector machine has been used for classification. Result shows that first level and third level coefficient shows better classification accuracy than other components. Spectral entropy has good classification results than Shannon and approximate entropy.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"116 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":"123489509","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/ICCIC.2014.7238423
R. V. Geetha, S. Kalaivani
Over the past three to four decades the SAR-synthetic Aperture Radar imagery has become a beneficial and important application over the optical Satellite imagery, Because of its ability to operate in all-weather condition and capability of all time data acquisition; The main issue in this imaging technique is presence of grainy noise termed as `speckle', Which will affect the overall quality of image, hence it is highly required to use effective speckle reduction techniques to suppress speckle. Various filtering techniques are available to reduce the speckle noise and to enhance the quality of the image. The main objective of this paper is to present a quantitative approach of de-specking algorithm on SAR images with adequate mathematical parametric analysis.
{"title":"Quantitative approach of speckle noise reduction on synthetic Aperture radar images","authors":"R. V. Geetha, S. Kalaivani","doi":"10.1109/ICCIC.2014.7238423","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238423","url":null,"abstract":"Over the past three to four decades the SAR-synthetic Aperture Radar imagery has become a beneficial and important application over the optical Satellite imagery, Because of its ability to operate in all-weather condition and capability of all time data acquisition; The main issue in this imaging technique is presence of grainy noise termed as `speckle', Which will affect the overall quality of image, hence it is highly required to use effective speckle reduction techniques to suppress speckle. Various filtering techniques are available to reduce the speckle noise and to enhance the quality of the image. The main objective of this paper is to present a quantitative approach of de-specking algorithm on SAR images with adequate mathematical parametric analysis.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","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":"123960490","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/ICCIC.2014.7238283
J. Pujari, Rajesh Yakkundimath, A. S. Byadgi
This paper presents a study on the image processing techniques used to identify and classify fungal disease symptoms affected on different agriculture/horticulture crops. Many diseases exhibit general symptoms that are be caused by different pathogens produced by leaves, roots etc. Images Often do not possess sufficient details to assist in diagnosis, resulting in waste of time, misshaping the diagnostician to arrive at incorrect diagnosis. Farmers experience great difficulties and also in changing from one disease control policy to another i.e. intensive use of pesticides. Farmers are also concerned about the huge costs involved in these activities and severe loss. The cost intensity, automatic correct identification and classification of diseases based on their particular symptoms is very useful to farmers and also agriculture scientists. Early detection of diseases is a major challenge in horticulture / agriculture science. Development of proper methodology, certainly of use in these areas. Plant diseases are caused by bacteria, fungi, virus, nematodes, etc., of which fungi is the main disease causing organism. The present study has been focused on early detection and classification of fungal disease and its related symptoms.
{"title":"Identification and classification of fungal disease affected on agriculture/horticulture crops using image processing techniques","authors":"J. Pujari, Rajesh Yakkundimath, A. S. Byadgi","doi":"10.1109/ICCIC.2014.7238283","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238283","url":null,"abstract":"This paper presents a study on the image processing techniques used to identify and classify fungal disease symptoms affected on different agriculture/horticulture crops. Many diseases exhibit general symptoms that are be caused by different pathogens produced by leaves, roots etc. Images Often do not possess sufficient details to assist in diagnosis, resulting in waste of time, misshaping the diagnostician to arrive at incorrect diagnosis. Farmers experience great difficulties and also in changing from one disease control policy to another i.e. intensive use of pesticides. Farmers are also concerned about the huge costs involved in these activities and severe loss. The cost intensity, automatic correct identification and classification of diseases based on their particular symptoms is very useful to farmers and also agriculture scientists. Early detection of diseases is a major challenge in horticulture / agriculture science. Development of proper methodology, certainly of use in these areas. Plant diseases are caused by bacteria, fungi, virus, nematodes, etc., of which fungi is the main disease causing organism. The present study has been focused on early detection and classification of fungal disease and its related symptoms.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"57 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":"126012667","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/ICCIC.2014.7238512
K. Sudarsanan, S. Sasipriya
The aim of this project is to control a robot using a Brain Machine Interface (BMI). The electrophysiological signals generated from the brain are used to command different devices. The signals generated can be processed and conditioned by the BMI to perform the specific work for which they are generated. The research in BMI can naturally improve the quality of life of the disabled persons. BMI gives neural response which helps controlling a robot with one's mind. The BMI used here is NeuroSky Mindwave which is a three electrode system as compared to the previous BMI's which has a complex twenty four electrodes and is very clumsy to handle. The main advantage of the BMI used in this paper is that it uses dry electrodes over the traditional wet electrodes which makes the user very uncomfortable which decreases the accuracy of the neural response recorded.
{"title":"Controlling a robot using brain waves","authors":"K. Sudarsanan, S. Sasipriya","doi":"10.1109/ICCIC.2014.7238512","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238512","url":null,"abstract":"The aim of this project is to control a robot using a Brain Machine Interface (BMI). The electrophysiological signals generated from the brain are used to command different devices. The signals generated can be processed and conditioned by the BMI to perform the specific work for which they are generated. The research in BMI can naturally improve the quality of life of the disabled persons. BMI gives neural response which helps controlling a robot with one's mind. The BMI used here is NeuroSky Mindwave which is a three electrode system as compared to the previous BMI's which has a complex twenty four electrodes and is very clumsy to handle. The main advantage of the BMI used in this paper is that it uses dry electrodes over the traditional wet electrodes which makes the user very uncomfortable which decreases the accuracy of the neural response recorded.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","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":"126114776","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/ICCIC.2014.7238487
Nilesh Kawale, Shubhangi Patil
Child pornography is increasingly faster in all over the world. This crime is regarded as being extremely harmful; its prosecution is of the highest priority for police forces and law enforcement organizations around the world. As child pornography is considered as criminal activity therefore the law of possession and distribution of Child Pornography images not only applies to regular citizens, but also to police units that they not allowed to gather and catalogue evidence for future reference. Due to this problem, this paper presents an innovative solution in such a way that it provides a system for cataloguing metadata of the evidence material and also provide fast and accurate search to recover such evidence from suspected file system. As it provides the relation between previous cases and current cases therefore it is also helpful in capturing offenders and provides protection to victims.
{"title":"An approach to maintain the stroage of contentious image in the form of descriptor","authors":"Nilesh Kawale, Shubhangi Patil","doi":"10.1109/ICCIC.2014.7238487","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238487","url":null,"abstract":"Child pornography is increasingly faster in all over the world. This crime is regarded as being extremely harmful; its prosecution is of the highest priority for police forces and law enforcement organizations around the world. As child pornography is considered as criminal activity therefore the law of possession and distribution of Child Pornography images not only applies to regular citizens, but also to police units that they not allowed to gather and catalogue evidence for future reference. Due to this problem, this paper presents an innovative solution in such a way that it provides a system for cataloguing metadata of the evidence material and also provide fast and accurate search to recover such evidence from suspected file system. As it provides the relation between previous cases and current cases therefore it is also helpful in capturing offenders and provides protection to victims.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"28 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":"124851428","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/ICCIC.2014.7238536
R. Harikrishnan, V. Kumar, P. Ponmalar
In several traditional algorithms for optimization, the complexity of algorithm increases with expansion of system infrastructure. Resource constraint, cost and energy availability of wireless sensor network (WSN) demand a better node localization algorithm that doesn't require extra hardware as well as has better accuracy with good convergence. Sensor node localization is the ability of an individual node to determine the location information. The location information is the fundamental requirement for several WSN monitoring applications. Moreover the location information supports network management as well as enhances the performance of the network. This paper introduces differential evolution computation, gives an overview about minimization equation of wireless sensor networks localization error problem and then discusses an approach of differential evolution for minimization of localization error in wireless sensor networks.
{"title":"Differential evolution approach for localization in wireless sensor networks","authors":"R. Harikrishnan, V. Kumar, P. Ponmalar","doi":"10.1109/ICCIC.2014.7238536","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238536","url":null,"abstract":"In several traditional algorithms for optimization, the complexity of algorithm increases with expansion of system infrastructure. Resource constraint, cost and energy availability of wireless sensor network (WSN) demand a better node localization algorithm that doesn't require extra hardware as well as has better accuracy with good convergence. Sensor node localization is the ability of an individual node to determine the location information. The location information is the fundamental requirement for several WSN monitoring applications. Moreover the location information supports network management as well as enhances the performance of the network. This paper introduces differential evolution computation, gives an overview about minimization equation of wireless sensor networks localization error problem and then discusses an approach of differential evolution for minimization of localization error in wireless sensor networks.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"26 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":"129391121","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/ICCIC.2014.7238392
B. Rao, A. Mitra
Data mining is known for discovering frequent sub-structures. After finding certain similarity, it is easy to merge the sub-structures to form a larger structure for proper information extraction. To carry out this process, we have proposed new algorithms which merge two community subgraphs in an efficient and simpler way. For our work, we have followed graph matching technique by matching one-to-one correspondence. The three algorithms that have been proposed in this paper are, the first algorithm explains about finding the order of merged communities and to make available of initial form of merged community matrix. The second algorithm explains about creation of adjacency matrix community graph and the third algorithm uses the adjacency matrices of community graph and explains about creation of merged community adjacency matrix. Further, we have verified our proposed approach by implementing it. An appropriate example with the set of input and obtained outputs has been explained. The obtained results are satisfactory. The results were obtained after execution of our programs. Snap-shot of the program output have been included in the paper.
{"title":"An approach to merging of two community subgraphs to form a community graph using graph mining techniques","authors":"B. Rao, A. Mitra","doi":"10.1109/ICCIC.2014.7238392","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238392","url":null,"abstract":"Data mining is known for discovering frequent sub-structures. After finding certain similarity, it is easy to merge the sub-structures to form a larger structure for proper information extraction. To carry out this process, we have proposed new algorithms which merge two community subgraphs in an efficient and simpler way. For our work, we have followed graph matching technique by matching one-to-one correspondence. The three algorithms that have been proposed in this paper are, the first algorithm explains about finding the order of merged communities and to make available of initial form of merged community matrix. The second algorithm explains about creation of adjacency matrix community graph and the third algorithm uses the adjacency matrices of community graph and explains about creation of merged community adjacency matrix. Further, we have verified our proposed approach by implementing it. An appropriate example with the set of input and obtained outputs has been explained. The obtained results are satisfactory. The results were obtained after execution of our programs. Snap-shot of the program output have been included in the paper.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"11 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":"129424298","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/ICCIC.2014.7238290
V. Ravibabu, N. Krishnan
Authentication is the process of identifying and verifying someone, who it claims to be known as user. The increasing popularity of smart mobile phones provides user to store personal data and user information. It is necessary to ensure the confidential access of the mobile phone to its user. Currently, Face Unlock is the biometric user authenticating system widely available in mobile phone. However, user's face image for authentication could not be considered as a secure. Since we faced the problem of 2D face spoofing attacks by displaying user photo in front of the camera. In this paper, we analyze on current methods of face recognition for authentication on mobile phone and present a novel approach for Face Recognition system to be more secure and convenient use. We perform by acquiring with various angular of face information from user and analyze the liveness detection of user by comparing with biometric template of data acquired in a database. The results to the user face recognition are promising in liveness detection and reliable against spoofing.
{"title":"A vary approach to face recognition veritable mechanisms for Android mobile against spoofing","authors":"V. Ravibabu, N. Krishnan","doi":"10.1109/ICCIC.2014.7238290","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238290","url":null,"abstract":"Authentication is the process of identifying and verifying someone, who it claims to be known as user. The increasing popularity of smart mobile phones provides user to store personal data and user information. It is necessary to ensure the confidential access of the mobile phone to its user. Currently, Face Unlock is the biometric user authenticating system widely available in mobile phone. However, user's face image for authentication could not be considered as a secure. Since we faced the problem of 2D face spoofing attacks by displaying user photo in front of the camera. In this paper, we analyze on current methods of face recognition for authentication on mobile phone and present a novel approach for Face Recognition system to be more secure and convenient use. We perform by acquiring with various angular of face information from user and analyze the liveness detection of user by comparing with biometric template of data acquired in a database. The results to the user face recognition are promising in liveness detection and reliable against spoofing.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"5 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":"128541108","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
扫码关注我们
求助内容：
应助结果提醒方式：