Volume-4 , Issue-11 , Nov - 2016 Go Back

This paper presents a cost effective product to automatically monitor and detect outages in villages who don�t have a reliable and intermittent supply of electricity. This product might prevent malpractices and corruption that linemen do by avoiding outage complaints and delaying the whole process, and hence, make the electric supply trustworthy.

Arduino, sim900a GPRS/GSM module, mobile charger circuit, Internet of Things

[1] S. K. U. D. S. C. S. G. S. R. M. S. S. and S. V. K. , "ENERGY STATISTICS 2016," CENTRAL STATISTICS OFFICE.
[2] D. C. Chandramouli, "SOURCE OF LIGHTING," Houses Household Amenities and Assets.
[3] arduino.cc, "ArduinoGSMShield," [Online]. Available: http://arduino.cc.
[4] F. B. D. L. M. R. S. V. Mehdi Achour, "http://php.net/manual/," The PHP Documentation Group, 1997-2016 . [Online]. Available: http://php.net/.
[5] SIMcom, "AT Commands Set," Shanghai SIMcom Wireless Solutions Ltd, 2010.
[6] S. W. M. Amin, " "Toward a smart grid: Power delivery for the 21st century"," IEEE Power Energy Mag, vol. 3, no. 5, pp. 34-41, Sept.-Oct. 2005.

S. Gupta , "Outage Detection Unit for Smart Monitoring of Electric Supply," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.49-52, 2016.

Communication security is an essential and progressively difficult issue in wireless networks. Physical-layer approach to secret key generation which is each quick and independent of channel variations is taken into account. This approach makes a receiver jam the signal during a manner that also permits it to decrypt the info, nevertheless prevents alternative nodes from cryptography. Another well-known approach for achieving information-theoretic secrecy depends on deploying artificial noises to blind the intruders� interception within the physical layer. A multiple inter-symbol obfuscation (MIO) theme is planned, that utilizes a collection of artificial vociferous symbols to alter the initial knowledge symbols within the physical layer. MIO will effectively enhance the wireless communications security.

Wireless communications security, physical layer security, information-theoretic secrecy, artificial noise

. Gollakota and D. Katabi, �Physical layer wireless security made fast and channel independent,� in Proc. IEEE INFOCOM, Apr. 2011, pp. 1125�1133.
[2] Tao Xiong, Wei Lou, Jin Zhang, Hailun Tan, MIO: Enhancing Wireless Communications Security Through Physical Layer Multiple Inter-Symbol Obfuscation, IEEE, VOL. 10,NO. 8, pp.1678-1691, 2015.
[3] M. I. Husain, S. Mahant, and R. Sridhar, �CD-PHY: Physical layer security in wireless networks through constellation diversity,� in Proc. IEEE MILCOM, Oct./Nov. 2012, pp. 1�9.
[4] Block Cipher Encryption Process, www.nist.gov/bcencrypt, Mar 12, 2015.
[5] Charalampos N. Pitas, Christos E. Tsirakis, �Emerging communication technologies and security challenges in a smart grid wireless ecosystem�, Int. Journal of Wireless and Mobile Computing,Vol. 7, No.3 pp. 231 � 245, 2014.

S. Lemya, V.M. Meera, A. Thrupthi, "Study On Physical Layer Wireless Security Techniques," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.53-56, 2016.

In this system an approach to clone analysis and Vulnerability detection for Web applications has been proposed together with a prototype implementation for web pages. Our approach analyzes the page structure, implemented by specific sequences of HTML tags, and the content displayed for both dynamic and static pages. Moreover, for a pair of web pages we also consider the similarity degree of their java source. The similarity degree can be adapted and tuned in a simple way for different web applications. We have reported the results of applying our approach and tool in a case study. The results have confirmed that the lack of analysis and design of the Web application has effect on the duplication of the pages. In particular, these results allowed us to identify some common features for the web pages that could be integrated, by deleting the duplications and code clones. Moreover, the clone analysis and Vulnerability detection of the pages enabled to acquire information to improve the general quality and conceptual/design of the database of the web application. Indeed, we plan to exploit the results of the code clone analysis method to support web application reengineering activities.

Vulnerability Detection, Code Clone, Dynamic Webpages, Duplication

