Volume-2 , Issue-7 , Jul - 2014 Go Back

In this paper the method of Face Recognition is presented. Now a day the need of security is increasing. Many methods are using for maintaining the security like as credit cards, pin numbers, smart cards etc. But some times it fails. This paper presents a Face Recognition method using Principal Component Analysis. This method applies on both data base image and input image. By the use of PCA the system finds the Eigen values, Eigen vector and Euclidian distance. After comparing from database it declares the matches.

Recognition, PCA, Euclidian distance, Eigen Values, Eigen Vectors.

[1] I. Sajid, M. M. Ahmed, Kresimir Delac, Mislav Grgic, Sonja Grgic,� Independent Comparative Study of PCA, ICA, and LDAon the I. Taj, M. Humayun, and F.Hameed,�Design of high performance fpga based face recognition system,� in PIERS Proceedings, Cambridge, USA, July 2-6, 2008, pp.504-510
[2] H. T. Ngo, R. Gottumukkal, and V. K. Asari, �A flexible and efficient hardware architecture for real-time face recognition based on eigenface,� in IEEE Computer Society Annual Symposium on VLSI, 2005.
[3] Sathaporn Visakhasart, Orachat Chitsobhuk, �Multi-Pipeline architecture for face recognition on FPGA,�International Conference on digital Image Processing,2009, pp.152-156
[4] Janarbek Matai, Ali Irturk and Ryan Kastner,� Design and Implementation of an FPGA-based Real-Time Face Recognition System�, in IEEE International Symposium on Field-Programmable Custom Computing Machines, 2011, pp 97-100.
[5] Qiu Chen, Koji Kotani, Feifei Lee and Tadahiro Ohmi,� Face Recognition Using Self-Organizing Maps� www.intechopen.com.
[6] Rala M. Ebied,� Feature Extraction using PCA and Kernel-PCA for Face Recognition�, in The 8th International Conference on INFOrmatics and Systems Computational Intelligence and Multimedia Computing Track , 2012 ,pp mm72-mm77
[7] Mohammed Alwakeel , Zyad Shaaban ,�Face Recognition Based on Haar Wavelet Transform and Principal Component Analysis via Levenberg-Marquardt Backpropagation Neural Network� in European Journal of Scientific Research,2010 pp. 25-31
[8] Kyungnam Kim, �Face Recognition using Principal Component Analysis�, www.google.com
[9] Lindsay I Smith, �A tutorial on Principal Components Analysis� February 26, 2002
[10] Abhishek Bansal, Kapil Mehta, Sahil Arora, �FACE RECOGNITION USING PCA & LDA ALGORITHMS�,in Second International Conference on Advanced Computing & Communication Technologies, 2012,pp.251-256
[11] FERET Data Set� in Wiley Periodicals, 2006.
[12] Neelam Mahale, Dr. M. S. Nagmode,�Improve ATM Security by Face Recognition� in Technovision-14, Ist International Conference on E&TC, Electrical and Computer Engineering in Sinhgad Institute of Technology & Science SITS, 5-6 April, 2014

