IOSR Journal of Computer Engineering (IOSR-JCE)

Volume 10- Issue 5

Paper Type : Research Paper
Title : Optimization of FCFS Based Resource Provisioning Algorithm for Cloud Computing
Country : India
Authors : Aditya Marphatia, Aditi Muhnot, Tanveer Sachdeva, Esha Shukla, Prof. Lakshmi Kurup
: 10.9790/0661-1050105      logo

Abstract: In our project, we propose an optimized version of the FCFS scheduling algorithm to address the major challenges of task scheduling in cloud. The incoming tasks are grouped on the basis of task requirement like minimum execution time or minimum cost and prioritized (FCFS manner). Resource selection is done on the basis of task constraints using a greedy approach. The proposed model will be implemented and tested on simulation toolkit. We intend to create a module depicting the normal FCFS algorithm in comparison to our optimized version algorithm for resource provisioning in the cloud.

Keywords - Cloud computing, FCFS, module, resource, scheduling

[1] IEEE/ACM Int. Conf. On Grid Computing (Grid 2008)

[2] 85-94, 2008.[11]Grosu, D., Das, A., "Auction-Based Resource Allocation Protocols In Grids", 16th Iasted International Conference On Parallel And Distributed Computing And Systems, 2004.

[3] Izakian, H., Ladani, B.T., Zamanifar, K., Abraham, A., Snasel, V., "A Continuous Double Auction Method For Resource Allocation In Computational Grids", IEEE Symposium On Computational Intelligence In Scheduling, 2009, Pp. 29-35, 2009.

[4] H. Izakian, A.Abraham, B. Tork Ladani. An Auction For Resource Allocation In Computational Grids .Future Gneration Computer Systems Vol 26 ,Pp 228–, 2011.

[5] Xiaohong Wu At La. Cloud Computing Resourceallocation Mechanism Research Based On Reverseauction. Energy Procedia Vol 13, 2011 ,Pp 736–741

[6] I. Fujiwara. Applying Double-Sided Combinational Auctions To Resource Allocation In Cloud Computing, IEEE 10th Annual International Symposium On Applications And The Internet, 2010.

[8] Adabi, S., Movaghar, A., Rahmani, A., M., Beigy, H.,Market-Based Grid Resource Allocation Using New Negotiation Model", Journal Of Network Andcomputer Applications, 2012.


Paper Type : Research Paper
Title : Peer To Peer Content Sharing On Wi-Fi Network For Smart Phones
Country : India
Authors : Pradnya Mate, Snehal Dhamale, Pranita Ohal, Ruchi Pawar
: 10.9790/0661-1050609      logo

Abstract: Peer-to-Peer (P2P) communications and its applications have become conventional architecture in the wired network environment. However, they have not been effectively adapted to the ensemble mobile environment which composed of various devices such as smart mobiles devices, laptops, and device with embedded software. In P2P systems, each node can act as a client and as a server at the same time and shares with others its own data. Our contribution consists in designing, implementing and testing a BitTorrent like application adapted to wireless ad-hoc networks of Android Mobile Phones. The employment of P2P protocols and applications in the platform of the ensemble mobile environment is becoming a promising solution which permits a wide number of users to share their own contents (data, audio, video, etc.) and communicate with each other without using costly and centralized network infrastructure. By using a central server, the peers will be able to get the information about the contents of other peers. Even in the absence of the Internet, the mobile devices provide users with the potential opportunity to connect in ad-hoc manner via short range wireless protocol such as Wi-Fi.

Keywords- Peer to peer computing, mobile ad hoc networks, wireless communication, Wi-Fi, multimedia communication.

[1] "Framework for Enhancing P2P Communication Protocol on Mobile Platform", Waheb A. Jabbar, M. Ismail, R. Nordin.
[2] "Architectural Model for Wireless Peer-to-Peer (WP2P) File Sharing for Ubiquitous Mobile Devices", O.O.Abiona, A.I.Oluwaranti ,T.Anjali,C.E.Onime,E.O.Popoola,G.A.Aderounmu,A.O.Oluwatope and L.O.Kehinde, 978-1-4244-3355-1/09/$25.00 ©2009 IEEE.
[3] "BlueStreaming:Towards Power-Efficient Internet P2P Streaming to Mobile Devices",You Liu,Fei Li, Lei Guo,Yang Guo, Songqing Chen. MM'11, November 28–December 1, 2011, Scottsdale, Arizona, USA.Copyright 2011 ACM 978-1-4503-0616-4/11/11 ...$10.00.
[4] "Broadcast-Based Peer-To-Peer Collaborative Video
[5] Streaming Among Mobiles",Man-Fung Leung and S.-H Gray Chan,2007. IEEE TRANSACTIONS ON BROADCASTING, VOL. 53, NO. 1, MARCH 2007
[6] "Quality of Data Delivery in Peer-to-Peer Video Streaming",XIAOSONG LOU and Kai HWANG,University of Southrn California,ACM Transactions on Multimedia Computing,Communication and Applications,Vol.8S,No.1,Article 12,Publication date:February 2012.
[7] "Peer to Peer Content Sharing on Ad Hoc Networks of Smartphones", Piotr K.Tysowski, Pengxiang Zhao, Kshirasagar Naik. 978-1-4577-9538-2/11/$26.00 ©2011 IEEE.
[8] "Clustering and Sharing Incentives in BitTorrent Systems",Arnaud Legout,I.N.R.I.A.,SophiaAntipolis,France,arnaud.legout@sophia.inria.fr,Nikitas Liogkas ,Eddie Kohler,Lixia Zhang,University of California,Los Angeles,CA USA,{nikitas,kohler,lixia}@cs.ucla.edu. SIGMETRICS'07, June 12–16, 2007, San Diego, California, USA ,Copyright 2007 ACM 978-1-59593-639-4/07/0006 ...$5.00.
[9] "P2P File Sharing on Mobile Phones: Design and Implementation of a Prototype", Claudio E. Palazzi, Armir Bujari, Emanuele Cervi ,Dipartimento di Matematica Pura e Applicata, ,Università di Padova, Padova,Italycpalazzi@math.unipd.it,abujari@studenti.math.unipd.it, ecervi@studenti.math.unipd.it
[10] "A Peer-to-Peer File Resource Sharing System for Mobile Devices ",Chao-Tung Yang , Chun-Jen Chen, Hung-Yen Chen ,High-Performance Computing Laboratory ,Department of Computer Science and Information Engineering ,Tunghai University, Taichung, 40704, Taiwan R.O.C. ctyang@thu.edu.tw, 978-0-7695-3177-9/08 $25.00 © 2008 IEEE DOI 10.1109/GPC.WORKSHOPS.2008.75


