iosr-JCE   Volume-16 ~ Issue-4 ~ July-August 2014

Paper Type	:	Research Paper
Title	:	User Search Goal Prediction based on Feedback Sessions
Country	:	India
Authors	:	Sreerenjini. P. R , Prasanth. R. S
	:	10.9790/0661-16420104

Abstract: If the topic is very vast and the query is ambiguous, the users may be having different search goals when they submit the queries to a search engine. The goals of the users can be analysed in order to make the search engine results more relevant. In this paper, the Click through Logs are analyzed to create feedback Sessions. These feedback Sessions generated are used to create Pseudo documents . These Pseudo documents are further analysed and clustered based on Kmeans clustering algorithm. Then these clustered documents are checked for relevance evaluvation using Classified Average Precision(CAP).

[1] Zheng Lu, Student Member, IEEE, Hongyuan Zha, Xiaokang Yang, Senior Member, IEEE,Weiyao Lin, Member, IEEE, and Zhaohui Zheng, " ¸A New Algorithm for Inferring User Search Goals with Feedback Sessions", IEEE Transactions on IEEE Transactions on Knowledge and Data Engineering, vol 25, no. 3 ,March 2013.

[2] D. Beeferman and A. Berger," ¸Agglomerative Clustering of a Search Engine Query Log", Proc. Sixth ACM SIGKDD Conf. Knowledge Discovery and Data Mining , 2000

[3] R. Baeza-Yates, C. Hurtado, and M. Mendoza¸S,"Query Recommendation Using Query Logs in Search Engines".

[4] Jaime Teevan MIT,Susan T. Dumais, (Microsoft Research,)Eric Horvitz(Microsoft Research)".Personalizing Search via Automated Analysis of Interests and Activities."

[5] Uichin Lee, University of California,Zhenyu Liu University of California ,Junghoo Cho University of California "Automatic Identification of User Goals in Web Search"

Paper Type	:	Research Paper
Title	:	A Comparative Study of Contrast Enhancement using Image Fusion
Country	:	India
Authors	:	Debalina Ghosh , K.N.Dey
	:	10.9790/0661-16420508

Abstract : Image enhancement is used to improve the visual quality of an image. In this paper a different approach on image fusion has been described for image enhancement. The two main algorithms involved in this approach are Recursive Mean Separate Histogram Equalization and Linear Image Fusion. To get the fused image in this approach the input images are the original image and the Recursive Mean Separate Histogram Equalised image of the original image. The quality of an image has been judged by the parameters of Average Gradient and Standard Deviation and the result is compared with the image obtained after Linear Image Fusion.

Keywords: Histogram equalization, linear image fusion, recursive mean separate histogram equalization, average gradient, standard deviation.

[1] R. Gonzalez and R. Woods, Digital Image Processing, 2nd ed., Prentice Hall, Jan. 2002, pp. 75-102, 134-137, 572-581

[2] Cheng-Hsiung Hsieh, Bo-Chang Chen, Chih-Ming Lin, Qiangfu Zhao, "Detail Aware Contrast Enhancement with Linear Image Fusion", International Symposium on Aware Computing, 2010, pp. 1-5.

[3] 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.

[4] Y. Wang, Q. Chen, B. Zhang, "Image enhancement based on equal area dualistic sub-image histogram equalization method," IEEE Trans. on Consumer Electronics, vol. 45, no. 1, pp. 68-75, Feb. 1999.

[5] S.-D. Chen, A. Ramli, "Contrast enhancement using recursive mean-separate histogram equalization for scalable brightness preservation," IEEE Trans. On Consumer Electronics, vol. 49, no. 4, pp. 1301-1309, Nov.2003.

Paper Type	:	Research Paper
Title	:	An Analysis of VANET Topology Based Routing Approach on Various Parameters
Country	:	India
Authors	:	Kriti Jaiswal , Om Prakash
	:	10.9790/0661-16420914

