IOSR Journal of Computer Engineering (IOSR-JCE)

Volume 12- Issue 5

Paper Type : Research Paper
Title : Robust Digital Image Watermarking based on spread spectrum and convolutional coding
Country : Algeria
Authors : TABA Mohamed Tahar, BEDDA Mouldi, H.D.AL-Sharari
: 10.9790/0661-1250109      logo

Abstract: Digital watermarking is a promising technology to embed information as unperceivable signals in digital contents. A copyright protection method for digital image with convolutional coding is proposed in this paper. In this method, the watermark logo is coded with convolutional encoder and fused with noise bits to improve the robustness to malicious attacks including JPEG, noise and geometric attacks such as, cropping and rotation. During extraction, the watermark bits are decoded by Viterbi algotithm decoder, and the extraction procedure needs neither the original image nor the watermark logo. Simulation results show that the proposed method based on the convolutional coding can effectively resist the common malicious attacks, the embedding and extraction performances are quite improve compared to the method based on the direct coding.

Keywords: Digital Watermarking, Spread Spectrum, Convolutional Coding,

1 Wei-Hung Lin a et al, "Image copyright protection with forward error correction", Expert Systems with Applications: An International Journal. Vol. 36 Issue 9, November, 2009.

2 Ganic, E., & Eskicioglu, A. M. (2004). "Robust DWT-SVD domain image watermarking: Embedding data in all frequencies". In Proceedings of the international multimedia conference multimedia and security, Magdeburg (pp. 166–174).
3 Chris Shoemaker "Hidden Bits: A Survey of Techniques for Digital atermarking". Available:, June 2011.

4 Langelaar, G. C., Setyawa, I., and Lagendijk, R. L. "Watermarking digital image and video data: A state-of-the-art overview". IEEE Signal Processing Magazine, vol.17, pp 20-46. September 2000.

5 Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997). "Secure spread spectrum watermarking for multimedia". IEEE Transactions on Image Processing, 6,1673–1687.
6 Matthew C. Valenti, "Channel coding for IEEE 802.16e mobile WiMAX," roceedings of IEEE International Conference on Communications, ICC 2009, Dresden, Germany, 14-18 June 2009.
7, 0ctober 2011. 8 Luis Pérez-Freire and Fernando Pérez-González Spread, "Spread spectrum watermarking security". IEEE Transactions on Information Forensics and Security, 4(1):2-24, March 2009.

9 F. Cayre, C. Fontaine, and T. Furon, "Watermarking security: theory and practice," IEEE Transactions on Signal Processing, vol. 53, no.

10, October 2005. 10 Stefan Katzenbeisser, Fabien A. P. Petitcolas, "Information Hiding Techniques for Steganography and Digital Watermarking", 2000, ARTECH HOUSE, INC.

Paper Type : Research Paper
Title : To Reduce The Handover Delay In Wimax When The Mobile Station Moves At Higher Speed By Using The Save Point
Country : India
Authors : Mrs. Sukhpreet Kaur, Jasbir Kaur
: 10.9790/0661-1251013      logo

Abstract: The IEEE 802.16e standard (i.e., mobile WiMAX) has been proposed to provide the connectivity in wireless networksfor mobile users (including users at a vehicular speed). It is shownin our analysis that the probability of a successful handoverdecreases significantly when the user moves at a higher speed. In this paper we have compared three techniques Forward Error Correction (FEC) with retransmission to offer extra protection for handover signaling messages to enhance the probability of a successful handover, especially at a higher velocity, without using a save point between source and destination and using a save point between the source and destination. Comparison between their line graphs is also given in this paper.

[1] IEEE 802.16 Working Group, "IEEE Standard for Local and metropolitan Area networks, Part 16: Air Interface for Fixed Broadband Wireless Access Systems," IEEE Std. 802.16-2004, May 2005.

[2] IEEE 802.16 Working Group, "IEEE Standard for Local and metropolitan Area networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems Amendment 2," IEEE Std. 802.16e-2005, Feburary 2006.

[3] G. P. Pollini, "Trends in handover design," Communications Magazine, IEEE, vol. 34, pp. 82-90, 1996.

[4] M. G. Williams, "Directions in media independent handover," IEICE Trans. Fundamentals, vol. E88-A, pp. 1772-1776, July 1, 2005.

[5] D. J. Wright, "Maintaining QoS during handover among multiple wireless access technologies," in Proceedings of Intl. Management of Mobile Business, 2007, pp. 10-10.

[6] R. Hsieh, Z. G. Zhou, and A. Seneviratne, "S-MIP: a seamless handoff architecture for mobile IP," in Proceedings of INFOCOM , 2003, pp. 1774-1784.

[7] L. Doo Hwan, K. Kyamakya, and J. P. Umondi, "Fast handover algorithm for IEEE 802.16e broadband wireless access system," in Proceeding of International Symposium on Wireless Pervasive Computing, 2006. [

8] S. Minsik, K. Hwasung, and L. Sangho, "A fast handover mechanism for IPv6 based WiBro system," in Proceedings of ICACT,2006.

[9] Zhiwei Yan, Lei Huang,, C.-C. Jay Kuo, "Seamless High-Velocity Handover Support in Mobile WiMAX Networks", Xi'an Jiaotong University, Xi'an 710049, P. R. China.

Paper Type : Research Paper
Title : A hybrid English to Malayalam machine translator for Malayalam content creation in Wikis
Country : India
Authors : Nithya B., Shibily Joseph
: 10.9790/0661-1251418      logo

