Energy saving is extremely important in portable and hand-held devices like laptop and mobile phones. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery life. One promising technique that provides the best of both low-power and high-performance processors in the real time systems is Dynamic Voltage and Frequency Scaling (DVS). In this paper, we are working on the problem of power optimization for periodic independent real-time tasks that are scheduled over multiprocessors. Theoretically, Real Time tasks are specified with Worst Case Execution Time (WCET). During the operation of the system, the Actual Execution Time (AET) of a task could be a lot smaller than its WCET. We present an Adaptive real time DVS algorithm (Art-DVS) based on AET of tasks. It adapts two state-of-the-art scheduling algorithms Pre-DVS and Post-DVS. Simulation results show that the proposed Art-DVS algorithm performs satisfactorily on energy consumption in comparison to the previous approaches.
{"title":"RT-DVS for Power Optimization in Multiprocessor Real-Time Systems","authors":"B. Naik, Shirshendu Das, H. Kapoor","doi":"10.1109/ICIT.2014.59","DOIUrl":"https://doi.org/10.1109/ICIT.2014.59","url":null,"abstract":"Energy saving is extremely important in portable and hand-held devices like laptop and mobile phones. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery life. One promising technique that provides the best of both low-power and high-performance processors in the real time systems is Dynamic Voltage and Frequency Scaling (DVS). In this paper, we are working on the problem of power optimization for periodic independent real-time tasks that are scheduled over multiprocessors. Theoretically, Real Time tasks are specified with Worst Case Execution Time (WCET). During the operation of the system, the Actual Execution Time (AET) of a task could be a lot smaller than its WCET. We present an Adaptive real time DVS algorithm (Art-DVS) based on AET of tasks. It adapts two state-of-the-art scheduling algorithms Pre-DVS and Post-DVS. Simulation results show that the proposed Art-DVS algorithm performs satisfactorily on energy consumption in comparison to the previous approaches.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"7 1","pages":"24-29"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75853377","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}
In recent years, Cloud computing has been receiving great attention from various business and research organizations as it promises to provide large storage facilities and highly managed remote services. Due to its characteristics like on-demand self service, rapid elasticity, ubiquitous network access and resource pooling, it shows high potential for providing e-Healthcare solutions. It can offer various financial and functional benefits to e-Healthcare which includes providing storage flexibility for the rapidly growing healthcare data, reduced cost, better accessibility, improved quality of care and enhancement in medical research. However at the same time, it faces many technical challenges like privacy, reliability, security etc. In the Cloud based ehealthcare environment where the patient's data is transferred between entities, maintaining the security of data becomes a priority. Cryptographic techniques can only provide a secure channel of communication but it fails to provide security at end points. Security attacks may be accomplished by the malicious insider at the end points. A malicious insider may modify the patient's data resulting in a false examination. The paper provides a detective approach for such attacks in the healthcare organizations. Our work is focused with the detection of insider attacks for preventing false examination of patient's health records and assuring the accountability of data usage. Watermarking can be used for detection of modification by an insider attack but does not provide accountability of data usage. Hence our approach combines the functionalities of cryptographic techniques and watermarking together with an accountability framework for providing transparency of patient's data usage.
{"title":"Detection of Insider Attacks in Cloud Based e-Healthcare Environment","authors":"Gaurav Garkoti, S. K. Peddoju, B. Raman","doi":"10.1109/ICIT.2014.43","DOIUrl":"https://doi.org/10.1109/ICIT.2014.43","url":null,"abstract":"In recent years, Cloud computing has been receiving great attention from various business and research organizations as it promises to provide large storage facilities and highly managed remote services. Due to its characteristics like on-demand self service, rapid elasticity, ubiquitous network access and resource pooling, it shows high potential for providing e-Healthcare solutions. It can offer various financial and functional benefits to e-Healthcare which includes providing storage flexibility for the rapidly growing healthcare data, reduced cost, better accessibility, improved quality of care and enhancement in medical research. However at the same time, it faces many technical challenges like privacy, reliability, security etc. In the Cloud based ehealthcare environment where the patient's data is transferred between entities, maintaining the security of data becomes a priority. Cryptographic techniques can only provide a secure channel of communication but it fails to provide security at end points. Security attacks may be accomplished by the malicious insider at the end points. A malicious insider may modify the patient's data resulting in a false examination. The paper provides a detective approach for such attacks in the healthcare organizations. Our work is focused with the detection of insider attacks for preventing false examination of patient's health records and assuring the accountability of data usage. Watermarking can be used for detection of modification by an insider attack but does not provide accountability of data usage. Hence our approach combines the functionalities of cryptographic techniques and watermarking together with an accountability framework for providing transparency of patient's data usage.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"98 1","pages":"195-200"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85773241","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}
In wireless networks, secure authentication protocol should enable a legitimate roaming user to get roaming services from foreign server when he/she is away from home domain. However, a basic authentication protocol requires participation of home server, foreign server and roaming user during the authentication between roaming user and foreign server. Recently, two-party based anonymous authentication protocols have been proposed, which does not require home server's participation, to protect identity, location and route information of the roaming users. But, the available anonymous authentication protocols are not efficient due to the shortcomings in security and high computational cost. This paper addresses those problems and proposes a novel two-party based anonymous authentication protocol for the roaming users, named PAPAR. PAPAR uses pairing-based cryptography to secure and to provide computationally efficient authentication. Further, PAPAR uses pseudo identities to ensure user anonymity. Moreover, PAPAR efficiently mitigates the effect of DoS (Denial of Service) attack by using light computational operations, such as Message Authentication Code. Comparison and experimental results show that PAPAR outperforms the existing works in terms of security and computational cost.
{"title":"PAPAR: Pairing Based Authentication Protocol with Anonymous Roaming for Wireless Mesh Networks","authors":"Nazatul Haque Sultan, N. Sarma","doi":"10.1109/ICIT.2014.36","DOIUrl":"https://doi.org/10.1109/ICIT.2014.36","url":null,"abstract":"In wireless networks, secure authentication protocol should enable a legitimate roaming user to get roaming services from foreign server when he/she is away from home domain. However, a basic authentication protocol requires participation of home server, foreign server and roaming user during the authentication between roaming user and foreign server. Recently, two-party based anonymous authentication protocols have been proposed, which does not require home server's participation, to protect identity, location and route information of the roaming users. But, the available anonymous authentication protocols are not efficient due to the shortcomings in security and high computational cost. This paper addresses those problems and proposes a novel two-party based anonymous authentication protocol for the roaming users, named PAPAR. PAPAR uses pairing-based cryptography to secure and to provide computationally efficient authentication. Further, PAPAR uses pseudo identities to ensure user anonymity. Moreover, PAPAR efficiently mitigates the effect of DoS (Denial of Service) attack by using light computational operations, such as Message Authentication Code. Comparison and experimental results show that PAPAR outperforms the existing works in terms of security and computational cost.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"26 1","pages":"155-160"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87931333","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}
In this paper a novel quantum based binary neural network learning algorithm is proposed. It forms three layer network structure. The proposed method make use of quantum concept for updating and finalizing weights of the neurons and it works for two class problem. The use of quantum concept form an optimized network structure. Also performance in terms of number of neurons and classification accuracy is improved. Same is compared with a quantum-based algorithm for optimizing artificial neural networks algorithm (QANN). It is found that there is improvement in the form of number of neurons at hidden layer, number of iterations, training accuracy and generalization accuracy.
{"title":"Quantum Inspired Binary Neural Network Algorithm","authors":"O. Patel, Aruna Tiwari","doi":"10.1109/ICIT.2014.29","DOIUrl":"https://doi.org/10.1109/ICIT.2014.29","url":null,"abstract":"In this paper a novel quantum based binary neural network learning algorithm is proposed. It forms three layer network structure. The proposed method make use of quantum concept for updating and finalizing weights of the neurons and it works for two class problem. The use of quantum concept form an optimized network structure. Also performance in terms of number of neurons and classification accuracy is improved. Same is compared with a quantum-based algorithm for optimizing artificial neural networks algorithm (QANN). It is found that there is improvement in the form of number of neurons at hidden layer, number of iterations, training accuracy and generalization accuracy.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"52 1","pages":"270-274"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80368655","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}
Gouranga Charan Jena, Tirthankar Dasgupta, A. Basu
Odia is the principal regional language of Odisha and the sixth classical language of India. There are more than 33 million people of Odisha speak Odia in their day to day life. However, standard input methods for typing Odia are not very widespread among Odia users. In this paper we present the design and development of a novel Odia keyboard layout that can be used to type Unicode enabled Odia texts in a standard text editor using any QWERTY keyboard. The keyboard layout is based on Unicode 5.0 standard. We have evaluated the performance of our proposed layout with the existing Odia keyboard layouts. We have done this evaluation using cognitive model. Our primary evaluation shows a significant improvement in reducing time irrespective of keystroke, increasing typing speed, reducing error rates as well as easing of learning. We have designed a typing s/w (Baishakhi key logger) for all Odias to learn Odia typing.
{"title":"Implementation of Unicode Complaint Odia Keyboard and Its Evaluation Using Cognitive Model","authors":"Gouranga Charan Jena, Tirthankar Dasgupta, A. Basu","doi":"10.1109/ICIT.2014.58","DOIUrl":"https://doi.org/10.1109/ICIT.2014.58","url":null,"abstract":"Odia is the principal regional language of Odisha and the sixth classical language of India. There are more than 33 million people of Odisha speak Odia in their day to day life. However, standard input methods for typing Odia are not very widespread among Odia users. In this paper we present the design and development of a novel Odia keyboard layout that can be used to type Unicode enabled Odia texts in a standard text editor using any QWERTY keyboard. The keyboard layout is based on Unicode 5.0 standard. We have evaluated the performance of our proposed layout with the existing Odia keyboard layouts. We have done this evaluation using cognitive model. Our primary evaluation shows a significant improvement in reducing time irrespective of keystroke, increasing typing speed, reducing error rates as well as easing of learning. We have designed a typing s/w (Baishakhi key logger) for all Odias to learn Odia typing.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"68 1","pages":"82-87"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89396699","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}
B. Ray, A. Tripathy, Pralipta Samal, Manimay Das, Pushpanjali Mallik
Placement is a crucial stage in physical design of VLSI. At this stage, analytical placer uses half perimeter wire length (HPWL) of the circuit as an objective function to place blocks optimally within chip. Inspired by popularly used log-sum-exp (LSE) wire length model [9], absolute (ABS) wire length model [7] and weighted average (WA) wire length model [3], we propose a new smooth wire length model for HPWL, providing smooth approximations to max function. The convergence. Properties, error upper bounds of the new model are studied. The accuracy of the new model is sharper than LSE, WA and ABS wire length model. Wire length is validated by global and detail placements generated by NTU Placer [1] on ISPD 2004 benchmark suits. Experimental results show that our model provides closest approximation to HPWL than all wire length models, with an average of 2% error in total wire length.
{"title":"Half-Perimeter Wirelength Model for VLSI Analytical Placement","authors":"B. Ray, A. Tripathy, Pralipta Samal, Manimay Das, Pushpanjali Mallik","doi":"10.1109/ICIT.2014.61","DOIUrl":"https://doi.org/10.1109/ICIT.2014.61","url":null,"abstract":"Placement is a crucial stage in physical design of VLSI. At this stage, analytical placer uses half perimeter wire length (HPWL) of the circuit as an objective function to place blocks optimally within chip. Inspired by popularly used log-sum-exp (LSE) wire length model [9], absolute (ABS) wire length model [7] and weighted average (WA) wire length model [3], we propose a new smooth wire length model for HPWL, providing smooth approximations to max function. The convergence. Properties, error upper bounds of the new model are studied. The accuracy of the new model is sharper than LSE, WA and ABS wire length model. Wire length is validated by global and detail placements generated by NTU Placer [1] on ISPD 2004 benchmark suits. Experimental results show that our model provides closest approximation to HPWL than all wire length models, with an average of 2% error in total wire length.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"30 1","pages":"287-292"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73343311","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}
Sayan Chakraborty, Aniruddha Mukherjee, Debmalya Chatterjee, Prasenjit Maji, S. Acharjee, N. Dey
Out of the twelve pairs of cranial nerves, optic nerve is the most important cranial nerve. Optic nerve establishes a connection from eyeball to brain. The four segments present in optic are: intraocular, intra-orbital, intracanalicular, and intracranial. Optical nerve head segmentation may lead to detection of many diseases such as glaucoma, eye hypertension. We propose a semi-automated system, where independent contours are defined, and then with the help of those ground truths, a person with medical education and solid experience in ophthalmology will be able to manually set the contours. Such a process would result in extracting information regarding optic diseases like glaucoma, diabetic retinopathy, age-related macular degeneration, retinal vascular occlusion.
{"title":"A Semi-automated System for Optic Nerve Head Segmentation in Digital Retinal Images","authors":"Sayan Chakraborty, Aniruddha Mukherjee, Debmalya Chatterjee, Prasenjit Maji, S. Acharjee, N. Dey","doi":"10.1109/ICIT.2014.51","DOIUrl":"https://doi.org/10.1109/ICIT.2014.51","url":null,"abstract":"Out of the twelve pairs of cranial nerves, optic nerve is the most important cranial nerve. Optic nerve establishes a connection from eyeball to brain. The four segments present in optic are: intraocular, intra-orbital, intracanalicular, and intracranial. Optical nerve head segmentation may lead to detection of many diseases such as glaucoma, eye hypertension. We propose a semi-automated system, where independent contours are defined, and then with the help of those ground truths, a person with medical education and solid experience in ophthalmology will be able to manually set the contours. Such a process would result in extracting information regarding optic diseases like glaucoma, diabetic retinopathy, age-related macular degeneration, retinal vascular occlusion.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"69 1","pages":"112-117"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74523044","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}
Phishing attack is one of the most common cyber attacks causing serious threat to global cyber world and economy. Tab nabbing is a variant of phishing attack evolved recently, in which a malicious page opened in the tab disguises itself to the login page of a popular one, like gmail or facebook, so as to defeat the traditional phish detection mechanisms. In this paper, we propose an efficient security framework called Tab Sol to defend against Tab nabbing attack while detecting the other variants of phishing attacks. We developed and tested Tab Sol in the Google chrome browser and found to be effective. The proposed framework is compared with the existing frameworks and fund to more effective. The most attractive features of Tab Sol includes its simple and fast implementation with less false positive.
{"title":"TabSol: An Efficient Framework to Defend Tabnabbing","authors":"Amandeep Singh, S. Tripathy","doi":"10.1109/ICIT.2014.56","DOIUrl":"https://doi.org/10.1109/ICIT.2014.56","url":null,"abstract":"Phishing attack is one of the most common cyber attacks causing serious threat to global cyber world and economy. Tab nabbing is a variant of phishing attack evolved recently, in which a malicious page opened in the tab disguises itself to the login page of a popular one, like gmail or facebook, so as to defeat the traditional phish detection mechanisms. In this paper, we propose an efficient security framework called Tab Sol to defend against Tab nabbing attack while detecting the other variants of phishing attacks. We developed and tested Tab Sol in the Google chrome browser and found to be effective. The proposed framework is compared with the existing frameworks and fund to more effective. The most attractive features of Tab Sol includes its simple and fast implementation with less false positive.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"122 1","pages":"173-178"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77528095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The limitation with the method of calculating surface water velocity is the direct contact of the velocity measurement tool to the flowing water which results in the mechanical wear and high maintenance cost. This paper describes the flow visualization and surface water velocity measurement technique using the non-intrusive method. This system gives the instantaneous results and is reliable, flexible method which can be applied successfully in many engineering applications. It is a distension of a video imaging technique to measure the velocity using the pattern matching method. The system was indigenously developed with the help of CMOS camera and paper particles which were used as the tracer particles. If video is taken from far distance then ortho-rectification is applied to calculate accurate results. Video was recorded at Bombay airport model, CWPRS, Pune under different environmental conditions. The code is written in MATLAB which includes segmentation, pattern matching and post processing steps.
{"title":"Non-intrusive Water Surface Velocity Measurement Using Spatial Cross Correlation Technique","authors":"Nitika Sharma, Apurva Naik, M. Balan","doi":"10.1109/ICIT.2014.52","DOIUrl":"https://doi.org/10.1109/ICIT.2014.52","url":null,"abstract":"The limitation with the method of calculating surface water velocity is the direct contact of the velocity measurement tool to the flowing water which results in the mechanical wear and high maintenance cost. This paper describes the flow visualization and surface water velocity measurement technique using the non-intrusive method. This system gives the instantaneous results and is reliable, flexible method which can be applied successfully in many engineering applications. It is a distension of a video imaging technique to measure the velocity using the pattern matching method. The system was indigenously developed with the help of CMOS camera and paper particles which were used as the tracer particles. If video is taken from far distance then ortho-rectification is applied to calculate accurate results. Video was recorded at Bombay airport model, CWPRS, Pune under different environmental conditions. The code is written in MATLAB which includes segmentation, pattern matching and post processing steps.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"74 5S 1","pages":"356-361"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87148569","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}
Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.
{"title":"Hierarchical Homomorphic Encryption Based Privacy Preserving Distributed Association Rule Mining","authors":"Shubhra Rana, P. S. Thilagam","doi":"10.1109/ICIT.2014.14","DOIUrl":"https://doi.org/10.1109/ICIT.2014.14","url":null,"abstract":"Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"72 1","pages":"379-385"},"PeriodicalIF":0.0,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90727998","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
扫码关注我们
求助内容：
应助结果提醒方式：