[13] Janarbek Matai, Ali Irturk and Ryan Kastner,� Design and Implementation of an FPGA-based Real-Time Face Recognition System�, in IEEE International Symposium on Field-Programmable Custom Computing Machines, pp. 97-100, 2011.
[14] Smt.M.P.Satone, Dr. G.K.Kharate,�Face Recognition Based on PCA on Wavelet Subband�,in IEEE Students` Conference on Electrical, Electronics and Computer Science, 2012

N. Mahale, M.S. Nagmode, P.S. Ghatol, "Face Recognition Using Principal Component Analysis Method," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.57-61, 2014.

The multiprocessor scheduling can be defined as scheduling a task graph in a way such that performance criteria is optimized . Optimization is a mechanism of finding minimum and maximum values from a given set of values. This is done by taking some particular parameters and calculating results according to it. In this paper we describe various optimization technique such as heuristic scheduling, Local search algorithm and Global search algorithm. These algorithm are characterized further as simulated annealing , Tabu search and genetic algorithm comes under local search algorithm , and branch and algorithm comes under global search algorithm . All these optimization techniques plays important role in reducing scheduling length efficiently in order to increase the efficiency of multiprocessor system.

Optimization Techniques, Simulated Annealing, Tabu Search, Genetic Algorithm, Branch And Bound Algorithm

[1] G. Syswerda and J. Palmucci, �The application of genetic algorithms to resource scheduling�, Proceedings of the Fourth International Conference on Genetic Algorithms and Their Applications, pages 502-508, San Mateo, CA, July 1991.
[2] G. A. Cleveland and S. F. Smith, �Using genetic algorithms to schedule flow shop releases�, Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, pages 160-169, San Mateo, CA, June 1989.
[3] J. H. Holland, �Adaptation in Natural and Artificial Systems�, The University of Michigan Press, Ann Arbor, MI, 1975.
[4] Cottet, F., Delacroix, J, Kaiser, C., Mammeri, Z., �Scheduling in Real-time Systems�, John Wiley & Sons Ltd, England, 2002.
[5] Goldberg, David E, �Genetic Algorithms in Search, Optimization and Machine Learning�, Kluwer Academic Publishers, Boston, 1989.
[6] Mitchell, Melanie, �An Introduction to Genetic Algorithms�, MIT Press, Cambridge, MA. 1996.
[7] L.M.Schmitt, �Fundamental Study Theory of Genetic Algorithms�, International Journal of Modelling and Simulation Theoretical Computer Science. 2001.
[8] C. V. Ramamoorthy, "Optimal scheduling strategies in a multiprocessor system", IEEE Trans. Computers, vol. C-2I.,Feb. 1972.
[9] I. H. Kasahara and S. Narita, "Practical multiprocessing scheduling algorithms for efficient parallel processing", IEEE Transactions on Computers, 1998.
[10] E. S. H. Hou, R. Hong, and N. Ansari, �Efficient multiprocessor scheduling based on genetic algorithms�, IEEE 1990.
[11] Muhhamad K. Dhodhi, Imtiaz Ahmad, Ishfaq ahmad, �A multiprocessor scheduling scheme using Problem-space genetic algorithms�, IEEE 1995.
[12] Michael Bohler, Frank Moore, Yi Pan, �Multiprocessor Scheduling Using Genetic Algorithms�, Twelfth International FLAIRS Conference, 1999.
[13] Yi-Wen Zhongiz, Jian-Gang Yang, �A Genetic algorithm for tasks scheduling in parallel multiprocessor systems�, Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi`an, 2-5 November 2003
[14] Michael Rinehart, Vida Kianzad, and Shuvra S. Bhattacharyya, �A Modular Genetic Algorithm for Scheduling Task Graphs�, 2003.
[15] Andrew J. Page and Thomas J. Naughton, �Framework for task scheduling in heterogeneous distributed computing using genetic algorithms�, pp. 1-14, 2005.
[16] Andrew J. Page and Thomas J. Naughton, �Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing�, 2005.
[17] Faezeh Montazeri, Mehdi Salmani-Jelodar, S. Najmeh Fakhraie and S. Mehdi Fakhraie, �Evolutionary Multiprocessor Task Scheduling�, Proceedings of the International Symposium on Parallel Computing in Electrical Engineering (PARELEC`06), IEEE 2006.
[18] M. Salmani Jelodar, S. N. Fakhraie, F. Montazeri, S. M. Fakhraie, M. Nili Ahmadabadi, �A Representation for Genetic-Algorithm-Based Multiprocessor Task Scheduling�, Congress on Evolutionary Computation, Vancouver, BC, Canada, IEEE July 16-21, 2006.
[19] M. Nikravan and M. H. Kashani, �A Genetic algorithm for process scheduling in distributed operating system considering load balancing �, Proceedings 21st European Conference on Modelling and Simulation, 2007.
[20] Keshav Dahal, Alamgir Hossain, Benzy Varghese, �Scheduling in Multiprocessor System Using Genetic Algorithms�, 7th Computer Information Systems and Industrial Management Applications, IEEE 2008.
[21] Amir Masoud Rahamani, Mohamad Ali Vahedi �A novel Task Scheduling in Multiprocessor Systems with Genetic Algorithm by using Elitism stepping method�, 2008.
[22] Yajun Li, Yuhang Yang, Maode Ma, Rongbo Zhu, �A Problem-Specific Genetic Algorithm for Multiprocessor Real-time Task Scheduling�, The 3rd Intetnational Conference on Innovative Computing Information and Control (ICICIC`08), IEEE 2008.
[23] Peyman Almasi Nejad, Ahmad Farahi, Davood Karim Zadegan Moghadam, Reza Asgary Moghadam, �An Intelligent Method for Multi Processor Scheduling using Genetic Algorithms�, International Conference on MultiMedia and Information Technology, IEEE 2008.
[24] Ali Pedram, �A method for scheduling multi processing systems with genetic algorithm�, International Journal of Engineering and Technology Vol. 1, No. 2, June, 2009.
[25] Intisar A.Majied Al-Said, Nedhal Al-Saiyd, Firas Turki Attia, �Multiprocessor scheduling based on genetic algorithms�, 2009.
[26] Sachi Gupta, Gaurav Agarwal, �Task Scheduling in Multiprocessor System Using Genetic Algorithm�, Second International Conference on Machine Learning and Computing, IEEE 2010.
[27] Adel Manaa and Chengbin Chu, �Scheduling multiprocessor tasks to minimize the makespan on two dedicated processors�, European Journal of Industrial Engineering, pp. 265 � 279, Volume 4, Number 3 / 2010.
[28] Amir Masoud Rahmani and Mojtaba Rezvani, �A Novel Genetic Algorithm for Static Task Scheduling in Distributed Systems�, 2009.
[29] Carnegie-Mellon, �Genetic Algorithms and Their Applications�, Proc. of the First Int. Conference, July 24-26, 1985.
[30] Dr. Franz Rathlauf, �Representations for Genetic and Evolutionary Algorithms�, 2nd edition, @ Springer. 2006.
[31] S. Beaty, �Genetic algorithms and instruction scheduling�, Proceedings of the 24th Microprogramming Workshop (MICRO-24), Albuquerque, NM, November 1991.
[32] John J. Grefenstette, �Genetic Algorithms and Their Applications�, Proc. 2nd Int. Conf, July 28-31, 1987, MIT, Cambridge,1987.
[33] Davis, �Handbook of Genetic Algorithms�, Van Nostrand Reinhold, 1991.
[34] E. Hou, R. Hong, and N. Ansari, "Multiprocessor scheduling based on genetic algorithms", Dept of ECE, New Jersey Institute of Technology, Technical Report, Aug. 1990.
[35] Michalewicz, �Genetic Algorithms + Data Structures = Evolution Programs�, Springer, 1996.
[36] Goldberg D., �Genetic Algorithms in Search, Optimization, and Machine Learning�, Addison-Wessley publishing company Inc., 1989.
[37] Allen, F. & Karjalainen, �Using Genetic Algorithms to Find Technical Trading Rules�, Journal of Financial Economics, 1999.
[38] Forrest, Stephanie. "Genetic algorithms: principles of natural selection applied to computation", Science, vol.261, 1993.
[39] Kirkpatrick, S., C.D. Gelatt and M.P. Vecchi, "Optimization by simulated annealing", Science, vol.220, p.671-678, 1983.
[40] Tang, K.S., K.F. Man, S. Kwong and Q. He. "Genetic algorithms and their applications", IEEE Signal Processing Magazine, vol.13, 2004.
[41] Michael Bohler, Frank Moore, Yi Pan. �Improved Multiprocessor Task Scheduling Using Genetic Algorithms�, Twelfth International FLAIRS Conference, 1999.
[42] S.N.Sivanandam, S.N.Deepa, �Introduction to Genetic Algorithms�, Springer-Verlag Berlin Heidelberg, 2008.
[43] Forrest, Stephanie. "Genetic algorithms: principles of natural selection applied to computation" Science, vol.261. 1993.
[44] G. Syswerda, �Uniform crossover in genetic algorithms�, Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, pages 2-9, San Mateo, CA, June 1989.
[45] G. G. Robertson, �Population size in classifier systems�, Proceedings of the Fifth International Workshop on Machine Learning, pages 142-152, San Mateo, CA, June 1988.
[46] M. F. Bramlette, �Initialization, mutation and selection methods in genetic algorithms for function optimization�, Proceedings of the Fourth International Conference on Genetic Algorithms and Their Applications, pages 100-107, San Mateo, CA, July 1991.
[47] Whitley, D., �A genetic algorithm tutorial�, Statistics and Computing�, 1994.
[48] Vose, Michael D, �The Simple Genetic Algorithm: Foundations and Theory�, MIT Press, Cambridge, MA, 1999.
[49] J. J. Grefenstette and J. E. Baker, �How genetic algorithms work: A critical look at implicit parallelism�, Proceedings of the Third International Conference on Genetic Algorithms and Their Applications, pages 20-27, San Mateo, CA, June 1989.
[50] K. A. De Jong, �An Analysis of the Behavior of a Class of Genetic Adaptive Systems�, Ph.D. dissertation, University of Michigan, 1975.