Abstract: Wikis are web-based software platforms that allow users to collaboratively create and edit web page content, through a Web browser. The ease-of-use and open philosophy of wikis have made them a simple and quick method for collaborative knowledge management. As wikis mostly contain natural language, the integration of wiki systems with automated Natural Language Processing (NLP) techniques can be considered to support users in information analysis and content development. The presence of the Dravidian language, Malayalam, is comparatively low in popular wikis like Wikipedia. As a solution to this problem, this paper considers the idea of integration of a Hybrid Machine Translator service, a combination of Statistical Machine Translator (SMT) and Translation Memory(TM), with wiki system for automated content generation in Malayalam. A system architecture providing this integration is presented. The whole process is supposed to speed up the content creation in wikis and bridging the language barrier which restricts knowledge dissemination in the web.

Keywords - Content creation, Hybrid Machine Translation, Natural Language Processing, Statistical Machine Translation, Translation Memory, Wiki

1] Unnikrishnan P, Antony P J and Dr. Soman K P, A Novel Approach for English to South Dravidian Language Statistical Machine
Translation System, International Journal on Computer Science and Engineering, 2010.
[2] Jurafsky, Martin , Speech and language processing: An introduction to natural language processing, computational linguistics,
and speech recognition. (Prentice Hall PTR, Upper Saddle River, NJ, USA 2000).
Proceedings Papers:
[3] Sebastian Schaffert, Ikewiki: A semantic wiki for collaborative knowledge management, Proc. of WETICE, IEEE Computer
Society, 2006.
[4] R. Witte and T. Gitzinger, Connecting wikis and natural language processing systems, Proc. of the Intl. Symposium on Wikis,
[5] J. Hoart, T. Zesch, and I. Gurevych, An architecture to support intelligent user interfaces for wikis by means of natural language
processing, Proc. of the International Symposium on Wikis, ACM, 2009.
[6] D. Bar, N. Erbs, T. Zesch, and I. Gurevych, Wikulu: An extensible architecture for integrating natural language processing
techniques with wikis, in Proc. of the ACLHLT System Demonstrations, ACL, 2011.

Paper Type : Research Paper
Title : Pattern Mapping Approach for Detecting Xss Attacks In Multi-Tier Web Applications Using Double Guard
Country : India
Authors : A. Krishna Chaitanya, Mounika. B.
: 10.9790/0661-1251923      logo

Abstract: with the advent and explosive growth of the global Internet and electronic commerce environments, adaptive/automatic network intrusion and anomaly detection in wide area data networks and e-commerce infrastructures is fast gaining critical research and practical importance. Many researchers have been performed research for detecting intrusions in multi tier web applications. This paper focuses on Double guard that deploys the IDS at both front end web server and back end data base server has been developed. Virtualization technique has been used for creating containers for each user sessions. This strategy mainly focuses on detecting XSS attacks in multi tier web applications by employing a pattern mapping step wise algorithm. Cross Site Scripting Attack (XSS) belongs to top ten web application vulnerabilities. This paper proposes a mechanism to secure java web applications from XSS by applying a framework based on pattern mapping approach.

Key words : Pattern mapping, XSS attacks, Double guard, Virtualization.

[1]. Meixing Le, AngelosStavrou, Brent ByungHoon Kang," Double Guard: Detecting Intrusions in Multitier Web Applications", IEEE Transactions on dependable and secure computing, vol. 9, no. 4, July/august 2012.
[2]. M. Johns, B. Engelmann, and J. Posegga, ―XSSDS: Server-Side Detection of Cross-Site Scripting Attacks,‖ in Computer Security Applications Conference, 2008. ACSAC 2008. Annual. IEEE, pp. 335–344, 2008.
[3]. E.Kirda, C.Kruegel, G.Vigna, and N.Jovanovic,‖Noxes: A ClientSide Solution for Mitigating Cross-Site Scripting Attacks‖ Dijon, France SAC'06 April 23-27, 2006.
[4]. A. Klein, ―DOM based cross site scripting or XSS of the third kind,‖Web Application Security Consortium, Articles, vol. 4, 2005.
[5]. Anley. Advanced sql injection in sql server applications. Technical report, Next Generation Security Software, Ltd, 2002.
[6]. A.K. Ganame, J. Bourgeois, R. Bidou, F. Spies, "A global security architecture for intrusion detection on computer networks," Montbeliard, vol. 27, pp.30-47, March 2008,
[7]. G.W Dunlap, S.T King, S.Cinar, M.Basrai, " Enabling intrusion analysis through virtual-machine logging and replay," Boston, MA, USA, pp. 211-240, December 2002.

Paper Type : Research Paper
Title : Enhanced Clustering Algorithm for Processing Online Data
Country : India
Authors : Ankita Choubey, Dr. Sadhna K. Mishra
: 10.9790/0661-1252429      logo

Abstract: Clustering of data has been of intense need for any organization in the past and various researchers in the field of data mining have been continuously working to find efficient and accurate tools and algorithms for the same. From the proliferation of internet and network applications is pressing the same need more deeply and it is becoming more and more necessary for providing such algorithms by the researchers of data mining. Researchers have been working continuously and finding incremental clustering mechanism to be best suitable for online data. Clustering of very large document databases is useful for both searching and browsing. The Periodic updating of clusters is required due to the dynamic nature of databases. For this purpose incremental clustering is a profitable approach. Incremental clustering algorithm clusters data in dynamic form. It requires initial clusters to be decided in advance i.e. they must be pre exist and fixed. This work proposed a dynamic and novice approach of incremental clustering algorithm for creating efficient clusters and rearrangement of the clusters on the basis of characteristics of the data. Also an approach of retrieval and searching of some specific data from the fixed clusters using a new frequency check method will be compared with the proposed work.

Keywords: Incremental Clustering, Characteristics, Parameters, Clustering, Hybrid, Hierarchical.

[1] Yongli Liu1, Qianqian Guo2, Lishen Yang1, Yingying Li1 "Research on Incremental Clustering",This work was supported in part by national social science fund (No. 11CYY019) and the natural scientific research project of education department of Henan Province (No. 2011A520015). 978-1-4577-1415-3/ © 2012 IEEE