Abstract : Vehicular ad hoc network (VANET) is a peculiar subclass of mobile ad-hoc network (MANET) that has the potential in improving road safety and in providing travellers comfort. Currently it has gained an important part of interest of researchers and become very popular. One of the main challenges in VANET is o searching and maintaining an effective route for transporting data information. Hence, an analysis on routing protocols based on various parameters of VANET is a necessary issue in communication. Simulation tools has been preferred over outdoor experiment because it simple, easy and cheap. VANET requires that a traffic & network simulator should be used together to perform the test. In this paper, we present brief analysis of routing protocols and ending up with the most appropriate simulation tools to simulate VANET protocols and application.
Keywords: Mobile ad-hoc network (MANET), Vehicular ad-hoc network (VANET), Routing Protocols, Performance Parameter, and Simulators etc.

[1] Saif Al-Sultan, Moath M. Al-Doori, Ali H. Al-Bayatti, Hussien Zedan," A comprehensive survey on vehicular Ad Hoc network", Journal of Network and Computer Applications, journal.
[2] Sherali Zeadally, Ray Hunt, Yuh-Shyan Chen, Angela Irwin, Aamir Hassan, "Vehicular ad hoc networks (VANETS): status, results, and challenges", Telecommun Syst DOI 10.1007/s11235-010-9400-5.
[3] Yue Liu, Jun Bi, Ju Yang, "Research On Vehicular Ad Hoc Networks", 978-1-4244-2723-9/09/$25.00 ©2009 IEEE.
[4] Sivasakthi M, Suresh S.R, "Research on vehicular ad hoc networks (VANETs): An Overview", Int. Journal of Applied Sciences and Engineering Research, Vol. 2, No. 1, 2013, ISSN 2277-8442.
[5] Marwa Altayb, Imad Mahgoub, "A Survey of Vehicular Ad Hoc Networks Routing Protocols", International Journal of Innovation and Applied Studies ISSN 2028-9324 Vol. 3 No. 3 July 2013, pp. 829-846.

Paper Type	:	Research Paper
Title	:	Cloud Computing –Its Prospects and Challenges
Country	:	India
Authors	:	Mrs.Papri Das, Dr. Pravin Bhatawala
	:	10.9790/0661-16421520

Abstract : The extensive use of information and communication technology has transformed manufacturing organizations and economies into information centric and customer focused organizations. In present times, the information about a product or customer has become as valuable to the company as the product or service. However gaining information is an evolutionary process which begins with collection and storage of data to analysis and processing which is transformed into knowledge. It is this knowledge that is mission critical for organizations and their success. It is extremely vital for an organization to ensure that at no point of operation, the data which enables it with this knowledge is compromised. To ensure this the organizations invest a significant volume of their capital to set up an IT infrastructure to Preserve, Process and Protect this most valuable asset to an organization in present paradigm, its data. However for a small and medium sized company it is extremely demanding to implement the fundamentals of this new information based economy as it requires a significant investment upfront. For such organizations choosing cloud computing is a cost effective alternative but with obvious concerns. Cloud Computing offers the opportunity to access IT resources and services with appreciable convenience and speed. Whilst cloud computing is gaining growing popularity in the IT industry, it also meets with some challenges like data security, integrity, availability. This paper discusses the concept of "cloud" computing and its prospects and challenges. The benefits of cloud computing has led increasingly many enterprises to outsource their IT resources tothe cloud, despite some challenges. The main contribution of this paper is that we discuss challenges that organizations which want to migrate to cloud faces.

Key words: cloud computing, cloud technologies, service. etc.

[1]. Grance, P. M. (2009 , 7 10). http://www.nist.gov/itl/cloud/upload/cloud-def-v15.pdf. Retrieved april 15, 2014, from http://www.nist.gov National Institute of Standards and Technology, Information Technology Laboratory .
[2]. Janna Anderson, e. u. (2005). technical seminar report on cloud computing. intel excutive summary.
[3]. G.C. cloud computing, (2010, july 23-25). 2nd international symposium on information science and engineering. Retrieved 2014, from wikipedia.
[4]. G. C. everything as a service, (2010, july 23-25). 2nd international symposium on information science and engineering. Retrieved 2014
[5]. "what is cloud computing". (2008). journal of parallel and distributed computing .
[6]. A, A., & Erguvan, M. (2009). The truth about clous computing as new paradigm in IT. IEEE international conference on application of information and communication Technologies,AICT.