[1] J. Anvik, L. Hiew, and G.C. Murphy, �Coping with an Open Vulnerability Repository,� Proc. OOPSLA Workshop Eclipse Technology eXchange, 2005.
[2] J. Anvik, L. Hiew, and G.C. Murphy, �Who Should Fix This Vulnerability?� Proc. 28th Int�l Conf. Software Eng. (ICSE �06), 2006.
[3] N. Bettenburg, R. Premraj, T. Zimmermann, and S. Kim, �Duplicate Vulnerability Reports Considered Harmful; Really?� Proc. IEEE 24th Int�l Conf. Software Maintenance (ICSM �08), 2008.
[4] J. Davidson, N. Mohan, and C. Jensen, �Coping with Duplicate Vulnerability Reports in Free/Open Source Software Projects,� Proc. IEEE Symp. Visual Languages and Human-Centric Computing (VL/HCC �11), 2011.
[5] P. Runeson, M. Alexandersson, and O. Nyholm, �Detection of Duplicate Defect Reports Using Natural Language Processing,� Proc. 29th Int�l Conf. Software Eng. 2007
[6] A.J. Ko, B.A. Myers, and D.H. Chau, �A Linguistic Analysis of How People Describe Software Problems,� Proc. IEEE Symp. Visual Languages and Human-Centric Computing (VL-HCC �06), 2006
[7] N. Bettenburg, S. Just, A. Schr�oter, C. Weiss, R. Premraj, and T. Zimmermann, �What Makes a Good Vulnerability Report?� Proc. 16th Int�l Symp. Foundations of Software Eng. (FSE �08), 2008
[8] S. Breu, R. Premraj, J. Sillito, and T. Zimmermann, �Information Needs in Vulnerability Reports: Improving Cooperation between Developers and Users,� Proc. ACM Conf. Computer Supported Cooperative Work (CSCW �10), 2010
[9] R.J. Sandusky and L. Gasser, �Negotiation and the Coordination of Information and Activity in Distributed Software Problem Management,� Proc. Int�l ACM SIGGROUP Conf. Supporting Group Work (GROUP �05), 2005
[10] D. Bertram, A. Voida, S. Greenberg, and R. Walker, �Communication, Collaboration, and Vulnerabilities: The Social Nature of Issue Tracking in Small, Collocated Teams,� Proc. ACM Conf. Computer Supported Cooperative Work (CSCW �10), 2010.
[11] R. Lotufo, Z.Malik, andK. Czarnecki, �Modelling the �Hurried� Vulnerability Report Reading Process to Summarize Vulnerability Reports,� Proc. IEEE 28th Int�l Conf. Software Maintenance (ICSM�12), 2012.
[12] S. Mani, R. Catherine, V.S. Sinha, and A. Dubey, �AUSUM: Approach for Unsupervised Vulnerability Report Summarization,� Proc. ACM SIGSOFT 20th Int�l Symp. the Foundations of Software Eng. (FSE �12), article 11, 2012
[13] S. Haiduc, J. Aponte, L. Moreno, and A. Marcus, �On the Use of Automated Text Summarization Techniques for Summarizing Source Code,� Proc. 17th Working Conf. Reverse Eng. (WCRE �10), pp. 35-44, 2010
[14] G. Sridhara, E. Hill, D. Muppaneni, L. Pollock, and K. Vijay Shanker, �Towards Automatically Generating Summary Comments for Java Methods,� Proc. 25th Int�l Conf. Automated Software Eng. (ASE �10), pp. 43-52, 2010
[15] Jyotsnamayee Upadhyaya, Namita Panda and Arup Abhinna Acharya �Attack Generation and Vulnerability Discovery in Penetration Testing using Sql Injection � International Journal of Computer Science and Engineering ,Volume-2, Issue-3 ,E-ISSN: 2347-2693 , 2014

K.R. Vineetha and N.S. Krishna, "Efficient Code Clone Analysis to Detect Vulnerability in Dynamic Web Applications," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.57-60, 2016.

Real time object tracking is a challenging task in computer vision. Many algorithms exist in literature like mean shift method, kernel method , pixel based, Silhouette based and sparity based, method. Of these methods robust appearance model that exploits both holistic templates and local representations is the sparsity-based discriminative classifier (SDC) and a sparsity-based generative model (SGM). SDC module, is effective method to compute the confidence value that assigns more weights to the foreground than the background in the SGM module. Further the histogram-based method is also discussed that takes the spatial information of each patch into consideration with an occlusion handing scheme. Furthermore, the update scheme considers both the latest observations and the original template, thereby enabling the tracker to deal with appearance change effectively. Experimental results show that the above method gives good performance and accuracy even in the presence of occlusion.

Object tracking, Target feature modelling, sparsity-based generative model, sparsity-based discriminative classifier