A. Rani, S.K. Boora, "Optimization Techniques for Task Scheduling in Multiprocessor System - A Review," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.62-65, 2014.

Leakage power has become a serious concern in nanometer CMOS technologies, and power-gating has shown to offer a viable solution to the problem with a small penalty in performance. This paper focuses on leakage power reduction through automatic insertion of sleep transistors for power-gating. In particular, we propose a novel, layout-aware methodology that facilitates sleep transistor insertion and virtual-ground routing on row-based layouts. We also introduce a clustering algorithm that is able to handle simultaneously timing and area constraints, and we extend it to the case of multi- sleep transistors to increase leakage savings. The results we have obtained on a set of benchmark circuits show that the leakage savings we can achieve are, by far, superior to those obtained using existing power-gating solutions and with much tighter timing and area constraints Leakage power is a major concern in sub-90-nm CMOS technology. The exponential increase in the leakage component of the total chip power can be attributed to threshold voltage scaling, which is essential to maintain high performance in active mode, since supply voltages are scaled. Numerous design techniques have been proposed to reduce standby leakage in digital circuits. Out of this rich set of solutions, power gating has proven to be a very effective approach to minimize standby leakage while keeping high speed in the active mode. It is based on the principle of adding devices, called sleep transistors in series to the pull-up and/or the pull-down of the logic gates, and turning them off when the circuit is idle, thereby decreasing the leakage component due to IDS sub-threshold currents. When an nMOS sleep transistor is used on the pull-down path, a SLEEP signal controls its active/standby mode.

PNS, LCC, FGTI Techniques

[1] Y. Wang, H. Lin, H.Z. Yang, R. Luo, H. Wang,"Simultaneous Finegrain Sleep Transistor Placement and Sizing for Leakage Optimization," in Proc. of ISQED�06, 2006, pp. 723-728.
[2] G. Moore, �No exponential is forever: But forever can be delayed,� in IEEE ISSCC Dig. Tech. Papers, 2003,

pp. 20 - 23.
[3] D. Duarte, N. Vijaykrishnan, M. J. Irwin, and

M.Kandemir,�Formulation and validation of an energy dissipation model for the clock generation circuitry and distribution networks,� in Proc. Of VLSI Design, 2001,

pp. 248 - 253.
[4] J. Kao, S. Narendra, A. Chandrakasan, �Sub threshold Leakage modeling and reduction techniques�, in Proc. of ICCAD, 2002, pp 141 � 149.
[5] K. Roy, S. Mukhopadhay, H. Mahmoodi-Meimand, �Leakage Current Mechanisms and Leakage Reduction Techniques in Deep-Submicrometer CMOS Circuits�, in

Proc. of the IEEE, Vol. 91, No.2, Februray 2003 pp 305

� 327.
[6] S.Narendra et.al, �Forward body bias for microprocessors in 130-nm technology generation and beyond�, in IEEE JSSC, Vol. 38 , No. 5 ,May 2003 pp. 696 - 701.
[7] C.H. Kim, K. Roy, �Dynamic VTH scaling scheme for active leakage power reduction�, in Proc. of DATE

2002 pp.163 - 167.
[8] S. Mukhopadhyay et. al., �Gate Leakage Reduction for Scaled Devices Using Transistor Stacking�, in IEEE TVLSI, Vol. 11, No. 4,

P. Chaithanya and P.P. Muralikrishna, "Standby and Active Leakage current control and Insertion Power Network Synthesis," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.60-70, 2014.

