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.
DIVYA TL, VIJAYALAKSHMI M.N Assistant Professor, Dept.Of MCA, R.V. College of Engineering, Bangalore, India Associate Professor, Dept.Of MCA, R.V. College of Engineering, Bangalore, India
PROF. RAJESH K. AHIR Assistant Professor, Department of Computer Engineering, G. H. Patel College of Engineering & Technology, Vallabh Vidyanagar, Anand, Gujarat
S.THIRAVIYA REGINA RAJAM AND S.BRITTO RAMESH KUMAR Research Scholar, St. Joseph's College (Autonomous), Tiruchirappalli Asst. Professor in Computer Science, St. Joseph's College (Autonomous), Tiruchirappalli
MR.RAJESH K. AHIR, MS. MITAL B. AHIR Assistant Professor, Department of Computer Engineering, G. H. Patel College of Eng & Technology, Anand, Gujarat M.E. Students, Department of Computer Engineering, Ipcowala Institute of Eng & Technology, Dharmaj, Gujarat
AKHIL VAID, RANDHIR SINGH, PARVEEN LEHANA M. Tech, Department of ECE, Sri Sai College of Engineering and Technology, Pathankot, India HOD, Department of ECE, Sri Sai College of Engineering and Technology, Pathankot, India Associate Professor, Department of Physics and Electronics, University of Jammu, India
TAMILSELVAN, KOMATHY SUBRAMANIAN, RAJESWARI RAJENDIRAN Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India
SHIKHA V. GADODIYA, MANOJ B. CHANDAK M.Tech Student, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Professor, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
ANU S, DR.UMARANI R Department Of Computer Science, Periyar University College Of Arts & Science, Mettur Dam, Tamilnadu, India Department Of Computer Science, Sri Saradha College For Women, Salem, Tamilnadu, India
MOHAMMED ABDUL KHALEEL, SATEESH KUMAR PRADHAN, G.N.DASH, F. A. MAZARBHUIYA Research Scholar, Sambalpur University, India Post Graduate Department of Computer Science, Utkal University, India Post Graduate Department of Physics, Sambalpur University, India Albaha University, Albaha, KSA
MS.PUNAM MARBATE, MS.REETU GUPTA Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering & Research, Nagpur, India Department of Computer Science & Engineering, Priyadarshani Indira Gandhi College of Engineering, Nagpur, India
N. V. PARDAKHE, PROF. R. R. KEOLE Department of Computer Science and Engineering H.V.P.M's college of Engineering and Technology, Amravati University, India
MANPREET SINGH, KARAMJIT KAUR Student, University College of Engineering, Punjabi University, Patiala, India Assistant Professor, University College of Engineering, Punjabi University, Patiala, India
HASSAN BADRY MOHAMED A. EL-OWNY Department of Mathematics, Faculty of Science, Aswan University, 81528 Aswan, Egypt Computer Science Department, Taif University, 21974 Taif, KSA
SHAIK SHAFEE, B.ANURADHA Research Student, Department of ECE, SV University College of Engineering, Tirupati, India Professor, Department of ECE, SV University College of Engineering, Tirupati, India
PROF. S. M. TIDKE, RUCHA RAVINDRA GALGALI Assistant Professor, Computer Science and Engineering, Shreeyash Engineering college, Aurangabad, India Student, Computer Science and Engineering, Shreeyash Engineering college, Aurangabad, India
B.SURIBABU NAICK, DR. P.RAJESH KUMAR Assistant Professor, Dept of ECE, GITAM University, Visakhapatnam, India Associate Professor, Dept of ECE, Andhra University, Visakhapatnam, India
MRS. K.RAJASRI, R.ANUDEEPARANI, R.PREMA, R.VASUGI Senior Assistant Professor, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India
DEJEE SINGH, MR. R.K.SAHU ME Scholar, Department of ET&T, Chhatrapati Shivaji Institute of Technology, Durg, India Associate Professor, Department of ET&T, Chhatrapati Shivaji Institute of Technology, Durg, India
M.RAVIKANTH, G.LOSHMA Final M.Tech, Dept. Of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor & Head, Dept. of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
RAJESH GEORGE RAJAN, V.JEYAKRISHNAN M.Tech. Student, Dept of Computer Science, Karunya University, Coimbatore, India Assistant Professor, Dept of Computer Science, Karunya University, Coimbatore, India
B.B.GITE, HARIHARAN SWAMINATHAN, DIPALI KALAMBE, DEEPTI PAWAR, JYOTI SARODE Assistant Professor, Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engin
N.A.V. KUMAR, G.A. RAO Department of ECE, Avanthi Institute of Engineering & Technology, Visakhapatnam, India Department of ECE, Avanthi Institute of Engineering & Technology, Visakhapatnam, India
TANUJA ARJA, NARASIMHA REDDY BATHALA, MADHUSUDHANA RAO.ADIGARLA Student (M.Tech), VLSI(SD), Department of ECE, Avanthi Institute of Engineering &Technology Asst.Professor, Department of ECE, Avanthi Institute of Engineering &Technology
MS. SAMPADA D.SAMUDRA, MRS. SHILPA P.GAIKWAD M.Tech. Student, Dept. of Electronics, College of Engineering, Bharti Vidyapeeth Deemed University, Pune, India Professor, Dept. of Electronics, College of Engineering, Bharti Vidyapeeth Deemed University, Pune, India
HEENA PATEL, MITUL PATEL, TARUN LAD M Tech- ECE (pursuing), Uka Tarsadia University, Bardoli, India Assistant Professor, Electrical Department, FETR, Bardoli, India Assistant Professor, Department of Electronics & Communication, Uka Tarsadia University Bardoli, India
M DHARMALINGAM, R AMALRAJ Ph.D Research Scholar, Department of Computer Science, Bharathiar University, Coimabatore, India Associate Professor Department of Computer Science, Bharathiar University, Coimabatore, India
RAVICHANDRA M, KIRAN GOWDA H N, UDAYA KUMAR C A Assistant Professor, Department of Information Science & Engineering, Acharya Institute of Technology Bangalore, Karnataka, India Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, Karnataka, India Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, Karnataka, India
RAVICHANDRA M, KIRAN GOWDA H N, UDAYA KUMAR C A Assistant Professor, Department of Information Science and Engg., Acharya Institute of Technology Bangalore, Karnataka, India PG Student, Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, India PG Student, Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, India
ABHISHEK FULMARI, MANOJ B. CHANDAK Student M.Tech, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Professor, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
ASHISH LONARE, SHWETA V.JAIN Student Mtech, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Assistant Professor, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
C.SUDARSANA REDDY, Dr. V.VASU, S.AQUTER BABU Department of Computer Science and Engineering, S.V. University College of Engineering, S.V. University, Tirupati, Andhra Pradesh, India Department of Mathematics, S.V. University, Tirupati, (A.P), India Assistant Professor of Computer Science, Department of Computer Science, Dravidian University, Kuppam -517425, Chittoor District, Andhra Pradesh, India
K.SREEDHAR REDDY, DR. K.RAMA LINGA REDDY Department of Electronics and Communication Engineering, VITS, Karimnagar, India Professor & Head of the Department in Electronics and Telematics (ETM), GNITS, Hyderabad, India
K.GAYATHRI, P.UMAMAHESWARI, P.SENTHILKUMAR Assistant Professor,Anna University, Tamilnadu, India Assistant Professor, Adama Science and Technology University, Ethiopia, East Africa
HIMANSHU RAINA, RANDHIR SINGH, PARVEEN LEHANA M.Tech, Department ECE, Shri Sai College of Engineering and Technology, Pathankot, India HOD, Dept ECE, Shri Sai College of Engineering and Technology, Pathankot, India Associate Professor, Dept of Physics and Electronics, University of Jammu, India
ABIDHA T.E., PAUL P.MATHAI, DIVYA MICHAEL Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi University, Kottayam, India Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi University, Kottayam, India Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi Uni
A.SEETHAI, 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
SOMAYAJI SIVA RAMA KRISHNAN, KARTHIK BALASUBRAMANIAN, SHRUTHI REDDY MUDIREDDY School of Information Technology and Engineering, VIT University, Vellore, India School of Electrical Engineering, VIT University, Vellore, India School of Computer Science and Engineering, VIT University, Vellore, India
ABHILASH C S, ABHISHEK VARSHNEY, DILIP S, NAVIK YOGESH LALJIBHAI, PRADYOT H ADAVI M.Tech student, Department of Networking and Communication, I.I.I.T.B., Bangalore, India M.Tech student, Department of Computer Science, I.I.I.T.B., Bangalore, India M.Tech student, Department of Embedded Systems, I.I.I.T.B., Bangalore, India
PIYUSH.V.GATTANI, DR.C.S.WARNEKAR M Tech Scholar, Department of Computer Science, RCOEM, Nagpur, India Sr. Professor, Department of Computer Science, JIT, Nagpur, India
ARUN K. SAURABH, SUNIL KUMAR, D. K. SRIVASTAVA M.Tech Student, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India M.Tech Student, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India Associate Professor, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India
MR. MUKTESH P. SHAH, PROF. SHOBHIT K. PATEL, PROF. MAYANK A. ARDESHANA, MR. JIGAR M. PATEL G. H. Patel College of Engineering and Technology, V.V.Nagar, Gujarat, India Charotar University of Science and Technology, Changa, Gujarat, India Bhailalbhai & Bhikhabhai Institute of Technology, V.V.Nagar, Gujarat, India
BASANTI B. SAWANT, M.TALIB, SAGAR S.JONDHALE, PRADEEP M. PATIL Ph.D student, North Maharashtra University, Jalgaon, Maharashtra, India Assistant Professor, UICT, North Maharashtra University, Jalgaon, Maharashtra, India Director, Samarth Samaj, Dombivli, Maharashta, India Director, RMD Sinhgad Technical Institutes Campus, Pune, Maharashtra, India
P.GOWRISANKAR, N.SRINIVASULU, DR.CH.BALASWAMY Student, ECE Department, QIS College of Engineering and Technology, Ongole, India Student, ECE Department, JNTU College of Engineering, Hyderabad, India Prof& HOD, ECE Department, QIS College of Engineering and Technology, Ongole, India
DR. H.B.KEKRE, UNNATI THAPAR, NEIL PARMAR Senior Professor, Department of Computer Engineering, MPSTME, NMIMS University, Mumbai, India Student, Department of Information Technology, MPSTME, NMIMS University, Mumbai, India Student, Department of Information Technology, MPSTME, NMIMS University, Mumbai, India
JAVED HUSSAIN, DURGESH KUMAR MISHRA Computer Centre, Vikram University, Ujjain, India and Research Scholar, Mewar University, Chittorgarh, India Department of Computer Science and Engineering, Shri Aurobindo Institute of Technology, Indore, India
C.RAMASUBRAMANIAN, R.RAMYA PG Student, ANNA UNIVERSITY, Nodal Center- Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of IT, Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India
Mr. K. SURESH KUMAR, Dr. Y.RAJASREE RAO, Dr. K.MANJUNATHACHARI ECE, SSJ Engineering College, Hyderabad, India ECE, SRIDEVI WOMEN'S Engg College, Hyderabad, India GITAM University, Hyderabad campus, India
S. G. SHIKALPURE, PRIYANKA D. BHUTE Assistant Professor, CSE, Govt. College of Engineering, Aurangabad, India Research Student, CSE, Govt. College of Engineering, Aurangabad, Indiaa
C.NITHYA, M.PRIYADHARSINI II.M.Tech(Multimedia Technology), KSR College of Engineering, Erode, India Assistant Professor, Department of Computer Science, KSR College of engineering, Erode, India
C.SELVALAKSHMI, N.SENTHIL MADASAMY, T.PANDIARAJAN PG Student, ANNA UNIVERSITY, Nodal Center- Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of IT, Kamaraj College of Eng & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of CSE, P.T.R College of Engineering & Technology, Madurai, Tamilnadu, IndiaIndia
MS. R.SARANYA MRS. R.ARTHY PG Student, ANNA UNIVERSITY, Nodal Centre- Kamaraj College Of Engineering & Technology Assistant Professor, Department of IT, Kamaraj College Of Engineering & Technology
PRIYANKA MANHAS, PARMINDER KAUR Student, Department of Computer Science & Engineering, Chandigarh University (Gharuan, Mohali), India Assistant Professor, Department of Computer Science & Engg., Chandigarh University (Gharuan, Mohali), India
|
Abstract
Development of Frame Work for Prediction of Forest Fire and Fire Spread Direction Using Image Mining
DIVYA TL, VIJAYALAKSHMI M.N Assistant Professor, Dept.Of MCA, R.V. College of Engineering, Bangalore, India Associate Professor, Dept.Of MCA, R.V. College of Engineering, Bangalore, India
Abstract: Forest Fire prediction plays a very important role in security of the forest and wild life. There are some frameworks available which predicts the forest fire. These frameworks use various techniques like fire mapping and monitoring. The current framework is intended to do the similar task by measuring the intensity graph of the fire in an image. The pixel level analysis is done for plotting the intensity graph which gives fire danger rate. In order to predict next fire affected area, pixel values are clustered using Density-based Clustering. Density-based Clustering has shown the result in an efficient way for showing the next fire affected region..
Keywords: Fire prediction, Intensity graph , DENsity-based CLUstEring.
Improving a performance of MPEG video streams with different UDP variants
PROF. RAJESH K. AHIR Assistant Professor, Department of Computer Engineering, G. H. Patel College of Engineering & Technology, Vallabh Vidyanagar, Anand, Gujarat
Abstract: The Internet Protocol is becoming a very dominant in computer network technology for video transmission. Video streaming is becoming an increasingly significant component of IP network traffic. Video streaming refers to the real-time transmission of stored video. Initially video was captured and transmitted in analog form i.e. MPEG4 frames are transmitted. Normally UDP (User Datagram Protocol) is used for Media Streaming. With increased deployment of services such as IPTV and Video on Demand (VoD), we have to take care about Quality of Service (QoS). This research work mainly putting the improved performance of different UDP variants with current UDP performance for MPEG video streams. It is found that UDP variants are far performs better as compare to UDP.
NET-CHK A Security Framework for Social Networking Applications
S.THIRAVIYA REGINA RAJAM AND S.BRITTO RAMESH KUMAR Research Scholar, St. Joseph's College (Autonomous), Tiruchirappalli Asst. Professor in Computer Science, St. Joseph's College (Autonomous), Tiruchirappalli
Abstract: The Online Social Network Services (OSNs) have experienced tremendous growth in recent years and become a de facto portal for hundreds of millions of internet users. These OSNs offer attractive means for digital social interactions and data sharing, but also raise a number of issues on security and privacy. While OSNs allow users to restrict access shared data, they currently do not provide any mechanism to enforce security and privacy concerns over data associated with multiple users. One fundamental issue in today‟s OSNs is to give users the ability to control the messages posted on their own private space to avoid that unwanted content is displayed. In this paper, the proposed framework called Net-Chk application, creates firewall in network security. This proposed application gives close wall security while accessing the Social Network sites. It enables the protection of shared data associated with multi users virtual environment in OSNs. And it also allows OSN users to have a direct control on the messages posted on their walls and a secured login method is provided to avoid hacking, Phishing and Social Engineering. It is achieved by using RSA Algorithm.
Algorithms for Mining Frequent Patterns A Comparative Study
MR.RAJESH K. AHIR, MS. MITAL B. AHIR Assistant Professor, Department of Computer Engineering, G. H. Patel College of Eng & Technology, Anand, Gujarat M.E. Students, Department of Computer Engineering, Ipcowala Institute of Eng & Technology, Dharmaj, Gujarat
Abstract: Mining frequent patterns are one of the most important research topics in data mining. The function is to mine the transactional data which describes the behaviour of the transaction. In an online business or in an online shopping the customers can purchase items together. Frequent patterns are patterns such as item sets, subsequence or substructures that appear in a data set frequently. Many efficient algorithms were developed based on the data structure and the processing scheme. The mining of most efficient algorithms such as Apriori and FP Growth were implemented here. In this paper we propose the efficient algorithms (Apriori and FP Growth) used to mine the frequent patterns. The Apriori algorithm generates candidate set during each pass. It reduces the dataset by discarding the infrequent itemsets that do not meet the minimum threshold from the candidate sets. To avoid the generation of candidate set which is expensive the FP Growth algorithm is used to mine the database.
Developement of Microchannel Fabrication Technique and Method to Increase Trench Depth on Pdms
AKHIL VAID, RANDHIR SINGH, PARVEEN LEHANA M. Tech, Department of ECE, Sri Sai College of Engineering and Technology, Pathankot, India HOD, Department of ECE, Sri Sai College of Engineering and Technology, Pathankot, India Associate Professor, Department of Physics and Electronics, University of Jammu, India
Abstract: Integration of electronics with microfluidics devices forms a microfluidics system that provides the portability feature and enables the use of mobile application in chemical analysis, forensics, drug delivery applications etc. The performance of such microfluidic devices is shape oriented. In this paper an effort is made to develop cost effective method to fabricate different shapes of microchannel using etching and capturing replica of the micro channels on the PDMS. Different shapes of the microchannels were fabricated on PCB and there replica are molded on the PDMS. The trench depth on the PDMS was varied using electrolysis process of material deposition on the PCB.
Dynamic Web System Upgrading with Strategic Customers Analysis Using FP growth Algorithm
K.MAITHILI ILANSEZHIYAN, P.SHANTHI, K.SUBASHINI Department of Information Technology, Christ College of Engineering and Technology, Puducherry, India
Abstract: A stylized dynamic pricing model in which a monopolist price a product only at the beginning and change in price will be done with a set of constraints based on the product availability and customer strategic behavior analyzed by frequent pattern (FP) Algorithm. Using this algorithm the least accesses products are analyzed and the product price is adjusted to increase the sale. First, this paper prescribes a threshold policy for customer purchasing: the customer will buy the product if his valuation for this product is above a threshold, and will not otherwise. The threshold increases as TSP decreases, customer transaction cost increases, or customers become more risk averse. Second, we derive the optimal price of each period and identify the optimal policy for web system upgrading there exists a threshold for each period such that the online retailer should upgrade their web system to the state of art (i.e., achieve highest available TSP) if current TSP is below the threshold, and should not upgrade otherwise. The threshold (total discounted profit) increases as customer transaction cost decreases, customer valuations for the product become higher, or customers become more (less) risk averse. Third, the online retailer tends to price higher if it ignores customer strategic behavior. The cost of ignoring customer strategic behavior is substantial. The profit loss rate of ignoring customer strategic behavior increases as customer transaction cost increases, customer valuations for the product become lower, or customers become more risk averse.
A Holistic Protocol for Secure Data Transmission in VANET
TAMILSELVAN, KOMATHY SUBRAMANIAN, RAJESWARI RAJENDIRAN Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India Department of Information Technology, Christ College of Engineering and Technology, Pondicherry, India
Abstract: VANET is the emerging area of MANETs in which vehicles act as the mobile nodes within the network. VANETs are deployed in untrusted and unsecured environment. Value-added applications such as geographical location determination, online payment services, etc. in VANET, improve safety of driving, comfort to passenger, offer great business opportunities, and attract more attention in our life. Vehicles which can be enabled to communicate with their nearer vehicles and sharing the states of driving, VANETs avoid accidents potentially caused by lane changing, emergency braking, etc. The characteristics of VANET lay both challenges and opportunities in achieving the goals of security. Providing security to VANET is necessary by means of giving user anonymity, authentication, integrity, and privacy of information. The Various vulnerable attacks in VANETs are as DDOS attack, ID disclosure, Wormhole attack, sinkhole attack, misbehaving and faulty nodes, spoofing, traffic analysis attack, Sybil attack. The existing solution in this paper is, the security should be provided only to the unauthorized users alone but not to the authorized users. In this case the time consumption and the overhead will be more. In this paper we propose a new light weight holistic protocol to secure VANET against insider and outsider attacks.
Keywords: Security, Road Side Unit(RSU), Registration Identity, Certificate, Plausibility checks.
Clustering data using labels for disease prognostication and making meticulous firmness for fast recovery
E.PRIYA, C.NIVETHA, A.RAJALAKSHMI Information Technology, Christ college of Engineering and Technology, Pondicherry
Abstract: Data mining is a process of searching through large amounts of data for patterns recognition. It is a relatively new concept which is directly related to computer science. It can be used with a number of older computer techniques such as pattern recognition and statistics. The goal of data mining is to extract important information from data that was not previously known. This paper make use of data mining concept for collecting patient details in hospital management .We use a new algorithm called RENOVATE algorithm to cluster the patient record for citation the disease of the patient. This algorithm cluster the data based on everyday update and produce the better result for the doctor to understand the state of affairs of the patient. The renovate algorithm provide the result by clustering the record on the core of labels. And also gives how the clustering process carried to place them in labeled order.
Keywords: clustering, data mining, Renovate, label, Prognostication.
Prototype Selection Algorithms for KNN Classifier a Survey
SHIKHA V. GADODIYA, MANOJ B. CHANDAK M.Tech Student, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Professor, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
Abstract: The k-Nearest Neighbor classifier is one of the most used and well-known techniques for performing recognition tasks but, it suffers from several drawbacks such as high storage requirements, low efficiency in classification response, and low noise tolerance. The most promising solution to overcome these drawbacks consists of reducing the data used for establishing a classification rule (training data) by means of selecting relevant prototypes. Prototype selection is a research field which has been active for more than four decades. As a result, a great number of methods tackling the prototype selection problem have been proposed yet. Different properties could be observed in the definition of these methods, but no formal categorization has been established yet. This paper provides a survey of the prototype selection method's categorization/taxonomy that could be considered relevant.
Keywords: k-NN classifier, prototype selection, data reduction, taxonomy.
Improving High Throughput through Exploration of attacks in the wireless sensor network through collaborative clustering mechanism
ANU S, DR.UMARANI R Department Of Computer Science, Periyar University College Of Arts & Science, Mettur Dam, Tamilnadu, India Department Of Computer Science, Sri Saradha College For Women, Salem, Tamilnadu, India
Abstract: Wireless Sensor networks deal with the challenging problem like node replication, packet dropping and modification by an adversary to disrupt communication. Many schemes have been proposed to mitigate or tolerate such attacks, but very few can effectively and efficiently identify the intruders through witness finding strategy, velocity exceeding strategy. To address this problem, propose a simple yet effective scheme to explore the attacks in the dynamic environment through clustering technique, which can identify Misbehaving forwarders that classify or destroy the packets. The detected intruders are placed into our devised collaborative defence mechanism is been employed to identify explored details of the attack and adopts suitable defence scheme to drop the strength and effect of the attack through revocation process. Extensive analysis and simulations have been conducted to verify the system performance.
A Survey of Data Mining Techniques on Medical Data for Finding Temporally Frequent Diseases
MOHAMMED ABDUL KHALEEL, SATEESH KUMAR PRADHAN, G.N.DASH, F. A. MAZARBHUIYA Research Scholar, Sambalpur University, India Post Graduate Department of Computer Science, Utkal University, India Post Graduate Department of Physics, Sambalpur University, India Albaha University, Albaha, KSA
Abstract: Health care domain is flooded with huge amount of data that holds sensitive information pertaining to patients and their medical conditions. Medical data mining can help obtain latent patterns or actionable knowledge. Data mining techniques can discover such latent patterns or hidden relationships among the objects in the medical data sources. This will give know how to ascertain the progression of diseases over a period of time. As medical data sources contain set of observations that are made from time to time with clinical parameters, considering temporal dimension of the data as fundamental parameter can give valuable insights related to temporal nature of diseases. The classical sequence pattern mining is not sufficient to know the temporal nature of diseases that prevail in a region or country. This is because the sequential patterns do not consider the elapsing time between events. Time-annotated sequences can bestow a novel paradigm in data mining. As temporal data mining has potential advantages, this paper focuses on finding data mining techniques that can be used to extract temporally frequent diseases. We analyze the techniques using for temporal data mining on medical data sets.
Keywords: Data mining, medical data mining, data mining techniques, temporally frequent diseases
SARANG BANSOD, SHWETA JAIN M.tech. Scholar, Dept. of Computer Science & Engg, RCOEM, Nagpur, India Lecturer, Dept. of Computer Science & Engg, RCOEM, Nagpur, India
Abstract: This paper presents the short survey on some of the recent non transformation based image compression algorithms. It covers the different techniques for the purpose. Paper describes harmony search, various algorithms on block truncation coding and fractal compression techniques. These algorithms are based on the lossy compression of images. Paper also gives the overview regarding some traditional techniques used for image compression. Compression refers to the reduction of the size of the data that images contain. Redundant data can be considered as repeated or irrelevant information. Eliminating statistically redundant data often yields reversible or lossless compression while eliminating visually irrelevant data inflicts losses on the reconstructed image, which is the method implemented by lossy compression techniques.
Fortune's Method An Efficient Method For Voronoi Diagram Construction
MS.PUNAM MARBATE, MS.REETU GUPTA Department of Computer Science & Engineering, Rajiv Gandhi College of Engineering & Research, Nagpur, India Department of Computer Science & Engineering, Priyadarshani Indira Gandhi College of Engineering, Nagpur, India
Abstract: This Paper briefly describes the Fortune's method i.e. Fortune's sweepline algorithm for constructing voronoi diagram. There are a variety of algorithms available to construct Voronoi diagrams. One popular method is the incremental algorithm that adds a new site to an already existing diagram. In 1985, Steve Fortune developed a plane- sweep algorithm which is more efficient in time than any incremental algorithm. There are many approaches to constructing Voronoi diagrams. Some methods are more efficient in terms of time than others. Here, we have tried to explore the aspects regarding fortune's method.
Comparison of Path Planning Algorithm for WSN LMCS, Robust Interval-Based Localization Algorithms, Localization Based On Genetic Algorithm
T.S.LOKHANDE, PROF. R. R. SHELKE Department of Comp. Sci. &Engg. H.V.P.M's college of Engg. & Tech Amravati University, India
Abstract: Node localization technology is especially important to most applications of wireless sensor network. There are different path planning algorithms for wireless sensor network. However, each mobile beacon needs to broadcast its current position many times, and locating all the nodes must take a long time in most of the localization algorithms. In order to solve these problems, we propose a novel range-free localization algorithm-localization with a mobile beacon based on compressive sensing (LMCS). Robust interval based localization algorithm, this algorithm perform set-membership estimation, where only the maximal number of outliers is required to be known. Using these algorithms, estimates consist of sets of boxes whose union surely contains the correct location of the sensor, provided that the considered hypotheses are satisfied. This technique evaluates the number of outliers to be robust. Localization in wireless sensor network based on genetic algorithm, approximate the distance between anchor node and unknown node which is out of the anchor node's communication radius.
Analysis of Various Web Page Ranking Algorithms in Web Structure Mining
N. V. PARDAKHE, PROF. R. R. KEOLE Department of Computer Science and Engineering H.V.P.M's college of Engineering and Technology, Amravati University, India
Abstract: With the rapid increase in internet technology, users gets easily confused in large hyper text structure. Providing the relevant information to user is primary goal of the website owner. In order to achieve this goal, they use the concept of web mining. Web mining is used to categorize users and pages by analysing the users‟ behaviour, the content of the pages, and the order of the URLs that tend to be accessed in order. Web structure mining plays very important role in this approach. It‟s defined as the process of analysing the structure of hyperlink using graph theory. There are many proposed algorithms for web structure mining such as PageRank (PR), Weighted PageRank (WPR), and Hyperlink-Induced Topic Search (HITS) etc. This paper studied about web mining and its various techniques. Different web page ranking algorithms are also compared based on their methodology, relevancy, quality of results and limitations etc.
Keywords: HITS, Page Ranking, web structure mining, weighted Page Ranking
MANPREET SINGH, KARAMJIT KAUR Student, University College of Engineering, Punjabi University, Patiala, India Assistant Professor, University College of Engineering, Punjabi University, Patiala, India
Abstract: Orthogonal frequency division multiplexing (OFDM) is an attractive modulation format that recently received a lot of attention in the fiber-optic community. The main advantage of optical OFDM is that it can cope with virtually unlimited amount of inter symbol interference (ISI). In high-speed optical transmission systems, ISI is caused for instance by chromatic dispersion and it is serious issue in long-haul systems whose bit rate is higher. High order dispersion such as a third-order and higher-order dispersion effects are not fully compensated using the traditional dispersion compensating devices such as Dispersion compensating fiber (DCF), Optical Filters etc. Thus the received signals at the receiver end would be distorted dramatically, even if only a small outside effect affects the transmission link. The Phase modulator system is proposed in this work at the receiver end to recover higher-order dispersion which would not be compensated by DCF fiber and Optical Filters.
Keywords: Bit error Rate, Coherent Detection, Phase Modulator, Optical OFDM, Third order dispersion.
Edge Detection in Images Based on Approximation Theory
HASSAN BADRY MOHAMED A. EL-OWNY Department of Mathematics, Faculty of Science, Aswan University, 81528 Aswan, Egypt Computer Science Department, Taif University, 21974 Taif, KSA
Abstract: Edges characterize boundaries and edge detection is one of the most difficult tasks in image processing hence it is a problem of fundamental importance in image processing. Several edge detection algorithms have been developed such as Prewitt, Sobel, LOG, etc. But, they are not able to produce ideal or optimized results. This paper presents an edge detection approach applicable to gray level images based on Approximation Theory. The performance of proposed method is compared against other methods such as Sobel and Prewitt edge detector by using various tested images. Experimental results reveal that the proposed method exhibits better performance and may efficiently be used for the detection of edges in image.
Voice Conversion Using Different Pitch Shifting Approach over TD-PSOLA Algorithm
SHAIK SHAFEE, B.ANURADHA Research Student, Department of ECE, SV University College of Engineering, Tirupati, India Professor, Department of ECE, SV University College of Engineering, Tirupati, India
Abstract: Voice conversion and voice morphing has numerous applications in the commercial and industrial sectors. This paper emphasizes voice conversion using simple approach of pitch shifting method over TD-POSLA and re-sampling which depends on time stretching or time expanding based on the required target pitch. This study is performed to see the effect of voice conversion when some Telugu/Hindi (alphabets) speech signal is considered. Treatment of certain Telugu/Hindi voiced speech and vowels and the conversion between male, female and child speech has shown some expansion or compression in the resulting speech. The New approach is compared in terms of pitch shifting and computation/processing time with the conventional Time stretching and re-sampling algorithm is presented here. Analysis was performed for both male and female voice of Telugu/Hindi (alphabets) speech.
A Speculative Study of Apriori with Inferencifiction(SSAI)
RUCHI GUPTA, POOJA SAHARAN Assistant Professor, CSE Dept, ABES Engineering College / Mahamaya Technical University, Ghaziabad, U.P, India
Abstract: Frequent Pattern discovery is one of the major problem in areas of Data Mining and Business Intelligence, because it reveals associations, correlations, and many other interesting relationships among items in the transactional databases. FPD is a process of searching for patterns such as set of features/ items that appear in data frequently. Our idea is to introduce inference rules in association with association rules that reduces the use of join operation while applying Apriori algo to a transactional database to discover the frequent patterns.
Keywords: Apriori, Inferencifiction, Frequent Pattern Discovery (FPD), Association Rule mining, Inference Based Pattern Discovery.
Predicting Resource Allocation in Distributed Environment by Using Online Predictive Approach a Review
PROF. S. M. TIDKE, RUCHA RAVINDRA GALGALI Assistant Professor, Computer Science and Engineering, Shreeyash Engineering college, Aurangabad, India Student, Computer Science and Engineering, Shreeyash Engineering college, Aurangabad, India
Abstract: A distributed system consists of a collection of autonomous computers connected through network which enables computer to coordinate their activities and to share the resources of the system so that users perceive the system as a single, integrated computing facility. In distributed system there are many clients are connected, so it is very difficult to handle, analyze and process the data in distributed environment. To process such a large data many techniques like migration of data, replication of data, parallelism are available, but they have some disadvantages. These disadvantages have motivated this paper to implement the online predictive approach algorithm to predict the resource allotment for the process. The resource prediction is used to optimize the data access operations like read, write, uploading and downloading the file etc. Advantages of this strategy are the client can analyze the process behavior and also client will get application execution time.
Keywords: Time series, Application prediction, Distributed system, Application analysis, Replication
Optimization of Resonant Frequency of Shorted Elliptical Patch
MANIDIPA NATH AIACTR
Abstract: In this paper, a parametric study on the resonant frequency of shorted elliptical microstrip antenna is done and optimization of feed probe location for optimum radiation efficiency is carried out. A feed probe is located off-axis to generate closely spaced dual resonances for weakly elliptical patch. Using multiple shorting posts, the resonant frequencies of these modes are selectively tuned. Measured results are compared with simulation studies (IE3D) for validation.
Performance Evaluation of Legendre and Rudin-Shapiro Sequences using PSLR
B.SURIBABU NAICK, DR. P.RAJESH KUMAR Assistant Professor, Dept of ECE, GITAM University, Visakhapatnam, India Associate Professor, Dept of ECE, Andhra University, Visakhapatnam, India
Abstract: In this paper, two sequences i.e., Legendre and Rudin-Shapiro are compared based on the peak side lobe ratio of an auto-correlation function. The former is applicable only for prime numbers and the latter is applicable for length sequences. The peak side lobe ratio gives an alternative to the merit factor for measuring the collective smallness of the binary sequences. A low peak side lobe ratio is the factor for good resolution and peak side lobe ratio of larger sequences can be applied in different Radar applications .The results are compare and simulated using Matlab.
Abstract: This paper presents a digital design of neuron architecture on field-programmable gate array (FPGA). The objective of this project is to translate data from electrochemical sensor signals and process the data with neuron structure on digital hardware. The hardware realization of neural network requires investigation of many design issues relating to signal interfacing and design of a single neuron. Analysis focuses on effect of digital design decisions such as module architecture towards data accuracy and delay. The work touches on analogue to digital interfacing, data structure and digital module design that includes adder, multiplier and multiplier accumulator (MAC). A major component of the algorithm is the design of the activation function. The chosen activation function is the hyperbolic tangent which is approximated by Taylor Series expansion. The neuron is evaluated on an Altera DE2-70 FPGA. The performances are evaluated in terms of functionality, usage of resources and timing analysis. For the data structure, it was demonstrated that increasing the fractional bits will increases the precision. The neuron functionality was demonstrated on digital platform. It was found that less delay were produce by using Carry Look Ahead design compared to Ripple Carry Adder by 25% in the MAC performance.
A Novel Wireless Biomedical Monitoring System with Dedicated FPGA-Based ECG Processor
KORANI RAVINDER PHD, MOHD IRFAN-UR-RAHMAN, MD WAJID HUSSAIN, MD ABDUL KHADER, ASED MOHIUDDIN Asst. Professor, ECE Department, VIFCET, JNTU, Hydrabad PG Scholar in VLSI Design Department of E.C.E VIFCET, JNTU, Hydrabad DECE Student Bio-Medical Engineering Govt Polytechnic SBTET, Hydrabad
Abstract: A novel portable and wireless biomedical monitoring system featuring on demand wireless data transmission of ECG signals and time-frequency HRV analysis for personal and home healthcare applications is presented in this work. In order to provide comfort and convenience to patients, the device's size, power consumption and portability are of first priority. The ECG processor based on previous hardware design [1] acquires three-channel ECG biomedical raw data through an analog front-end (AFE) circuit, and it measures the time between successive heart beats on lead II as RR intervals for HRV analysis. Functions such as QRS complex peak detection, RR intervals calculation, and time- frequency analysis of HRV have also been developed in hardware. A real-time HRV analysis processor is realized by employing a Lomb periodogram for time-frequency power spectral density (PSD) analysis of the heart rate. The proposed ECG monitoring system has been implemented in Field-Programmable Gate Arrays (FPGA) and it features high integration density, portability, wireless transmission and low cost.
Camera-Based Wireless Sensor Networks for E-Health
A. AL-MARAKEBY Systems and Computers Engineering Dept. Faculty of Engineering , Al-Azhar University,Cairo, Egypt
Abstract: Wireless sensor networks (WSN) are widely applied in many fields such as e-health, military, surveillance and industrial applications. In e-health field, WSN is commonly used for monitoring elderly people, babies , and patients The progress of WSN technologies allowed the connection of a camera to WSN node to transfer images and video. This technology improves the monitoring of patients and gives more information which is not available with traditional WSN nodes. The problem with image and video transmission is the high demand of bandwidth and the requirements of human monitoring at the sever side. In this research , images captured by WSN nodes are analysed at the node side and only special images are transferred indicating special patient activities. This reduces the required bandwidth and reduce the human effort the server side. Image processing algorithm are optimized to be suitable for the low computation power and memory resources in the WSN camera node.
Enhancement of DWT based Watermarking Technique for Images
MONIKA PATEL, PRITI SRINIVAS SAJJA, JIGAR PATEL Asst. Professor, Computer Science Department, NVPAS, Sardar Patel University, Vallabh Vidyanagar, Gujarat, India Professor, Computer Science Department, Sardar Patel University, Vallabh Vidyanagar, Gujarat, India Lecturer, E. & C. Engineering Department, BBIT, Vallabh Vidyanagar, Gujarat, India
Abstract: The ease of reproduction, distribution, and manipulation of digital documents creates problems for authorized parties that wish to prevent illegal use of such document. To this end, digital watermarking has been proposed as a last line of defense. Digital Watermarking is a data hiding technique where an information or message is hidden inside a signal. This method is used for copyright protection of digital media. Digital representation of the signal has made the job of Watermarking easier and cost effective, and thus this technology is already developing very fast among the media industry. In this paper we introduced Digital watermarking with its classification. Also we have developed DWT based digital watermarking technique for Images.
Keywords: Data Hiding, Digital Watermarking, Copyright Protection, DWT
Image Analysis Through Facial Recognition Guidelines
JATINDER KAUR GURPREET SINGH BRAR, KAMALJEET KAUR, MONIKA BHARTI, HARISH GARG Department of Electronics &Communication Engineering, GGSCMT, Kharar Research scholar, Punjab Department of Computer Science Engineering, Chandigarh University, Gharuan Department of Mechanical Engineering, DAV University, Jalandharauthor
Abstract: Human face detection is a pretty method for a wide range of applications such as face recognition, video tracking applications, and image database management etc. Face recognition is one of the most successful applications of image analysis and understanding, so it has recently received significant attention, especially during the past several years. An attempt has been made to provide basis of facial recognition and guidelines to do analysis of image through facial recognition.
Keywords: Face recognition, feature extraction, facial recognition etc.
MRS. K.RAJASRI, R.ANUDEEPARANI, R.PREMA, R.VASUGI Senior Assistant Professor, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India Student, CSE, Christ College of Engg & Tech, Pondicherry, India
Abstract: Mobile ad hoc networks (MANETs) have been highly susceptible due to the flexibility provided by their dynamic infrastructure. The routing attacks could cause severe damage to MANET. Although there are several intrusion response techniques to alleviate such critical attacks, existing solutions normally attempt to isolate malicious nodes based on binary or naı¨ve fuzzy response decisions. Though, binary responses may effect in the unpredicted network partition, producing extra damages to the network communication. However, this flexibility introduces new security threats such as routing attacks, Denial-of-Service and selective jamming attacks. Many existing security solutions for conventional networks are ineffective and inefficient for many predicted MANET deployment environments. In our project, we address the problem of routing attacks, Denial-of-Service and selective jamming attacks in mobile ad hoc networks. Therefore, we propose that these MANET routing attacks can be introduced by the real-time packet classification. In such attacks, the rival remains active only for a short span, selectively aiming at highly significant messages. We exemplify the benefits of selective jamming in terms of rival effort and network performance degradation with a selective jamming attack on TCP and another on routing. We explain that selective jamming attacks can be introduced by the real-time packet classification. To alleviate these attacks, we build up schemes that evade real-time packet classification by merging cryptographic primitives. We evaluate the security of our techniques and compute their computational and communication overhead.
DEJEE SINGH, MR. R.K.SAHU ME Scholar, Department of ET&T, Chhatrapati Shivaji Institute of Technology, Durg, India Associate Professor, Department of ET&T, Chhatrapati Shivaji Institute of Technology, Durg, India
Abstract: Image blur is difficult to avoid in many situations and can often ruin a photograph. Image deblurring and restoration is necessary in digital image processing. Image deblurring is a process, which is used to make pictures sharp and useful by using mathematical model. Image deblurring have wide applications from consumer photography, e.g., remove motion blur due to camera shake, to radar imaging and tomography, e.g., remove the effect of imaging system response. There have been many methods that were proposed in this regard and in this paper we will examine different methods and techniques of deblurring. The analysis is done on the basis of performance, types of blur and PSNR (Peak Signal to Noise Ratio).
Keywords: Blur type, degradation model, image deblurring, motion blur, point spread function (PSF), peak signal to noise (PSNR).
Parallel Multithreaded Apriori Algorithm for Vertical Association Rule Mining
M.RAVIKANTH, G.LOSHMA Final M.Tech, Dept. Of CSE, Sri Vasavi Engineering College, Tadepalligudem, India Associate Professor & Head, Dept. of CSE, Sri Vasavi Engineering College, Tadepalligudem, India
Abstract: Association rule mining is one of the important concepts in data mining domain for analyzing customer's data. The association rule mining is a process of finding correlation among the items involved in different transactions. Traditionally association rule mining is implemented horizontally. For this we have plenty of different algorithms in research like Apriori based, FP tree based so on. Recently we have a new method in association rule mining which generates vertical association rules. In horizontal association rule mining we read transaction items record by record basis and computes support of each frequent item or candidate item. We repeat this process to generate frequent item sets. The vertical association rule mining evaluates support frequency of each item column wise for this it uses bitmap matrix this saves support sets of frequent item sets in memory which is used to calculate candidate item sets. In our system it is proposed to combine both horizontal mining and vertical mining in generating association rules. The horizontal and vertical mining are implemented in parallel using multithreading concept. For this we propose a modified parallel multithreaded Apriori algorithm. The algorithm saves time and decreases memory space as the process is running because of bitmap representation of dataset and bitmap compression algorithms.
Keywords: Data mining, Association Rule Mining, Frequent item sets, Candidate item sets, Horizontal mining, Vertical mining, Apriori, Bitmap Apriori, and Parallel multithreaded Apriori
A Survey on Load Balancing in Cloud Computing Environments
RAJESH GEORGE RAJAN, V.JEYAKRISHNAN M.Tech. Student, Dept of Computer Science, Karunya University, Coimbatore, India Assistant Professor, Dept of Computer Science, Karunya University, Coimbatore, India
Abstract: Load Balancing is the one of the most important parts of the current virtual environment. In the case of cloud computing environments there were various challenges are there in the load balancing techniques like security, fault tolerance etc. Many researchers have been proposed various techniques to improve the load balancing. This paper describes a survey on load balancing schemes in cloud environments. There were various load balancing techniques are used in these papers and their corresponding advantages, disadvantages and performance metrics are studied in detail.
Improvement of bit rate transmission using higher order Soliton pulse
ER. HARJEET SINGH Assistant Prof. in Electronics & Communication Engg.Department, BHSBIET, Lehragaga, India
Abstract: In this paper, I present the methodology to increase the bit rate transmission from 10 Gb/sec to 40 Gb/sec using higher order soliton pulse in place of conventional pulse. Here I use the PMD fiber to reduce the effect of polarization mode dispersion on data transmission. I use Optsim simulator to simulate the system and for analyze the performance. I analyze the system performance using eye diagram, instantaneous optical power and electrical spectrum.
Designing Of Order Five Low Pass Microstrip Filter Using Photonic Band Gap
SHUBHANKAR PAUL, A. BARAPATRE Vedica Institute of Technology, Bhopal, India
Abstract: Signals have to be filtered at a certain frequency with a specific bandwidth. In microwave region, PBG is used to improve radiation pattern, increase efficiency along with the design of filters.In this paper the design of filter is done in the without rectangular photonic band gap (PGB) and with rectangular photonic band gap (PGB) The development of the Micro strip low pass filters are simulated by using IE3D simulator software.
Keywords: Low pass filter (LPF), Photonic band gap (PBG), Strip line and micro strip line and Loss tangent.
Remote Desktop Access Using Cued Clicked Points and SMS Authentication
B.B.GITE, HARIHARAN SWAMINATHAN, DIPALI KALAMBE, DEEPTI PAWAR, JYOTI SARODE Assistant Professor, Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engineering, STES's Sinhgad Academy of Engineering, University of Pune, Pune, Maharashtra,India Department of Computer Engin
Abstract: We propose an elegant method called Cued Click Points (CCP) to solve the authentication problem in a ubiquitous manner. The fundamental idea of CCP is based on premise that "humans are good at identifying remembering and recollecting graphical patterns than text patterns, the core idea of CCP is that, instead of remembering a sequence of characters as a secret user‟s have to remember a shape (which is internally stored as sequence of positions as the secret)" Due to wireless networks feature of being open and the deficiency of wireless protocol; more and more means of attack have been offered, therefore it is important to share secret password between sender and recipient securely,a mobile authentication scheme using SMS in which a password kept as secret with our expectations. Remote desktop is an application that allows user to control the desktop and the entire content of one computer from mobile devices. When it is difficult and impractical to be physically near a system in order to use it, or in order to access it, we can use this application. Desktop screen will be displayed on the android phone and you can pretty much do whatever you want to do.
Efficient Image Compression Using Two Dimensional Discrete Cosine Transformation Technique
N.A.V. KUMAR, G.A. RAO Department of ECE, Avanthi Institute of Engineering & Technology, Visakhapatnam, India Department of ECE, Avanthi Institute of Engineering & Technology, Visakhapatnam, India
Abstract: The technique of compression reduces the data storage requirements while offering an attractive approach to reduce the communication cost in transmitting high volumes of data over long-haul links via higher effective utilization of the available bandwidth in the data links. In this work we report an efficient method utilising the advantages of 2D Discrete Cosine Transformation (DCT). The proposed pipelined 2D DCT exploits the principles of pipelining and parallelism to obtain high speed the architecture designed for high speed VLSI.
Implementation of a Novel Difference Set Codes for Major Fault Detection
TANUJA ARJA, NARASIMHA REDDY BATHALA, MADHUSUDHANA RAO.ADIGARLA Student (M.Tech), VLSI(SD), Department of ECE, Avanthi Institute of Engineering &Technology Asst.Professor, Department of ECE, Avanthi Institute of Engineering &Technology
Abstract: This Majority Logic decoding (MLD) is very simple to implement and thus it is very practical and has low complexity. The drawback of ML decoding is that, for a coded word of -bits, it takes cycles in the decoding process, posing a big impact on system performance. One way of coping with this problem is to implement parallel encoders and decoders. The solution would enormously increase the complexity and, therefore, the power consumption. method presents a modified version of the ML decoder that improves the designs. The proposed ML detector/decoder (MLDD) has been implemented using the difference-set cyclic codes (DSCCs). This code is part of the LDPC codes and based on their attributes.
Optical Burst Switching (OBS) for DWDM transmission medium an Overview
MS. SAMPADA D.SAMUDRA, MRS. SHILPA P.GAIKWAD M.Tech. Student, Dept. of Electronics, College of Engineering, Bharti Vidyapeeth Deemed University, Pune, India Professor, Dept. of Electronics, College of Engineering, Bharti Vidyapeeth Deemed University, Pune, India
Abstract: This paper presents a review on optical burst switching (OBS) for dense wavelength division multiplexing (DWDM) technology. The DWDM technology is explained in brief. Then the three generations of optical networks are briefed. The different switching schemes in optical networks are compared. The advantages and issues related to OBS are reviewed. Lastly the simulator tool nOBS based on ns-2 is overviewed.
ZEESHAN ALI, REENA SONKUSARE Student-ME, Department of EXTC, SPIT, Mumbai, India Associate Professor, Department of EXTC, SPIT, Mumbai, India
Abstract: The advent of wireless technology along with other communication techniques has helped in making electronic commerce very popular. A modern forward looking product is the one that aids the comfort, convenience and efficiency in everyday life. In this paper, we discuss an innovative concept of RFID Based Smart Shopping and Billing. The key idea here is to assist a person in everyday shopping in terms of reduced time spent while purchasing a product. The main goal is to provide a technology oriented, low-cost, easily scalable, and rugged system for aiding shopping in person. The developed system comprises of Cart location detection unit (CLDU), Server Communication unit (SCU), User Interface and display unit (UIDU) and Billing and Inventory management unit (BIMU). CLDU is used to smartly locate the position of shopping cart inside the shopping market to help in obtaining relevant product information. SCU will help in establishing and maintaining the connection of the shopping cart with the main server. UIDU will provide the customer with user interface and BIMU deals with the billing and inventory management in collaboration with the SCU. These units are integrated into a smart enclosed system and are tested to satisfy the functionality. The smart shopping cart will help shorten the checkout lines thereby helping the customers at retail stores. The customers will be able to scan the items themselves and the LCD screen on the shopping cart will keep updating the total. This will turn out to be very beneficial for the retail stores as more people will enjoy the shopping experience and come more often to shop.
Keywords: Radio Frequency Identification (RFID), Wireless ZigBee Module, Infra-Red (IR) transmitter and receiver, RFID tags, Microcontroller, Server database.
Novel ASIC Design flow for Multi-rate FIR Filter from System Specification to Functional Verification
HEENA PATEL, MITUL PATEL, TARUN LAD M Tech- ECE (pursuing), Uka Tarsadia University, Bardoli, India Assistant Professor, Electrical Department, FETR, Bardoli, India Assistant Professor, Department of Electronics & Communication, Uka Tarsadia University Bardoli, India
Abstract: Finite impulse response filter holds important part in DSP designs. Multi-rate FIR filters specially are the integral part of the various DSP applications like speech coding, audio compression, image processing and others. In VLSI designs, especially nowadays, in SOC designs, requires efficient implementation of FIR filter. Fixed point FIR filter design is the challenging task in ASIC designs. Here, ASIC design flow for a multi-rate FIR filter is proposed from system parameters to verification. From the help of FDATOOL in MATLAB, different fixed point FIR filters are designed and RTL like MATLAB model is designed. Also, filter coefficients are optimized with common sub expression elimination technique. This model helps in optimizing HDL modeling in terms of arithmetic and verification.
Keywords: FIR filter, Multirate filtering, ASIC, SOC design, CSE, RTL like MATLAB model, functional verification.
Artificial Neural Network Architecture for Solving the Double Dummy Bridge Problem in Contract Bridge
M DHARMALINGAM, R AMALRAJ Ph.D Research Scholar, Department of Computer Science, Bharathiar University, Coimabatore, India Associate Professor Department of Computer Science, Bharathiar University, Coimabatore, India
Abstract: Card games are interesting for many reasons besides their connection with gambling. Bridge is being a game of imperfect information, it is a well defined, decision making game. The estimation of the number of tricks to be taken by one pair of bridge players is called Double Dummy Bridge Problem (DDBP). Artificial Neural Networks are Non - Linear mapping structures based on the function of the human brain. Feed Forward Neural Network is used to solve the DDBP in contract bridge. The learning methodology, supervised learning was used in Back - Propagation Network (BPN) for training and testing the bridge sample deal. In our study we compared back - Propagation algorithm and obtained that Resilient Back - Propagation algorithms by using Hyperbolic Tangent function and Resilient Back - Propagation algorithm produced better result than the other. Among various neural network architectures, in this study we used four network architectures viz., 26x4, 52, 104 and 52x4 for solving DDBP in contract bridge.
Keywords: BPN, Contract Bridge, Back - Propagation Algorithm, Resilient Back - Propagation Algorithm, Hyperbolic Tangent function.
RAVICHANDRA M, KIRAN GOWDA H N, UDAYA KUMAR C A Assistant Professor, Department of Information Science & Engineering, Acharya Institute of Technology Bangalore, Karnataka, India Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, Karnataka, India Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, Karnataka, India
Abstract: In recent year's mobile services are increasing rapidly due to the need to access information anywhere, anytime. Handover is considered "seamless" when able to provide continuous connectivity for devices by handover from one network to other. Handover algorithms plays major role in deciding the best network for service. Handover algorithms are chosen. Based on parameters such as bandwidth, user preferences, RSS, velocity and network load etc... In this paper we classify HO algorithms such as RSS, bandwidth, cost based, combination, allocation, MADM algorithms.
Keywords: Multiple Attributes Decision Making, Handover, Algorithms, Next Generation Networks
A Survey on Handovers Literature for Next Generation Wireless Networks
RAVICHANDRA M, KIRAN GOWDA H N, UDAYA KUMAR C A Assistant Professor, Department of Information Science and Engg., Acharya Institute of Technology Bangalore, Karnataka, India PG Student, Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, India PG Student, Department of Information Science & Engineering, Acharya Institute of Technology, Bangalore, India
Abstract: Mobility is the need of the hour- computing and communication devices of today are omnipresent and operate in heterogeneous environment. Terminologies such as ―Always Best Connected‖, ―Seamless Mobility‖ are considered as key features of Next Generation Wireless Networks (NGWN). The challenge for Next Generation Wireless devices is ensuring end-to-end connectivity by seamlessly migrating between Heterogeneous wireless technologies (viz. Wireless LAN, WiMax, Cellular, UMTS, and LTE etc.) This process of handover between different wireless technologies referred to as Vertical Handovers/Handoffs has significant importance among industry and academia researchers. The prime objective of this paper is to provide a one-stop literature store on basics of Handovers, Classifications, Algorithms, Factors influencing Handovers and desirable features of Handover mechanisms for NGWN.
Keywords: Hard Handoff, Soft Handoff, VHD algorithms, Multi Attribute Decision Making (MADM)
A Survey on Supervised Learning for Word Sense Disambiguation
ABHISHEK FULMARI, MANOJ B. CHANDAK Student M.Tech, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Professor, CSE Department, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
Abstract: Word Sense Disambiguation (WSD) is the process of determining which sense of a word is used in a given context. Due to its importance in understanding semantics it is used in many real-world applications like web information retrieval, machine translation and information extraction. The problem of WSD is mainly considered as AI- complete problem. This paper discussed supervised approach, unsupervised approach, NaĂŻve Bayes method, Exemplar based learning method, Decision List method for WSD.
Keywords: Word Sense Disambiguation, Supervised Approach, NaĂŻve Bayes Methods, Exemplar-based Learning Methods, Unsupervised Approach.
S.THULASI PRASAD, S.VARADARAJAN Associate Professor, Dept. of ECE, CVSE, Tirupati, India Professor, Dept. of ECE, SVUCE, Tirupati, India
Abstract: Due to fast advancement in the technology, scientists and engineers are facing several challenges in solving biomedical problem; Digital Signal Processing has become an essential and effective pedagogical approach to solve a problem of detecting selected arrhythmia conditions from a patient's electrocardiograph (ECG) signals. Finding arrhythmia characteristics corresponding to Atrial Fibrillation (AF), heart rate variability (HRV), etc., from ECG recording have received considerable attention in recent years. Several advanced signal processing techniques have been applied for cardiac arrhythmia detection using Fourier Transforms, Wavelets, Artificial Neural Networks, Independent Component Analysis, etc. Introducing a simple algorithm for arrhythmia detection can be very useful for better conceptual understanding of signal processing. In this paper, simple methods have been discussed to clean ECG signal corrupted by noise and to extract required parameters for detecting arrhythmia condition. These simple procedures involve using filter techniques, wavelet techniques, algorithms of finding peaks & valleys, local maxima & minima etc, for determining R peaks, R-R intervals and QRS amplitude.
A Brief Overview of Software Testing Techniques and Metrics
ANITHA.A Programmer, School of Computer Studies (PG), RVS college of Arts & science, Coimbatore, India
Abstract: Software Testing is the process of executing a program or system with the intent of finding errors. Software testing is any activity aimed at evaluating an attribute or capability of a program or system and determining that it meets its required results. Testing is an integral part in software development. It is broadly deployed in every phase in the software development cycle. Typically, more than 50% precent of the development time is spent in testing. Metrics are gaining importance and acceptance in corporate sectors as organizations grow, mature and strive to improve enterprise qualities .In this paper, discuss software testing techniques and testing metrics.
Gender Face Classification Using Color Image Discrimination Model
DIPTI PRATIK PANDIT, PROF. M.N.KAKATKA Lecturer, E & Tc Department, SVCP, Pune, India Assistant professor, E & Tc Department, SCOE, Pune, India
Abstract: The biometric schemes are commonly used for the identification of human beings. Face recognition is one of the biometric methods, to identify given face image using main features of the face. The objective of face recognition involves the extraction of different features of the human face from the face image for discriminating it from other persons. To seek a meaningful representation and an effective recognition method of color images in a unified framework, color image representation and recognition is integrated into one discriminant analysis model: color image discriminant (CID) model. The two sets of variables can be determined optimally and simultaneously by the CID algorithms. Gender is an important demographic attribute of people. An Basic CID algorithm with two class recognition problem is for gender classification.
Keywords: Color image discriminant (CID) color space, face recognition, color images, gender classification.
A Survey on Facial Expression Analysis for Emotion Recognition
ASHISH LONARE, SHWETA V.JAIN Student Mtech, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India Assistant Professor, Department of Computer Science and Engineering, Shri Ramdeobaba College of Engineering and Management, Nagpur, India
Abstract: Over the last decade,facial expression recognition also stated as FER has become an active research area that finds significant applications in areas such as human-computer interfaces,talking heads,image retrieval and human emotion analysis like happy,sad,neutral,disgust,anger,surprise etc. Facial expression reflects not only emotion but other mental activities such as those in cases of clinical approaches. This survey also deals with brief details of various approaches like optical flow method, local binary patterns, Pyramid of histogram of gradient (PHOG) and Local phase quantisation(LPQ) method, Facial action coding system(FACS).
Keywords: FER, Human Emotion Analysis, Optical flow, Local binary patterns, PHOG and LPQ, FACS.
Decision Trees for Uncertain Data Based On Statistical Uniform Distribution
C.SUDARSANA REDDY, Dr. V.VASU, S.AQUTER BABU Department of Computer Science and Engineering, S.V. University College of Engineering, S.V. University, Tirupati, Andhra Pradesh, India Department of Mathematics, S.V. University, Tirupati, (A.P), India Assistant Professor of Computer Science, Department of Computer Science, Dravidian University, Kuppam -517425, Chittoor District, Andhra Pradesh, India
Abstract: Certain or classical decision trees are constructed for training data sets containing certain data. But in real life, in many cases, data is always uncertain. Hence many previous data mining techniques such as classification, clustering, regression and association rule mining etc. are inefficient or inaccurate or they must be reconsidered in managing uncertain data. Present study proposes an efficient and more accurate uncertain data management technique in data classification using decision trees. This new technique is modelled using uniform distribution and it is called Uniform Decision Trees for Uncertain Data (UDTUD). Uniform decision tree classifiers constructed for uncertain data are more accurate than Certain Decision Tree (CDT) classifiers constructed using certain data. There exists many models for uncertain data management but we propose Uniform distribution model for uncertain data management because it gives more accurate results for some training data sets. Applying data mining techniques to uncertain data is computationally costly. Extensive experiments have been conducted which show that classification accuracies obtained by UDTUD are more accurate than classification accuracies obtained by Certain Decision Trees (CDTs).
Keywords: Uniform distribution, uncertain data, certain data, decision tree, classification, data mining, machine learning
Enlargement of Image Based Upon Interpolation Techniques
K.SREEDHAR REDDY, DR. K.RAMA LINGA REDDY Department of Electronics and Communication Engineering, VITS, Karimnagar, India Professor & Head of the Department in Electronics and Telematics (ETM), GNITS, Hyderabad, India
Abstract: For real time applications, simple linear or cubic interpolation and FCBI (Fast Curvature Based Interpolation) algorithms are applied for the task of enlargement of images without changing super resolution (low resolution and high resolution), but the results obtained are not really satisfactory, being affected by relevant artifacts like blurring and jaggies. In this paper we describe a new method (ICBI, Iterative Curvature Based Interpolation) based on a two-step grid filling and an iterative correction of the interpolated pixels obtained by minimizing an objective function depending on the second order directional derivatives of the image intensity. We need to compare ICBI with FCBI in two cases that is PSNR (Peak Signal to Noise Ratio) test and time calculations for ICBI and FCBI. We show that the constraints used to derive the function are related with those applied in another well-known interpolation method providing good results. The high quality of the images enlarged with the new method is demonstrated with objective and subjective tests, and PSNR for ICBI is 30.085 dB (ZF=002), 23.833dB (ZF=004).
Keywords: Fast Curvature Based Interpolation, Iterative Curvature Based Interpolation, Fast Methods And The NEDI Algorithm, Perceptually-Inspired An Edge-Directed Color, Image Super- Resolution, New Edge -Directed Interpolation
Enabling Efficiency in Data Dynamics for Storage Security in Cloud Computing
K.GAYATHRI, P.UMAMAHESWARI, P.SENTHILKUMAR Assistant Professor,Anna University, Tamilnadu, India Assistant Professor, Adama Science and Technology University, Ethiopia, East Africa
Abstract: Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This unique paradigm brings about many new security challenges, which have not been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. The introduction of TPA eliminates the involvement of the client through the auditing of whether his data stored in the cloud is indeed intact, which can be important in achieving economies of scale for Cloud Computing. The support for data dynamics via the most general forms of data operation, such as block modification, insertion and deletion, is also a significant step toward practicality, since services in Cloud Computing are not limited to archive or backup data only. We first identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for the seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the existing proof of storage models by manipulating the classic Merkle Hash Tree construction for block tag authentication.
Keywords: Merkle Hash Tree, public auditability, homomorphic token with distributed verification, bilinear aggregate signature, localization of data error, Third Party Auditor(TPA), block tag authentication.
A Cognitive Approach to Localized Image Search from the multimedia websites
D.VENKATA BALAKRISHNA, J.VAMSI NATH Department of CSE, PBRVITS Kavali Assoc. Prof Department of CSE, PBRVITS Kavali
Abstract: This generation has potential usage of social networking web sites, like face book and picasa, filkcr, YouTube allow users to tag photos, add comment, share the data. The large-scale net genies meta-data not only facilitate users in using and arranging multimedia content, but provide useful statics to improve content searching and management. Personalized search serves as one of such examples where the web search experience is improved by generating the returned list according to the modified user search intents. In this paper, we exploit the social annotations and propose a novel framework simultaneously considering the user and query relevance to learn to personalized image search. The basic premise is to embed the user preference and query-related search intent into user-specific topic spaces. Since the users' original annotation is too sparse for topic modeling, we need to enrich users' annotation pool before user-specific topic spaces construction. The proposed framework contains two components: 1) A Ranking based Multi-correlation Tensor Factorization model is proposed to perform annotation prediction, which is considered as users' potential annotations for the images; 2) We introduce User-specific Topic Modeling to map the query relevance and user preference into the same user-specific topic space. For performance evaluation, two resources involved with users' social activities are employed. Experiments on a large-scale Flickr dataset demonstrate the effectiveness of the proposed method.
Keywords: Personalized image search, tensor factorization, topic model, social annotation.
Effect Of Voiced Consonants On Emg Signals Generated In Zygomaticus Muscles
HIMANSHU RAINA, RANDHIR SINGH, PARVEEN LEHANA M.Tech, Department ECE, Shri Sai College of Engineering and Technology, Pathankot, India HOD, Dept ECE, Shri Sai College of Engineering and Technology, Pathankot, India Associate Professor, Dept of Physics and Electronics, University of Jammu, India
Abstract: Speech is natural form of communication between human. Speech signals are non stationery signals. During speech generation contraction and relaxation of the muscles are controlled by the nervous system. This action generates one of the biomedical signals known as EMG. These signals are complicated and depend upon the anatomical and physiological properties of muscles. Facial EMG is recorded for speech recognition and system automation. EMG signals are generally recorded using small surface electrodes placed near to each other. EMG activity is frequently recorded from specific muscles and plays a prominent role in the expression of elementary emotions and speech generation. The present research paper investigates the EMG patterns generated during the utterance of the unvoiced consonants. Six subjects in the age of 20-25 years were taken (three males and three females). Thirty eight vowel-consonant-vowel (VCV) syllables in Hindi were recorded along with the corresponding facial EMG signal. For each speaker, the means of log-spectral-distances (LSD) between the EMG signal of the VCVs and the reference EMG signal were computed. Analysis of the spectrograms and LSD showed that the EMG signals generated in the muscle vary with the subject and the VCV. Female subjects showed high value in standard deviation and mean value calculated for EMG signal. Hence, for automatic decoding of the EMG signals, the system should be trained using both the variants.
Vision Based Wildfire Detection Using Bayesian Decision Fusion Framework
ABIDHA T.E., PAUL P.MATHAI, DIVYA MICHAEL Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi University, Kottayam, India Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi University, Kottayam, India Department of Computer Science & Engineering, Federal Institute of Science and Technology, Angamaly Affiliated to Mahatma Gandhi Uni
Abstract: Computational vision-based fire and flame detection has drawn significant attention in the past decade with camera surveillance systems becoming ubiquitous. Several signal and image processing methods are developed for the detection of fire, flames and smoke in large and open spaces with a range of up to 30 meters to the surveillance camera in visible-range video. This paper proposes a new approach to vision-based wildfire smoke detection by using a compound algorithm and a decision fusion framework with Bayesian classifier as classification tool. The compound algorithm is a combination of several sub-algorithms, the fusion network is to fuse the outputs obtained by each of these sub-algorithms and finally a Bayesian classifier is used for distinguishing fire regions from non-fire regions. This technique is to improve the accuracy of wildfire smoke detection in videos and to reduce the false alarm rate to a great extent.
Spike Detection in Biomedical Signal Like Eeg And Ecg Using TEO
VAIBHAV SHARMA, MANISH RANA Student, ECE, I.S.T.K., Jagadhri, India Assistant Professor, I.S.T.K.., ECE, Jagadhri, India
Abstract: We propose a novel approach aimed at adaptively setting the threshold of the smoothed Teagor energy operator (STEO) detector to be used in extracellular recording of neural signals. Many types of spike detectors have been proposed all with their advantages and drawbacks. Most of the times there is a trade off between simplicity and performance. The performance of such systems is generally gauged by correct detections and false alarms. The Teagor energy operator is a time frequency analyser that gives high output when both instantaneous amplitude and frequency are high (typical characteristics of the spikes), that is why it is very effective in detecting spikes. The basic TEO gives output after processing three consecutive samples of data, but for signals with high frequency noise it gives more false alarms than the correct detections. To overcome this problem the MTEO (multiresolution TEO) has been proposed. It is observed that for the best performance of any algorithm optimal decision threshold is required. In this we fixed the threshold of MTEO detector based on these parameters and a constant that depends on the tolerance for false alarms. Setting the decision threshold in this way increases the detection performance. If we have some prior knowledge about the spike shape, we can first apply wavelet transform on the signal using suitable mother wavelet and then apply TEO to get better results.
Keywords: Adaptive threshold, robust theory, spike detection, Teagor energy operator.
A.SEETHAI, 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: Structural collapse disasters routinely inspire sympathy not only for victims and their families, but also for heroic personnel who are faced with a tremendously complex, hazardous and often frustrating task environment. Military operations and rescue activities in the aftermath of recent earthquakes and bombings indicate a tremendous need for greater access. Recent developments in the remote inspection industry show great potential for employment of small robotic micro- rover systems in expanded roles for urban search and rescue. This paper discusses key issues in the application of robotic systems to search and rescue activities and discusses ongoing development of a knowledge-based for efficient management of automated search assets. It is designed to provide a robotic system that can combat in wars and other military purposes. In this paper, we propose a vision based technique that can be employed in case of hazardous condition where human beings cannot be employed. The main aim is to operate the robot which can work automatically on an object with a mechanical linkage. It identifies the intruders by using facial recognition technique. First using the technique of artificial intelligence the changes in the environment like fire, pit, obstacles, bomb and human live body are recognized. The robot is controlled from a remote location in addition to remote monitoring. The development of this application uses an 8051 microcontroller which is developed to control the peripheral devices using the sensors such as passive infrared sensor, light dependent resistor and thermostat. The robot is expected to perform various works like moving forward, reverse, left and right with super intelligence technology like detecting the obstacle, bomb, metal, fire and also for detecting pits. The microcontroller gets all the input from the sensors and controls the robot according to it. The Zigbee technology is used to communicate with the robot in remote location.
Design Implementation of a Novel Technique in Virtualization to Reduce E-Waste
SOMAYAJI SIVA RAMA KRISHNAN, KARTHIK BALASUBRAMANIAN, SHRUTHI REDDY MUDIREDDY School of Information Technology and Engineering, VIT University, Vellore, India School of Electrical Engineering, VIT University, Vellore, India School of Computer Science and Engineering, VIT University, Vellore, India
Abstract: In today‟s IT industry, E-waste management is one of the main burning issues which are the biggest problem for the IT industry as well as for environmental concerns. Recycling of E-waste and lesser production of new electronic product comes under E-waste management. Aggregation of E-waste generates various problems such as environmental pollution, resource shortage, loss of precious elements and also affects the human health. This in turn makes sustainable development hard and makes the ideology behind implementation of a greener IT inconsistent and impossible to achieve. Reduction in the manufacturing cost of new products and proper utilization of e-waste is possible by e-waste management. Along with the current methodology of recycling e-waste, the rising trend of Virtualization, Cloud computing, Carbon reduction and various other new technologies are used for e-waste management. This paper highlights the hazards of E-wastes, the need for its appropriate management and we also propose a novel technique for process management in virtualization which in turn helps to reduce e-waste.
Adhoc On-Demand Distance Vector Protocol for Energy Efficiency
ABHILASH C S, ABHISHEK VARSHNEY, DILIP S, NAVIK YOGESH LALJIBHAI, PRADYOT H ADAVI M.Tech student, Department of Networking and Communication, I.I.I.T.B., Bangalore, India M.Tech student, Department of Computer Science, I.I.I.T.B., Bangalore, India M.Tech student, Department of Embedded Systems, I.I.I.T.B., Bangalore, India
Abstract: The use of computer networks is drastically growing and the need for enhancing the existing network protocols and enforcing communication security thus is increasing. Tools like network simulators are used by researchers in order to test new scenarios and protocols in a controlled and reproducible environment. They allow the user to represent various topologies, simulate network traffic using different protocols, visualize the network and measure the performances. Although they are very useful, most of the widely used network simulators do not scale. Trying to simulate medium to large networks will result in a long simulation time unsuitable for investigating protocols. Some of the current network simulators implement various methods for accelerating the simulations by means of using parallel computation or changing the data representation of the nodes. However, most of the optimization techniques require additional hardware resources as a computational grid or cluster and deep knowledge of the structure of the simulator. A wide assortment of network simulators are available and most of them share the same issues when it comes to computation time and scalability. Simulating a network of 100 nodes on a normal CPU using standard simulator takes a long time. In this project we try to alleviate these problems by building a simulator on a Graphical Processing Unit [GPU] based on parallel execution on using the CUDA programming model developed by nVIDIA.
PIYUSH.V.GATTANI, DR.C.S.WARNEKAR M Tech Scholar, Department of Computer Science, RCOEM, Nagpur, India Sr. Professor, Department of Computer Science, JIT, Nagpur, India
Abstract: Digital Watermarking is a method of embedding & extracting some identification information directly into digital carrier such that it does not affect its original document contents. This Paper illustrates various techniques used for such Watermarking especially for Colour images.
Keywords: Digital water-marking, SVD, DCT, DWT, NCC .
Design and Bandwidth Enhancement of Rectangular Microstrip Patch Antenna using Double H-Slot Technique for Broadband Applications
ARUN K. SAURABH, SUNIL KUMAR, D. K. SRIVASTAVA M.Tech Student, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India M.Tech Student, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India Associate Professor, ECE, Bundelkhand Institute of Engineering and Technology, Jhansi, Uttar Pradesh, India
Comparative Study of AODV, DSDV and DSR Routing Protocols in MANET Using Network Simulator-2
V. RAJESHKUMAR, P.SIVAKUMAR PG Scholar Dept. of ECE, SKP Engineering College, India Professor Dept. of ECE, SKP Engineering College, India
Abstract: Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that dynamically form a network temporarily without any support of central management. Moreover, Every node in MANET moves arbitrarily making the multi-hop network topology to change randomly at uncertain times. There are several familiar routing protocols like AODV,DSR,DSDV etc… which have been proposed for providing communication among all the nodes in the wireless network. This paper presents a performance comparison and study of reactive and proactive protocols AODV,DSR and DSDV based on metrics such as throughput, control overhead ,packet delivery ratio and average end-to-end delay by using the NS-2 simulator.
Design Of Multiband Microstrip Radiating Structure For C Band Application
MR. MUKTESH P. SHAH, PROF. SHOBHIT K. PATEL, PROF. MAYANK A. ARDESHANA, MR. JIGAR M. PATEL G. H. Patel College of Engineering and Technology, V.V.Nagar, Gujarat, India Charotar University of Science and Technology, Changa, Gujarat, India Bhailalbhai & Bhikhabhai Institute of Technology, V.V.Nagar, Gujarat, India
Abstract: In this paper Multiband microstrip patch antenna is designed and analyzed. Our Main objective to design this antenna is to achieve multiband applications which are required in today's scenario. Here, Patch of dimension 48Ă—48mm2 is analyzed. This design has eight bands but out of which we have four working bands centered around 4586 MHz, 5300 MHz, 6480 MHz and 7350 MHz which can be used for multiband application purposes. Design results of VSWR, Return loss S11, Total Gain and Total Directivity is shown in this paper. Design results are obtained by a HFSS 11 (High Frequency Structure Simulator) which is used for simulating microwave passive components.
BASANTI B. SAWANT, M.TALIB, SAGAR S.JONDHALE, PRADEEP M. PATIL Ph.D student, North Maharashtra University, Jalgaon, Maharashtra, India Assistant Professor, UICT, North Maharashtra University, Jalgaon, Maharashtra, India Director, Samarth Samaj, Dombivli, Maharashta, India Director, RMD Sinhgad Technical Institutes Campus, Pune, Maharashtra, India
Abstract: In this paper we have proposed a novel person identification system that uses palmprint features extracted by using Radon transform. The palmprint image has been viewed as a texture image. The local features from the extracted ROI of a palmprint represent the texture information present in the palmprint image in better sense. Radon transform computes the line integral along parallel paths in a certain direction. Here we have computed line integrals of the palmprint image at 60 different directions ranging from 0-180 degree with the interval of 3 degree. These feature vectors of size 185Ă—60 have been used as the feature map. Performance of the proposed algorithm has been tested using PolyU database and the in-house generated database. Maximum recognition accuracy of 95.60% for PolyU palmprint database and that of 97.20% for the in-house generated palmprint images have been achieved with the algorithm. The algorithm is computationally efficient as the testing time required is 0.86 sec.
Keywords: palmprints, Radon transform, region of interest, Euclidian distance.
Design and Implementation of Black-hole Attacks in AODV Routing Protocol for Mobile Ad-hoc Networks
P.GOWRISANKAR, N.SRINIVASULU, DR.CH.BALASWAMY Student, ECE Department, QIS College of Engineering and Technology, Ongole, India Student, ECE Department, JNTU College of Engineering, Hyderabad, India Prof& HOD, ECE Department, QIS College of Engineering and Technology, Ongole, India
Abstract: A black hole attack is a severe attack that can be easily employed against routing in mobile ad-hoc networks. A black hole is a malicious node that falsely replies for any route requests without having active route to specified destination and drops all the receiving packets. If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack. In this paper, we are implementing Black hole attack considering the routing protocol: Ad-hoc On Demand Vector Routing Protocol (AODV) evaluate the network performance metrics like throughput, First route failure lifetime, Packet-Delivery Ratio, Average end-end Delay, Drop rate. The Experiment show that (1) Implementation of AODV for MANET without Black hole attacks (2) AODV for MANET suffers from Co- Operative Black hole attack (3) Comparison of AODV without Black hole attacks and with Black hole attacks in terms of Network Performance Metrics.
Keywords: MANET, Black hole attack, Network Performance , Security, Throughput, Packet loss and Packet Delivery Ratio.
Human Ear Identification using Vector Quantization Algorithms
DR. H.B.KEKRE, UNNATI THAPAR, NEIL PARMAR Senior Professor, Department of Computer Engineering, MPSTME, NMIMS University, Mumbai, India Student, Department of Information Technology, MPSTME, NMIMS University, Mumbai, India Student, Department of Information Technology, MPSTME, NMIMS University, Mumbai, India
Abstract: Biometrics refers to the identification of humans by their characteristics or traits. An important aspect of the characteristic is that it should be unique for every individual to enable identification by a biometric system. In this research paper, human ear has been used as a suitable characteristic for identification purposes. A raw image is taken an input and an edge detection operator has been used for enhancement to obtain the region of interest. Several Vector Quantization algorithms such as Linde-Buzo-Gray (LBG), Kekre‟s Error Vector Rotation (KEVR), Kekre‟s Median Codebook Generation (KMCG) and Kekre‟s Fast Codebook Generation (KFCG) have been applied to extract the unique features. The same process has been applied to another database containing images of the same ears for testing purposes. For each algorithm, accuracy has been calculated based on the number of correct identifications. The performance, accuracy and complexity of the algorithms are compared.
Performance Evaluation of Diffusion Method for load balancing in Distributed Environment
JAVED HUSSAIN, DURGESH KUMAR MISHRA Computer Centre, Vikram University, Ujjain, India and Research Scholar, Mewar University, Chittorgarh, India Department of Computer Science and Engineering, Shri Aurobindo Institute of Technology, Indore, India
Abstract: In this paper, we study about diffusion load balancing algorithms with their implementation. Our analysis is based on different topologies in simulated environment. The purpose of load balancing algorithm is to distribute the excess load of processor to lightly loaded processor. The objective of this analysis is to find out best stable network amongst chain, 2D and 3D Mesh networks in this diffusion method approach. We analyzed load balancing algorithm based on the diffusion method which tends to balance a processor and its neighbors to achieve stability in a network. Simulation result has shown better performed network among chain, 2D, 3D networks.
Index term -Diffusion, Load Balancing, Chain, 2D, 3D Network, Topology, Algorithm.
Effective Pre-Processing Activities in Text Mining using Improved Porter's Stemming Algorithm
C.RAMASUBRAMANIAN, R.RAMYA PG Student, ANNA UNIVERSITY, Nodal Center- Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of IT, Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India
Abstract: Text Databases are rapidly growing due to the increasing amount of information available in various electronic forms. User need to access relevant information across multiple documents. Initial process in Text Mining system is Pre- Processing steps. Our approach to make an effective Pre-Processing steps to save both space and time requirements by using improved Stemming Algorithm. Stemming algorithms are used to transform the words in texts into their grammatical root form. Several algorithms exist with different techniques. The most widely used stemming algorithm is "M.F Porter stemming algorithm. However, it still has certain drawbacks of handling Named Entities. Our paper is to improve its structure by refining with certain constraints, so that improve the Information Retrieval System's Efficiency. Thus our paper is demonstrate how we can effectively overcome the problem of Named Entity during stemming process.
Low-power Hybrid CAM for High speed route Lookup Engines
Mr. K. SURESH KUMAR, Dr. Y.RAJASREE RAO, Dr. K.MANJUNATHACHARI ECE, SSJ Engineering College, Hyderabad, India ECE, SRIDEVI WOMEN'S Engg College, Hyderabad, India GITAM University, Hyderabad campus, India
Abstract: Content-addressable memory (CAM) is a hardware table that can compare the search data with all the stored data in parallel. Due to the parallel comparison feature where a large amount of transistors are active on each lookup, however, the power consumption of CAM is usually considerable. This paper presents a hybrid-type CAM design which aims to combine the performance advantage of the NOR-type CAM with the power efficiency of the NAND-type CAM. In our design, a CAM word is divided into two segments, and then all the CAM cells are decoupled from the match line. By minimizing both the match line capacitances and switching activities, our design can largely reduce the power consumption of CAM. The experimental results show that the hybrid-type CAM can reduce the search energy consumption by roughly 89% compared to the traditional NOR-type CAM. Because the hybrid-type CAM provides a fast pull- down path to speed up the lightweight match line discharge, the search performance of our design is even better than that of the traditional NOR-type CAM.
Study of Election Algorithm in Anonymous System and Improvements in Ring Election Algorithm
S. G. SHIKALPURE, PRIYANKA D. BHUTE Assistant Professor, CSE, Govt. College of Engineering, Aurangabad, India Research Student, CSE, Govt. College of Engineering, Aurangabad, Indiaa
Abstract: In distributed system (DS), election algorithm plays an important role which helps to elect the coordinate among various processes. It has been studied that there is no any election algorithm to elect the coordinate in the anonymous system. In this paper author will propose an election algorithm for an anonymous system which is based on probabilistic model and bully election algorithm. Along with this, authors will propose bidirectional ring election algorithm with proper performance parameter.
A framework for automatic Script-to-Movie production
C.NITHYA, M.PRIYADHARSINI II.M.Tech(Multimedia Technology), KSR College of Engineering, Erode, India Assistant Professor, Department of Computer Science, KSR College of engineering, Erode, India
Abstract: In past, a production of movie was a highly professional work. It needs some more team work, advanced devices, techniques, time and money investment. A new technique is introduced called script - to - movie composition, for the automatic production of movie according to the user's designed script. This makes easy editing and filming for the producers. To make a new movie, a video database is maintained with the semantic description, about the different characters in various time and places. By using this S2M composition, the semantic story plot and syntactic visual content are identified as a video segment to narrate the user designed script.
Keywords: movie composition, semantic story plot, syntactic visual content, video database.
Secured Multi Message Authentication Protocol for Vehicular Communication
C.SELVALAKSHMI, N.SENTHIL MADASAMY, T.PANDIARAJAN PG Student, ANNA UNIVERSITY, Nodal Center- Kamaraj College Of Engineering & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of IT, Kamaraj College of Eng & Technology, Virudhunagar, Tamilnadu, India Assistant Professor, Depatrment of CSE, P.T.R College of Engineering & Technology, Madurai, Tamilnadu, IndiaIndia
Abstract: VANETs are a subset of mobile ad hoc networks composed of network-equipped vehicles and infrastructure points, which will allow vehicles to communicate with other vehicles and with roadside infrastructure points. The method agreed upon for confidentiality and authenticity by the IEEE 1609 working group is a public key infrastructure (PKI) system. An important part of any PKI system is the revocation of certificates. The revocation process, as well as the time taken for revocation process by Trusted Authority, is an open problem for VANETs. A Trusted Authority, which is responsible for providing anonymous certificates and distributing secret keys to all OBUs in the network. So that communication overheads and consumes delay in message authentication. Hence Secured Multi Message Authentication protocol(SM-MAP) for vehicular communication is proposed. To solve this problem, an efficient way for any On-Board Units (OBUs) to update its certificate from the available infrastructure Road-Side Units (RSUs) in a timely manner. In addition, the SM-MAP introduces batch verification technique for authenticating messages, which significantly decreases the verification overhead. Moreover the scheme achieves excellent security and efficiency for vehicular communications.
Zero Watermarking Using Sectional Obfuscation Scheme and Stealthy Code Obfuscation Technique
MS. R.SARANYA MRS. R.ARTHY PG Student, ANNA UNIVERSITY, Nodal Centre- Kamaraj College Of Engineering & Technology Assistant Professor, Department of IT, Kamaraj College Of Engineering & Technology
Abstract: Stealing of Watermarks is a fashionable trend in the scientific field ,the most common medium for exchange of information used is the plain text which suffers from tampering attacks. There are very limited techniques available for plain text watermarking and authentication. The traditionally used methods are obfuscation and watermarking. In order to overcome such limitation the concept of code obfuscation and zero watermarking are combined. The use of opaque predicates as one of the building blocks of obfuscating transformation conceals the control flow of the program in the protection of intellectual property. By this the ownership of the software products can be proved, which increases the security level of the software to a greater extend.
Keywords: obfuscation, software security, zero water marking, authentication.
Secure Network Coding Approach with Distributed Reprogramming Protocol for Cluster Based Ad-hoc Networks in Dynamic Key Management of Wireless Sensor Networks
PRIYANKA MANHAS, PARMINDER KAUR Student, Department of Computer Science & Engineering, Chandigarh University (Gharuan, Mohali), India Assistant Professor, Department of Computer Science & Engg., Chandigarh University (Gharuan, Mohali), India
Abstract: network coding provide set of secure protocols that rely on simple network coding operations to provide a robust and low-complexity solution for sharing secret keys among sensor nodes, including pairwise keys, cluster keys, key revocation, and mobile node authentication. We consider the problem of secret key distribution in a sensor network with multiple scattered sensor nodes. Our results include performance evaluation in terms of security metrics and a detailed analysis of resource utilization. For security reasons, every code update must be authenticated to prevent an adversary from installing malicious code in the network. All existing reprogramming protocols are based on the centralized approach in which only the base station has the authority to initiate reprogramming. it is desirable and sometimes necessary for multiple authorized network users to simultaneously and directly reprogram sensor nodes without involving the base station, which is referred to as distributed reprogramming. In this case, the network owner can also assign different reprogramming privileges to different users. Motivated by this consideration, we develop a secure and distributed reprogramming protocol named SDRP, The protocol uses identity-based cryptography to secure the reprogramming and to reduce the communication and storage requirements of each node. we address key management in cluster-based mobile ad hoc networks (MANETs). Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. It eliminates the need for certificate-based authenticated publickey distribution and provides an efficient mechanism for key update and key revocation schemes, which leads to more suitable, economic, adaptable, scalable, and autonomous key management for mobile ad hoc networks. Many schemes, referred to as static schemes, have adopted the principle of key predistribution with the underlying assumption of a relatively static short-lived network. An emerging class of schemes, dynamic key management schemes, assumes long-lived networks with more frequent addition of new nodes, thus requiring network rekeying for sustained security and survivability. The theoretical analysyes demonstrates the security properties of the protocol, but we also implement it in a network of resource limited sensor nodes to show its high efficiency in wireless sensor networks.
Keywords: Authentication, ID-Based Cryptography, Key Management, Mobile Ad Hoc Network, Network Coding, Reprogramming, Secret Key Distribution, Sensor Networks, Secret Sharing ,Security, Wireless Sensor Networks (Wsns)I
