Volume 9 - Issue 5

IJERD : Volume 9 - Issue 5

Basudev Das, Dr Bimal C Deka

Impact of Location of Distributed Generation On Reliability of Distribution System
  • Abstract
  • Keywords
  • Reference
  • Full Article
Generally distributed generation (DG) is connected at distribution level voltage and it provides support to the distribution network. The connection of DG with distribution system improves the system reliability. The reliability improvement depends on the capacity and availability of DG and on the location of the DG connected to the distribution system. The aim of the paper is to study the impact of different locations of DG on reliability of distribution system.
Distributed generation, radial distribution system, improper and proper disconnects, reliability indices, renewable energy resources, optimal location.

[1]. Barker, P. P., Mello, R. W.:"Determining the impact of distributed generation on power system: part – I – Radial distribution system", IEEE Summer Power Meeting, Vol. – 3, Pp. 1645-1656, 2000.
[2]. Dr. Deka, Bimal C., Das, Basudev: "Embedded Generation And Its Effect On Distribution System Reliability", October 2011 All India Seminar On Power System Management organized by The Institution of Engineers ( India ), Assam State Centre, Panbazar, Guwahati.
[3]. Jenkins, N., Allan, R., Crossley, P., Kirschen, D. and Strbac, G.: "Embedded Generation", Published by the Institution of Electrical Engineers, London.
[4]. Abdullah, A. M.:"New Method for Assessment of Distributed Generation Impact on Distribution System Reliability: Islanded Operation", IEEE PES ISGT Assia 2012.
[5]. Heidari, Alireza, Agelidis, Vassilions G. and Naderi, Mohammad Salay: " Effects of Switch Type and Location on the Reliability of Power Distribution Systems Containing Distributed Generation", 978-1- 4673-4569-9/2013 IEEE....

Basudev Das, Dr Bimal C Deka "Impact of Location of Distributed Generation On Reliability of Distribution System" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0001. India
Page 01-08
ANED 06.067X/A09050108 aned
aned 067X-0905-0108


Margret N. Silva, Vipul Dalal

Nose Tip Detection Using Gradient Weighting Filter Smoothing

  • Abstract
  • Keywords
  • Reference
  • Full Article
In the area of face recognition systems, features especially nose tip has less significant attention for smoothing. This proposed model is based on the process of smoothing of 3D face images with feature detection like nose tip. Our proposed method uses Gradient Weighting Filter technique for smoothing with particular points' neighborhood surrounding in 3D face and replaces that with the weighted value of surrounding points in 3D face images. We will use the gradient weighting algorithm for detecting the nose tip and this method will correctly detect the nose tip in any position along with X, Y and Z axes. All the experiments will be performed on GAVAB, a 3D face database.
Nose tip, Gradient Weighting Filter, 3D Face images, Smoothing, Noise.

[1]. P. Bagchi, D. Bhattacharjee, M. Nasipuri, D.K. Basu, " A novel approach for nose tip detection using smoothing by weighted median filtering applied to 3D face images in variant poses, " in Proceedings of the Int. Conf. Pattern Recognition, Informatics and Medical Engineering, March 21-23, 2012, pp. 272- 277.
[2]. Qin Zhiyuan, Zhang Wiqiang, Zhang Zhanmu, Wu Bing, Rui Jie, Zhu Baoshan. "A Robust Adaptive Image Smoothing Algorithm". Joonsoo Lee "3D Face Recognition Using Range Images". Spring 2005.
[3]. G. Arce and J. Paredes. Image enhancement and analysis with weighted medians. In S. K.Mitra and G. L. Si-curanza, editors, NonlinearImage Processing. Academic Press, 2001.
[4]. Ping-Sung Liao, Tse-Sheng Chenhen and Pau-choo chung. "A Fast Algorithm for Multilevel Thresholding".
[5]. Anuar L.H., Mashohar S., Mokhtar M. and Wan Adnan W.A. "Nose Tip Region Detection in 3D Facial Model across Large Pose Variation and Facial Expression"....

Margret N. Silva, Vipul Dalal "Nose Tip Detection Using Gradient Weighting Filter Smoothing" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0002. India
Page 09-11
ANED 06.067X/B09050911 aned
aned 067X-0905-0911


