Volume-2 , Issue-5 , May - 2014 Go Back

World Wide Web is growing every day and people generally depend on search engine to explore the web. Searching on the web today can be compared to dragging a net across the surface of the ocean. Traditional search engine extracts data from the small portion of the web whereas the large portions of the web are hidden behind search forms, in searchable structured and unstructured database. Deep web contains the high quality content and large coverage area. A lot of research has been carried out in this area to make the hidden data float on the surface of web. In this paper, we discussed the problem faced by users in scraping the information from the deep web and also discussed the solution of these problems by using our new approach

Surface Web; Deep Web; Search Engine; Deep Web Search Engine; Crawler; Indexer; Human Powered Directory

[1] Bergman,Michael K., �White Paper: The Deep Web: Surfacing Hidden Value� Journal of Electronic Publishing Vol.7,Issue-1,2001.
[2] Ling Liu, James Caverlee, �Deep Web Data Extraction�
[3] Emilio Ferrrara, Giacomo F., Robert B., �Web Data Extraction, Applications and Techniques: A Survey� ACM Transaction on Computational Logic, Vol.5, June 2010, pp.1-20.
[4] Brin, Lawrence Page �The anatomy of large-scale hypertexual Web Search Engine�, Computer Networks and ISDN Systems, Vol.30, 1998, pp.107-111.
[5] Laender, Silva, Juliana S., � A Brief Survey of Web Data Extraction Tools�.
[6] Sriram R., Hector, �Crawling the Hidden Web� in the proceeding of the 27th VLDB Conference, Roma, Italy,2001.
[7] Babita, Anuradha, Ashish, �Hidden Web Data Extraction Tools� International Journal of Computer Applications, Vol.82,2013.
[8] Deep Web Website: //en.wikipedia.org/wiki/Deep_Web
[9] WikipediaWebsite: //en.wikipedia.org/wiki/Web_crawler
[10] Wikipedia Website: //en.wikipedia.org/wiki/Search_Engine
[11] Ntoulas, Zerfos, Junghoo Cho, �Downloading Hidden Web Content�
[12] Anuradha, A. K. Sharma, �Design of Hidden Web Search Engine� International Journal of Computer Application, Vol.30, 2011.
[13] Chez Hong-ping, Fang Wei, Yang Zhou, �Automatic Data Records Extraction from List Page in Deep Web Sources� Vol.6, 2009, pp.370-373.
[14] Chris Sherman, GARY Price, �Hidden web: Uncovering Information Sources Search Engines Can�t See� CyberAge Book, 2001.
[15] Manuel, Juan R., Fidel, Alberto Pan, �A Task specific Approach for Crawling the Deep Web� 2006.
[16] Califf, M. E., and Mooney, R. J., �Relational Learning of Pattern-Match Rules for Information Extraction� In Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence (Orlando, Florida, 1999), pp.328-334.
[17] Crescenzi, V., and Mecca, G., �Grammars Have Exceptions�, Information Systems 23, 8, (1998), pp.539-565.

S. NainB, H. Lall, "Deep Web Data Scraper: Search Engine," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.52-56, 2014.

Reconfigure multiple instruments in single hardware platform. In this project a low cost arbitrary waveform generator, Function generator, Digital Oscilloscope is proposed with low end microcontroller � ARM LPC2148 which would generate a waveform of any shape and type required for functionality defined by user. The embedded hardware regenerates the user defined waveform with appropriate magnitude and frequency. The hardware is implemented with SDRAM support to make it portable, so that the user can download the standard and Non-standard type of waveform into the target hardware and generate the output waveform in oscilloscope. A high-level software application runs on the PC and provides a user interface to the operator select a virtual instrument (e.g. digital oscilloscope, arbitrary waveform generator, function generator�) from a library of instruments and configures the RVI system to convert it into the selected instrument with its associated console.

Function generator, Digital storage oscilloscope, Arbitrary wave generator, Zigbee, ARM LPC 2148

E.Chuang, S. Hensley; K. Wheeler, �A Highly Capable Arbitrary Waveform Generator for Next Generation Radar Systems,� IEEE Aerospace Conference, Big Sky, Montana, USA, March 2006, digest.
[2] M.Chen yun yun, A.Yang Zhou, R.Xiao cloud, �Design of virtual function signal generator�, International conference on energy and environment technology, April 2009
[3] S.Marcin Iwanowicz, A. Zbigniew Pioro, M.Lidia Łukasiak, �Arbitrary waveform generator for charge pumping� journal of tele-communication and information technology� 2011
[4] D. Qiu, Q. Li, F. Zhou, �Design of Arbitrary Waveform generator Based on SDRAM,� International Conference on Electronic Measurements & Instruments, Beijing, China, August 2009, digest.
[5] Thomas Alpert, A.Marc werz ,F. �Arbitrary waveform generator based on FPGA and High speed DAC with real-time interface� International conference on control automation and system engineering, 2012.
[6] M. B. Yeary, R. J. Fink, D. Beck, D.W. Guidry, M. Burns, �A DSP Based Mixed-Signal Waveform Generator,� IEEE Transactions on Instrumentation and Measurement, June 2004, vol. 53, no.3, pp.665-671.
[7] A.Yong Zheng, R.Xiaohan Guan Yuquan,S.Wang Wenjia �Design of portable virtual instruments with USB interface� IEEE conference on virtual instruments, 2010.
[8] T. Zhen Alpert, F. Lang, M. Gr�zing and M. Berroth, �A 28 GS/s 6 bit CMOS DAC with Real-Time Interface,� European Solid-State Circuits Conference, Helsinki, Finland, September 2011, Fringe Poster Session

