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

As computer devices adopt new form factors and usability paradigms, mobility has become a byword in software development. The market is flooded with applications for the mobile devices and more and more developers are realizing the immense potential of this expanding market. This paper highlights some of the major issues faced by the developers of mobile applications. It also suggests a context-specific approach to address them.

Application Development; Challenges and Issues in Mobile, Data Access; Maintenance in Mobile; Mobile Apps; Mobile Devices; Native and Cross-Platform Development Tools; Security in Applications; Software Engineering

[1] Simon Khalaf, �Mobile Use Grows 115% in 2013, Propelled by Messag ing Apps�, Flurry Analytics, January 13, 2014, Retrieved March 09, 2014 from http://www.flurry.com/bid/103601/Mobile-Use- Grows-115-in-2013-Propelled-by-Messaging-Apps#.U21TC4GSxic
[2] Research2guidance, The Mobile Research Specialists, �The Market For Mobile Application Development Services�, July 2011
[3] Xiandi Zhang, Feng Yang, Zhongqiang Liu, Zhenzhi Wang, Kaiyi Wang, �Research and Application of Data Security for Mobile Devices�, International Federation for Information Processing, Advances in Information and Communication Technology, Volume 346, 2011, pp. 46-56
[4] ABIresearch, Technology Market Intelligence, �Mobile Authentication & Encryption�, Code AN-1325, Quarter 4, 2013
[5] HP Security Research, Press Release, November 1, 2013, Retrieved Feb 09, 2014 from http://www8.hp.com/us/en/hp-news/press- release.html?id=1528865#.U21Yc4GSxic
[6] W. Anthony, �Software Engineering Issues for Mobile Application Development�, FoSER 2010, Retrieved April 10, 2014 from http://works.bepress.com/tony_wasserman/4
[7] T. Butter, M. Aleksy, P. Bostan, M. Schader, �Context-aware User Interface Framework for Mobile Applications�, Proceedings of 27th International Conference on Distributed Computing Systems Workshops, ICCDCSW, 2007, pp. 39
[8] Biraj Das, �How to test Mobile Applications � Emulators or Real Devices�, Congruent Blog, Retrieved March 03, 2014 from http://blog.congruentsoft.com/how-to-test-mobile-applications- emulators-or-real-devices/
[9] M. Nijim, Lee Young, L. Bellam, �Hybum: Hybrid Energy Efficient Architecture for Mobile Storage Systems�, Proceedings of 9th International Conference on Information Technology: New Generations, 2012, pp. 214-220
[10] R. Minelli, M. Lanza, �Software Analytics for Mobile Applications � Insights & Lessons Learned�, Proceedings of 17h European Conference on Software Maintenance and Reengineering, 2013, pp. 144-153
[11] Flurry Analytics, About Us, Retrieved March 15, 2013 from http://www.flurry.com/about-flurry
[12] Serge Huber, �Tips for Mobile Application Maintenance�, August 29, 2012, Retrieved April 13, 2014 from http://www.aiim.org/community/blogs/expert/tips-for-mobile- application-maintenance
[13] Moochman, �Mobile OS Shootout: The Cross-Platform Developer POV�, March 23, 2009, Retrieved April 13, 2014 from http://www.osnews.com/story/21179/Mobile_OS_Shootout_The_Cross-Platform_Developer_Point_of_View
[14] J. Dann, �Under the hood: Rebuilding Facebook for iOS�, Retrieved Feb 02, 2013 from https://www.facebook.com/notes/facebook- engineering/under-the-hood-rebuilding-facebook-for- ios/10151036091753920
[15] Jonas Lind, �Platform X: How Cross-Platform Tools can End the OS Wars�, June 26, 2011, Retrieved March 09, 2014 from http://www.visionmobile.com/blog/2011/06/platform-x-how-cross-platform-tools-can-end-the-os-wars/
[16] World Wide Web Consortium, Mobile Web Application Best Practices W3C Working Draft, 13 July 2010, Retrieved Jan 6, 2014 from http://www.w3.org/TR/mwabp/
[17] M. Nagendra and B.Kondaiah, "A Comparison and Performance Evaluation of On-Demand Routing Protocols for Mobile Ad-hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-05, Page No (15-19), May -2014.

S. Gupta, "Addressing the Issues in Mobile Application Development," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.1-5, 2014.

We are living in a world full of data. Every day people encounter large amounts of data. Main problem here is dealing with this huge data. Data mining techniques can be used to handle such huge data. Health care environment collects vast amounts of data, but the unfortunate thing is that it is not efficient in extracting useful information from this wealthy data. Data mining techniques can be applied to extract valuable knowledge from the health care environment. In this paper, three supervised learning classification algorithms have been implemented to predict heart attack risk from heart disease database. The classification algorithms used are Naive Bayesian Classification (NBC), k-Nearest Neighbor (k-NN) Classification and ID3 Classification. As a pre-processing step Discretization of continuous variables is adopted. The heart disease data set is trained with these classifiers. A GUI is designed so that the user can input patient�s record. The system is then able to predict whether or not the user has a risk of heart attack. The performance of these three algorithms is determined by computing accuracy. From the experiments, it is found that ID3 Classification outperforms other two classifiers with the accuracy of 91.72%.