Paper Type : Research Paper
Title : A Study on Wearable Gestural Interface – A SixthSense Technology
Country : India
Authors : Rakesh D. Desale, Vandana S. Ahire
: 10.9790/0661-1051016      logo

Abstract: SixthSense technology is a wearable gestural interface that links the physical world around us with digital information and allows us to use our natural hand gestures to communicate with the digital information. SixthSense Technology is comprised of mini-projector which is connected to a camera and a cell phone - that acts as a computer which is connected to Cloud. The information is stored on the web. SixthSense can also obey our natural hand gestures. The camera senses objects around us immediately, with the micro-projector spreads the information on any surface, including the object itself or hand. There are number of applications of the device, it is portable and easy to carry as we can wear it in our neck.

Keywords – Camera, Color Markers, Mirror, Mobile Phone, Pocket Projector

[1] Communication and Computational Intelligence (INCOCCI), 2010 International Conference on 27-29 Dec. 2010, 336-339, Erode, INSPEC Accession Number: 11887446, Current Version: 24 March 2011.
[2] Intelligent Agent Technology, 2006. IAT'06. IEEE/WIC/ACM International Conference on 18-22 Dec. 2006, pp 191-194 Hong Kong, ISBN: 0-7695-2748-5, INSPEC Accession Number: 10208238 Digital Object Identifier: 10.1109/IAT.2006.111.
[3] Steve Mann with Hal Niedzviecki, "Cyborg: Digital Destiny and Human Possibility in the Age of the Wearable Computer", ISBN 0385658257 (Hardcover), Random House Inc, 304 pages, 2001.
[4] John Wiley and Sons, Intelligent Image Processing, pp. 384,02001NOV02, ISBN 0-471-40637-6 sixthsense, Pranav Mistry.
[5] Aastha, Rashmi, Sakshi Bhatia and Geeta Rani, "Sensing the Sixth Sense Technology", International Journal of Information Technology and Knowledge Management January-June 2012, Volume 5, No. 1, pp. 201-204
[6] S. Sadhana Rao, "Sixth Sense Technology", Proceedings of the International Conference on Communication and Computational Intelligence – 2010, Kongu Engineering College, Perundurai, Erode, T.N.,India.27 – 29 December,2010.pp.336-339.
[7] Amit Kumar Gupta and Mohd Shahid, "The Sixth Sense Technology", Proceedings of the 5th National Conference; INDIACom-2011 Computing For Nation Development, March 10 – 11, 2011, Bharati Vidyapeeth's Institute of Computer Applications and Management, New Delhi
[8] P. Mistry, P. Maes. "SixthSense – A Wearable Gestural Interface". In the Proceedings of SIGGRAPH Asia 2009, Sketch. Yokohama, Japan. 2009
[9] P. Mistry, P. Maes. "SixthSense – A Wearable Gestural Interface". In the Proceedings of SIGGRAPH Asia 2009, Emerging Technologies. Yokohama, Japan. 2009
[10] P. Mistry, P. Maes, L. Chang. "WUW - Wear Ur World - A Wearable Gestural Interface". In the CHI '09 extended abstracts on Human factors in computing systems. Boston, USA. 2009


Paper Type : Research Paper
Title : A Survey on Data Mining
Country : India
Authors : Balamurugan.V
: 10.9790/0661-1051720      logo

Abstract: Data mining helps end users extract useful business information from large databases. Data mining is used to build a predictive model. Data Mining is used to find the hidden information form the large databases. Data Mining is also called as knowledge Discovery. It is the process of analyzing data from different perspectives and summarizing it into useful information. Data mining has not only applied effectively in business environment but also in other fields such as weather forecast, medicine, transportation, healthcare, insurance, government and etc., data mining also has its own disadvantages as well such as privacy, security and misuse of information. We will examine the advantage and disadvantages of data mining in different industries.

Keywords— mining, mining methods and algorithms.

[1] Data Mining Concepts and Techniques – Jiawei Han & Micheline Kamber

[2] Modern Data Warehousing, Mining and Visualization Core Concepts by George

[3] http://www.thearling.com/text/dmwhite/dmwhite.htm

[4] http://www.rimtengg.com/coit2007/proceedings/pdfs/94.pdf


Paper Type : Research Paper
Title : Review On Google Android a Mobile Platform
Country : India
Authors : Shyam Bhati, Sandeep Sharma, Karan Singh
: 10.9790/0661-1052125      logo