Paper Type	:	Research Paper
Title	:	A Multi Core Hyper-Threaded Solution of a System of Linear Equations for Intelx64 Architecture
Country	:	India
Authors	:	Richa Singhal, Dr. Sanjeev Bansal
	:	10.9790/0661-16422126

Abstract : A system of linear equations forms a very fundamental principal of linear algebra with very wide spread applications involving fields such as physics, chemistry and even electronics. With systems growing in complexity and demand of ever increasing precision for results it becomes the need of the hour to have methodologies which can solve a large system of such equations to accuracy with fastest performance. On the other hand as frequency scaling is becoming limiting factor to achieve performance improvement of processors modern architectures are deploying multi core approach with features like hyper threading to meet performance requirements. The paper targets solving a system of linear equations for a multi core INTELx64 architecture with hyper threading using standard LU decomposition methodology. This paper also presents a Forward seek LU decomposition approach which gives better performance by effectively utilizing L1 cache of each processor in the multi core architecture. The sample uses as input a matrix of 4000x4000 double precision floating point representation of the system. etc.

[1]. ^ Gottlieb, Allan; Almasi, George S. (1989). Highly parallel computing. Redwood City, Calif.: Benjamin/Cummings. ISBN 0-8053-0177-1.
[2]. Jump up^ S.V. Adve et al. (November 2008). "Parallel Computing Research at Illinois: The UPCRC Agenda" (PDF). Parallel@Illinois, University of Illinois at Urbana-Champaign. "The main techniques for these performance benefits – increased clock frequency and smarter but increasingly complex architectures – are now hitting the so-called power wall. The computer industry has accepted that future performance increases must largely come from increasing the number of processors (or cores) on a die, rather than making a single core go faster."
[3]. Jump up^ Asanovic et al. Old [conventional wisdom]: Power is free, but transistors are expensive. New [conventional wisdom] is [that] power is expensive, but transistors are "free"
[4]. Bunch, James R.; Hopcroft, John (1974), "Triangular factorization and inversion by fast matrix multiplication", Mathematics of Computation 28: 231–236, doi:10.2307/2005828, ISSN 0025-5718.
[5]. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), Introduction to Algorithms, MIT Press and McGraw-Hill, ISBN 978-0-262-03293-3.

Paper Type	:	Research Paper
Title	:	Identity Based Replicated Node Detection and Localization in Wireless Network
Country	:	India
Authors	:	Deepa Hurali, Prof. Vidya R. Kulkarni
	:	10.9790/0661-16422737

Abstract : Wireless networks are more prone towards identity-based attacks, especially the spoofing attacks. These spoofing attacks can further cause many other forms of attacks such as rouge access point attack and denial of service attacks (DOS). Hence the performance of the network is significantly impacted by them. Identity of the node can be verified through cryptographic authentication; however the conventional security approaches are not always possible because it requires infrastructural overhead and key management. In this paper we propose a method for detecting the spoofing attacks. This method utilizes MD5 (Message Digest 5) algorithm, which generates unique identification keys for all the nodes in the network. These unique keys are used as a basis for detecting the attacks and determining the actual number of attackers in the network and to localize these adversaries. Results of the project show that, the proposed method effectively detects the attack and locates the position of the adversaries performing the attack. There by it provides strong evidence to the effectiveness of the proposed method.

Keywords: Wireless network security, spoofing attack, Message Digest 5(MD 5), attack detection, localization