[2] Steven Young, Itamar Arel, Thomas P. Karnowski, Derek Rose, "A Fast and Stable Incremental Clustering Algorithm", April 12-14, 2010, PP 204-209

[3] M. Srinivas and C. Krishna Mohan, "Efficient Clustering Approach using Incremental and Hierarchical Clustering Methods", July 18-23, 2010, PP. 1-7, 978-1-4244-8126-2/10 2010 IEEE

[4] A. K. Jain, M. N. Murty, and P. J. Flynn, "Data clustering: A review", ACM Computing Survey (CSUR), 31(3):264-323, 1999.

[5] P.Vijaya, M. N. Murthy and D.K. Subramanian. Leaders-Sub leaders: "An efficient hierarchical clustering algorithm for large data sets". Pattern Recognition Letters 25

[6] M. Perkowitz and 0. Etzioni, "Adaptive web sites: An ai challenge". 'In Proceedings of IJCAI-97. Volume 1, 1997

[7] M. Perkowitz and 0. Etzioni. "Towards adaptive web sites: Conceptual framework and case study". Artificial Intelligence, 118245 - 275, 2000

[8] T. Toolan and N. Kusmerick. "Mining web logs for personalized site maps". In Proceedings of the Intentional Conference on Web Information System Engineering, volume I, 2002

[9] ChengRuLin and Ming-Syan Chen "A Robust and Efficient Clustering Algorithm based on Cohesion Self- Merging". In Proceedings of the Intentional Conference on SIGKDD '02 Edmonton, Alberta, Canada 2002 ACM

[10] Yue Xu "Hybrid Clustering with Application to Web Mining". In Proceedings of the IEEE Intentional Conference 2005

Paper Type : Research Paper
Title : Privacy and Integrity Preserving in Cloud Storage Devices
Country : India
Authors : V. Tejaswini, S. K. Prashanth, Dr. N. Sambasiva Rao, C. Satya Kumar
: 10.9790/0661-1253033      logo

Abstract:Cloud computing is an internet based model which allows the user all the "services on demand". The services provided by cloud are infrastructure, software and platform. Cloud Computing has great potential of providing robust computational power to the society at reduced cost. Despite the tremendous benefits, security is the primary obstacle that prevents the wide adoption of this promising computing model, especially for customers when their confidential data are consumed and produced during the computation. Wang proposed enabling public audit ability and data dynamics for storage security in cloud computing which provides data integrity and dynamic operation but cannot assure confidentiality. Here in this scheme we are providing a new method which provide confidentiality and also manage the storage space in cloud server. In this we are providing confidentiality by using cryptographic algorithm and storage space is managed by using complete binary tree by arranging all the files by their size and checking the integrity using TPA(third party auditor). Thus providing integrity, memory management as well as confidentiality in cloud computing. Keywords – cloud computing, data integrity, data storage, public audit ability