Abstract: At present smart phone usage is increasing dramatically. Globally, if a usage comparison can be carried out between cell phone and smart phone devices. Smart phone is a personnel device which provides entertainment, information, making call and writing SMS. Customization makes cell phone a smart phone (installation and uninstallation of application). The increasing importance of smart phone devices has triggered intense competition among technology giants to capture the bigger market share for mobile platform. So Google launched Android, an open source mobile platform for smart phone devices consisting of a Linux Kernel, runtime environment, development framework, libraries and key applications. Since its official public release, Android has captured the market. This paper intends to explore conventional approach of mobile application execution, an approach of mobile application execution in Android & comparison between Android OS (Google), iOS (Apple) & Blackberry OS (RIM).

Keywords - Android, iOS, Blackberry, Open source mobile platform.

[1] Ki-Cheol Son, Prof. Jong-Y eol Lee," The Method of Android Application Speed up by using NDK"

[2] Robi Grgurina, Goran Brestovac, Tihana Galinac Grbac,"Development Environment for Android Application Development: an Experience Report", University of Rijeka, MIPRO 2011, May 23-27, Opatija, Croatia

[3] Ryan Johnson, Zhaohui Wang, Corey Gagnon, Angelos Stavrou," Analysis of Android Applications' Permissions", Sixth International Conference on Software Security and Reliability Companion, IEEE, 2012

[4] Nisarg Gandhewar, Rahila Sheikh," Google Android: An Emerging Software Platform For Mobile Devices", Nisarg Gandhewar et al. / International Journal on Computer Science and Engineering (IJCSE), ISSN : 0975-3397, 2010

[5] Jianye Liu, Jiankun Yu, "Research on Development of Android Applications", Fourth International Conference on Intelligent Networks and Intelligent Systems, IEEE, 2011

[6] Xiangling Fu, Xiangxiang Wu, Maoqiang Song, Mian Chen," Research on Audio/Video Codec Based on Android", IEEE, 2010

[7] Android Market. https://market.android.com


Paper Type : Research Paper
Title : Achieving data integrity by forming the digital signature using RSA and SHA-1 algorithm
Country : India
Authors : Isha Shingari, Sourabh Singh Verma
: 10.9790/0661-1052631      logo

Abstract: Technology has been touching our lives in almost every domain. With the advent of modern technologies, the need of enhancing its security also arises. Data security has become one of the most important issues of concern. Data security is achieved with the help of adapting certain security measures. Here, in this paper we have analyzed the various cryptographic concepts. Encryption and decryption are two most important aspects of cryptography and data security. The special light has been thrown on data integrity and protection issues. The RSA algorithm has been explained. The implementation of the algorithm has also been given with the help of proving a graphical interface. The data integrity has been established at the client and receiver end by not limiting it to a standalone application.

Keywords: cryptography, data security, information security, data integrity, RSA, SHA-1, client/server

[1] http://en.wikipedia.org/wiki/Information_security [2] modern cryptography theory and practice , chapter 10, 10.1 section
[3] Introduction to Cryptography By Mohan Atreya (matreya@rsasecurity.com)
[4] Boneh, Dan (1999). "Twenty Years of attacks on the RSA Cryptosystem". Notices of the American Mathematical Society 46 (2): 203–213.


Paper Type : Research Paper
Title : Discovering Frequent Patterns with New Mining Procedure
Country : India
Authors : Poonam Sengar , Prof. Mehul Barot
: 10.9790/0661-1053237      logo

Abstract: Efficient algorithm to discover frequent pattern are crucial in data mining research. Finding frequent itemsets is computationally the most expensive step in association rule discovery .To address these issues we discuss popular techniques for finding frequent itemsets in efficient way. In this paper we provide the survey list of existing frequent itemsets mining techniques and proposing new procedure which having some advantages by comparing with the other algorithms.

Keywords— Association rules, data mining, frequent itemsets ,FPM, minimum support.

[1] Agrawal, R. Imielinski, T. and Swami. Mining Association Rules between Sets of Items in Large Databases, Proc. of ACM SIGMOD, Washington DC, 22:207-216, ACM Press
[2] Agrawal, R. and Srikant, R. Fast Algorithms for Mining Association Rules in Large Databases, Proc. 20th Intl Conf. Very Large Data Bases, pp. 478-499, Sept. 1944.
[3] Park, J.S. Chan, M. and Yu, P.S. An Effective Hash-based Algorithm for Mining Association Rules, In Proc. of ACM SIGMOD, pp. 175-186. ACM, May 1995.
[4] Brin, S. Motwani, R. Ullman, J. and Tsur, S. Dynamic itemset counting and implication rules for market basket data, In Proc. of ACM SIGMO, pp.225-264, 1997.
[5] Han, J. Pei, J. and Yin, Y. Mining Frequent Patterns without Candidate Generation, Proc. of ACM SIGMOD Conf., Dallas, TX, 2000
[6] C.Borgelt; , "Efficient Implementations of Apriori and Eclat," In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations, CEUR Workshop Proceedings 90, Aachen, Germany, 2003
[7] Kumar, A.V.S.; Wahidabanu, R.S.D.; , "A Frequent Item Graph Approach for Discovering Frequent Itemsets," Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on , vol., no., pp.952-956, 20-22 Dec. 2008
[8] Hai – Tao He; Hai - Yan Cao; Rui-Xia Yao; Jia-Dong Ren; Chang-Zhen Hu; , "Mining frequent itemsets based on projection array," Machine Learning and Cybernetics (ICMLC), 2010 International Conference on , vol.1, no., pp.454-459, 6-14 July 2010


