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.
NARESH CHANDRA AGARWAL, DEVENDRA KUMAR TRIPATHI, RAM RACKSHA TRIPATHI Associate Professor, Department of Electronics and Communication Engineering Shambhunath Institute of Engineering & Technology, Allahabad, India Deptt.of E&C University of Allahabad, India Deptt.of E&C University of Allahabad, India
MR. P.S.PRASAD, DR. AKHILESH UPADHYAY Research Scholar, CSE Department, Bhagwant University, Ajmer,Rajasthan. India Professor, Electronics & Communication Department, SIRT, Bhopal, India
TRILOK CHAND SHARMA, MANOJ JAIN Lecturer, Department Of Technical Education, Haryana, (M.Tech. Computer Science& Engg., Lingaya’s University Faridabad) Associate. Professor (Computer Sc. & Engg.), Lingaya’s University Faridabad
PREETI GAHARWAR, MR. SUNIL R. GUPTA Department of Electronics & Telecommunication, Rungta College of Engineering & Technology, Bhilai (C.G.), India
GOWTHAM GAJALA, NAGAVARAPU SATEESH Assistant Professor, Department of Information Technology, Kakatiya Institute of Technology & Science, Warangal, India Assistant Professor, Department of CSE & IT, Malla Reddy Institute of Technology, Secunderabad, India
MISS. ANUJA K. PANDE, PROF. A. B. DESHMUKH, PROF. M. D. TAMBAKHE ME (CSE) Amravati University, Amravati, Yavatmal, (MH), India CSE, Amravati University, Amravati, Yavatmal, (MH), India
TRUSHNA T. KHOSE PATIL, C.O.BANCHHOR Department Of Information Technology, SCOE, Pune,India Assistant Professor Department Of Information Technology, SCOE, Pune, India
SANJAY SAXENA, NEERAJ SHARMA, SHIRU SHARMA Research Scholar, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India Associate Professor, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India Assistant Professor, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India
KAVITHA KARUN A, ELIZABETH ISAAC M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
ELIZA GAIL MAXWELL, MINTU PHILIP M.Tech Student, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India
CHRISTY THOMAS, DHANYA S PANKAJ M. Tech Student, Department of Computer Science, Rajagiri School of Engineering & Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering & Technology, Kochi, India
BAPUSAHEB B. BHUSARE, DIPALI G. MOGAL Student, Dept. of Computer Science & Engineering, Govt. College of Engineering, Aurangabad (MH), India Student, Dept. of Computer Engineering, SSBT College of Engg. & Tech., North Maharashtra University, Jalgaon (MH), India
Dr. PARDEEP MITTAL, PREET INDER KAUR, HARDEEP KAUR Professer, Guru Kashi University, Talwandi Sabo, Punjab, India M. Phil (Research Scholars), Guru Kashi University, Talwandi Sabo, Punjab, India
S.RAGHUPATHI, N.MANIKANDA SRITHARAN Faculty Member (ECE / ENGG), IBRI College of Technology, IBRI, Sultanate of Oman PG Scholar, Shivani Institute of Technology, Trichy -9, Tamilnadu, India
A.SIVARAMAKRISHNAN, DR. M.KARNAN Assistant Professor, Department of Computer Application, Karunya University, India Professor and Head, Department of Computer Science and Engineering, Tamilnadu College of Engineering, India
R.SHANTHA SELVA KUMARI, J.GANGA DEVI Professor & Head Department of ECE, Mepco Schlenk Engineering College, Sivakasi, India PG Student, M.E. Communication Systems, Mepco Schlenk Engineering College, Sivakasi, India
KAMAL PRAKASH PANDEY, RAKESH KUMAR SINGH, ANIL KUMAR Associate Professor, Deptt. of ECE, SIET, Jhalwa, Allahabad, India Assistant Professor, Deptt. of ECE, SIET, Jhalwa, Allahabad, India Assistant Professor, Deptt. of ECE, SHIATS-DU, Allahabad, India
VISHAK.S.K, GEETHA RAMANI.J PG Scholar, Department of ECE, SNS College of Technology, Coimbatore Assistant Professor, Department of ECE, SNS College of Technology, Coimbatore
SWATI RAMTEKE, RAJESH DONGARE, KOMAL RAMTEKE Student, Department of Information Technology, VIIT, Pune, India Student, Department of Information Technology, MIT COE, Pune, India Assistant Professor, Department of Information Technology, Rajiv Gandhi College of Engineering and Research, Nagpur, India
SAGAR JOSHI, SARMAN HADIA PG student, Charotar University of Science & Technology, changa, India Sarman K Hadia (Associate Professor, Electronics & Communication Department, CSPIT, Changa, CHARUSAT)
ANJU.S, M.SARAVANAN PG Scholar, Department of ECE, SNS College of Technology, Coimbatore, India Assistant Professor, Department of ECE, SNS College of Technology, Coimbatore, India
PALLAVI MALL , A.G.RAO, H.P.SHUKLA NIELIT, Gorakhpur Centre Gorakhpur, India NIELIT, Gorakhpur Centre Gorakhpur, India NIELIT, Gorakhpur Centre Gorakhpur, India
A. DHANALAKSHMI, DR. B.SRINIVASAN Assistant Professor, PG & Research Department of Computer Science Associate Professor, PG & Research Department of Computer Science Gobi Arts & Science College (Autonomous), Gobichettipalayam – 638 453, Erode District, Tamil Nadu, India
C.ASHOK KUMAR, P.MUNEESHWARI, J.MANIKANDARAJA Assistant Professor, Associate Professor Department of IT, PSNA College of Engineering and Technology, Dindigul, Tamilnadu, India
YOGESH R. TAYADE PROF. S.M. BANSODE ME Scholar, Comp. Sci. & Engg. Government College of Engineering, Aurangabad, Maharashtra, India Asst. Prof. Dept. of Comp. Sci. & Engg. Government College of Engineering, Aurangabad, Maharashtra, India
J.GHAYATHRI, N.SURYA Professor, Computer Science Department, Kongu Arts and Science, Erode, India M.PHIL (CS), Kongu Arts and Science, Erode, India
SANDIP KANKAL, PROF. V. P. KSHIRSAGAR M.E. Student (CSE), HOD (Department of CSE) Government College of Engineering, Aurangabad, Maharashtra, India
LUBNA K, ROBIN CYRIAC M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
K.K.SURESHKUMAR, M.UMADEVI, DR. N.M.ELANGO Assistant Professor, Department of Computer Science (P.G), Kongu Arts and Science College, Erode, India Research Scholar, Department of Computer Science (P.G), Kongu Arts and Science College, Erode, India Professor and Head, Department of MCA, RMK Engineering College, Chennai, India
DR. A.B.BAGWAN, DEPTII CHAUDHARI, R.A.DESHMUKH HOD, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India ME IInd Year, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India Assistant Professor, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India
ANNU ANNA LAL , ANNA ALPHY M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
MEGHANA NAGORI, SHIVAJI MUTKULE, PRAFUL SONARKAR Asst. Professor, CSE, Government Engineering College, Aurangabad, India ME Student, CSE, Government Engineering College, Aurangabad, India
NEELU GANGWAR, VANDANA Assistant Professor, Computer Science, S.R.M.S.W.C.E.T., Bareilly, India Assistant Professor, Computer Science, S.R.M.S.W.C.E.T., Bareilly, India
D.GAYATHRI, DR. R.UMA RANI Assistant Professor, Dept. of Computer Science, Periyar University College of Arts and Science, Salem, India Associate Professor, Dept. of Computer Science, Sri Saradha College For Women, Salem, India
BOOPATHY.S, JAYANTHI.K PG Scholar, Department of ECE, SNS College of Technology, Coimbatore, India Associate Professor, Department of ECE, SNS College of Technology, Coimbatore, India
AMIT M.BAJARE, DR. A.S.ALVI Final Year Master of Engineering Dept of CSE, P R M I T & R Badnera, Amravati (MS), India Professor, Dept of Information Technology P R M I T & R Badnera, Amravati (MS), India
DIPAK MISRA, DINESH KUMAR MISRA, DR. S.P.TRIPATHI B.Tech (ECE), SENSE, VIT, University, Vellore, Tamilnadu, India PhD Research Scholar, COE, Teerthanker Mahaveer University, Moradabad, U. P., India Professor & Head, CSE Department, G.B.T. University, Lucknow, U.P., India
P.KAMALESWARI, G.SELVA KUMARI, R.RAJASEKAR, A.J,GOWTHAM KUMAR Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Student, Information Technology, SKP Engineering College, Tiruvannamalai, India
MR. SUNIL KUMAR PANDEY, PROF. RAJESH TIWARI Computer Science and Engineering Department, shri sankaracharya College of Engineering & Technology Bhilai. Csvtu Bhilai
ANJALI THAMPI K.G, L.M. NITHYA PG Scholar, IT Department, SNS College Of Technology, Coimbatore, India HOD, IT Department, SNS College Of Technology, Coimbatore, India
USHA TIWARI, KUSHAL SARIN JATIN SETHI, ANSHUMAN GUPTA, ISHAN MATHUR Assistant Professer, Galgotias college of Engg. & Tech, Greater Noida Students, Galgotias College Of Engg. And Tech. Greater Noida, India
V. JAIGANESH, S.MANGAYARKARASI, DR. P.SUMATHI Assistant Professor, Department of Computer Science, Dr. N.G.P Arts and Science College, Coimbatore Doctoral Research Scholar, Manonmaniam Sundaranar University, Tirunelveli, India M.Phil. Scholar, Department of Computer Science, Dr. N.G.P. Arts and Science College, Coimbatore, India Doctoral Research Supervisor, Assistant Professor, PG & Research Department of Computer Science, Government Arts College, Coimbatore, India
|
Abstract
On The Statistical Multiplexing of Optical Code Division Multiple Access
NARESH CHANDRA AGARWAL, DEVENDRA KUMAR TRIPATHI, RAM RACKSHA TRIPATHI Associate Professor, Department of Electronics and Communication Engineering Shambhunath Institute of Engineering & Technology, Allahabad, India Deptt.of E&C University of Allahabad, India Deptt.of E&C University of Allahabad, India
Abstract: The aim of this paper is to contribute to the understanding of teletraffic behavior in optical code division multiple access networks. It explains a model of traffic capacity and its sensitivity to various parameters. Analytical model for OCDMA with and without call admission control were analyzed. However they have some disadvantage by ignoring the stochastic variation in circuit activity. It begin with the analysis of circuit switched OCDMA where circuit carrying bursty data. The analysis is independent of the OCDMA implementation or spreading code. In it considering a voice system which employs a power control and a variable rate vocoder. An OCDMA network has been taken where each user operates and can randomly access the network without the need of synchronization with respect to other user. It is assumed the circuit activity as a random variable and a class of networks which having different class of circuit activity. This has been shown that the traffic capacity of an OCDMA network is improved when circuit activity is a random variable and a heterogeneous data network is taken.
Scheduling Policy and its Performance for the Embedded Real time System
MR. P.S.PRASAD, DR. AKHILESH UPADHYAY Research Scholar, CSE Department, Bhagwant University, Ajmer,Rajasthan. India Professor, Electronics & Communication Department, SIRT, Bhopal, India
Abstract: Real time performance analysis is critical during the design and integration of embedded software to guarantee that application time constraints will be met at run time. To select an appropriate operating system for an embedded system for a specific application, OS services needs to be analyzed. These OS services are identified by parameters to form Performance Metrics. From five performance parameters of real-time operating system, scheduling latency and interrupt latency are the fundamental constraints for improving real-time performance of Linux OS. This paper analyzed the scheduling policy in order to select right policy for the specific embedded application and also suggested the performance for advantage.
ABSTRACT: Plagiarism detection plays an important role in software security protection and license issues. Source- code plagiarism detection method can be classified as string-based, token-based, parse-tree-based and program- dependency-based. All of these approaches have certain limitations and can not meet the requirements when the source code is large and may produce false positives. But, parse-tree based detection improves the detection ability and efficiency. This paper describes method based source code detection, which detect the simple plagiarized code like exact match, near exact match and longest common sequence. And also proposes the agent based detection which will perform the detection automatically. Automatic plagiarism detection will be helpful for code clone detection in software industry.
PROF. VAISHNAVI.J.DESHMUKH, PROF. SAPNA.S.KAUSHIK Computer Engineering Dept, Amravati University, Yavatmal, India
Abstract: In the last decade, mobile ad hoc Networks (MANETs) have emerged as a major next generation wireless networking technology. However, MANETs are vulnerable to various attacks at all layers, including in particular the network layer. Early work in MANET research has mainly focused on developing an efficient routing mechanism in such a highly dynamic and resource- constrained network. At present, several efficient routing protocols have been proposed for MANET. Most of these protocols assume a trusted and cooperative environment. However, in the presence of malicious nodes, the networks are vulnerable to various kinds of attacks. In MANET, routing attacks are particularly serious. In this article, we investigate the state-of-the-art of security issues in MANET. In particular, we examine routing attacks, such as link spoofing and colluding misrelay attacks, as well as countermeasures against such attacks in existing MANET protocols.
Keywords: Ad hoc network, mobile, routing protocol, security, AODV, OLSR.
WEKA Approach for Comparative Study of Classification Algorithm
TRILOK CHAND SHARMA, MANOJ JAIN Lecturer, Department Of Technical Education, Haryana, (M.Tech. Computer Science& Engg., Lingaya’s University Faridabad) Associate. Professor (Computer Sc. & Engg.), Lingaya’s University Faridabad
Abstract: This paper discusses data mining techniques to process a dataset and identify the relevance of classification test data. Mining tools to solve large amounts of problems such as classification, clustering, association rule, neural networks, it is a open access tools directly communicates with each tool or called from java code to implement using this. In this paper we present machine learning data mining tool used for different analysis, Waikato Environment for Knowledge Analysis is introduced by university of New Zealand it has capacity to convert CSV file to Flat file. Our work shows the process of WEKA analysis of file converts and selection of attributes to be mined and comparison with Knowledge Extraction of Evolutionary Learning not only analysis the data mining classifications but also the genetic, evolutionary algorithms is the best efficient tool in learning. We have provided an evaluation based on applying these classification methods to our dataset and measuring the accuracy of test results.
Keywords: Data Mining Tools, Classification Algorithm, Machine Learning, WEKA.
PREETI GAHARWAR, MR. SUNIL R. GUPTA Department of Electronics & Telecommunication, Rungta College of Engineering & Technology, Bhilai (C.G.), India
Abstract: A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically forming a network topology without the use of any existing network infrastructure or centralized administration. MANET is a self configuring network and the topology of the network keeps on changing as the nodes move randomly and organize themselves in an arbitrarily manner. Mobile nodes communicate with each other using multihop wireless links. Each node in the network also acts as a router, forwarding data packets for other nodes. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. Due to higher mobility in nodes and dynamic infrastructure of MANETs, Routing is important issue in ad hoc networks. ‗In this paper three routing protocols AODV (Ad- Hoc on-Demand Distance Vector), DSDV (Destination Sequenced Distance-Vector) and DSR (Dynamic Source Routing) are compared‘. The metrics used for performance analysis are Packet Delivery Ratio, Average end-to-end Delay & Number of Packets Dropped.
Short Text Classification Using kNN Based on Distance Function
KHUSHBU KHAMAR Government Engineering College, Modasa
Abstract: In the present day circumstances nowadays, the scope of short text such as Twitter messages, blogs, chat massages, book and movie summaries, forum, news feeds, and customer review is increasing very drastically. These applications pose a tremendous challenge to the text classifications due to sparseness of the relevant data & lack of similarity between the words. Short text classification is nothing but a process of assigning various input short texts to one or more target categories based on its contents. Here we compared various algorithms such as Support Vector Machine, Naive Bayes, K-Nearest Neighbor, etc... . Based on this comparison I have selected knn for this. This paper includes various methods to reduce processing time and give good accuracy for testing instances.
Abstract: This Video inpainting is an important video enhancement technique used to facilitate the repair or editing of digital videos. In this paper, we propose a video inpainting algorithm for repairing damaged content in digitized video films, focusing on maintaining good spatiotemporal continuity. The proposed algorithm utilizes key techniques.
Keywords: Frame Processor, Extraction, Masking, AVI splitter
Multiple Routing Configurations for Fast IP Network Recovery
GOWTHAM GAJALA, NAGAVARAPU SATEESH Assistant Professor, Department of Information Technology, Kakatiya Institute of Technology & Science, Warangal, India Assistant Professor, Department of CSE & IT, Malla Reddy Institute of Technology, Secunderabad, India
Abstract: As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by- hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.
Keywords: Networking, Routing, Multiple routing, IP and Network traffic, communication system routing.
MISS. ANUJA K. PANDE, PROF. A. B. DESHMUKH, PROF. M. D. TAMBAKHE ME (CSE) Amravati University, Amravati, Yavatmal, (MH), India CSE, Amravati University, Amravati, Yavatmal, (MH), India
Abstract: In this paper a brief overview of electronic payment gateway is provided. This paper addresses the requirements for an electronic payment gateway from both the customers and the merchants' point of view. Most of the population doesn’t trust on the local existing online payment gateway because it is not very secure. Mostly people want to adopt electronic payment system as it has lots of advantages. They need such a gateway that fulfill their all requirements and provide security, privacy etc. On the basis of these requirements and the local infrastructure, we propose an electronic payment gateway for local environment.Electronic payment systems securely process such payments and can be implemented by merchants themselves on their own web servers or alternatively, they can be provided to merchants by third party e-payment service providers. This paper describes the mode of operation of a broad range of e-payment systems available today in order to provide a comparative evaluation of their advantages and disadvantages. The analysis is presented in terms of the features of each system and discusses the advantages and disadvantages to the customer, the merchant, the e-payment service provider and the financial institution.
Distributed Intrusion Detection System using mobile agent in LAN Environment
TRUSHNA T. KHOSE PATIL, C.O.BANCHHOR Department Of Information Technology, SCOE, Pune,India Assistant Professor Department Of Information Technology, SCOE, Pune, India
Abstract: In network intrusions, there may be multiple computing nodes that are attacked by intruders. The evidences of intrusions have to be gathered from all such attacked nodes. An intruder may move between multiple nodes in the network to conceal the origin of attack, or misuse some compromised hosts to launch the attack on other nodes. To detect such intrusion activities spread over the whole network, we present a new intrusion detection system (IDS) called Distributed Intrusion Detection using Mobile Agent In LAN Environment (DIDMALE).
Image Processing Tasks using Parallel Computing in Multi core Architecture and its Applications in Medical Imaging
SANJAY SAXENA, NEERAJ SHARMA, SHIRU SHARMA Research Scholar, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India Associate Professor, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India Assistant Professor, School of Biomedical Engineering, IIT (BHU), Varanasi, UP, India
Abstract: To find accurate & reliable result in image analysis, it is important that image is processed and analyzed using image processing suitable AI technique further at the same time it is highly desired that processing time must be minimum. Preprocessing of the image makes it more clear and visible, while parallelizing of the algorithm optimizes the speed at which the image is processed. This paper explores current multi-core architectures available in commercial processors in order to speed up the image processing tasks. Parallel Implementation of Many sequential algorithms of Image processing was examined and analyzed in test and achieved good result if all the recourses are efficiently used. Main objective of this paper is to design some parallel image processing algorithms like segmentation, noise reduction, features calculation, histogram equalization etc by using Multi Core architecture and comparative study with some sequential image processing algorithm. These parallel algorithms are able to work with different number of thread, so as to take all the benefits of the upcoming processors having any number of cores. As medical imaging refers to view the human body in order to diagnose, monitor and treatment planning. This paper also describes the application of parallel computing applied in different Medical Imaging techniques like CT, PET scans etc.
Effect of EBG Presence on Elliptical Patch Antenna
O.RANGARAO, M. GRACE PRISCILLA, D.N. BHUSHAN BABU, J. NAVEEN, T. VIJAY SUNDEEP, E. RAGHU Assistant Professor (ECE Dept, VIT, Vijayawada, India) Assistant Professor (ECE Dept, ALIET, Vijayawada, India) Project Student(ECE Dept,ALIET,Vijayawada,India) Project Student(ECE Dept,ANUCET,Gunturu, India)
Abstract: The Paper demonstrates the design and performance of Elliptical Patch antenna in presence of EBG structure at one of its sides and its performance is compared with conventional type under similar design conditions. Here the designed Elliptical Patch antenna have a major radius 4 and ratio 30. And EBG designed as single layer of one array of patches for EBG and having 0.5cm pillar height patch size of 2cm side length square shape patches with 0.2cm gap. Conventional antenna operated at a frequency of 2.6608GHz and In presence of EBG it works at 2.6683GHz Frequency. and the comparative analysis is illustrated in this paper.
Keywords: Energy Band gap Structure (EBG), Surface Wave Suppression, Radiation Enhancement, improved gain.
P. RAJATHI, S. JOTHILAKSHMI Dept of Computer Science and Engineering, Annamalai University, Annamalai Nagar, Chidambaram
Abstract: Sign language recognition is a very challenging research area. In this paper, a system to recognize static gestures representing Tamil words has been proposed. The recognition of human gestures and facial expressions in image sequences is an important and challenging problem that enables a host of human-computer interaction applications. In this work a new view for recognizing sign language has been proposed. Most researches on continuous sign language recognition were done with frames obtained by processing the videos with regular/equal interval. If a system developed is strong enough for processing the static gestures then it would be the finest system to process the frames obtained while processing the continuous gestures. This work contains three phases of work. First phase is preprocessing, in which the obtained images are processed through the steps like resize, gray conversion, filtering for reducing the distortion and Black and White conversion. Black and white image is taken purposely so that shape descriptors can be applied to extract the required features. Region-based analysis exploits both boundary and interior pixels of an object. Solidity, Perimeter, Convex area, Major axis length, Minor axis length, Eccentricity, Orientation are some of the shape descriptors used as features in this work. Proximal Support Vector Machine classifier has been considered for classification which provides a good result with less computation time for larger datasets. The features derived are used to train the binary classifier first, secondly the testing images has been introduced for classification. Since, we handled a binary classifier we performed a one-versus-all kind of classification. A The proposed Sign Language Recognition System is able to recognize images with 91% accuracy.
Keywords: Sign Language recognition, Shape Descriptors, Machine learning, Proximal Support Vector Machine
Near Perfect Reconstruction of Speech Signal Using Filter Bank Techniques
PRASHANT UPADHYAYA, REETU SINGH KAURAV, RASHI SHARMA, MINAKSHI DUBEY, PRAGYA GUPTA Assistant Professor, EC Department, SRSITS, Datia, Madhya Pradesh, India B.E (IVth), EC Department, SRSITS, Datia, Madhya Pradesh, India B.E (IVth), EC Department, SRSITS, Datia, Madhya Pradesh, India B.E (IVth), EC Department, SRSITS, Datia, Madhya Pradesh, India B.E (IVth), EC Department, SRSITS, Datia, Madhya Pradesh, India
Abstract: In this paper a near perfect reconstruction of speech signal algorithms are used for reconstructing the original signal based on subband filters. In today’s scenario application of voice signal has been predominate in the field of technology for security purpose or for controlling the device. This paper deals with the optimum design of filter bank for subband coding system. Also the study of perceptual speech quality is done so that the reconstructed signal should not be degraded below the desired MOS-scale.
Keywords: Subband, MOS, SBC, Analysis and Synthesis bank, SNR
Cogitative Analysis on K-Means Clustering Algorithm and its Variants
KAVITHA KARUN A, ELIZABETH ISAAC M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Rapid advancements in science and technology resulted in the accumulation of enormous amount data. This facilitated the need for new methods for extracting essential data from these huge bulks of data since the old method of query ing proved to be inadequate. As a result many data analysis methods came in to existence and Cluster analysis is one among them. Cluster analysis has found its application in almost all fields especially in Bioinformatics, Image processing, Pattern Recognition etc. Cluster analysis or clustering can be defined as the process of grouping up of data objects in to different sets. It is done in such a way that the objects in the same group exhibit similar properties. There are several clustering algorithms available. The most widely used and popular clustering algorithm is the k-means clustering algorithm. This paper focuses on a survey of k-means clustering algorithm and its variants.
Throughput Analysis of the Frequency Hopping Technique Against Malicious Node Attacks in Wireless Sensor Networks
ELIZA GAIL MAXWELL, MINTU PHILIP M.Tech Student, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Wireless Sensor Networks (WSN) is the recent concept in the networking field that consists of a large number of tiny nodes capable of sensing, processing and transmitting data. Most routing protocols are designed with the aim to decrease power consumption at the cost of security. The insecure nature of the wireless channels and the fact that packets can easily be tampered with, makes wireless sensor networks easily prone to internal and external attacks. Thus security is a major requirement to ensure the transmission and reception of reliable data in a WSN. Many of the standing routing algorithms developed for WSN’s are susceptible to attacks in hostile environments. An important security concern is the threat of a malicious node. The routing protocols at present presume the networks to be altruistic and incapable of dealing with the misbehavior of nodes. A malicious node can get unauthorized access to data if it comes within the frequency range at which the data is being transmitted in the network. This paper discusses how the concept of frequency/channel hopping is an efficient method to tackle the attacks from a malicious node by analyzing the throughput of the proposed AODV routing protocol using NS2.
Keywords: Wireless Sensor Network, Security, Malicious node, Frequency hopping
Performance Evaluation of Various Countermeasures for Grayhole Attack in Wireless Mesh Network
CHRISTY THOMAS, DHANYA S PANKAJ M. Tech Student, Department of Computer Science, Rajagiri School of Engineering & Technology, Kochi, India Asst. Professor, Department of Computer Science, Rajagiri School of Engineering & Technology, Kochi, India
Abstract: Wireless mesh networks (WMNs) have been advancing as a solution for large scale high speed internet access through their self configuring, low cost and scalability. But as compared to wired networks, WMNs are likely to suffer from different security attacks due to its open medium nature, dynamic topology and distributed architecture. A special case of Denial of service (DoS) is called selective forwarding attack or Grayhole attack. This paper compares various counter measures for Grayhole attack in WMNs. The counter measures include Watchdog, Byzantine-Resilient Secure Multicast Routing (BSMR) and channel aware detection (CAD). From the comparison study, it can be concluded that CAD have high packet delivery ratio than Watchdog and BSMR.
Optimized Clustering Technique for High Dimensional Dataset
BAPUSAHEB B. BHUSARE, DIPALI G. MOGAL Student, Dept. of Computer Science & Engineering, Govt. College of Engineering, Aurangabad (MH), India Student, Dept. of Computer Engineering, SSBT College of Engg. & Tech., North Maharashtra University, Jalgaon (MH), India
Abstract: In data mining domain, high-dimensional and correlated data sets are used frequently. Clustering approach is represented for the analysis of similarity between the information within the database of any dimension. In order to have an effective a similarity search on a high dimensional database where exists correlated data, have to improve or extend the conventional clustering methods with different approaches. The existing indexing approaches such as vector approximation has some drawbacks such as ignoring dependencies across dimensions. This results in sub optimality in results. Thus the objective of the system is to perform clustering with exact nearest neighbor search, less number of random Inputs and Outputs over several recently proposed indexes, low computational cost and scales well with dimensions and size of the data set by tightening the cluster-distance bounds, possibly by optimizing the clustering algorithm so as to optimize the cluster distance bounds using optimization techniques like Pillar algorithm. This paper includes a new mechanism for clustering the elements of high-resolution data in order to improve precision and reduce computation time. The system applies K-means clustering after optimized by Pillar Algorithm. The Pillar algorithm considers the pillars placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroids amongst the data distribution. This algorithm is able to optimize the K-means clustering in aspects of precision and computation time. It designates the initial centroids positions by calculating the accumulated distance metric between each data point and all previous centroids, and then selects data points which have the maximum distance as new initial centroids. This algorithm distributes all initial centroids according to the maximum accumulated distance metric.
Keywords: Multimedia database, Similarity Search, Clustering and KNN Search.
Implementation Of Government Education System Using Data Mining
Dr. PARDEEP MITTAL, PREET INDER KAUR, HARDEEP KAUR Professer, Guru Kashi University, Talwandi Sabo, Punjab, India M. Phil (Research Scholars), Guru Kashi University, Talwandi Sabo, Punjab, India
Abstract: Educational organizations are one of the important parts of our society and playing a vital role for growth and development of any nation. Education in India is provided by the public sector as well as the private sector, with control and funding coming from three levels: central, state, and local. Education has been given high priority by India’s central and state governments and continues to grow fast. Education access has been expanded by investment in education infrastructure and recruitment of teachers. In higher education too, the number of providers continues to rise rapidly. Private sector involvement is on the rise. While it helps expand education infrastructure, particularly in higher education, access has not always been assured and the availability of student loans for higher education needs to improve. In higher education the government has proposed reforms which have the potential to bring about much-needed improvements in regulatory effectiveness. Increasing the number of institutions subjected to quality assessments will be important for lifting standards across the higher education system, while reform of recruitment and promotion mechanisms could help attract and retain talent in academia. The Government Education has many merits & demerits at graduation and higher level of education. At basic level it is less required but for higher degrees like post graduation it is more required. But in today’s time Government education becomes the source of getting degrees instead of knowledge. This paper describes that for effective implementation of Government Education System.
Design and Analysis of Monopole Antenna with two layered EBGS at One side
J.DOONDI KUMAR, D.SUSHMA, J.TAGOOR BABU, S.MALLIKHARJUNA RAO, B.SANTHI KIRAN M.Tech student, Assistant Professor, ECE, LBRCE, Vijayawada, India B.Tech student, ECE, GMRIT, Rajam, India Assistant professor, ECE, ALIET, Vijayawada, India
Abstract: EBG structures are drawing lot of interest in electromagnetic and antenna research these are compact in size. So the idea to use this EBG structures in patch antennas is good and in this paper we illustrate the Two layered EBG usage on monopole antenna. This EBG are designed and analysed in many shapes for different purposes. This structures will manipulate the antenna parameters and alter them according to the designer to improve the conventional antenna parameters to reach the requirements of new technologies. The EBG have periodic metal plates on metal pin vias. The gap between the plates have capacitance and metal pin exhibits inductance these C and L together makes EBG’s as high impedance electromagnetic surfaces. This EBG presence will reduce the surface wave propagation and enhance the antenna general parameters.
Keywords: HIS, Surface wave, Rectangular Patch, Energy band gap structures.
A Comparative Analysis And An Implementation On The Pattern Generation Of A 3- Weighted And Adaptive Methods Of Pseudorandom Technique
S.RAGHUPATHI, N.MANIKANDA SRITHARAN Faculty Member (ECE / ENGG), IBRI College of Technology, IBRI, Sultanate of Oman PG Scholar, Shivani Institute of Technology, Trichy -9, Tamilnadu, India
Abstract: Fault detection in VLSI circuit plays vital role in implementation of a design. Widely used, pseudo random Built- in-Self-Test (BIST) is taken into account for this research paper. The store of pseudorandom generators includes, among others, linear feedback shift registers (LFSRs), cellular automata, and accumulators driven by a constant value. Categories of pseudorandom BIST, the 3- weighted pattern Test Generation (TG) and Adaptive pattern Test Generation (TG) were been analyzed with various factors such as design,security,efficiency,performance and accuracy to define the appropriate method for the required design. Both the methods are applied to Scan Based process accumulation, for the above said comparison for the proposed scheme. The ultimate aim is to find the Reduction in Hardware overhead and the consumed time. On thorough observation the design is implemented through Spartan-3 FPGA.
Keywords: Pseudorandom, 3 weighted, Adaptive Test Generation (TG), Process Accumulation.
A Novel Based Approach for Extraction of Brain Tumor in MRI Images Using Soft Computing Techniques
A.SIVARAMAKRISHNAN, DR. M.KARNAN Assistant Professor, Department of Computer Application, Karunya University, India Professor and Head, Department of Computer Science and Engineering, Tamilnadu College of Engineering, India
Abstract: Brain tumor diagnosis is a very crucial task. Magnetic resonance imaging (MRI) scan can be used to produce image of any part of the body and it provides an efficient and fast way for diagnosis of the brain tumor. In the Existing Method, K-nearest neighbor is used to classify subject as normal or abnormal image. In the Proposed method an efficient detection of brain tumor region from cerebral image is done using Fuzzy C-means clustering and histogram .The histogram equalization calculates the intensity values of the grey level images and decomposition of image are extracted using principle component analysis is used to reduce dimensionality of the wavelet co-efficient. The Fuzzy C-means clustering algorithm finds the centroids of the cluster groups together the Brain tumor patterns obtained from MRI images. Segmentation result shows the extract suspicious tumor region.
Patient Adaptable ECG Beat Classifier Using LDC and EMC Algorithms
R.SHANTHA SELVA KUMARI, J.GANGA DEVI Professor & Head Department of ECE, Mepco Schlenk Engineering College, Sivakasi, India PG Student, M.E. Communication Systems, Mepco Schlenk Engineering College, Sivakasi, India
Abstract: Electrocardiogram (ECG) waveforms are used to find both regular and irregular patterns in cardiac cycles of patients. In this work, the beats like normal, supraventricular and ventricular beats are identified and classified to the corresponding classes based on combining the decisions of both linear discriminant classifier (LDC) algorithm and Clustering algorithm. Classifications of beats are done by considering both R-R interval features and morphological descriptor features. First the Linear Discriminant Classifier is trained for the three different class and the training beats are taken from three different databases namely, MIT-BIH Arrhythmia, MIT-BIH Supraventricular and MIT-BIH ST Change. Expectation Maximization clustering algorithm (EM) forms patient specific clusters which is based on MOG (mixture of expert) model. Finally the beats in the cluster output is labeled & verified to corresponding classes with the aid of linear discriminant analysis function.
Control Of Spy Robot By Voice And Computer Commands
JAYESH CHOPADE, DATTATRAY BARMADE, SWAPNIL TONDE Department of Information Technology, Rajarshi Shahu College of Engineering, Pune-33
Abstract: − This paper proposed a method for controlling a spy robot either through voice commands or computer commands and also composed with camera. Study of human-robot communication is one of the most important research areas. The voice communication is significant in human robot interaction among various communication media. The voice commands are used to control the robot and visual feedback is used to provide the precision control to the robot. This robot is also build up with obstacle detection module that generates the signal as the obstacle detects. The proposed system is capable of positioning the robot at tedious work space as instructed through command to get the actual visual feedback. This proposed system is controlled either by voice commands or by computer commands as per user convenience.
Analysed Modulation Doped Fieled Effect Transister (MODFET) and Metal Oxide Semiconductor Modulation Doped Fieled Effect Transister ((MOS-MODFET)) using compound material silicon Germanium (SiGe)
KAMAL PRAKASH PANDEY, RAKESH KUMAR SINGH, ANIL KUMAR Associate Professor, Deptt. of ECE, SIET, Jhalwa, Allahabad, India Assistant Professor, Deptt. of ECE, SIET, Jhalwa, Allahabad, India Assistant Professor, Deptt. of ECE, SHIATS-DU, Allahabad, India
Abstract: In this paper SiGe material incorporated to design Modulation Doped Fieled Effect Transister (MODFET) and analysed theoretically. The SiGe is a compound semiconductor material and impurity material is P-type. The Gate length of MOS-MODFET is fabricated 0.1μm. The SiGe/Si Heterojunction grown by ultrahigh vacuum chemical vapor deposition technique. The performance of modulation-doped field effect transistor is a new approached to design FET with heterojunction field effect transistor (HBT). The performance of MOS-MODFET is also a good approached to design device as CMOS with the HBT. The characteristics shown is improved the speed and power consumption with BJT and MOSFET.
Keywords: Modulation doping , MODFET, MOS-MODFET, and Characteristics
Energy Efficient Routing in Wireless Sensor Networks
VISHAK.S.K, GEETHA RAMANI.J PG Scholar, Department of ECE, SNS College of Technology, Coimbatore Assistant Professor, Department of ECE, SNS College of Technology, Coimbatore
Abstract: The routing protocol Proposed for Wireless Sensor Network is hierarchical, homogenous and cluster based. After deployment of the Sensor Nodes entire sensor field in divided into different clusters and each cluster contains Sensor Nodes with different duties such as Gateway Node, Cluster Head Node and Ordinary Sensor Node. Majority of the computation intensive tasks are carried out in the Sink. Simulation works are done in NS2 tool. The performance of the proposed protocol has been compared with that of LEACH and results show better performance for the proposed protocol.
Keywords: Wireless Sensor Networks, Routing, Energy Efficiency
Intrusion Detection System for Cloud Network Using FC-ANN Algorithm
SWATI RAMTEKE, RAJESH DONGARE, KOMAL RAMTEKE Student, Department of Information Technology, VIIT, Pune, India Student, Department of Information Technology, MIT COE, Pune, India Assistant Professor, Department of Information Technology, Rajiv Gandhi College of Engineering and Research, Nagpur, India
Abstract: Due to increasing incidents of cyber attacks, building effective intrusion detection systems are essential for protecting information systems security, and till now it remains an elusive goal and a big challenge. We present the state-of-the-art of the evolution of intrusion detection systems and address some of the research challenges to design efficient and effective intrusion detection systems . In existing IDS system the rule sets of various attack patterns are stored in databases and the whole network traffic is matched against it to avoid any unauthorized and illegal activities. if any attack happens, and the pattern of that attack is not stored in IDS rule sets then that attack pattern is need to be manually updated in the database to prevent it next time. Hence we are proposing such a system in which there is no need to manually updating the attack pattern in IDS rule sets, the proposed FC-ANN algorithm will automatically capture the patterns of new attack and store it in IDS database which will reduces the human time as well as effort to learn new attacks pattern manually.
Design and Analysis for Low power CMOS Sram cell in 90nm technology using cadence tool
SAGAR JOSHI, SARMAN HADIA PG student, Charotar University of Science & Technology, changa, India Sarman K Hadia (Associate Professor, Electronics & Communication Department, CSPIT, Changa, CHARUSAT)
Abstract: CMOS RAM Cell is very less power consuming and has very less read and writes time. As the technology is improving channel length of MOSFET is scaling down. In this environment stability of SRAM becomes the major concern for future technology. A SRAM cell must meet requirements for operation in submicron/nano ranges. So we have to modify conventional 6T SRAM circuit with additional circuitry and different kind of parametric analysis can be done and functionality is verified using Cadence Design Environment for 90nm technology files.
High Performance DCT Implementation Using Reduced Complexity Wallace Multiplier and High Speed Carry Select Adder
ANJU.S, M.SARAVANAN PG Scholar, Department of ECE, SNS College of Technology, Coimbatore, India Assistant Professor, Department of ECE, SNS College of Technology, Coimbatore, India
Abstract: Discrete cosine Transform are widely used in video and image compression standards. This paper focuses on the implementation of Discrete Cosine Transform DCT) using reduced complexity Wallace multiplier and high speed carry select adder. Wallace Multipliers basically use full adders and half adders in their reduction phase. The number of partial product bits are not being reduced by the half adder. Therefore minimizing the number of half adders in the multiplier will reduce the complexity. In the modified Wallace tree number of half adders are reduced to 80 percent. Inorder to improve the speed a carry select adder with D Latch is being used in the final carry propagation path. The design entry is done in Verilog and simulated using ModelSim 6.1.
Comparison and Performance Analysis of Dynamic and Static Clustering Based Routing Scheme in Wireless Sensor Network
PRASHANT KRISHAN M.Tech, Dept. of Information Technology, DIT, Dehradun, Uttarakhand, India
Abstract: Wireless Sensor Networks have created new opportunities across the spectrum of human efforts including engineering design, forest fire tracking, and battlefield surveillance. Wireless Sensor Network is a group of sensor nodes that comprised of sensing, computing, and communication elements that gives an administrator the ability to observe and react to events and phenomena in a specified environment. Basically, sensor network have mainly two types of applications: monitoring and tracking. In monitoring, air pollution monitoring, traffic monitoring etc and in tracking, animal tracking in habitat consisted. When the sensor nodes are deployed to develop a wireless sensor network there must be routing of data to communicate with other nodes and conserve the battery power and increase the network lifetime. On the basis of network structure, Routing protocols are divided into three parts: flat, hierarchical and location aware. Hierarchical clustering based routing scheme can be further divided into parts: Dynamic and static. In Dynamic Clustering based routing scheme the cluster formed dynamically across the network lifetime and in static, once the cluster is formed it remain same throughout network lifetime. In this paper, the performance of Dynamic and static routing scheme is checked on the basis of various node distribution schemes like Random node distribution, Poisson distribution and Uniform distribution.
Keywords: Wireless Sensor Networks, Dynamic and Static Clustering Based Routing Scheme, Network-lifetime, Node distribution.
Novel Design of Four-Bit Reversible Numerical Comparator
PALLAVI MALL , A.G.RAO, H.P.SHUKLA NIELIT, Gorakhpur Centre Gorakhpur, India NIELIT, Gorakhpur Centre Gorakhpur, India NIELIT, Gorakhpur Centre Gorakhpur, India
Abstract: In this paper, a new four bit reversible comparator circuit has been designed and was found that the proposed design is better in terms of no. of garbage outputs, no. of reversible logic gates used and no. of constants inputs than previous design. Reversible Logic Technology is becoming a very popular technology in the field of Nano-
Design and Implementation of Biometrics Personal Security using 3D Face Expression
A. DHANALAKSHMI, DR. B.SRINIVASAN Assistant Professor, PG & Research Department of Computer Science Associate Professor, PG & Research Department of Computer Science Gobi Arts & Science College (Autonomous), Gobichettipalayam – 638 453, Erode District, Tamil Nadu, India
Abstract: Face appearance in support of biometric recognition has been conventional with researcher for many years. Face systems have successfully made the changeover from the research laboratory to the commercial zone. Biometric detection should make use of dimensions that are solely subject-intrinsic, avoiding integration of other contaminate inputs and the property of imaging system revolution as much as possible. Many investigate groups are ongoing to focus their hard work on 3D face recognition, which should yield further novel techniques and opportunities for principled assessment in the prospect. The performances of the present face recognition system undergo a great deal from the variation in lighting. To treaty with this problem, this paper presents an illumination normalization move toward by relighting 3D face images to a canonical Illumination based on the singing 3D face images representation. Advantage from the comments that human 3D faces share similar shape, and the albinos of the 3D face surfaces are quasi-constant, we first estimation the low-frequency components of the illumination from the input 3D facial image. In particular, a scheme for the identification of 3D faces with one type of expression and neutral faces was implemented and tested on a database. The 3D face biometric results proved the feasibility of this framework.
Keywords: Biometrics, Expression, Face, Intensity, Recognition and Registration
Performance Analysis & Behavioural Study of Proactive & Reactive Routing Protocols in MANET
DEEPAK KUMAR PATEL, RAKESH KUMAR, A.K. DANIEL Student M. Tech 2nd year, CSE Dept., M.M.M Engg. College, Gorakhpur, UP-273010, India Associate Professor, CSE Dept., M.M.M. Engg. College, Gorakhpur, UP-273010, India Associate Professor, CSE Dept., M.M.M. Engg. Collge, Gorakhpur, UP-273010, India
Abstract: A Mobile Ad-hoc Network (MANET) consists of a number of mobile wireless nodes, the communication between these mobile nodes is carried out without any centralized control. The set of applications for MANET‘s is diverse, ranging from small, static networks that are constrained by power sources, to large-scale, mobile, highly dynamic networks. The design of network routing for these networks is a complex issue. Irrespective of application, MANET‘s need efficient distributed algorithms to determine network organization, link scheduling, and routing. In this paper we discuss about simulation & comparison of the performance between two types of routing protocols, Table Driven (Proactive) and On-Demand (Reactive) using the NS-2 simulation tool. These routing protocols compared in terms of packets delivery ratio, average delay and speed.
Digital Crime Investigation using Various Logs and Fuzzy Rules: A Review
DEEPAK MEENA, HITESH GUPTA Research Scholar, CSE, Patel Institute of Technology, Bhopal HOD, CSE, Patel Institute of Technology, Bhopal
Abstract: Computer crime has increased a lot now days in the form of hacking. It may harms for the computer system as well as the human being. The computer crimes take place all over the world by any one. It is very hard to investigate such type of case in short span of time. In order to perform the digital forensic there is a need to use the multi-relation classification. Multi-relational data mining enables pattern mining from multiple tables. This paper is a review of digital forensic. It also gives some introduction related to log files. Here log file is an important factor to investigate the crime scene. This paper also summarized the fuzzy rules.
Keywords: Digital forensic, Cyber Crime, Log Files, Fuzzy Rules
Scalability of Multi-Timeslot Allocation Protocol for WSN
C.ASHOK KUMAR, P.MUNEESHWARI, J.MANIKANDARAJA Assistant Professor, Associate Professor Department of IT, PSNA College of Engineering and Technology, Dindigul, Tamilnadu, India
Abstract: In wireless sensors network applications like habitat monitoring large-scale industrial monitoring & urban population monitoring require years of operation period with low rate data transmission. Providing a reliable data transmission & efficiency in energy usage are critical in order to prolong the network period of time. Our technique solves the problem's that commonly occurred in Wireless Sensor Network (WSN) like idle listening, overhearing & hidden terminal problem. By introducing a Time slotting communication mechanism, wherever node only transmits in its own timeslot & sleep in different timeslot if there's no activity. Proposed approach alleviates transmission collisions by using virtual grids that adopt Latin squares characteristics to time interval assignments. Proposed algorithmic rule derives conflict-free time schedules without incurring global overhead in scheduling.
AMRUTHA S RAIBAGI, SURABHI ANAND B, SWETHA R Student, Department of Instrumentation Technology, R.V.College of Engineering, Bangalore, India
Abstract: Obstacle detection has been the topic of much research in the past and new ways for avoiding various types of obstacles in various surroundings have been experimented upon . But the focus has been mostly on obstacle avoidance by autonomous agents and that too was mostly limited to extruding obstacles. These tended to make the detection mechanism very system-specific and not much suitable for general purposes. In fact , even if the user has adequate control over a device , he/she may still benefit from such a detection mechanism. Now though much work has been done for detecting various sorts of protruding obstacles , depressed obstacle detection has been somewhat neglected. This project focuses on building an user-friendly device that specializes in detecting intrusions besides doing close range obstacle detection. Automobile safety can be improved by anticipating a crash before it occurs and thereby providing additional time to deploy safety technologies .Warnings can be like buzzer if the driver is approaching a pothole or any obstruction, driver may be warned in advanced regarding what the road entails. The project‟s ultimate aim thus finalized as, one to build a general, easy-to-use and versatile system that detect potholes, besides close objects , and give warning to the user accordingly.
Keywords: Complimentary Metal Oxide Semiconductor (CMOS), Microprocessor without Interlocked Pipeline Stages (MIPS), Permanent Magnet DC Motor (PMDC), Complex Instruction Set Computers (CISC), Universal Asynchronous Receiver Transmitter (UART).
An Efficient Face Recognition and Retrieval Using LBP and SIFT
YOGESH R. TAYADE PROF. S.M. BANSODE ME Scholar, Comp. Sci. & Engg. Government College of Engineering, Aurangabad, Maharashtra, India Asst. Prof. Dept. of Comp. Sci. & Engg. Government College of Engineering, Aurangabad, Maharashtra, India
Abstract: In this paper, we have proposed a method for face recognition and retrieval. In most of the cases various methods are unable to increase retrieval rate of face images especially LFW images, with the help of proposed system the retrieval rate drastically increased. In face recognition, inter class objects should have larger distance than intra class objects ideally. By extracting LBP & SIFT features of training images and arranging them in sparse representation; shape context and inner distance shape contexts methods are applied on test image for deriving relevant images with better performance.
Keywords: LFW, Inner distance and shape context,SIFT, LBP.
Projective Clustering Approach For The Detection Of Outlier And Non-Axis-Aligned Subspaces
J.GHAYATHRI, N.SURYA Professor, Computer Science Department, Kongu Arts and Science, Erode, India M.PHIL (CS), Kongu Arts and Science, Erode, India
Abstract: Clustering the case of non-axis-aligned subspaces and detection of outliers is a major challenge due to the curse of dimensionality. To solve this problem, the proposed implementation is extension to traditional clustering and finds subsets of the dimensions of a data space .In this project, a probability model is proposed to describe in hidden views and the detection of possible selection of relevant views. A projective clustering is proposed for Outlier Detection in High Dimensional Dataset that discovers the detection of possible outliers and non-axis–aligned subspaces in a data set and to build a robust initial condition for the clustering algorithm it improves the parameters in the connection between L∞ corsets and sensitivity that is made in Lemma and improve clustering in the case of non-axis-aligned subspaces and detection of outliers in datasets. The suitability of the proposal demonstrated is done with synthetic data set and some widely used real-world data set.
Keywords: Clustering, high dimensions, projective clustering, probability model.
A Modified Algorithm to Verify Integrity and Authentication of Data in Virtual Networks
SANDIP KANKAL, PROF. V. P. KSHIRSAGAR M.E. Student (CSE), HOD (Department of CSE) Government College of Engineering, Aurangabad, Maharashtra, India
Keywords: Network Virtualization, Virtual Network, VN embedding, MAC,HMAC etc.
A Study on Firewall Policy Anomaly Representation Techniques
LUBNA K, ROBIN CYRIAC M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: A firewall is a system that acts as an interface between private network and a public network. It implements the security policy based on the rules defined by the network administrator; which decides the packets can be allowed or blocked to the organization’s private network. Manual definition of rules often results in anomalies in the policy. Existing research on this problem have been focused on analysis and detection of firewall policy anomalies. This paper discusses about two major firewall policy anomaly representations that is policy tree representation and a rule-based segmentation mechanism which uses grid-based representation. This grid-based segmentation mechanism overcomes some limitations of policy tree representation.
Divisive Clustering method using Naive Bayes Algorithm for Text Categorization
K.K.SURESHKUMAR, M.UMADEVI, DR. N.M.ELANGO Assistant Professor, Department of Computer Science (P.G), Kongu Arts and Science College, Erode, India Research Scholar, Department of Computer Science (P.G), Kongu Arts and Science College, Erode, India Professor and Head, Department of MCA, RMK Engineering College, Chennai, India
Abstract: This research Divisive Clustering method using Naïve Bayes algorithm for text categorization has been developed to assigning an electronic document to one or more predefined categories or classes based on its textual context. In many information processing tasks, labels are usually expensive and the unlabeled data points are abundant. To reduce the cost on collecting labels, it is crucial to predict which unlabeled examples are the most informative, i.e., improve the classifier the most if they were labelled. Many active learning techniques have been proposed for text categorization, such as SVM Active and Transductive Experimental Design. However, most of previous approaches and researches are try to discover the discriminate structure of the data space, whereas the geometrical structure is not well respected. An agglomerative clustering algorithm has been implemented where the fixed M-dimensional static window has been replaced by a dynamic window scheme using Divisive Clustering Algorithm. Because of the independence assumption, the parameters for each attribute can be learned separately, and this greatly simplifies learning, especially when the number of attributes is large. The proposed scheme is experimented using Naive Bayes Algorithm with different data set to show its better effectiveness of text categorization in terms of minimum search time. The above mentioned algorithm has been implemented using Microsoft Visual Studio .NET 2008. The coding language used is C# .NET and the back end is MS SQL Server 2005.
Keywords: Text Mining, Automatic Text Categorization (ATC), Adaptive Active Learning Algorithm, Naïve Bayes Algorithm, Divisive Clustering Algorithm
A framework for Review Categorization using Appraisal words
DR. A.B.BAGWAN, DEPTII CHAUDHARI, R.A.DESHMUKH HOD, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India ME IInd Year, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India Assistant Professor, Department of Post Graduate Computer Engineering, JSPM’S RSCOE, Pune, India
Abstract: Due to the high increment in the usage of internet nowadays e-commerce is getting very popular. The online shopping is becoming more convenient and prominent. As well as the number of online consumer reviews are increasing very fast. It is a challenge for the organizations and consumers to go through these reviews for the decision making process. Mining the necessary information from these reviews is beneficial to consumers and organizations. Sentiment mining can be very helpful for customer relation management, marketing and identifying the opinion and popularity of the product. In this paper we present a novel framework for review classification using sentiment analysis. The framework uses appraisal words lexicon and product feature extraction for review categorization.
Keywords: Sentiment mining, Review mining, Text analysis, Review categorization, Appraisal words
A Variant Architecture Design for Intelligent Medical Search Engine (iMed)
ANNU ANNA LAL , ANNA ALPHY M.Tech Scholar, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India Asst. Professor, Dept of CSE, Rajagiri School of Engineering and Technology, Kochi, India
Abstract: Nowadays both ordinary internet users and doctors are increasingly using the web search engines for searching medical information. iMed is one of the intelligent medical search engines that use medical knowledge and questionnaire for searching. iMed introduces and extends expert system technology in to the search engine domain. This search engine uses many key techniques to improve its usability and search result quality. iMed provides a questionnaire based query interface to users. But it has some issues within its design. This paper is focused on certain issues raised during the detailed study on the search engine. In this an enhanced system design is also proposed. The recommended enhancements improve the working and efficiency of the medical search engine.
Keywords: iMed, content based image retrieval, Pattern Matching, medical knowledge
An Improved Greedy Geographic Routing in Large-Scale Sensor Networks for reduction of local minima problem
AMOL R.DHAKNE ME – Student, CSE, Government Engineering College, Aurangabad, India
Abstract: Geographic (or geometric) routing is known for routing messages in greedy manner. It means that the current node selects a neighbor node that is closest to the destination and forwards the message to it. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery of message due to the existence of local minima (or dead ends). If we want to overcome local minima then it is necessary for nodes to maintain extra nonlocal state or to use auxiliary mechanisms. we study, how to facilitate greedy forwarding by using a minimum amount of such nonlocal states in topologically complex networks. Specifically, we investigate the problem of decomposing a given network into a minimum number of greedily routable components (GRCs), where greedy routing is guaranteed to work. We consider an approximate version of the problem in a continuous domain, with a central concept called the greedily routable region (GRR). We study about GRR concerning its geometric properties and routing capability. We then develop simple approximate algorithms for the problem. Greedy approach presented in this paper performs well in terms of data integrity parameter i.e. number of packets lost is minimized and also time required for transfer of packets from source to destination is minimized in our greedy approach.
Keywords: Wireless sensor networks, geographic routing, Decomposition, local minima
Detecting Attack’s In Mobile Ad-Hoc Network Using Aodv Routing Protocol
PRAKASH D. NAIK, SHRIRAM DATAR, RAJU G. METKARI Student, Department of Computer Engineering, KJ College Of Engineering, Pune, India
Abstract: In mobile ad hoc networks the nodes have fully decentralized topology and they are dynamically changing. Due to the dynamic changing nature of participating nodes the vulnerabilities and wireless transmissions medium security is very hard to achieve. In this paper we propose an Intrusion and various attack‟s Detection Techniques and On Demand Routing for AD-HOC Networks based on a Novel Architecture. It uses intrusion detection techniques to detect active attacks that can perform against routing fabric of mobile ad hoc networks. The Intrusion Detection Technique and On Demand Routing for ADHOC Network system does not introduce any changes to the underlying routing protocol and operates as an intermediate component between the network traffic and routing protocol in the system. The system that we are going to developed and tested to operate in ADHOC on Demand Distance Vector Routing (AODV) enabled networks using the network simulator (ns-2). The proposed system has been designed to detect resource consumption attack, fabrication attack, packet dropping attack.
MEGHANA NAGORI, SHIVAJI MUTKULE, PRAFUL SONARKAR Asst. Professor, CSE, Government Engineering College, Aurangabad, India ME Student, CSE, Government Engineering College, Aurangabad, India
Abstract: Brain tumor patients are increasing day-to-day. This paper proposes a novel approach to extract metabolite values from graph. Metabolites like NAA, Creatine, Choline and Cr2 are used to detect the brain tumor. Cho/NAA ratio plays most important role in deciding the tumor type so weights are assigned to each metabolite while clustering. Clustering algorithms could able to achieve accuracy up to 86%. Proposed system is based on decision tree algorithms which are proven to be better against clustering algorithms. Proposed system stores the metabolite values in dataset instead of storing fMRI images so reduces the image processing tasks and memory requirements.
A New Approach for Scheduling Periodic Aggregation Queries in Wireless Sensor Network with Aggregation Delay
PRASAD C MAHAJAN ME Student, CSE, Government Engineering College, Aurangabad, India
Abstract: Real Time System is a system in which each task has to be completed within a time called as deadline of task. In Real Time System scheduling the task set is an important task. For this various scheduling algorithms had been proposed. Wireless Sensor Network (WSN) is one Real Time System. Many queries are there in WSN for which sensor nodes of network have to response to sink node. In this paper a new approach for scheduling periodic aggregation queries has been proposed i.e. Vp-Rate Monotonic Scheduling (Vp-RMS) using Rate Monotonic Scheduling (RMS) and α-PCD Scheduling algorithm. A node probability factor (Vp) is used to schedule the queries using RMS. This algorithms helps to meet the deadline constrain of all queries as well as helps to take an aggregation delay into account while scheduling the queries. The results of proposed algorithm are verified through simulation.
A Star-Polygon shape Network with High Maintainability
NEELU GANGWAR, VANDANA Assistant Professor, Computer Science, S.R.M.S.W.C.E.T., Bareilly, India Assistant Professor, Computer Science, S.R.M.S.W.C.E.T., Bareilly, India
Abstract: The satellite network, together with the traditional ground network, constitutes the Space–Ground Interconnection Network (SGIN), which can provide global coverage for communications and become an important developing trend of the next generation network. There are many factors and methods in network systems to discover and maintain the routes to the destinations in the wireless environment. A network with star shape architecture has many advantages in the network deployment, According to number of paths available in the network. In this paper we emphasis on the benefits of star shape architecture in path selection, security and manageability of data flow transmission. The star shape network uses the polygon concepts which can provide the better communication in data transferring.
A Prototype for Secure Digital Library Accessing System using Multimodal Biometric System
D.GAYATHRI, DR. R.UMA RANI Assistant Professor, Dept. of Computer Science, Periyar University College of Arts and Science, Salem, India Associate Professor, Dept. of Computer Science, Sri Saradha College For Women, Salem, India
Abstract: For some applications it is necessary that the user has to get authenticated himself either by using his password or any biometric features. No doubt that this gives protection against unauthorized entry in to the application or system. Secret information needs security in a multi user environment. Any automatically measurable, robust and distinctive physical characteristics or personal trait that can be used to identify an individual or verify the claimed identity of an individual, referred to as biometrics, has gained significant interest in the wake of heightened concerns about security and rapid advancements in networking, communication and mobility. Encryption alone is not sufficient in many cases. In this article we are providing a prototype for secure Digital Library accessing system with more than one Biometric features such as face and fingerprint.
Preventing Attacks from Eavesdropper Using HMAC Protocol in Wireless Sensor Networks
BOOPATHY.S, JAYANTHI.K PG Scholar, Department of ECE, SNS College of Technology, Coimbatore, India Associate Professor, Department of ECE, SNS College of Technology, Coimbatore, India
Abstract: A wireless sensor network (WSN) is composed of numerous small sensing devices with limited communication range. The sensors collect data from the environment and report them to the sinks. With the promising sensing and wireless technologies, sensor networks are expected to be widely deployed in a broad spectrum of civil and military applications. Location information of the sinks, the sensors, and the objects being tracked are very important in sensor networks. Protecting location privacy in sensor networks is crucial considering different kinds of attacks that may disrupt the normal function of the networks. To identify location privacy issues in sensor networks and computes lower bound on the communication overhead to resolve those issues in order to achieve higher level of privacy. The two techniques to provide location privacy to monitored objects (source-location privacy)— periodic collection and source simulation—and two techniques to provide location privacy to data sinks (sink-location privacy)— sink simulation and backbone flooding. These techniques provide trade-offs between privacy, communication cost, and latency. Through analysis and simulation, we demonstrate that the proposed techniques are efficient and effective for source and sink- location privacy in sensor networks.
Combine Simulation Environments for Dynamic Communication Network
AMIT M.BAJARE, DR. A.S.ALVI Final Year Master of Engineering Dept of CSE, P R M I T & R Badnera, Amravati (MS), India Professor, Dept of Information Technology P R M I T & R Badnera, Amravati (MS), India
Abstract: Simulators are popular in nearly every field of engineering, like vehicle dynamics, network communication, and electronics. When it comes to simulate the behaviour of an intelligent system (IS), these fields suddenly overlap which calls for a combined simulation environment, where sensing, electronics and communication need to be simulated. Due to the fact that a future IS most likely uses wireless communication, this communication becomes the backbone of the intelligent system (IS). Then Realistic simulation is a necessary tool for the proper evaluation of newly developed protocols for Vehicular Ad Hoc Networks (VANETs). Modifying the structure of Network Simulator ns-3 and opportunity of interconnection with external application within the limits of combined simulation environment creating. To show the way how too softly change simulator to the specific goal. The second objective for the project is to check the TCP performances. These evaluations must take road traffic details and conditions, wireless communication characteristics and drivers’ behaviour into consideration. In particular, the performance evaluation of research on vehicular networks depends mainly on simulations. This work is dedicated to modifying the structure of ns-3 network simulator in order to enable interactions with simulator of dynamic models SIMULINK / MATLAB.
Keywords: NS3, Intelligent System (IS), Ad hoc Network, Sensor Network, Vehicular Networks.
MS. AISHWARYA POTDAR, MS. RUTUJA PHALKE, MS. MONICA ADSUL, MS.PRACHI GHOLAP B.E, Department of Computer Engineering, KJCOEMR, Pune University, Pune, India
Abstract: In the field of business, the owner of any organisation, company or business firm having some crucial data may need to share it with third-parties. These trusted third-parties may use this data for their own benefit causing reputational and monetary damage to the owner’s company. If some of the shared data is discovered at some illegal place, it is quite possible that one or more third party agent is responsible for such information leakage. The owner must identify the leakage at the earliest and possibly the source of leakage. Data leakage is a silent type of threat. This sensitive data can be electronically transferred via e-mail, Web sites, FTP, instant messaging, spreadsheets, databases, and any other electronic means available – all without knowledge of the owner. Data allocation strategies (across the agents) are proposed that improve the probability of identifying leakages.
Shifted Elliptical Slot In Microstrip Patch Antenna For Increasing Bandwidth And Gain
RIDHI GUPTA, SANJAY GURJAR
Abstract: This paper describes the increment in Bandwidth and Gain of Rectangular Microstrip Patch antenna with Shifted Elliptical slot. First we have designed a Rectangular microstrip patch antenna. After that an elliptical slot is cut inside a rectangular patch which is shifted towards right. The results of both the designs are compared and it was found that an increase in the bandwidth of 21% and gain of 7.21 dBi is being achieved as that of a simple Rectangular microstrip patch antenna. Microstrip patch antenna is designed on a Duroid 5880 substrate with a dielectric constant of 2.2. The antenna is fed by a coaxial probe feed. The antenna designs and performances are analyzed using Zealand IE3D software. The antenna can be used for many modern communication systems.
Satellite Communication Advancement, Issues, Challenges and Applications
DIPAK MISRA, DINESH KUMAR MISRA, DR. S.P.TRIPATHI B.Tech (ECE), SENSE, VIT, University, Vellore, Tamilnadu, India PhD Research Scholar, COE, Teerthanker Mahaveer University, Moradabad, U. P., India Professor & Head, CSE Department, G.B.T. University, Lucknow, U.P., India
Abstract: Communication in the whole of the World is revolutionized with the advent of Satellites. Satellite Communication has served mankind in many ways e.g. to predict weather, storm warning, provide wide range of communication services in the field of relaying television programs, digital data for a multitudes of business services and most recent in telephony and mobile communication. It may not surprise world community, if satellite communication links may be used for voice and fax transmission to Aircraft on International routes in near future. GPS Navigation, Global telephony, Multimedia video and internet connectivity, Earth Imaging through Remote sensing satellites for resource monitoring, Telemedicine, Tele-education services etc. are other feathers in Satellite communication applications. Satellite communication system has entered transition from point-to-point high cost, high capacity trunks communication to multipoint -to-multipoint communication with low cost. Satellite Communication has moved in many steps ahead like frequency reuse, interconnecting many ground terminals spread over the world, concept of multiple spot beam communications, Laser beam based communication through satellites and use of networks of small satellites in low earth orbit. In this paper satellite communication advancement, different application aspect present and future is discussed. Satellite communication has many application and market if we can pool our resources, come up with innovative and low cost solutions for world community.
Keywords: Satellites, GPS Navigation, Remote Sensing, Telemedicine, Frequency reuse, Networks of satellites.
SEEMA KEDAR, SNEHA DHAWALE, WANKHADE VAIBHAV Pavan Kadam, Siddharth Wani, Pavan Ingale HOD, Information Technology Department, Pune. India Student, Information Technology Department, Pune. India
Abstract: There is a tremendous increase in the research of data mining. Data mining is the process of extraction of data from large database. One of the most important topics in research community is Privacy preserving data mining (PPDM). It is essential to maintain a ratio between privacy protection and knowledge discovery. The goal is to hide sensitive item sets so that the adviser cannot extract the modified database. To solve such problems there are some algorithms presented by various authors worldwide. The primary goal of this survey paper is to understand the existing privacy preserving data mining techniques and to achieve efficiency.
Keywords: Privacy Preserving, Utility Mining, Sanitization, Data Mining
Robotics for a heart operation and new trends in Cardiorobotics (SNAKE ROBOT)
P.KAMALESWARI, G.SELVA KUMARI, R.RAJASEKAR, A.J,GOWTHAM KUMAR Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Assistant Professor, Information Technology, SKP Engineering College, Tiruvannamalai, India Student, Information Technology, SKP Engineering College, Tiruvannamalai, India
Abstract: This paper considers the new functionality added to a snake robot which is for heart surgery. Normally snake robots are used for inspection, search, rescue and reconnaissance missions. Here we have conceived a new dimension to it – „Instead of completely opening up your rib cage for a heart operation, what would you say about a smaller incision and letting a snake do it‟. The concept of heart surgery mainly requires the robot has 102 joints, a camera in the head, and can slither around your organs with amazing precision . While we‟ve spent a lot of time writing about humanoid robots, doggy packmule robots, autonomous quadcopter robots, and even the science of falling in love with robots, medical robots are possibly the most important sphere of robotics. Scientists and doctors are already using the creeping metallic tools to perform surgery on hearts, prostate cancer, and other diseased organs. The snakebots carry tiny cameras, scissors and forceps, and even more advanced sensors are in the works. It's like the ability to have little hands inside the patients, as if the surgeon had been shrunken, and was working on the heart valve.
The Efficient load balancing in the parallel Computer
MR. SUNIL KUMAR PANDEY, PROF. RAJESH TIWARI Computer Science and Engineering Department, shri sankaracharya College of Engineering & Technology Bhilai. Csvtu Bhilai
Abstract: Recently Cpu workload hardware Technology and multiprocessor Service are developing rapidly. Mathematically computation must be completed within a certain time period .Through the mathematical Analysis our Study Identify various useful result that should be interest in system designer .If all the parallel computer are not same type means not same configuration then proper load balance not occur so some computer finish their work earlier than other and sit ideal which degrade the performance of multicomputer system. .we introduce new Algorithm for program development on multicomputer environment called ODDA (optimize data distribution algorithm) to address the proper load balancing purpose . This algorithm work in the master slave modal. The main processor called the master processor which dynamically assign the workload to the remaining cooperative slave processor in run time environment. The efficient parallel computer has 3 element - collection of device , a Network connect to these computer and s/w that enable used to share data between them. MPI and PVM is the best Software used for message passing interfacing computation between them. Multiprocessor computation is the best way of resource handling and scheduling strategy . This paper contain Dynamic approach load balancing for process migration using process level environment employed parallel programs.
Keywords: Master processor , slave processor , Data distribution , Task manager , MPI, heterogeneous platform .
NISHANT NILAY, ROHIT P.NASHINE, SHANTANU SHRIVASTAVA, YOGESH GOLHAR Yeshwantrao Chavan College of Engineering, Nagpur, India
Abstract: Spy Monitoring Server is used to monitor and control the client machines in the network. It allows the administrator to view the systems connected to the LAN. The system information contains OS name and version, Processor details. It is capable of storing login details of the user. It can also monitor the data send by the user.It can share the desktop screen of the users also. The project ―Spy Monitoring Server‖ is an application which needs to be installed in the server. The computers are connected by a LAN. The computers are recognized either by their computer names or by their IP address.
An Efficient ID-Based Scheme For Filtering Gang Injected False Data In Wireless Sensor Networks
ANJALI THAMPI K.G, L.M. NITHYA PG Scholar, IT Department, SNS College Of Technology, Coimbatore, India HOD, IT Department, SNS College Of Technology, Coimbatore, India
Abstract: Wireless sensor networks are usually deployed at aggressive environments which are more vulnerable to various security attacks such as selective forwarding, wormholes and sybil attacks. In such network user authentication is essential in any service- oriented communication network in order to identify and reject any access request of an unauthorized user. This project of wireless sensor networks focus on injecting false data attack and their mitigation techniques. For an injecting false data attack, an attacker node first compromises the sensor nodes and then accesses all keying materials stored in the compromised nodes and then controls these compromised nodes to inject bogus information and send the false data to the sink to cause upper-level error decision as well as energy depletion in en-route nodes. Therefore filtering false data should also be executed as early as possible to mitigate the energy consumption. To tackle this challenging issue false data filtering mechanisms known as novel bandwidth-efficient cooperative authentication (BECAN) scheme is developed for filtering injected false data in wireless sensor networks. Although it identifies false data attack it cannot prevent gang injecting false data attack from mobile compromised sensor nodes. To enhance the efficiency of verification, a new ID-based signature scheme is proposed that allows batch verification of multiple signatures to mitigate gang injection of false attack threat. It allows any pair of users to communicate securely and to verify each other's signatures without exchanging public key certificates.
Automatic Detection Of Brain Tumor Through Magnetic Resonance Image
Dr. N.NandhaGopal, Assistant Professor, Sri Ganesh College of Engineering, Salem, India
Abstract: Magnetic Resonance Imaging (MRI) plays an important role in Brain Tumor diagnisation in advanced stages. It is a form of medical imaging using nuclear magnetic resonance of protons in the body. Segmentation process to extract suspicious region from complex medical images is very important. Brain image segmentation is a complex and challenging part in the Medical Image Processing.This research deals with new approaches for brain Tumor detection using Meta Heuristic Algorithm. It aims to develop and effective algorithm for the segmentation of Brain MRI images.Pre-processing, Enhancement and Segmentation are deeply analyzed in this work. In the Pre- processing system film artifacts and unwanted portions of MRI brain image are removed. In the Enhancement process the noise and high frequency components are removed using median filters.The Segmentation process it has three different approaches like block based (non algorithmic), PSO and HPACO algorithm segmentation. MRI helps to diagnose accurate condition of the Brain Tumor and to give necessary proper treatment.
Using Genetic Algorithms Reduction of Rectangular Microstrip Patches
RIDHI GUPTA, SANJAY GURJAR, ASHISH KUMAR Electronics & Communication Engg
Abstract: This paper presents a new procedure for the miniaturization of rectangular microstrip patches based on genetic algorithms. The shape of a typical rectangular patch is modified in order to reduce its resonance frequency keeping the physical volume of the antenna constant. As an example, the resonance frequency of a square microstrip patch is reduced from 3 to 1.8 GHz. The patch is divided in 9 X 9 square cells. The genetic algorithm optimization procedure is subsequently used to remove some of the metallic cells. Good agreement is obtained in theoretical results.
USHA TIWARI, KUSHAL SARIN JATIN SETHI, ANSHUMAN GUPTA, ISHAN MATHUR Assistant Professer, Galgotias college of Engg. & Tech, Greater Noida Students, Galgotias College Of Engg. And Tech. Greater Noida, India
Abstract: Over the past two decades, the automotive industry has aggressively researched ways to exploit modern computing and electronic advances in the development of safety, reliability, and entertainment technologies for vehicle. Now in this paper we will review about the sensors that are being used. Temperature sensor is used for detecting overheating in the engine.IR sensor is used to detect any obstacle and helps in the parking of the vehicle.LDR are used for signaling the high and low beam to the other . Advanced technology is used in the headlights as it can rotate in the direction of the steering accordingly.Automatic wiper is there with wiring at the top of the car that senses any liquid falling on it and the wiper will start working automatically.
Efficient Information Retrieval for Ambiguous Words
REKHA JAIN, SULOCHANA NATHAWAT, RUPAL BHARGAVA, G.N. PUROHIT Department of Computer Science, Banasthali University, Jaipur, Rajasthan, India
Abstract: Information Retrieval is the task of representing, storing, organizing and offering access to information items. To retrieve required information from Word Wide Web, search engines performs number of activities. When user enters the query on to the interface of search engine he/she can get irrelevant documents if the search term contains ambiguous keywords. On web there exist numbers of ranking algorithm to retrieve relevant information. Most popular search engine Google uses Page Rank algorithm to retrieve the results. The results are arranged from higher to lower page rank values. This paper proposes an algorithm for efficient retrieval of information on the Web. It helps in word sense disambiguation and improves the performance of system. To prove the efficiency of our proposed algorithm we have applied two measures Mean Reciprocal Rank and Mean Average Precision.
Keywords: Ambiguity, Word Sense Disambiguation (WSD), Information Retrieval (IR), Web Mining, Data Mining.
Intrusion Detection Systems: A Survey and Analysis of Classification Techniques
V. JAIGANESH, S.MANGAYARKARASI, DR. P.SUMATHI Assistant Professor, Department of Computer Science, Dr. N.G.P Arts and Science College, Coimbatore Doctoral Research Scholar, Manonmaniam Sundaranar University, Tirunelveli, India M.Phil. Scholar, Department of Computer Science, Dr. N.G.P. Arts and Science College, Coimbatore, India Doctoral Research Supervisor, Assistant Professor, PG & Research Department of Computer Science, Government Arts College, Coimbatore, India
Abstract: Today it is very important to provide a high level security to protect highly sensitive and private information. Intrusion Detection System is an essential technology in Network Security. Nowadays researchers have interested on intrusion detection system using Data mining techniques as an artful skill. IDS is a software or hardware device that deals with attacks by collecting information from a variety of system and network sources, then analyzing symptoms of security problems. This paper includes an overview of intrusion detection systems and introduces the reader to some fundamental concepts of IDS methodology. We also discuss the primary intrusion detection techniques. In this paper, we emphasizes data mining algorithms to implement IDS such as Support Vector Machine, Kernelized support vector machine, Extreme Learning Machine and Kernelized Extreme Learning Machine.
Keywords: SVM, KELM, Intrusion Detection System, Data Mining and IDS, ELM, Classification Techniques for IDS, KSVM