[9] D. Zhou Ferenci, M. Berroth, �A 100 Gigabit Measurement System with State of the Art FPGA Technology for Characterization of High Speed ADCs and DACs,� Prime, Berlin, Germany, July 2010, digest
[10] A.Zingh zen, R.Yong �FPGA-based reconfigurable measurement instruments with functionality defined by user� EURASIP Journal on Applied Signal Processing, 2006

Jeevitha L., Sangeetha S., Arun pandiyan S., "Design and Implementation of Reconfigurable Virtual Instruments with User Defined Functionality," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.57-60, 2014.

Due to exponential growth of Internet, Internet user privacy and data integrity is main concern for developers and service providers over Internet. Keeping this aim in mind Internet has adopted web encryption technique called OpenSSL, which gives a way to secure data and user privacy over Internet. Most of security sensitive application on Internet such as Internet banking, eCommerce, eGoverment has adopted this new technique which gives them a trustworthy way to connect them with their users. OpenSSL is only security mechanism having such reliability of work and has used from long time. But researchers have disclosed a serious vulnerability in this standard Web encryption software known as �Heartbleed�, the bug can give hackers access to personal data like credit card numbers, usernames, passwords, and, perhaps most importantly, cryptographic keys�which can allow hackers to impersonate or monitor a server. This research paper provides a detail working of Heartbleed bug and how this bug can affect your online privacy and data integrity.

OpenSSL; Heartbleed bug; Vulnearbility; Web Encryption; Encryption;heartbeat vulnearbillity;OpenSSL , Vulnearability