v
Paper Type : Research Paper
Title : Intrusion Detection Techniques In Mobile Networks
Country : India
Authors : M.Senthilkumar, S.Saminathan
: 10.9790/0661-1053845      logo

Abstract: The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. The recent denial of service attacks on major Internet sites have shown us, no open computer network is immune from intrusions. The wireless ad-hoc network is particularly vulnerable due to its features of open medium, dynamic changing topology, cooperative algorithms, lack of centralized monitoring and management point, and lack of a clear line of defense. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective. Many intrusion detection techniques have been developed on fixed wired networks but have been turned to be inapplicable in this new environment. We need to search for new architecture and mechanisms to protect wireless networks and mobile computing application. In this paper, we examine the vulnerabilities of wireless networks and say that we must include intrusion detection in the security architecture for mobile computing environment. We have showed such architecture and evaluated key mechanisms in this architecture such as applying mobile agents to intrusion detection, anomaly detection and misuse detection for mobile ad-hoc networks.

Keywords – Algorithm, Architecture, Computing Network, Dynamic Changing Topology, Wireless Networks.

[1]. Sundaram A., "An Introduction to Intrusion Detection", http://www.acm.org/crossroads/xrds2-4/intrus.html
[2]. Marti S., Giuli T.J., Lai K. Baker M., "Mitigating Routing Misbehavior in Mobile Ad Hoc Networks", Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM 2000, pp 255-265.
[3]. Andrew B.Smith, An Examination of an Intrusion Detection Architecture for eless Ad-Hoc Networks.
[4]. C. Krugel , T.Toth. , Applying Mobile Agent Technology to Intrusion Detection
[5]. Kumar.S "Classification and Detection of Computer Intrusion ".


Paper Type : Research Paper
Title : A New Approach of Protein Sequence Compression using Repeat Reduction and ASCII Replacement
Country : Bangladesh
Authors : S.M. Rafizul Haque, Tania Mallick, Iffat Sania Kabir
: 10.9790/0661-1054651      logo

Abstract: Protein sequences have been considered for a long time as highly complex sequences from the informational content point of view. We study about the randomness of protein and difficulty of protein compression. In this report, we propose a lossless compression method to reduce the random or repeated sequence of protein. Our proposed method is the enhancement of Dictionary Based Algorithm proposed by D. Adjeroh and F. Nan. They have shown better result in compressing protein. Our repeat reduction method shows improved results in compressing three types of protein sequences from MJ (Methanococcus jannaschii), HI (Haemophilus influenzae) and HS (Homo sapiens). The experimental results demonstrate that the performance of the proposed method is superior compared to Dictionary based algorithm.

Keywords: Proteins, protein compression, repeat reduction, protein sequence, repeat, ASCII replacement.

[1] Craig G. Nevill-Manning and Ian H. Witten, "Protein is incompressible", in proceeding of The Data Compression Conference (DCC‟99), pp 257-266, Snowbird, Utah, USA, March 1999.

[2] Andrea Hategan and Ioan Tabus,"Protein is compressible", in proceeding of the 6th Nordic Signal Processing Symposium (NORSIG 2004), pp 192-195, Espoo, Finland, June 2004.

[3] Donald Adjeroh and Fei Nan, "On compressibility of Protein sequence", in proceeding of The Data Compression Conference (DCC‟06), pp 422-434, Snowbird, Utah, USA, March 2006.

[4] T. Matsumoto, K. Sadakane and H. Imai, "Biological Sequence Compression Algorithms" In proceeding of The Data Compression Conference (DCC‟07), pp 43-52,Snowbird,Utah, USA, March 2007.
[5] A. Hategan and I. Tabus, "Detecting local similarity based on lossless compression of Protein sequences", in International workshop on Genomic Signal Processing 95, 2005.


Paper Type : Research Paper
Title : Monitoring the Spread of Active Worms in Internet
Country : India
Authors : Mr.V.Senthilkumar , M.Tech IT , Mrs.P.Chitrakala, Asst Prof
: 10.9790/0661-1055255      logo

Abstract: As far as security is concerned compromised system plays a vital role i.e., system connected with a network and which is used to send spamming, malware, identity theft etc. A System is developed mainly to focus on detection of compromised machines which is already being affected by hacker or cracker and used for anti social activities. We have developed an effective solution for detecting compromised system named "SPOT". SPOT uses SPRT (Sequence probability ratio test) which has false positive and false positive error rates. This SPOT is an effective and efficient system in detecting compromised machines in the network. To implement a single remote address corresponds to a malicious scanner which works good in internet environments. The main objective are effectively identifying the spam zombies and Denial of Services attack using SPOT without any botnet spam signatures techniques on the network. Keywords- Compromised machines, Malicious scanner, Spam filter, Machine creation, dynamic ip, Spam zombies.

