iosr-JCE   Volume-16 ~ Issue-2 ~ March-April 2014

Paper Type	:	Research Paper
Title	:	An image compression using using discrete cosine transforms and JPEG enconder
Country	:	India
Authors	:	Ravi Mathey , Prof.P.S.Avadhani
	:	10.9790/0661-16210105

Abstract: `The proposed Multiresolution decomposition through wavelets transform of fractals coded images reveal strong relationships limit the frequency content .The research is includes other extensions of the wavelet transform and fractals are wavelet transform. And our work deals with deals with the JPEG Encoder for image compression upon comparing with Discrete cosine transform (DCT) is widely used in image processing, especially for compression. Some of the applications of two-dimensional DCT involve still image compression and compression of individual video frames.

[1] "A Novel Multiresolution Spatiotemporal Saliency Detection Model and Its Applications in Image and Video Compression" IEEE
TRANSACTIONS ON IMAGE PROCESSING, VOL. 19,
[2] GHANBARI, M. Video Coding: An Introduction to Standard Codecs. IEE, London, 1999, p. 60-62.
[3] G. Davis, "Wavelet Image Compression ConstructionKit,"http://www.geoffdavis.net/dartmouth/wavelet/wavelet.html
[4] R. C. Gonzalez and R. E. Woods, "Digital Image Processing",Second edition,pp. 411-514, 2004.
[5.] N. Ahmed, T. Natarajan, and K. R. Rao, "Discrete cosine transform," IEEE Trans. on Computers, vol. C-23, pp. 90-93,1974.
[6.] A. S. Lewis and G. Knowles, "Image Compression Using the 2-D Wavelet Transform" IEEE Trans. on Image Processing, Vol. I .
NO. 2, PP. 244 - 250, APRIL 1992.

Paper Type	:	Research Paper
Title	:	Multiple Routing Configurations for Fast IP Network Recovery Using AES Algorithm
Country	:	India
Authors	:	P.Lokana, P.Mohanambal,A.Manjula
	:	10.9790/0661-16210608

Abstract: Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding.

[1] Advanced Encryption Standard (AES), Nov.26, 2001.
[2] Atul Kahate(2009), Cryptography and Network Security,second edition,MCgRAW-Hill.
[3] A. Kvalbein, T. ˇ Ciˇcic´, and S. Gjessing, "Post-failure routing performance with multiple routing configurations," in Proc. IEEEINFOCOM, May 2007.
[4] A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, and C. Diot, "IGP link weight assignment for transient link failures," in Proc. 18th Int. Teletraffic Congress, Berlin, Germany, Aug. 2003.
[5] S. Nelakuditi, S. Lee, Y. Yu, Z.-L. Zhang, and C.-N. Chuah, "Fast local rerouting for handling transient link failures," IEEE/ACM Trans. Networking,vol. 15, no. 2, Apr. 2007.
[6] Y.Wang, Z.Wang, and L. Zhang, "Internet traffic engineering without full mesh overlaying," in Proc. IEEE INFOCOM, Apr. 2001.
[7] W. Lou and Y. Fang, "A Multipath Routing Approach for Secure Data Delivery," Proc. IEEE Military Comm. Conf. (MilCom), 2001.

Paper Type	:	Research Paper
Title	:	A Critical Conceptual Analysis of Definitions of Artificial Intelligence as Applicable to Computer Engineering
Country	:	India
Authors	:	Prof Dalvinder Singh Grewal, PhD
	:	10.9790/0661-16210913

Abstract: The purpose of artificial intelligence is to acquire knowledge of required subject. Knowledge acquisition involves knowledge of dark energy (74% of universe), knowledge of dark matter (22%) and knowledge of visible matter (4%). This knowledge can be gathered through biological sensors (5 senses) and non-biological sensors like, robot, TV, mobile, camera, microscopes, radar, computer etc. The present definitions of artificial intelligence cover only the computer portion of the visible word i.e., an iota of 4% hence are not complete.

[1]. Allen Newell: Unified Theory of Cognition
[2]. Colom R, Karama S, Jung RE, Haier RJ, (2010), Dialogues Clin Neurosci;12(4):489-501.
[3]. Dan W Patterson, 2004, Introduction to Artificial Intelligence & expert system, practice Halls of India.p.2
[4]. en.wikipedia.org/wiki/Artificial _intelligence.
[5]. Knowledge representation: ACM 1998, I.2.4, Russell & Norvig 2003, pp. 320-363, Poole, Mackworth & Goebel 1998, pp. 23-46, 69-81, 169-196, 235-277, 281-298, 319-345, Luger & Stubblefield 2004, pp. 227-243, Nilsson 1998, chpt. 18

Paper Type	:	Research Paper
Title	:	An Enhanced Area Reduction Technique for Integrated Circuit using Genetic Algorithm
Country	:	India
Authors	:	Mr. Amarjit Singh, Ms. Harshit
	:	10.9790/0661-16211419

Abstract: Genetic algorithms are implemented as a computer simulation in which a population of abstract representations (called chromosomes or the genotype or the genome) of candidate solutions (called individuals, creatures, or phenotypes) to an optimization problem evolves toward better solutions. In this paper Genetic Algorithm has been implemented to reduce the area for integrated circuits. Different operators have been implemented along with the proposed algorithm for area reduction of integrated circuits. It has been found that the proposed algorithm gave better results as compared to other operators in order to minimize the area. Genetic algorithm with proposed operator uses the least CPU time and the least number of iterations to reduce the area of integrated circuit. Keywords: Genetic Algorithm, Integrated Chip

[1] F. Darema, S. Kirkpatrick, and V. A. Norton "Parallel techniques for chip placement by simulated annealing on shared memory
systems," in Proc. IEEE Int. Conf. on Computer Design, pp. 87-90, 2007.
[2] L. Davis "Job shop scheduling with genetic algorithms," in Proc.Int. Conf. on Genetic Algorithms and Their Applications, pp. 136-
140, 2006.
[3] J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht "Genetic algorithms for the traveling salesman problem." in Proc. Inr.
Con$ on Genetic Algorithms and Their Applications, pp. 160-168. 2006.
[4] Goldberg, D.E. (2008): Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA.
[5] Holland, J.H. (2006): Adaptation in Natural and Artificial Systems, University of Michigan Pres, Ann Arbor, , pp. 70-80 .
[6] Ray-I Gang and Pei-Yung Hsiao "Force Directed Self-organizing Map and its Application to VLSI Cell Placement" in Proc. IEEE
Int. Conf. on Computer Design pp. 103 - 109 vol.1, 2012.

Paper Type	:	Research Paper
Title	:	Dynamic Router Selection and Encryption for Secure Data Transmission in Wireless Sensor Networks
Country	:	India
Authors	:	Vyshak C, Aruna M G
	:	10.9790/0661-16212025

Abstract:Among the various possible threats in the WSN‟s, like node failure, data security, etc., we are presenting this paper in order to circumvent or overcome the "black holes‟ that are formed due to compromised -node (CN) and denial-of-service (Denial of service) by using some routing mechanisms. Basic idea of developing this paper is nothing but combat the vulnerability of existing system in handling such attacks due to their deterministic nature i.e., once an obstructionist can gather or acquire the routing algorithm can figure out the same routes known to the source, and hence intimidate all information sent over these routes.

1] G. O. Young, ―Synthetic structure of industrial plastics (Book style with paper title and editor),‖ in Plastics, 2nd ed. vol. 3, J. Peters, Ed. New York: McGraw-Hill, 1964, pp. 15–64.
[2] W.-K. Chen, Linear Networks and Systems (Book style). Belmont, CA: Wadsworth, 1993, pp. 123–135.
[3] H. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1985, ch. 4.
[4] B. Smith, ―An approach to graphs of linear forms (Unpublished work style),‖ unpublished.
[5] E. H. Miller, ―A note on reflector arrays (Periodical style—Accepted for publication),‖ IEEE Trans. Antennas Propagat., to be published.
[6] J. Wang, ―Fundamentals of erbium-doped fiber amplifiers arrays (Periodical style—Submitted for publication),‖ IEEE J. Quantum Electron., submitted for publication.

Paper Type	:	Research Paper
Title	:	Survey on Intrusion Detection System in Heterogeneous WSN Using Multipath Routing
Country	:	India
Authors	:	G.Saravanan1, Pravin R.Patil, M.Rajeev Kumar
	:	10.9790/0661-16212631

Abstract: In this paper, we propose an survey on heterogeneous wireless sensor network (HWSN) and how the efficiency and redundancy management is exploit in the various methods .Here timeliness and security are main concern to maximize the system lifetime by ensuring various methods like Intrusion detection system (ids), multipath routing, etc, The main goal of the paper is to reveal various methods which are used to maintain best redundancy level and increasing the energy efficiency.

[1] Norah Tuah and Mahamod Ismail "Extending Lifetime of Heterogeneous Wireless Sensor Network using Relay Node Selection" International Conference of Information and Communication Technology (ICoICT), 2013
[2] Anuparp Boonsongsrikul, Slavko Kocijancic and Somjet Suppharangsan "Effective Energy Consumption on Wireless Sensor Networks: Survey and Challenges" MIPRO 2013, May 20-24, 2013
[3] Ismail Butun, Salvatore D. Morgera, and Ravi Sankar "A Survey of Intrusion Detection Systems in Wireless Sensor Networks" IEEE COMMUNICATIONS SURVEY, Issue: 99, 2013
[4] Ing Ray Chen, Anh Phan Speer, Mohamed Eltoweissy "Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query Based Wireless Sensor Networks" IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 8, NO. 2, MARCH-APRIL 2011
[5] Philipp Hurni and Torsten Braun "Energy-Efficient Multi-Path Routing in Wireless Sensor Networks" 7th International Conference, September 10-12, 2008

Paper Type	:	Research Paper
Title	:	Classification of Micro Array Gene Expression Proposed using Statistical Approaches
Country	:	India
Authors	:	Ms. Selva Mary. G, Asst. Prof. Sachin M. Bojewar
	:	10.9790/0661-16213236

Abstract: Classification analysis of microarray gene expression data has been performed widely to find out the biological features and to differentiate intimately related cell types that usually appear in the diagnosis of cancer. Many algorithms and techniques have been developed for the microarray gene classification process. These developed techniques accomplish microarray gene classification process with the aid of three basic phases namely, dimensionality reduction, feature selection and gene classification. In our previous work, microarray gene classification by statistical analysis approach with Fuzzy Inference System (FIS) was proposed for precise classification of genes to their corresponding gene types. Among various dimensionality reduction techniques, the paper proposed prescribed statistical procedures to efficiently perform the classification process.

[1] Osmar, "Introduction to Data Mining", In: Principles of Knowledge Discovery in Databases, CMPUT690, University of Alberta, Canada, 1999
[2] Kantardzic and Mehmed, "Data Mining: Concepts, Models, Methods, and Algorithms", John Wiley & Sons, 2003
[3] Umarani and Punithavalli, "A Study on Effective Mining of Association Rules from Huge Databases", International Journal of Computer Science and Research, Vol. 1, No. 1, pp. 30-34, 2010
[4] Chieh-Yuan Tsai and Min-Hong Tsai, " A dynamic Web service based data mining process system", In Proceedings of the 5th IEEE International Conference on Computer and Information Technology, pp. 1033-1039, 21- 23 September, 2005
[5] Lamine M. Aouad, Nhien-An Le-Khac and Tahar M. Kechadi, "Distributed Frequent Itemsets Mining in Heterogeneous Platforms", Journal of Engineering, Computing and Architecture, Vol. 1, No. 2, 2007
[6] J. Han and M. Kamber, "Data Mining: Concepts and Techniques. Morgan Kaufman, San Francisco, 2000

Paper Type	:	Research Paper
Title	:	Segmentation techniques used image reconigation and SAR Image Processing
Country	:	India
Authors	:	Joyjit Patra, Arun Kanti Manna, Himadri Nath Moulick, Ashish kumar
	:	10.9790/0661-16213743

Abstract: Image segmentation is the process of partitioning an image intomultiple segments, so as to change the representation of an image into something that is more meaningful and easier to analyze.Several general-purpose algorithms and techniques have beendeveloped for image segmentation.This paper describes the different segmentation techniques used in the field of ultrasound and SAR Image Processing. Firstly this paper investigates and compiles some of the technologies used for image segmentation.Then a bibliographical survey of current segmentation techniques is given in this paper and finally general tendencies in image segmentation are presented .

Keywords: Gray Histogram Technique, Pareto Approach (PTA),Segmentation,Clustering.

[1] A. K. Jain, R. Duin, ―Statistical pattern recognition: A review‖. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no.1, pp. 4–37, 2000.
[2] A. N. Otsu, ―A threshold selection method from gray-level histogram‖. IEEE Transactions on Systems, Man. And Cybernetics, pp. 62-66, 1978.
[3] T. A. Pun, ―New method for gray-level picture thresholding using the entropy of the histogram‖. Signal Processing, vol.2, pp. 223-237, 1980.
[4] J. N. Kapur, P. K. Sahoo, K. C. Wong, ―A new method for graylevel picture thresholding using the entropy of the histogram‖.Computer Vision, Graphics, and Image Processing, vol.29, pp. 273-285, 1985.
[5] A. H. Abutaleb, ―Automatic thresholding of gray-level pictures using two-dimensional entropy‖. Computer Vision, Graphics and Image Processing, vol.47, pp. 22-32, 1989.

Paper Type	:	Research Paper
Title	:	Role Based and Energy Efficient Trust System for Clustered Wsn
Country	:	India
Authors	:	S. Jeyantha Jafna Juliet, M. Varghese
	:	10.9790/0661-16214448

Abstract: Security and trust are two interdependent concepts and are often used interchangeably when defining a secure wireless sensor network (WSN) system .However, security is different from trust in that, it assumes no node is trustworthy and requires ongoing authentication using sophisticated protocols leading to high communication and computation overheads. This makes the traditional cryptographic security tools hard, if not impossible, to be used in wireless sensor networks that are severely resource constrained. Trust on the other hand is the exact opposite of security in that any node can interact with any other and requires no authentication and mapping of hidden keys to carry on with their business and hence carries zero overhead. Trust management scheme calculates the trustworthiness of the node. Several trust systems have been proposed for the WSN.But they suffer from various limitation such as high cost and overhead. So light weight trust system is necessary because of the node's resource constrained nature. This proposed system provides light weight trust decision making and it improves the dependability of the system by cancelling the feedback between clustered members. It uses self adaptive weighting scheme for trust aggregation. Thus, it needs less memory and communication overhead.

1] D. Kumar, T. C. Aseri, R.B. Patel, EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks, Comput. Commun., Vol. 32, no. 4, pp. 662-667, Apr. 2009
[2] Y. Jin, S. Vural, K. Moessner, R. Tafazolli, An Energy-Efficient Clustering Solution for Wireless Sensor Networks , IEEE
Trans. Wireless Comm.. vo. 10, no. 11, pp. 3973-3983, Nov. 2011
[3] O. Younis and S. Fahmy, HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad-Hoc Sensor Networks,IEEE Trans. Mobile Compt., vol. 3, no. 4, pp. 366-379, Oct. 2004.
[4] S. Ganeriwal, L. K. Balzano, and M. B. Srivastava, Reputation-based framework for high integrity sensor networks, ACM Trans. Sensor Netw., vol. 4, no. 3, pp. 1-37, May 2008.
[5] Y. Sun, Z. Han, K. J. Ray Liu, Defense of Trust Management Vulnerabilities in Distributed Networks, IEEE Comm. Mag., Vol.46, No. 2, pp. 112-119, Feb. 2009.

Paper Type	:	Research Paper
Title	:	Multicast and Unicast Communication in Vehicular Network Using IPv6.
Country	:	India
Authors	:	Uma Nagaraj, Deesha G.Deotale, Sumit A.Khandelwal
	:	10.9790/0661-16214956

Abstract: Now a days the research is going on in Vehicular ad-hoc network to make a city as Smart city for the driver and passengers to navigate and to obtain relevant information and avoid the traffic accident. In the proposed system we discuss the different ways of communication for transferring or exchanging the information between the system available in the vehicle and infrastructure. Here we concentrate on the Multicast communication using Internet protocol version 6(IPV6) for faster transferring information to more system as compared with the unicast communication.

Keywords: IPv6, Multicast, unicast,OBU,RSU

[1] Yacine Khaled, Ines Ben Jemaa, Manabu Tsukada and Thierry Ernst "Application of IPv6 multicast to VANET" 2009 IEEE
[2] B. Haberman and D. Thaler. Unicast-prefix-based ipv6 multicast addresses. Rfc, IETF, 2002.
[3] T. Hain. An ipv6 geographic global unicast address format. Internet-draft, IETF, 2008.
[4] Stephen E. Deering and Robert M. Hinden. Internet Protocol, Version 6 (IPv6). Internet RFC 2460, December 1998.
[5] BHATTACHARYYA, S. An Overview of Source-Specific Multicast (SSM). Requestor Comments (RFC) 3569, Internet Engineering Task Force, July 2003.
[6] DEERING, S. Host Extensions for IP Multicasting. Request for Comments (RFC) 1112, Internet Engineering Task Force, Aug. 1989.

Paper Type	:	Research Paper
Title	:	Optimized Link State Routing Protocol Using Detection lgorithm in Manet
Country	:	India
Authors	:	Jayanta Das, Abhijit Das
	:	10.9790/0661-16215762

Abstract: A mobile ad hoc network consists of mobile networks which create an underlying architecture for communication without the help of traditional fixed-position routers. Nevertheless, the architecture must maintain communication routes although the hosts are mobile and they have limited transmission range. There are different protocols for handling the routing in the mobile environment. This paper will focus on one well known algorithm: Optimized Link State Routing Protocol as well as shared cryptographic technique.

[1] P. Jacquet , A. Laouiti, P. Minet and L. Viennot "Performance Analysis of OLSR Multipoint Relay Flooding in Two Ad Hoc Wireless Network Models." Research Report-4260. INRIA, September 2001. RSRCP journal special issue on Mobility and Internet.
[2] Y.Xiao, X. Shen. And D.Z.Du(Eds). " A survey on attacks and countermeasures in mobile ad hoc networks", Wireless /Mobile Network Security , chapter 12, pp 1-38, (Springer, 2006).
[3] Xiaoyan Hong, Kaixin Xu and Mario Gerla "Scalable Routing Protocols for Mobile Ad Hoc Networks." Computer Science Department, University of California, Los Angeles, August 2002.
[4] Koey Huishan, Chua Huimin and Koh Yeow Nam "Routing Protocols in Ad hoc Wireless Networks." National University of Singapore, Singapore.
[5] Ying Ge, Thomas Kunz and Louise Lamont "Quality of Service Routing in Ad-Hoc Networks Using OLSR." Proceeding of the 36th Hawaii International Conference on System Science (HICSS‟03).
[6] P. Jacquet, A. Laouiti, P. Minet and L. Viennot "Performance of multipoint relaying in ad hoc mobile routing protocols." Networking 2002. Pise (Italy) 2002.

Paper Type	:	Research Paper
Title	:	"Traffic Congestion Detection in Vehicular Adhoc Networks using GPS"
Country	:	India
Authors	:	Disha Shrivastava, Arun Agrawal
	:	10.9790/0661-16216369

Abstract: In today's world traffic congestion is the critical issue. Huge amount of time, fuel and money is wasted due to traffic jams all around the world. Drivers select the path that they consider will be the fastest; however the inability of drivers to know the road situation ahead creates severe congestion. The competency of a driver to know the traffic situation on roads will make the driver capable of saving time and fuel by taking alternative routes. In this work we have proposed a traffic congestion detection system using Vehicular adhoc networks (VANETs), which will provide efficient communication between cars and infrastructure and propagate real time information about traffic congestion to the drivers. We also uses the GPS device to detect the congested areas and defines various works. Keywords: Vehicular Ad-hoc networks, Mobile Ad-hoc networks,ITC, v2v and v2i

1] Scharank, David and Lomax, Tim. The 2007 Urban Mobility Report. Technical Report. s.l. : Texas Transportation Institute, September 2007.
[2] VANET. Wikipedia.org. [Online] en.wikipedia.org/wiki/VANET.
[3] Fukumoto, Junya, et al. Analytic Method for Real-Time Traffic Problems by Using Content Oriented Communications in VANET. 7th International Conference on ITS. 2007, pp. 1-6.
[4] Dornbush, S. and Joshi, A. StreetSmart Traffic: Discovering and Diseminationg Automobile Congestion using VANET. Vehicular Technology Conference. 2007, pp. 11-15.
[5] Yoon, Jungkeun, Noble, Brian and Liu, Migyan. Electrical Engineering and Computer Science. University of Michigan.
[6] W. W. Kao. Integration of gps and dead-reckoning navigation systems. In Proc. Vehicle Navigation and Information Systems Conference, pages 635 – 643, 1991.

Paper Type	:	Research Paper
Title	:	Circuit Nanotechnology: QCA Adder Gate Layout Designs
Country	:	India
Authors	:	Wani Shah Jahan, Peer Zahoor Ahmad, Peer M A, Khan K A
	:	10.9790/0661-16217078

Abstract: Quantum-dot Cellular Automata (QCA) based circuit designs have been explored since its concept development in early 1980's. Although there are lot of implementation barriers for the development of this nanotechnology to work smoothly at room temperature but the simulated circuit implementations have attracted a large number of researchers towards this new field. The success of metal dot implementation even at very low temperatures has paved a way for exploring new possibilities in computing paradigm. An ample of circuit layouts have been proposed for the design of EX-OR gate, a vital element for arithmetic processes. We have analyzed some reported layouts in terms of their simulation accuracy, latency, cell count and noise performance to propose few single layer robust circuits for their efficient implementation.

Keywords: QCA Cell, Electrostatic noise, Simulator, Tunneling, Majority gate, Lattice structure.

[1] C. S. Lent and P. D. Tougaw, W. Porod and G. H. Bernstein, Quantum Cellular Automata, Nanotechnology, Vol. 4, 1993, 49-57
[2] C. S. Lent and P. D. Tougaw, A Device Architecture for Quantum Dots, Proceedings of the IEEE, Vol. 85, No. 4, April 1997, 541-557Gregory L. Snider, Alexci O. Orlov, Vishwanath Joshi et. el., Quantum-Dot Cellular Automata: Introduction and Experimental Overview, IEEE-NANO, 2001
[3] Amlani I. et. el., Demonstration of a Functional Quantum-Dot Cellular Automata Cell, Journal of Vacuum Science and Technology B, 16, 1998, 3795
[4] Amlani I., Alexci O. Orlov et. el., Digital Logic Gates using Quantum-Dot Cellular Automata, Science, 284, 1999, 289-291
[5] Gregory L. Snider, Alexci O. Orlov, Vishwanath Joshi et. el., Quantum-Dot Cellular Automata: Introduction and Experimental Overview, IEEE-NANO, 2001

Paper Type	:	Research Paper
Title	:	Security Enhancement in Interactive CAPTCHA
Country	:	India
Authors	:	Kumary R Soumya, Athira Sasikumar, Sancy P Prakash
	:	10.9790/0661-16217984

Abstract: CAPTCHA stands for Computer Automated Public Turing Test to Tell Computers and Humans Apart.It is a defense system against attacks on websites.The paper deals with a variant of conventional CAPTCHA named Interactive CAPTCHA which uses a series of user interactions to solve the CAPTCHA.The proposed system also encrypts the CAPTCHA response send to the server so as to avoid attacks like MITM(Man In The Middle attacks).The system uses a Secure Socket Layer(SSL) connection to transmit the encrypted response to the server providing additional security.Encryption and decryption of CAPTCHA response is done by the Rivest Shamir Adleman(RSA) algorithm using a encryption/decryption key pair.

Keywords: CAPTCHA, Instant Messenger CAPTCHA Attack, RSA,SSL

1] Krishna Kant, Ravishankar Iyer, Prasant Mohapatra, "Architectural Impact of Secure Socket Layer on Internet Servers: A Retrospect", published by IEEE, 2012, pp 25-26
[2] Huy D. Truong, Christopher F. Turner, Cliff C. Zou,"iCAPTCHA: The Next Generation of CAPTCHA Designed to Defend Against 3rd Party Human", published by IEEE, 2012.
[3] Jeff Yan, Ahmad Salah El Ahmad, "A Low-Cost Attack on a Microsoft CAPTCHA", Proceedings of the 15th ACM conference on Computer and communications security, 2008.
[4] Elias Athanasopoulos, Spyros Antonatos,"Enhanced CAPTCHAs: Using Animation to Tell Humans and Computers Apart". Communications and Multimedia Security 2006: 97-108
[5] Sam Hocevar, "PWNtcha – a Captcha Decoder Website",http://caca.zoy.org/wiki/PWNtcha

Paper Type	:	Research Paper
Title	:	Secure and Reliable Document Faxing through Wi-Fi using Cloud
Country	:	India
Authors	:	Sneha Sharma, Gauri Wavhal, Manasveena Suguru, Karishma Tale
	:	10.9790/0661-16218590

Abstract: Secure and reliable document faxing through Wi-Fi using cloud is android based application where one can send documents through Wi-Fi within an organization. Organizations mostly use Gmail, Yahoo etc. for sending documents this can hamper the confidentiality. Hence, this application has proposed a new way of sending documents and messages which can be video audio and any file, where organization will have a private cloud which will maintain all user account. Since this is going to be implemented on INTRANET, an individual can only have access to these files within an organization. Faxing can be done in three ways: - Normal mode: where message is sent and received normally with simple encryption decryption. Semi secure mode: where message is sent from sender with a key, that key will be used to open message.(besides encryption decryption). Ultra secure mode: where message will be sent from sender with a key and another key will be sent to his phone by simple SMS so the receiver will need two keys to open the message. Highly confidential data can be sent through this mode.
Keywords: Wi-Fi; AES; SMS; Mode; Encryption; Decryption; Android.

[1] Prof. Rashmi Chavan and Prof.Manoj Sabnees "Secured Mobile Messaging","2012 International Conference on Computing, Electronics and Electrical Technologies [ICCEET]".
[2] David Lisonek "SMS Encryption for Mobile Communication","2008 International Conference on Se curity Technology"
[3] Rohan Rayarikar, Sanket Upadhyay and Priyanka Pimpale "SMS encryption using AES Algorithm on Android", "2012 International Journal of Computer Application"
[4] Mary Agoyi and Devrim Seral "SMS security: AN Asymmetric Encryption approach", "2010 sixth international conference on wireless and mobile communication"
[5] Ario Yudo Husodo and Rinaldi Munir "Arithmetic coding modification to compress SMS", "2011 International Conference on Electrical Engineering and Informatics 17-19 July 2011, Bandung, Indonesia"

Paper Type	:	Research Paper
Title	:	Survey On: Mining High Utility Itemsets from Transactional Database
Country	:	India
Authors	:	Vinutha C., Yogish H. K.
	:	10.9790/0661-16219193

Abstract: Utility mining emerges as an important topic in data mining field. Mining high utility itemsets from databases refers to finding the itemsets with high profits. The meaning of itemset utility is interestingness, importance, or profitability of an item to users. Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Although several relevant algorithm has been proposed in recent years, they incur the problem of producing a large number of candidate itemsets for high utility itemsets. Such a large number of candidate itemsets degrades the mining performance in terms of execution time and space requirement. The situation may become worse when the database contains lots of long transactions or long high utility itemsets. This research work focuses on efficient method for high utility itemset mining, to reduce number of overestimated itemsets and to reduce the search space in order to improve the performance of high utility itemset mining.
Key Terms: Candidate itemset, frequent itemset, high utility itemset, utility mining, data mining.

[1] R Agrawal and R Srikant, "Fast Algorithms for Mining Association Rules," Proc 20th Int'l Conf Very Large Data Bases (VLDB), pp. 487-499, 1994.
[2] J Han, J Pei, and Y Yin, "Mining Frequent Patterns without Candidate Generation," Proc ACM-SIGMOD Int'l Conf Manage- ment of Data, pp. 1-12, 2000.
[3] C.H. Cai, A.W.C. Fu, C.H. Cheng, and W W Kwong, "Mining Association Rules with Weighted Items," Proc Int'l Database Eng and Applications Symp (IDEAS '98), pp 68-77, 1998.
[4] F Tao, F Murtagh, and M Farid, "Weighted Association Rule Mining Using Weighted Support and Significance Framework," Proc ACM SIGKDD Conf Knowledge Discovery and Data Mining (KDD '03), pp 661-666, 2003.
[5] C.F. Ahmed, S.K. Tanbeer, B.-S. Jeong, and Y.-K Lee, "Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 12, pp. 1708-1721, Dec. 2009.

Paper Type	:	Research Paper
Title	:	Survey and Comparative Study on Resource Allocation Strategies in Cloud Computing Environment
Country	:	India
Authors	:	Vinayak Awasare, Sudarshan Deshmukh
	:	10.9790/0661-162194101

Abstract: Cloud computing is an essential ingredient of modern computing systemsCloud computing provides an on demand service because it offers dynamic resource allocation for reliable and highly available services in pay as-you-consume manner to public. In Cloud computing environment multiple cloud users can request number of cloud services in parallel. So there must be a provision that all resources which are made available to requesting user in efficient manner to satisfy their need. In this Survey paper a review of various strategies for dynamic resource allocation in cloud computing is shown based on Linear Scheduling Strategy for Resource Allocation, Topology Aware Resource Allocation (TARA) and Dynamic Resource Allocation for Parallel Data Processing. Moreover limitations significance and advantages of using Resource Allocation in Cloud computing systems is also discussed.
Index Terms: Cloud Computing, Dynamic Resource Allocation, Resource Management, Resource Scheduling.

[1] V. Vinothina, Dr. R. Shridaran, and Dr. Padmavathi Ganpathi, A survey on resource allocation strategies in cloud computing,
International Journal of Advanced Computer Science and Applications, 3(6):97--104, 2012.
[2] Gunho Lee, Niraj Tolia, Parthasarathy Ranganathan, and Randy H. Katz, Topology aware resorce allocation for data-intensive
workloads, ACM SIGCOMM Computer Communication Review, 41(1):120--124, 2011.
[3] Abirami S.P. and Shalini Ramanathan, Linear scheduling strategy for resource allocation in cloud environment, International
Journal on Cloud Computing: Services and Architecture(IJCCSA), 2(1):9--17, 2012.
[4] Daniel Warneke and Odej Kao, Exploiting dynamic resource allocation for efficient parallel data processing in the cloud, IEEE
Transactions On Parallel And Distributed Systems, 2011.
[5] Atsuo Inomata, Taiki Morikawa, Minoru Ikebe and Md. MizanurRahman, Proposal and Evaluation of DynamicResource Allocation
Method Based on the Load Of VMs on IaaS, IEEE, 2010.

Paper Type	:	Research Paper
Title	:	Filter Based addressing protocol for effective Node Auto configuration in Ad hoc Network
Country	:	India
Authors	:	R.Varunpriyan, Mr. A. Piosajin
	:	10.9790/0661-1621102108

Abstract: MANET is used for many distributed network, the lack of a centralized administration makes these networks attractive for several distributed applications, such as sensing, Internet access to deprived communities, and disaster recovering. Mobility feature of the Ad hoc Network produce many problems in the network, due to this feature ad hoc network does not maintain any infrastructure ,it also Address affects address assignment of the nodes in network ,that is node's address configuration . As other wireless networks, ad hoc nodes also need a unique network address to enable multihop routing and full connectivity. Address assignment in ad hoc networks, is even more challenging issue Because of the self-organized nature of these environments some time it leads to node's address collision in the network. To solve this problem many protocols proposed. It increases the control load of the network. Another important issue is frequency partition in the network due to fading channels. Proposed system gives the solutions to this problem, This system proposes the FAP, it achieves low communication overhead and low latency, resolving all address collisions even in network partition merging events. When compared to other system it reduces the overhead.
Keywords: Ad hoc network,; FAP.

[1] D. O. Cunha, O. C. M. B. Duarte, and G. Pujolle, "A cooperation aware routing scheme for fast varying fading wireless channels," IEEE Commun. Lett., vol. 12, no. 10, pp. 794–796, Oct. 2008
[2] N. C. Fernandes, M. D. Moreira, and O. C. M. B. Duarte, "An efficient filter-based addressing protocol for autoconfiguration of mobile ad hoc networks," in Proc. 28th IEEE INFOCOM, Rio de Janeiro, Brazil, Apr. 2009, pp. 2464–2472
[3] C. E. Perkins, E. M. Royers, and S. R. Das, "IP address autoconfigura- tion for ad hoc networks," Internet draft, 2000.
[4] B. Parno, A. Perrig, and V. Gligor, "Distributed detection of node replication attacks in sensor networks," in Proc. IEEE Symp. Security Privacy, May 2005, pp. 49–63.
[5] N. H. Vaidya, "Weak duplicate address detection in mobile ad hoc networks," in Proc. 3rd ACM MobiHoc, 2002, pp. 206–216.