[1]. Bellardo.J and Savage.S, "802.11 denial-of-service attacks: Real vulnerabilities and practical solutions," in Proceedings of the USENIX Security Symposium, 2003, pp. 15 – 28.
[2]. Bohge.M and Trappe.W, "An authentication framework for hierarchical ad hoc sensor networks," in Proceedings of the ACM Workshop on Wireless Security (WiSe), 2003, pp. 79–87.
[3]. Bernaschi.M, Ferreri.F, and Valcamonici.L, "Access points vulnerabilities to dos attacks in 802.11 networks," in Proceedings of the IEEE Wireless Communications and Networking Conference, 2004.
[4]. Fernandez.E, and Magliveras.S, "Secure and efficient key management in mobile ad hoc networks," in Proc. IEEE IPDPS, 2005.
[5]. Wool. A, "Lightweight key management for ieee 802.11 wireless lans with key refresh and host revocation," ACM/Springer Wireless Networks, vol. 11, no. 6, pp. 677–686, 2005..

Paper Type	:	Research Paper
Title	:	Improved and Energy Efficient Olsr Protocol Using Spanning Tree in Manet
Country	:	India
Authors	:	Priyanka Patil, M.A.Rizvi
	:	10.9790/0661-16423842

Abstract : Mobile Adhoc Network is an autonomous and decentralized network. Its topology changes dynamically and message overhead is more due to its frequent change of topology in network. For reliable transmission there is need to design a network which overcomes these problems like; overhead, Link breakage, power consumption etc. In this paper an attempt is made to overcome above mentioned issues by devising a new concept by modifying existing standard OLSR protocol using spanning tree in network. This approach has improved Packet Delivery Ratio and Throughput also uses minimum energy while transmitting.

Keywords: EOLSR (Efficient Optimized Link State Routing), MANET, Multicast, OLSR, Overhead, Spanning Tree.

[1]. Mobile Ad Hoc Networks Asis Nasipuri
[2]. http://www.eexploria.com/manet-mobile-ad-hoc-network-characteristics-and-features/
[3]. Arun Kumar B. R, Lokanatha C. Reddy and Rajan and Prakash S. Hiremath "Route Failure Tolerant Multicast In Mobile Ad Hoc Networks Using Disjoint Minimum Spanning Trees" second IEEE ICCSIT 2009, August 8 - 11, 2009, Beijing, China
[4]. Arun Kumar B. R, Lokanatha C. Reddy and Rajan and Prakash S. Hiremath "Route Failure Tolerant Multicast in Mobile Ad Hoc Networks Using Disjoint Minimum Spanning TreesBased on Connectivity Index with Bandwidth constraint" 2010 IEEE 2nd International Advance Computing Conference
[5]. Arun Kumar B. R, Lokanatha C. Reddy and Rajan and Prakash S. Hiremath "Restoring the Connectivity in K-Connected MANET When All Edge Disjoint Minimum Spanning Trees Fail" IJCA Special Issue on "Mobile Ad-hoc Networks" MANETs, 2010

Paper Type	:	Research Paper
Title	:	Precedence Constraint Task Scheduling for Multicore Multikernel Architecture
Country	:	India
Authors	:	Hitesh P. Daulani, Dr. Radhakrishna Naik, Pavan S. Wankhade
	:	10.9790/0661-16424353

Abstract : In real-time systems tasks interact with each others to achieve common system goals, which develops precedence relation among tasks. Each task contributes to the output of system in some manner so contribution of each task should be taken into account. On the other hand processing platform market is booming with multi-core processors and various techniques are coming upfront to utilize processing power of each core efficiently. This paper presents the scheduling algorithm for real-time task set which respects precedence relationship among tasks as well as takes contribution of each task into account while scheduling the task set. Moreover paper targets the multi-core processing platform which has multikernel OS. Multikernel OS differs from single kernel OS in terms of number of kernels, communication among the tasks etc. Proposed scheduling algorithm is analyzed by simulating real-time task set on identical quad core processor and results are compared with PCD scheduling algorithm.

Keywords: Admission Controller, Multicore, Multikernel OS, PCF (Performance Contribution Factor), Precedence Constraint, Real-time scheduling etc.