[1] J.S.Bhatia, R.K.Sehgal and Sanjeev Kumar, "Botnet Command detection using Virtual Honeypot," International journal of Network Security & its applications(IJNSA), Vol.3, No.5, Sep 2011.
[2] Z. Chen, C. Chen, and C. Ji, "Understanding Localized-Scanning Worms," Proc. IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '07), 2007.
[3] Z. Duan, Y. Dong, and K. Gopalan, "DMTP: Controlling Spam through Message Delivery Differentiation," Computer Networks, vol. 51, pp. 2616-2630, July 2007.
[4] A. Ramachandran and N. Feamster, "Understanding the Network-Level Behaviour of Spammers," Proc. ACM SIGCOMM, pp. 291-302, Sept. 2006.
[5] F. Sanchez, Z. Duan, and Y. Dong, "Understanding Forgery Properties of Spam Delivery Paths," Proc. Seventh Ann. Collaboration, Electronic Messaging, Anti-Abuse and Spam Conf. (CEAS '10), July 2010.
[6] Y.Xie, Fang Yu, kannan Achan, Rina Panigrahy, Geoff hulten, Ivan Osipkov," Spamming botnet signature and characteristics," Microsoft Research,2008
[7] Xianonam Zang, Athichart Tangpong, George Kesidis and David J.Miller," Botnet detection through fine flow classification," CSE Dept Technical Report No.CSE11-001, Jan 2011.


Paper Type : Research Paper
Title : Auto Finding and Resolving Distributed Firewall Policy
Country : India
Authors : Arunkumar.k, Suganthi.B
: 10.9790/0661-1055660      logo

Abstract: In the network environment firewall is one of the protection layers. A firewall policy defines how an organization's firewalls should handle inbound and outbound network traffic for specific IP addresses and address ranges, protocols, applications, and content types based on the organization's information security policies. In this paper, we propose a set of firewall policy to support distributed environment of firewalls. We also represent a set of firewall policies to automatically detecting and resolving anomalies in the network layer. we adopt a rule-based segmentation technique to identify policy anomalies and derive effective anomaly resolutions. we demonstrate how efficiently our approach can discover and resolve anomalies with conflict packet and resolved packets.

Index terms- Firewall, policy anomaly management, access control, visualization tool, anomaly.

[1] M. Frigault, L. Wang, A. Singhal, and S. Jajodia, "Measuring Network Security Using Dynamic Bayesian Network," Proc. Fourth ACM Workshop Quality of Protection, 2008

[2] E. Al-Shaer and H. Hamed, "Discovery of Policy Anomalies in Distributed Firewalls," IEEE INFOCOM '04, vol. 4, pp. 2605-2616, 2004.

[3] J. Alfaro, N. Boulahia-Cuppens, and F. Cuppens, "Complete Analysis of Configuration Rules to Guarantee Reliable Network Security Policies," Int'l J. Information Security, vol. 7, no. 2, pp. 103- 122, 2008.

[4] A. Wool, "Trends in Firewall Configuration Errors: Measuring the Holes in Swiss Cheese," IEE internet computing, vol. 14, no. 4, pp. 58–65, 2010 [5] F. Baboescu and G. Varghese, "Fast and Scalable Conflict Detection for Packet Classifiers," Computer Networks, vol. 42, no. 6, pp. 717-735, 2003.

[6] E. Lupu and M. Sloman, "Conflicts in Policy-Based Distributed Systems Management," IEEE Trans. Software Eng., vol. 25, no. 6, Nov./Dec. 1999.

[7] I. Herman, G. Melanc¸on, and M. Marshall, "Graph Visualization and Navigation in Information Visualization: A Survey," IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 24-43, Jan.-Mar. 2000.

[8] H. Hu, G. Ahn, and K. Kulkarni, "Anomaly Discovery and Resolution in Web Access Control Policies," Proc. 16th ACM Symp. Access Control Models and Technologies, pp. 165-174, 2011.

[9] L. Yuan, C. Chuah, and P. Mohapatra, "ProgME: Towards Programmable Network Measurement," ACM SIGCOMM Computer Comm. Rev., vol. 37, no. 4, p. 108, 2007.

[10] L. Yuan, H. Chen, J. Mai, C. Chuah, Z. Su, P. Mohapatra, and C. Davis, "Fireman: A toolkit for firewall modeling and analysis," in ,2006IEEE Symposium on security and privacy, 2006, p. 15.


Paper Type : Research Paper
Title : Image encryption using chaotic sequence and its cryptanalysis
Country : India
Authors : Sagade A.G., Prof. Pratap Singh
: 10.9790/0661-1056164      logo

Abstract:MultiMedia is growing application in various areas ,security is an important issue in communication and storage of images and Encryption is a very common technique to uphold image security. Many encryption systems have been introduced among them; image encryption using chaotic sequence has many proposals. In this paper we analyze the security weakness of the proposal. We use chosen plain-text attack and known plain-text attack to reveal the secret parameters of the algorithm. That is to say, this method is not at all secure from the point of cryptography.

Keywords - Image encryption, Cryptography, Chaotic system, Encryption, Decryption.

[1] J.C.Yen, J.I.Guo, A new chaotic key-based design for image encryption and decryption in Proc. IEEE Int. Conf. Circuits and Systems, vol. 4, 2000, pp. 49–52

. [2] H.-C. Chen, J.-C. Yen, A new cryptography system and its VLSI realization, Journal of Systems and Architecture 49 (2003) 355–367.

[3] H.-C. Chen, J.-I. Guo, L.-C. Huang, J.-C. Yen, Design and realization of a new signal security system for multimedia data transmission, EURASIP Journal on Applied Signal Processing 2003 (13) (2003) 1291–1305.

[4] Zhang LH, Liao XF, Wang XB. An image encryption approach based on chaotic maps. Chaos, Solitons & Fractals2005;24: 759–65.

[5] Ercan Solak, Cryptanalysis of image encryption with compound chaotic sequence, 2009 6th International Multi-Conference on Systems, Signals and Devices, 978-1-4244-4346-8/09/ 2009 IEEE

[6] X. Tong, M. Cui, Image encryption with compound chaotic sequence cipher shifting dynamically, Image and Vision Computing 26 (2008) 843–850.

[7] S. Li, C. Li, G. Chen, N. G. Bourbakis, K. -T. Lo, A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks, Signal Processing: Image Communication, 23 (2008) 212–223.

8] Fangjun Huang, Information Security Research Based on Discrete Chaotic Theory [D], Huazhong University of Science and Technology,Wuhan, 2005.

