{"title":"Review of State Based Approach Recovery Schemes in Mobile Distributed Environments","authors":"Vijaya Kapoor, Parveen Kumar","doi":"10.1109/ACCT.2015.19","DOIUrl":"https://doi.org/10.1109/ACCT.2015.19","url":null,"abstract":"Fault tolerance techniques enable a system to perform tasks in the existence of faults. In a distributed system, hardware and software components are located at network computers and communication and coordination of their action is done by only passing messages. Mobile computing is progression of wireless network technology and portable information appliances such as laptops, handheld devices, PDAs etc. In the state based approach for recovery, known as snapshot, the entire state of a process is saved. When a recovery point is established, recovering a process involves reinstating its saved state and resuming the execution of the process from the state. Exhaustive research work has been carried out on designing efficient state based schemes for fault tolerance. In mobile distributed computing, due to mobility of MHs and limitations of wireless networks, there are new issues like mobility, catastrophic failure, limited battery life, low bandwidth, disconnections etc. That complicate the design of the snapshot algorithms. Recently, more attention has been given to providing state based approach of recovery for mobile systems. This paper surveys the algorithms reported in literature for introducing fault tolerance in mobile distributed systems and extension of it.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reducing Features of KDD CUP 1999 Dataset for Anomaly Detection Using Back Propagation Neural Network","authors":"Bhavin Shah, Bhushan Trivedi","doi":"10.1109/ACCT.2015.131","DOIUrl":"https://doi.org/10.1109/ACCT.2015.131","url":null,"abstract":"To detect and classify the anomaly in computer network, KDD CUP 1999 dataset is extensively used. This KDD CUP 1999 data set was generated by domain expert at MIT Lincon lab. To reduced number of features of this KDD CUP data set, various feature reduction techniques has been already used. These techniques reduce features from 41 into range of 10 to 22. Usage of such reduced dataset in machine learning algorithm leads to lower complexity, less processing time and high accuracy. Out of the various feature reduction technique available, one of them is Information Gain (IG) which has been already applied for the random forests classifier by Tesfahun et al. Tesfahun's approach reduces time and complexity of model and improves the detection rate for the minority classes in a considerable amount. This work investigates the effectiveness and the feasibility of Tesfahun et al.'s feature reduction technique on Back Propagation Neural Network classifier. We had performed various experiments on KDD CUP 1999 dataset and recorded Accuracy, Precision, Recall and Fscore values. In this work, we had done Basic, N-Fold Validation and Testing comparisons on reduced dataset with full feature dataset. Basic comparison clearly shows that the reduced dataset outer performs on size, time and complexity parameters. Experiments of N-Fold validation show that classifier that uses reduced dataset, have better generalization capacity. During the testing comparison, we found both the datasets are equally compatible. All the three comparisons clearly show that reduced dataset is better or is equally compatible, and does not have any drawback as compared to full dataset. Our experiments shows that usage of such reduced dataset in BPNN can lead to better model in terms of dataset size, complexity, processing time and generalization ability.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mitigation of Atmospheric Turbulence in Free Space Optics: A Review","authors":"Poonam Goyal, Ashwni Kumar, V. Nath","doi":"10.1109/ACCT.2015.60","DOIUrl":"https://doi.org/10.1109/ACCT.2015.60","url":null,"abstract":"This paper reviews the work done for modeling and mitigating the effect of atmospheric turbulence and fog in the Free Space Optics (FSO). The various models proposed in recent times have been discussed and analyzed. The strengths and weaknesses of the scheme have been highlighted, providing the reader with a well rounded holistic picture of the work done in this area. The paper discusses an example to show the best mitigation technique related to Signal to noise ratio and Bit error rate (BER) based on data mining results.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129885835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Spatio-Temporal Data Models with Their Different Approaches and Their Features","authors":"S. Rathee, R. Rishi","doi":"10.1109/ACCT.2015.46","DOIUrl":"https://doi.org/10.1109/ACCT.2015.46","url":null,"abstract":"The integration of time and space is the key to research on the spatio-temporal database and the study on spatio temporal data model still more concerned with the theory research. This paper aims to provide a comprehensive study on developed and suggested spatiotemporal data model and highlights those areas which are currently receiving or requiring further investigations. Now, more and more demands to spatio-temporal data and spatiotemporal Data models are the key issues for describing and managing the model. The Spatio-temporal data model integrates the time and space so it can truly describe the reality.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"90 6-7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133727749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Analysis of Unsupervised Machine Learning Techniques for Network Traffic Classification","authors":"H. Singh","doi":"10.1109/ACCT.2015.54","DOIUrl":"https://doi.org/10.1109/ACCT.2015.54","url":null,"abstract":"Network traffic classification is important for QoS, Network management and security monitoring. Current method for traffic classification such as port based or payload based suffered many problems. Newly emerged application uses encryption and dynamic port numbers to avoid detection. So we use unsupervised machine learning approach to classify the network traffic. In this paper unsupervised K-means and Expectation Maximization algorithm are used to cluster the network traffic application based on similarity between them. Performance of these two algorithms is compared in terms of classification accuracy between them. The experiment results show that K-Means and EM perform well but accuracy of K-Means is better than EM and it form better cluster.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134630180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design of Dual-Frequency CPW-fed Monopole Antenna for Wireless Application","authors":"Pawan Kumar, S. Dwari","doi":"10.1109/ACCT.2015.22","DOIUrl":"https://doi.org/10.1109/ACCT.2015.22","url":null,"abstract":"A Novel and simple monopole antenna with a T-shape (gap) coplanar waveguide (CPW)-fed has been proposed in this paper. The antenna comprises of a rectangular single-step patch with a filter properties has been designed. A new coupling structure having a closed loop step-impedance resonator embedded with a uniform resonators and a modified ground plane (slots) is capable of generating dual band monopole antenna. The antenna was designed to operate at two resonating frequencies 3.5 and 5 GHz which covers a frequency bands from (3.2-3.5GHz) and (4.7-5.6GHz) respectively. A good monopole-like radiation pattern and gain over the operating bands have been obtained.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124155640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal Features Set for Extractive Automatic Text Summarization","authors":"Y. Meena, P. Deolia, D. Gopalani","doi":"10.1109/ACCT.2015.123","DOIUrl":"https://doi.org/10.1109/ACCT.2015.123","url":null,"abstract":"The goal of text summarization is to reduce the size of the text while preserving its important information and overall meaning. With the availability of internet, data is growing leaps and bounds and it is practically impossible summarizing all this data manually. Automatic summarization can be classified as extractive and abstractive summarization. For abstractive summarization we need to understand the meaning of the text and then create a shorter version which best expresses the meaning, While in extractive summarization we select sentences from given data itself which contains maximum information and fuse those sentences to create an extractive summary. In this paper we tested all possible combinations of seven features and then reported the best one for particular document. We analyzed the results for all 10 documents taken from DUC 2002 dataset using ROUGE evaluation matrices.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124219993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Security Concerns and Countermeasures in Cloud Computing Paradigm","authors":"M. Kumari, R. Nath","doi":"10.1109/ACCT.2015.80","DOIUrl":"https://doi.org/10.1109/ACCT.2015.80","url":null,"abstract":"Since the inception in 2006, cloud computing has been a hot researching area of computer network technology. Some giant companies are offering the cloud services now. Migrating data to the cloud remains a tempting trend from a financial perspective but there are several other aspects that must be taken into account before it is decided to do so. One of the most important aspects is security. Cloud computing security refers to a broad set of policies, technologies, and controls deployed to protect data, applications, and the associated infrastructure of cloud computing. This work will enable researchers and security professionals to know about users and vendors concerns and identifies relevant countermeasures to strengthen security and privacy in the Cloud environment.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131237976","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}
Sanchita Kadambari, Kalpana Jaswal, Praveen Kumar, S. Rawat
{"title":"Using Twitter for Tapping Public Minds, Predict Trends and Generate Value","authors":"Sanchita Kadambari, Kalpana Jaswal, Praveen Kumar, S. Rawat","doi":"10.1109/ACCT.2015.99","DOIUrl":"https://doi.org/10.1109/ACCT.2015.99","url":null,"abstract":"As the data sets in the world are growing at an exploding rate, research and analysis to derive value from this data has gained ground. Social media is a prime contributor to this data most of which is unstructured. The growing popularity of multimedia and mobile devices has created an overgrowing interconnected network where people are communicating on-the-go, sharing opinions on public forums, blogs, social networking websites. In this context, Twitter has emerged as a major platform to share one's ideas and opinions and millions of users are `tweeting' every second to generate a continuous influx of real-time data. Organizations are tapping into this data to gauge the general opinion or sentiment among the people and methods & techniques are being proposed for sentiment analysis & opinion mining. This has emerged as an active area of research and has a wide range of applications in every field.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124761016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Web Page Ranking Using Machine Learning Approach","authors":"Vijay Chauhan, Arunima Jaiswal, Junaid Khan","doi":"10.1109/ACCT.2015.56","DOIUrl":"https://doi.org/10.1109/ACCT.2015.56","url":null,"abstract":"This article gives an overview of the currently available literature on web page ranking algorithm using machine learning. Web page ranking algorithm, a well-known approach to rank the web pages available on cyber world. It helps us to know - how the search engine exactly works and how a machine learn itself while giving priority to the page that which page is important to successfully fulfills the user query need and which page is worth less. Machine learning approach also helps us in understanding the complex part of page priority criteria in most popular search engines like Google, yahoo, AltaVista, dog pile and many more search engines like that. Page ranking mainly unrevealed the structure of web. This article gives an overview of available literature in the field of web page ranking algorithm and it also highlights the main point based on machine leaning approach in web page ranking algorithm.","PeriodicalId":351783,"journal":{"name":"2015 Fifth International Conference on Advanced Computing & Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130221933","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}