IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
GREESHMA.L, SRINIVASA RAO.M, R.V.KRISHNAIAH Student, Department of CSE, DRKCET, Hyderabad, India Associate Professor, Department of CSE, DRKCET, Hyderabad, India Principal, Department of CSE, DRKCET, Hyderabad, India
T. KARUPPIAH1, V. SIVASANKARAN, DR. AZHA. PERIASAMY, DR. S. MURUGANAND Research Scholar, Department of Electronics and Instrumentation, Bharathiar University, Coimbatore, TamilNadu Assistant Professors, Dept. of Electronics and Instrumentation, Bharathiar University, Coimbatore, TamilNadu
MOHAMMED RIYAZ AHMED, B.K.SUJATHA Assistant Professor, Department of ECE, REVA I.T.M., Bangalore, India Professor, Department of TCE, MSRIT, Bangalore, India
KANAKAM SIVA RAM PRASAD, M.V.S.S NAGENDRANADH, M.SATYA SRINIVAS M.Tech Student, Computer Science and Engineering, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India Head Of Department, Department Of CSE, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India Asst. Prof., , Department Of CSE, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India
SANJEEV KUMAR GUPTA, NEERAJ JAIN, POONAM SINHA Asst. Prof., Dept. of EC., SCOPE College of Engineering, NH-12, Hoshangabad Road, Near Misrod, Bhopal India Research Scholar, ABV,IIITM, Gwalior, India Professor & Head, CS IT, BU IT, Bhopal, India
BIWEK NATH MAHASETH, Mrs. M.S. ANURADHA MTech. Student, Dept. of E.C.E, A.U. college of engineering (A), Visakhapatnam, India Assistant Professor, Dept. of E.C.E., A.U. college of engineering (A), Visakhapatnam, India
JASPREET KAUR, KAMALJIT KAUR Student of M.Tech (CSE), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor (CSE Deptt), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
M.A.SHABAD, DR.S.S.APTE Research Scholar (Student), Computer, Walchand Institute of Technology, Solapur, India Professor, Computer, Walchand Institute of Technology, Solapur, India
PRIYANKA SHARMA, PARUL DIHULIA, VIKAS GUPTA Research Scholar, EC Department, TIT, Bhopal, Madhya Pradesh, India Assistant Professor, EC Department, TIT, Bhopal, Madhya Pradesh, India Head of Department, EC Department, TIT, Bhopal, Madhya Pradesh, India
DIWAKAR SINGH, AMIT KUMAR GUPTA, R.K.PRASAD Student, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India Lecturer, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India Associate Professor, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India
SONIA SINGLA, VIKAS PREET TIWANA Electronics & Communication Department University College of Engineering, Punjabi university Patiala, Punjab, India
NILIMA WALDE, SUNITA BARVE Computer Engineering Department, MIT Academy of Engineering, Pune, India Computer Engineering Department, MIT Academy of Engineering, Pune, India
ADITYA KURUDE, MAYUR BHOLE, SAGAR PAWAR BE (E&TC), PVG’s COET, Pune, India BE (E&TC), PVG’s COET, Pune, India BE (E&TC), PVG’s COET, Pune, India
K. GOPI, DR. T. RAMA SHRI Asst. Prof., Dept. of ECE, SITAMS, Chittoor, India Prof., Dept. of ECE, SV University College of Engineering, SVU, Tirupati, India
RAMANPREET KAUR, ER. KHYATI MARWAHA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
GURPREET KAUR, ER. SANDEEP KAUR DHANDA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
AMANPREET KAUR, PRABHJOT KAUR M. Tech Research Scholar, Department of Computer Science, Guru Nanak Dev University, Amritsar, India M. Tech Research Scholar, Department of Computer Science, Guru Nanak Dev University, Amritsar, India
GURJOT SINGH, ER. SANDEEP KAUR DHANDA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
ENG.NASSAR ENAD. GH. MUHANNA Computer Engineer, Computer Department, The Higher Institute of Telecommunication and Navigation, Shuwaikh, KuwaitKuwait City, Kuwait
VINAYAK BAJIRAO PATIL, PROF.DR.UTTAM.L.BOMBALE, PALLAVI HEMANT DIXIT M.Tech, Department of technology, Shivaji University, Kolhapur, India Professor, Department of technology, Shivaji University, Kolhapur, India M.Tech, Department of technology, Shivaji University, Kolhapur, India
M.S. ABDULLAH, N. SUBBA RAO M.Tech Student, DSCE, Quba College of Engineering, Venkatachalam, India Associate Professor, Department of ECE, Quba College of Engineering, Venkatachalam, India
KAMAL PRAKASH PANDEY, RAKESH KUMAR SINGH, SURENDRA KUMAR TADI, ANIL KUMAR Associate Professor Department of Electronics And Communication Engineering SIET, Allahabad, India Research Scholar Electronics And Communication Engineering SIET, Allahabad, India Assistant Professor Department of Electronics and Communication Engineering, SHIATS-DU, Allahabad, India
NEERJA KHATRI, ARVIND KUMAR, ARUN SHARMA M.tech Student, Department of computer science, K.I.E.T Ghaziabad, India Associate professor, Department of computer science, K.I.E.T Ghaziabad, India H.O.D, Department of computer science, K.I.E.T Ghaziabad, India
DILPREET KAUR, A.P. SUKHPREET KAUR Master of Technology in Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor, Department Of Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
PUNAMCHAND M. MAHAJAN , DR. SATISH R. KOLHE , DR. PRADEEP M. PATIL Asso.Prof., Department of Electronics and Telecomm.Engineering , J.T.Mahajan College of Engineering, Faizpur, India Professor, School of Computer Sciences, North Maharashtra University, Jalgaon, India Director, RMD Sinhgad Technical Institutes Campus, Warje, Pune, India
MISS. S.S. TAMBOLI, DR. V. R. UDUPI Assistant Professor, Department of Electronics and Telecommunication Engineering, Annasaheb Dange college of engineering & Technology, Ashta (India) Professor, Department of Electronics and communication engineering, Gogte institute of Technology, Belgaum, Karnataka
J.SOWMYA LAKSHMI, DR.R.V.KRISHNAIAH M.Tech Student, Dept. of CS, DRK College of Engineering and Technology, Hyderabad, AP, India Principal, Department of CSE, DRK Group of Institutions, Hyderabad, Andhra Pradesh, India
K.CHAITANYA, PURUSHOTHAM.P, DR.R.V.KRISHNAIAH M.Tech Student,Research Scholar, Dept. of CS, DRK Institute of Science & Technology, Hyderabad, AP India Associate Professor, Dept. of CSE, DRK Institute of Science & Technology, Hyderabad, AP, India Principal, Department of CSE, DRK Group of Institutions, Hyderabad, Andhra Pradesh, India
DALVIR KAUR, KAMALJIT KAUR Master of Technology in Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor, Department Of Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
SINU NAMBIAR, PROF. RAKESH PANDIT, PROF. SACHIN PATEL Student(M.Tech), PCST, Department of Information Technology, Indore, MP, India Asst. Professor, PCST, Department of Information Technology, Indore, MP, India Asst. Professor & HOD, PCST, Department of Information Technology, Indore, MP, India
ER.PRATIBHA GOYAL, ER.SALAM DIN, DR.SHAMMI KAPOOR Department of SEEIT, PAU, Ludhiana, India Associate Professor, Department of SEEIT, PAU, Ludhiana, India Senior Mycologist, Department of Microbiology, PAU, Ludhiana, India
GURPREET KAUR, KAMALJIT KAUR Student, M.tech (CSE), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab Assistant Professor, Computer Science Department, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab
UMAJANCY.S, DR. ANTONY SELVADOSS THANAMANI Research Scholar, Dr. Mahalingam Centre for Research and Development, NGM College, Pollachi, India Associate Professor and Head, Dr. Mahalingam Centre for Research and Development, NGM College, Pollachi, India
MS S. VIJAYARANI, MS M. MUTHULAKSHMI Assistant Professor, Department of Computer Science, School of Computer Science and Engineering, Bharathiar University, Coimbatore, Tamilnadu, India M.Phil Research Scholar, Department of Computer Science, School of Computer Science and Engineering, Bharathiar University, Coimbatore, Tamilnadu, India
SUMATHI M, UMARANI R Department Of Computer Science, Mahendra Arts & Science College, Salem, Tamilnadu, India Department Of Computer Science,Sri Saradha College For Women, Salem-16, Tamilnadu, India
RAHUL B. MANNADE, AMOL B. BHANDE System Analyst, Govt. College of Engineering, Chandrapur, India Assistant Manager, Network Operations, Vodafone India Ltd., Pune, India
D.S.MAHENDRAN, S.SAKTHIVEL Associate Professor, Department of Computer Science, Aditanar College, Tiruchendur, India Principal, P.S.N.A College of Engineering, Dindigul, India
ANU S, UMARANI R Department Of Computer Science, Periyar University College Of Arts & Science, Mettur Dam-01, Tamilnadu, India Department Of Computer Science,Sri Saradha College For Women, Salem-16, Tamilnadu, India
VINEET SUKHRALIYA, SUMIT CHAUDHARY, SANGEETA SOLANKI Assistant Professor, Electronics & Communication, VKIT, Bijnore, India Assistant Professor, Computer Science, Shri Ram Group of Colleges, Muzaffarnagar, India Assistant Professor, Computer Science, Shobhit University, Meerut, India
JYOTSANA, RAMANDEEP KAUR, RAJANDEEP SINGH Dept. of Electronics & Communication, UCoE, Punjabi University, Patiala, Punjab, India Dept. of Electronics, GNDU, Amritsar, Punjab, India
ABDULLAH, DR. REENA SRIVASTAVA, DR. M.H. KHAN Research Scholar, School of Computer Application, BBDU, Lucknow, India Dean, School of Computer Application, BBDU, Lucknow, India Associate Professor, Department of C.S. E., I.E.T., Lucknow, India
SHUCHI GUPTA, PRAVEEN BHANODIA Student, Computer Science & Engineering, Patel College of Science & Technology, Indore, India Assistant Professor, Computer Science & Engineering, Patel College of Science & Technology, RGPV Indore, India
SHUBHANGI RASTOGI, SAMIR SRIVASTAVA M.Tech Student, Computer Science and Engineering, KNIT, Sultanpur, India Associate Professor, Computer Science and Engineering, KNIT, Sultanpur, India
RAJASREE HAZRA, CHANDAN KUMAR GHOSH, S.K.PARUI Dr.B.C. Roy Engineering College, Durgapur, India Department of Electronics and Telecommunication Engineering, Bengal Engineering and Science University(BESU), Shibpur, Howrah-711103, India
DR. L. AROCKIAM, S.MONIKANDAN Associate Professor, St. Joseph’s College, Trichy, Tamilnadu, India Research scholar, M S University, Tirunelveli, Tamilnadu, India
RONGALI AVATARAM, DR.B.PRABHAKARA RAO, B.A.S.ROOPA DEVI PG Student, Department of Electronics and Communication Engg., JNTU Kakinada University, Andhra Pradesh, India Senior Prof, Department of Electronics and Communication Engg., JNTU Kakinada University, Andhra Pradesh, India Research Scholar, Department of Computer Science Engineering, JNTU Kakinada University, Andhra Pradesh, India
AMANDEEP KAUR, MRS. SONIA GOYAL Student, Electronics and communication Engineering Department, University College of Engineering Punjabi University, Patiala, Punjab, India Asst. Prof., Electronics and communication Engineering Department, University College of Engineering Punjabi University, Patiala, Punjab, India
K.VINOTH KUMAR, N.SENTHIL KUMARESAN Assistant Professor, M.A.R College of Engineering and Technology, Tamil Nadu, India PG Scholar, J.J College of Engineering and Technology, Tamil Nadu, India
UMA NARAYANAN, ARUN SOMAN Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri valley, Cochin, India Assistant Professor, Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri valley, Cochin, India
V.SHYAMALADEVI, DR. R. UMARANI Associate Professor, Department of MCA, KSRCT, Tiruchengode, Tamilnadu Professor, Department of MCA, Saradha Womens College, Salem, Tamilnadu
BHAWNA SHARMA, DEVANAND, PUSHKIN KACHROO Assistant Professor, Department of Computer Engineering, Govt. College of Engineering & Technology, Jammu, India Professor, Department of Computer Science & Information Technology, University of Jammu, India Professor, Department of Electrical & Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA
R.ABLIN, C.HELEN SULOCHANA Assistant Professor, Electronics and Communication Engg., Arunachala College of Engineering for Women, Affiliated to Anna University Chennai, Tamilnadu, India Professor, Electronics and Communication Engg., St.Xavier’s Catholic College of Engineering, Affiliated to Anna University Chennai, Tamilnadu, India
HEENA SHAIKH, D.A.KULKARNI, G.R.UDUPI CSE Department, KLS Gogte Institute of Technology, Belgaum, India Department of E & C, KLS VDRIT Haliyal, India
GURURAJA.H.S, M.SEETHA, ANJAN.K.KOUNDINYA Assistant Professor, Department of Information Science & Engineering, B.M.S. College of Engineering, Bangalore, India Professor, Department of Computer Science & Engineering, G.Narayanamma Institute of Technology and Science, Hyderabad, India Assistant Professor, Department of Computer Science & Engineering, R.V. College of Engineering, Bangalore, India
A.SUGANYA, K.SRIDEVI, P.THENMOZHI, N.VANITHA Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India
SRIDHAR H.S, DR. M. SIDDAPPA, DR.G.C.BHANU PRAKASH Assistant Professor, Dept. of Electrical and Electronics Engg , Siddaganga Institute of Technology, Tumkur, India Professor and Head of the Department, Dept. of Computer science and Engg, Sri Siddhartha Institute of Technology, Tumkur, India Professor, Dept. of Computer science and Engg, SIR M.Visvesvaraya Institut of Technology, Bangalore, India
ALI I.EL-DESOUKY, HESHAM A.ALI, RABAB S.RASHED Computers and Systems Department, Faculty of Engineering, Mansoura University, Egypt Computers and Systems Department, Faculty of Engineering, Mansoura University, Egypt Electrical Engineering Department, Faculty of Engineering, Kafr Elsheikh University, Egypt
ANURAG SHARMA, ANKUSH KANSAL Student-ME, Electronics and Communication Department, Thapar University, Patiala, India Assistant Professor, Electronics and Communication Department, Thapar University, Patiala, India
|
Abstract
SVM and AdaBoost Based Ranking Model Adaptation for Domain Specific Search
GREESHMA.L, SRINIVASA RAO.M, R.V.KRISHNAIAH Student, Department of CSE, DRKCET, Hyderabad, India Associate Professor, Department of CSE, DRKCET, Hyderabad, India Principal, Department of CSE, DRKCET, Hyderabad, India
Abstract: The invent of Web 2.0 has enabled building of state of the art web applications including sophisticated search engines. The web applications are capable of providing domain specific search which enables end users to gain access to required data quickly. However, the results might be bulky and may not be relevant to the user-intended results. In other words users have to spend some time browsing results for finding required information. To overcome this problem many ranking algorithms came into existence. The ranking algorithms help users to find required results quickly. But the ranking models in the existing work were built based on broad-based ranking which is not useful for other domains. Recently Geng et al. proposed a ranking model adaption framework which can adapt to various domain specific searches. They used SVM for building ranking model. In this paper we built a prototype application that demonstrates ranking model adaption using a novel ranking model meant for ranking the search results besides adapting to new domains. The experimental results revealed that the proposed application is useful in searching data across the domains.
Keywords: Ranking model, domain specific search, SVM, model adaptation
Embedded System Based Industrial Power Plant Boiler Automation Using GSM Technology
T. KARUPPIAH1, V. SIVASANKARAN, DR. AZHA. PERIASAMY, DR. S. MURUGANAND Research Scholar, Department of Electronics and Instrumentation, Bharathiar University, Coimbatore, TamilNadu Assistant Professors, Dept. of Electronics and Instrumentation, Bharathiar University, Coimbatore, TamilNadu
Abstract: An embedded based power plant boiler automation using GSM is a project which shall be used for monitoring a given industry’s boiler from any place all over the world where GSM network is available. In this project, a system of a number of boilers supplied by a main water tank has been proposed. The water level in the main tank is controlled by a water level sensor, each boiler has two pipes, one is inlet other one is outlet and the pipes’ valves are controlled by some temperature sensors located in each boiler. From the GSM mobile phone, the user will be able to get information about the current temperature in any boiler by simply sending a boiler identification number. When the temperature inside any boiler reach a maximum presented value, the system will send a SMS to the user informing that the maximum temperature has been reached. All these control process are achieved by using a PIC microcontroller, GSM modem, sensors and different interfacing circuits.
Keywords: Boilers, Temperature, Sensors, Microcontroller and GSM
A Review of Reinforcement Learning in Neuromorphic VLSI Chips using Computational Cognitive Neuroscience
MOHAMMED RIYAZ AHMED, B.K.SUJATHA Assistant Professor, Department of ECE, REVA I.T.M., Bangalore, India Professor, Department of TCE, MSRIT, Bangalore, India
Abstract: In this review paper, Cognitive models are used to implement the Reinforcement Learning in Neuromorphic VLSI Chips, to exhibit intelligence when the machines are exposed to an undefined Situation or field so as to achieve maximum rewards for taking right decision or very feasible solution or optimal path. This is done by modelling the attention and perception of machine just as a human being. Because the thought process is the unique nature of humans‟ intelligence can be implemented by modelling the Cognition. Comparison with other methods of attaining Artificial Intelligence shows that Computational Cognitive Neuroscience is the best and most evolved system for exhibiting intelligence to learn in real time scenarios. It is concluded that all the sensory input is not necessarily being calculated, instead attention is given to effective perception and trivial perception is ignored. This differentiation of perception is done based on BDI Model. Intelligence is broadly defined and requirements of an intelligent agent is summarized. The emerging field of electronics for implementation of reinforcement learning by imitating human brain i.e. Neuromorphic Engineering is discussed. The significance of the accurate knowledge of intelligence in machines based on learning and decision making is discussed.
Improved FEC Improving The Efficiency of Forward Error Correction Coding In Reducing The Network Packet Loss
KANAKAM SIVA RAM PRASAD, M.V.S.S NAGENDRANADH, M.SATYA SRINIVAS M.Tech Student, Computer Science and Engineering, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India Head Of Department, Department Of CSE, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India Asst. Prof., , Department Of CSE, Sasi Institute Of Technology and Engineering, Tadepalligudem, Andhra Pradesh, India
Abstract: In this paper we explores a method for measuring the performance of FEC coding combining with interleaving in reducing the packet loss in IP networks. In order to evaluate the performance of FEC data can be transfer from the source to destination and creates the packet loss voluntarily, at the destination the lost packets can recovered using FEC decoder. The performance of the FEC coding can be measured using an analytical method stated in this paper. Here we use the single multiplexer network model for transmission of the data from multiple sources to destinations. In this a unified approach provides an integrated framework for exploring the compromises between the various key parameters i.e. channel coding rates, interleaving depths, block lengths. It provides the selection of various optimal coding strategies with various QOS requirements and system constraints.
Keywords: FEC Coding, interleaving, packet loss rates, multiplexer network model, multi session and single session.
Energy Efficient Clustering Protocol for Minimizing Cluster Size and Inter Cluster Communication in Heterogeneous Wireless Sensor Network
SANJEEV KUMAR GUPTA, NEERAJ JAIN, POONAM SINHA Asst. Prof., Dept. of EC., SCOPE College of Engineering, NH-12, Hoshangabad Road, Near Misrod, Bhopal India Research Scholar, ABV,IIITM, Gwalior, India Professor & Head, CS IT, BU IT, Bhopal, India
Abstract: There are many applications like battle field monitoring, habitat monitoring, disaster relief operations, hostile areas, object tracking, remote harsh fields, and contaminated urban regions etc. which need random deployment of sensor nodes. In random deployment the sensor nodes may be grouped or sparse in the sensing field. Some of the existing clustering protocols used probabilistic threshold and random number for cluster head selection process. In these protocols cluster heads can be overlapped or grouped in small region. Due to randomness property in cluster head selection, any sensor node can become cluster head and also form uneven sized cluster. In large size cluster, member nodes need more energy for data transmission. More number of clusters in sensing field reduces the cluster size as well as energy consumption of cluster members. It can increase data transmission from cluster head to base station (Inter cluster communication) that consumes lot of energy in the larger area network. The proper coordination among grouped cluster head can increase the stability period and network lifespan. In this paper a new Energy Efficient Cluster Protocol (EECP) has been proposed for cluster head selection and coordination among grouped or nearby cluster heads.
Keywords: Cluster head selection, cluster size, inter cluster communication, stability period.
Binary and Ternary Sequence Generation Using Improved Logistic Map
BIWEK NATH MAHASETH, Mrs. M.S. ANURADHA MTech. Student, Dept. of E.C.E, A.U. college of engineering (A), Visakhapatnam, India Assistant Professor, Dept. of E.C.E., A.U. college of engineering (A), Visakhapatnam, India
Abstract: Pulse compression is a signal processing technique mainly used in radar, sonar and multiple access communication to achieve desired detection range and range resolution simultaneously.In this paper improved logistic map is used to generate a binary and ternary sequences with low PSR to achieve desired detection range and range resolution simultaneously. The result is analysed with each sequence and it was found that the discrimination factor for ternary sequence is higher than that of binary i.e. PSR for ternary is much lower than that of binary.This simulation results show that the ternary,a high resolution codes are good in performance, which brings our sequences closer to practical application than others.
A New Improved Vertical Partitioning Scheme for Non Relational Databases Using Greedy Method
JASPREET KAUR, KAMALJIT KAUR Student of M.Tech (CSE), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor (CSE Deptt), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
Abstract: Non Relational database is a database used to store large amounts of data. Improving the performance of a database system is one of the key research issues. As publications of context are rising, a new vertical partitioning scheme is proposed to handle better data load and to improve performance for non relational databases. In the proposed work, an algorithm is developed by concatenating the vertical partitioning scheme and greedy algorithm to enhance the performance of data load by altering the vertical partitioning method and to check out the time performance by using the greedy algorithm. In this paper, different performance parameters named data load, time in terms of execution time, communication time are analyzed against data size and nodes using non relational databases so that we get better results from existing algorithm.
Keywords: Non Relational Databases, Vertical Partitioning Scheme, performance, Greedy Algorithm.
Scenario based Performance comparison of DSDV, DSR, AODV
M.A.SHABAD, DR.S.S.APTE Research Scholar (Student), Computer, Walchand Institute of Technology, Solapur, India Professor, Computer, Walchand Institute of Technology, Solapur, India
Abstract: There are various performance metrics to compare Ad hoc routing protocols. A Mobile Ad-Hoc Network (MANET) is a set of wireless mobile nodes which forms instant temporary network without using any central administration or network infrastructure. All the nodes in MANET’s change their position frequently. The protocols have to maintain efficiency for low transmission power and dynamic links of networks, along with timely delivery of message. The main classes of routing protocols are Proactive, Reactive and Hybrid. A reactive also known as On-Demand routing class is usually used with wireless adhoc routing. In this paper, an attempt has been made to compare the performance of three important on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the conventional proactive DSDV protocol.
PRIYANKA SHARMA, PARUL DIHULIA, VIKAS GUPTA Research Scholar, EC Department, TIT, Bhopal, Madhya Pradesh, India Assistant Professor, EC Department, TIT, Bhopal, Madhya Pradesh, India Head of Department, EC Department, TIT, Bhopal, Madhya Pradesh, India
Abstract: In recent development of technology the world is been surrounded by the latest technology which are based on man machine interaction. The key role is played by mobile phone and video conferencing in which quality of speech is the main criteria. Here in this paper we have reported the enhancement of Audio Speech recognition with the help of visual feature in noisy background. For extracting visual feature DCT along with the Wavelet is used and audio feature are extracted using MFCC feature. Further the results are reported at different signal to noise ratio (SNR) i.e. ranging between 20 dB to -5 dB using AWGN.
Bandwidth and Gain Enhancement of S-Shaped Array Configuration
DIWAKAR SINGH, AMIT KUMAR GUPTA, R.K.PRASAD Student, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India Lecturer, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India Associate Professor, Department of Electronics and Communication Engineering, Madan Mohan Malaviya Engineering College, Gorakhpur, India
Abstract: This paper gives an idea of increasing the bandwidth and gain of Microstrip patch antenna using array configuration. The design and analysis of this antenna is performed over IE3D software Ver.15.2.We have taken a ground plane of 50x70 mm and patch size of 40x60 mm. The substrate thickness is taken as 1.6 mm, dielectric constant of 4.2 and loss tangent of 0.0013. We have obtained the bandwidth in dual band-2.6527% at 1.002661 GHz band and 31.6939% at 1.94681 GHz band. The gain is quite good for many microwave applications which is 5.03926 dBi at 2.10568 GHz.
Papr Reduction in OFDM System Using Ant Colony Optimization
SONIA SINGLA, VIKAS PREET TIWANA Electronics & Communication Department University College of Engineering, Punjabi university Patiala, Punjab, India
Abstract: In the fast growing communication world, orthogonal frequency division multiplexing modulation technique plays an important role in long distance communication. OFDM is a multi carrier modulation scheme which enables transmission of multiple signals, simultaneously over a single transmission path. But peak to average power ratio (PAPR) has become a challenge to this technique. Many methods proposed to reduce PAPR. In this paper, swarm intelligence based ant colony optimization technique is proposed to reduce the PAPR problem. Simulation results show that presented technique has effectively reduced the PAPR value and probability of having PAPR value.
A Study: On Routing Schemes in Cognitive Radio Network
NILIMA WALDE, SUNITA BARVE Computer Engineering Department, MIT Academy of Engineering, Pune, India Computer Engineering Department, MIT Academy of Engineering, Pune, India
Abstract: Cognitive Radio (CR) technology is used to solve the spectrum scarcity problem in wireless networks, by using the existing wireless spectrum when they are not in use. CR technology allows sharing of licensed spectrum band in opportunistic and non interfering manner. However it should be aware of spectrum availability and Primary User (PU) activities. Routing and spectrum management are the main challenges in Cognitive Radio Network.. The main idea behind this concept is to use an appropriate routing protocol for cognitive network which becomes a major necessity now days. As the available radio frequency for wireless communication gets lesser day by day because of licensing, so we need to have some way to use these frequencies in a more efficient manner. Routing is a fundamental issue to consider when dealing with cognitive radio networks. Geographical concepts like location server is also challenging task to improve the routing problem .Here we focused on the potential routing approaches that can be employed in adaptive wireless networks.
KEYWORDS Cognitive Radio Network , Spectrum Hole, Spectrum Sensing, Spectrum Sharing, Routing, Location server .
GSM Based Advanced Digital Thermometer with Data Storage in Memory Card
ADITYA KURUDE, MAYUR BHOLE, SAGAR PAWAR BE (E&TC), PVG’s COET, Pune, India BE (E&TC), PVG’s COET, Pune, India BE (E&TC), PVG’s COET, Pune, India
Abstract: This Paper discusses an Advanced Digital Thermometer which highlights the novel idea of adding a database storage facility along with GSM based communication to conventional Thermometer. Microcontroller based embedded system is designed using PIC controller which records body temperature of a patient and stores it in memory card periodically for future reference. The temperature is stored in the database with its date and time. We also propose forwarding the stored data directly to doctor using GSM communication. The Embedded system is designed and simulated in Proteus simulator. Test results are also compared with a conventional Thermometer. This system is beneficial to the aged people who find it difficult to visit doctors on a regular basis just to check the body temperature.
Keywords: Database Storage, Digital Thermometer, GSM, Memory Card, Patient Monitoring.
Medical Image Decomposition and Compression by using Lifting Scheme
K. GOPI, DR. T. RAMA SHRI Asst. Prof., Dept. of ECE, SITAMS, Chittoor, India Prof., Dept. of ECE, SV University College of Engineering, SVU, Tirupati, India
Abstract: In this paper an attempt has been made to decompose an image using lifting scheme so as to suite compression. Lifting based wavelets are constructed using Haar, Daubechies, Bi-orthogonal, CDF, Symlet wavelets. A large number of medical images are considered. A new design metric which is a combination of PSNR and CR is proposed. Compression ratio and PSNR are calculated and compared the results with so called traditional wavelets. It has been observed that the lifting based wavelets have produced better compression results.
Multi-Parameter Summarization for Software Architecture Recovery
SARVAR BEGUM, MANJULA.K.S, D. VENKATA SWETHA RAMANA Student, CSE, RYMEC, Bellary, India Student, CSE, RYMEC, Bellary, India Senior Lecturer, CSE, RYMEC, Bellary, India
Abstract: Software architecture is identified as an important element in the successful development and evolution of software systems. In spite of the significant role of architecture representation and modeling, many existing software systems like legacy or eroded ones do not have a consistent architecture representation. There have been several algorithms on Architecture recovery utilizing various aspects of similarity measures, clustering, lexical rules and distance measures. It is understood from the literature that no single technique can give best interpretation or desired result in the summarization process. Therefore in this work we propose a multi parameter summarization for extracting high level software architecture with the help of Bipartite graph matching and semantic similarity.
Extracting Summary from Documents Using K-Mean Clustering Algorithm
MANJULA.K.S, SARVAR BEGUM, D. VENKATA SWETHA RAMANA Student, CSE, RYMEC, Bellary, India Student, CSE, RYMEC, Bellary, India Senior Lecturer, CSE, RYMEC, Bellary, India
Abstract: Extracting summary from the documents is a difficult task for human beings. There fore to generate summary automatically has to facilitate several challenges; as the system automates it can only extract the required information from the original document. This reduces the work to compress the original document and extract only essential information with one of the text mining technique known as “diversity”. This diversity helps to find the multiple means in the document. Document sentence use one of scoring technique MMR (Maximum Marginal Relevance) to get the quality text summary. MMR approach depends on the document sentences, and tries to apply restriction on the document sentence to get the relevance important sentence score by MMR, known as generic summarization approach.The generic summarize approach is employed with one of the clustering method known as K-Mean clustering to find the summary of the document. This method helps to process the data set through certain number of clusters and find the prior in the data sets. This helps to find the similarity of each document and generate the summary of the document.
Analysing the effect of Speed on Security Protocol in VANETS
RAMANPREET KAUR, ER. KHYATI MARWAHA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
Abstract: VANET (Vehicular Ad-Hoc Network) is a sub class of MANETs (Mobile Ad-Hoc Networks) in these moving vehicles will act as node. VANETs are a technology that provide secure driving environment by wireless communication between vehicles. Due to Ad-Hoc nature of VANETs it‟s vulnerable to various attacks that breach the security . In this paper, I am going to analyse the effect of varying speed of vehicles on security protocol with on behalf of different routing protocols. Speed of vehicle goes on changing that may affect the performance of network. Speed is the major factor that is to be handled for secure and efficiently implementation of VANETs. Varying speed of vehicle makes the environment more dynamic which may lead to topology change and this topological change affect the routing criteria of routing protocols. In this paper performance of VANETs will be analysed on behalf of metrics like Throughput and End-to-End Delay.
Analysing the effect of Wormhole Attack on Routing Protocol in Wireless Sensor Network
GURPREET KAUR, ER. SANDEEP KAUR DHANDA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
Abstract: Wireless Sensor Networks consist of large number of sensor nodes with sensing, computation, and wireless communications capabilities. A distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. Security is the main concern in wireless sensor network. The wireless sensor network is vulnerable to different types of attacks that breach the security of the network. The wormhole attack is one of the severe attacks on wireless sensor network. It tunnels the packets from one end to another end by corrupting it. Routing protocols plays a major role of forwarding the data packets by identifying and maintaining the routes in the network. Competence of sensor networks relay on the strong and effective routing protocol used. In this paper, the effect of wormhole attack on routing protocols like AODV, DSR, ZRP and ANODR is analysed on behalf of parameters like throughput, delay and energy consumption.
Implementation of Mapping Heuristic Genetic Algorithm
AMANPREET KAUR, PRABHJOT KAUR M. Tech Research Scholar, Department of Computer Science, Guru Nanak Dev University, Amritsar, India M. Tech Research Scholar, Department of Computer Science, Guru Nanak Dev University, Amritsar, India
Abstract: Mapping Heuristic APN Algorithm in which the list is ordered according to node priorities with the highest priority node. Schedule node to the processors which gives highest node. Calculate start time of node, routing table maintained for each processor, each entry of table indexed by destination processing element. Routing table will direct message from one machine to along a path with minimum communication time. Shortest path with between the processing elements are stored in routing table. Message is sent, the route from source to destination machine become busy, carrying message of certain amount of time. When message is received its route become free and this route can be used for other processor for transmission of message again. Every time a message sent and message received event is processed the routing table will be updated to profile the direction for fastest communication routes at any time. Append all ready successor nodes of ni according to priority to the ready node list.
Performance Analysis of Security Schemes in Wireless Sensor Network
GURJOT SINGH, ER. SANDEEP KAUR DHANDA Student, CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India Asst. Prof., CSE/IT Department, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib (Punjab), India
Abstract: A Wireless Sensor Network (WSN) is a group of independent nodes, communicating wirelessly over limited frequency and bandwidth. The novelty of WSNs in comparison to traditional sensor networks is that they depend on dense deployment and coordination to execute their tasks successfully. Wireless Sensor Networks are used in many applications like military, ecological, and health-related areas. Security is the major concern in WSN due to its wireless communication nature and constraints like low computation capability, small memory, Bounded energy resources, susceptibility to physical capture, and the use of insecure wireless communication channels. These constraints make security a challenge to WSNs. The cryptographic schemes increases the security level and make it secure against different attacks. In this paper, different asymmetric and symmetric key cryptographic based security schemes like secure neighbour model, certificate model, ISAKMP (internet security association and key management protocol), IPSec (Internet protocol Security) and secure routing (ANODR i.e. anonymous on demand routing) are compared on WSNs. Providing security to sensor networks has a significant impact on QOS of sensor network. In this paper the QOS of WSN along with security schemes will be evaluated on the basis of metrics like throughput, end-to-end delay and energy consumption.
Keywords: WSN- wireless sensor network, ISAKMP- Internet security association and key management protocol, IPSec- Internet protocol security, ANODR- Anonymous on-demand routing, CA- Certificate authority
ENG.NASSAR ENAD. GH. MUHANNA Computer Engineer, Computer Department, The Higher Institute of Telecommunication and Navigation, Shuwaikh, KuwaitKuwait City, Kuwait
Abstract: This paper presents an overview of wireless networking with emphasis on the most popular standards: Bluetooth, Wi-Fi, WiMAX, and Cellular Networks. A review of what is needed to build a generic wireless network is provided. The literature attempts to discuss the most popular wireless technologies and their protocols. An overview of the advantages that wireless networks have over wired technology is then given. The paper also advances some of the major security risks that wireless networks face. Various strategies that can be employed to mitigate these risks and safeguard the privacy and security of the network are given. A review of how wireless networks can be used in education and training is then given and it is demonstrated that the education field has benefited from the growth of wireless technology and the cost effectiveness of this technology.
Implementation of AES algorithm on ARM processor for wireless network
VINAYAK BAJIRAO PATIL, PROF.DR.UTTAM.L.BOMBALE, PALLAVI HEMANT DIXIT M.Tech, Department of technology, Shivaji University, Kolhapur, India Professor, Department of technology, Shivaji University, Kolhapur, India M.Tech, Department of technology, Shivaji University, Kolhapur, India
Abstract: Wireless network can offer businesses more flexible and inexpensive ways to send and receive data. The wireless network is useful to increase efficiency, greater flexibility and mobility for users. Security is major concern in wireless networks. As we share the data through wireless network it should provide data confidentiality, integrity and authentication. The Advanced Encryption Standard (AES) algorithm has popular; as it is implemented into embedded system and it is best solution for security. This paper presents wireless network which contain both mobile nodes. Here the implementation of AES algorithm on hardware in combination with part of software on both nodes. Realization of AES algorithm on ARM processor with minimum memory will be useful for deploying it in low cost applications. Algorithm is compiled using KEIL compiler targeting into an ARM LPC2148 processor board. The results are presented into this paper for key length of 128 bits. After AES encryption the cipher text is send through GSM module to another node, while receiving cipher text through GSM module the plain text is obtained by AES decryption.
Privacy Preserving Hybrid Data Transformation Based On Svd
M. NAGA LAKSHMI, K SANDHYA RANI Research Scholar: Dept of Computer Science, S.P.M.V.V, Tirupati, Andhra Pradesh, India
Abstract: Though data mining has emerged as a significant technology, individual privacy concerns has been growing with the use of this technology. This problem is addressed with a new branch of data mining, known as privacy preserving data mining, which incorporates the mechanisms for protecting sensitive information. In this paper a hybrid data transformation method is proposed for privacy preserving clustering in centralized database environment. The proposed hybrid method takes the advantage of two existing techniques such as Singular Value Decomposition (SVD) and shearing based data perturbation. Experimental results demonstrate that the proposed method efficiently protects the private data of individuals and retains the important information for clustering analysis.
Keywords: Singular value decomposition, Shearing data perturbation, Privacy preserving clustering
Image Compression using Classical and Lifting based Wavelets
M.S. ABDULLAH, N. SUBBA RAO M.Tech Student, DSCE, Quba College of Engineering, Venkatachalam, India Associate Professor, Department of ECE, Quba College of Engineering, Venkatachalam, India
Abstract: In this paper the use of classical and lifting based wavelets for image compression was presented. Both classical and lifting based wavelets are considered. Classical wavelets considered in this work are Haar wavelet, Daubechie wavelet, Coiflet wavelet, Biorthognal wavelet, Demeyer wavelet, and Symlet wavelet. Lifting based wavelet transforms considered are (5,3) and (9,7). Large number of images, including both color and monochrome images are considered. These wavelet transforms are used to compress the input images by Set Partitioning In Hierarchical Trees (SPIHT) algorithm and by incorporating lifting concepts. SPIHT is a new algorithm based on wavelet transform which is gaining attention due to many potential commercial advantages in the area of image compression. The SPIHT coder is also a refined version of the EZW algorithm and is a powerful image compression algorithm, that produces an embedded bit stream, in which the best reconstructed images, shows a significant compression improvement as well as an increased PSNR.
A Novel approach of identifying uninitialized register in SOC designs
KAMAL PRAKASH PANDEY, RAKESH KUMAR SINGH, SURENDRA KUMAR TADI, ANIL KUMAR Associate Professor Department of Electronics And Communication Engineering SIET, Allahabad, India Research Scholar Electronics And Communication Engineering SIET, Allahabad, India Assistant Professor Department of Electronics and Communication Engineering, SHIATS-DU, Allahabad, India
Abstract: As we know that today‟s‟SoC designs comprise of IP blocks from different design team and vendors. Integrating and verifying them is a challenge for design teams. Verification happens mainly in two stages RTL and Gate level simulation. One of the key challenges in gate level simulation of a ASIC/SoC is X (unknown) propagation debug. X propagation happens due to many reasons such as uninitialized memory, timing violations and due to non-resettable flops. X propagation due to non resettable flops are very difficult to debug and consumes enormous time, challenge further increases due to presence of hundreds/thousands of such non resettable flops which needs to be traced separately for every X propagation, To avoid these X propagation, such flops should be initialized with random value 0 or 1 in the beginning (at 0 time) to mimic silicon behavior but the problem is list of such non resettable flops is not available to the soc team and there are no efficient & reliable techniques present to identify such flops. The proposed paper explains a methodology which can generate a list of non resettable flops required to avoid „X‟ propagation in gate simulation. This uses formal tools and gate level VCD of the physical design.
Keywords: Non resettable flop, Gate level Simulation, Uninitialized register
Abstract: this paper we propose the objective of DFT is to increase the ease with which a device can be tested to guarantee high system reliability. Among these techniques, BIST has an obvious advantage in that expensive test equipment is not needed and tests are low cost. Moreover, BIST can generate test simulations and analyze test responses without outside support, making tests and diagnoses of digital systems quick and effective. However, as the circuit complexity and density increases, the BIST approach must detect the presence of faults and specify their locations for subsequent repair. The extended techniques of BIST are assembled-in individual-diagnosis and assembled-in individual-re- pair (BISR).This work develops an assembled-in individual-disclosure/adjustment (BISDC) architecture for action appreciation enumerateing arrays (MECAs). Based on the error disclosure/adjustment concepts of biresidue codes, any single error in each processing element in an MECA can be effectively detected and corrected online using the proposed BISD and assembled-in individual-adjustment circuits. Performance analysis and evaluation demonstrate that the proposed BISDC architecture performs well in error disclosure and adjustment with minor area overhead.
Keywords: Digital Video Compression, Optical Flow, Detector, transmission bandwidth, macro Blocks.
Analysing Performance of Aodv Routing Protocol in Mobile Adhoc Networks
NEERJA KHATRI, ARVIND KUMAR, ARUN SHARMA M.tech Student, Department of computer science, K.I.E.T Ghaziabad, India Associate professor, Department of computer science, K.I.E.T Ghaziabad, India H.O.D, Department of computer science, K.I.E.T Ghaziabad, India
Abstract: Mobile Ad-hoc network is a collection of mobile nodes that communicate via wireless links and communication is carried out without any centralized control or fixed infrastructure. Each node participating in the network can act as host and router. The nodes in mobile ad-hoc network are free to move independently therefore topology changes frequently. Thus to route packets from source to destination, routing protocol is needed. Routing is the important issue in ad-hoc networks. A number of routing protocols have been implemented. Ad-hoc network routing protocols can be broadly divided into two categories proactive and reactive protocols. The main goal of this paper is to evaluate performance of Ad-hoc on demand distance vector routing protocol (reactive protocol) in Mobile ad-hoc networks with different network parameters using matlab. Our basic goal is to present vast information related to AODV protocol and to analyze its performance using different performance metrics such as packet delivery ratio, throughput, packet loss ratio and packet drop rate.
User Future Request Prediction Using KFCM in Web Usage Mining
DILPREET KAUR, A.P. SUKHPREET KAUR Master of Technology in Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor, Department Of Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
Abstract: Web usage mining is a type of web mining which deals with log files for extracting the information about user browsing behavior. User future request prediction is an approach of web usage mining to predict the next web page for user. In this paper, KFCM method of fuzzy clustering is proposed to predict the user future requests. In this firstly log file data is collected and then preprocessed. After that clustering algorithms FCM and KFCM are implemented to predict the user future requests. The experimental results defining the betterment of KFCM for prediction.
Keywords: Web usage mining, Fuzzy C-Mean, Kernelized Fuzzy C-Mean.
Classification of Texture Images using Multiresolution Transform
PUNAMCHAND M. MAHAJAN , DR. SATISH R. KOLHE , DR. PRADEEP M. PATIL Asso.Prof., Department of Electronics and Telecomm.Engineering , J.T.Mahajan College of Engineering, Faizpur, India Professor, School of Computer Sciences, North Maharashtra University, Jalgaon, India Director, RMD Sinhgad Technical Institutes Campus, Warje, Pune, India
Abstract: This paper proposed a scheme to identify appropriate wavelet basis function using multiresolution approach based on pyramidal wavelet transform (to extract relevant information from the texture images) for classification of the textures in various classes. In this work, for characterizing texture images at multiple scales, we have considered various wavelet basis functions such as Haar, Daubechies, Coiflet, Symlet, biorthogonal and reverse biorthogonal wavelets. They differ with each other in the formation and reconstruction. The Discrete wavelet transform is used for three level decomposition of the texture image into sub-bands. The first order statistical features are then derived from original texture image and subsequent sub-images. For classifying unknown image data to corresponding classes, minimum distance classifier is used. Experiments were carried out to compare the performance of various wavelet basis functions, which identify Haar wavelet as the best wavelet basis functions for texture classification. .
MISS. S.S. TAMBOLI, DR. V. R. UDUPI Assistant Professor, Department of Electronics and Telecommunication Engineering, Annasaheb Dange college of engineering & Technology, Ashta (India) Professor, Department of Electronics and communication engineering, Gogte institute of Technology, Belgaum, Karnataka
Abstract: This paper proposes a simple but efficient calculation scheme for 2D-Haar wavelet transformation in image compression. The proposed work is aimed at developing computationally efficient and effective algorithms for lossy image compression using wavelet techniques. The work is particularly targeted towards wavelet image compression using Haar Transformation with an idea to minimize the computational requirements by applying different compression thresholds for the wavelet coefficients and these results are obtained in fraction of seconds and thus to improve the quality of the reconstructed image. The promising results obtained concerning reconstructed images quality as well as preservation of significant image details, while, on the other hand achieving high compression rates and better image quality.
Keywords: Image Compression, Haar Transform, wavelet transform
Expert Discovery and Interactions in Mixed Service Oriented Systems
J.SOWMYA LAKSHMI, DR.R.V.KRISHNAIAH M.Tech Student, Dept. of CS, DRK College of Engineering and Technology, Hyderabad, AP, India Principal, Department of CSE, DRK Group of Institutions, Hyderabad, Andhra Pradesh, India
Abstract: Due to the phenomenal emergence of distributed technologies based on SOA (Service Oriented Architecture) business process integration has become a reality. Especially web services technology supports collaboration of heterogeneous systems. As such systems are complex in nature, a mixed service oriented system that comprises of services and also human beings have assumed importance. One such mixed service oriented system is the one proposed by Danial Schall et al. Their system involves two different types of users realizing benefits of the system. Each side in the market gets value based on the presence of other side. Evaluation and analysis of two sided markets in such distributed, heterogeneous system revels the stability of two-sided markets and various kinds of coalitions in such markets.
Keywords: Distributed Resources, Web Services, Mixed Service Oriented System, Human Provided Services.
SANDEEP SINGH, JASVINDER PAL SINGH, GAURAV SHRIVASTVA RKDF Institute of Science and Technology, Bhopal
Abstract: Prevention of security breaches completely using the existing security technologies is unrealistic. As a result, intrusion detection is an important component in network security. However, many current intrusion detection systems (IDSs) are signature-based systems, The signature based IDS also known as misuse detection looks for a specific signature to match, signalling an intrusion. Provided with the signatures or patterns, they can detect many or all known attack patterns, but they are of little use for as yet unknown attack methods. The rate of false positives is small to nil but these types of systems are poor at detecting new attacks, variations of known attacks or attacks that can be masked as normal behaviour. In this paper we evaluate the performance of various network based IDS technique and give a bird eye over existing IDS technique and their terminology.
Robust and Scalable Structure for Server-Interconnections in Data Centers
K.CHAITANYA, PURUSHOTHAM.P, DR.R.V.KRISHNAIAH M.Tech Student,Research Scholar, Dept. of CS, DRK Institute of Science & Technology, Hyderabad, AP India Associate Professor, Dept. of CSE, DRK Institute of Science & Technology, Hyderabad, AP, India Principal, Department of CSE, DRK Group of Institutions, Hyderabad, Andhra Pradesh, India
Abstract: Data center networking is the result of many server machines interconnected. The present data centers are connected using network switches organized in the form of a tree hierarchy. However, they are unable to meet the goals such as establishing data center network with low cost equipment, fault tolerance and balancing the capacity of network. Recently Dan Li et al. presented a new server-interconnection structure. This structure makes use of the both Ethernet ports that come with commodity server for server-interconnections. Thus it makes the data center structure highly scalable and efficient. In this paper we implement this structure by implementing a custom Java simulator. We also implement traffic aware routing mechanisms to improve robustness of the data center. The experimental results revealed that the proposed design is effective and robust to failures.
Keywords: Data center, server interconnection structure, scalable routing, and fault tolerance
Huffman Based LZW Lossless Image Compression Using Retinex Algorithm
DALVIR KAUR, KAMALJIT KAUR Master of Technology in Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India Assistant Professor, Department Of Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab, India
Abstract: Image compression is an application of data compression that encodes the original image with few bits. The objective of image compression is to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. So image compression can reduce the transmit time over the network and increase the speed of transmission. In Lossless image compression no data loss when the compression Technique is done. In this research, a new lossless compression scheme is presented and named as Huffman Based LZW Lossless Image Compression using Retinex Algorithm which consists of three stages: In the first stage, a Huffman coding is used to compress the image. In the second stage all Huffman code words are concatenated together and then compressed with LZW coding and decoding. In the third stage the Retinex algorithm are used on compressed image for enhance the contrast of image and improve the quality of image. This Proposed Technique is used to increase the compression ratio (CR), Peak signal of Noise Ratio (PSNR), and Mean Square Error (MSE) in the MATLAB Software.
Analysis Of Fault Tolerance Approach For Data Replication In Data Intensive Scientific Applications
SINU NAMBIAR, PROF. RAKESH PANDIT, PROF. SACHIN PATEL Student(M.Tech), PCST, Department of Information Technology, Indore, MP, India Asst. Professor, PCST, Department of Information Technology, Indore, MP, India Asst. Professor & HOD, PCST, Department of Information Technology, Indore, MP, India
Abstract: Data Intensive scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. There are systems that try to unify job and data management, but these are two different tasks to face in a Grid environment. Existing systems have tried to achieve only either job scheduling or data replication and does not provide fault tolerance. Data replication and job scheduling are two different but complementary functions in Data Grids: one to minimize the total file access cost (thus total job execution time of all sites), and the other to minimize the MakeSpan (the maximum job completion time among all sites). The two main challenges: first, how to formulate a problem that incorporates not only data replication but also job scheduling, and which addresses both total access cost and maximum access cost; and second, how to find an efficient algorithm that, if it cannot find optimal solutions of minimizing total/maximum access cost, gives near-optimal solution for both objectives in the proposed system. A novel method to achieve maximum fault tolerance in the Grid environment system by using a fault recovery pool is proposed.
Keywords: MakeSpan, Optimal MakeSpan, Nominal Distribution, Data Grid, GridSimI
A Software for Diagnosis and Management of Diseases and Pests in White button Mushrooms
ER.PRATIBHA GOYAL, ER.SALAM DIN, DR.SHAMMI KAPOOR Department of SEEIT, PAU, Ludhiana, India Associate Professor, Department of SEEIT, PAU, Ludhiana, India Senior Mycologist, Department of Microbiology, PAU, Ludhiana, India
Abstract: The cultivation of White Button Mushrooms are growing in Punjab and adjoining areas are carried out by seasonal growers with no almost environmental controls. In the country of India majority of the mushroom holdings are lacking adequate pasteurization compost preparation and proper environmental control facilities, which give rises to the development of various diseases and pests sufficiently to a level to cause considerable yield loss. So this crop is always under threat of attack by diseases and pests. Diagnosing these diseases and pests is difficult and subjected to expert opinion. This proposed system is developed to automate the inspection of White Button Mushrooms and helps to identify diseases and pests. There are also a number of diseases which have similar symptoms making it difficult for non-experts to distinguish them correctly. The proposed system will use colored images of defected mushrooms to detect and diagnose the particular disease and pest. This will assist the farmers to identify any pest, any disease and make right action. This system is developed using ASP.Net and database using SQL Server 2008.
Implementing LSB on Image Watermarking Using Text and Image
GURPREET KAUR, KAMALJIT KAUR Student, M.tech (CSE), Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab Assistant Professor, Computer Science Department, Sri Guru Granth Sahib World University, Fatehgarh Sahib, Punjab
Abstract: With the rapid development and wide use of Internet, information transmission faces a big challenge of security. Steganography, cryptography hashing and access control are different techniques which are used for database security. Watermarking is one of the accurate techniques for data security. Watermarking used in different fields like images, audio, video, text. Image is used for image security. There are different existing methods which are used for image watermarking with LSB algorithm. In this method Image watermarking using LSB algorithm is based on two different parameters Standard deviation and Mean. Image watermarking can be hidden in two ways, either text is used for secret message or image is used for secret image. After selecting the information hiding message, it uses LSB algorithm and hides the information on high result value of these parameters.
Keywords: Entropy, LSB, Mean, Standard Deviation, Watermarking.
An Analysis on Text Mining -Text Retrieval and Text Extraction
UMAJANCY.S, DR. ANTONY SELVADOSS THANAMANI Research Scholar, Dr. Mahalingam Centre for Research and Development, NGM College, Pollachi, India Associate Professor and Head, Dr. Mahalingam Centre for Research and Development, NGM College, Pollachi, India
Abstract: Text Mining is the analysis of data contained in natural language text. Text Mining works by transposing words and phrases in unstructured data into numerical values which can then be linked with structured data in a data base and analyzed with traditional data mining techniques. Data stored in text database is mostly semi structured i.e., it is neither completely unstructured nor completely structured. Information retrieval techniques such as text indexing have been developed to handle the unstructured documents. The related task of Information Extraction (IE) is about locating specific items in natural language documents. This article analyses the various techniques related to text retrieval and text extraction.
Keywords: Text Mining, Information retrieval, Information Extraction, Natural Language Processing.
Comparative Analysis of Bayes and Lazy Classification Algorithms
MS S. VIJAYARANI, MS M. MUTHULAKSHMI Assistant Professor, Department of Computer Science, School of Computer Science and Engineering, Bharathiar University, Coimbatore, Tamilnadu, India M.Phil Research Scholar, Department of Computer Science, School of Computer Science and Engineering, Bharathiar University, Coimbatore, Tamilnadu, India
Abstract: Data mining is the non-trivial extraction of implicit, earlier unknown and potentially useful information about data. There are several data mining techniques have been developed and used in data mining projects which includes classification, clustering, association rules, prediction, and sequential patterns. Data mining applications are used in various areas such as sales, marketing, banking, finance, health care, insurance and medicine. There are various research domains in data mining namely web mining, text mining, image mining, sequence mining, privacy preserving data mining, etc. Text mining is a technique which extracts information from both structured and unstructured data and also finding patterns which is novel and not known earlier. It is also known as knowledge discovery from text (KDT), deals with the machine supported analysis of text. Text mining is used in various areas such as information retrieval, document similarity, natural language processing and so on. Searching for similar documents is an important problem in text mining. The first and essential step of document similarity is to classify the documents based on their category. In this research work, we have analysed the performance of Bayesian and Lazy classifiers for classifying the files which are stored in the computer hard disk. There are two algorithms in Bayesian classifier namely BayesNet, and Naïve Bayes. In lazy classifier has three algorithms namely IBL, IBK and Kstar. The performances of Bayesian and lazy classifiers are analysed by applying various performance factors. From the experimental results, it is observed that the lazy classifier is more efficient than Bayesian classifier.
Keywords: Data mining, Text mining, Classification, Bayesian, BayesNet, Lazy, IBK, Naïve Bayes, IBL, Kstar.
An Efficient Intrusion detection system for network behaviors using Fuzzy logic based Rules
SUMATHI M, UMARANI R Department Of Computer Science, Mahendra Arts & Science College, Salem, Tamilnadu, India Department Of Computer Science,Sri Saradha College For Women, Salem-16, Tamilnadu, India
Abstract: Internet services and web applications have become an inextricable part of daily life, enabling communication and the management of personal information from anywhere. Artificial Intelligence plays a driving role in security services. This paper proposes a dynamic model Intelligent Intrusion Detection System, based on Fuzzy rules based AI approach for intrusion detection. The techniques are modeled using fuzzy logic with network profiling that uses simple data mining techniques to process the network data. The proposed system that combines anomaly, misuse and host based detection. Simple Fuzzy rules allow us to construct if-then rules that reflect common ways of describing security attacks. For host and Network based intrusion detection use fuzzy rules and machine learning along with self organizing hash maps. Suspicious intrusions can be traced back to its original source path and any traffic from that particular source will be redirected back to them. Both network traffic and system audit data are used as inputs for both. Experimental results proves that system out performs other techniques.
Keywords: Anomaly detection, network behavior, intrusion detection, Data Centre Security
RAHUL B. MANNADE, AMOL B. BHANDE System Analyst, Govt. College of Engineering, Chandrapur, India Assistant Manager, Network Operations, Vodafone India Ltd., Pune, India
Abstract: Mobile computing is a new computing paradigm in which mobile devices are used to access information from anywhere, at any time. Wireless network greatly enhances the utility of a portable computing device. The field of mobile computing is merger of the portable computing device and wireless communication with the aim of providing seamless computing environment for mobile users. Mobility implies that network needs to cope with moving users. Wireless communication faces more obstacles than wired communication due to environmental interferences. As a result wireless communication is characterized by lower bandwidth, higher error rates and more frequent disconnections. Mobility can also cause wireless connectivity to be lost or degraded. Unlike typical wired network, number of mobile users varies dynamically and large convention and public events may overload the network capacity. Mobile devices are characterized by smaller size, light in weight and low power. Hence while designing wireless networks as well as mobile application softwares all these issues should taken in consideration.
D.S.MAHENDRAN, S.SAKTHIVEL Associate Professor, Department of Computer Science, Aditanar College, Tiruchendur, India Principal, P.S.N.A College of Engineering, Dindigul, India
Abstract: The explosive development of Information and Communication Technology (ICT) has significantly increased both energy demands and carbon dioxide emission. This leads to the energy crisis and global warming problems worse. The escalating energy costs and the environmental concerns have already created an urgent need for more energy-efficient “GREEN” computational methods. Energy efficient coding may involve improving computational efficiency so that data is processed as quickly as possible and the processor can go into a lower power "idle" state. In this paper we, modified the existing routing algorithm to minimize the energy loss by minimizing the computational time in selecting the routes between source and destination in a data network. This work shows that the proposed algorithm takes less computational time than the expected proximity algorithm (EP) and maximum proximity (MP) algorithm. The performance is studied computationally on various networks under static traffic model.
Keywords: Green Computing, Global Warming, Routing Algorithm, Congestion
High Throughput Multirouting in the Wireless network with path Metric computation
ANU S, UMARANI R Department Of Computer Science, Periyar University College Of Arts & Science, Mettur Dam-01, Tamilnadu, India Department Of Computer Science,Sri Saradha College For Women, Salem-16, Tamilnadu, India
Abstract: Many applications and areas of wireless sensor networks (WSN), have diverse data traffic with different quality of service (QOS) requirements. As ddress the problem in this paper by Employing a High Throughput Metric (HTM), which finds high-throughput paths on multi-hop wireless networks. HTM minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput. This paper describes the design and implementation of HTM as a metric for the routing protocols. Experimental results demonstrate for long paths the throughput improvement is often a factor of two or more, suggesting that HTM will become more useful as networks grow larger and paths become longer.
Keywords: Wireless Sensor Networks, High Throughput, Quality of Service, Multirouting, path Estimation metric
Encryption and Decryption Algorithm using ASCII values with substitution array Approach
VINEET SUKHRALIYA, SUMIT CHAUDHARY, SANGEETA SOLANKI Assistant Professor, Electronics & Communication, VKIT, Bijnore, India Assistant Professor, Computer Science, Shri Ram Group of Colleges, Muzaffarnagar, India Assistant Professor, Computer Science, Shobhit University, Meerut, India
Abstract: This is the algorithm in which randomly generated numbers are used with the help of modulus and remainder by making program in any language i.e. c, c++ and java. Carefully, using these modulus & remainder for getting a new method for encrypting and decrypting the message. Though complex encryption techniques have been employed in safeguarding data. Three or more keys can also be used to make the enciphering process more complicated. The main focus of this paper is to provide with an encryption decryption algorithm with secure strength, bringing failure to the intruder effort to break the cipher.
Simulative Comparison of 40 Gbps OTDM Transmission System operating at S-band and C-band over ITU G.653
JYOTSANA, RAMANDEEP KAUR, RAJANDEEP SINGH Dept. of Electronics & Communication, UCoE, Punjabi University, Patiala, Punjab, India Dept. of Electronics, GNDU, Amritsar, Punjab, India
Abstract: Optical Time Division Multiplexing (OTDM) is a promising alternative to Wavelength Division Multiplexing (WDM) in order to achieve high capacity optical network and large distances. In this paper, different dispersion compensation techniques has been compared using ITU G.653 fiber on 40 Gbps OTDM system operating at C-band and S-band.The dispersion compensation is done using Dispersion Compensating Fibers (DCF).40 Gbps OTDM transmission system achieved maximum transmission distance of 1200 km over ITU G.653 using symmetrical dispersion compensation with acceptable bit error rate of 2.39 × 10−9 and Q value of 5.95 dB.
Testability Estimation of Object Oriented Design: A Revisit
ABDULLAH, DR. REENA SRIVASTAVA, DR. M.H. KHAN Research Scholar, School of Computer Application, BBDU, Lucknow, India Dean, School of Computer Application, BBDU, Lucknow, India Associate Professor, Department of C.S. E., I.E.T., Lucknow, India
Abstract: Testability is one of the most important quality indicators. Its correct measurement or evaluation, always facilitate and improve the test process. However, testability has always been an elusive concept and its correct measurement or evaluation is a difficult exercise. Researchers and practitioners have always argued that testability should be considered as a key attribute in order to guarantee the software quality. An accurate measure of software quality depends on testability measurement, and as a result estimating efforts in measuring testability is a complex problem attracting considerable research attention. This paper presents the results of a systematic review conducted to collect evidence on software testability estimation of object oriented design. In this review paper, our aim is to find the existing known comprehensive and complete model or framework for evaluating the testability of object oriented design at an initial stage.
A Fault Tolerant Mechanism for Composition of Web Services Using Subset Replacement
SHUCHI GUPTA, PRAVEEN BHANODIA Student, Computer Science & Engineering, Patel College of Science & Technology, Indore, India Assistant Professor, Computer Science & Engineering, Patel College of Science & Technology, RGPV Indore, India
Abstract: Businesses offer complex services to the users, which can’t be provided by a single Web Service. A Composite Web Service provides more complicated function, by composing multiple Web services. A composite service is more susceptible to failure than an atomic service. During the execution of a Composite Web Service, if one Component Service fails or becomes unavailable, the whole Composite Web Service fails. A middle agent (broker) simplifies the interaction between service providers and service requester and fulfills the user's need. The broker composes a desired value-added service and orchestrates the execution of Web Services. A replacement policy has been proposed in this paper that replaces the subset of Web Services that contains failed Web Service with another equivalent subset. During the execution, if a failure occurs, subsets containing failed Web Service are identified. Subsequently the subsets equivalent to failed one are identified. These equivalent subsets are ranked as per the policy and the best subset is selected. The old subset is replaced with the new equivalent subset in the Composite Web Service.
Keywords: Web Services, Composition, Subset Replacement, Equivalent Services.
Comparative Analysis of Different Queuing Mechanisms in Hetrogeneous Networks
SHUBHANGI RASTOGI, SAMIR SRIVASTAVA M.Tech Student, Computer Science and Engineering, KNIT, Sultanpur, India Associate Professor, Computer Science and Engineering, KNIT, Sultanpur, India
Abstract: Each router in the network must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. So Queuing is one of the important mechanisms in traffic management. In this paper various existing queuing algorithms are explained First in First out (FIFO), Priority Queue (PQ), Fair Queue (FQ), Weighted Fair Queue (WFQ), Class based WFQ (CBWFQ), Self Clocked FQ (SCFQ), Worst case fair WFQ (WF2Q), Worst Case fair WFQ plus (WF2Q+), Round Robin (RR), Weighted RR (WRR), Deficit WRR (DWRR). Then a comparative analysis of three queuing mechanisms FIFO, PQ and WFQ.WFQ technique has a superior quality than the other techniques.
Effect of Different Semi Conductive Substrate Materials on a P shaped Wearable Antenna
RAJASREE HAZRA, CHANDAN KUMAR GHOSH, S.K.PARUI Dr.B.C. Roy Engineering College, Durgapur, India Department of Electronics and Telecommunication Engineering, Bengal Engineering and Science University(BESU), Shibpur, Howrah-711103, India
Abstract: This paper presents the effect using different semiconductive substrate materials on a P shaped wearable antenna. This P shaped wearable antenna is designed for Body Centric Wireless Communication (BCWC) application at 2.45 GHz . Three types of semiconductive materials were selected : diamond, gallium arsenide, silicon. These three types of semiconductive materials are compared with duroid(tm) substrate. The results demonstrated a good agreement between simulated return loss, radiation pattern of all three substrates used for this wearable antenna. The simulated return loss and radiation pattern characteristics for all three types of substrates agreed reasonably well with this P shaped wearable antenna. Numerical study has been carried out, by using Ansoft HFSS V13 simulating software.
Data Security and Privacy in Cloud Storage using Hybrid Symmetric Encryption Algorithm
DR. L. AROCKIAM, S.MONIKANDAN Associate Professor, St. Joseph’s College, Trichy, Tamilnadu, India Research scholar, M S University, Tirunelveli, Tamilnadu, India
Abstract: One of the primary usage of cloud computing is data storage. Cloud provides enormous capacity of storage for cloud users. It is more reliable and flexible to users to store and retrieve their data at anytime and anywhere. It is an increasingly growing technology. Nowadays, many enterprises have started using cloud storage due to its advantages. Even though the cloud continues to gain popularity in usability and attraction, the problems lie in data security, data privacy and other data protection issues. Security and privacy of data stored in the cloud are major setbacks in the field of Cloud Computing. Security and privacy are the key issues for cloud storage. This paper proposes an encryption algorithm to address the security and privacy issue in cloud storage in order to protect the data stored in the cloud.
A Hybrid Routing Mechanism for Fast and Secure Data Transmission in MANET
RONGALI AVATARAM, DR.B.PRABHAKARA RAO, B.A.S.ROOPA DEVI PG Student, Department of Electronics and Communication Engg., JNTU Kakinada University, Andhra Pradesh, India Senior Prof, Department of Electronics and Communication Engg., JNTU Kakinada University, Andhra Pradesh, India Research Scholar, Department of Computer Science Engineering, JNTU Kakinada University, Andhra Pradesh, India
Abstract: Due to mobility of nodes, routing protocol selection in MANET is a great challenge because of its frequent topology changes. For fast data transmission, we need a better routing protocol that adapts to topology changes quickly. In this paper, a fast and secure routing protocol which is both proactive and reactive in nature has been implemented. In proactive routing mechanism, each node consists of a routing table, that routing table updates takes place when the topology changes. When a new node is added in the network then the topology of the network will change and it takes some time to converge during that time if we want to send data to destination through that new node immediately, it takes some time to converge and then it will transmit the data. To avoid this problem we are going to use reactive protocol instead of proactive in that time that is until network converge. To avoid waiting time and to transmit data as early as possible, we reduced the packet size and contain only limited fields in proactive protocol structure. By this, the total bit size gets reduced. For security aspect we propose a technique to detecting malicious node by using central agent and back ground processing algorithm. The proposed work is simulated in NS-2 simulator.
Keywords: MANET, Proactive, Reactive, Fast and Secure Protocol, Central agent, Processing algorithm, NS-2.
Comparative Analysis of Side Lobe Level Reduction Optimization Algorithms of Linear Antenna Array
AMANDEEP KAUR, MRS. SONIA GOYAL Student, Electronics and communication Engineering Department, University College of Engineering Punjabi University, Patiala, Punjab, India Asst. Prof., Electronics and communication Engineering Department, University College of Engineering Punjabi University, Patiala, Punjab, India
Abstract: Linear antenna array design is one of the most important electromagnetic optimization problems of current interest . In the antenna arrays the side lobe level is main problem which causes wastage of energy. This paper describes the application of a recently developed metaheuristic algorithm ,known as the Particle Swarm Optimization Gravitational Search Algorithm(PSOGSA) to optimize the spacing between the elements of the linear array to produce a radiation pattern with minimum side lobe level. The results of the PSOGSA algorithm have been compared with results obtained using other metaheuristics like the Invasive Weed optimization(IWO),Particle Swarm Optimization(PSO) and Tabu Search (TS) algorithm.
An Secure Anonymous Group Communication in Mobile Ad-Hoc Networks
K.VINOTH KUMAR, N.SENTHIL KUMARESAN Assistant Professor, M.A.R College of Engineering and Technology, Tamil Nadu, India PG Scholar, J.J College of Engineering and Technology, Tamil Nadu, India
Abstract: Secure group communication with efficient self-organizing key agreement and key establishment is essential to distributed applications in mobile ad-hoc networks (MANETs). In this paper, we propose a Secure Anonymous Routing Protocol (SARP) which is able to provide confidentiality service and non-repudiation service simultaneously. SARP based on Group signature and ID-based cryptosystem for ad hoc networks. The design of SARP offers strong privacy protection completes unlinkability and content unobservability for ad hoc networks. In the proposed scheme, all group members contribute their own public keys to negotiate a shared encryption public key, which corresponds to all different decryption keys. By using the shared public key and the respective secret key, confidentiality and non-repudiation can be obtained, respectively. Both are essential to secure group communication in MANETs. Compared with the exiting anonymous routing schemes for multiple recipients. Accordingly, it is quite suitable to secure group communication in self-organizing, distributed and resource-constrained MANETs.
Keywords: Anonymous routing, key establishment, non-ruputation, group communication, MANET.
A semantic Vector Space Model approach for sentiment analysis
VIJAY DIXIT, ANIL SAROLIYA M.Tech (CSE), Computer Science and Engineering, Amity University, Jaipur, India Coordinator (CSE), Computer Science and Engineering, Amity University, Jaipur, India
Abstract: A response to growing availability of formal, informal, opinionated texts like film review, product review etc., an area of Sentiment Analysis has begun which raised the question that “What people think about a particular topic?”. This paper present a semantic VSM (vector space model) which capture sentiment and semantic similarities among words which we are using on the micro blogging sites. Semantic vector space model-based approaches used for a large amount of information could be obtained by analysis of generated word text by the humane on social networking sites. The purpose of this research is the construction and estimation of algorithms for the analysis and the classification of large amount of humane generated text data, will focus on sentiment analysis on twitter or similar social community environments.
CAFS: Cluster based Authentication scheme for Filtering False data in wireless Sensor network
UMA NARAYANAN, ARUN SOMAN Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri valley, Cochin, India Assistant Professor, Department of Information Technology, Rajagiri School of Engineering and Technology, Rajagiri valley, Cochin, India
Abstract: Wireless sensor is an emerging technology that has resulted in variety of application. Wireless sensor networks offer unique benefits and versatility for those locations and applications where human interaction is less feasible, examples of which may be to monitor volcanoes, movements inside enemy territory or temperature and humidity deep inside a machinery, to count a few. Wireless sensor networks can provide low cost solution to verity of real-world problems. Due to its tiny size it is easy to be compromised. So when a node is compromised it is easy to inject false data in to the network. It is burden to sink to verify the false data. In this paper, we propose a Cluster based authentication scheme for filtering injected false data in wireless sensor network. Based on elliptical curve cryptography, Diffe - Hellman key management technique and using Cooperative authentication scheme with CNR based MAC code technique; the proposed scheme can save energy by early detecting and filtering the majority of injected false data with minor extra overheads at the en-route nodes. In addition, only a very small fraction of injected false data needs to be checked by the sink, which thus largely reduces the burden of the sink. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high filtering probability and energy saving.
Analytical approach for Mitigation and Prevention of DDoS Attack using Binomial theorem with Bloom filter an Overlay Network Traffic
V.SHYAMALADEVI, DR. R. UMARANI Associate Professor, Department of MCA, KSRCT, Tiruchengode, Tamilnadu Professor, Department of MCA, Saradha Womens College, Salem, Tamilnadu
Abstract: A distributed denial of service attack (DDoS) occurs when multiple systems flood the bandwidth or resources of a targeted system. These systems are compromised by attackers using various methods. IP address spoofing occurs when an attacker assumes the source Internet Protocol (IP) address of IP packets to make it appear as though the packet originated from a valid IP address. Most IP networks utilize the user’s IP address to verify identities and routers also typically ignore source IP addresses when routing packets. Routers use the destination IP addresses to forward packets to the intended destination network. It could enable an attacker to bypass a router and to launch a number of subsequent attacks. Mitigation Threat Management System (MTMS) is a vital component of sophisticated and adaptive DDoS countermeasures which surgically mitigate and remove attack traffic while enabling the flow of legitimate traffic. It offers a mechanism for attack mitigates and detection the attack traffic route using Binomial distribution with Bloom filters. It protects both IPv4 and IPv6 infrastructure from DDoS attacks. This threat management functionality can be improving profitability by providing the foundation for new, revenue-generating, managed DDoS protection services.
Cloud Computing Management and Synchronization Tools
LALIT GEHLOD, VAIBHAV JAIN, MANISH SHARMA Asst.Professor, Computer Engg. Department, IET, DAVV, Indore, India Asst.Professor, Computer Engg. Department, IET, DAVV, Indore, India Student, Computer Engg. Department, IET, DAVV, Indore, India
Abstract: Rapidly increasing demand of computation on business processing, data centres and large file transfers leads to develop a new kind of technology that provide services for computational need, storage in high secure and manageable way. Cloud computing answers our technological ambitions by introducing different kinds of service platforms in low cost and a high computational environment. In this paper we discuss different domain of research and innovations in cloud computing domain. Additionally this paper provides a literature for challenges and issues in cloud computing environment.
MADHAVA REDDY. CH, SRINATH REDDY. N, SUNIL KUMAR. V.V Associate Professor, Visvodaya Engineering College, Kavali Associate Professor, Visvodaya Engineering College, Kavali Associate Professor, PBRVITS, Kavali
Abstract: We know that in network systems it is not possible to avoid Denial-of-Service attacks. Denial-of-Service attacks will play important role on security as well as on through put. As Security has their own vulnerability to DoS, this paper studies how to avoid the risk of DoS in security and through put. In this context, we begin building attacker capabilities and a basic network to model the actual protocol operation. Secondly we build an advanced model for evaluation of the risk. After defining the intruder capability with a basic model, the risk evaluation model gives the “Risk-Evolution-Factor” (REF) for the Security and through put. The “Risk- Evolution-Factor” is going to presents the amount of computing resources is expected to lose with a specified level of confidence in security and through put. This model can help end users to have a good understanding of the protocols structures, what they are using, and in addition to that provide help developers and designers to examine their developments and designs and get hints to improve the same.
Design and Simulation of Wavelet OFDM with Wavelet Denoising on AWGN Channel
GOVINDA RAJU. M, DR.B.V.UMA Assistant Professor, ECE, RVCE, Bangalore-59 Professor, ECE, RVCE, Bangalore-59
Abstract: OFDM technique is widely used due to its high spectrum efficiency. Fast Fourier Transforms (FFT) has been used to generate the orthogonal sub-carriers. Implementation complexity of FFT based OFDM, has led to replace conventional FFT based OFDM by wavelet based OFDM. The main objective of this paper is to replace the conventional FFT based OFDM system with some orthonormal wavelets. Comparing with the conventional OFDM, it is found that the Haar and Daubechies-based orthonormal wavelets are capable of reconstructing the transmitted symbol at the receiver side and effect of noise is reduced using wavelet denoising for different SNRs on AWGN channel. In this paper, results are tabulated for transmitted symbols and reconstructed symbols after wavelet denoising& compared for an analysis. The scatterplot analysis of DWT-OFDM is also presented for different SNRs.
A Grid Based Robot Navigation by Using Priority Algorithm
LALIT GEHLOD, VAIBHAV JAIN, MALA DUTTA, DEVESH KUMAR LAL Asst.Professor, Computer Engg. Department, IET, DAVV, Indore, India Asst.Professor, Computer Engg. Department, IET, DAVV, Indore, India Asst.Professor, Computer Engg. Department, IET, DAVV, Indore, India Student, Computer Engg. Department, IET, DAVV, Indore, India
Abstract: The searching of a block over grid is easier when the rows and columns i.e. m* n of a grid is fixed. But when the grid is dynamic or changes over time than in such situation we require a generalized algorithm for traversing over a grid. In these paper we develop an approach for searching an object and also able to avoid an obstacle which was placed in a junction (meeting point of row and column). Here, we use different algorithms like Dijkistra’s, Best first search and A star algorithms. We develop an approach to find the block with minimum shortest path with the help of priority based algorithm.
Keywords: Grid solver robot, shortest path algorithm, Line follower robot, path planning, Grid based navigation, obstacle avoidance.
Robust Ramp Metering Design using Sliding Mode Control of a Hybrid Dynamical Model with Functional Uncertainties
BHAWNA SHARMA, DEVANAND, PUSHKIN KACHROO Assistant Professor, Department of Computer Engineering, Govt. College of Engineering & Technology, Jammu, India Professor, Department of Computer Science & Information Technology, University of Jammu, India Professor, Department of Electrical & Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA
Abstract: This paper presents an application of sliding mode control based concept to real time freeway ramp metering. A robust hybrid feedback control design for controlling the traffic flow on ramp and entering a freeway to reduce traffic congestion has been designed. This model uses Godunov based hybrid switching with sliding mode control to produce robust stability for the system in presence of parametric uncertainties and functional disturbances. The main obstacle encountered in real time application using sliding mode control is chattering which is suppressed by introducing a boundary layer around the switching surface and using a continuous control function within the boundary layer. Simulations have been performed that show the effectiveness of the proposed novel approach and confirm that sliding mode is reachable in finite time.
A Survey of Hyperspectral Image Classification in Remote Sensing
R.ABLIN, C.HELEN SULOCHANA Assistant Professor, Electronics and Communication Engg., Arunachala College of Engineering for Women, Affiliated to Anna University Chennai, Tamilnadu, India Professor, Electronics and Communication Engg., St.Xavier’s Catholic College of Engineering, Affiliated to Anna University Chennai, Tamilnadu, India
Abstract: Hyperspectral image processing has been a very dynamic area in remote sensing and other applications in recent years. Hyperspectral images provide ample spectral information to identify and distinguish spectrally similar materials for more accurate and detailed information extraction. Wide range of advanced classification techniques are available based on spectral information and spatial information. To improve classification accuracy it is essential to identify and reduce uncertainties in image processing chain. This paper presents the current practices, problems and prospects of hyperspectral image classification. In addition, some important issues affecting classification performance are discussed.
HEENA SHAIKH, D.A.KULKARNI, G.R.UDUPI CSE Department, KLS Gogte Institute of Technology, Belgaum, India Department of E & C, KLS VDRIT Haliyal, India
Abstract: Breast cancer is the most common cancer in women and is the second leading cause of cancer death. Although it is curable when detected early, about one third of women with breast cancer die, so it is one of the most dangerous types of cancer caused all over the world. In the last decade, many research projects have been carried out aiming to develop computational systems to help specialists in the task of interpreting radiological images. Therefore detection of masses in mammogram images can be used for the early detection of breast cancer. Main contributions of this study are demonstrating the potential of cellular neural networks(CNN) to segment suspect regions in mammographic images and proposing a methodology that includes use of geostatistical functions (Ripley’s K function and Moran’s and Geary’s indices) as texture signatures for mass detection. In the first stage of methodology the image is acquired from the DDSM database which is then pre-processed and later segmented using CNN, further the feature extraction process is carried using geostatistical functions which are later classified using support vector machine. The proposed work can allow this methodology to be added as a computer tool for the medical area, providing support to specialists especially in cases in which visualization is difficult. This allows optimizing the features for higher efficiency.
Design and Performance Analysis of Secure Elliptic Curve Cryptosystem
GURURAJA.H.S, M.SEETHA, ANJAN.K.KOUNDINYA Assistant Professor, Department of Information Science & Engineering, B.M.S. College of Engineering, Bangalore, India Professor, Department of Computer Science & Engineering, G.Narayanamma Institute of Technology and Science, Hyderabad, India Assistant Professor, Department of Computer Science & Engineering, R.V. College of Engineering, Bangalore, India
Abstract: In public-key cryptosystems, the use of RSA and Diffie-Hellman cryptosystems are not adequate due to the use of large number of bits. Elliptic Curve Cryptography has become one of the latest trend in the field of public-key cryptography. Even though, Elliptic Curve Cryptography promises a faster and more secure method of encryption compared to any other standard public-key cryptosystem, there are possibilities of making the algorithm more efficient and secure. This paper illustrates a new design of Elliptic Curve Cryptography implementation which makes it more infeasible attempting any subliminal attack to break the cryptosystem.
Keywords: Elliptic Curve Cryptography, Subliminal Channel, Public-Key Cryptosystem, Encryption, Decryption, Key Generation, Random Number Generation
Density Based Fuzzy C Means (DBFCM) Image Segmentation
ARPAN GARAI, KALYANI MALI Computer Science Engineering, Kalyani Govt. Engineering College, Kalyani, India Computer Science Engineering, Kalyani University, Kalyani, India
Abstract: The fuzzy c means image segmentation algorithm is mainly implemented taking the attribute as intensity. Often some of the relevant segments in different density are missed as they have same intensity which is not desired. But if the segmentation is done in density domain as well as intensity domain then far better result can be obtained. Here In this paper density based fuzzy c means (DBFCM) clustering is presented. It is divided into two steps first different dense region is found using kth nearest neighbour then fuzzy c means segmentation is done on each dense region. The DBFCM is implemented upon some of the satellite images to get the segments as experimental results. Then it is compared with the conventional fuzzy c means approach.
Keywords: Density based segmentation; Image segmentation; kth nearest neighbour distance; fuzzy c means; satellite image segmentation
A.SUGANYA, K.SRIDEVI, P.THENMOZHI, N.VANITHA Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India Bachelor of Engineering, CSE, Angel College of Engineering and Technology, Tirupur, India
Abstract: Cool Java is an Intelligent Development Environment kit for JAVA language .It is developed using JavaScript. We can upload it as online web application. The basic idea is instead of making the user to type all the lines of program, let them to design the output of applet program. so the corresponding coding will get generated .Cool java reduces the typing work up to 95%.Cool java focus on typing reduction but the compilation area is separate which is standard JDK compiler . Most of the compilers are strong in compilation side but not in editing side. (i.e.) we have to type the entire program by manually unreasonably it takes too much of time. This means typing time is more than thinking time. To reduce the typing time and also to reduce the errors we require one solution. Our Cool Java is designed based on the error reduction and less time consumption concept. Cool java removes logical errors and syntax errors before submitting the program to the compiler.
Power Aware Routing Protocol for MANET’s using Swarm Intelligence
SRIDHAR H.S, DR. M. SIDDAPPA, DR.G.C.BHANU PRAKASH Assistant Professor, Dept. of Electrical and Electronics Engg , Siddaganga Institute of Technology, Tumkur, India Professor and Head of the Department, Dept. of Computer science and Engg, Sri Siddhartha Institute of Technology, Tumkur, India Professor, Dept. of Computer science and Engg, SIR M.Visvesvaraya Institut of Technology, Bangalore, India
Abstract: Wireless networking has witnessed an explosion of interest from consumers in recent years for its applications in mobile and personal communications. As wireless networks become an integral component of the modern communication infrastructure, energy efficiency will be an important design consideration due to the limited battery life of mobile terminals. As MANET’s are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. Since the network interface is a significant consumer of power, considerable research has been devoted to low-power design of the entire network protocol stack of wireless networks in an effort to enhance energy efficiency. This paper we presents that insect colonies based intelligence – commonly referred to as Swarm Intelligence (SI) – provides an ideal metaphor for developing routing protocols for MANETs. In this context, we propose a new routing protocol for MANETs –SensorBee – inspired by the foraging principles of honey bees.
Keywords: Energy efficiency, Power management, Swarm Intelligence
A Relative Structure Similarity Method For Multiple Ontologies Alignment
ALI I.EL-DESOUKY, HESHAM A.ALI, RABAB S.RASHED Computers and Systems Department, Faculty of Engineering, Mansoura University, Egypt Computers and Systems Department, Faculty of Engineering, Mansoura University, Egypt Electrical Engineering Department, Faculty of Engineering, Kafr Elsheikh University, Egypt
Abstract: Knowledge in domain is expressed with the help of ontology which is scattered all over its space. Using ontology gives a share in increasing precision. Different ontologies may represent the same domain, thus includes different terms that equivalently refer to the same meaning and vice versa. This results in different structures for ontologies. That's why it is necessary to relate concepts and keywords within the same domain. One of the efficient ways to relating domain knowledge representation is ontology alignment and mapping. The main objective of ontology mapping is to determine the relationship between concepts and find the semantic mapping between ontologies. This problem lies at the heart of numerous information processing applications. As the same domain knowledge are described by different ontologies differ in modeling or structure or language which leads to heterogeneity. To overcome this problem, this paper uses different similarities to find the relationships between ontologies. String similarity but it only considers the same term that represents different meaning. So semantic similarity is needed to be employed for higher efficiency, so semantic similarity using WorldNet database is explored and the results of pervious similarities are considered the primitive similarity to overcome all heterogeneity problems by structure similarity based on common subsume concepts and semantic similarity by IC(information content) and modify calculation of IC to consider all concept attributes. Structure similarity and semantic similarity are combined and called relative similarity. This paper suggests a modified structural similarity method called a relative structure similarity that present a way for solving the heterogeneity between ontologies based on entities that have a common subsumed which have a relationship and information content(IC). The proposed method presents a scheme based on the real relationships across ontologies, and modification of calculation of information content using intrinsic information of ontologies to overcome of drawbacks of the methods by taking into account entity attributes. Comparison studies are made to test the validity of the proposed method.
Keywords: ontology Alignment, mapping, structure similarity, Information content(IC), Lowest Common Subsumer (LCS).
Symbol detection in MIMO systems using SA-BFO optimization algorithm
RAMANPREET KAUR, SONIA GOYAL Electronics and Communication Eng., University College of Engineering, Punjabi University, Patiala, India
Abstract: Multi-Input Multi-output based communication system architecture promises increased capacity and high data rates. Self-adaptive Bacterial Foraging Optimization (SA-BFO), inspired by foraging behaviour of bacteria, is one of the recent technologies in solving optimization problems. In this paper SA-BFO based algorithm for symbol detection in multi- input multi-output system is presented. While an optimal Maximum Likelihood (ML) detection using an exhaustive search method is prohibitively complex, simulation results show that the SA-BFO optimized MIMO detection algorithm results in near optimal Bit Error Rate (BER) performance , with significantly reduced complexity.
Keywords: MIMO (Multi-Input Multi-Output system), BER (Bit Error Rate) , SA-BFO (Self-Adaptive Bacterial Foraging Optimization algorithm), ML (Maximum Likelihood)
T.NITHYA Assistant Professor, Department of Computer Science, Dr. N G P Arts and Science College, Coimbatore, India
Abstract: As the web is growing rapidly, the users get easily lost in the web’s rich hyper structure. The primary goal of the web site owner is to provide the relevant information to the users to fulfill their needs. Web mining technique is used to categorize users and pages by analyzing users behavior, the content of pages and order of URLs accessed. Web Structure Mining plays an important role in this approach. In this paper gives an introduction to Web mining, then describes Web Structure mining in detail, and explores the data structure used by the Web. This paper also explores different algorithms and compares those algorithms used for Information Retrieval.
Keywords: Web Mining, Web Structure, PageRank, Weighted PageRank and Hyper-link Induced Topic Search.
Comparison of NRZ and RZ data modulation formats in SAC-OCDMA system under introduced clock timing jitter of laser diode
HARPREET KAUR, MANJIT SINGH BHAMRAH Electronics and Communication Eng., University College of Engineering, Punjabi University, Patiala, India
Abstract: In this paper, the implementation and performance analysis by using various optical fibers in the SAC-OCDMA system for different data modulation formats is presented. The optical fiber is used in communication systems because of its characteristics which include small size, low loss and low interference from outside environment. The various types of optical fibers used in SAC-OCDMA system such as Corning Submarine, Corning TITAN, Corning LEAF and Alcatel 6900 have been compared using different data formats NRZ and RZ formats. It is found that NRZ has the best performance for all the optical fibers used in the system. After that, these fibers have been compared in terms of BER and received optical power. The simulation results revealed that Corning Submarine can provide a better BER as compared to other fibers on varying the input laser power and it suggests that Corning Submarine may be used for OCDMA systems.
Keywords: Spectral amplitude coding-optical code division multiple access (SAC-OCDMA), Bit error rate (BER), Multiple access interference (MAI), Return to zero (RZ), Non return to zero (NRZ)
Abstract: Image deblurring and restoration has been of great importance nowadays. Image recognition becomes difficult when it comes to blurred and poorly illuminated images and it is here image restoration come to picture. There have been many methods that were proposed in this regard and in this paper we will examine different methods and technologies discussed so far. The merits and demerits of different methods are discussed in this concern.
ANURAG SHARMA, ANKUSH KANSAL Student-ME, Electronics and Communication Department, Thapar University, Patiala, India Assistant Professor, Electronics and Communication Department, Thapar University, Patiala, India
Abstract: Today we want fast ways of communication, research on even more faster alternatives is going. In present time, 4th generation wireless communication standards is among one of such technologies. The building block of this technology is MIMO-OFDM system. But one of the drawback associated with OFDM is high PAPR. In this paper the PAPR of 8x8 MIMO OFDM system is simulated in Matlab and it is shown that it is better than PAPR of simple OFDM system. PAPR of 8x8 MIMO-OFDM system is reduced further by SLM technique.