Mobile social networks (MSNs) refer to the social networking for making new connections. In the MSNs personal preferences is an imperative service, where user can find matching users within the range. In the existing systems all services, generally all users can create specific profile and publish it into social networks to interconnect with the new people. It may contain some sensitive information also these types of sensitive users may not publish their profile into social networks as a public. A propinquity mobile social network refers to virtual interaction with the data (BLUETOOTH/WI-FI) interfaces on their smart phones. These social networks are more popular due to the recently growth of smart phone users. To reveal sensitive user�s profile is most vulnerable in these devices. In these services conflicts with the user�s privacy concerns about reveal their personal profiles to complete strangers before deciding to interact with them. In this paper takes this open challenge to overcome with the novel strategy. In this paper prior security work is focused on privacy to users� profiles with using high efficient symmetric cryptographic primitives.

Privacy, Mobile Social Networking, Profile Matching, Vulnerable, Ad-Hoc Networks

[1]. Z. Yang, B. Zhang, J.Dai, A.Champion, D.Xuan, and D. Li, �E-smart Talker: A distributed mobile system for social networking in physical proximity,� in ICDCS�10, Genoa, Italy, June 2010, pp. 468-477.
[2]. T. Nishide and K. Ohta, �Multyparty Computation for interval, equality, and comparisons without bit-decomposition protocol,� in PKC�07,2007, pp. 343-360.
[3]. Y. Qi and M. J. Atallah, �Efficient privacy-preserving K-nearest neighbor search,� in IEEE ICDCS�08,2008, pp. 311-319.
[4]. M. Li, S. Yu, J.D. Guttman, W. Lou, and K. Ren, �Secure Adhoc trust initialization and key management in wireless body area networks,� ACM Transactions on sensor Networks(TOSN), 2012.
[5]. Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan, D. Li, �E-smarttaliker: A distributed mobile system for social networking in physical proximity,� in IEEE ICDCS�10, June, 2010.
[6]. G. Asharov and Y. Lindell, � A full proof of the bgw protocol for perfectly-secure multiparty computation,� Advances in CryptologyCRYPTO 2011,2011.
[7]. M. Ben-Or, S.Goldwasser, and A.Wigderson,�Completeness theorems for non-cryptographic fault-tolerant distributed computation.�
[8]. R. Gennaro, M.O.Rabin, and T. Rabin, �simplified vss and fast-track multiparty computations with applications to threshold cryptography,� in ACM PODC �98, 1998, pp. 101-111.
[9]. Josef Pieprzyk , Hossein Ghodosi and Ron Steinfeld, �multi-Party Computation with Conversion of secret Sharing,� NTU, Singapore, September 2011.
[10]. R. W. Baldwin and W. C. Gramlich, �Cryptographic protocol for trustable match making,� in IEEE S&P�85, Oakland, CA,April 1985.
[11]. G. Ateniese, M. Blanton, and J. Kirsch, �Secret handshakes with dynamic and fuzzy matching,� in NDSS�07, San Diego, CA, FEB. 2007.
[12]. Srihari babu. Kolla and B B K Prasad, �A Survey of Source Routing Protocols, Vulnerabilities and Security in wireless Adhoc networks� IJCSE vol 2 no.4 pp. 20-25. April 2014.

A. Shaik, L.N.B. Jyotsna, "Efficient and Persistent Profile Matching in the Propinquity Mobile Social Networks," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.71-74, 2014.

OCR is optical character recognition. It is the prominent area of research in the world. It is translation of scanned images of handwritten, typewritten or printed document into machine encoded form. This machine encoded form is editable text and compact in size. OCR is a common method of digitizing printed texts so that they can be electronically searched, stored more compactly, displayed on-line, and used in machine processes such as machine, text-to-speech and text mining. Many OCR�s have been designed which correctly identify fine printed documents both in Indian and foreign scripts. But little reported work has been found on the recognition of degraded Gurmukhi script. The performance of standard machine printed OCR system working for fine printed documents decreases, if it is tested on degraded documents [8]. The degradation in any document can be of many types. A major issue that leads in degraded printed numerals is heavily printed character, broken character, and background noise problem and shape variance character [10]. Although humans can read these documents easily, it is far complicated for computers to recognize them. So, our main focus will be to make the system recognize degraded printed Gurmukhi numerals.

Optical character recognition, Degraded Gurumukhi Numerals, Printed Documents