M.Arulmani, V.R.Hema Latha

3G Mobile phone Induces Cancer?... (A New theory on impact of IR Radiation and O type blood)
  • Abstract
  • Keywords
  • Reference
  • Full Article
This research article focus that "3G Mobile Phone" shall be considered as a Technological advancement tool and Nature‟s gift for enhancement of Human life style rather than considered as a Health Hazard barrier and Induces cancer. This article emphasize that cancer shall be considered as the 3rd generation disease due to impact of IR Radiation and evolution of "O" type Blood origin in Human, in the expanding universe rather than use of mobile phone. In other words IR radiation environment and O type blood origin shall be considered as having highly degraded immunity against cancer. Elephants do not use Mobile phone!..., Apes do not consume tobacco!!... Birds do not drink Alcohol!!!..., But the cancer disease attacks Elephants, Apes, Birds also!... Current theory couldn‟t have any definite conclusion on the reason for fast cancer growth?... "3G mobile phone working in Non ionized state, RF radiation Bandwidth can't induce cancer disease. In fact IR radiation and O type blood origin shall be considered as the root cause for human immunity loss and carcinogenic effect".
1) Philosophy of Human Blood origin and three blood species era.
2) Philosophy of Expanding Universe and three geological period.
3) Philosophy of Neutrino fluid.
4) New definition for cell and cell structure.

[1]. Intensive Internet "e-book" study through, Google search and wikipedia
[2]. M.Arulmani, "3G Akkanna Man", Annai Publications, Cholapuram, 2011
[3]. M. Arulmani; V.R. Hemalatha, "Tamil the Law of Universe", Annai Publications, Cholapuram, 2012
[4]. Harold Koontz, Heinz Weihriah, "Essentials of management", Tata McGraw-Hill publications, 2005
[5]. M. Arulmani; V.R. Hemalatha, "First Music and First Music Alphabet", Annai Publications,
Cholapuram, 2012....

M.Arulmani, V.R.Hema Latha "3G Mobile phone Induces Cancer?... (A New theory on impact of IR Radiation and O type blood)" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0003. India
Page 12-17
ANED 06.067X/C09051217 aned
aned 067X-0905-1217


P.Mahesh, Dr. N. Vasudevan, Dr. S. Ravi, Dr. G. Saravana Kumar

Linear Operator Based Motion Detection
  • Abstract
  • Keywords
  • Reference
  • Full Article
This paper proposes a novel method to detect moving objects in a continuous video sequence. A simple linear operator based classifier, is implemented to separate target objects from their background. It also estimates stochastic parameters for each pixel of the image. The output data exhibits a frame categorization sanctioning a simple and efficient pixel-level transition identification framework. The degree of similarity between adjacent pixels and their relationship, neighbourhood can be utilized for precise detection. This paper explores the aforesaid inference to establish a spatiotemporal systematic alignment of the leaf level solution. This method accomplishes sturdiness and exactitude, with memory utilization and a highly efficient
computational structure.
Linear Operator Based Motion Detection.
[1] Vasileios Argyriou, "Sub Hexagonal Phase Correlation for Motion Estimation", IEEE transactions on Image Processing, Vol. 20, No. 1, January 2011.
[2] B. Horn, Robot Vision, Cambridge, MA. MIT Press, 1986.
[3] V.A. and T. Poggio, "Against quantitative optical flow", Proceeding of First International Conference on Computer Vision, pp. 171-180, 1987.
[4] Y.H., B.M.J., F.R., "The dense estimation of motion and appearance in layers", Proceedings of Computer Vision and Pattern Recognition Workshop, p.165, June 2004.
[5] P.I., W.M., and R. Van den Boomgaard, "Dense motion estimation using regularization constraints on local parametric models", IEEE transactions on Image Processing, Vo. 13, No. 11, Nov. 2004....
P.Mahesh, Dr. N. Vasudevan, Dr. S. Ravi, Dr. G. Saravana Kumar "Linear Operator Based Motion Detection" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0004. India
Page 18-22
ANED 06.067X/D09051822 aned
aned 067X-0905-1822


Deepti Mishra

A Review on Clustering Based Methods and Usage for Pattern Recognition
  • Abstract
  • Keywords
  • Reference
  • Full Article