Classification, ID3, Data mining, Supervised Learning, Naive Bayesian, k-Nearest Neighbor

[1] Sivagowry .S, Dr. Durairaj. M, Persia.A, �An Empirical Study on applying Data Mining Techniques for the Analysis and Prediction of Heart Disease�, Int, Conference on Information Communication and Embedded System (ICICES), ISBN: 978-1-4673-5786-9, Page No (265-270), Feb 21-22, 2013
[2] Jiawei Han, Micheline Kamber, and Jian Pei, �Data Mining Concepts and Techniques�, Morgan Kaufmann Publishers, Third (3rd) Edition, ISBN: 1-55860-901-6, 2012
[3] Jyoti Soni, Uzma Ansari, Dipesh Sharma, Sunita Soni, �Intelligent and Effective Heart Disease Prediction System using Weighted Associative Classifiers�, Int. Journal on Computer Science and Engineering (IJCSE), Volume-03, Issue-06, Page No (2385-2392), 2011
[4] Asha Rajkumar, Mrs. G.Sophia Reena, �Diagnosis Of Heart Disease Using Datamining Algorithm�, Global Journal of Computer Science and Technology, Vol ume-10, Issue--10, Page No (38-43), 2010
[5] Indian Express: http://archive.indianexpress.com/news/india-set-to-be--heart-disease-capital-of-world--say-doctors/1009607/
[6] UCI Machine Learning Repository [Online]. Available: http://archive.ics.uci.edu/ml/datasets/Heart+Disease
[7] K.Srinivas, B.Kavihta Rani, Dr. A.Govrdhan, �Applications of Data Mining Techniques in Healthcare and Prediction of Heart Attacks�, International Journal on Computer Science and Engineering (IJCSE), Volume-02, Issue-02, Page No (250-255), 2010
[8] Shamsher Bahadur Patel, Pramod Kumar Yadav, Dr. D. P.Shukla, �Predict the Diagnosis of Heart Disease Patients Using Classification Mining Techniques�, IOSR Journal of Agriculture and Veterinary Science (IOSR-JAVS), Volume -04 Issue-02, Page No (61-64), 2013
[9] Mai Shouman, Tim Turner, Rob Stocker, �Applying k-Nearest Neighbour in Diagnosing Heart Disease Patients�, International Journal of Information and Education Technology, Volume-02 Issue-03, Page No (220-223), 2012
[10] Yanwei Xing, Jie Wang, Zhihong Zhao, Yonghong Gao, �Combination data mining methods with new medical data to predicting outcome of Coronary Heart Disease�, International Conference on Convergence Information Technology, ISBN: 0-7695-3038-9, Page No (868 � 872), Nov 21-23, 2007
[11] Mary Slocum, �Decision Making Using ID3 Algorithm�, Rivier Academic Journal, Volume-08, Number-02, Page No (1-12), 2012
[12] Hnin Wint Khaing, �Data Mining based Fragmentation and Prediction of Medical Data�, Int, Conference on Computer Researh and Development(ICCRD), ISBN: 978-1-61284-839-6, Page No (480-485), March 11-13, 2011
[13] EntropyBasedBinning: http://www.saedsayad.com/supervised_binning.htm
[14] Pang-Ning Tan, Vipin Kumar, Michael Steinbach, �Introduction to Data Mining�, Addison-Wesley, 2006

S.A. Angadi, M.M. Naravani, "Predicting Heart Attack Using NBC, k-NN and ID3," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.6-12, 2014.

Digital image processing has its applications in the field of Agriculture. Many techniques of image processing can be applied to detect plant and fruit diseases. One such approach is using Neural Networks. Many people have worked on detecting plant diseases using image processing, but reported works are very less in detecting fruit diseases. In the present work reduced feature set based approach is used for recognition and classification of images of fruits into normal and affected. Color and texture features are used to differentiate between normal and affected (decayed) fruits of all types. The RGB (Red Green Blue) color features and GLCM (Gray-level Co-occurrence Matrix) texture features are reduced. The reduced feature set comprises of most appropriate features. Neural Network classifier is used to classify normal and affected (decayed) fruit images. The combination of reduced color and reduced texture features are able to prove the effectiveness in classifying normal and affected (decayed) fruits images. The work finds application in developing a machine vision system in agriculture and horticulture fields.

Classification;Feature Extraction;Feature Reduction;Neural Network

