{"title":"Fault Tolerance to Balance for Messaging Layers in Communication Society","authors":"A. Mikhail, Hayder H. Kareem, Hemant B. Mahajan","doi":"10.1109/ICCUBEA.2017.8463871","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463871","url":null,"abstract":"The present communication societies are based on use of High-Performance Computing (HPC) systems for balancing the messaging layers. However the HPC systems are vulnerable to different types of software and hardware failures which resulted into extra efforts to resume the working of such systems. Into the communication framework because of this type of vulnerabilities it was creating misbalancing around the layers of message passing. Hence there is need of fault tolerance methods in such HPC systems. There are different solutions proposed for efficient fault tolerance in HPC systems, but suffered from various limitations. The check pointing/restart technique is most commonly & frequently studied technique. Therefore in this research goal is to present efficient and new check pointing/restart method of fault tolerance in HPC systems for MPI (Message Passing Interface) application in order to balance the messaging layers. For fault tolerant systems checking the pointing consist as most important function, but additional overhead was the main problem of restriction for the method of fault tolerance due to the pointing check or the extra storage wanted to be both or check the pointer it is creating the issues to program added time. Hence, we wanted to develop the new enhanced application which helped to checkpoint restart technique for the applications of MPI. this check point method are supported by efficient & trusted distributed storage system, This kind of checkpoints assuring the availability of data at the time of hardware failure.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116865504","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":"A Novel Algorithm for Detecting Node Clone Attack in Wireless Sensor Networks","authors":"Deepali S. Patil, S. Patil","doi":"10.1109/ICCUBEA.2017.8463789","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463789","url":null,"abstract":"Dynamically changing, self configuring wireless sensor network consists of sensor nodes often deployed in harsh environment. Because of the unattended nature and lack of tamper resistant hardware, sensor networks are subject to variety of attacks like Sybil, Eavesdropping, Denial of service etc. One of the most dreadful attack is node clone attack, where attacker captures node and extracts its secrete information, makes replicas of it and insert them in the network field for further malicious behaviour. To detect and mitigate such attack, various detection schemes have been proposed based on static and mobile wireless sensor networks. In this paper, a novel node's location speed time based detection algorithm has been proposed, for detecting node clone attack in wireless network. This algorithm helps to reduce the Communication cost, Routing Overhead of the entire network and improves throughput of the network.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116960928","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":"An Efficient Audio Steganography Technique to Hide Text in Audio","authors":"Shital P. Rajput, K. Adhiya, G. Patnaik","doi":"10.1109/ICCUBEA.2017.8463948","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463948","url":null,"abstract":"Information security is the biggest challenge in recent digital communication era. Audio steganography is one of the information security techniques, which hides secret data in audio media. The traditional LSB based Audio steganography techniques are easy to implement but suffers from low embedding rate and low robustness. This paper introduces the new efficient audio steganography technique where two data bits of secret message are embedded at the time on LSB positions of carrier audio based on the compliment of 3 MSBs of carrier audio. In proposed work, two algorithms have been proposed. In Proposed Algorithm-I two data bits of secret message are embedded at a time on LSB positions of carrier audio based on the 3 MSBs of carrier audio and in Proposed Algorithm-II those two data bits are embedded on LSB positions of carrier audio but based on the compliment of 3 MSBs of carrier audio. Proposed Algorithm-I improves the embedding capacity by embedding two data bits at a time and Proposed Algorithm-II increases the robustness against attacks, because in conventional algorithms the embedding of the secret bit value is in linear fashion, therefore a hacker can easily extract the secret message. As complement operation is used in Proposed Algorithm-II extraction of data bits from complement 3 MSB's is not that much of easy than extraction of data bits from traditional algorithm. Moreover, additional security is provided with the help of secret key without knowing the valid secret key it is difficult to access the data.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116169","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 Parameter Based Comparison of Various Transforms","authors":"A. S. Jagtap, R. Shriram","doi":"10.1109/ICCUBEA.2017.8463945","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463945","url":null,"abstract":"In this paper we present analysis and implementation of Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) with “Symlet 4 (Sym 4)” and “Biorthogonal 3.5 (Bior 3.5)” and Slantlet Transform. The DCT transforms signal and images from spatial domain to frequency domain. The DWT separates 1-D signal into approximate and detail information and 2-D signal into four sub-bands LL, LH, HL, and HH. The Slantlet Transform is known as orthogonal discrete wavelet transform. It separates 1-D signal into two sub-bands approximate and detail information and 2-D signal into four sub-bands LL, LH, HL, and HH respectively. In this paper we present decomposition and reconstruction of 1-D signal (ECG) and 2-D signal(image) by using DCT, DWT with “sym 4” and “Bior 3.5” and Slantlet Transform. Signal decomposition and reconstruction is important tool for compression, watermarking and steganography applications. The amount of distortion between input signal and reconstructed signal and the quality of reconstructed signal is evaluated by calculating statistical parameters. The quality of reconstructed signal by using DCT, DWT and Slantlet Transform is measured by calculating statistical parameters such as Mean Squared Error (MSE), Peak Signal to Noise Ratio (PSNR) and Normalised Root Mean Squared Error (NRMSE) to analyse performance of all these transforms respectively. Our experimental results have shown that MSE using DCT and Bior 3.5 is less than MSE using Slantlet transform and Sym 4 respectively. Hence DCT and DWT with Bior 3.5 proves better for signal decomposition and reconstruction than DWT with Sym 4 and Slantlet Transform.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121367147","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":"Bump analysis using computational offloading considering time and energy as key factor","authors":"N. L. Chourasiya, T. Singh","doi":"10.1109/ICCUBEA.2017.8463854","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463854","url":null,"abstract":"Latest gadgets including smart phone gained popularity among users due to its portability, ease to use convenience and built-in technology, which cope up with regular needs of users. Portability defines frame of s mart phone, which led manufacturers to embed it with hardware that provides more hard and soft features within limited space. Increased number of software application in smart phone raises resource usage, which in turn led to poor device performance. To hit this problem offloading systems, introduced to increase the device efficiency level. In this paper, an attempt has done by using offloading framework called Ternary Decision Maker to offload a part of intense computation task to cloud while using a real-time application called as Rear bump analysis system.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540439","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":"Distributed Processing of Satellite Images on Hadoop to Generate Normalized Difference Vegetation Index Images","authors":"Tapan Sharma, Vinod Shokeen, Sunil Mathur","doi":"10.1109/ICCUBEA.2017.8463778","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463778","url":null,"abstract":"In the current scenario when the data is getting generated at exponential rate, it becomes essential to store and process it efficiently. In the field of remote sensing the size of the image is increasing due to advancement in technology. The volume of images being generated has also shown growth. Normalized Difference Vegetation Index (NDVI) is one of the algorithms using which greenness of the vegetation can be analyzed. In this paper, we have proposed a Hadoop MapReduce solution which processes large Landsat Images to generate NDVI raster images.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"61 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124948411","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":"Histogram of Oriented Gradient based Automatic Detection of Eye Diseases","authors":"Mrunalini D. Manchalwar, K. Warhade","doi":"10.1109/ICCUBEA.2017.8463671","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463671","url":null,"abstract":"Eye diseases are burning diseases nowadays. Eye illness identification is one of the basic issues in computer vision. Three such diseases have been considered in this paper, cataract, conjunctivitis, and stye. A cataract occurs once protein builds up within the lens of an eye and makes it cloudy which prompts the decrease in vision. Conjunctivitis or pink eye is a condition where the conjunctiva of the eye inflamed by an infection or by an allergic reaction. And the third sort of illness i.e. stye is an infection that causes a young red., painful lump near the edges of the eyelid. Generally., an eye doctor uses a slit lamp camera to find these sicknesses. But because of lack of specialist eye doctor and slit lamp camera in rural areas are the main problem of the belated in detecting those diseases. In this paper first, the captured eye images collected from different patients and processed for improvement. Then HOG used for detection of the feature vector. Finally recognition of disease done with the assistance of minimum distance classifier. This planned method is economical., computationally quick and price very low. The proposed system result with average accuracy is 96.5 percent in classification.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123452960","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":"An Improved Image Denoising Using Spatial Adaptive Mask Filter for Medical Images","authors":"Chaitali Kadam, S. Borse","doi":"10.1109/ICCUBEA.2017.8463657","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463657","url":null,"abstract":"Medical images are affected by the noise and image quality is degraded especially in magnetic Resonance Imaging (MRI) and ultrasound imaging. These images are mostly containing salt and pepper noise. It is critical to remove the noise from the medical images because the important information may affect. In this paper, a robust image denoising technique called spatial adaptive mask filtering technique has been proposed. The proposed algorithm is able to remove the noise from the MRI and ultrasound images while retaining the important information of the image. Experimentation results show that the quality of the images are improved and it is measured in terms of Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE). The comparative analysis of mean, median and adaptive median filter has been presented.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029073","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":"Usage of context vectors in document analysis","authors":"V. Khatavkar, P. Kulkarni","doi":"10.1109/ICCUBEA.2017.8463640","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463640","url":null,"abstract":"There are various machine learning algorithms to find context of document/s. These algorithms have a major limitation i.e. they can't processs huge amount of data. This paper proposes a model based on Latent Semantic Analysis (LSA), which can be used to find out documents related to the search keyword from large amount of data. The model is tested with BBC news dataset and proves to be effective than methods like Term Frequency (TF), Inverse Document Frequency (IDF) etc","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114289949","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":"Vulnerability Assessment and Penetration Testing of Web Application","authors":"Sangeeta Nagpure, Sonal Kurkure","doi":"10.1109/ICCUBEA.2017.8463920","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463920","url":null,"abstract":"As Internet usage is rising day by day security has become a vital facet to the Internet world. Security of the website in today's world is very important. Vulnerability Assessment and Penetration Testing are two different vulnerability testing. These tests have different strengths and are frequently combined to get a more complete vulnerability analysis. Penetration Testing and Vulnerability Assessments execute two different tasks, usually with distinctive outcomes, within the same area of application. For any organization, proper working of security arrangement is checked by Vulnerability Assessment and Penetration Testing. Web applications vulnerable to attacks like Session exploitation, Cross-Site Scripting, SQL injection, Cross Site Request Forgery, Buffer over Flows, and Security Misconfiguration etc. are described in Open Web Application Security Project Top 10. The manual penetration test or automatically penetration test can be done, which depends upon vulnerabilities. Comparison is made between these two tests.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129748472","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}