[9] Bruce Schneier, Applied Cryptography – Protocols, algorithms,and souce code in C, John Wiley & Sons, Inc., New York, second edition, 1996.


Paper Type : Research Paper
Title : Scalable Transaction Management on Cloud Data Management Systems
Country : India
Authors : Salve Bhagyashri, Prof. Y.B.Gurav
: 10.9790/0661-1056574      logo

Abstract: Cloud computing is a model for enabling convenient, on -demand network access to shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort . As the problem of building scalable trans-action management mechanisms for multi-row transactions on key-value storage systems . For that purpose we develop scalable techniques for transaction management by using the snapshot isolation (SI) model. This SI model can give non-serializable transaction executions, we investigate two conflict detection techniques for ensuring serializability under SI. As getting importance of scalability, we investigate system models and mechanisms in which the transaction management functions are decoupled from the storage system and integrated with the application-level processes. We present two system models and demonstrate their scalability under the scale-out paradigm of Cloud com-putting platforms. In the first system model, all transaction management functions are executed in a fully decentralized manner by the application processes. The second model is based on a hybrid approach in which the conflict detection techniques are implemented by a dedicated service.

Keywords- cloud data, scalable transaction, SI model , serialization , decentralization.

[1] F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber, "Bigtable: A Distributed Storage System for Structured Data," ACM Trans. Computer. Syst., vol. 26, no. 2, pp. 1–26, 2008.
[2] B. F. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, Bohannon, H.-A. Jacobsen, N. Puz, D. Weaver, and R. Yer-neni, "Pnuts: Yahoo!‟s hosted data serving platform," Proc. VLDB Endow., vol. 1, pp. 1277–1288, August 2008.
[3] J. Baker, C. Bond, J. Corbett, J. J. Furman, A. Khorlin, Larson, J.-M. Leon, Y. Li, A. Lloyd, and V. Yushprakh, "Megastore: Providing scalable, highly available storage for interactive services," in CIDR, 2011, pp. 223–234.
[4] S. Das, D. Agrawal, and A. E. Abbadi, "G-store: a scalable data store for transactional multi key access in the cloud," in Proc. ACM Symp. on Cloud Computing , 2010, pp. 163–174.
[5] H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O‟Neil, and O‟Neil, "A critique of ANSI SQL isolation levels," in Proc. of ACM SIGMOD'95. ACM, 1995, pp. 1–10.
[6] A. Fekete, D. Liarokapis, E. O‟Neil, P. O‟Neil, and D. Shasha, "Making snapshot isolation serializable," ACM Trans. Database Syst., vol. 30, pp. 492–528, June 2005.
[7] M. Bornea, O. Hodson, S. Elnikety, and A. Fekete, "One-copy serializability with snapshot isolation under the hood," in IEEE ICDE'11, april 2011, pp. 625 –636.
[8] M. J. Cahill, U. Rohm,¨ and A. D. Fekete, "Serializable isolation for snapshot databases," ACM Trans. Database Syst., vol. 34, pp. 20:1–20:42, December 2009.
[9] S. Revilak, P. O‟Neil, and E. O‟Neil, "Precisely Serializable Snapshot Isolation (PSSI)," in ICDE'11, pp. 482–493.
[10] N. Chohan, C. Bunch, C. Krintz, and Y. Nomura, "Database-Agnostic Transaction Support for Cloud Infrastructures," in IEEE CLOUD'11, pp. 692 –699.


Paper Type : Research Paper
Title : Performance Evaluation of Filters for Enhancement of Images in Different Application Areas
Country : India
Authors : Yogendra Kumar Jain ,GARIMA SILAKARI
: 10.9790/0661-1057584      logo

Abstract: Contrast stretching is a method to enhance the image details. Histogram equalization is one of the most common spatial domain technique used for contrast enhancement. While stretching the contrast of an image , it results in the degradation of brightness of the image. To overcome this hurdle a method known as Bi-Histogram equalization was introduced to preserve the brightness level of the output image. As the contrast enhancement enhances the image , it also enhances the noise in the signal that causes the blurrness in the output image. The proposed BHEGF method reduces this drawback and provides more accurate and realistic results. In this paper we use four different types of filters i.e. median filter , gaussian filter , average filter & motion filter and various parameters such as processing time , MSE, brightness count and PSNR are used for performance evaluation.

Keywords: Bi- Histogram Equalization , Tri- histogram equalization ,BHEGF , Contrast enhancement , Gaussian filter , brightness preserving , Spatial and frequency domain

[1] R.Gonzalez and R. Woods, Digital image processing using MATLAB 5th ed. Pearson , 2009 .

[2] Y.-T. Kim, Contrast enhancement using brightness preserving bi histogram equalization, "IEEE Trans. On Consumer Electronics,vol. 43, no. 1, pp. 1-8, Feb. 1997.

[3] David Menotti, Laurent Najman, Jacques Facon, " Multi-histogram equalization methods for contrast enhancement and brightness preserving", "IEEE Trans. On Consumer Electronics, vol. 53, no. 3, Aug. 2007".

