iosr-JCE   Volume-7 ~ Issue-3

Abstract:In this paper we are providing an approach for authentication using palm prints. Biometrics is physiological characteristics of human beings, unique for every individual that are usually time invariant and easy to acquire. Palm print is one of the relatively new physiological biometrics due to its stable and unique characteristics. In this paper, a combination of hand geometry and palmprint verification system is being developed. This system uses a scanner as sole sensor to obtain the hands images. First, the hand geometry verification system performs the feature extraction to obtain the geometrical information of the fingers and palm. Second, the region of interest (ROI) is detected and cropped by palmprint verification system. This ROI acts as the base for palmprint feature extraction by using Linear Discriminant Analysis (LDA). Lastly, the matching scores of the two individual classifiers is fused by several fusion algorithms namely sum rule, weighted sum rule and Support Vector Machine (SVM). The results of the fusion algorithms are being compared with the outcomes of the individual palm and hand geometry classifiers. We are able to show that fusion using SVM with Radial Basis Function (RBF) kernel has outperformed other combined and individual classifiers.
Keywords: Palm prints, fusion, palmprint, hand geometry.

[1] W.K. Kong and D. Zhang, "Palm print texture analysis based on low-resolution images for personal authentication", in Proceedings of 16th International Conference on Pattern Recognition, vol. 3, pp. 807-810, 2002.
[2] A. Kong, D. Zhang and G. Lu, "A study of identical twins palm print for personal verification", Pattern Recognition, vol. 39, no. 11, pp. 2149-2156, 2006.
[3] [A.W.K. Kong and D. Zhang, "Competitive Coding scheme for palmprint verification", in Proceedings of International Conference on Pattern Recognition, vol. 1, pp. 520-523, 2004.
[4] A. Kong and D. Zhang, "Palm print identification using feature-level fusion", Pattern Recognition, vol. 39, no. 3, pp. 478-487, 2006.
[5] A. Kong, D Zhang and M. Kamel, "A study of brute-force break-ins of a palmprint verification system", IEEE Transactions on Systems, Man and Cybernetics, Part B, vol. 36, no. 5, pp. 1201-1205, 2006.
[6] Kong, K.H. Cheung, D. Zhang, M. Kamel and J. You, "An analysis of Biohashing and its variants", Pattern Recognition, vol. 39, no. 7, pp. 1359-1368, 2006.
[7] D. Zhang, W.K. Kong, J. You and M. Wong, "On- line palm print identification", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 9, pp. 1041- 1050, 2003.
[8] T. Connie, A.T.B. Jin, M.G.K. Ong and D.N.C. Ling, "An automated palmprint recognition system", Image and Vision Computing, vol. 23, no. 5, pp. 501-515, 2005.
[9] C.C. Han, "A hand-based personal authentication using a coarse-to-fine strategy", Image and Vision Computing, vol. 22, no. 11, pp. 909-918, 2004.
[10] C.C. Han, H.L. Cheng, C.L. Lin and K.C. Fan, "Personal authentication using palm-print features", Pattern Recognition, vol. 36, no. 2, pp. 371-381, 2003.

Abstract:The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multi-hop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose and evaluate the secure message transmission (SMT) protocol and its alternative, the secure single-path (SSP) protocol. Among the salient features of SMT and SSP is their ability to operate solely in an end-to-end manner and without restrictive assumptions on the network trust and security associations. As a result, the protocols are applicable to a wide range of network architectures. We demonstrate that highly reliable communication can be sustained with small delay and small delay variability, even when a substantial portion of the network nodes systematically or intermittently disrupt communication. SMT and SSP robustly detect transmission failures and continuously configure their operation to avoid and tolerate data loss, and to ensure the availability of communication. This is achieved at the expense of moderate transmission and routing overhead, which can be traded off for delay. Overall, the ability of the protocols to mitigate both malicious and benign faults allows fast and reliable data transport even in highly adverse network environments.
Keywords: Secure Message Transmission, Multi-path Routing, Secure Routing, Secure Routing Protocol , Fault tolerance, mobile ad hoc network (MANET) security, network security, secure data transmission.

[1] P. Papadimitratos and Z.J. Haas, ―Secure Routing for Mobile Ad Hoc Networks,‖ in Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, Jan. 27-31, 2002.

[2] P. Papadimitratos, Z.J. Haas, and P. Samar, ―The Secure Routing Protocol (SRP) for Ad Hoc Networks,‖ Internet Draft, draft-papadimitratos-secure-routing-protocol-00.txt, Dec. 2002.

[3] M.O. Rabin, ―Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,‖ Journal of ACM, Vol. 36, No. 2, pp. 335-348, Apr. 1989.

[4] H. Krawczyk, M. Bellare, and R. Canetti, ―HMAC: Keyed- Hashing for Message Authentication,‖ RFC 2104, Feb. 1997.

[5] P. Papadimitratos and Z.J. Haas, ―Secure Link State Routing for Mobile Ad Hoc Networks,‖ in Proceedings of the IEEE CS Workshop on Security and Assurance in Ad hoc Networks, in conjunction with the 2003 International Symposium on Applications and the Internet, Orlando, FL, Jan. 2003.

[6] A. Tsirigos and Z.J. Haas, ―Multipath Routing in the Presence of Frequent Topological Changes,‖ IEEE Comm. Magazine, pp. 132-138, Nov. 2001.

[7] J. Broch, D.A. Maltz, D.B. Johnson, Y-C. Hu, J. Jetcheva, ―A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,‖ in proceedings of the 4th International Conference on Mobile Computing (Mobicom'98), 1998.

[8] ―Secure on-demand distance-vector routing in ad hoc networks,‖ in Proc. 2005 IEEE Sarnoff Symp., Princeton, NJ, Apr. 2005, pp. 168–171.

[9] S. Kent and R. Atkinson, ―Security architecture for the Internet protocol,‖ IETF, RFC 2401, Nov. 1998. [10] ―IP authentication header,‖ IETF, RFC 2402, Nov. 1998..

Abstract:Agile methods were developed to overcome shortcomings and weaknesses in conventional software engineering. It can provide important benefits, but it is not applicable to all projects. In today economy, it is always difficult and impossible to predict how a computer-based system (e.g. a web based application) will evolve as time passes. It is really difficult to define or fix requirements fully before the project begins. So our main aim is to explore all the ways by which we can use agile method in software development to execute the project successfully within time.
Keywords: XP- Xtreme Programming. CRC – Class-responsibility collaboration

[1] Advanced Development Methods, Inc. "Origins of Scrum"

[2] The agile Alliance Home Page, http://www.agilealliance.org/home

[3] Cockburn, A., and Agile Software Devlopment, Addision-Wesley 2002.

[4] Software Engineering – Roger S . Pressman

Abstract:Data mining has attracted a great deal of attention in the information industry and in society as a whole in recent years, due to the wide availability of huge amounts of data and the imminent need for turning such data into useful information and knowledge. The information and knowledge gained can be used for applications ranging from market analysis, fraud detection, and customer retention, to production control and various explorations. The aim of this paper is to explore the role of data mining for information extraction in web content, structure and usages mining in current web models, and the outlines the process of extracting patterns from data. This paper also present data mining primitives, from which data mining query languages can be designed. Issues regarding how to integrate a data mining system with a database or data warehouse are also discussed. In addition to studying a classification of data mining systems, and it's challenging research issues for building data mining tools of the future.
Keywords: Data Mining, Information Extraction, Knowledge discovery, Web mining

[1]. Ramakrishna, Gowdar et al ‖Web Mining: Key Accomplishments, Applications and Future Directions‖, in the International
Conference on Data Storage and Data Engineering 2010.
[2]. Jiawei Han,Kevin,Chen-Chuan Chang "Data Mining for Web Intelligence" IEEE International Conference on Data Mining, 2002.
[3]. S. Chaudhuri and U. Dayal, ―An Overview of Data Warehousing and OLAP Technology,‖ SIGMOD Record, vol. 26, no. 1, 1997, pp. 65-74.
[4]. S. Brin and L. Page, ―The Anatomy of a Large-Scale Hypertextual Web Search Engine,‖ Proc. 7th International World Wide Web
Conf. (WWW98), ACM Press, New York, 1998, pp. 107-117.
[5]. J. Srivastava et al., ―Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data,‖ SIGKDD Explorations,
vol. 1, no. 2, 2000, pp. 12- 23.
[6]. Qingyu Zhang and Richard s. Segall,‖ Web mining: a survey of current research, Techniques, and software‖, in the Internationa l
Journal of Information Technology & Decision Making Vol. 7, No. 4 (2008) 683–720
[7]. Q. Yang and X. Wu, 10 challenging problems in data mining research, International Journal Information Technology Decision
Making 5(4) (2006) 597–604
[8]. Kosala and Blockeel, ―Web mining research: A survey,‖ SIGKDD:SIGKDD Explorations: Newsletter of the Special Interest Group (SIG) on Knowledge Discovery and Data Mining, ACM, Vol. 2, 2000
[9]. Semantic Web Mining: State of the art and future directions‖ Web Semantics: Science, Services and Agents on the World Wide
Web, Volume 4, Issue 2, June 2006, Pages 124-143
[10]. Yu-Hui Tao, Tzung-Pei Hong, Yu-Ming Su,‖ Web usage mining with intentional browsing data‖ in international journal of Expert Systems with Applications 34 (2007) 1893–1904

Abstract:Many document image binarization algorithms have previously been proposed for enhancing the performance of degraded document image binarization. This paper reviews algorithms for document image binarization. All of the algorithms have some advantages and disadvantages. To remove the drawbacks in this paper a combined approach is proposed that first combines different types of global and local thresholding techniques and then combines with the laplacian energy technique by logical OR operation. Experimentally the performance of the combined binarization technique is evaluated for both handwritten and printed degraded documents. The results showed that the performance of the proposed combined technique is better than some other techniques..
Keywords:image binarization, combination of binarization techniques, thresholding.

[1] Otsu, N. , A threshold selection method from gray-level histograms, IEEE transaction on system, man and cybernetics SMC-8,
pages 62-66.
[2] Kittler, J., Illingworth, J., Minimum error thresholding, Pattern recognition 19(1), pages 41-47.
[3] Niblack, W., An Introduction to Digital Image Processing, Prentice Hall, Englewood Cliffs, NJ, pages 115–116.
[4] L. O'Gorman, Binarization and multithresholding of document images using connectivity, CVGIP: Graph. Models Image
Processing 56 (6) (1994) 496-506.
[5] Y. Liu, R. Fenrich, S.N. Srihari, An object attribute thresholdingalgorithm for document image binarization, International
Conference on Document
[6] Analysis and Recognition, ICDAR '93, Japan, 1993, pages 278-281.
[7] B. Gatos, I.Pratikakis, and S. J. Perantonis, Efficient banarization of historical and degraded document image, In Int. Workshop on
Document Analysis and Systems, pages 447-454, 2008.
[8] B. Gatos, I.Pratikakis, and S. J. Perantonis, Inproved document image binarization by using a combination of multiple binarization
techniques and adapted edge information, Int. Conference on Pattern Recognition, pages 1-4, 2008.
[9] Bolan Su, Shijian Lu, and Chew Lim Tan, Combination of Document Image Binarization Techniques, 2011 International
Conference on Document Analysis and Recognition (ICDAR),
E. Badeks, N. Papamarkos, Optimal Combination of Document Binarization Techniques Using a Self-organizing Map Neural
Network, EngineeringApplication of Artificial Intelligence, vol. 20, pages 11-24, 2007.
[10] Nicholas R. Howe, A laplacian energy for document binarization, 2011 International Conference on Document Analysis and
Recognition..

Abstract:In answer set programming, the existence of an answer set for a logic program is not guaranteed. In order to remedy this problem, an incremental answer sets have been introduced. In this paper a concept of a justified answer set is introduced. The idea is to obtain a construct similar to justified extensions of default theories with a semi-monotonicity fixed point operator, and similarly to the concept of incremental answer sets to guarantee existence of an extension. Furthermore, at the level of fixed-points, we establish a one-to-one correspondence between justified answer sets of a logic program and justified extensions of the default theory.
Keywords: Default Theory, Fixed-Points, Justified Answer Set, Logic Program, Semi-Monotonicity Property.

[1] Baral, C. 2003. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press.
[2] Bidoit, N., and Froidevaux, C. 1987. Minimalism subsumes default logic and circumscription in stratified logic programming. 89–
97. IEEE Computer Society.
[3] Bidoit, N., and Froidevaux, C. 1991. Negation by default and unstratifiable logic programs. Theoretical Computer Science
78(1):85–112.
[4] Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. Plenum Press. 293– 322.
[5] Delgrande, J.; Gharib, M.; Mercer, R.; Risch, V.; and Schaub, T. 2003. Łukaszewicz-style answer set programming: A preliminary
report. In De Vos, M., and Provetti, A., eds., Proceedings of the Second International Workshop on Answer Set Programming
(ASP'03), volume 78 of CEURWorkshop Proceedings.
[6] Dix, J. 1991. Classifying semantics of logic programs. In A. Nerode, W. M., and Subrahmanian, V. S., eds., Proceedings of the first
International Workshop on logic Programming and Non-monotonic Reasoning, 166–180.
[7] Gebser, M.; Gharib, M.; Mercer, R. E.; and Schaub, T. 2009. Monotonic answer set programming. Journal of Logic and
Computation 19(4):539 -564.
[8] Gebser, M.; Gharib, M.; and Schaub, T. 2007. Incremental answer sets and their computation. In Costantini, S., and Watson, R.,
eds., Proceedings of the Fourth International Workshop on Answer Set Programming (ASP'07), 161–174.
[9] Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and deductive databases. 9:365–385. Gharib, M.; Mercer,
R.; and Schaub, T. 2007. Incremental answer set programming: A preliminary report. In Costantini, S., and Watson, R., eds.,
Proceedings of the Fourth International Workshop on Answer Set Programming (ASP'07), 149–160.
[10] Lifschitz, V. 1996. Foundations of logic programming. In Brewka, G.,ed., Principles of Knowledge Representation. CSLI
Publications. 69–127.

Abstract:In the present paper wireless senser network for hierarchical network protocol of LEACH and HEED this is theory concept that how to data gathering. Our protocol aims to dynamically change the data Gathering period according to the Gathering quality. The timing scheme will find the minimum Gathering period that satisfies the sink's request. This protocol is work on this and how to easy maintain from both of them. The LEACH (low energy adaptive clustering hierarchy) protocol presented in is an elegant solution where clusters are formed to fuse data before transmitting to the base station. We propose a new energy-efficient approach for clustering nodes in adhoc sensor networks. Based on this approach, we present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. In both routing protocol we differ which is batter to use and give most of the point to cover in this paper.
Keywords: Data Gathering, LEACH, HEED.

[1] J. Al-Karaki, and A. Kamal, .Routing Techniques in Wireless Sensor Networks: A Survey., IEEE Commun-ications Magazine,
vol 11, no. 6, Dec. 2004,pp. 6-28.
[2] W. Heinzelman, A. Chandrakasan and H. Balakrishnan,"Energy-Efficient CommunicationProtocol for Wireless Mi- crosensor
Networks," Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS '00), January 2000.
[3] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishna
[4] K. Dasgupta, K. Kalpakis, and P. Namjoshi, "An Efficient Clustering-based Heuristic for Data Gathering and Gathering in Sensor Networks", IEEE 2003.
[5] E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, "In- Network Gathering Techniques for Wireless Sensor Networks: A Survey", IEEE Wireless communication 2007.
[6] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless
Microsensor Networks," IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660- 670, Oct. 2002.
[7] N.M. Elshakankiri, N. M. Moustafa and Y. H. Dakroury, ―Energy Efficient Routing Protocol for Wireless Sensor Network ‖ in IEEE InternationalConference on pp. 393–398,December 2008.
[8] J. Al-Karaki, and A. Kamal, .Routing Techniques in Wireless Sensor Networks: A Survey., IEEE Commun-ications Magazine, vol 11, no. 6, Dec. 2004,pp. 6-28. 11.)Jamil Ibriq and lmad Mahgoub, . Cluster-based Routing in Wireless Sensor Networks: Issues and Challe- nges., SPECTS.04, pp. 759-766.
[9] W. R. Heinzelman, "Application-specific protocol architectures for wireless networks", PhD Thesis, Massachusetts Institute of Technology, June 2000.
[10] C. Intanagonwiwat, R. Govindan and D. Estrin, "Directed Diffusion: A Scalable and robust communication paradigm for sensor networks," Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (MobiCOM '00), August 2000