[1] A. Adam, E. Rivlin, and I. Shimshoni, �Robust fragments-based tracking using the integral histogram,� in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2006, pp. 798�805.
[2] Gandham. Sindhuja, Renuka Devi S.M.: "A Survey on detection and tracking of objects in a Video sequence", International Journal of Engineering Research and General Science Volume 3, Issue 2, Part 2, March-April, 2015, pp.418-426.
[3] Allan D. Jepson, �Robust online appearance models for visual tracking�, IEEE Conference on computer vision and pattern recognition, Kauai, 2001, vol. 1, pp. 415-422.
[4] . J. Black and A. D. Jepson, �Eigen tracking�: Robust matching and tracking of articulated objects using a view based representation, Tech. Report T95-00515, Xerox PARC, Dec 1995.
[5] Gandham Sindhuja, Renuka Devi S.M. Comparative analysis of mean shift in object tracking. IEEE Conference on Power, Control, Communication and Computational Technologies for Sustainable Growth (PCCCTSG),2015, 283-287.
[6] Zhong, Wei, Huchuan Lu, and Ming-Hsuan Yang. "Robust object tracking via sparsity-based collaborative model." Computer vision and pattern recognition (CVPR), 2012 IEEE Conference on. IEEE, 2012.
[7] Zhong, Wei, Huchuan Lu, and Ming-Hsuan Yang. "Robust object tracking via sparse collaborative appearance model." IEEE Transactions on Image Processing 23.5 (2014): 2356-2368.
[8] B. Liu, J. Huang, L. Yang, and C. Kulikowsk, �Robust tracking using local sparse appearance model and k-selection,� in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2011, pp. 1313�1320.
[9] B. Liu, L. Yang, J. Huang, P. Meer, L. Gong, and C. Kulikowski, �Robust and fast collaborative tracking with two stage sparse optimization,� in Proc. 11th Eur. Conf. Comput. Vis., 2010, pp. 624�637.
[10] I. Matthews, T. Ishikawa, and S. Baker, �The template update problem,� IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 6, pp. 810�815, Jun. 2004.
[11] Q. Wang, F. Chen, W. Xu, and M.-H. Yang, �Online discriminative object tracking with local sparse representation,� in Proc. IEEE Workshop Appl. Comput. Vis., Jan. 2012, pp. 425�432.
[12] S. Avidan, �Support vector tracking,� IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 8, pp. 1064�1072, Aug. 2004.
[13] T. B. Dinh and G. G. Medioni, �Co-training framework of generative and discriminative trackers with partial occlusion handling,� in Proc. IEEE Workshop Appl. Comput. Vis., Jan. 2011, pp. 642�649.
[14] W. Zhong, H. Lu, and M.-H. Yang, �Robust object tracking via sparsitybased collaborative model,� in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2012, pp. 1838�1845.
[15] X. Jia, H. Lu, and M.-H. Yang, �Visual tracking via adaptive structural local sparse appearance model,� in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2012, pp. 1822�1829.
[16] X. Mei and H. Ling, �Robust visual tracking using _1 minimization,� in Proc. IEEE 12th Int. Conf. Comput. Vis., Oct. 2009, pp. 1436�1443.
[17] Y. Li, H. Ai, T. Yamashita, S. Lao, and M. Kawade, �Tracking in low frame rate video: A cascade particle filter with discriminative observers of different life spans,� IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 10, pp. 1728�1740, Oct. 2008.
[18] Z. Kalal, K. Mikolajczyk, and J. Matas, �Tracking-learning-detection,� IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 7, pp. 1409�1422, Jul. 2012.
[19] http://faculty.ucmerced.edu/mhyang/pubs.html, and http://ice.dlut.edu.cn/lu/publications.html,

S.M.R. Devi , "Object Tracking Based on Sparse Discriminative and Generative Model," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.61-68, 2016.

Security-typed programming languages aim to track insecure information flows in application program. This is achieved by extending data types with security labels in order to identify the confidentiality and integrity policies for each data element. Such policies specify which principals or entities are allowed to read from or write to the value of data respectively. In this paper, we evaluate the run-time overhead of dynamic information flow (DIF) analysis in security typed programming languages. Such analysis is performed by including the security labeling in the dynamic operational semantics. Our evaluation mechanism relies on developing two different language implementations for a simple while programming language that has been considered as a case of study. The first one is a traditional interpreter that implements the ordinary operational semantics of the language without security labeling of data types and hence performs no information flow analysis. The second one is an interpreter that performs a dynamic information flow analysis by implementing the security labeling semantics (where language data types are augmented with security labels). Next, two execution times of a program executed using both interpreters are measured (i.e., one execution time for each interpreter). The resulting difference in execution time represents the absolute run-time overhead of dynamic information flow analysis. We have calculated the difference in execution time for some benchmark programs that are executed using both implementations.

Dynamic information flow; security labeling; run-time overhead; operational semantics

[1] Sabelfeld, A., and Myers, A. C.: Language-Based information-Flow Security. IEEE J. on Sel. Areas in Comm., 21(1):5� 19, 2003.
[2] Myers, A. C.: Flow: Practical Mostly-Static information Flow Control. In Proceeding of POPL�99, pp. 228�241, ACM, 1999.
[3] Simonet, v., and Rocquencourt, I.: Flow Caml in a Nutshell. In Proc. Of APPSEM-II, pp. 152�165, 2003.
[4] Alejandro, R. and Andrei, S. Dynamic vs. Static Flow-Sensitive Security Analysis. In Proceedings of 23rd IEEE Computer Security Foundations Symposium (CSF�10), pp.186 - 199, 2010.
[5] Shroff, P., Smith, S., and Thober, M.: Securing information Flow via Dynamic Capture of Dependencies. In Journal of Computer Security, 16:673�688, 2008.
[6] Denning, D. E.: A Lattice Model of Secure Information Flow. journal of Commun. ACM, 19(5):236 � 243, 1976.
[7] Molnar. D., Piotrowski, M. , Schultz,D., and Wagner, D: The program counter security model: Automatic detection and removal of control flow side channel attacks. In Proc. of ICISC�05, vol. 3935 of LNCS, pp.156168. Springer, 2005.
[8] Brand, M. G. J. V. D., Deursen, A. V., Heering, J., Jonge, J. M., Kuipers, T., Klint, P. , Moonen, L., Olivier, P., Scheerder, J., Vinju, J.J. , Visser,E., and Visser, J.: The ASF+SDF Meta-Environment: A Component-Based Language Development Environment. In Proc. Of CC�01, vol. 2027 of LNCS, pp. 365�370, Springer, 2001.
[9] Deursen, A. V., Heering, J., and Klint, P.: Language Prototyping: An Algebraic Specification Approach: Vol. V. AMAST Series in Computing, World Scientific, 1996.
[10] Heering, J., Hendriks, P., Klint, P., and Rekers.J.: The Syntax Definition Formalism SDF - Reference Manual, 1989.
[11] Brand, M. G. J. V. D., and Klint, P. Asf+sdf Meta-Environment User Manual Revision 1.134. Technical report, CWI Centrum voor Wiskunde en Informatica, Amsterdam, 2003. Available at: http://www. cwi.nl/projects/MetaEnv/meta.
[12] Brand, M. G. J. V. D., Klint, P., and Vinju, J.J. The Language Specification Formalism ASF+SDF, 2008.
[13] Klint, P.: A Meta-Environment for Generating Programming Environments. In ACM TOSEM, 2(2):176�201, 1993.
[14] Eclipse Platform technical overview. Object Technology International, Inc., 2003.
[15] Brand, M. G. J. V. D., Jong, H. A., Klint, P. and Kooiker, A. T. A language development environment for Eclipse. In Proceedings of OOPSLA Workshop on Eclipse Technology eXchange., 2003.
[16] Shroff, P., Smith, S., and Thober, M.: Dynamic Dependency Monitoring to Secure Information Flow. In Proc. of CSF�07, pp. 203�217, IEEE, 2007.
[17] Le Guernic, G. Confidentiality Enforcement Using Dynamic Information Flow Analyses. PhD thesis, Kansas State University, 2007.
[18] Austin, T. H. and Flanagan, C. Efficient Purely-Dynamic Information Flow Analysis. In Proc. of PLAS 2009, pp. 113�124, ACM, 2009.
[19] Austin, T. H. Dynamic Information Flow Analysis for JavaScript in a Web Browser. PhD thesis, University of California, Santa Cruz, March, 2013.
[20] Austin, T. H., Disney, T., Flanagan, C and Jeffrey, A. Dynamic Information Flow Analysis for Featherweight JavaScript. Technical Report #UCSC-SOE-11-19, University California, Santa Cruz, 2011.
[21] Myers, A. C. and Liskov, B. Protecting Privacy Using the Decentralized Label Model. ACM TOSEM, 9:410 � 442, 2000.