[4] P. Jagatheeswari, S. Suresh Kumar and M. Rajaram, " A novel approach for contrast enhancement based on histogram equalization followed by median filter", "ARPN Journal of Engineering and Applied Sciences, Vol. 4 , No. 7, Sep. 2009.

[5] M. Karaman, L. Onural, and A. Atalar, " Design and implementation of a general purpose median filter unit in CMOS VLSI ", " IEEE Trans." April. 1990.

[6] H.S.M.M. Hanif, M.Y. Mashor, Z. Mohamed, " Image enhancement and segmentation using dark stretching technique for Plasmodium Falciparum for thick blood smear", " IEEE Trans. 7th international colloquium on signal processing and its application 2011".

[7] Virendra P.Vishwakarma, Sujata Pandey," Adaptive histogram equalization and logarithm transform with rescaled low frequency DCT coefficients for illumination normalization"," IJRTE Vol. 1, May 2009".

[8] Balvant Singh, Ravi Shankar," Analysis of Contrast Enhancement Techniques For Underwater Image", " IJCTEE Vol 1. Issue 2."

[9] George Anastassopoulos, Ioannis Stephanakis, " Evaluation Of Histogram Enhancement Techniques Used In Conjunction With Wavelet Compression Methods For Improved Signal Processing Of Child Trauma Images" , " Seventh Australlian and New Zealand Intelligent Information System Conference , nov-2001".

[10] Ashwini Sachin Zadbuke, " Brightness Preserving Image Enhancement Using Modified Dualistic Sub Image Histogram Equalization" , " IJSER , Vol. 3, Issue 2. Feb-2012"


Paper Type : Research Paper
Title : Analysis of Various Attributes to Have a Secure Database
Country : India
Authors : Harpreet Saini, Dr.Kanwal Garg
: 10.9790/0661-1058589      logo

Abstract: The premise of this paper is to analyze the various attributes by which the performance of database can be improved as well as for security of database. This paper provides an overview about how user, database administrator, system etc. affects the database security and also its performance. Author will try to analyze which of the attribute is better than the other one among various categories of attributes in terms of system performance and user authentication.

Keywords:Authentication, Database, Security

[1] http://www.agiledata.org/essays/accessControl.html#DatabaseImplementationStrategiesretrieved on 30-03-2013.
[2] http://docs.oracle.com/cd/B14117_01/network.101/b10777/authuser.htm retrieved on 30-03-2013
[3] http://www.ehow.com/info_12011201_factors-affecting-performance-database.html retrieved on 01-04-2013
[4] http://docs.oracle.com/cd/B28359_01/server.111/b28310/secure001.htm retrieved on 02-04-2013
[5] http://www.personal.psu.edu/glh10/ist110/topic/topic07/topic07_04.html retrieved on 02-04-2013
[6] http://www.oracle-base.com/articles/misc/os-authentication.php retrieved on 10-04-2013
[7] http://www.brighthub.com/computing/smb-security/articles/61400.aspxretrieved on 11-04-2013
[8] http://docs.oracle.com/cd/B19306_01/server.102/b14220/security.htm#i13527 retrieved on 11-04-2013

[9] ChanderkantVerma "Soft Biometric: An Asset for Personal Recognition" published in the proceeding of international journal of computer science & communication technologies, ISSN 0974-3375,Vol-1,PP. 160-163, Jan 2009.


Paper Type : Research Paper
Title : Intranet Automation of Human Resource Management System
Country : India
Authors : Anand Kotasthane, Akshay Bahade, Kaustubh Chinchalkar, Prasad Gawande, Ms. P K Karmore
: 10.9790/0661-1059094      logo

Abstract: The main aim of the project is to develop a Human Resource Module for the Intranet Automation of HR Software for an organization. The module enhances good communication facilities between employees and HR Administrator. To allow the HR of an organization to update the employee details whenever there is a change in the employee profile pertaining to that organization. The objective of the project is to create a tool for HR department which helps it in giving confirmation to a recruited employee. HR department will have a CV and record of an employee's Interview in its database. Confirmation will be made on the basis of this data and a process known as SWOT.

Keywords - ASP.NET, HRMS, intranet, SQL, SWOT analysis

[1] B. Naga Jyothi, G.R. Babu and I.V. Murali Krishna, "Object Oriented and Multi-Scale Image Analysis: Strengths, Weaknesses, Opportunities and Threats-A Review", Journal of Computer Science 4 (9): 706-712, 2008.

[2] Sean A. Way, James W. Thacker, "The successful implementation of strategic human resource management practices: A Canadian survey", Published in the International Journal of Management, 2001, V-18, pp 25-32.

Books:

[1] "Let Us C#", By Yashwant Kanetkar and Asang Dani, BPB Publications, New Delhi, India.
[2] "SQL Server Express – A Complete Reference Guide", By Pinal Dave.


Paper Type : Research Paper
Title : 'Color to Gray and back' using normalization of color components with Cosine, Haar and Walsh Wavelet
Country : India
Authors : Dr. H. B. Kekre, Dr. Sudeep D. Thepade, Ratnesh N. Chaturvedi
: 10.9790/0661-10595104      logo

Abstract: The paper shows performance comparison of three proposed methods with orthogonal wavelet alias Cosine, Haar & Walsh wavelet using Normalization for 'Color to Gray and Back'. The color information of the image is embedded into its gray scale version using wavelet and normalization method. Instead of using the original color image for storage and transmission, gray image (Gray scale version with embedded color information) can be used, resulting into better bandwidth or storage utilization. Among three algorithms considered the second algorithm give better performance as compared to first and third algorithm. In our experimental results second algorithm for DCT wavelet using Normalization gives better performance in 'Color to gray and Back' w.r.t all other wavelet transforms in method 1, method 2 and method 3. The intent is to achieve compression of 1/3 and to print color images with black and white printers and to be able to recover the color information as and when required.