[1] A. Antonacopoulos and C. Casado Castilla �Flexible Text Recovery from Degraded Typewritten Historical Documents�, Proceedings of the 18th International Conference on Pattern Recognition, Hong Kong, pp. 1062-1065, 2006.
[2] C. J. C. Burges, �A tutorial on support vector machines for pattern recognition�, Knowledge Discovery and Data Mining, Vol. 2 No. 2, pp. 121-167, 1998.
[3] C.W. Hsu, C.C. Chang, and C.J. Lin, �A Practical Guide to Support Vector Classification�, [Online]. Available: http://www.csie.ntu.edu.tw/~cjlin/papers/guide/guide.pdf.
[4] D.Sharma and U.Jain �Recognition of Isolated Handwritten Characters of Gurumukhi Script using Neocognitron�, International Journal of Computer Applications, Vol. 10 No.8, pp. 10-16, 2010.
[5] G. S.Lehal, and C.Singh, �Feature Extraction and Classification for OCR of Gurmukhi Script�, Vivek, Vol. 12, N�o.2, pp. 2-12, 1999.
[6] K.S. Siddharth, R.Dhir and R.Rani, �Handwritten Gurumukhi Character Recognition Using Zoning Density and Background Directional Distribution Features�, International Journal of Computer Science and Information Technologies, Vol. 2, pp. 1036-1041, 2011.
[7] K. S. Siddharth, M. Jangid, R. Dhir and R. Rani, �Handwritten Gurmukhi Character Recognition Using Statistical and Background Directional Distribution Features�, International Journal on Computer Science and Engineering (IJCSE), Vol. 3 No. 6, pp. 2332-2345, 2011.
[8] M. K. Jindal, R. K. Sharma and G. S. Lehal, �A Study of Different Kinds of Degradation in Printed Gurmukhi Script�, Proceedings of the IEEE International Conference on Computing: Theory and Applications (ICCTA`07), IEEE Computer Society USA, pp. 538-544, 2007.
[9] M.K. Jindal, R.K. Sharma., G.S. Lehal ., �Structural Features for Recognizing Degraded Printed Gurmukhi Script�, International conference on Information Technology: New Generation, IEEE Computer Society, pp. 668-673, 2008.
[10] M. Kumar, �Degraded Text Recognition of Gurmukhi Script�, Ph. D. Thesis, Thapar University Patiala, 2008.
[11] N. K. Garg, and S.Jindal, �An Efficient Feature Set For Handwritten Digit Recognition�, 15th International Conference on Advanced Computing and Communications, IEEE computer Society, pp. 540-544, 2007.
[12] O.D.Trier, A.K. Jain and T.Taxt,� Feature Extraction methods for character recognition � A survey�, appeared in Pattern Recognition, Vol. 29, No. 4, pp. 641-662, 1996.
[13] P.Singh and N.Tyagi, �Radial basis function for handwritten devanagari numeral recognition�, International journal of advanced computer science and applications, Vol. 2 No. 5, pp. 126-129, 2011.
[14] P.Singh and S.Budhiraja ., �Offline handwritten gurmukhi numeral recognition using wavelet transforms�, International journal modern education and computer science, Vol. 8, pp. 34-39, 2012.
[15] P.Jhajj and D. Sharma, �Recognition of Isolated Handwritten Characters in Gurmukhi Script�, International Journal of Computer Applications, Vol. 4 No.8, pp. 9-17, 2010.
[16] S. V. Rajashekararadhya, and P. V. Ranjan, �Zone based feature extraction algorithm for handwritten numeral recognition of kannada script�, Proceedings of International advance computing conference, pp. 525-528, 2009.

N. Goyal, S. Garg, "Recognition of Degraded Printed Gurmukhi Numerals- A Review," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.75-87, 2014.

Global positioning system (GPS) data can provide us valuable knowledge to understand the user. It also enables context-aware computing based on user�s present transportation mode and design of an innovative user interface for Web users. GPS-equipped taxis are employed as mobile sensors probing the traffic rhythm of a city and taxi drivers� intelligence in choosing driving directions in the physical world. Here we mine smart driving directions from the historical GPS trajectories of a large number of taxis, and provide a user with the practically fastest route to a given destination at a given departure time. There are many problems we need to address with regard to driving directions such as finding nearest distance route between source and destination, traffic lights on route, direction turns on route, and checking weather conditions. Hence, a survey is conducted through which we can focus on the most important issue is finding efficient route driving directions.

GPS, Driving Directions, Data mining, Spatial databases and GIS, Time-dependent fast route, Taxi trajectories, Road network

[1] Arvind Thiagarajan, Sivan Toledo Jakob Eriksson, �VTrack: Accurate, Energy-aware Road Traffic Delay Estimation using mobile phones�. Proc. Int�l Conf. on Embedded Networked Sensor Systems, pp: 85-88, ISBN: 978-1-60558-519-2,2009.
[2] Corrado de Fabritiis, Roberto Ragona, Gaetano Valenti, �Traffic Estimation And Prediction Based On Real Time Floating Car Data,� Proc. Int�l Conf. on Intelligent Transportation Systems, ISBN: 1-4244-2112-1, October 12-15, 2008.
[3] Yu Zheng, Like Liu, Longhao Wang, Xing Xie,�Learning Transportation Mode from Raw GPS Data for Geographic Applications on the Web,� IW3C2, ACM 978-1-60558-085-2/08/04, April 21-25, 2008.
[4] J. Yuan, Y. Zheng, C. Zhang, and X. Xie, �An Interactive-Voting Based MapMatching Algorithm,� Proc. Int�l Conf. Mobile Data Management (MDM), Pages 43-52, ISBN:978-0-7695-4048-1 2010.
[5] Y. Lou, C. Zhang, Y. Zheng, X. Xie, W. Wang, and Y. Huang �Map-Matching for Low-Sampling-Rate GPS Trajectories,� Proc.Int�l Conf. Advances in Geographic Information Systems (GIS), ISBN:978-1-60558-649-6/09/11, November 4-6, 2009.
[6] J. Yuan, Y. Zheng, C. Zhang, W. Xie, G. Sun, H. Yan, and X. Xie, �T-Drive: Driving Directions Based on Taxi Trajectories,� Proc.18th SIGSPATIAL Int�l Conf. Advances in Geographic Information Systems (GIS), Page No(99-108), ISBN: 978-1-4503-0428-3, 2010.
[7] E. Kanoulas, Y. Du, T. Xia, and D. Zhang, �Finding Fastest Paths on a Road Network with Speed Patterns,� Proc. Int�l Conf. Data Eng. (ICDE), ISBN: 0-7695-2570-9 2006.

G. Sivaiah, P.K. Rao, "A Comprehensive Survey on Providing Efficient Driving Directions Using GPS and Driver`s Ability," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.79-82, 2014.

Cloud computing systems are deployed,which represents a real shift in the way. Cloud computing systems, are having the massive scale popularization of the Internet and was able to develop some large service companies. Cloud computing is a pay-as- you-go, infinitely scalable, ubiquitous computing systems, with the possible utility makes long-held dream. With cloud computing, you too can start small and grow very fast. That`s why it�s built on. technology is evolutionary, even though cloud computing is revolutionary. The resources are limitless virtual and physical systems on which the software runs out of the details of the user that is different from that perception. In the current paper we are going to present problems of data migrations in cloud computing and also present different reviews of cloud computing.

Cloud Computing, Data Migration, Virtual Machine Migration.

[1] "What is Cloud Computing?"
http://www.zeus.comlcloud_computinglc1oud.html, January 2010.
[2] N. Shivaratri, P. Krueger, and M. Singhal. Load distributing for locally distributed systems. IEEE Computer, 25(12), pp. 33-44, December 1992
[3] ElarbiBadidi, Architecture et services pour la distribution de charge dans les systmesdistribu�s objet, Universit� de Montr�al Facult� des �tudessup�rieures, these doctorale, 20 juillet 2000 ;
[4] T.L.Casavant and J.G. Kuhl. A Taxonomy of Scheduling in General- Purpose Distributed Computing Systems. IEEE Transactions on Software Engineering, 14(2), pp. 141-154, February 1988
[5] Luqun Li "An Optimistic Differentiated Service Job Scheduling System for Cloud Computing Service Users and Providers" Third International Conference on Multimedia and Ubiquitous Engineering in 2009
[6] B. Furht and A. Escalante, Handbook of Cloud Computing, 1st ed. Springer, 2010.
[7] Wuu-Yee Chen, Tsang-Yean Lee, Nai-Wen Kuo,Yuan-Hwa Mei, Shan-Kai Chen, Yu-Chen Yan, "Job Schedule Model Based on Grid Environment" Fifth International Joint Conference on INC, IMS and IDC in 2009.
[8] XIAO Zhi-Jiao, CHANG Hui-You,YI Yang "An Optimization Method of Workflow Dynamic Scheduling Based on Heuristic GA ",Computer Science, Vol.34No.2 2007.
[9] MarekWieczorek, Andreas Hoheisel, and RaduProdan "Taxonomy of the multi-criteria grid workflow.
[10] A. Vouk, "Cloud Computing- Issues, Research and Implementations,"Information Technology Interfaces, pp. 31-40, June 2008.

P. Kaur, S. Majithia, "Various Aspects for Data Migration in Cloud Computing and Related Reviews," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.83-85, 2014.

Human fingerprints are rich in details called minutiae, which can be used as identification marks for fingerprint verification. But they are vulnerable to attacks and fake fingerprints can be generated to login into the system anonymously. With the widespread applications of fingerprint techniques in authentication systems, protecting the privacy of the fingerprint becomes an important issue. Therefore, in recent years, significant efforts have been put into developing specific protection techniques for fingerprint. This paper reviews some of the existing techniques which protect the privacy as well as security of the fingerprint systems.

Minutiae, Security, Protection, Privacy

[1] A.K. Jain, R. Bolle, and S. Pankanti, (Eds.), Biometrics: Personal Identification in Networked Society, Kluwer
Academic Publishers, 1999.
[2] D.Maltoni, D.Maio, A.K.Jain, and S.Prabhakar, Handbook of Fingerprint Recognition, Springer, New York, 2003.
[3] B. Schneier, �The uses and abuses of biometrics�, Comm. ACM, vol. 42, no. 8, pp. 136, Aug. 1999.
[4] B. J. A. Teoh, C. L. 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, 2004.
[5] S. Li and A. C. Kot, �A novel system for fingerprint privacy protection,� in Proc. 7th Int. Conf. Inform. Assurance and Security (IAS), Dec. 5�8, 2011, pp. 262�266.
[6] Y Dodis, R Ostrovsky, L Reyzin, A Smith, Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. Proc Eurocrypt 2004, 523�540 (2004)
[7] M Upmanyu, AM Namboodiri, K Srinathan, CV Jawahar, Efficient biometric verification in encrypted domain. ICB `09: Proc of the Third Int Conf on Biometrics, 899�908 (2009).
[8] C Soutar, GJ Tomko, GJ Schmidt, Fingerprint controlled public key cryptographic system. US Patent, 5541994 (1996)
[9] AK Jain, K Nandakumar, A Nagar, Biometric template security. EURASIP J Adv Signal Process, 1�17 (2008)
[10] A Juels, M Wattenberg, A fuzzy commitment scheme. 6th ACM Conf on Computer and Communications Security, 28�36 (1999)
[11] A Juels, M Sudan, A fuzzy vault scheme. Proc 2002 IEEE Int Symp on Information Theory, 408 (2002)
[12] J-P Linnartz, P Tuyls, New shielding functions to enhance privacy and prevent misuse of biometric templates. Proc 4th Int Conf Audio- And Video-Based Biometric Person Authentication, 393�402 (2003)
[13] AK Jain, K Nandakumar, A Nagar, Biometric template security. EURASIP J Adv Signal Process, 1�17 (2008)
[14] G Davida, Y Frankel, B Matt, On enabling secure applications through off-line biometric identification. Proc of IEEE, Symp on Security and Privacy, 148�157 (1998)
[15] H Feng, CC Wah, Private key generation from on-line handwritten signatures. Inf Manag Comput Secur 10(18), 159�164 (2002)
[16] N. K. Ratha, S. Chikkerur, J. H. Connell, and R. M. Bolle, �Generating cancelable fingerprint templates,� IEEE Trans. Pattern Anal. Mach.Intell., vol. 29, no. 4, pp. 561�72, Apr. 2007.
[17] A. Ross and A. Othman, �Mixing fingerprints for template security and privacy,� in Proc. 19th Eur. Signal Proc. Conf. (EUSIPCO), Barcelona, Spain, Aug. 29�Sep. 2, 2011.
[18] A. Othman and A. Ross, �Mixing fingerprints for generating virtual identities,� in Proc. IEEE Int. Workshop on Inform. Forensics and Security (WIFS), Foz do Iguacu, Brazil, Nov. 29�Dec. 2, 2011.

J.S. Aafa, S. Soja, "Fingerprint Privacy Protection Techniques: A Comparative Study," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.86-89, 2014.

Steganography is the science of concealing secret information into any digital media such as images, audio, video etc so that no eavesdropper can empathies this secret communication. In this paper we have propounded a high security steganographic technique using discrete wavelet transformation and optimized message dispersing method. Here we have used Haar wavelet transformation which decomposes the cover image into high frequency and low frequency information and high frequency information contains information about the edges, corners etc. of the image where we have dispersed our secret information. Secret Message is inserted into all the color components of high frequency sub-bands that are Red, Green and Blue color components starting from the last column of each of the color components from top to bottom depending upon the length of the message. To measure the imperceptibility of the proposed steganography method we have used MSE and PSNR. For this experiment we have taken four image formats: PNG, BMP, JPEG and TIFF and we have inserted the secret message of sizes starting from 2 KB to 20 KB and evaluated their corresponding MSR and PSNR using standard method. Besides the analysis of MSE and PSNR we have also evaluated the message insertion and the message extraction time. Our experimental result shows that the MSE and Capacity are improved with acceptable PSNR compared to other methods.

Steganography, DWT, MSE, PSNR, PNG, BMP, JPEG, TIFF

[1] Tian, Lei; Zhou, Ke; Jiang, Hong; Liu, Jin; Huang, Yongfeng; and Feng, Dan, "An M-Sequence Based Steganography Model for Voice over IP" (2008). CSE Technical reports. Paper 68.
[2] Cheddad, Abbas, Joan Condell, Kevin Curran, and Paul Mc Kevitt. "Digital image steganography: Survey and analysis of current methods." Signal Processing 90, no. 3 (2010): 727-752.
[3] T Morkel, JHP Eloff and MS Olivier, "An Overview of Image Steganography," in Proceedings of the Fifth Annual Information Security South Africa Conference (ISSA2005), Sandton, South Africa, June/July 2005 (Published electronically)
[4] Marvel, L.M., Boncelet Jr., C.G. & Retter, C., �Spread Spectrum Steganography�, IEEE Transactions on image processing, 8:08, 1999
[5] Anderson, R.J. & Petitcolas, F.A.P., �On the limits of steganography�, IEEE Journal of selected Areas in Communications, May 1998
[6] Marghny Mohamed, Fadwa Al-Afari and Mohamed Bamatraf, �Data Hiding by LSB Substitution Using Genetic Optimal Key-Permutation�, International Arab Journal of e-Technology, Vol. 2, No. 1, pp. 11-17, January 2011
[7] Elham Ghasemi, Jamshid Shanbehzadeh, and Nima Fassihi, �High Capacity Image Steganography Based on Genetic Algorithm and Wavelet Transform�, Intelligent Control and Innovative Computing, Vol. 10, pp. 395-402, 2012
[8] Fard, Amin Milani, M-R. Akbarzadeh-T, and Farshad Varasteh-A. "A new genetic algorithm approach for secure JPEG steganography." In Engineering of Intelligent Systems, 2006 IEEE International Conference on, pp. 1-6. IEEE, 2006.
[9] Hajizadeh, Hamzeh, Ahmad Ayatollahi, and Sattar Mirzakuchaki. "A new high capacity and EMD-based image steganography scheme in spatial domain." In Electrical Engineering (ICEE), 2013 21st Iranian Conference on, pp. 1-6. IEEE, 2013.
[10] Singh, Ravindra Kumar, Harsh Kumar Verma, and Charan Kamaljit Singh. "Bi-directional pixel-value differencing approach for RGB color image." InContemporary Computing (IC3), 2013 Sixth International Conference on, pp. 47-52. IEEE, 2013.
[11] Saraireh, Saleh. "A SECURE DATA COMMUNICATION SYSTEM USING CRYPTOGRAPHY AND STEGANOGRAPHY." International Journal of Computer Networks & Communications 5, no. 3 (2013).
[12] Bandyopadhyay, Samir K., and Sabyasachi Pramanik. "Application of Steganography in Symmetric Key Cryptography with Genetic Algorithm."INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 10, no. 7 (2013): 1791-1799.
[13] Juneja, Mamta, and Parvinder S. Sandhu. "Data Hiding with Enhanced LSB Steganography and Cryptography for RGB Color Images."International Conference on Latest Computational Technologies (ICLCT`2013) June 17-18, 2013 London (UK)
[14] Balasubramanian, C., S. Selvakumar, and S. Geetha. "High payload image steganography with reduced distortion using octonary pixel pairing scheme."Multimedia Tools and Applications (2013): 1-23.
[15] Yang, Ching-Yu. "Robust Watermarking Scheme Based on Radius Weight Mean and Feature-Embedding Technique." ETRI Journal 35, no. 3 (2013).
[16] Chakraborty, Suman, Sudipta Roy, and Samir K. Bandyopadhyay. "Image Steganography Using DNA Sequence and Sudoku Solution Matrix."International Journal 2, no. 2 (2012).
[17] Shejul, Anjali A., and Umesh L. Kulkarni. "A DWT based approach for steganography using biometrics." In Data Storage and Data Engineering (DSDE), 2010 International Conference on, pp. 39-43. IEEE, 2010.
[18] Shejul, Anjali A., and Umesh L. Kulkarni. "A secure skin tone based steganography using wavelet transform." International Journal of computer theory and Engineering 3, no. 1 (2011): 16-22.
[19] Chen, Po-Yueh, and Hung-Ju Lin. "A DWT based approach for image steganography." International Journal of Applied Science and Engineering 4, no. 3 (2006): 275-290.
[20] Tolba, Mohamed Fahmy, MA-S. Ghonemy, IA-H. Taha, and Amal Said Khalifa. "High capacity image steganography using wavelet-based fusion." In Computers and Communications, 2004. Proceedings. ISCC 2004. Ninth International Symposium on, vol. 1, pp. 430-435. IEEE, 2004.
[21] El Safy, R. O., H. H. Zayed, and A. El Dessouki. "An adaptive steganographic technique based on integer wavelet transform." In Networking and Media Convergence, 2009. ICNM 2009. International Conference on, pp. 111-117. IEEE, 2009.
[22] Raja, K. B., S. Sindhu, T. D. Mahalakshmi, S. Akshatha, B. K. Nithin, M. Sarvajith, K. R. Venugopal, and Lalit M. Patnaik. "Robust image adaptive steganography using integer wavelets." In Communication Systems Software and Middleware and Workshops, 2008. COMSWARE 2008. 3rd International Conference on, pp. 614-621. IEEE, 2008.
[23] Bhattacharya, Tanmay, Nilanjan Dey, and S. R. Chaudhuri. "A novel session based dual steganographic technique using DWT and spread spectrum." arXiv preprint arXiv:1209.0054 (2012).
[24] Torres-Maya, Silvia, Mariko Nakano-Miyatake, and Hector Perez-Meana. "An image steganography systems based on bpcs and iwt." In Electronics, Communications and Computers, 2006. CONIELECOMP 2006. 16th International Conference on, pp. 51-51. IEEE, 2006.
[25] Chen, Wen-Yuan. "Color image steganography scheme using set partitioning in hierarchical trees coding, digital Fourier transform and adaptive phase modulation." Applied Mathematics and Computation 185, no. 1 (2007): 432-448.
[26] Cheng, Qiang, and Thomas S. Huang. "An additive approach to transform-domain information hiding and optimum detection structure." Multimedia, IEEE Transactions on 3, no. 3 (2001): 273-284.
[27] Kociołek, Marcin, Andrzej Materka, Michał Strzelecki, and Piotr Szczypiński. "Discrete wavelet transform-derived features for digital image texture analysis." In International Conference on Signals and Electronic Systems, Ł�dź-Poland, pp. 99-104. 2001.
[28] S. Mallat: A wavelet Tour of Signal Processing, Academic Press, San Diego 1998
[29] K. Prasad, V. Jyothsna, S Raju and S. Indraneel, �High Secure Image Steganography in BCBS Using DCT and Fractal Compression,� International Journal of Computer Science and Network Security, vol. 10 No.4, April 2010.
[30] Mazumder, Juned Ahmed, and Kattamanchi Hemachandran. "A High Capacity and Secured Color Image Steganographic Technique Using Discrete Wavelet Transformation." IJCSIT) International Journal of Computer Science and Information Technologies 4, no. 4 (2013): 583-589.
[31] Mazumder, Juned Ahmed, and K. Hemachandran. "Study of Image steganography using LSB, DFT and DWT." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 5 (2013): 2618-2627.
[32] Mazumder, Juned Ahmed, and K. Hemachandran. "Review Of Different Techniques Used In Recent Steganography Researches." International Journal of Engineering 1, no. 8 (2012).
[33] Devi, Ningthoujam Sunita, and K. Hemachandran. "Automatic Face Recognition System using Pattern Recognition Techniques: A Survey."

J.A. Mazumder, H. Kattamanchi , "Color Image Steganography Using Discrete Wavelet Transformation and Optimized Message Distribution Method," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.90-100, 2014.

String matching is a very important subject in the wider domain of text processing. String matching algorithms are basic components used in implementations of practical softwares existing under most operating systems. Moreover, they emphasize on programming methods that serve as paradigms in other fields of computer science. In Text processing systems users search a pattern of string from a given text. String matching is fundamental to database and text processing applications. Every text editor contains a mechanism to search the current document for arbitrary strings. This paper aims at describing a new string matching algorithm for various applications. A new algorithm has been designed which is based on a 2D structure.

Algorithm, Complexity, Matrix, Pattern Matching, Strings

[1]. Hume and Sunday (1991) [Fast String Searching] SOFTWARE�PRACTICE AND EXPERIENCE, VOL. 21(11), 1221�1248 (NOVEMBER 1991)
[2]. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Carom. ACM 20, (10), 262� 272 (1977).
[3]. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Chapter 32: String Matching, pp.906�932
[4]. Bretscher, Otto (2005), Linear Algebra with Applications (3rd ed.), Prentice Hall
[5]. Bronson, Richard (1989), Schaum`s outline of theory and problems of matrix operations, New York: McGraw�Hill, ISBN 978-0-07-007978-6
[6]. Brown, William A. (1991), Matrices and vector spaces, New York: M. Dekker, ISBN 978-0-8247-8419-5, Coburn, Nathaniel (1955), Vector and tensor analysis, New York: Macmillan, OCLC 1029828
[7]. http://en.wikipedia.org/wiki/Matrix_(mathematics)
D.S. Rajput, R.S. Thakur and G.S. Thakur, Clustering approach based on efficient coverage with minimum weight for document data, International Journal of Computer Sciences and Engineering (IJCSE), Vol. 1 Issue 1, pp 6-13, Sep-2013

P. Lathar, Y. Singh, G.K. Sharma , "A Novel and Efficient Approach to Retrieve Data from Cloud," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.101-104, 2014.