D. Hassan, "Evaluating the Overhead of Dynamic Information Flow Analysis Performed by Security Typed Programming Languages," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.69-74, 2016.

Image segmentation is very important application in a biomedical diagnosis use image data analysis. In medical analysis the accuracy of image segmentation has a critical clinical requirement for the localization of body organs or pathologies in order to raise the quality of prediction of disease or infections. This paper covers review that includes several articles in which latest A.I biomedical image segmentation techniques are applied to different imaging color space models. This review article describes how various computer assisted diagnosis system works for achieving the goal of finding abnormal segments of body organs in biomedical images of the MRI, ultrasound etc. It has been observed that those segmentation approach are broadly giving accurate results in which the segmentation of the images is performed by defining an active shape model and then localization of potential area of interest using thresholding.

Image processing, biomedical analysis, detection, pattern recognition

Rastgarpour M., and Shanbehzadeh J., Application of AI Techniques in Medical Image Segmentation and Novel Categorization of Available Methods and Tools, Proceedings of the International MultiConference of Engineers and Computer Scientists 2011 Vol I, IMECS 2011, March 16-18, 2011, Hong Kong.
[2] Zhang, Y. J, An Overview of Image and Video Segmentation in the last 40 years, Proceedings of the 6th International Symposium on Signal Processing and Its Applications, pp. 144-151, 2001.
[3] Wahba Marian, An Automated Modified Region Growing Technique for Prostate Segmentation in Trans Rectal Ultrasound Images, Master�s Thesis, Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada, 2008.
[4] Li CH, Tam PKS (1998) An iterative algorithm for minimum cross-entropy thresholding. Pattern Recognit Lett 19(8):771�776.
[5] Sezgin M, Sankur B (2004) Survey over image thresholding techniques and quantitative performance evaluation. J Electron Imaging 13(1):146�168 1005
[6] Haralick RM, Shapiro LG (1985) Image segmentation techniques. Comput Vis Graph Image Process 29(1):100�132 1009
[7] Hojjatoleslami SA, Kruggel F (2001) Segmentation of large brain lesions. IEEE Trans Med Imaging 20:666�669 1011
[8] Wan S-Y, HigginsWE (2003) Symmetric region growing. IEEE Trans Image Process 12(9): 1007�1015 1013
[9] Mendonca AM, Campilho A (2006) Segmentation of retinal blood vessels by combining the detection of centerlines and morphological reconstruction. IEEE Trans Med Imaging 25: 1200�1213
[10] Dehmeshki J, Member HA, Valdivieso M, Ye X (2008) Segmentation of pulmonary nodules in thoracic CT scans: a region growing approach. IEEE Trans Image Process 27(4):467�480
[11] Rogowska J (2000) Overview and fundamentals of medical image segmentation. In: 962 Bankman I (ed) Handbook of medical image processing and analysis. Elsevier, Amsterdam, 963 The Netherlands, pp 69�85
[12] Geman S, Geman D (1984) Stochastic relaxation, Gibbs distributions, and Bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell 6(6):721�741
[13] Scott DW (1992) Multivariate density estimation: theory, practice, and visualization. Wiley, New York
[14] Duda RO, Hart PE, Stork DG (2001) Pattern classification, 2nd edn. Wiley, New York.
[15] Rohlfing T, Brandt R, Menzel R, Russakoff DB,Maurer CR Jr (2005) Quo vadis, atlas-based segmentation? In: Suri JS, Wilson DL, Laxminarayan S (eds) Handbook of Biomedical Image Analysis, vol III: Registration Models. Kluwer Academic/Plenum Publishers, New York, pp 435�486, chapter 11
[16] Isgum I, Staring M, Rutten A, Prokop M, Viergever MA, van Ginneken B (2009) Multiatlas-based segmentation with local decision fusion-application to cardiac and aortic segmentation in CT scans. IEEE Trans Med Imaging 28(7):1000�1010.
[17] Stancanello J, Romanelli P, Modugno N, Cerveri P, Ferrigno G, Uggeri F, Cantore G (2006) Atlas-based identification of targets for functional radiosurgery. Med Phys 33(6):1603�1611.
[18] Li B, Christensen GE, Hoffman EA, McLennan G, Reinhardt JM (2003) Establishing a normative atlas of the human lung: intersubject warping and registration of volumetric CT images. Acad Radiol 10(3):255�265
[19] Park H, Bland PH, Meyer CR (2003) Construction of an abdominal probabilistic atlas and its application in segmentation. IEEE Trans Med Imaging 22(4):483�492
[20] Leemput KV (2009) Encoding probabilistic brain atlases using Bayesian inference. IEEE Trans Med Imaging 28(6):822�837.
[21] Kittler J, Hatef M, Duin RPW, Matas J (1998) On combining classifiers. IEEE Trans Pattern Anal Mach Intell 20(3):226�239
[22] Artaechevarria X, Munoz-Barrutia A, Ortiz-de-Solorzano C (2009) Combination strategies in multi-atlas image segmentation: application to brain MR data. IEEE Trans Med Imaging 28(8):1266�1277
[23] Rohlfing T, Russakoff DB, Maurer CR (2004) Performance-based classifier combination in atlas-based image segmentation using expectation-maximization parameter estimation. IEEE Trans Med Imaging 23(8):983�994.
[24] Rohlfing T, Maurer CR Jr (2007) Shape-based averaging. IEEE Trans Image Process 16(1): 153�161
[25] Kass M, Witkin A, Terzopoulos D (1987) Snakes: active contour models. Int J Comput Vis 1(4):321�331
[26] Duta N, Sonka M (1998) Segmentation and interpretation of MR brain images: an improved active shape model. IEEE Trans Med Imaging 17(6):1049�1062
[27] Tsai A, Yezzi A Jr, Wells W, Tempany C, Tucker D, Fan A, Grimson WE, Willsky A (2003) A shape based approach to the segmentation of medical imagery using level sets. IEEE Trans Med Imaging 22(2):137�154

