Entity

Time filter

Source Type

New Delhi, India

Nagal R.,ASET | Kumar P.,Amity University | Bansal P.,MSIT
Proceedings of the 5th International Conference on Confluence 2014: The Next Generation Information Technology Summit | Year: 2014

This paper presents the implementation of adaptive algorithms like Least Mean Square (LMS) and Normalized Least Mean Square (NLMS) in the frequency domain and their comparison to that implemented in the time domain. Adaptive filtering using adaptive algorithm in frequency domain can be done by taking Fourier Transform of input signal and independent weigh coefficient. By frequency domain approach significant reduction in mathematical computation has been achieved. An expression for updating the weights is implemented in the frequency domain and statistical analysis has been performed. The SNR (Signal to Noise Ratio) is a parameter used to evaluate the performance with different step size. The signal power and noise power has also been calculated using MATLAB. The SNR of output signal rises about 8-9 times in frequency domain than the time domain. © 2014 IEEE. Source


Tushir M.,MSIT | Srivastava S.,NSIT
Applied Soft Computing Journal | Year: 2010

A possibilistic approach was initially proposed for c-means clustering. Although the possibilistic approach is sound, this algorithm tends to find identical clusters. To overcome this shortcoming, a possibilistic Fuzzy c-means algorithm (PFCM) was proposed which produced memberships and possibilities simultaneously, along with the cluster centers. PFCM addresses the noise sensitivity defect of Fuzzy c-means (FCM) and overcomes the coincident cluster problem of possibilistic c-means (PCM). Here we propose a new model called Kernel-based hybrid c-means clustering (KPFCM) where PFCM is extended by adopting a Kernel induced metric in the data space to replace the original Euclidean norm metric. Use of Kernel function makes it possible to cluster data that is linearly non-separable in the original space into homogeneous groups in the transformed high dimensional space. From our experiments, we found that different Kernels with different Kernel widths lead to different clustering results. Thus a key point is to choose an appropriate Kernel width. We have also proposed a simple approach to determine the appropriate values for the Kernel width. The performance of the proposed method has been extensively compared with a few state of the art clustering techniques over a test suit of several artificial and real life data sets. Based on computer simulations, we have shown that our model gives better results than the previous models. © 2009 Elsevier B.V. All rights reserved. Source


Gahlawat M.,Deenbandhu Chhotu Ram University of Science and Technology | Malik A.,Deenbandhu Chhotu Ram University of Science and Technology | Bansal P.,MSIT
Biologically Inspired Cognitive Architectures | Year: 2016

Synthesis of natural sounding speech is state of the art in the field of speech technology. Imitation of the dynamic human voice is required to generate this. The aim of this work is to develop and deploy a natural speech synthesizer for visually impaired persons. The synthesizer has been developed via an integrated approach of adding localization in expressive speech using a personalized speech corpus. A genetic algorithm has been implemented for optimal selection of acoustic phonetic units of speech. This concept has many applications. We tested one of those applications here in different aspects. Its performance is compared on various categories of listeners using a subjective listening test. Encouraging results on various parameters are received from visually impaired listeners. © 2015 Elsevier B.V. All rights reserved. Source


Chaturvedi K.K.,University of Delhi | Sing V.B.,University of Delhi | Singh P.,MSIT
Proceedings of the 2013 13th International Conference on Computational Science and Its Applications, ICCSA 2013 | Year: 2013

Mining software repositories (MSR) is an important area of research. An international workshop on MSR has been established under the umbrella of international conference on software engineering (ICSE) in year 2004. The quality papers received and presented in the workshop has led to initiate full-fledged conference which purely focuses on issues related to mining software engineering data since 2007. This paper is the result of reviewing all the papers published in the proceedings of the conferences on Mining Software Repositories (MSR) and in other related conference/journals. We have analyzed the papers that contained experimental analysis of software projects related to data mining in software engineering. We have identified the data sets, techniques and tools used/ developed/ proposed in these papers. More than half of the papers are involved in the task accomplished by building or using the data mining tools to mine the software engineering data. It is apparent from the results obtained by analyzing these papers that MSR authors process the raw data which in general publicly available. We categorizes different tools used in MSR on the basis of newly developed, traditional data mining tools, prototype developed and scripts. We have shown the type of mining task that has been performed by using these tools along with the datasets used in these studies. © 2013 IEEE. Source


Nath R.,Kurukshetra University | Kumar N.,MSIT
AIP Conference Proceedings | Year: 2011

Search Engine gives an ordered list of web search results in response to a user query, wherein the important pages are usually displayed at the top with less important ones afterwards. It may be possible that the user may have to look for many screen results to get the required documents. In literatures, many page ranking algorithms has been given to find the page rank of a page. For example PageRank is considered in this work. This algorithm treats all the links equally when distributing rank scores. That's why this algorithm some time gives equal importance to all the pages. But in real this can not be happen because, if two pages have same rank then how we can judge which page is more important then other. So this paper proposes another idea to organize the search results and describe which page is more important when confliction of same rank is produced by the PageRank. So that the user can get more relevant and important results easily and in a short span of time. © 2011 American Institute of Physics. Source

Discover hidden collaborations