[[1]
Patil, J, K. & Raj Kumar. (2012). Feature extraction of diseased leaf images. Journal of signal and image processing, 3:60-63.
[2] Moshou, D., Bravo, C., Oberti, R., West, J, S., Ramon, H., Vougioukas, S. & Bochtis, D (2011). Intelligent multi-sensor system for the detection and treatment of fungal diseases in arable crops. Biosystems Engineering, 18: 311 -3 2 1.
[3] Guru, D, S., Mallikarjuna, P.B. & Manjunath, S. (2011). Segmentation and Classification of Tobacco Seedling Diseases. COMPUTE `11 Proceedings of the Fourth Annual ACM. Bangalore.
[4] Al-Hiary, H., Bani-Ahmad, S., Reyalat, M., Braik, M. & ALRahamneh. (2011). Fast and Accurate Detection and Classification of Plant Diseases. International Journal of Computer Applications, 17.
[5] Anami, B, S. & Savakar.D. (2009). Improved Method for Identification and Classification of Foreign bodies, mixed food grains, Image sample. ICGST/AIML Journal, 9:1-8.
[6] Yud-Ren-Chen., Kuanglin-Chao & Moon S. Kim. (2002).Machine vision technology for agricultural applications. Computers and Electronics in Agriculture, 36:173-191.
[7] Martin, D, P. & Rybicki, E, P. (1998).Microcomputer-Based Quantification of Maize Streak Virus Symptoms in Zeamays. Publication no. P-1998-0316-01R. The American Psychopathological Society.
[8] Dae-Gwan-Kim., Burks, T, F., Jianwei-Qin. & Bulanon, D, M. (2009). Classifications of grapefruit peel diseases using color texture feature analysis. International journal of Agricultural & Biological Engineering, 2.

[9]
Burks, T, F. & Rajesh-Pydipati. (2002).Early detection of citrus diseases using machine vision. Presentation at ASAE conference. Chicago. USA.
[10] Pujari, J, D., Rajesh, Yakkundimath, & Byadgi, A.S. (2013). Grading and Classification of anthracnose fungal disease in fruits. International Journal of Advanced Science and Technology, 52.
[11] Bandi, S, R., Varadharajan, A. & Chinnasamy, A. (2013). Performance evaluation of various statiscal classifiers in detecting the diseased citrus leaves. International Journal of Engineering Science and Technology (IJEST), 5.
[12] Dubey, S, R. & Jalal, A, S. (2012). Adapted Apple for Fruit Disease Identification using Images. International Journal of Computer Vision and Image Processing (IJCVIP), 2:51 � 65.
[13] Jagadeesh. D. Pujari, Rajesh. Yakkundimath and A. S. Byadgi(2013),Reduced Color and Texture features based Identification and Classification of Affected and Normal fruits� images, International Journal of Agricultural and Food Science 2013, 3(3): 119-127
[14] Tuker, C, C. & Chakraborty, K. (2008). Quantitative Assessment of Lesion Characteristics and Disease Severity Using Digital Image Processing. Journal of phypathology, 145:273 � 278.
[15] Senthil Nagarathinam, Thendral Ravi and Suhasini Ambalavanan3,�Machine Vision Applications of Image Processing in Agriculture: A Survey ,�IJCSE, International Journal of Computer Sciences and Engineering,Vol.-2(4), pp (157-160) April 2014

Priyanka P.T., S.A. Angadi , "Classification of Normal and Affected (Decayed) Fruit Images," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.31-19, 2014.

Photos are major interests of humans (e.g., family, friends, relatives, etc). Among all those photos, a big percentage of them are photos with human. With the exponentially growing images; Content-based Image Retrieval is an emerging application to retrieve the image from a large set of database. The goal of this research is to retrieve a face image based on attribute-based search. In this work, we aim to detect face image from a given input image and detected facial attributes that contain semantic cues of the face photos to improve content based face retrieval for efficient large-scale face retrieval. In my research, we are using OpenCV to detect the faces.

Face Image proecssing, Face detection using Haarcascasdes, OpenCV, Facial fetrures extraction using FACESDK

[1] Y.-H. Lei, Y.-Y Chen, L. Iida, B.-C. Chen, H.-H. Su, and W.H. Hsu, �Photo search by face positions and facial attributes on touch devices,� ACM Multimedia, 2011.
[2] D. Wang, S.C. Hoi, Y. He, and J.Zhu, �Retrieval-based face annotation by weak label regularized local coordinate coding,� ACM Multimedia, 2011.
[3] Bor-Chun Chen, Yan-YIUNg Chen, Yin-His Kuo, and Winston H. Hsu, �Scalable face image retrieval using attribute enhanced sparse codewords,� IEEE Transaction on Multimedia, pp. 1163-1173, August 2013.
[4] J. Zobel and A. Moffat, �Inverted files for text search engines,� ACM Compu. Surveys, 2006.
[5] A. Gionis, P. Indyk, and R. Motwani, �Similiarity search in high dimensions via hasining,� VLDB, 1999.
[6] J. Sivic and A. Zisserman, �Video Google: A text retrieval approach to object matching in videos,� Int. Conf. Computer Vision, 2003.
[7] D. Lowe, �Distinctive image features from scale-invariant keypoints,� International Journal Computer Vision, 2003.
[8] L. Wu, S. C. H. Hoi, and N. Yu, �Semantics-preserving bag-of-words models and applications,� IEEE Trans. Image Process., vol. 19, no. 7, pp. 1908�1920, July 2010.
[9] Y.-H. Kuo, H.-T. Lin, W.-H. Cheng, Y.-H. Yang, and W. H. Hsu, �Unsupervised auxiliary visual words discovery for large-scale image object retrieval,� IEEE Conf. Computer Vision and Pattern Recognition, 2011.
[10] N. Kumar, A. C. Berg, P. N. Belhumeur, and S. K. Nayar, �Describable visual attributes for face verification and image search,� IEEE Trans. Real-World Face Recognition, vol. 33, no. 10, pp. 1962�1977, Oct. 2011.
[11] B. Siddiquie, R. S. Feris, and L. S. Davis, �Image ranking and retrieval based on multi-attribute queries,� IEEE Conf. Computer Vision and Pattern Recognition, 2011.
[12] W. Scheirer, N. Kumar, K. Ricanek, T. E. Boult, and P. N. Belhumeur, �Fusing with context: A Bayesian approach to combining descriptive attributes,� in Proc. Int. Joint Conf. Biometrics, 2011.
[13] Z. Wu, Q. Ke, J. Sun, and H.-Y. Shum, �Scalable face image retrieval with identity-based quantization and multi-reference re-ranking,� IEEE Conf. Computer Vision and Pattern Recognition, 2010.
[14] B.-C. Chen, Y.-H. Kuo, Y.-Y. Chen, K.-Y. Chu, and W. Hsu, �Semi-supervised face image retrieval using sparse coding with identity constraint,� ACM Multimedia, 2011.
[15] Adolf, F. ��ow-to build a cascade of boosted classifiers based on Haar-like features,� June 20 2003.
[16] Paul Viola, Michael Jones, �Rapid object detection using a boosted cascade of simple features,� Conf. Computer Vision and Pattern Recognition, 2001.
[17] Jackie Abbazio, Sasha Perez, Denise Silva, �Face Bio metric Ssytems,� IEEE Conf. Biometrics 2009.

S.K. Pittala, Moh.J. Sadiq, "Scalable Face Image Retrieval using Attribute based Search," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.20-23, 2014.

Ad-hoc networks do not have any infrastructure or base station. Mobile ad-hoc networks have turned the dream of getting connected �anywhere and at any time� into reality. But these networks face the difficult challenge of maintaining connectivity that is affected due to several factors such as transmission power, environmental conditions, obstacles and mobility. Extension of ad-hoc networks is also a major issue that affects the performance of MANETs. Hence, it is necessary to determine the optimal Transmission range that guarantees the network connectivity while saving power and maintaining high capacity. The IETF MANET Working Group has researched and developed a number of protocols for mobile ad-hoc networks. The Zone Routing protocol (ZRP) is one of the most popular protocol which in contrast to other MANET routing protocols, utilizes a hybrid pro-active/reactive approach to maintain valid routing tables without too much overhead. In this paper, the performance of ZRP has been analyzed on the basis of QoS performance metrics by varying the transmission range and zone size while keeping the node density constant. The performance metrics comprises of Average Throughput, Packet delivery ratio (PDR), Average end-to-end delay, Routing overhead, Average jitter and Average Energy consumed. The network simulator (NS2.33) has been used to simulate the environment. From the simulation results, it has been observed that the zone routing protocol performs best with smaller zone size for all the transmission ranges but gives poor performance with the increase of zone size.

BRP, IARP, IERP, MANETs, Transmission Range, QoS, Zone radius, ZRP

[1] Imrich Chlamtac, Marco Conti, Jenifer J.-N. Liu, �Mobile Ad Hoc Networking: Imperatives and Challanges�, Elsevier Network Magazine, vol. 13, pages 13-64, 2003
[2] E.M. Belding-Royer and C. K. Toh, �A review of current routing protocols for adhoc mobile wireless networks�, IEEE Personal Communications Magazine, pages 46�55, April 1999.
[3] Shafinaz Buruhanudeen, Mohamed Othman, Mazliza Othman and Borhanuddin Mohd Ali, "Existing MANET Routing Protocols and Metrics Used Towards the Efficiency and Reliability - An Overview", Proc. of the 14th Int. Conference on Telecommunications and 8th Malaysia Int. Conference on Communications (ICT - MICC 2007), 14 - 17 May, 2007.
[4] C. E. Perkins and P. Bhagwat, �Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,� in Proc. Conference on Communications Architectures, Protocols and Applications, SIGCOMM, London, August 1994, pp. 234�244.
[5] C. E. Perkins, E.M.B .Royer, S. Das , �Ad hoc on-demand distance vector (AODV) routing,� IETF Internet Draft, MANET working group, Jan.2004.
[6] Md. Arafatur Rahman and Farhat Anwar et al �A Simulation Based Performance Comparison of Routing Protocol on Mobile Ad-hoc Network (Proactive, Reactive and Hybrid)� (ICCCE 2010), 11-13 May 2010.
[7] Patel, B.; Srivastava, S.; , "Performance analysis of zone routing protocols in Mobile Ad Hoc Networks," Communications (NCC), 2010 National Conference on, vol., pp.1-5, 29-31 Jan. 2010
[8] Haas, Zygmunt, "A New Routing Protocol For The Reconfigurable Wireless Networks," pg 652 - 566, IEEE Journal on Selected Areas in Communications, (1997).
[9] Haas Z. J., Pearlman M. R., and Samar P., �The Zone Routing Protocol (ZRP)�, IETF Internet Draft, draft-ietf-manet-zone-zrp-04.txt, July 2002.
[10] Haas, Zygmunt J., Pearlman, Marc R., Samar, P.: �Intrazone Routing Protocol (IARP)�, IETF Internet Draft, draft-ietf-manet-iarp-01.txt, June 2001
[11] Haas, Zygmunt J., Pearlman, Marc R., Samar, P.: �Interzone Routing Protocol (IERP)�, IETF Internet Draft, draft-ietf-manet-ierp-01.txt, June 2001
[12] Haas, Zygmunt J., Pearlman, Marc R., Samar, P.: �The Bordercast Resolution Protocol (BRP) for Ad Hoc Networks�, IETF Internet Draft, draft-ietf-manet-brp- 01.txt, June 2001
[13] M.Joa-Ng and I. T. Lu, �A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks,� IEEE journal on Selected areas in Communications, vol. 17, no. 8, pp. 1415- 1425, August 1999.
[14] Marc R. Pearlman and Zygmunt J. Haas, �Determining the Optimal Configuration for the Zone Routing Protocol� IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 8, AUGUST 1999.
[15] C. Siva Ram Murthy and B. S. Manoj. (2004), Ad Hoc Wireless Networks: Architectures and Protocols� Prentice Hall.
[16] Network Simulator 2, www.isi.edu/nsnam/ns, 2010.
[17] Shafinaz Buruhanudeen, Mohamed Othman, Mazliza Othman and Borhanuddin Mohd Ali, "Existing MANET Routing Protocols and Metrics Used Towards the Efficiency and Reliability - An Overview", Proc. of the 14th Int. Conference on Telecommunications and 8th Malaysia Int. Conference on Communications (ICT - MICC 2007), 14 - 17 May, 2007
[18] Raju, S.R., Runkana,K; mungara,J, �Performance measurement and analysis of ZRP for MANETs using network simulator- QualNet� Wireless Information technology and Systems (ICWITS), 2010 IEEE International Conference on Aug 28 2010- Sept. 3 2010, page 1-4, ISBN: 978-1-4244-7091-4
[19] SreeRangaRaju, M.N; Mungara,J. �Performance evaluation of ZRP in adhoc mobile wireless network using Qualnet simulator� Signal Processing and information Technology (ISSPIT), 2010 IEEE International Symposium on 15-18 Dec. 2010, pages 457-466, Print ISBN: 978-1-4244-9991-2
[20] M.N. SreeRangaRaju Dr. Jitendranath Mungara, �Optimized ZRP for MANETs and its Applications� International Journal of Wireless & Mobile Networks (IJWMN) Vol. 3, No. 3, June 2011
[21] Neha Jain Yogesh Chaba, � Simulation based Performance Analysis of Zone Routing Protocol in Manet� International Journal of Computer Applications (0975 � 8887) volume 88 � No.4, February 2014
[22] Anil Manohar Dogra, Rajvir singh, �Zone Based Analysis Of Zrp Under Varying Mobility And Transmission Range In Manets� International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue 2 February, 2014 Page No. 4007-4016
[23] Sree Ranga Raju and Jitendranath Mungara, �Performance Evaluation of ZRP over AODV and DSR in MANETs using Qualnet�, European Journal of Scientific Research, vol. 45(4), 2010, pp 651-667
[24] Chirag Rakholiya, Radhika D. Joshi, � Perrformance Enhance,ment of zone Routing Protocol in MANET for Reliable Packet delivery� Proc. of the Intl. Conf. on Advances in Electronics, Electrical and Computer Science Engineering� EEC 2012, ISBN: 978-981-07-2950-9 doi:10.3850/ 978-981-07-2950-9 866

S. Gupta, R. Sharma, "A QoS Based Simulation Approach of Zone Routing Protocol in Wireless Ad-hoc Networks," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.24-30, 2014.

Biometrics system used in worldwide in nature last few years. Using biometric we can combine with other tools to perform more security function and it is very easier to use verification solutions. It is easy to remember because it based on physiological and behavioral characteristics. In order to avoid problems of forgetting password and ID codes, biometric based authentication helps us in verifying your finger prints, iris pattern and voice for your identity at A.T.M�s, Airports etc�, you can unlock your houses, withdrawing money from a bank with just a blink of an eye, a tap of your finger or by just showing your face. A new technology come under consideration of biometric that is biometric attendance system. This system is very helpful with various patterns like face recognition, iris recognition, fingerprint etc.

Biometric, Multimodal Biometric System, Biometric Access Control System, Attendance System, Digital Signature

[1]. http://www.cse.iitk.ac.in/users/biometrics/pages/what_is_biom_more.htm
[2]. "Biometrics: Overview". Biometrics.cse.msu.edu. 6 September 2007. Retrieved 2012-06-10.
[3]. http://www.creativeworld9.com/2011/03/abstract-on-biometrics.html
[4]. http://www.cse.iitk.ac.in/users/biometrics/pages/what_is_biom_more.htm
[5]. http://www.biometrics.gov/documents/biointro.pdf
[6]. "Questions Raised About Iris Recognition Systems". Science Daily. 12 July 2012.
[7]. Sahoo, SoyujKumar; Mahadeva Prasanna, SR, Choubisa, Tarun (1 January 2012). "Multimodal Biometric Person Authentication : A Review". IETE Technical Review 29 (1): 54. doi:10.4103/0256-4602.93139. Retrieved 23 February 2012.
[8]. Saylor, Michael (2012). The Mobile Wave: How Mobile Intelligence Will Change Everything. Perseus Books/Vanguard Press. p. 99.
[9]. Bill Flook (3 October 2013). "This is the `biometric war` Michael Saylor was talking about". Washington Business Journal.
[10]. http://www.cse.iitk.ac.in/users/biometrics/pages/what_is_biom_more.htm
[11]. Jain, A.K.; Bolle, R.; Pankanti, S., eds. (1999). Biometrics: Personal Identification in Networked Society. Kluwer Academic Publications. ISBN 978-0-7923-8345-1.
[12]. Characteristics Of Biometric Systems". Cernet.
[13]. http://www.zicom.com/index.php/safebusiness-access-control-system
[14]. http://www.biometricsystem.in/
[15]. http://www.bioenabletech.com/biometric-attendance-system.html
[16]. http://www.biometricsystem.in/Biometrics-Attendance-System.html
[17]. http://biometrics.pbworks.com/w/page/14811349/Advantages%20and%20disadvantages%20of%20technologies
[18]. http://patentlyapple.typepad.com/.a/6a0120a5580826970c0120a58a45ce970c-500wi
[19]. http://pubs.sciepub.com/ajcrr/2/1/2/figure/3

R. Lathwal, V.K. Saroha, "A Study on Biometric Technology and Access Control System: Network Security," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.31-35, 2014.

Detection of foreground structured objects in the images is an essential task in many image processing applications. This paper presents a region merging approach for automatic detection of the foreground objects in the image. The foreground objects are the structured objects with an independent and detectable boundary. The proposed approach identifies objects in the given image based on general properties of the objects without depending on the prior knowledge about specific objects. The regions of the structured objects in the image are separated from the background based on region contrast information. The perceptual organization laws of human visual system are used in the region merging process to identify the boundaries of various objects. The system is adaptive to the image content. The results of the experiments show that the proposed scheme can efficiently extract object boundary from the background.

Contrast, Segmentation, Histogram, Thresholding, Region Merging

[1] E. Borenstein and E. Sharon, �Combining top-down and bottom-up
segmentation,� in Proc. IEEE Workshop Perceptual Org. Comput. Vis.,
CVPR, 2004.
[2] X. Ren, �Learning a classification model for segmentation,� in Proc.
IEEE ICCV, 2003.
[3] P. Felzenszwalb and D. Huttenlocher, �Efficient graph-based image
segmentation,� Int. Journal of Computer Vision, vol. 59, no. 2, Sep.2004.
[4] J. B. Shi and J. Malik, �Normalized cuts and image segmentation,�
IEEE Transaction Pattern Anal. Mach. Intell., vol. 22, no. 8, Aug. 2000.
[5] S. Gould, J. Rodgers, D. Cohen, G. Elidan, and D. Koller, �Multi-class segmentation with relative location prior,� Int. J. Computer Vision, vol. 80, no. 3,Dec. 2008.
[6] J. D. McCafferty, Human and Machine Vision: Computing Perceptual Organization. Chichester, U.K.: Ellis Horwood, 1990.
[7] R. Mohan and R. Nevatia, �Perceptual organization for scene segmentation and description,� IEEE Trans. Pattern Analysis & Machine Intelligence, vol.14, no. 6,Jun. 1992.
[8] T. Brinkhoff, H. P. Kriegel, and R. Schneider, �Measuring the complexity of polygonal objects,� in Proc. 3rd ACM Int. Workshop, 1995.
[9] I. H. Jermyn and H. Ishikawa, �Globally optimal regions and boundaries as minimum ratio weight cycles,� IEEE Trans. Pattern Analysis & Machine Intelligence, vol. 23,Oct. 2001.
[10] B. C. Russell, �Using multiple segmentations to discover objects and their extent in image collections,� in Proc. IEEE CVPR, 2006, vol. 2,pp. 1605�1614.
[11] D. R. Martin, C. C. Fowlkes, and J. Malik, �Learning to detect natural image boundaries using local brightness, color, and texture cues,� IEEE Trans. Pattern Analysis & Machine Intelligence., vol. 26, no. 5, pp. 530�549, May 2004.
[12] Z. L. Liu, D. W. Jacobs, and R. Basri, �The role of convexity in perceptual completion: Beyond good continuation,� Vis. Res., vol. 39, no. 25, pp. 4244�4257, Dec. 1999
[13] V. Bruce and P. Green, Visual Perception: Physiology, Psychology and Ecology. Hillsdale, NJ: Lawrence Erlbaum Associates Ltd., 1990.
[14] C. Cheng, A. Koschan, D. L. Page, and M. A. Abidi, �Outdoor Scene image segmentation based on background recognition and perceptual organization,� IEEE Transaction on Image Processing VOL 21, No 3.March 2012.
[15] C. Cheng, A. Koschan, D. L. Page, and M. A. Abidi, �Scene image
segmentation based on perceptual organization,� in Proc. IEEE ICIP,
2009, pp. 1801�1804.
[16] L. Yang, P. Meer, and D. J. Foran, �Multiple class segmentation using a unified framework over man-shift patches,� in Proc. IEEE CVPR, 2007, pp. 1�8.
[17] S Jayaraman,�Image Segmentation� in Digital Image Processing: McGraw-Hill,2010

R. Rasal, N.M. Shahane , "SOD: Structured Object Detection," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.36-39, 2014.

Due to the exponential clients demand for new services with high Quality (QOS). 3GPP has developed a new cellular standard based packet switching allowing high data rate, 100 Mbps in Downlink and 50 Mbps in Uplink, this standard is termed LTE (Long Term Evolution). Beyond the improvement in bit rate, LTE aims to provide a highly efficient, low latency, spectrum flexibility and higher mobile speed performances. The purpose of this paper is to prove the high mobility performances. The performance evaluation is conducted in terms of system throughput, delay, and Packet Loss Ratio, using different scheduling algorithms implemented at the LTE base station (PF, MLWDF and EXP/PF schedulers). Finally it will be concluded that higher mobile speed performances are proved with all the 3 scheduling algorithms for best effort flows, while for Video flows the M-LWDF and EXP/PF schedulers who are more preferment , and for VoIP flows it`s PF and EXP/PF schedulers who gives high performances.

LTE ; VOLTE; Video Over LTE; Scheduling; QoS; mobility

[1] John Wiley & Sons �An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G Mobile Communications, First Edition. ISBN: 9781119970385, Page (8-15) 2012.
[2] 3GPP TS 23.002 V8.5.0, Network architecture (Release 8), June 2009.
[3] 3GPP TR 25.913 V8.0.0 LTE: Requirements for Evolved UTRA (E-UTRA) and Evolved UTRAN (E-UTRAN) (Release 8), January 2009.
[4] R. Singh, �4G By WiMAX2 and LTE-Advance�, Int. Journal of Computer Sciences and Engineering, Volume-01, Issue-03, Page No (36-38), Nov 2013.
[5] 3GPP TS 32.423 version 10.8.0, Digital cellular telecommunications system ; LTE; Release 10, April 2014.
[6] 3GPP TR 24.801 V8.1.0, 3GPP System Architecture Evolution (SAE); CT WG1 aspects (Release 8), December 2008.
[7] 3GPP TR 23.882 V8.0.0, 3GPP System Architecture Evolution: Report on Technical Options and Conclusions (Release 8), D�cembre 2008.
[8] G Piro, LTE-Sim - the LTE simulator. [OnLine] Available: [http://telematics.poliba.it/LTE-Sim].
[9] G. Jayakumar, G. Gopinath, �Performance Comparison of MANET Protocol Based on MANHATTAN Grid Model�, Journal of Mobile Communications, vol. 2, no. 1, pp. 18-26, 2008.
[10] Richard Musable, HadiLarijani and Glasgow, Evaluation of New Scheduling Scheme for VoIP with mobility in 3G LTE. The Fifth International Conference on Communication Theory, Reliability, and Quality of Service 2012.
[11] T. Blajić, D. Nogulić, M. Dru�ijanić., Latency Improvements in 3G Long Term Evolution, Mobile Solutions. Ericsson Nikola Tesla d.d. (LATENCY),May 2007.
[12] E. Dahlman, H. Ekstr�m, A. Furusk�r, Y. Jading, J. Karlsson, M. Lundevall, S. Parkvall, The 3G long-term evolution � radio interface concepts and performance evaluation, 63rd Vehicular Technology Conference, VTC 2006 � Spring, Vol. 1, pp. 137�141, IEEE, 2006.
[13] Rep. ITU-R M.2134 - Requirements related to technical performance for IMT-Advanced radio interface(s), ITU-R, 2008.

Moh. MAHFOUDI, M.E. BEKKALI, A. NAJID, S. MAZER, M.EL GHAZI , "High Mobility Evaluation for Voice & Video over LTE," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.40-45, 2014.

Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of a software test�s outcome. A common scenario in software testing is therefore that test data are generated, and a tester manually adds test oracles. As this is a difficult task, it is important to produce small yet representative test sets, and this representativeness is typically measured using code coverage. There is, however, a fundamental problem with the common approach of targeting one coverage goal at a time. Coverage goals are not independent, not equally difficult, and sometimes infeasible the result of test generation is therefore dependent on the order of coverage goals and how many of them are feasible. To overcome this problem, a novel paradigm is proposed in which whole test suites are evolved with the aim of covering all coverage goals at the same time while keeping the total size as small as possible. Genetic Algorithms have been successfully applied to the generation of unit tests for classes, and are well suited to create complex objects through sequences of method calls. However, because the neighborhood in the search space for method sequences is huge, even supposedly simple optimizations on primitive variables (e.g., numbers and strings) can be ineffective or unsuccessful. To overcome this problem, we extend the global search applied in the EvoSuite test generation tool with local search on the individual statements of method sequences. In contrast to previous work on local search, we also consider complex data types including strings and arrays.

EvoSuite, Search-based Software Engineering, Object-oriented, Evolutionary Testing, length, branch coverage, infeasible goal, Collateral coverage

[1] G.Fraser, A.Arcuri �whole test suite generation� IEEE Transactions on software engineering VOL 39 NO.2, FEBRUARY 2013
[2] S. Ali, L. Briand, H. Hemmati, and R. Panesar-Walawege, �A Systematic Review of the Application and Empirical Investigation of Search-Based Test-Case Generation,�IEEE Trans. Software Eng., vol. 36, no. 6, pp. 742-762, Nov./Dec. 2010.
[3] M. Alshraideh and L. Bottaci, �Search-Based Software Test Data Generation for String Data Using Program-Specific Search Operators: Research Articles,�Software Testing, Verification, and Reliability,vol. 16, no. 3, pp. 175-203, 2006.
[4] L. Araujo and J. Merelo, �Diversity through Multiculturality: Assessing Migrant Choice Policies in an Island Model,�IEEE Trans. Evolutionary Computation,vol. 15, no. 4, pp. 1-14, Aug. 2011.
[5] A. Arcuri, �It Really Does Matter How You Normalize the Branch Distance in Search-Based Software Testing,�Software Testing, Verification and Reliability, http://dx.doi.org/10.1002/stvr.457,2011.
[6] A. Arcuri, �A Theoretical and Empirical Analysis of the Role of Test Sequence Length in Software Testing for Structural Coverage,�IEEE Trans. Software Eng., vol. 38, no. 3, pp. 497-519, May/June 2011
[7] L. Baresi, P.L. Lanzi, and M. Miraz, �Testful: An Evolutionary Test Approach for Java,� Proc. IEEE Int�l Conf. Software Testing, Verification and Validation, pp. 185-194, 2010.
[8] B. Baudry, F. Fleurey, J.-M. Je�ze�quel, and Y. Le Traon, �Automatic Test Cases Optimization: A Bacteriologic Algorithm,� IEEE Software, vol. 22, no. 2, pp. 76-82, Mar./Apr. 2005.
[9] G. Fraser and A. Arcuri, �Evolutionary Generation of Whole Test Suites,� Proc. 11th Int�l Conf. Quality Software, pp. 31-40, 2011.
[10] G. Fraser and A. Arcuri, �Evosuite: Automatic Test Suite Generation for Object-Oriented Software,� Proc. 19th ACM SIGSOFT Symp. and the 13th European Conf. Foundations of Software Eng., 2011.

N.S. Prasad, Y.M. Roopa, "Hybrid Algorithm Based Whole Test Suite Generation," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.46-50, 2014.

Task scheduling problem can be defined as a method to schedule tasks for execution . Task scheduling in multiprocessor system is also called as multiprocessor scheduling , and is long studied and difficult problems that continues to be a topic of considerable research. Task scheduling in multiprocessor is a term that can defined as finding a schedule for a general task graph to be executed on a multiprocessor system so that execution time can be minimized. Efficient multiprocessor task scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimize the overall execution time. This is NP- complete problem that can be solved only by search techniques and heuristic. Genetic algorithm is the best search technique for solving this problem because they are known to provide robust, stochastic solutions for numerous optimization problems .

Task Scheduling, Genetic Algorithms, Scheduling, Multiprocessor System, Mutation, Crossover

[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, "A Novel Commence For Optimizing Task Scheduling In Heterogeneous Multiprocessor Environment Using Genetic Algorithm," International Journal of Computer Sciences and Engineering, Vol.2, Issue.7, pp.51-56, 2014.