P. Ranjan, P.R. Khan, "Review of improved A.I. based Image Segmentation for medical diagnosis applications," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.75-81, 2016.

Generally, huge data of any organization possess data redundancy, noise and data inconsistency. To eliminate, Data preprocessing should be performed on raw data, then sorting technique is applied on it. Data preprocessing includes many methods such as data cleaning, data integration, data transformation and data reduction. Depending on the complexity of given data, these methods are taken and applied on raw data in order to produce quality of data. Then, external sorting is applied. The proposed external sorting now takes the number of passes less than actual passes log B (N/M) + 1 for the traditional B � way external merge sorting. Also, the number of Input / Outputs of proposed method is less than 2*N* (log B (N/M) + 1) of Input / Outputs than traditional method, and also proposed method consume least number of runs compared to actual basic external sorting.

data preprocessing, external sorting, Data cleaning, passes, Inputs / Outputs, and runs

[1] Mark Allen Weiss, �Data Structures and Algorithm Analysis in C++�, Chapter7, Fourth Edition, Pearson, Florida International University, ISBN-13: 978-0-13-284737-7, ISBN-10: 0-13-284737-X.
[2] Mark Allen Weiss, �Data Structures and Algorithm Analysis in Java �,Chapter7,Third Edition, Pearson, Florida International University ISBN-13: 978-0-13-257627-7,ISBN-10: 0-13-257627-9.
[3] Alfred V. Aho, John E. HopCroft and Jelfrey D. Ullman, �Data Structures and Algorithms�, Chapter- Sorting,Addison �Wesley, 1983.
[4] Micheline Kamber and Jiawei Han,�Data Preprocessing, Data Mining Principles and Techniques�.
[5] Margaret H Dunham, �Data Mining Introductory and Advanced Topics�, Pearson Education, 2e, 2006.
[6] Sam Anahory and Dennis Murry,�Data warehousing in the Real World�,Pearson Education,2003.
[7] D. E. Knuth (1985), Sorting and Searching, The Art of Computer Programming, Vol. 3, Addison �Wesley, Reading, MA, (1985).
[8] ] Alok Aggarwal and Jeffrey Scott Vitter, Input and Output Complexity of Sorting and related problems, Algorithms and Data Structure, AV88.pdf.
[9] Leu, , Fang-Cheng; Tsai, Yin-Te; Tang, Chuan Yi,�An efficient External Sorting Algorithm�, pp.159 � 163, Information Processing Letters 75 2000.
[10] Ian H. Witten, Eibe Frank, Morgan Kaufmann,�Data Mining: Practical Machine Learning Tools and Techniques�, Second Edition (Morgan Kaufmann Series in Data Management Systems), 2005.
[11] Zhi � Hua Zhou, Dept. of CSE, Nanjing University,�Introduction to Data Mining�, part3: Data Preprocessing, Pt03.pdf, Spring 2012.
[12] Chapter 3. Data Preprocessing, www.cs.uiuc.edu
[13] Chapter 2. Data Preprocessing, ww.cs.gsu.edu/
[14] R&G Chapter 13:External Sorting, inst.eecs.berkeley.edu .
[15] Chapter11:External Sorting, www.cs.rutgers.edu /~muthu/lec9-04.ppt.
[16] DATAMINING/IT0467, http://www.srmuniv.ac.in
[17] Chiara Rebso, KDD- LAB, ISTI � CNR, Pisa, Italy ,http://www.techrepublic.com/
[18] APPLICATION OF A DATA MINING TASK CALLEDDATA PREPROCESSING ON THE INPUT DATA AND EFFICIENT EXTERNAL SORTING USING REFINEMENT OF EXISTING ALGORITHM, http://esatjournals.net/
[19] A Survey on Improved Time Complexities for the certain data structures using data preprocessing and refinement of existing algorithms used over them, http://ijarcet.org/
[20] Performance Analysis of Data Reduction Algorithms using Attribute Selection in NSL-KDD Dataset, http://ijesat.org .

