Nayana Nayak, P. Hegde, Anusha, P. Nayak, P. S. Venugopala, T. Kumaki
This paper presents an image histogram-based image manipulation detection method in android. The method consists of using a mathematical morphological-based algorithm to extract pictorial feature information from an original digital image. This will be useful in situations where it is important to find evidence of specific events such as investigation of crimes or simply image comparison. The morphological pattern spectrum was implemented in android platform using Java and OpenCV. Analysis of manipulated images indicated that the proposed detection method was able to clearly identify the differences from the original images. The results show that the proposed technique has sufficient ability to distinguish the very slight manipulation of upto one pixel size.
{"title":"Morphological Pattern Spectrum Based Image Manipulation Detection","authors":"Nayana Nayak, P. Hegde, Anusha, P. Nayak, P. S. Venugopala, T. Kumaki","doi":"10.1109/IACC.2017.0127","DOIUrl":"https://doi.org/10.1109/IACC.2017.0127","url":null,"abstract":"This paper presents an image histogram-based image manipulation detection method in android. The method consists of using a mathematical morphological-based algorithm to extract pictorial feature information from an original digital image. This will be useful in situations where it is important to find evidence of specific events such as investigation of crimes or simply image comparison. The morphological pattern spectrum was implemented in android platform using Java and OpenCV. Analysis of manipulated images indicated that the proposed detection method was able to clearly identify the differences from the original images. The results show that the proposed technique has sufficient ability to distinguish the very slight manipulation of upto one pixel size.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"29 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":"114660261","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 cost effective routing is one of major operations in WSNs. The Mamdani fuzzy inference system used to select the chance of a sensor node to become a cluster head (CH) on the basis of input parameter distance and energy of sensor nodes. The heuristic search algorithm A* is used to find the minimum path length from source to sink node. The aggregated data packets are routed from source CH node to sink node on the selected path.
{"title":"Mamdani Fuzzy Inference Based Hierarchical Cost Effective Routing (MFIHR) in WSNs","authors":"Arabinda Nanda, A. Rath","doi":"10.1109/IACC.2017.0089","DOIUrl":"https://doi.org/10.1109/IACC.2017.0089","url":null,"abstract":"The cost effective routing is one of major operations in WSNs. The Mamdani fuzzy inference system used to select the chance of a sensor node to become a cluster head (CH) on the basis of input parameter distance and energy of sensor nodes. The heuristic search algorithm A* is used to find the minimum path length from source to sink node. The aggregated data packets are routed from source CH node to sink node on the selected path.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"4 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":"134282828","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}
T.V. Divya Jyothi, N. Lavanya, C. B. Shankar, T. Sudhakar
Our power system is interconnected one where no of generators are connected together and run in unison manner to meet the demand. The lopsidedness between Generation & demand must be within a few micro seconds to avert frequency discrepant, which lead to problems in stability and security of power system. Control of frequency is paramount to counterbalance the power system by oversee the changes in frequency and load. In this paper three techniques are proposed for load frequency control, those are Ziegler-Nichols, Genetic algorithm(GA),LinearMatrixInequalities(L MI). Among them Ziegler Nichols is a tralatitious technique remaining two are advance techniques. The above techniques are validated through simulations.
{"title":"An Intelligent Load Frequency Control for Two Area System","authors":"T.V. Divya Jyothi, N. Lavanya, C. B. Shankar, T. Sudhakar","doi":"10.1109/IACC.2017.0083","DOIUrl":"https://doi.org/10.1109/IACC.2017.0083","url":null,"abstract":"Our power system is interconnected one where no of generators are connected together and run in unison manner to meet the demand. The lopsidedness between Generation & demand must be within a few micro seconds to avert frequency discrepant, which lead to problems in stability and security of power system. Control of frequency is paramount to counterbalance the power system by oversee the changes in frequency and load. In this paper three techniques are proposed for load frequency control, those are Ziegler-Nichols, Genetic algorithm(GA),LinearMatrixInequalities(L MI). Among them Ziegler Nichols is a tralatitious technique remaining two are advance techniques. The above techniques are validated through simulations.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"23 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":"121911953","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}
Vaishali Chauhan, Naresh Pal, R. Raju, Sandeep Joshi, Roheet Bhatnagar
In a mobile wireless network, the unnecessary handoff is the main issue that effects the performance of the network. A handoff occurs when the Received Signal Strength (RSS) is less than the threshold RSS and the new RSS (from neighbors Access point) is more than the present RSS. Earlier the handoff decision algorithms consider RSS only which results in an increase in handoff counting or handoff rate but in a wireless communication system, the signal strength varies due to scattering, shadowing and reflection because of obstacles in the network region. This variation in RSS leads to unnecessary handoff. In this paper, a new method for handoff decision is proposed to reduce the unnecessary handoff. With simulation results or mathematical analysis 25% unnecessary handoff reduced.
{"title":"A New Method for Minimizing Unnecessary Handoff in 802.11","authors":"Vaishali Chauhan, Naresh Pal, R. Raju, Sandeep Joshi, Roheet Bhatnagar","doi":"10.1109/IACC.2017.0082","DOIUrl":"https://doi.org/10.1109/IACC.2017.0082","url":null,"abstract":"In a mobile wireless network, the unnecessary handoff is the main issue that effects the performance of the network. A handoff occurs when the Received Signal Strength (RSS) is less than the threshold RSS and the new RSS (from neighbors Access point) is more than the present RSS. Earlier the handoff decision algorithms consider RSS only which results in an increase in handoff counting or handoff rate but in a wireless communication system, the signal strength varies due to scattering, shadowing and reflection because of obstacles in the network region. This variation in RSS leads to unnecessary handoff. In this paper, a new method for handoff decision is proposed to reduce the unnecessary handoff. With simulation results or mathematical analysis 25% unnecessary handoff reduced.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"36 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":"124193204","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}
M. Bheemalingaiah, M. Naidu, D. Rao, P. Vishvapathi
Since 2000, Mobile Ad Hoc Networks are treated as the emerging filed in the wireless communication. They comprise only mobile nodes that use wireless transmission and can be set anywhere and anytime because they eliminate complexity of infrastructure and central admission. The Mobile Ad Hoc Networks are extensively used in different fields such as emergency situations, military applications and mobile communications. The routing is the major issue in the field of MANET due to the mobility nature and lack of infrastructure of the network. The different routing protocols have been proposed to address the routing issue. The development of multipath routing for mobile ad hoc network by considering the performance metrics with standard simulator is an important research area. Hence in this paper, we have chosen Power-aware Node-disjoint Multipath Source Routing (PNDMSR) to implement and analyze its performance with respective to Multipath Dynamic Source Routing (MDSR) by using various quantitative performance metrics like, routing control overhead, throughput, packet delivery ratio, packet loss and energy efficiency by varying various parameters like network's size, mobility of node, pause time, data rate and load. The main objective of the PNDMSR is selecting energy aware node-disjoint multipath from source to destination by optimizing the overhead using node's cost and it increases the network of lifetime.
{"title":"Performance Analysis of Power-Aware Node-Disjoint Multipath Source Routing in Mobile Ad Hoc Networks","authors":"M. Bheemalingaiah, M. Naidu, D. Rao, P. Vishvapathi","doi":"10.1109/IACC.2017.0084","DOIUrl":"https://doi.org/10.1109/IACC.2017.0084","url":null,"abstract":"Since 2000, Mobile Ad Hoc Networks are treated as the emerging filed in the wireless communication. They comprise only mobile nodes that use wireless transmission and can be set anywhere and anytime because they eliminate complexity of infrastructure and central admission. The Mobile Ad Hoc Networks are extensively used in different fields such as emergency situations, military applications and mobile communications. The routing is the major issue in the field of MANET due to the mobility nature and lack of infrastructure of the network. The different routing protocols have been proposed to address the routing issue. The development of multipath routing for mobile ad hoc network by considering the performance metrics with standard simulator is an important research area. Hence in this paper, we have chosen Power-aware Node-disjoint Multipath Source Routing (PNDMSR) to implement and analyze its performance with respective to Multipath Dynamic Source Routing (MDSR) by using various quantitative performance metrics like, routing control overhead, throughput, packet delivery ratio, packet loss and energy efficiency by varying various parameters like network's size, mobility of node, pause time, data rate and load. The main objective of the PNDMSR is selecting energy aware node-disjoint multipath from source to destination by optimizing the overhead using node's cost and it increases the network of lifetime.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"1 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":"130204572","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}
Scaling database is one of the important aspects of testing the database engines. Traditionally, scaling performed in the most of the databases is with respect to the size of the database. That is, given a scaling factor, the row cardinality of each relation is scaled up by a factor. In this paper, we describe a new method of scaling database called cost based scaling. The cost is the time taken to execute a query workload on scaled database. The goal of cost based scaling is to scale the database so that time taken for executing queries on scaled database is some multiple of time for executing the queries on original database. This cost based scaling can be used as an alternative to the traditional size based scaling for testing the database engines.
{"title":"Cost-Based Database Scaling","authors":"V. Oruganti","doi":"10.1109/IACC.2017.0182","DOIUrl":"https://doi.org/10.1109/IACC.2017.0182","url":null,"abstract":"Scaling database is one of the important aspects of testing the database engines. Traditionally, scaling performed in the most of the databases is with respect to the size of the database. That is, given a scaling factor, the row cardinality of each relation is scaled up by a factor. In this paper, we describe a new method of scaling database called cost based scaling. The cost is the time taken to execute a query workload on scaled database. The goal of cost based scaling is to scale the database so that time taken for executing queries on scaled database is some multiple of time for executing the queries on original database. This cost based scaling can be used as an alternative to the traditional size based scaling for testing the database engines.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"1 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":"121049557","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}
Now a day's vehicle recognition has become a wide area of research. Vehicle recognition has several applications such as in automatic parking, toll gate management etc., Because of numerous applications, vehicle recognition in computer vision has become a research area in Intelligent Transport System (ITS). There are many different vehicles from different manufacturers which are increasing day by day. Analyzing the attributes of these vehicles and recognizing different vehicles is a complex task. The main objective of this project is vehicle identification. Vehicles can be identified by performing recognition of its iconic license plate but the License Plate Recognition System does not work when license plate is manipulated, missing or covered. Another important attribute of a vehicle is its logo which contains important information about the car and as it cannot be changed easily. Logo plays an important role in recognition of vehicles. Here vehicle recognition is concentrated based on logos in order to give the manufacturers name or brand. Vehicle recognition is performed by extracting logo using ROI selection. Then by using gray level co-occurrence matrix feature extraction method features are extracted and classification is performed based on probabilistic neural network.
{"title":"Vehicle Identification Based on the Model","authors":"T. Sridevi, P. Swapna, K. Harinath","doi":"10.1109/IACC.2017.0122","DOIUrl":"https://doi.org/10.1109/IACC.2017.0122","url":null,"abstract":"Now a day's vehicle recognition has become a wide area of research. Vehicle recognition has several applications such as in automatic parking, toll gate management etc., Because of numerous applications, vehicle recognition in computer vision has become a research area in Intelligent Transport System (ITS). There are many different vehicles from different manufacturers which are increasing day by day. Analyzing the attributes of these vehicles and recognizing different vehicles is a complex task. The main objective of this project is vehicle identification. Vehicles can be identified by performing recognition of its iconic license plate but the License Plate Recognition System does not work when license plate is manipulated, missing or covered. Another important attribute of a vehicle is its logo which contains important information about the car and as it cannot be changed easily. Logo plays an important role in recognition of vehicles. Here vehicle recognition is concentrated based on logos in order to give the manufacturers name or brand. Vehicle recognition is performed by extracting logo using ROI selection. Then by using gray level co-occurrence matrix feature extraction method features are extracted and classification is performed based on probabilistic neural network.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","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":"121645725","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}
Big data is a large amount of digital information. Now days, data security is a challenging issue that touches several areas along with computers and communication. The security of data which stored online has become a main concern. Several attackers play with confidentiality of the user. Cryptography is a approach that provide data security to the user. Despite of huge efforts to protect sensitive data, hackers typically manage to steal it. Computing with encrypted data is strategies for safeguarding confidential data. The partial homomorphic encryption is specialized for only one operation on the encrypted data. For example the Pailliers encryption scheme performs only one mathematical operation on encrypted numerical data and is successful to compute the sum of encrypted values. The Pailliers encryption scheme is unable to do multiple mathematical operations on encrypted numerical data. The proposed encryption algorithm computes more than one mathematical operation on encrypted numerical data thereby further protecting the encrypted sensitive information.
{"title":"Big Data Privacy Using Fully Homomorphic Non-Deterministic Encryption","authors":"Tejas Patil, G. Patnaik, A. T. Bhole","doi":"10.1109/IACC.2017.0041","DOIUrl":"https://doi.org/10.1109/IACC.2017.0041","url":null,"abstract":"Big data is a large amount of digital information. Now days, data security is a challenging issue that touches several areas along with computers and communication. The security of data which stored online has become a main concern. Several attackers play with confidentiality of the user. Cryptography is a approach that provide data security to the user. Despite of huge efforts to protect sensitive data, hackers typically manage to steal it. Computing with encrypted data is strategies for safeguarding confidential data. The partial homomorphic encryption is specialized for only one operation on the encrypted data. For example the Pailliers encryption scheme performs only one mathematical operation on encrypted numerical data and is successful to compute the sum of encrypted values. The Pailliers encryption scheme is unable to do multiple mathematical operations on encrypted numerical data. The proposed encryption algorithm computes more than one mathematical operation on encrypted numerical data thereby further protecting the encrypted sensitive information.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"92 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":"122845323","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}
This report furnishes the brushless DC motor (BLDC) performance when fed by multi level inverter is compared with voltage source inverter (VSI) fed BLDC motor. Total harmonic distortion (THD) of stator currents and back EMF's of BLDC Motor for these two inverter topologies are compared. Over past years for high power and medium voltage control applications multi level inverters are employed. To obtain higher levels of voltage different types of multilevel inverters are used. Among them, Cascaded H-bridge multi level inverters are mostly used due to its advantages over other. Here experimental results of a voltage source inverter fed BLDC motor performance are compared with cascaded H-bridge multilevel inverter driven BLDC motor performance.
{"title":"Performance Enhancement of Permanent Magnet Brushless DC Motor Using Multilevel Inverter","authors":"B. Kalyani, Venu Madhav Mukkavilli, G. Naik","doi":"10.1109/IACC.2017.0103","DOIUrl":"https://doi.org/10.1109/IACC.2017.0103","url":null,"abstract":"This report furnishes the brushless DC motor (BLDC) performance when fed by multi level inverter is compared with voltage source inverter (VSI) fed BLDC motor. Total harmonic distortion (THD) of stator currents and back EMF's of BLDC Motor for these two inverter topologies are compared. Over past years for high power and medium voltage control applications multi level inverters are employed. To obtain higher levels of voltage different types of multilevel inverters are used. Among them, Cascaded H-bridge multi level inverters are mostly used due to its advantages over other. Here experimental results of a voltage source inverter fed BLDC motor performance are compared with cascaded H-bridge multilevel inverter driven BLDC motor performance.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"40 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":"123932648","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}
An efficient and accurate method has been proposed in this manuscript to identify a Output Error (OE) structure based Wiener model with Craziness based Particle Swarm Optimization (CRPSO) algorithm. The accuracy and the precision of the identification scheme have been justified with the achieved bias and variance values, respectively, of the estimated parameters. Mean square error (MSE) of the output is considered as the performance measures or the fitness for the CRPSO algorithm. The various statistical measures associated with MSE confirm the superior performance of the proposed CRPSO based identification of the Hammerstein system. Accurate identification of the parameters associated with the linear as well as nonlinear block with the noisy environment ensures the robustness and stability of the overall system.
{"title":"Wiener Model Based System Identification Based on CRPSO Algorithm","authors":"P. Pal, R. Kar, D. Mandal, S. Ghoshal","doi":"10.1109/IACC.2017.0168","DOIUrl":"https://doi.org/10.1109/IACC.2017.0168","url":null,"abstract":"An efficient and accurate method has been proposed in this manuscript to identify a Output Error (OE) structure based Wiener model with Craziness based Particle Swarm Optimization (CRPSO) algorithm. The accuracy and the precision of the identification scheme have been justified with the achieved bias and variance values, respectively, of the estimated parameters. Mean square error (MSE) of the output is considered as the performance measures or the fitness for the CRPSO algorithm. The various statistical measures associated with MSE confirm the superior performance of the proposed CRPSO based identification of the Hammerstein system. Accurate identification of the parameters associated with the linear as well as nonlinear block with the noisy environment ensures the robustness and stability of the overall system.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"10 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":"131310200","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
扫码关注我们
求助内容：
应助结果提醒方式：