[1] C. L. Liu and James W. Layland, "Scheduling algorithm for multiprogramming in a hard Real-time environment", Journal of ACM 20, pp. 46-61, 1973
[2] Rakesh Kumar, Norman P.Jouppi and Parthasarathy Ranganathan "Heterogeneous Chip Multiprocessors", IEEE Computer Society pp32-38, .2005
[3] Andrew Baumann et al. "The Multikernel: A new OS architecture for scalable multicore systems", SOSP '09: 22nd ACM SIGOPS Symposium on Operating systems principles, pp. 29–44, 2009.
[4] Rami Matarneh "Multi Microkernel Operating Systems for Multicore Processors", Journal of Computer Science pp 493-500, 2009
[5] Radhakrishna Naik, R.R.Manthalkar, "Performance Contribution Based Scheduling Framework for Precedence Constraint tasks in Real-time system", International Journal of Computer Science and Engineering, Vol. 3 (2), 2011, 664-675, 2011

Paper Type	:	Research Paper
Title	:	Immune Optimization Design of Diesel Engine Valve Spring Based on the Artificial Fish Swarm
Country	:	China
Authors	:	Rong Chen, Yi Shen, Peng Li, Xiaobin Hua, Mingxin Yuan
	:	10.9790/0661-16425459

Abstract : In order to improve the reliability of the structure design of the diesel engine valve spring and its working performance, an artificial fish swarm-based immune genetic algorithm (AFS-IGA) is proposed. After the mutation operation of the immune genetic algorithm (IGA), the train operator and foraging operator of the artificial fish algorithm are added to improve the convergence speed and strengthen the optimal performance of the basic immune genetic algorithm. Compared with genetic algorithm (GA) and the IGA, the function testing results show that the convergence speed of the AFS-IGA is faster, the optimization ability of the AFS-IGA is stronger, and the optimization precision is higher. Furthermore, the optimization design results of the diesel engine valve spring show that the optimization performance of the proposed algorithm is optimal, which verifies the robustness of the AFS-IGA.
Keywords: Valve spring, Artificial fish swarm algorithm, Immune genetic algorithm, Optimization design.

[1] B. Li, M.L. Zhu and X.W. Chen, Optimization design of valve spring of engine based on genetic algorithms, Machine Design, 9, 1998, 22-25.
[2] Q.G. Huan, Design of the internal combustion engine valve spring based on the fuzzy optimization, Science and Technology Innovation Herald, 23, 2012,25-27.
[3] L. Peng, L.L. Zhang and L.N. Yang, Using MATLAB to realize the optimization design of the compressed spring in the clutch based on immune genetic algorithms, Journal of Mechanical Transmission, 1, 2007, 40-42.
[4] Q.S. Gong, Optimized design of 50CrVA steel diesel engine valve spring, Journal of Hunan Institute of Engineering, 13(1), 2003, 30-31,51.
[5] L.A. Chen and P.N. Zhang, Realization of immune genetic algorithm in MATLAB, Journal of Fuzhou University(Natural Science), 32(5),2004, 554-559.

Paper Type	:	Research Paper
Title	:	CAE Analysis for Oil Leakage Mechanism of Transaxle Oil Seal
Country	:	Japan
Authors	:	Ryo Akaiwa, Kakuro Amasaka
	:	10.9790/0661-16426063

Abstract : In recent years, the authors have been conducting research on the establishment of technical prevention measures for automobile development and design. This research investigates the mechanisms that cause oil leaks in drive train oil seals, which are a matter of concern for automobile manufacturers around the world. In the case of automobile transaxle oil seals, the edge of the seal's rubber lip is in sliding contact with the surface of the drive shaft, and the seal serves to prevent the lubricating oil sealed inside the drive gearbox from leaking to the outside.