S.H. Raju, M.N. Rao, "Improvement of Time Complexity on External Sorting using Refined Approach and Data Preprocessing," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.82-86, 2016.

User authentication is a crucial service in wireless sensor networks (WSNs) because wireless sensor nodes are typically deployed in an unattended environment, leaving them open to possible hostile network attack. The main goal of research is to Authenticate remote user in a convenient and Secured manner. In this paper, we propose a ABC( Artificial Bee Colony optimization algorithm for matching)algorithm for user authentication in hierarchical wireless sensor networks using Biometric (finger print)data. In the proposed scheme ABC algorithm calculates the standard deviation(threshold value) from the biometric data (finger print) which is used for user authentication with maximum fitness in an optimized and secured manner.

Hieriarchical wireless sensor network,Artificial Bee Colony ,User Authentication

[1] Awasthi A. K. and Lal S, �A remote user authentication scheme using smarts cards with forward secrecy,� IEEE Trans. Consumer Electronic, vol. 49, no. 4, pp. 1246-1248, 2003.
[2] Chan C. K. and Cheng L. M, �Cryptanalysis of a remote user authentication scheme using smart cards,� IEEE Trans. Consumer Electronic, 46, pp. 992-993, 2000.
[3] Leung K. C., Cheng L. M., Fong A. S. and Chen C. K, �Cryptanalysis of a remote user authentication scheme using smart cards,� IEEE Trans. Consumer Electronic, 49-3, pp.1243-1245, 2003.
[4] Lee S. W., Kim H. S. and Yoo K. Y, �Comment on a remote user authentication scheme using smart cards with forward secrecy,� IEEE Trans. Consumer Electronic, 50, 2: pp. 576-577, 2004.
[5] Liaw H.T., Lin J.F. and Wu W.C., �An efficient and complete remote user authentication scheme using smart cards,� Mathematical and Computer Modelling, 44, pp. 223-228, 2006.
[6] Shen Z. H, �A new modified remote user authentication scheme using smart cards,� Applied Mathematics, Volume 23-3, 371-376, 2008.
[7] M. T. Thai, F. Wang, D. Liu, S. Zhu, and D. Z. Du, �Connected dominating sets in wireless networks with different transmission ranges,� IEEE Transactions on Mobile Computing, vol. 6, no. 7, pp. 721� 730, 2007.
[8] F. Dressler, �Authenticated reliable and semi-reliable communication in wireless sensor networks,� International Journal of Network Security, vol. 7, no. 1, pp. 61�68, 2008.
[9] R. Fan, L. di Ping, J. Q. Fu, and X. Z. Pan, �A secure and efficient user authentication protocol for two tiered wireless sensor networks,� in Second Pacific Asia Conference on Circuits, Communications and System (PACCS�10), vol. 1, pp. 425�428, 2010.
[10] D. He, Yi Gao, S. Chan, C. Chen, and J. Bu, �An enhanced two-factor user authentication scheme in wireless sensor networks,� Ad Hoc & Sensor Wireless Networks, vol. 10, no. 4, pp. 361�371, 2010.
[11] M. K. Khan and K. Alghathbar, �Cryptanalysis and security improvements of two-factor user authentication in wireless sensor networks,� Sensors, vol. 10, no. 3, pp. 2450�2459, 2010.
[12] P. Kumar and H. J. Lee, �Cryptanalysis on two user authentication protocols using smart card for wireless sensor networks,� in Wireless Advanced (WiAd�11), pp. 241�245, 2011.
[13] H. Ru Tseng, R. H. Jan, and W. Yang, �An improved dynamic user authentication scheme for wireless sensor networks,� in IEEE Global Telecommunications Conference (GLOBECOM�07), pp. 986�990, 2007.
[14] B. Vaidya, D. Makrakis, and H. T. Mouftah, �Improved two-factor user authentication in wireless sensor networks,� in IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob�10), pp. 600�606, 2010.
[15] B. Vaidya, J. Silva, and J. J. P. C. Rodrigues, �Robust dynamic user authentication scheme for wireless sensor networks,� in Proceedings of the 5th ACM Symposium on QoS and Security for Wireless and Mobile Networks (Q2SWinet�09), pp. 88�91, 2009.
[16] R. Watro, D. Kong, S. F. Cuti, C. Gardiner, C. Lynn, and P. Kruus, �Tinypk: Securing sensor networks with public key technology,� in Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN�04), pp. 59�64, 2004.
[17] K. H. M. Wong, Y. Zheng, J. Cao, and S. Wang, �A dynamic user authentication scheme for wireless sensor networks,� in IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC�06), pp. 244�251, 2006.
[18] J. Yuan, C. Jiang, and Z. Jiang, �A biometric based user authentication for wireless sensor networks,� Wuhan University Journal of Natural Sciences, vol. 15, no. 3, pp. 272�276, 2010.
[19] A. K. Das, �Improving identity-based random key establishment scheme for large-scale hierarchical wireless sensor networks,� International Journal of Network Security, vol. 14, no. 1, pp. 1�21, 2012.
[20] M. L. Das, �Two-factor user authentication in wireless sensor networks,� IEEE Transactions on Wireless Communications, vol. 8, no. 3, pp. 1086�1090, 2009.
[21] William Stallings, �Cryptography and Network Security-Principles and Practices,� 3rd Edition, Pearson Education Asia, 2003.
[22] Xue-lei Li, Qiao-yan Wen, Hua Zhang, Zheng-ping Jin and Wen-min Li, �Offline Password Guessing Attacks on Smart-Card-Based Remote User Authentication Schemes,� In Proceedings of the 6th International Asia Conference on Industrial Engineering and Management Innovation, Atlantis Press, pp. 81-89, 2016.
[23] Chun-Ta Li, Hua-Hsuan Chen, Min-Jie Syu, Chun-Cheng Wang and Cheng-Chi Lee, �Cryptanalysis of an anonymous multi-server authenticated key agreement scheme using smart cards and biometrics,� In Information Networking (ICOIN), IEEE International Conference, pp. 498-502, 2015.
[24] Mrudula Sarvabhatla, Kodavali Lakshmi Narayana and Chandra Sekhar Vorugunti, �An improved secure remote user authentication scheme using smart cards with check digits,� Signal Processing, Informatics, Communication and Energy Systems (SPICES), IEEE International Conference, PP. 1 - 5, 2015.
[25] Hao Lin, Fengtong Wen and Chunxia Du, �An Improved Lightweight Pseudonym Identity Based Authentication Scheme on Multi-server Environment,� In Wireless Communications, Networking and Applications, Springer India, pp. 1115-1126, 2016.
[26] Fengtong Wen, Willy Susilo, Guomin Yang, �Analysis and Improvement on a Biometric-Based Remote User Authentication Scheme Using Smart Cards,� Wireless Personal Communications, pp.1747-60, 2015.
[27] C.I. Watson, C.L. Wilson, NIST special database 4, fingerprint database, U.S. National Institute of Standards and Technology, 1992.
[28] E. J. Yoon, K. Y. Yoo, �Robust biometrics based multi-server authentication with key agreement scheme for smart cards on elliptic curve cryptosystem,� The Journal of Supercomputing, vol. 63, no. 1, pp. 235�255, 2013.
[29] Watro, R., Kong, D., Cuti, S., Gardiner, C., Lynn, C.,Kruus, P. �TinyPK: securing sensor networks with public key technology�. In: Proceedings of the 2nd ACM workshop on security of ad hoc and sensor networks, SASN 2004, Washington, DC, USA; October 2004. p. 59�64
[30] Das, M. L. �Two-factor user authentication in wireless sensor networks�. IEEE Transactions on Wireless Communications 2009; 8(3):1086�90.
[31] Wong, K., Zheng, Y., Cao, J., Wang, S. �A dynamic user authentication scheme for wireless sensor networks�. In: Proceedings of IEEE international conference on sensor networks, ubiquitous, and trustworthy computing, IEEE Computer Society; 2006. p. 244�51.