[1] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing, European Symp. Research in Computer Security (ESORICS '09), 2009, pp. 355-370.
[2] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, Provable Data Possession at Untrusted Stores, ACM Conf. Computer and Comm. Security (CCS '07), 2007, pp. 598-609.
[3] A. Juels and B.S. Kaliski Jr., Pors: Proofs of Retrievability for Large Files, ACM Conf. Computer and Comm. Security (CCS '07), 2007, pp. 584-597.
[4] H. Shacham and B. Waters, Compact Proofs of Retrievability, Int'l Conf. Theory and Application of Cryptology and Information Security: Advances in Cryptology (ASIACRYPT '08), 2008,pp. 90-107.
[5] K.D. Bowers, A. Juels, and A. Oprea, Proofs of Retrievability: Theory and Implementation,Report 2008/175, Cryptology ePrint Archive, 2008.
[6] M. Naor and G.N. Rothblum, The Complexity of Online Memory Checking, Ann. IEEE Symp. Foundations of Computer Science (FOCS '05), 2005, pp. 573-584.
[7] E.-C. Chang and J. Xu, Remote Integrity Check with Dishonest Storage Server, European Symp. Research in Computer Security (ESORICS '08), 2008, pp. 223-237.
[8] M.A. Shah, R. Swaminathan, and M. Baker, Privacy-Preserving Audit and Extraction of Digital Contents,Report 2008/186, Cryptology ePrint Archive, 2008.

Paper Type : Research Paper
Title : Ethopian Database Management system as a Cloud Service: Limitations and advantages
Country : ETHOPIA
Authors : Shaik Saidhbi
: 10.9790/0661-1253438      logo

Abstract: An Ethiopian Cloud database management system is a distributed database that delivers computing as a service instead of a product. It is the sharing of resources, software, and information between multiple devices over a network which is mostly the internet. It is expected that this number will grow significantly in the future. As a result, there is a growing interest in outsourcing database management tasks to third parties that can provide these tasks for much lower cost due to the economy of scale just like putting it into the cloud. In this paper, we discuss the recent trend in database management system and the possibilities of making it as one of the services offered in the cloud. We also Recently the cloud computing paradigm has been receiving significant excitement and attention in the media and blogosphere. To some, cloud computing seems to be little more than a marketing umbrella, encompassing topics such as distributed computing, grid computing, utility computing, and software as- a-service, that have already received significant research focus and commercial implementation. Nonetheless, there exist an increasing number of large companies that are offering cloud computing infrastructure products and services that do not entirely resemble the visions of these individual component topics.

[1] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Order preserving encryption for numeric data. In Proc. of SIGMOD, pages 563–574, 2004.

[2] AmazonWeb Services. SimpleDB. Web Page.

[3] M. Brantner, D. Florescu, D. Graf, D. Kossmann, and T. Kraska. Building a Database on S3. In Proc. of SIGMOD pages 251–264, 2008.

[4] R. Chaiken, B. Jenkins, P.-A. Larson, B. Ramsey, D. Shakib, S. Weaver, and J. Zhou. Scope: Easy and efficient parallel processing of massive data sets. In Proc. of VLDB, 2008.

[5] S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51–59, 2002.

[6] H. Hacig¨um¨us¸, B. Iyer, C. Li, and S. Mehrotra. Executing sql over encrypted data in the database-service-provider model. In Proc. of SIGMOD, pages 216–227, 2002.

[7] Hadoop Project. Welcome to Hadoop! Web Page.

Paper Type : Research Paper
Title : Modified Distributive Arithmetic Based DWT-IDWT Processor Design and FPGA Implementation for Image Compression
Country : India
Authors : J. Vara Prasad, K. Chandra Sekar
: 10.9790/0661-1253944      logo

Abstract: One of the major image processing techniques that is widely used in medical, automotive, consumer and military applications is image compression. Discrete wavelet transforms is the most popular transformation technique adopted for image compression. Complexity of DWT is always high due to large number of arithmetic operations. In this work a modified Distributive Arithmetic based DWT architecture is proposed and is implemented on FPGA. The modified approach consumes area of 6% on Spartan-III pro FPGA and operates at 134 MHz. The modified DA-DWT architecture has a latency of 44 clock cycles and a throughput of 4 clock cycles. This design is twice faster than the reference design and is thus suitable for applications that require high speed image processing algorithms.

Keywords: Discrete Wavelet Transforms (DWT), Distributive Arithmetic (DA), Poly-phase structure, and convolution..

[1] David S. Taubman, Michael W. Marcellin - JPEG 2000 – Image compression, fundamentals, standards and practice", Kluwer academic publishers, Second printing - 2002.

[2] G. Knowles, "VLSI Architecture for the Discrete Wavelet Transform," Electronics Letters, vo1.26, pp. 1184-1185,1990

[3] M, Vishwanath, R. M. Owens, and M. 1. Irwin, "VLSI Architectures for the Discrete Wavelet Transform," IEEE Trans. Circuits And Systems II, vol. 42, no. 5, pp. 305-316, May. 1995.

[4] AS. Lewis and G. Knowles, "VLSI Architectures for 2-D Daubechies Wavelet Transform without MUltipliers".Electron Letter, vo1.27, pp. 171-173, Jan 1991.

[5] K.K. Parhi and T. Nishitani "VLSI Architecture for Discrete Wavelet Transform", IEEE Trans. VLSI Systems, vol. 1, pp. 191-202, June 1993.

[6] M. Vishwanath, R.M. Owens and MJ. Irwin, "VLSI Architecture for the Discrete Wavelet Transform", IEEE Trans. Circuits and Systems, vol. 42, pp. 305-316, May 1996.

[7] C. Chakrabarti and M. Vishwanath, "Architectures for Wavelet Transforms: A Syrvey", Journal of VLSI Signal Processing, Kulwer, vol.lO, pp. 225-236,1995.

[8] David S. Tabman and Michael W. Marcelliun, "JPEG 2000 – Image Compression, Fundamentals, Standards and Practice", Kulwer Academic Publishers, Second printing 2002.

[9] CharilaosChristopoulos, AthanassiosSkodras, and TouradjEbrahimi - "THE JPEG2000 STILL IMAGE CODING SYSTEM – AN OVERVIEW", Published in IEEE Transactions on Consumer Electronics, Vol. 46, No. 4, pp. 1103-1127, November 2000.

[10] MajidRannani and Rajan Joshi, "An Overview of the JPEG2000 Still Image Compression Standard", Signal Processing, Image Communication, vol. 17, pp. 3-48, 2002.

Paper Type : Research Paper
Title : K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations
Country : India
Authors : R. Rakesh Kumar, A. Bhanu Prasad
: 10.9790/0661-1254548      logo

Abstract: Data mining refers to the process of analyzing the data from different perspectives and summarizing it into useful information that is mostly used by the different users for analyzing the data as well as for preparing data sets. A data set is collection of data that is present in the tabular form. Preparing data set involves complex SQL queries, joining tables and aggregate functions. Traditional RDBMS manages the tables with vertical format and returns one number per row. It means that it returns a single value output which is not suitable for preparing a data set. This paper mainly focused on k means clustering algorithm which is used to partition data sets after horizontal aggregations and a small description about the horizontal aggregation methods which returns set of numbers instead of one number per row. This paper consists of three methods that is SPJ, CASE and PIVOT methods in order to evaluate horizontal aggregations. Horizontal aggregations results in large volumes of data sets which are then partitioned into homogeneous clusters is important in the system. This can be performed by k means clustering algorithm.

Keywords: Aggregations, SQL, pivoting and K-means clustering.

[1] C. Ordonez and Z. Chen. Horizontal aggregations in SQL to prepare data sets for data mining analysis.IEEE Transactions on Knowledge and Data Engineering (TKDE), 24(4), 2012.

[2] J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab and subtotal. In ICDE Conference.

[3] G. Bhargava, P. Goel, and B.R. Iyer. Hypergraph based reordering of outer join queries with complex predicates. In ACM SIGMOD Conference, pages 304–315, 1995

[4] J.A. Blakeley, V. Rao, I. Kunen, A. Prout, M. Henaire, and C. Kleinerman. .NET database programmability and extensibility in Microsoft SQL Server. In Proc. ACM SIGMOD Conference, pages 1087–1098, 2008.

[5] J. Clear, D. Dunn, B. Harvey, M.L. Heytens, and P. Lohman. Non-stop SQL/MX primitives for knowledge discovery. In ACM KDD Conference, pages 425–429, 1999.

[6] E.F. Codd. Extending the database relational model to capture more meaning. ACM TODS, 4(4):397–434, 1979.

[7] C. Galindo-Legaria and A. Rosenthal. Outer join simplification and reordering for query optimization. ACM TODS, 22(1):43–73, 1997.

Paper Type : Research Paper
Title : High Security Cryptographic Technique Using Steganography and Chaotic Image Encryption
Country : India
Authors : Arun A. S., George M. Joseph
: 10.9790/0661-1254954      logo

Abstract: This paper proposes a novel cryptographic technique that exploits the advantages of two important techniques – steganography and chaotic image encryption. Steganography is the technique of hiding the message within a cover media. Once the message is embedded within the cover image, it is encrypted using triple-key chaotic image encryption. So altogether this method provides a four-layer security to the original message. Various analyses were done and the results of the experiments are very encouraging and in future, this method can be extended to support media other than images.

Keywords - Cryptography, Colour Image, Steganography, Encryption, Chaotic logistic map.

[1] F. Shih, Digital Watermarking And Steganography-Fundamentals And Techniques(USA: CRC Press, 2008).

[2] D. Coppersmith, "Data encryption standard and its strength against attacks", IBM J. Res. Develop, vol. 38 no. 3 may 1994.

[3] M. Zeghid et al., "A modified AES based algorithm for image encryption", International Journal of Computer Science and Engineering, 1(IX2006) 70-75.
[4] Xuejia Lai and James L. Massey, "A Proposal for a New Block Encryption Standard", Eurocrypt 1990, pp389–404

[5] N. K. Pareek, Vinod Patidar, K. K. Sud; "Image encryption using chaotic logistic map", Image and Vision Computing 24 (2006) 926-934.

[6] G. Srividya, P. Nandakumar, "A Triple-Key chaotic image encryption method," Communications and Signal Processing (ICCSP), 2011 International Conference on , pp.266-270, 10-12 Feb. 2011.

[7] C.W. Wu and N.F. Rulkov, "Studying chaos via 1-Dmaps-a tutorial," IEEE Trans. on Circuits and Systems I: Fundamental Theory and Applications, vol. 40, no. 10, pp. 707-721, 1993.

[8] T. Fei, L. Shaojun, "Research and implementation of information hiding based on RSA and HVS," E -Business and E -Government (ICEE), 2011 International Conference on , pp.1-4, 6-8 May 2011.

Paper Type : Research Paper
Title : Energy Efficient Stable Election Protocol for Clustered Heterogeneous Wireless Sensor Networks
Country : India
Authors : C. Divya, N. Krishnan , T. Gandhi Mathy
: 10.9790/0661-1255561      logo

Abstract: Wireless sensor networks are the networks with wireless sensors disseminated in a region which sense various types of information and then transmit this information to the other nodes or to the final destination. These nodes sense the changes in the physical parameters similar to – temperature, pressure, etc. The data sensed by these nodes are then approved to the Base Station (BS) for estimation. Wireless sensor networks are used for the variety of purposes like military surveillances, habitat monitoring, forest fire detections, landslide detections. This paper presents the new clustering algorithm by modifying SEP (Stable Election Protocol) for heterogeneous wireless sensor network, called EE-SEP. Energy Efficient -SEP protocol is used to increase the number of alive nodes and thereby increasing the energy efficiency, stability period and network lifetime and balancing the energy consumption. Simulation results show that proposed Energy Efficient SEP algorithm performs better as compared to SEP.

Keywords - Energy consumption, Energy efficiency, Network life time, Stability period, SEP, EE-SEP, Wireless sensor network.

[1] Georgios Smaragdakis Ibrahim Matta Azer Bestavros SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor
[2] Manju Bala, Lalit Awasthi Proficient D-SEP Protocol with Heterogeneity for Maximizing the Lifetime of Wireless Sensor
[3] S. Faisal, N. Javaid, A. Javaid, M. A. Khan, S. H. Bouk, Z. A. Khan Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor
[4] Harneet Kour Ajay K. Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network
[5] Said Benkirane M.Lahcen HasnaouiAbderrahim Benihssane Mohamed Laghdir Distance-based Stable Election Protocol (DB-SEP) for Heterogeneous Wireless Sensor Network( 58– No.16, November 2012)

[6] Parul Saini Ajay K Sharma Energy Efficient Scheme for Clustering Protocol Prolonging the Lifetime of Heterogeneous Wireless Sensor Networks

[7] Tripti Sharma, Brijesh Kumar, G.S.Tomar OCEA: An Optimal Cluster Energy Aware Routing Protocol for Wireless Sensor Networks

[8] Samayveer Singh, A K Chauhan, Sanjeev Raghav, Vikas Tyagi, Sherish Johri heterogeneous protocols for increasing ifetime of wireless sensor networks

[9] A. A. Khan, N. Javaid, U. Qasim, Z. Lu$, Z. A. Khan hsep: heterogeneity-aware hierarchical stable election protocol for wsns

[10] Vibhuti P N Jaiswal, Dr. Amit K Garg An Efficient Protocol for Reducing Energy Consumption in Wireless Sensor Networks

Paper Type : Research Paper
Title : Enhancing Privacy in Cloud Service Provider Using Cryptographic Algorithm
Country :  
Authors : K. Sunitha, S. K Prashanth
: 10.9790/0661-1256264      logo

Abstract: Cloud Computing provides the way to share the distributed resources and services that belong to different organizations and sites. Even though it having benefits, but it posses security problems. All types of users who require the secure transmission or storage of data in network. While, the data transmission on the internet or over any networks are vulnerable to the hacker attacks. We are in great need of encrypting the owner data. Our paper aims to give the cloud data storage models and data security in cloud computing system. Here we propose a efficient method for providing data storage security in cloud computing using RSA algorithm. In this algorithm some important security services included such as key generation, encryption and decryption that are provided in cloud computing system.

Key words: Data storage security, RSA algorithm, Encryption, Decryption

[1] Cong Wang, Qian Wang, Kui Ren, Wenjing Lou, "Privacy Preserving Public Auditing for Data Storage Security in cloud Computing", 2010.
[2] Jianfeng Yang and Zhibin Chen , "Cloud Computing Research and Security Issues", IEEE 2010.
[3] Parsi Kalpana, Sudha Singaraju,"Data Security in Cloud Computing using RSA".
[4] P.Kalpana, "Cloud Computing – Wave of the Future", International Journal of Electronics Communication and Computer Engineering, Vol 3, Issue 3, ISSN 2249–071X, June 2012.
[5] Subedari Mithila, P. Pradeep Kumar, "Data Security through Confidentiality in Cloud Computing Environment".
[6] Uma Somani, Kanika Lakhani and Manish Mundra, "Implementing Digital Signature with RSA Encryption Algorithm to Enhance the Data Security of Cloud in Cloud Computing", 2010.
[7] Kresimir Popovic and Zeljko Hocenski, "Cloud computing security issues and challenges", MIPRO 2010, May 24-28, 2010, Opatija, Croatia.
[8] Qian Wang, Cong Wang, Kui Ren, Wenjing Lou, Jin Li, "Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, Vol. No. 22, Issue 5, MAY 2011.
[9] Cong Wang and Kui Ren, Wenjing Lou, Jin Li,, "Toward Publicly Auditable Secure Cloud Data Storage Services", IEEE Network July/August 2010.
[10] Subashini S, Kavitha V., "A survey on security issues in service delivery models of cloud computing," Journal of Network and Computer Applications (2011), vol. 34 Issue 1, January 2011 pp. 1-11.

Paper Type : Research Paper
Title : Formalizing Collaborative Software Development Issues: A Collaborative Work Allocation Patterns Analysis Approach
Country : India
Authors : Ch. Srikanth, H. Venkateswara Reddy
: 10.9790/0661-1256576      logo

Abstract: Currently, workflow machinery is popular to ease the functioning procedure in business in sequence systems (EIS), and it has got the capacity to lessen layout quality and lower product time, improve product price.. This document provides a data mining strategy to deal with the resource allocation issue (RAP) and enhance the efficiency of workflow source executive. Specifically, an Apriori-like algorithm is engaged to discover the regular patterns from the occurrence sign, and organization guidelines are created in accordance with predefined reserve allocation constraints. Consequently, a relationship calculates named lift is utilized to interpret the negatively linked resource allocation guidelines for resource booking. Lastly, the principles are rated as source allocation principles utilizing the trust actions.

Keywords: workflow, resource allocation, data mining, process mining, association rules.

[1] L. Ly, S. Rinderle, P. Dadam, and M. Reichert, "Mining Staff Assignment Rules from Event-Based Data," in Business Process Management Workshops, ed, 2006, pp. 177-190.
[2] Y. Liu, J. Wang, Y. Yang, and J. Sun, "A semi-automatic approach for workflow staff assignment," Computers in Industry, vol. 59, pp. 463- 476, 2008.
[3] Z. Huang, W. M. P. van der Aalst, X. Lu, and H. Duan, "An adaptive work distribution mechanism based on reinforcement learning," Expert Systems with Applications, vol. 37, pp. 7533-7541, 2010.
[4] W. van der Aalst and K. van Hee, Workflow Management: Models, Methods, and Systemsvol. 1: The MIT Press, 2004.
[5] W. M. P. van der Aalst, A. H. M. ter Hofstede, B. Kiepuszewski, and A. P. Barros, "Workflow Patterns," Distributed and Parallel
Databases, vol. 14, pp. 5-51, 2003.
[6] N. Russell, W. M. P. van der Aalst, A. H. M. ter Hofstede, and D. Edmond, "Workflow Resource Patterns: Identification, Representation and Tool Support," in Advanced Information Systems Engineering. vol. 3520, O. Pastor and J. Falcão e Cunha, Eds., ed: Springer Berlin / Heidelberg, 2005, pp. 216-32.
[7] J. E. Cook and A. L. Wolf, "Discovering models of software processes from event-based data," ACM Trans. Softw. Eng. Methodol., vol. 7, pp. 215-249, 1998.
[8] W. M. P. van der Aalst, B. F. van Dongen, J. Herbst, L. Maruster, G. Schimm, and A. J. M. M. Weijters, "Workflow mining: A survey of issues and approaches," Data & Knowledge Engineering, vol. 47, pp. 237-267, 2003.
[9] W. M. P. van der Aalst and A. J. M. M. Weijters, "Process mining: a research agenda," Computers in Industry, vol. 53, pp. 231-244, 2004.
[10] W. M. P. van der Aalst, H. A. Reijers, A. J. M. M. Weijters, B. F. van Dongen, A. K. Alves de Medeiros, M. Song, and H. M. W. Verbeek, "Business process mining: An industrial application," Information Systems, vol. 32, pp. 713-732, 2007.

Paper Type : Research Paper
Title : A Hierarchical Feature Set optimization for effective code change based Defect Forecasting
Country : India
Authors : T. Vishnu Vardhan Reddy, H. Venkateshwara Reddy, Ch. Srikanth
: 10.9790/0661-1257784      logo

Abstract: The automatic detection of defective modules comprised by software systems may result in added dependable applications and decreased development expenses. In this attempt improvement and style metrics is utilized as attributes to predict defects in specified software component using SVM classifier. A development of preprocessing steps were utilized to the data preceding to categorization, for instance, contrasting of in alliance groups (defective or otherwise) as well as the removal of the sizable numeral of duplicating examples. The Support Vector Machine in this test yields that miles to a typical correctness ahead over present defect prediction models on previously unseen data.

Keywords: Support Vector Machines, Defect prediction, metrics, bug forecasting.

[1]. Levinson, M.: Lets stop wasting $78 billion per year. CIO Magazine (2001)
[2]. Halstead, M.H.: Elements of Software Science (Operating and programming sys¬tems series). Elsevier Science Inc., New York, NY, USA (1977)
[3]. McCabe, T.J.: A complexity measure. In: ICSE '76: Proceedings of the 2nd international conference on Software engineering, Los Alamitos, CA, USA, IEEE Computer Society Press (1976) 407
[4]. Hamer, P.G., Frewin, G.D.: M.H. Halstead's Software Science - a critical exami¬nation. In: ICSE '82: Proceedings of the 6th international conference on Software engineering, Los Alamitos, CA, USA, IEEE Computer Society Press (1982) 197¬206
[5]. Shen, V.Y., Conte, S.D., Dunsmore, H.E.: Software Science Revisited: A critical analysis of the theory and its empirical support. IEEE Trans. Softw. Eng. 9(2) (1983) 155-165
[6]. Shepperd, M.: A critique of cyclomatic complexity as a software metric. Softw. Eng. J. 3(2) (1988) 30-36
[7]. Sommerville, I.: Software Engineering: (8th Edition) (International Computer Sci¬ence Series). Addison Wesley (2006)
[8]. Menzies, T., Greenwald, J., Frank, A.: Data mining static code attributes to learn defect predictors. Software Engineering, IEEE Transactions on 33(1) (Jan. 2007) 2-13
[9]. Scholkopf, B., Smola, A.J.: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond (Adaptive Computation and Machine Learning). The MIT Press (2001)
[10]. Sun, Y., Robinson, M., Adams, R., Boekhorst, R.T., Rust, A.G., Davey, N.: Using sampling methods to improve binding site predictions. In: Proceedings of ESANN. (2006)

Paper Type : Research Paper
Title : Third-Party Emergency Alert Systems over Cellular Text Messaging Services Providing The Security Implications
Country : India
Authors : G. Shanyora, A. Krishna Chaitanya
: 10.9790/0661-1258591      logo

Abstract: Cellular text messaging services are increasingly being relied upon to disseminate critical information during emergencies. Accordingly, a wide range of organizations including colleges and universities now partner with third-party providers that promise to improve physical security by rapidly delivering such messages. The Most of the people are stressed out and overstrained after accidents even if no one is hurt. Consequently, they may face some difficulty in reporting the accident to the police and civil defense, or they may provide them with inaccurate information about the location of the accident. Hence it will take the police and civil defense more time to reach the accident location in the appropriate time to rescue people. Our proposed system The message is sent by the affected person is by a software installed in mobile which doesn't require the user not even to type the message. Then the message will be received by the service center using GSM modem. Using the mobile number and tower location they identify accident location using latitude and longitude in Smart Phones. Then they inform the type of the accident and appropriate location to the nearby service (police & fire). This will reduce the time required for the police and the emergency personnel to reach the accident location.

Key words: SMS Services, Denial of Service, Reporting, Applications.

[1]. Daniel Adkins, Karthik Lakshminarayanan, Adrian Perrig, and Ion Stoica. Taming IP packet flooding attacks. In Proceedings of Workshop on Hot Topics in Networks (HotNets-II), November 2003.
[2]. Micah Adler. Tradeoffs in probabilistic packet marking for IP traceback. In Proceedings of 34th ACM Symposium on Theory of Computing (STOC), 2002.
[3]. D. Scott Alexander, Kostas G. Anagnostakis, William A. Arbaugh, Angelos D. Keromytis, and Jonathan M. Smith. The price of safety in an active network. In SIGCOMM ‟99, 1999.
[4]. David G. Andersen. Mayday: Distributed filtering for Internet services. In Proceedings of USITS, 2003.
[5]. Tom Anderson, Timothy Roscoe, and David Wetherall. Preventing Internet denial-of-service with capabilities. In Proceedings of Hotnets-II, November 2003.
[6]. S. Bellovin, M. Leech, and T. Taylor. The ICMP traceback message. Internet-Draft, draft-ietf-itrace-01.txt, October 2001.
[7]. Robert Braden. Requirements for Internet hosts – communication layers. Internet Request for Comment RFC 1122, Internet Engineering Task Force, October 1989.
[8]. T. Anderson, T. Roscoe, and D. Wetherall, "Preventing Internet Denial of Service with Capabilities," Proc. ACM Workshop Hot Topics in Networking (Hot Nets), 2003.
[9]. K. Argyraki and D.R. Cheriton, "Scalable Network-Layer Defense against Internet Bandwidth-Flooding Attacks," ACM/IEEE Trans.Networking, vol. 17, no. 4, pp. 1284-1297, Aug. 2009.
[10]. Associated Press, "Man Admits Sending "Monkey Out of Cage‟ Message,"

Paper Type : Research Paper
Title : Traffic Safety Improvement and the Role of GIS (A Case Study of Karachi, Pakistan)
Country : China
Authors : Muhammad Asim Azim, Zhai Fengwen, Dang Jianwu, Yan Haowen, Miss. Wang yang
: 10.9790/0661-1259296      logo

Abstract: Traffic safety problems are most significant issues all around the world, but out of the ordinary for developing countries, as 90% occurrences happened in these regions. Karachi is the capital of Sindh province and it was the capital of Pakistan during 1947-59 before being replaced by Islamabad. So Karachi considered as vital city of Pakistan due to geo graphic location and different attributes such as population, economy, road networks, sea port and industries to give the impression of being all state of affairs including safety threat become considerable issue in Karachi, Pakistan. In this paper, improvement is center of attention all through in presence situation, polices related problem and call attention GIS contribution. There are necessary a lot of things for doing to emphasize better safety but not including substantial tribulations make known to become in control. By using SPSS and Pivot Table (in excel), easy draw attention to complete situation and here Geographic Information System (GIS) appropriately classify areas as a result of first three highest abnormal numbers of causalities

Keywords - Road Traffic Causalities, Statistical Package of Social Science, Geographic Information System, Karachi, Pakistan

[1]. J. Geogr. Regional Plan., vol. 3, no. 11, pp. 306-321,2010.
[2]. Razzak, J. A. and Luby, S. P., 1998. Estimating deaths and injuries due to road traffic accidents in Karachi, Pakistan, through the capture-recapture method. International Journal of Epidemiology 27, 866-870.
[3]. Levine, N., K. Kim, and L. Nitz. Spatial analysis of Honolulu motor vehicle crashes: part II: zonal predictions, Accident Analysis and Prevention, Vol. 27, No.5, 1995, pp. 675-685.
[4]. Affum, J. K., and M. A. P. Taylor. Technology tools for transportation professionals – moving into the 21st century: Resource papers for the 1995 International conference, Integrated GIS database for road safety management. Institute of Transportation Engineers, Washington, D.C., 1995, pp.189-193.
[5]. Austin, K., M. Tight, and H. Kirby. The use of geographical information systems to enhance road safety analysis, Transportation Planning andTechnology, Vol. 20, No. 4, 1997, pp. 249-266.
[6]. Kim, K., and N. Levine. Using GIS to improve highway safety, Computers, Environment and Urban Systems, Vol. 20, No. 4, 1996, pp. 289-302.
[7]. Miller, J. S. What value may geographic information systems add to the art of identifying crash countermeasures?, Report VTRC 99-R13, 1999.
[8]. Pulugurtha, S. S., V. K. Krishnakumar, and S. S. Nambisan. New methods to identify and rank high pedestrian crash zones: An illustration, Accident Analysis and Prevention, Vol. 39, No. 4, 2007, pp. 800-811.
[9]. FIA Foundation for the Automobile and Society. Seat Belt Campaign Toolkit. TRL Limited. Retrieved at 18/06/07
[10]. Liberatti et al. The new Brazilian traffic code and some characteristics of victims in southern Brazil.Inj Prev. 2001 Sep;7(3):190-3.

Paper Type : Research Paper
Title : Script Identification for printed document images at text-line level using DCT and PCA
Country : India
Authors : Monali Jindal, Dr. Naveen Hemrajani
: 10.9790/0661-12597102      logo

Abstract: The progress of information technology and the wide reach of the Internet are drastically changing all fields of activity in modern days. As a result, a very large number of people would be required to interact more frequently with computer systems. To develop the human–machine interaction more effective in such situations, it is desirable to have systems capable of handling inputs in a variety of forms such as printed/handwritten paper documents. In a multi-lingual country like India, where more than 22 official languages and 12 different scripts are used for these languages. it is an utmost essential & complicated for designing an OCR system and it became more difficult if the document consist of multiple languages so for an automated multilingual environment such document processing systems relying on OCR would clearly need to identify the script type of the document files, so that specific tool of OCR can be selected. In this paper, a script identification approach for Indian scripts is proposed at text-line level. It is a Visual appearance-based script recognition method. The recognition is based upon features extracted using Discrete Cosine Transform (DCT) and Principal Component Analysis (PCA) algorithm and for further extraction we use Modified-KNN. The proposed method is tested on printed document images in 11 major Indian languages, 95% recognition accuracy is obtained.

Keywords: PCA,DCT,Modified- KNN,OCR

[1] Ta Steinherz, Ehud Rivlin, Nathan Intrator, Offline cursive script word recognition: a survey, International journal on Document Analysis and Recognition, IJDAR (1999) 2: 90-110.

[2] Debashis Ghosh, Tulika Dube, and Adamane P. Shivaprasad, Script Recognition—A Review, IEEE Transactions On Pattern Analysis And Machine Intelligence, Vol. 32, No. 12, December 2010

[3] S Madhvanath, G Kim, V Govindaraju, .Chaincode Contour Processing for Handwritten Word Recognition. IEEE transactions on pattern analysis and machine intelligence, 1996, Vol 21 , No 9, pg 928 . 932.

[4] U. Pal and B. B. Chaudhuri, Indian script character recognition: a survey Pattern Recognition, Volume 37, Issue 9, September 2004, Pages 1887-1899.

[5] F. Coulmas, The Blackwell Encyclopedia of Writing Systems, Blackwell Publishers, Oxford, 1996.

[6] C. Ronse and P.A. Devijver, Connected Components in Binary Images: The Detection Problem, John Wiley & Sons, New York, 1984.

[7] U. Pal and B.B. Chaudhuri, "Script Line Separation from Indian Multi-script Documents," Proc. Int'l Conf. Document Analysis & Recognition, Bangalore, pp. 406-409, Sep. 1999.

[8] U. Pal and B.B. Chaudhuri, "Identification of Different Script Lines from Multi-script Documents," Image & Vision Computing, vol. 20, no. 13-14, pp. 945-954, Dec. 2002.

[9] U. Pal, S. Sinha, and B.B. Chaudhuri, "Multi-script Line Identification from Indian Documents," Proc. Int'l Conf. Document Analysis & Recognition, Edinburgh, pp. 880-884, Aug. 2003.

[10] In 2006 G.D. Joshi, S. Garg, and J. Sivaswamy, "Script and Nature Differentiation for Arabic and Latin Text Images," Proc. Int'l Workshop Frontiers in Handwriting Recognition, Niagra, pp. 309-313, Aug. 2002.

IOSR Journal Publish Online and Print Version Both