[1] Amasaka K, Osaki S. A Demonstrative Study on High Reliability of Drive System Design. John Wiley & Sons, Inc.; 2001.
[2] Magoshi Y, Fujisawa H, Sugiura T. Simulation technology applied to vehicle development. Journal of Society of Automotive Engineers of Japan; 2003, Vol. 57, No.3, 95-100
[3] Amasaka K. An Integrated Intelligence Development Design CAE Model Utilizing New JIT, Application to Automotive High Reliability Assurance. Journal of Advanced Manufacturing Systems; 2008, Vo.7, No.2, pp.221–241
[4] Amasaka K, Tsubaki H, Yamaji M, Ueno T. Establishment of Bolt Tightening Simulation System for Automotive Industry Application of the Highly Reliable CAE Model. International Business & Economics Research Journal; 2009, Vol.8, No.5, pp.57-67
[5] Mitsuhashi T, Takeoka S, Tanabe T, Yamaji K, Amasaka K. Concept of high reliability CAE for a fixed bolt (Part 2). Journal of the Japanese Society for Quality Control, The 83rd technical conference, Tokyo, Japan; 2007, 107-110

Paper Type	:	Research Paper
Title	:	CPRM: Cooperative Position based Routing scheme for MANETs
Country	:	India
Authors	:	Ginumol Jose, Prof. Kuttyamma A J
	:	10.9790/0661-16426470

Abstract : A mobile ad hoc network is a wireless communication network, where nodes that are not within direct transmission range of each other will require other nodes to forward data. Routing is difficult in MANET because mobility may cause radio links to break frequently. Mobile nodes keep changing their position in an unpredictable manner. A routing algorithm must keep track of the destination's position and modify routes whenever the old routes become stale. In a high mobility MANET, although every mode can move freely, they usually follow some mobility patterns.

[1]. Zehua Wang, Yuanzhu Chen, Cheng Li,CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad HocNetworks, IEEE Journal on selected areas in communications, vol. 30, no. 2, february 2012.
[2]. S. Biswas and R. Morris,ExOR: Opportunistic Multi-Hop Routing for Wireless Networks, in Proc. ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), Philadelphia, PA, USA, August 2005, pp. 133144.
[3]. Z. Wang, C. Li, and Y. Chen,PSR: Proactive Source Routing Ad Hoc Networks, in Proc. 2011 IEEE Conference on Global Telecommunications (GLOBECOM), Houston, TX USA, December 2011.
[4]. Yang, F. Zhong, C. K. Yeo, B. S. Lee, and J. Boleng,Position Based Opportunistic Routing for Robust Data Delivery in MANETs, in Proc. 2009 IEEE Conference on Global Telecommunications (GLOBECOM), Honolulu, Hawaii, USA, December 2009, pp. 13251330.

Paper Type	:	Research Paper
Title	:	Net Neutrality – A Look at the Future of Internet
Country	:	India
Authors	:	Mr. Havish Madhvapaty, Ms. Shiva Goyal
	:	10.9790/0661-16427177

Abstract : The Internet is an indispensable medium. The success story of Internet has evolved free from complex government regulation. But there is an increasing threat that Internet Service Providers (ISPs) will alter the accessible, open and neutral platform upon which the Internet was founded. Net neutrality might be one of the most discussed, least understood concept in the world of Internet policy. Owing to the fact that there are so many definitions with so many apparently different goals – the net neutrality debate at times seems only about what it is rather than whatit should (or should) not be.

[1]. ARCEP (2012): ―Report to Parliament and the Government on Net Neutrality‖,
http://www.arcep.fr/uploads/tx_gspublication/rapport-parlement-net-neutrality-sept2012-ENG.pdf
[2]. ARCEP (2010): ―Internet and network neutrality‖, hrttp://www.arcep.fr/uploads/tx_gspublication/net-neutralite-orientations-sept2010-eng.pdf
[3]. Cave, M., &Crocioni, P. (2007). Does Europe Need Network Neutrality Rules? International Journal of Communication [Online] 1:1. Available: http://ijoc.org/ojs/index.php/ijoc/article/view/157
[4]. Crandall, Robert (2005) Competition and Chaos, Brookings Institution Press: Washington, D.C. Clark, D. (2007).Network Neutrality: Words of Power and 800-Pound Gorillas. International Journal of Communication [Online] 1:1. Available: http://ijoc.org/ojs/index.php/ijoc/article/view/158/83