D. Thamaraiselvi, M. Ramakrishnan, "An ABC Optimized Biometric based User Authentication in WSN," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.87-93, 2016.

Constraint based pattern mining and association rules are used in many applications like genetic sequence analysis, in finance for bankrupting prediction, in securities for fraud detection, in agriculture for discovering classification of plants etc. to get the user interesting knowledge. Constraints are useful to eliminate unwanted rules and also solves rule explosion problem. Many algorithms are proposed for constraint based pattern mining and association rule generation. These constraints are in the form of attribute, item length, time or duration, regular expression etc. Pushing constraints in a mining process gives user interesting discovery. Literature survey shows that performance of an algorithm improves with application of constraint during the mining process. The paper elaborates about the literature survey on use of constraints in generation of association rules with different categories of constraints with its properties.

constraint;frequent;sequence;pattern;mining

[1] Ramakrishnan Srikant and Rakesh Agrawal,�Mining Sequential Patterns: Generalizations and Performance Improvements‖�, Advances in Database Technology � EDBT �96 Lecture Notes in Computer Science, Springer, Volume 1057, pp 1-17, 1996
[2] Ayres, J.,Gehrke, J.Yiu T. and Flannick J.� Sequential Pattern Mining using Bitmap representation in proceeding of ACM SIGKDD�02,pp 429-35,2002
[3] M.J.Zaki, �Spade: An efficient algorithm for mining frequent sequences�, Machine Learning 42 (2001), pp. 31-60
[4] J.Pei, J han, B.Mortazavi PrefixSpan: Mining Sequential Patterns efficiently by prefix projected pattern growth ,ICDE 2001,Heidelberg,Germany,2001 pg 215-224
[5] H.Han, J.Pei, B.Mortazavi- Asl,Q.Chen, U. Dayal and M-C Hsu(2000) FreeSpan: Frequent Pattern projected Sequential Pattern mining: Proceedings of 2000 International Conference on Knowledge discovery and data mining pp 355-359
[6] Jiawei Han,Micheline Kamber,Jain Pei, �Data Mining Concepts and Techniques�,Third Edition,2012,ISBN:978-0-12-381479-1.
[7] J.Pei, J.han and W.Wang, �Constraint based sequential pattern mining: the pattern growth method�, in journal of Intelligent Information systems (2007), pp.133-160.
[8] M.N.Garofalakis, R.Rastogi and K.Shim, � Spirit: Sequential pattern mining with regular expression constraints�, In Atkinson, M.P., Orlowska, M.E., Valduriez , P., Zdonik, S.B., Brodie, M.L., eds.: VLDB�99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK, Morgan Kaufmann (1999),pp. 223-234 .
[9] Shigeaki Sakurai, Youichi Kitahara and Ryohei Orihana, �Sequential Pattern Mining based on new criteria and attribute constraint�,IEEE International Conference on Systems,Man and Cybernetics 2007.
[10] Marion Leleu,Christophe Rigotti,Jean-Francois Boulicar and guillaume Euvrard, �Constraint Based Mining of Sequential Patterns over Dataset with Consecutive Repetitions�,PKDD 2003.
[11] Yen-Liang Chen,Ya-Han Hu, �Constraint Based Sequential Pattern Mining:The Consideration of Recency and Compactness �,Decision Support System by Elseveir 42(2006) pp.1203-1215.
[12] Tedeusz Morzy,Marek Wajeiechowski,Maciej Zakrzewicz,� Efficient Constraint based Sequential Pattern Mining using dataset filtering techniques�, Proceedings of the Baltic Conference, BalticDB&IS 2002, Volume 1,2002
[13] Yu Hirate, H.Yamana, �Generalized sequential pattern mining with item interval�,Proceedings of 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining 2006.
[14] L.Gomez, A.A.Vaisman, �Re-SPAM: Using Regular Expression for sequential pattern mining in Trajectory database�, IEEE International Conference on Data Mining workshops 2008
[15] D.Senthil Kumar , N.Jayaveeran, � A survey on Association Rule Mining Algorithms for Frequent Itemset �,International Journal of Computer Science and Engineering,Vol.4,Issue-10,Oct-2016