Keywords- Color Embedding, Color-to-Gray Conversion, Transforms, Wavelets Normalization , Compression

[1] T. Welsh, M. Ashikhmin and K.Mueller, Transferring color to grayscale image, Proc. ACM SIGGRAPH 2002, vol.20, no.3,
pp.277-280, 2002.
[2] A. Levin, D. Lischinski and Y. Weiss, Colorization using Optimization, ACM Trans. on Graphics, vol.23, pp.689-694, 2004.
[3] T. Horiuchi, "Colorization Algorithm Using Probabilistic Relaxation," Image and Vision Computing, vol.22, no.3, pp.197-202,
2004.
[4] L. Yatziv and G.Sapiro, "Fast image and video colorization using chrominance blending", IEEE Trans. Image Processing, vol.15,
no.5, pp.1120-1129, 2006.
[5] H.B. Kekre, Sudeep D. Thepade, "Improving `Color to Gray and Back` using Kekre‟s LUV Color Space." IEEE International
Advance Computing Conference 2009, (IACC 2009),Thapar University, Patiala,pp 1218-1223.
[6] Ricardo L. de Queiroz,Ricardo L. de Queiroz, Karen M. Braun, "Color to Gray and Back: Color Embedding into Textured Gray
Images" IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 15, NO. 6, JUNE 2006, pp 1464- 1470.
[7] H.B. Kekre, Sudeep D. Thepade, AdibParkar, "An Extended Performance Comparison of Colour to Grey and Back using the Haar,
Walsh, and Kekre Wavelet Transforms" International Journal of Advanced Computer Science and Applications (IJACSA) , 0(3),
2011, pp 92 - 99.
[8] H.B. Kekre, Sudeep D. Thepade, Ratnesh Chaturvedi & Saurabh Gupta, "Walsh, Sine, Haar& Cosine Transform With Various
Color Spaces for "Color to Gray and Back‟", International Journal of Image Processing (IJIP), Volume (6) : Issue (5) : 2012, pp
349-356.
[9] H. B. Kekre, Sudeep D. Thepade, Ratnesh N. Chaturvedi, " NOVEL TRANSFORMED BLOCK BASED INFORMATION
HIDING USING COSINE, SINE, HARTLEY, WALSH AND HAAR TRANSFORMS", International Journal of Advances in
Engineering & Technology, Mar. 2013. ©IJAET ISSN: 2231-1963, Vol. 6, Issue 1, pp. 274-281
[10] Alfred Haar, "ZurTheorie der orthogonalenFunktionensysteme" (German), MathematischeAnnalen, Volume 69, No 3, pp 331 –
371, 1910.


Paper Type : Research Paper
Title : Comparative Study of RBFS & ARBFS Algorithm
Country : India
Authors : Disha Sharma, Sanjay Kumar Dubey
: 10.9790/0661-105105110      logo

Abstract: RBFS is a best-first search that runs in space that is linear with respect to the maximum search depth, regardless of the cost function used. This algorithm allows the use of all available memory. One major flaw of this algorithm is that it can visit the same node several times. This makes the computational cost may be unaffordable for some accuracy. This problem can be much solved by using various extension of Heuristic Search. By using anytime approach in our simple RBFS will improve solution by saving the current solution & continues the search. Anytime RBFS algorithm will optimize the memory & time resources and are considered best for RBFS algorithm. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible substitution between search time and solution quality. Some applications like Real Time Strategy (RTS) games have applied these algorithms to find a fast solution that will help the algorithm prune some paths during the subsequent computation. Keywords -AI Algorithm, Anytime, Best-first search, Computational time, Heuristic Search

[1]. Sree Kanth R. K., (2012) « Artificial Intelligence Algorithms », IOSR Journal of Computer Engineering(IOSRJCE), volume 6, issue 3, sep-oct, pp 1-8
[2]. Korf, R.E., (1993), « Linear space best first search », Artificial Intelligence, volume 62, issue 1, pp 41-78
[3]. Eric A. H., Rong Z., (2007), « Anytime Heuristic Search », Journal of Artificial Intelligence Research, volume 28, pp 267-297
[4]. Russell, S.J: Norvig, (2003), Artificial Intelligence: A Modern Approach, N,J: Prentice Hall, page 97-104, ISBN 0-13-790395-2
[5]. Keindl H., Kainz G., Leeb A., Smetana H., (1995)« How to use limited memory in heuristic search », in Proceedings IJCAI-95, ed., Cris S. Mellish, pp 236-242
[6]. Keindl H., Leeb A., Smetana H., (1994) »Improvements on linear space search algorithms » in Proceedings ECAI, volume 94, pp 155-159
[7]. Sen A. K. & Bagchi A., (1989) »Fast recursive formulations for best-first search that allows controlled use of memory », in Proceedings IJCA, volume 89, pp 297-302
[8]. Korf, R.E., (1995) « Space-efficient search algorithms », Computing Surveys, volume 27, issue 3, pp 337-339
[9]. Ghosh S., Mahanti A., Dana S.N., (1994) « ITS : An efficient limited- memory heuristic tree search algorithm », in Proc. Twelfth National Conference on Artificial Intelligenc





IOSR Journal Publish Online and Print Version Both