{"title":"An intelligent technique based on code algorithm for determination of optimum gain values of PID controller in an AGC system","authors":"K. Chandrasekhar, K. Vaisakh","doi":"10.1109/ISSP.2013.6526870","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526870","url":null,"abstract":"Automatic generation control (AGC) of a power system provides power demand signals for power generators to control frequency and tie-line power flow due to the large load changes or other disturbances. Occurrence of large real power imbalance causes large frequency deviations from its nominal value which may be a threat to secure operation of power system. To avoid such situation, emergency control to maintain the system frequency using composite differential evolution (CODE) based proportional integral-derivative (PID) controller is proposed in this paper. CODE based optimum gains give better optimal transient response of frequency and tie line power changes compared to particle swarm optimization and classical DE based PID gains.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440626","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 new scheduling algorithm LLF_DM and its comparison with existing EDF, LLF, and DM algorithms for periodic tasks","authors":"V. Prajapati, Apurva Shah, Prem Balani","doi":"10.1109/ISSP.2013.6526871","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526871","url":null,"abstract":"The most challenging part of scheduling in real time systems is to achieve successful completion of a job before its deadline. Mainly two categories of algorithms i.e. static and dynamic tried to achieve this but both categories failed either in under-loaded condition or in over-loaded condition. Dynamic algorithms achieve optimum results in under-loaded condition but fail to achieve the same in over-loaded condition. On the other side static algorithms do not achieve optimum performance in underloaded condition but perform well in over-loaded condition. So our idea behind designing new scheduling algorithm is to achieve optimum performance in under-loaded condition and to achieve high performance in over-loaded condition. To achieve this we schedule jobs according to dynamic scheduling algorithm LLF (Least Laxity First) when system is under-loaded and when system becomes overloaded we schedule jobs according to static algorithm DM (Deadline Monotonic). In this paper we have proposed a LLF_DM algorithm which achieves optimum performance in under-loaded condition and achieves very high performance in over loaded condition.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114834714","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":"Virtual offense in Maharashtra (India): Legend and truth?","authors":"Mr. D. S. Jadhav","doi":"10.1109/ISSP.2013.6526927","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526927","url":null,"abstract":"There is a common reaction that Internet crime is an highly developed category of crime that has not yet break into developed state in India like Maharashtra. The cheerful environment of the Internet in which everybody distributes whatever thing at anytime poses a serious defense hazard for every state in India. Alas, there are no official reports about this category of crime for Maharashtra. Possibly will this indicate that it does not exist there? Here we carry out an independent investigate to find out whether cyber crimes have affected public in Maharashtra and if so, to find out where they are reported.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122492370","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":"Significance of stop word elimination in meta search engine","authors":"B. Patel, D. Shah","doi":"10.1109/ISSP.2013.6526873","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526873","url":null,"abstract":"Various known meta search engines are built for specific search results. Based on search query meta search engine returns an aggregate list of search results from number of search engines. In this article, significance of stop word elimination for better search results in meta search engine is discussed, and new model of meta search engine is proposed. The output by proposed meta search engine and existing meta search engine like dogpile; with stop words and without stop words; are compared. The result shows that retrieved links in new meta search engine, with and without stop words, is more than 90% same where as by existing meta search engine like dogpile differ with more than 90%.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126287630","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":"Improved histogram bin shifting based reversible watermarking","authors":"P. Nagarju, R. Naskar, R. Chakraborty","doi":"10.1109/ISSP.2013.6526875","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526875","url":null,"abstract":"Reversible w atermarking constitutes a class of fragile digital watermarking techniques that find application in authentication of medical and military imagery. Reversible watermarking techniques ensure that after watermark extraction, the original cover image can be recovered from the watermarked image pixel-by-pixel. In this paper, we propose a novel reversible watermarking technique as an improved modification of the existing histogram bin shifting technique. We develop an optimal selection scheme for the “embedding point” (grayscale value of the pixels hosting the watermark), and take advantage of multiple zero frequency pixel values (if available) in the given image to embed the watermark. Experimental results for a set of images show that the adoption of these techniques improves the peak signal-to-noise ratio (PSNR) of the watermarked image compared to previously proposed histogram bin shifting techniques.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125063678","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":"Wavelet based image fusion techniques","authors":"P. M. Pradnya, D. Sachin","doi":"10.1109/ISSP.2013.6526878","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526878","url":null,"abstract":"The fusion of images is the process of combining two or more images into a single image retaining important features from each. Fusion is an important technique within many disparate fields such as remote sensing, robotics and medical applications. The result of image fusion is a single image which is more suitable for human and machine perception or further image-processing tasks. The image fusion algorithm based on wavelet transform is proposed to prove the geometric resolution of the images, in which two images to be processed are firstly decomposed into sub images and then the information is performed using these images under the certain criteria and finally these sub images are reconstructed into result image with plentiful information. In this paper three different image fusion methods based wavelet transform are implemented. And the results are compared and best method is found.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127117335","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":"Applications of MFCC and Vector Quantization in speaker recognition","authors":"A. Gupta, H. Gupta","doi":"10.1109/ISSP.2013.6526896","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526896","url":null,"abstract":"In speaker recognition, most of the computation originates from the likelihood computations between feature vectors of the unknown speaker and the models in the database. In this paper, we concentrate on optimizing Mel Frequency Cepstral Coefficient (MFCC) for feature extraction and Vector Quantization (VQ) for feature modeling. We reduce the number of feature vectors by pre-quantizing the test sequence prior to matching, and number of speakers by ruling out unlikely speakers during recognition process. The two important parameters, Recognition rate and minimized Average Distance between the samples, depends on the codebook size and the number of cepstral coefficients. We find, that this approach yields significant performance when the changes are made in the number of mfcc's and the codebook size. Recognition rate is found to reach upto 89% and the distortion reduced upto 69%.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125653133","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":"ADPLL design and implementation on FPGA","authors":"K. Lata, M. Kumar","doi":"10.1109/ISSP.2013.6526917","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526917","url":null,"abstract":"This paper presents the ADPLL design using Verilog and its implementation on FPGA. ADPLL is designed using Verilog HDL. Xilinx ISE 10.1 Simulator is used for simulating Verilog Code. This paper gives details of the basic blocks of an ADPLL. In this paper, implementation of ADPLL is described in detail. Its simulation results using Xilinx are also discussed. It also presents the FPGA implementation of ADPLL design on Xilinx vertex5 xc5vlx110t chip and its results. The ADPLL is designed of 200 kHz central frequency. The operational frequency range of ADPLL is 189 Hz to 215 kHz, which is lock range of the design.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125419055","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 attacks in wireless sensor networks: A survey","authors":"Manish Patel, A. Aggarwal","doi":"10.1109/ISSP.2013.6526929","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526929","url":null,"abstract":"Wireless Sensor Network (WSN) is being emerged as a prevailing technology in future due to its wide range of applications in military and civilian domains. These networks are easily prone to security attacks, since once deployed these networks are unattended and unprotected. Some of the inherent features like limited battery and low memory make sensor networks infeasible to use conventional security solutions. There are lot of attacks on these networks which can be classified as routing attacks and data traffic attacks. Some of the data attacks in sensor nodes are wormhole, jamming, selective forwarding, sinkhole and Sybil attack. In this paper, we discussed about all these attacks and some of the mitigation schemes to defend these attacks.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124005274","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":"Lifetime prolonging in LEACH protocol for wireless sensor networks","authors":"Ashish Christian, H. Soni","doi":"10.1109/ISSP.2013.6526933","DOIUrl":"https://doi.org/10.1109/ISSP.2013.6526933","url":null,"abstract":"The expeditious transformation of hardware technology has empowered the reinforcement of small, inexpensive, static and dynamic powerful sensor nodes, which are capable of sensing, computation and wireless communication on wide range of frequency with various modulation technique. This revolutionizes the implementation of wireless sensor network for considerable dimensions like overseeing some geographic area and parameter collection task. However, a limited energy constraint presents a major challenge such vision to become reality. In this paper we have attempted to explain how the wireless sensor networks are formed and how the various nodes present in those networks act as interdependent communicating nodes. LEACH (Low Energy Adaptive Clustering Hierarchy) [2] is one of the popular cluster-based structures, which has been widely proposed in wireless sensor networks. We are proposing the iLeach protocol (Improved Low-Energy Adaptive Clustering Hierarchy) and comparing to LEACH protocol. Lifetime of sensors is evaluated in terms of FND (First Node Dies) and HND (Half of the Nodes Die) [11] which will take care for the reliability and power efficiency of a wireless sensor network.","PeriodicalId":354719,"journal":{"name":"2013 International Conference on Intelligent Systems and Signal Processing (ISSP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130755657","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}