Pub Date : 1900-01-01DOI: 10.1109/ICACCS.2016.7586385
Chitti Babu K, C. Kavitha, N. Sankarram
In the software evolution process a developer must analyze the source code in order to understand the entities in it. In general this analysis is done manually which takes lots of time and is a tedious task. The other option is to use automated source code summarization techniques. Existing techniques does not provide the required summary and most of them are complex. Source code summarization is the task of creating readable summaries that describe the functionality of software. Source code summarization is a critical component of documentation generation. In this paper we propose a novel summarization technique called EBSCS which is based on the entities like packages, classes, methods control statements and comments in the source code. In this technique description is generated for the entities and the comment lines are used to generate summary for the source code.
{"title":"Entity based source code summarization (EBSCS)","authors":"Chitti Babu K, C. Kavitha, N. Sankarram","doi":"10.1109/ICACCS.2016.7586385","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586385","url":null,"abstract":"In the software evolution process a developer must analyze the source code in order to understand the entities in it. In general this analysis is done manually which takes lots of time and is a tedious task. The other option is to use automated source code summarization techniques. Existing techniques does not provide the required summary and most of them are complex. Source code summarization is the task of creating readable summaries that describe the functionality of software. Source code summarization is a critical component of documentation generation. In this paper we propose a novel summarization technique called EBSCS which is based on the entities like packages, classes, methods control statements and comments in the source code. In this technique description is generated for the entities and the comment lines are used to generate summary for the source code.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"605 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131881695","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586355
M. Meharban, S. Priya
To overcome the semantic gap in the retrieval process, the user relevance feedback frame work is added to the current image retrieval system. Relevance feedback method iteratively refines and updates the retrieved result by learning the user-labeled examples to further improves the overall performance. In the proposed scheme feature descriptor derived from the EDBTC compressed data stream. Firstly, a color image is decomposed using EDBTC scheme to produce two new image representations, namely color quantizer and bitmap image by using Improved LBG-VQ (ILBG)algorithm. Two image feature descriptors called Color Histogram Feature (CHF), and Bit Pattern Feature(BPF) can be subsequently generated from the EDBTC color quantizer and its corresponding bitmap image respectively without performing the decoding process. The similarity degree between two images is simply measured with the similarity distance score of their feature descriptor. Second, we presented a relevance feedback (RF) framework for effective image retrieval by using a support vector machine (SVM). Effectiveness of EDBTC feature descriptor is quantitatively examined and compared in the RGB color space as well as in HSI color channel. Extensive experiments shows that there is a significant improvement in retrieval performance with the proposed method using SVMRF compared with the retrieval performance without RF.
{"title":"Image indexing and Retrieval using Error Diffusion BTC with relevance feedback","authors":"M. Meharban, S. Priya","doi":"10.1109/ICACCS.2016.7586355","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586355","url":null,"abstract":"To overcome the semantic gap in the retrieval process, the user relevance feedback frame work is added to the current image retrieval system. Relevance feedback method iteratively refines and updates the retrieved result by learning the user-labeled examples to further improves the overall performance. In the proposed scheme feature descriptor derived from the EDBTC compressed data stream. Firstly, a color image is decomposed using EDBTC scheme to produce two new image representations, namely color quantizer and bitmap image by using Improved LBG-VQ (ILBG)algorithm. Two image feature descriptors called Color Histogram Feature (CHF), and Bit Pattern Feature(BPF) can be subsequently generated from the EDBTC color quantizer and its corresponding bitmap image respectively without performing the decoding process. The similarity degree between two images is simply measured with the similarity distance score of their feature descriptor. Second, we presented a relevance feedback (RF) framework for effective image retrieval by using a support vector machine (SVM). Effectiveness of EDBTC feature descriptor is quantitatively examined and compared in the RGB color space as well as in HSI color channel. Extensive experiments shows that there is a significant improvement in retrieval performance with the proposed method using SVMRF compared with the retrieval performance without RF.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119654","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586344
Elsa Baby, K. Senthilkumar
Multipath on demand routing protocols perform better than single path routing protocols under mobility conditions due to the availability of alternate paths reducing route discovery frequency and routing overhead. However all these routing protocols use minimum hop count as the routing metric to discover shortest path from source to the destination. With the advent of multi-rate wireless standards such as IEEE 802.11 a/b/g, use of minimum hop count as routing metric results in under utilization of available bandwidth. This paper proposes an hybrid multi-rate multipath routing protocol based on AOMDV. The proposed routing scheme uses SNR of a link to identify its transmission rate and assigns a link cost based on the measured transmission rate. Route with less path cost (cumulative link cost) is chosen as the best path. Simulations are carried out in Qualnet. The simulation result shows that the proposed routing scheme performs better than AOMDV in terms of throughput, delay, packet delivery and routing overhead.
{"title":"Hybrid Multi-rate Multipath Routing (HMMR) protocol","authors":"Elsa Baby, K. Senthilkumar","doi":"10.1109/ICACCS.2016.7586344","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586344","url":null,"abstract":"Multipath on demand routing protocols perform better than single path routing protocols under mobility conditions due to the availability of alternate paths reducing route discovery frequency and routing overhead. However all these routing protocols use minimum hop count as the routing metric to discover shortest path from source to the destination. With the advent of multi-rate wireless standards such as IEEE 802.11 a/b/g, use of minimum hop count as routing metric results in under utilization of available bandwidth. This paper proposes an hybrid multi-rate multipath routing protocol based on AOMDV. The proposed routing scheme uses SNR of a link to identify its transmission rate and assigns a link cost based on the measured transmission rate. Route with less path cost (cumulative link cost) is chosen as the best path. Simulations are carried out in Qualnet. The simulation result shows that the proposed routing scheme performs better than AOMDV in terms of throughput, delay, packet delivery and routing overhead.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133553051","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586375
R. Rathika, S. Kumaresan
Data transmissions using computer networks has created the need for security. Many robust message encryption techniques have been developed to supply this demand. Steganography is one form of cryptography where we hide data within large texts or images. Reversible data hiding can be considered as a form of steganography in which we hide data within images, but with a variation that, in reversible data hiding the original cover can be recovered losslessly after the embedded messages are extracted. This paper presents a detailed survey on various techniques available for RDH. The techniques include Histogram shifting, LSB modification method, Difference Expansion, Interpolation Technique.
{"title":"Survey on reversible data hiding techniques","authors":"R. Rathika, S. Kumaresan","doi":"10.1109/ICACCS.2016.7586375","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586375","url":null,"abstract":"Data transmissions using computer networks has created the need for security. Many robust message encryption techniques have been developed to supply this demand. Steganography is one form of cryptography where we hide data within large texts or images. Reversible data hiding can be considered as a form of steganography in which we hide data within images, but with a variation that, in reversible data hiding the original cover can be recovered losslessly after the embedded messages are extracted. This paper presents a detailed survey on various techniques available for RDH. The techniques include Histogram shifting, LSB modification method, Difference Expansion, Interpolation Technique.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"996 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233691","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586324
Ravi Lourdusamy, Merlin Florrence Joseph
Ontology plays a vital role in teaching and learning. In the last decade most of the learning sites were trying to adopt semantic web techniques to develop the learning materials. It is easy to visualize the concepts that are developed in ontology in an effective manner. In this article a multilingual ontology is developed to teach Tamil literary, Thirukkural by espousing the features of ontology. It is one of the famous Tamil literary in the world and has been translated into more than 80 languages. Three ontologies are developed for Thirukkural in Tamil, English and Hindi languages and they are merged into a single ontology. The relationships between the classes are established by mapping the ontologies.
{"title":"A multilingual ontology for Tamil Literary works","authors":"Ravi Lourdusamy, Merlin Florrence Joseph","doi":"10.1109/ICACCS.2016.7586324","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586324","url":null,"abstract":"Ontology plays a vital role in teaching and learning. In the last decade most of the learning sites were trying to adopt semantic web techniques to develop the learning materials. It is easy to visualize the concepts that are developed in ontology in an effective manner. In this article a multilingual ontology is developed to teach Tamil literary, Thirukkural by espousing the features of ontology. It is one of the famous Tamil literary in the world and has been translated into more than 80 languages. Three ontologies are developed for Thirukkural in Tamil, English and Hindi languages and they are merged into a single ontology. The relationships between the classes are established by mapping the ontologies.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786193","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586393
Chandrima Chatterjee
To refer technologically enhanced learning, the term e-learning is used throughout the paper. In this paper selected aspects of implementation model is used to improve the quality of e-learning. A complex quality assurance method for e-learning quality (ELQ) has been proposed and verified in this paper. To evaluate the blended learning quality a modified Kirkpatrick evaluation four model has been used. Then collection and analysis of the experimental data has been performed. From these analysis future improvements will be obtained.
{"title":"Measurement of e-learning quality","authors":"Chandrima Chatterjee","doi":"10.1109/ICACCS.2016.7586393","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586393","url":null,"abstract":"To refer technologically enhanced learning, the term e-learning is used throughout the paper. In this paper selected aspects of implementation model is used to improve the quality of e-learning. A complex quality assurance method for e-learning quality (ELQ) has been proposed and verified in this paper. To evaluate the blended learning quality a modified Kirkpatrick evaluation four model has been used. Then collection and analysis of the experimental data has been performed. From these analysis future improvements will be obtained.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"41 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130387908","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586346
A. Oshiya, K. Lakshmi
In the deregulated electricity market, the power generators profit depends on its unit scheduling, bidding strategies and on the market price. The coordination of wind energy with other renewable resources serve an effective way for the generating companies to increase its payoff. Accordingly, the wind power with hydro power system coordination incur the enhancement of power dispatch and thereby reducing imbalance prices. This paper proposes an interval optimization technique to solve the price based unit commitment problem. It also suggests to solve the bidding strategy with the accurate intervals. Variations in wind hydro power, the volatilities in day ahead energy price, intra hour energy price are considered as periodic numbers. Comparing to the conventional technique it is easier to determine and optimizes the entire profit intervals. Henceforth, has an inherent advantage on computational complexity and associates under worst case scenarios.
{"title":"Interval optimization technique for the coordination of hydro units with wind power generation","authors":"A. Oshiya, K. Lakshmi","doi":"10.1109/ICACCS.2016.7586346","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586346","url":null,"abstract":"In the deregulated electricity market, the power generators profit depends on its unit scheduling, bidding strategies and on the market price. The coordination of wind energy with other renewable resources serve an effective way for the generating companies to increase its payoff. Accordingly, the wind power with hydro power system coordination incur the enhancement of power dispatch and thereby reducing imbalance prices. This paper proposes an interval optimization technique to solve the price based unit commitment problem. It also suggests to solve the bidding strategy with the accurate intervals. Variations in wind hydro power, the volatilities in day ahead energy price, intra hour energy price are considered as periodic numbers. Comparing to the conventional technique it is easier to determine and optimizes the entire profit intervals. Henceforth, has an inherent advantage on computational complexity and associates under worst case scenarios.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117059873","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586398
P. Ray
Thermal comfort is one of the important climatic factors that conditions human living hood. The existing primary methods of thermal comfort measurement are inadequate to monitor the comfort level of human body through computer networks, especially internet like infrastructure. In this paper, an Internet of Things based thermal comfort measurement and monitoring technique is proposed. Missenard indexing has been implemented for measuring thermal comfort by IoT cloud assisted architecture. Real-time graphical visualizations of thermal comfort are obtained from Plotly and ThingSpeak cloud platforms. Serial data output is also generated while performing the experiment.
{"title":"An Internet of Things based approach to thermal comfort measurement and monitoring","authors":"P. Ray","doi":"10.1109/ICACCS.2016.7586398","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586398","url":null,"abstract":"Thermal comfort is one of the important climatic factors that conditions human living hood. The existing primary methods of thermal comfort measurement are inadequate to monitor the comfort level of human body through computer networks, especially internet like infrastructure. In this paper, an Internet of Things based thermal comfort measurement and monitoring technique is proposed. Missenard indexing has been implemented for measuring thermal comfort by IoT cloud assisted architecture. Real-time graphical visualizations of thermal comfort are obtained from Plotly and ThingSpeak cloud platforms. Serial data output is also generated while performing the experiment.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687161","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586406
T. Bharathi, P. Krishnakumari
A vital procedure that is indispensable in the field of data mining is the association rule mining in which the focus is up on the finding of the curious associations, correlations and frequent item sets amongst the list of items in a given database. There are typically two steps in the algorithms that employ association rules. The first step being the finding of the frequent sets and the second being the usage of these sets in order to generate the association rules. The current paper puts forward an analysis of comparison between the various association rule mining algorithms. Besides, the applications, benefits and the drawbacks have also been studied in the paper. The paper reviews the features, data sets variants, support, confidence, rule generation and candidate generation of the algorithms that are employed to mine the association rules.
{"title":"A comparative analysis on efficiency of contemporary association rule mining algorithm","authors":"T. Bharathi, P. Krishnakumari","doi":"10.1109/ICACCS.2016.7586406","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586406","url":null,"abstract":"A vital procedure that is indispensable in the field of data mining is the association rule mining in which the focus is up on the finding of the curious associations, correlations and frequent item sets amongst the list of items in a given database. There are typically two steps in the algorithms that employ association rules. The first step being the finding of the frequent sets and the second being the usage of these sets in order to generate the association rules. The current paper puts forward an analysis of comparison between the various association rule mining algorithms. Besides, the applications, benefits and the drawbacks have also been studied in the paper. The paper reviews the features, data sets variants, support, confidence, rule generation and candidate generation of the algorithms that are employed to mine the association rules.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115383327","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 : 1900-01-01DOI: 10.1109/ICACCS.2016.7586332
B. Priyaa, M. Devi
The use of database driven web applications are increasing every day. Attacks on those web applications are also increasing. One of the common web application attacks is SQL Injection attack. These attacks are a code injection or insertion of SQL query via input data from the client to the application. There are many detection techniques implemented, but they have focused on the SQL structure at the application level. So those techniques failed to detect some of the attacks at the database level. The existing approaches use classification techniques and suitable kernel functions to detect the attack at the database level. As the SVM classification is the supervised learning algorithm, the unknown attacks can't be detected. In this paper, we propose a hybrid framework using the EDADT (Efficient Data Adaptive Decision Tree) algorithm which is the semi - supervised algorithm and SVM classification algorithm. It uses the internal query tree from the database log for good performance of framework. To get internal query tree, the query tree is converted to n - dimensional feature vector by using multi - dimensional sequence. The semantic features are used as the component of feature vector. And also the syntactic and semantic feature is used to generate multi - dimensional sequences. Then the extracted feature is converted into numeric value, if the feature contains any string value. Experimental results show that the proposed approach is more accurate in detecting the attacks than existing approaches.
数据库驱动的web应用程序的使用每天都在增加。针对这些web应用程序的攻击也在增加。SQL注入攻击是常见的web应用攻击之一。这些攻击是通过从客户机到应用程序的输入数据进行代码注入或插入SQL查询。已经实现了许多检测技术，但它们都集中在应用程序级别的SQL结构上。因此，这些技术无法在数据库级别检测到一些攻击。现有的方法使用分类技术和合适的核函数来检测数据库级的攻击。由于支持向量机分类是监督学习算法，无法检测未知攻击。本文提出了一种结合半监督算法和支持向量机分类算法的EDADT (Efficient Data Adaptive Decision Tree)算法的混合框架。它使用数据库日志中的内部查询树来提高框架的性能。为了得到内部查询树，利用多维序列将查询树转换为n维特征向量。将语义特征作为特征向量的组成部分。并利用句法和语义特征生成多维序列。然后，如果提取的特征包含任何字符串值，则将其转换为数值。实验结果表明，该方法在检测攻击方面比现有方法更准确。
{"title":"Hybrid SQL injection detection system","authors":"B. Priyaa, M. Devi","doi":"10.1109/ICACCS.2016.7586332","DOIUrl":"https://doi.org/10.1109/ICACCS.2016.7586332","url":null,"abstract":"The use of database driven web applications are increasing every day. Attacks on those web applications are also increasing. One of the common web application attacks is SQL Injection attack. These attacks are a code injection or insertion of SQL query via input data from the client to the application. There are many detection techniques implemented, but they have focused on the SQL structure at the application level. So those techniques failed to detect some of the attacks at the database level. The existing approaches use classification techniques and suitable kernel functions to detect the attack at the database level. As the SVM classification is the supervised learning algorithm, the unknown attacks can't be detected. In this paper, we propose a hybrid framework using the EDADT (Efficient Data Adaptive Decision Tree) algorithm which is the semi - supervised algorithm and SVM classification algorithm. It uses the internal query tree from the database log for good performance of framework. To get internal query tree, the query tree is converted to n - dimensional feature vector by using multi - dimensional sequence. The semantic features are used as the component of feature vector. And also the syntactic and semantic feature is used to generate multi - dimensional sequences. Then the extracted feature is converted into numeric value, if the feature contains any string value. Experimental results show that the proposed approach is more accurate in detecting the attacks than existing approaches.","PeriodicalId":176803,"journal":{"name":"2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132673688","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
扫码关注我们
求助内容：
应助结果提醒方式：