Pattern recognition is an important field of computer science concerned with recognizing patterns, particularly visual and sound patterns. It is an area of work that has applications in many disciplines. Pattern recognition is the science of making inferences based on data. It is the study of how machines can observe the environment, learn to distinguish patterns of interest, make sound and reasonable decisions about the categories of the patterns. The pattern recognition is based on the concept of supervised learning and unsupervised learning. The approach based on supervised learning is called classification and the approach based on unsupervised learning is called clustering. Both the approaches are the techniques of data mining. Data mining is the approach which searches for new, valuable and nontrivial information from large volumes of data. The study includes the techniques that are based on clustering and are useful for pattern recognition. The study aims at providing the review of clustering techniques and their applications in pattern recognition. The discussion on the study will guide the researchers for improving their research direction.
Pattern Recognition, Data Mining, Clustering, unsupervised learning, supervised learning.

[1]. Pratima D. and Nimmakanti N., " Pattern Recognition algorithms for cluster identification problem", Special Issue of International Journal of Computer Science & Informatics (IJCSI),vol.- II, Issue-1, 2.
[2]. Richard j. Morris, "Statistical pattern recognition for macromolecular crystallographers", Acta crystallographica, Biological crystallography, ISSN-0907-4449, 2004, D60, 2133-2143.
[3]. S.Revathi and Dr. T. Nalini, "Performance comparison of various clustering algorithm", ijarcsse, vol 3, issue 2, Feb 2013, pg 67-72.
[4]. Koteeswaran S., P.Visu and J.Janet, "A review on clustering and outlier analysis techniques in data mining", American journal of applied sciences 9(2), ISSN 1546-9239, 2012, pg 254-258.

[5]. Richard o. Duda, Peter E. Hart, David G. Stork, " Pattern Classification",....

Deepti Mishra "A Review on Clustering Based Methods and Usage for Pattern Recognition" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0005. India
Page 23-26
ANED 06.067X/E09052326 aned
aned 067X-0905-2326


P.Sakthi priyanka, M.Ganthimathi, M.Dhivya, S.Surya

A Preserving Location Privacy of Mobile Network
  • Abstract
  • Keywords
  • Reference
  • Full Article
Mobile network consists of number of mobile nodes moving in the network randomly, In mobile networks, authentication is a required primitive for most security protocols. Unfortunately, an adversary can monitor pseudonyms used for authentication to track the location of mobile nodes. A frequently proposed solution to protect location privacy suggests that mobile nodes collectively change their pseudonyms in regions called mix zones. This approach is costly. Self interested mobile nodes might, thus, decide not to cooperate and jeopardize the achievable location privacy. To analyze non-cooperative behavior of mobile nodes by using a game-theoretic model, where each player aims at maximizing its location privacy at a minimum cost. We obtain Nash equilibria in static n-player complete information games. As in practice mobile nodes do not know their opponents' payoffs, we then consider static incomplete information games.To establish that symmetric Bayesian-Nash equilibria exist with simple threshold strategies. By means of numerical results, we predict behavior of selfish mobile nodes. We then investigate dynamic games where players decide to change their pseudonym one after the other and show how this affects strategies at equilibrium. Finally, we design protocols—Pseudo Game protocols—based on the results of our analysis and simulate their performance in vehicular network scenarios,The pseudonyms key changes mainly used in many areas such as peer to peer communication and wireless network, because this network only each time change the location .Public and private key is used for transferring the information ,number of routing algorithm is used for route the information.
Security and privacy protection, mobile computing, network protocols.
1.G. Myles, A. Friday, and N. Davies, ―Preserving privacy in environments with location-based applications,‖ IEEE Pervasive Computing, vol. 2, no. 1, pp. 56–64, Mar. 2003.
[2]. 2. M. Gruteser and D. Grunwald, ―Anonymous usage of location-based services through spatial and temporal cloaking,‖ in Proc. of ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), San Francisco, CA, May 2003.
[3]. 3.E. Schoch, F. Kargl, T. Leinmuller, S. Schlott, and P. Papadimitratos, Impact of pseudonym changes on geographic routing in VANETs,‖ Lecture Notes in Computer Science (LNCS), vol. 4357, pp. 43–57, Mar. 2007.
[4]. 4. E. Fonseca, A. Festag, R. Baldessari, and R. Aguiar, ―Support of anonymity in VANETs - Putting pseudonymity into practice,‖ in Proc. Of IEEE WCNC, Hong Kong, China, Mar. 2007.
[5]. 5.. M. Lei, X. Hong, and S. V. Vrbsky, ―Protecting location privacy with dynamic MAC address changing in wireless networks,‖ in Proc. Of IEEE Globecom, Washington, DC, Nov. 2007.....
P.Sakthi priyanka, M.Ganthimathi, M.Dhivya, S.Surya "A Preserving Location Privacy of Mobile Network" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0006. India
Page 27-32
ANED 06.067X/F09052732 aned
aned 067X-0905-2732