R.V. Mane, V.R. Ghorpade, "Use of Constraints in Pattern Mining: A Survey," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.95-99, 2016.

There are various pattern matching algorithms which take more comparisons in finding a given pattern in the text and are static and restrictive. In order to search pattern or substring of a pattern in the text with less number of comparisons, a general data mining technique is used called data preprocessing which named as D-PM using DP with help of one time look indexing method. The D-PM using DP finds given pattern or substring of given pattern in the text in less time and the time complexity involved is less than existing pattern matching algorithms. The new Pattern Matching Algorithm with data preprocessing (D-PM using DP) proposes Pattern Matching with dynamic search behavior and makes users should have flexibility in searching.

Pattern Matching, Data Preprocessing (DP), Time Complexity, Comparisons, Onetime look Indexing

[1] Michael T.Good Rich and Roberto Tamassia,� Data Structures and Algorithms in java�,6th edition,2014.
[2] Akepogu Ananda Rao,Radhika Raju Palagiri, � Data Structures and Algorithms using C++�,Pearson,2010.
[3] Donald Adjeroh, Timothy Bell and Amar Mukharjee,�TheBurrows Wheeler Transform�,Springer,
ISBN-13: 978-0387789088.
[4] Machael McMillan,� Data Structures and Algorithms using Visual Basic.NET�,Cambridge, ISBN-13: 978-0521547659.
[5] Svetlana, Eden,� Introduction to String Matching and modification in R using Regular expressions�, march,2007.
[6] Jeffrey.E.F.Fredl,� Mastering Regular Expression� 3rd Edition, O,reilly publications, ISBN-13: 978-0596528126.
[7] �Regular expressions and Matching�, http://modernperlbooks.com/
[8] S. S. Sheik,Sumit K. Aggarwal,Anindya Poddar, N. Balakrishnan,and K. Sekar,�A FAST Pattern Matching Algorithm�,http://www.ijcta.com/documents/volumes/vol2issue6/ijcta2011020624.pdf, J. Chem. Inf. Comput. Sci. 2004, 44, 1251-1256.
[9] Micheline Kamber and Jiawei Han,�Data Mining Concepts and Techniques�,Second Edtion,Morgan Kaufmann Publishers, ISBN 13: 978-1-55860-901-3 .
[10] Dorian Pyle,�Data preparation for Data Mining�, Morgan Kaufmann Publishers, Inc,1999.
[11] Pang-Ning Tan, Vipin Kumar, Michael Steenbach, �Introduction to Data Mining�, Pearson,2006.
[12] Jonathan M. Elchison, Dr. Shompe,� The Rabin Karp Algorithm:String Matching�, people.cedarville. edu
[13] Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method,csnotes.upm.edu.my
[14] Katey Cruz,�String Matching using Rabin Karp Algorithm�, cs.smith.edu /...af/CSC_252.PPT,2000.
[15]Pattern Matching, Algorithms in C, gauss.ececs.uc.edu
[16] Lecture Notes on Pattern Matching Algorithms, www.cosc.canterbury.ac.nz

S.H. Raju, M.N. Rao, "Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing," International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.100-106, 2016.