[1] John Viega, Matt Messier, Pravir Chandra, "Network Security with OpenSSL: Cryptography for Secure Communications" O`Really Medi Inc., First Edition, pp. 21-22, 2002.
[2] Behrouz A Forouzan, "Data Communication and Networking", The McGraw-Hills Companies, Fourth Edition, pp. 1008-1014
[3] "Growth of Internet ", http://www.socialmarketingforum.net/2012/09/the-Internet-explosive-growth-and-changes/, 2013
[4] "Heartbleed affected Sites", http://visual.ly/major-sites-affected-heartbleed, 2014
[5] "Definition", http://en.wikipedia.org/wiki/OpenSSL, 2014
[6] "Heartbleed intro", http://heartbleed.com/, 2014

S. Gujrathi, "Heartbleed Bug: AnOpenSSL Heartbeat Vulnerability," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.61-64, 2014.

With the large increase in the amount of information available online, rich web data can be obtained on the internet, such as over one trillion. Web mining techniques has emerged as an important research area to help web users find their information need. Web user express their information need as queries, and expect to obtain the needed information from the web data through web mining technique. Nowadays, providing an amount of relevant web pages based on users query words is a not a big problem in search engines. Instead, the problem is that a search engine returns too many web pages, and users have to spend much time on finding their desired information from this long search result list, named as Information Overloaded Problem. Finally, search result list is re-ranked by modifying the page rank algorithm using the weights assigned to sequential patterns resulting in reduction of users navigation time within the search result

Information; Web Mining; Web Pages; Search Engine; Patterns; Navigation Time; Page Rank Algorithm

[1] Uniform Resource Identifiers (URI): Generic Syntax. http://www.rfcditor.org /rfc/rfc2396.txt,1998.
[2] Web Characterization Terminology & Definitions Sheet.
http://www.w3.org/1999/05/WCA-terms/.W3C Working Draft 24-May-1999
[3] Jaideep Srivastava, Robert Cooley, Mukund Deshpande, Pang-Ning Tan,� Web Usage Mining: Discovery and applications of usage patterns from Web data�, ACM, SIGKDD, volume 1 issue 2 pp. 12-23, 2000.
[4] Robert Cooley, Bamshad Mobasher, Jaideep Srivastava, �Grouping Web page reference into transactions for mining World Wide Web browsing patterns�,1997.
[5] Robert Cooley, Bamshad Mobasher, Jaideep Srivastava, �Data preparation for mining World Wide Web browsing patterns�,1999.
[6] F. Massegila, P.Poncelet, M.Teisseire, �Using data mining techniques on Web access logs to dynamically improve Hypertext structure�,1999.
[7] L.Catledge and J. Pitkow, �Characterizing browsing behaviors on the world wide web�, Computer Networks and ISDN Systems, 27(6),1995.
[8] Alex G. Buchner and Maurice D. Mulvenna, �Discovering Internet marketing intelligence through online analytical Web Usage mining�, ACM SIGMOD Record, 27(4):54-61, December 1998.
[9] Common log file format. Retrieved June 02,2003 from http:/www.w3.org/Daemon/User/Config/Logging.html
[10] Extended log file format. Retrieved June 03,2003 from http:/www.w3.org/TR/WD-logfile.html
[11] CGI environment variables Retrieved May 15, 2003 from http://hoohoo.ncsa.uiuc.edu.cgi/env.html
[12] Peter, Pirolli, James Pitkow, and Ramana Rao, �Silk from a sow�s ear. Extracting usable structures from the web�, In CH1-96, Vancouver, 1996.
[13] G. Salton and M.J. McGill, �Introduction to Modern Information retrieval�,
McGraw-Hill. New York. 1983.
[14] E.Morphy, �Amazon Pushes �Personalized Store for Every Customer�, Ecommerce Times. September 28, 2001, http:/www.ecommerce.com/perl/story/13821.htm
[15] Amazon.com,www.amazon.com
[16] Google Inc. http://www.google.com/
[17] T. Springer, �Google LaunchesNewsService�, PC World, September 23, 2002, http://www.computerworld.com/developmenttopics/websitemgmt/story/0,10801,00.html.
[18] DoubleClick�s DART Technology,http://www/doulbleclick.com/dartinfo/.
[19] Amercia Online,www.aol.com
[20] eBay Inc., www.ebay.com
[21] E.Colet, �Using Data Mining to Detect Fraud in Auctions�, DSStar, 2002.
[22] Yahoo!, Inc.www.yahoo.com
[23] D. Gusfield, �Inexact matching, sequence alignment, and dynamic programming�, In Algorithm on Strings, Trees, and Sequences Computer Science and Computational Biology, Cambridge University Press, 1997.
[24] Dubes, R.C. and Jain, �Algorithms for Clustering Data�, Prentice-Hall, Englewood Cliffs, NJ, 1988.
[25] Kulyukin, V.A., Hammond, K.J. and Burke, R.D., �Answering questions for an organization online, �In Proceedings of AAAI 98.532-538, 1998.

V. Dhull, S. Khurana, "A Review of Optimisation of Search Engine using Sequential Pattern Mining Technique," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.65-71, 2014.

Reinforcement Learning (RL) is an active research area of machine learning research based on the mechanism of learning from rewards. RL has been applied successfully to variety of tasks and works well for relatively small problems, but as the complexity grows, standard RL methods become increasingly inefficient due to large state spaces. This paper surveys Hierarchical Reinforcement Learning (HRL) as one of the alternative approaches to cope with issues regarding complex problems and increasing the efficiency of reinforcement learning. HRL is the subfield of RL that deals with the discovery and/or exploitation of underlying structure of a complex problem and solving it using reinforcement learning by breaking it up into smaller sub-problems. This paper gives an introduction to HRL, discusses its basic concepts, different algorithms, approaches and related work regarding Hierarchical Reinforcement Learning. At last but not the least this paper briefly gives variation between flat RL and HRL following its pros and cons. It concludes with research scope of HRL in complex problems.

Machine Learning; Reinforcement Learning; Hierarchical Reinforcement Learning

[1] Richard Sutton and Andrew Barto (1998).Reinforcement Learning.MIT Press.ISBN 0-585-02445-6.
[2] Kaelbling, Leslie Pack, Michael L. Littman, and Andrew W. Moore. "Reinforcement learning: A survey." arXiv preprint cs/9605103 (1996).
[3] Richard Ernest Bellman (1961). Adaptive control processes: a guided tour. Princeton University Press.
[4] Rusell, Stuart, and Peter Norvig. "Artificial intelligent: A modern approach." (2003).
[5] Hengst, Bernhard. "Hierarchical approaches." Reinforcement Learning. Springer Berlin Heidelberg, 2012. 293-323.
[6] Polya G (1945) How to Solve It: A New Aspect of Mathematical Model. Princeton University Press
[7] Pfeiffer, M (2004). Reinforcement Learning of Strategies for Settlers of Catan. Proceedings of the International Conference on Computer Games: Artificial Intelligence, Design and Education, Reading, UK. November 2004
[8] A. Barto and S. Mahadevan. Recent advances in hierarchical reinforcement learning. Special Issue on Reinforcement Learning, Discrete Event Systems Jouranl, 13:41�77, 2003.
[9] Parr, R. and Russell, S. (1997). Reinforcement learning with hierarchies of machines. In Proceedings of Advances in Neural Information Processing Systems 10. MIT Press.
[10] Parr, R. (1998). Hierarchical Control and Learning for Markov Decision Processes. PhD thesis, University of California at Berkeley.
[11] Precup, D. and Sutton, R. S. (1997). Multi-time models for temporally abstract planning. In Proceedings of Advances in Neural Information Processing Systems 10. MIT Press.
[12] Precup, D., Sutton, R. S., and Singh, S. (1998). Theoretical results on reinforcement learning with temporally abstract behaviors. In Proceedings of the Tenth European Conference on Machine Learning, ECML�98. Springer-Verlag.
[13] Asadi, M and Huber, M (2004). State Space Reduction for Hierarchical Reinforcement Learning. In Proceedings of the 17th International FLAIRS Conference, pp. 509 - 514, Miami Beach, FL. 2004 AAAI
[14] Dietterich TG (2000) Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research 13:227- 303
[15] Boutilier C, Dearden R, Goldszmidt M (1995) Exploiting structure in policy construction. In: Proceedings of the 14th international joint conference onArtificial intelligence -Volume 2, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 1104-1111
[16] Ravindran, Balaraman. "SMDP homomorphisms: An algebraic approach to abstraction in semi markov decision processes." (2003).
[17] Chiu, Chung-Cheng, and Von-Wun Soo. "Subgoal identification for reinforcement learning and planning in multiagent problem solving." Multiagent System Technologies. Springer Berlin Heidelberg, 2007. 37-48.
[18] Forestier, J-P., and Pravin Varaiya. "Multilayer control of large Markov chains."Automatic Control, IEEE Transactions on 23.2 (1978): 298-305.
[19] Dean, Thomas, and Shieu-Hong Lin. "Decomposition techniques for planning in stochastic domains." IJCAI. Vol. 2. 1995.
[20] Sutton, Richard S., Doina Precup, and Satinder Singh. "Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning."Artificial intelligence 112.1 (1999): 181-211.
[21] Dietterich, Thomas G. "Hierarchical reinforcement learning with the MAXQ value function decomposition." arXiv preprint cs/9905014 (1999).
[22] Andre D, Russell SJ (2000) Programmable reinforcement learning agents. In: Leen TK, Dietterich TG, Tresp V (eds) NIPS, MIT Press, pp 1019-1025
[23] Andre D, Russell SJ (2002) State abstraction for programmable reinforcement learning agents. In: Dechter R, Kearns M, Sutton RS (eds) Proceedings of the Eighteenth National Conference on Artificial Intelligence, AAAI Press, pp 119-125
[24] Dietterich, Thomas G. "An overview of MAXQ hierarchical reinforcement learning." Abstraction, Reformulation, and Approximation. Springer Berlin Heidelberg, 2000. 26-44.
[25] Hengst, Bernhard. Discovering hierarchy in reinforcement learning. University of New South Wales, 2003.
[26] Hengst B (2008) Partial order hierarchical reinforcement learning. In: Australasian Conference on Artificial Intelligence, pp 138-149
[27] Jonsson A, Barto AG (2006) Causal graph based decomposition of factored mdps. In Journal of Machine Learning, vol 7, pp 2259-2301
[28] Bakker B, Schmidhuber J (2004) Hierarchical reinforcement learning based on subgoal discovery and subpolicy specialization. In: Proceedings of the 8-th Conference on Intelligent Autonomous Systems, IAS-8, pp 438-445
[29] Moerman W (2009) Hierarchical reinforcement learning: Assignment of behaviors to sub-policies by self-organization. PhD thesis, Cognitive Artificial Intelligence, Utrecht University
[30] Singh, S. P. (1992). Transfer of learning by composing solutions of elemental sequential tasks. Machine Learning, 8, 323-339.
[31] Kaelbling, L. P. (1993). Hierarchical reinforcement learning: Preliminary results. In Proceedings of the Tenth International Conference on Machine Learning, pp. 167{173 SanFrancisco, CA. Morgan Kaufmann.
[32] Moerman, Wilco, and Cognitive Artificial Intelligence. Hierarchical reinforcement learning: Assignment of behaviours to subpolicies by self-organization. Diss. PhD thesis, Cognitive Artificial Intelligence, Utrecht University, 2009.
[33] Moore, A. W., Baird, L. C., and Kaelbling, L. (1999). Multi-value-functions: Efficient automatic action hierarchies for multiple goal MDPs. In Dean, T., editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI99), volume 2, pages 1316�1321, San Francisco, CA. Morgan Kauffman Publishers, Inc.
[34] Dayan P, Hinton GE (1992) Feudal reinforcement learning. Advances in Neural Information Processing Systems 5 (NIPS)
[35] Jong NK, Stone P (2009) Compositional models for reinforcement learning. In: The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases
[36] Jonsson A, Barto AG (2006) Causal graph based decomposition of factored mdps. In Journal of Machine Learning, vol 7, pp 2259-2301
[37] Mugan J, Kuipers B (2009) Autonomously learning an action hierarchy using a learned qualitative state representation. In: Proceedings of the 21st international joint conference on Artificial intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 1175-1180
[38] Neumann G, Maass W, Peters J (2009) Learning complex motions by sequencing simpler motion templates. In: Proceedings of the 26th Annual International Conference on Machine Learning, ACM, New York, NY, USA, ICML `09, pp 753-760
[39] Konidaris G, Barto AG (2009) Skill discovery in continuous reinforcement learning domains using skill chaining. In: Bengio Y, Schuurmans D, Lafferty J, Williams CKI, Culotta A(eds) Advances in Neural Information Processing Systems 22, pp 1015-1023
[40] Osentoski S, Mahadevan S (2010) Basis function construction for hierarchical reinforcement learning. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, AAMAS `10, pp 747-754
[41] Mahadevan S (2010) Representation discovery in sequential descision making. In 24thConference on Artificial Intelligence (AAAI), Atlanta July 11-15 2010
[42] Fu, Yuchen, et al. "A Reward Optimization Method Based on Action Subrewards in Hierarchical Reinforcement Learning." The Scientific World Journal 2014 (2014).
[43] Dethlefs, Nina, and Heriberto Cuay�huitl. "Combining hierarchical reinforcement learning and Bayesian networks for natural language generation in situated dialogue." Proceedings of the 13th European Workshop on Natural Language Generation. Association for Computational Linguistics, 2011.
[44] Kober, Jens, Erhan Oztop, and Jan Peters. "Reinforcement learning to adjust robot movements to new situations." Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume Three. AAAI Press, 2011.
[45] Ryan, Malcolm, and Mark Reid. "Learning to fly: An application of hierarchical reinforcement learning." In Proceedings of the 17th International Conference on Machine Learning. 2000.
[46] Ghavamzadeh, Mohammad, and Sridhar Mahadevan. "Hierarchical average reward reinforcement learning." The Journal of Machine Learning Research 8 (2007): 2629-2669.
[47] Stone, Peter, Richard S. Sutton, and Gregory Kuhlmann. "Reinforcement learning for robocup soccer keepaway." Adaptive Behavior 13.3 (2005): 165-188.
[48] Shapiro, Daniel, Pat Langley, and Ross Shachter. "Using background knowledge to speed reinforcement learning in physical agents." Proceedings of the fifth international conference on Autonomous agents. ACM, 2001.

S. Mahajan, "Hierarchical Reinforcement Learning in Complex Learning Problems: A Survey," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.72-78, 2014.

Humans are extremely proficient at perceiving natural scenes and understanding their contents. Scene recognition in Human is the natural activity by which human can easily recognize the scene even if the scene is complex, partially occluded or blurred. In machine vision the recognition rate is less compared with human vision. To improve the recognition rate of the machine vision an efficient structural and textural based features are extracted from the image. H-Descriptor with Local Binary Pattern (LBP) [24] and H-Descriptor with Local Gradient Pattern (LGP) can effectively extract structural arrangement and textural arrangement of pixels in an image. LGP is invariant to local intensity variation so it is efficient for scene classification. LBP and LGP [23] is applied for each slices when the input image is separated into three different slices. Then Haar wavelet is applied for the input image and three different slices. The HOG is applied for each Haar wavelet transformed images to produce H-Descriptor with Local Binary Pattern and H-Descriptor with Local Gradient Pattern. Then by taking the H-Descriptor with Local Binary Pattern and H-Descriptor with Local Gradient Pattern as two independent feature channels, and combined them to arrive at a final decision using SphereSVM [22] for achieving an effective scene categorization.

H-Descriptor; Local Binary Pattern; Local Gradient Pattern; Haar wavelet; SphereSVM

[1] Freeman W.T and Roth M, "Orientation histograms for hand gesture recognition",Intl. Workshop on Automatic Face and Gesture- Recognition, IEEE Computer Society, Zurich, Switzerland, Page No(296-301), 1995.
[2] Szummer M and Picard R, "Indoor-outdoor image classification", In: IEEE Workshop on Content-based Access of Image and Video Databases, Bombay, India, Page No(42�51),1998.
[3] Schmid C, "Constructing models for content-based image retrieval", In: IEEE Conference on Computer Vision and Pattern Recognition, Kauai, HI, USA, Page No (39�45),2001.
[4] Oliva A and Torralba A," Modeling the shape of the scene: a holistic representation of the spatial envelope", IJCV 42(3),PageNo (145�175),2001.
[5] Porwik P and Lisowska A, "The haar wavelet transform in digital image processing: its status and achievement", Mach. Graph. Vis. 13, Page No (79�98),2004.
[6] Koch C, Li Fi and Van Rullen R, "Why does natural scene categorization require little nattention? Exploring attentional requirements for natural and synthetic stimuli", Visual Cognition, Page No (893�924), 2005.
[7] Lazebnik S, Ponce J and Schmid C, "Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories", In: IEEE Conference on Computer Vision and Pattern Recognition, New York, USA, Page No (2169�2178),2005.
[8] Dalal N and TriggsB,"Histograms of oriented gradients for human detection", In: IEEE Conference on Computer Vision and Pattern Recognition, San Diego, USA, Page No (886-893), 2005.
[9] Sun N, Zheng W, Sun C, Zou L, and Zhao C, "Gender Classification Based on Boosting Local Binary Pattern", Proc. Int�l Symp. Neural Networks, Page No (194-201), 2006.
[10] Oliva A and TorralbaA,"The role of context in object recognition", Trends in Cognitive Sciences, 11(12), Page No (520�527), 2007.
[11] Schiele B and Vogel J," Semantic model of natural scenes for content-based image retrieval", International Journal for Computer Vision, Page No (133�157), 2007.
[12] Zhang J, Marszalek M, Lazebnik S, "Local features and kernels for classification of texture and object categories:a comprehensive study", International Journal for Computer Vision, Page No (213�238),2007.
[13] Huang K.Q, Huang Y.Z and Tao D.C,"Enhanced biologically inspired model", In: IEEE Conference on Computer Vision and Pattern Recognition, Anchorage, Alaska, USA, Page No (1�8),2008.
[14] Bosch A, Munoz X and ZissermanA,"Scene classification using a hybrid generative/discriminative approach", IEEE Transaction on Pattern Analysis Machine Intelligence, Page No (712�727), 2008.
[15] X. Wang, T.X. Han, and S. Yan, "An HOG-LBP Human Detector with Partial Occlusion Handling", Proc. DAGM Symp. Pattern Recognition, Page No( 82-91),2008.
[16] H. Bay, A. Ess, T. Tuytelaars, and L. Gool, "Surf: Speeded Up Robust Features", Computer Vision and Image Understanding, vol. 110, no. 3, Page No (346-359),2008.
[17] Beck M,Caddigan E, Fei-Fei, Walther D," Natural scene categories revealed in distributed patterns of activity in the human brain", Journal of neuroscience, 29, Page No (73-81),2008.
[18] Hebert,Pantofaru C and Schmid C , " Object recognition by integrating multiple image segmentations", In: Proceedings of the European Conference on Computer Vision, Morseille, France, Page No (481�494),2009.
[19] Verma A, Banerji S and Liu C , "A new color SIFT descriptor and methods for image category classification", in: Proceedings of the International Congress on Computer Applications and Computational Science, Singapore, Page No (819�822),2010.
[20] Tanveer Syeda-Mahmood, David Beymer, and Fei Wang, "Shape-based Matching of ECG Recording", (IJCSE) International Journal on Computer Science and Engineering Vol.02, No.07,Page No (2502-2505),2010.
[21] Hu DeWen,Zhou Li and Zhou ZongTan ,"Scene recognition combining structural and textural features", In proceedings of the National University of Defense Technology, China, Science china, Page No (1-14),2012.
[22] BeataStrack, Qi Li,RobertStrack and Vojislav Kecman," Sphere Support Vector Machines for large classification tasks", Neurocomputing, Elsevier. Vol 101, Page No (59-67), 2013.
[23] BongjinJun, DaijinKim and Inho Choi , " Local Transform Features and Hybridization for Accurate Face and Human Detection", IEEE Transactions on Pattern Analysis And Machine Intelligence, Vol. 35, No. 6, Page No (1423-1436),2013.
[24] Atreyee Sinha, ChengjunLiu and SugataBanerji, "New image descriptors based on color, texture, shape, and wavelets for object and scene image classification", Neurocomputing, Elsevier. Vol 117, Page No (173-185), 2013.

B. Prasad, U.K. Devi , "Shape And Texture Based Scene Classification," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.79-87, 2014.

Along with the economical development, traffic has increased enormously these days. Due to the increasing urban population and hence the number of cars, need of controlling the traffic in streets, highways and roads is vital. In this paper, a system that detects the vehicle in real time in highway is done by using image processing. The implementation includes algorithms used for real time vehicle detection, which is based on background differencing and morphological operations. Another image processing technique used is the edge detection technique where the edges of the object is detected and other techniques for calculating traffic parameters such as counting the number of cars, speed of the cars by applying a threshold value .

Morphological Operations, Background Subtraction, Edge Detection, Thresholding

[1] E. Atkociunas1, R. Blake2, A. Juozapavicius1,M. Kazimianec1 �Image processing in road traffic analysis� Nonlinear Analysis: Modelling and Control, 2005, Vol. 10, No. 4, 315�332
[2] M. Fathy a, M.Y. Siyal b �An image detection technique based on morphological edge detection and background differencing for real-time traffic analysis�. Pattern Recognition Letters 16 (1995) 1321-1330
[3] Pejman Niksaz �Automatic traffic estimation using image Processing� International Journal of Signal Processing, Image Processing and Pattern Recognition Vol. 5, No. 4, December, 2012
[4] James G. Haran,1 John Dillenburg2 and Peter Nelson3�Real-time image processing algorithms for the detection of road and environmental conditions�
[5] Pratishtha Gupta 1, G.N Purohit 2, Adhyana Gupta 3 �Traffic Load Computation using Matlab Simulink Model Blockset� International Journal of Advanced Research in Computer and Communication Engineering Vol. 2, Issue 6, June 2013
[6] P.D. Kamble*, 2S.P. Untawale and 3S.B. Sahare �Application of image processing for traffic queue length� VSRD-MAP, Vol. 2 (5), 2012, 196-205
[7] Benjamin Coifmana, David Beymerb,1, Philip McLauchlanb,2,Jitendra Malikb,3 �A real-time computer vision system for vehicle tracking and traffic surveillance� Transportation Research Part C 6 (1998) 271-288
[8] Suresh Babu Changalasetty1, Ahmed Said Badawy1, Wade Ghribi1, Haytham Ibrahim Ashwi1, �Identification and classification of moving vehicles on road� Computer Engineering and Intelligent Systems, ISSN 2222-179(paper)Vol.4,No8,2013.

Prutha YM., Anuradha SG, "Morphological Image Processing Approach of Vehicle Detection for Real-Time Traffic Analysis," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.80-92, 2014.

Reliable user authentication is becoming an increasingly important task in the Web-enabled world. Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics also raises some issues in lack of privacy, template security, and revocability. The use of cryptographic primitives to bolster the biometric authentication system can solve the issues in biometric system.The combination of biometrics over cryptography may lead to a problem of lack of accuracy in biometric verification. In this paper, We propose a cryptographic protocol for biometrics authentication without revealing personal biometrical data against malicious verifier the protocol is termed as blind biometric authentication protocol, which addresses the concerns of user�s privacy, template protection, trust issue. The accuracy problem can be solved by designing a classifier. The protocol is blind in the sense that it reveals only the identity, and no additional information about the user or the biometric to the authenticating server or vice-versa. The proposed protocol is secure to different attacks.

Biometrics, Cryptosystems, Privacy, Public Key Cryptography, Security, Authentication

[1] A. K. Jain, A. Ross, and S. Prabhakar, �An introduction to biometric recognition,� IEEE Trans. Circuits Syst. Video Technol., vol. 14, no. 1, pp. 4�20, Jan. 2004.
[2] N. K. Ratha, J. H. Connell, and R. M. Bolle, �Enhancing security and privacy in biometrics-based authentication systems,� IBM Syst. J., vol. 40, no. 3, pp. 614�634, Mar. 2001.
[3] R. Rivest, A. Shamir, and L. Adleman, �A method for obtaining digital signatures and public-key cryptosystems,� Commun. ACM, vol. 21, no. 2, pp. 120�126, 1978.
[4] C. Fontaine and F. Galand, �A survey of homomorphic encryption for nonspecialists,� EURASIP, vol. 1, pp. 1�15, 2007.
[5] C. Gentry, �Fully homomorphic encryption using ideal lattices,� STOC, pp. 169�178, 2009.
[6] F. Farooq, R. M. Bolle, T.-Y. Jea, and N. Ratha, �Anonymous and revocable fingerprint recognition,� in CVPR Biometrics Worshop, Jun. 2007, pp. 1�7.
[7] A. Teoh, D. Ngo, and A. Goh, �Biohashing: Two factor authentication featuring fingerprint data and tokenised random number,� Pattern Recognit., vol. 37, no. 11, pp. 2245�2255, Nov. 2004.
[8] A. K. Jain, K. Nandakumar, and A. Nagar, �Biometric template security,� EURASIP, vol. 8, no. 2, pp. 1�17, 2008.
[9] M. Upmanyu, A. M. Namboodiri, K. Srinathan, and C. V. Jawahar, �Efficient biometric verification in the encrypted domain,� in 3rd Int. Conf. Biometrics, Jun. 2009, pp. 906�915.
[10] Yogesh Badhe, Hafij Balbatti, Neelkanth Kaladagi , Kranti Kumar, �IRIS Recognition and Authentication System for Enhancing Data Security� , International Journal of Computer Sciences and Engineering, Volume-02, Issue-03, Page No (1-5), March 2014.

A.S. Naik , S.M. Metagar, P.D. Hasalkar , "A Survey on Secure Crypto-Biometric System using Blind Authentication Technique," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.93-97, 2014.

Brushless DC (BLDC) motor drives are popularly used in both consumer and industrial applications owing to its compact size, controllability and efficiency. BLDC motor is usually operated with one or more rotor position sensors, since the electrical excitation must be synchronous to the rotor position. To reduce cost and complexity and also to improve reliability of the drive system, sensorless drive is preferred. This paper presents the development of sensorless control system for brushless DC motor using terminal voltage sensing method without using any position sensors such as hall sensors or encoders. The simulation for proposed system is done using MATLAB.

Brushless DC sensorless control, Terminal Voltage Sensing, Low Pass Filter and Comparator

[1] J.Fang, X. Zhou, and G. Liu, �Instantaneous torque control of small inductance brushless DC motor,� IEEE Trans. Power Electron., vol.27, no.12, pp.4952-4964, Dec. 2012.
[2] J.Fang, X. Zhou, and G. Liu, �Precise accelerated torque control for small inductance brushless DC motor,� IEEE Trans. Power Electron., vol.28, no.3, pp.1400-1412, Mar. 2013.
[3] G. J. Su and J. W. McKeever, �Low-cost sensorless control of brushless DC motors with improved speed range,� IEEE Trans. Power Electron., vol.19, no.2, pp.296-302, Mar. 2004.
[4] K.Y. Cheng and Y. Y. Tzou, �Design of a sensorless commutation IC for BLDC motors,� IEEE Trans. Power Electron., vol.18, no.6, pp.1365-1375, Nov. 2003.
[5] Y. Wu, Z. Deng, X. Wang, X. Ling, and X. Cao, �Position sensorless control based on coordinate transformation for brushless DC motor drives,� IEEE Trans. Power Electron., vol.25, no.9, pp.2365-2371, Sept.2010.
[6] Z. Wang, K. Lu, and F.Blaabjerg, (2012) `A simple startup strategy based on current regulation for back-EMF-based sensorless control of PMSM`, IEEE Trans. Power Electron., Vol.27,. No.8, pp. 3817-3825.
[7] D. H. Jung and I. J. Ha, �Low-cost sensorless control of brushless DC motors using a frequency-independent phase shifter,� IEEE Trans. Power Electron., vol.15, no.4, pp.744-752, July, 2000.
[8] Shen and S. Iwasaki,(2006) `Sensorless control of ultra high-speed PM brushless motor using PLL and third harmonic back-EMF`, IEEE Trans. Ind. Electron.,Vol.53, No.2, pp.421-427.
[9] J.X. Shen, and Z. Q. Zhu and D. Howe, (2004) `Sensorless flux weakening control of permanent-magnet brushless machines using third-harmonic back-EMF`, IEEE Trans .Ind. Appl.,Vol.40, No.6, pp.1629-1636.
[10] Jos� Carlos Gamazo-Real, Ernesto V�zquez-S�nchez, and Jaime G�mez-Gil, �Position and Speed Control of Brushless DC Motors Using Sensorless Techniques and Application Trends�, 2010.
[11] Yoko Amano, Toshio Tsuji, Atsushi Takahashi, Shigeo Ouchi, Kyoji Hamatsu, and Masahiko Iijima �A Sensorless Drive System for Brushless DC Motors Using a Digital Phase-Locked Loop�, Electrical Engineering in Japan, Vol. 142, No. 1, 2003.
[12] Y. S. Lai and Y. K. Lin, �Novel back-EMF detection technique of brushless DC motor drives for wide range control without using current and position sensors,� IEEE Trans. Power Electron., vol.23, no.2, pp.934-940, Mar. 2008.
[13] N. Matsui, �Sensorless PM brushless dc motor drives, � IEEE Trans. Ind. Electron., vol.43, no.2, pp. 300-308, Apr. 1996.
[14] S. Ogasawara and H. Akagi, �An approach to position sensorless drive for brushless DC motors,� IEEE Trans. Ind. Appl., vol.27, no.5, pp.928-933, Sep./Oct. 1991.
[15] L. Zhang, W. Xiao, and W. Qu, �Sensorless control of BLDC motors using an improved low-cost back-EMF detection method,� in Proc. IEEE-PESC, 2006, pp.1-7.

E. Sumathi, M.S. Sheela and B. Arunkumar, "Advanced Sensorless Control of Brushless DC Motor using Terminal Voltage Sensing Method," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.98-102, 2014.

Wireless Sensor Networks (WSNs) are vulnerable to attacks such as Denial of Service (DoS) and compromised-node. This is due to the nature of the existing multi-path routing mechanisms which are deterministic in nature. Adversaries can steal information by compromising routing algorithm in WSN. In this paper we propose routing mechanisms where randomized multi-path routes are dynamically computed. Such routes can bypass the black holes made though DoS and compromised node attacks .The generated routes are energy efficient besides dispersive in nature. Simulation results reveal that the proposed mechanisms are energy efficient in bypassing black holes.

Wireless Sensor Network (WSN), Denial Of Service (DOS) Attack, Multi-Path Routing

[1] A. D. Wood and J. A. Stankovic. Denial of service in sensor networks. IEEE Computer Magazine, 35(10):54�62, Oct. 2002.
[2] W. Lou, W. Liu, and Y. Fang. Spread: enhancing data confidentiality in mobile ad hoc networks. In Proceedings of the IEEE INFOCOM Conference, volume 4, pages 2404�2413, Mar. 2004.
[3] W. Lou and Y. Kwon. H-spread: a hybrid multipath scheme for secure and reliable data collection in wireless sensor networks. IEEE Transactions on Vehicular Technology, 55(4):1320�1330, July 2006.
[4] P. C. Lee, V. Misra, and D. Rubenstein. Distributed algorithms for secure multipath routing in attack-resistant networks. IEEE/ACM Transactions on Networking, 15(6):1490�1501, Dec. 2007.
[5] Z. Ye, V. Krishnamurthy, and S. K. Tripathi. A framework for reliable routing in mobile ad hoc networks. In Proceedings of the IEEE INFOCOM Conference, volume 1, pages 270�280, Mar. 2003.
[6] B. Vaidya, J. Y. Pyun, J. A. Park, and S. J. Han. Secure multipath routing scheme for mobile ad hoc network. In Proceedings of IEEE International
Symposium on Dependable, Autonomic and Secure Computing, pages 163�171, 2007.
[7] M. Burmester and T. V. Le. Secure multipath communication in mobile ad hoc networks. In Proceedings of the International Conference on Information Technology: Coding and Computing, pages 405�409, 2004.
[8] R. Mavropodi, P. Kotzanikolaou, and C. Douligeris. Secmr- a secure multipath routing protocol for ad hoc networks. Elsevier Journal of Ad Hoc Networks, 5(1):87�99, Jan. 2007.
[9] P. Papadimitratos and Z. J. Haas. Secure routing for mobile ad hoc networks. In Proceedings of SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS), 2002.
[10] X. Y. Li, K. Moaveninejad, and O. Frieder. Regional gossip routing wireless ad hoc networks. ACM Journal of Mobile Networks and Applications, 10(1-2):61�77, Feb. 2005.
[11] C. L. Barrett, S. J. Eidenbenz, L. Kroc, M. Marathe, and J. P. Smith. Parametric probabilistic sensor network routing. In Proceedings of the ACM International Conference on Wireless Sensor Networks and Applications (WSNA), pages 122�131, 2003.
[12] Tao Shu, Sisi Liu, and Marwan Krunz. Secure Data Collection in Wireless Sensor NetworksUsing Randomized Dispersive Routes. IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2009 proceedings.

M.T. Basu, G. Venkatesh, K. Immidisri , "Efficient Data Collection Using Randomized Multipath Routes in WSN," International Journal of Computer Sciences and Engineering, Vol.2, Issue.5, pp.203-206, 2014.