Prof.T.Chandrasekhar, J.S.Chakravarthi, Y.V.Sai Roja

A VLIW Vector Media Coprocessor with Cascaded SIMD ALUs
  • Abstract
  • Keywords
  • Reference
  • Full Article
High-definition video applications, such as digital TV and digital video cameras, require high processing performance for high-quality visual images in addition to a complex video CODEC. Pre-/post processing to improve video quality is becoming much more important because requirements for Pre/post processing vary among applications and processing algorithms have not been stabilized. Therefore, a new processor architecture that has a highly parallel data path is needed. In this Paper, we introduce a VLIW vector media coprocessor, "vector coprocessor (VCP)," that includes three asymmetric execution pipelines with cascaded SIMD ALUs. To improve performance efficiency, we reduce the area ratio of the control circuit while increasing the ratio of the arithmetic circuit. The total gate count of VCP is 1268 kgates and its maximum operating frequency is 300 MHz at 90-nm CMOS process. Some of the processing kernels in an adaptive prefilter that is applied to preprocessing for video encoding are evaluated. In the case of the edgeness and the sum of absolute differences, the performance is 183 giga operations per second. VCP offers enough performance for HD video processing and good cost-performance while all processing pipeline units operate effectively.
Single instruction stream, multiple data stream (SIMD), vector coprocessor (VCP), very long instruction word (VLIW).

[1]. S. Kyo, S. Okazaki, and T. Arai, "An integrated memory array processor architecture for embedded image recognition systems," in Proc.Int. Symp. Computer Architecture (ISCA), 2005, pp. 134–145.
[2]. B. Khailany, T. Williams, J. Lin, E. Long, M. Rygh, D. Tovey, andW. Dally, "A 512 GOPS stream processor for signal, image and videoprocessing," in Proc. Int. Solid-State Circuits Conf. (ISSCC), 2007, pp.272–273.
[3]. B. Mei, S. Vernalde, D. Verkest, H. D. Man, and R. Lauwereins,"ADRES: An architecture with tightly coupled VLIW processor andcoarse-grained reconfigurable matrix," in Proc. Int. Conf. Field- Programmable Logic and Applications, 2003, pp. 61–70.
[4]. T. Sato, "A dual-core dynamically reconfigurable engine employs 955parallel processing elements," presented at the Microprocessor Forum,2007, unpublished.
[5]. S. Knowles, The SoC future is soft Dec. 2005, IEE Cambridge Pro-cessor Seminar.....

Prof.T.Chandrasekhar, J.S.Chakravarthi, Y.V.Sai Roja"Impact of Location of Distributed Generation On Reliability of Distribution System" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0007. India
Page 33-37
ANED 06.067X/G09053337 aned
aned 067X-0905-3337


V.Jayasudha, V.Umarani

EUP-Growth+ - Efficient Algorithm for Mining High Utility Itemset
  • Abstract
  • Keywords
  • Reference
  • Full Article
In recent years, Utility mining becomes an emerging topicin the field of data mining. From a transaction database the discovery of itemsets with high utility like profits are referred as a high utility itemsets mining. In this paper, a new algorithm is proposed,named Enhanced Utility Pattern Growth+ (EUP-Growth+), for reducing a large number of candidate itemsets for high utility itemsetswith a set of effective strategies. These strategies are used for pruning candidate itemsets effectively. By reducing a hefty number of candidate itemsets the mining performance upgrades in terms of execution time and space requirement. The selective information ofpotential high utility itemsetsare stored in the appropriate memory using a hashing technique and maintained in a tree-based data structure named Improved Utility Pattern Tree (IMUP-Tree). The performance of EUPGrowth+ is compared with the State-of-the-art algorithms on many types of both real and synthetic data sets. Experimental and comparative results reveal that the proposed algorithms, EUP- Growth+, not only reduce the number of PHUIs effectivelybut also outperform other algorithms.
Candidate pruning, utility mining, frequent itemset, potential high utility itemset,

[1]. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 20th Int‟l Conf. Very Large Data Bases (VLDB), pp. 487-499, 1994.
[2]. R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. 11th Int‟l Conf. Data Eng., pp. 3-14, Mar. 1995.
[3]. C.F. Ahmed, S.K. Tanbeer, B.-S. Jeong, and Y.K. Lee, "Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 12, pp. 1708-1721, Dec. 2009.

[4]. C.H. Cai, A.W.C. Fu, C.H. Cheng, and W.W. Kwong, "Mining Association Rules with Weighted Items," Proc. Int‟l Database Eng. and Applications Symp. (IDEAS ‟98), pp. 68-77, 1998.
[5]. R. Chan, Q. Yang, and Y. Shen, "Mining High Utility Itemsets," Proc. IEEE Third Int‟l Conf. Data Mining, pp. 19-26, Nov. 2003....

V.Jayasudha, V.Umarani "EUP-Growth+ - Efficient Algorithm for Mining High Utility Itemset" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0008. India
Page 38-50
ANED 06.067X/H09053850 aned
aned 067X-0905-3850


R.Sakthi, V.Umarani

BSS Homomorphic Encryption: A Privacy model for large transactional database
  • Abstract
  • Keywords
  • Reference
  • Full Article
Data mining is the extraction of interesting patterns or knowledge from huge amount of data. In recent years, privacy issues in data mining have been increased enormously especially when internet is booming with social networks, e-commerce, forums, blocks, etc. Because of privacy issues the personal information collected from the users are used in unethical way that leads to information insecurity. Hence Privacy Preserving Data Mining is a research area concerned with the privacy driven from personally identifiable information when considered for data mining. The Rob Frugal method is introduced to overcome the privacy vulnerabilities of outsourced data. It is an encryption scheme, based on one to one substitution ciphers for items and adding fake patterns for database. Here the attackers/hackers can find data by guessing attack. However, it contains a number of fake patterns which leads to security issue in privacy preserving. To overcome this problem, the proposed strategy encompasses Blind Source Separation Homomorphic encryption in order to reduce the number of fake patterns and to improve the security level for outsourced data with less complexity. To avoid guessing attack from unauthorized users, the encrypted data are converted into matrix format. Our comprehensive experiments on a very large and real transaction database demonstrate that our techniques are effective, scalable, and protect privacy.
Association rule mining, privacy-preserving, fake pattern partitioning, grouping.

[1]. R. Chow, P. Golle, M. Jakobsson, E. Shi, J. Staddon, R. Masuoka, and J. Molina. Controlling data in the cloud: Outsourcing computation without outsourcing control. Pages 85–90, 2009.
[2]. M. J. Shaw, C. Subramaniam, G. W. Tan, and M. E. Welge. Knowledge management and data mining for marketing. Decis. Support Syst., 31(1):127–137, 2001.
[3]. G. M. Weiss. Data mining in the real world: Experiences, challenges, and recommendations. In DMIN, pages 124–130, 2009.
[4]. C. Tai, P. S. Yu, and M. Chen. K-support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining. In KDD, pages 473–482, 2010.
[5]. Fosca Giannotti, Laks V.S. Lakshmanan, Anna Monreale, Dino Pedreschi, and Hui Wang, "Privacypreserving data mining from outsourced databases", In SPCC2010, in conjunction with CPDP, 2010....

R.Sakthi, V.Umarani "BSS Homomorphic Encryption: A Privacy model for large transactional database" published at International Journal of Engineering Research and Development, Volume 9, Issue 5 (December 2013)
MID 0905.067X.0009. India
Page 51-59
ANED 06.067X/I09055159 aned
aned 067X-0905-5159