New Delhi, India

Guru Tegh Bahadur Institute of Technology is an Indian engineering college affiliated to Guru Gobind Singh Indraprastha University. It was established in 1999 by the Delhi Sikh Gurudwara Management Committee . GTBIT is a degree level technical institute, approved by the AICTE. Wikipedia.


Time filter

Source Type

Gupta M.,Netaji Subhas Institute of Technology | Jain M.,Guru Tegh Bahadur Institute of Technology | Kumar B.,Bhagwan Parshuram Institute of Technology
IET Signal Processing | Year: 2010

Designs of wideband recursive digital integrators and differentiators are presented. The integrators are obtained by interpolating some of the popular digital integration techniques. The procedure consists of obtaining an integrator and then modifying its transfer function appropriately to get a stable differentiator. The proposed integrators and differentiators accurately approximate the ideal integrator and ideal differentiator over the whole Nyquist frequency range and compare favourably with the existing integrators and differentiators. The suggested integrators and differentiators are of third-order and highly suitable for real-time applications, where linear phase property is not necessary. © 2010 The Institution of Engineering and Technology.


Gupta M.,Netaji Subhas Institute of Technology | Jain M.,Guru Tegh Bahadur Institute of Technology | Kumar B.,Bhagwan Parshuram Institute of Technology
International Journal of Circuit Theory and Applications | Year: 2011

In this paper a novel wideband recursive digital integrator and differentiator is presented. The integrator is obtained by interpolating three digital integration techniques and the new differentiator is obtained by modifying its transfer function appropriately. Both the integrator and the differentiator are of third order and highly accurate, thus suitable for real-time applications. © 2010 John Wiley & Sons, Ltd.


Kumar V.,Telecom and Data Communication Business Unit | Sharma A.,Krishna Institute of Engineering and Technology | Kumar R.,Thapar University | Grover P.S.,Guru Tegh Bahadur Institute of Technology
Software - Practice and Experience | Year: 2012

In component-based development, software systems are built by assembling components already developed and prepared for integration. To estimate the quality of components, complexity, reusability, dependability, and maintainability are the key aspects. The quality of an individual component influences the quality of the overall system. Therefore, there is a strong need to select the best quality component, both from functional and nonfunctional aspects. The present paper produces a critical analysis of metrics for various quality aspects for components and component-based systems. These aspects include four main quality factors: complexity, dependency, reusability, and maintainability. A systematic study is applied to find as much literature as possible. A total of 49 papers were found suitable after a defined search criteria. The analysis provided in this paper has a different objective as we focused on efficiency and practical ability of the proposed approach in the selected papers. The various key attributes from these two are defined. Each paper is evaluated based on the various key parameters viz. metrics definition, implementation technique, validation, usability, data source, comparative analysis, practicability, and extendibility. The paper critically examines various quality aspects and their metrics for component-based systems. In some papers, authors have also compared the results with other techniques. For characteristics like complexity and dependency, most of the proposed metrics are analytical. Soft computing and evolutionary approaches are either not being used or much less explored so far for these aspects, which may be the future concern for the researchers. In addition, hybrid approaches like neuro-fuzzy, neuro-genetic, etc., may also be examined for evaluation of these aspects. However, to conclude that one particular technique is better than others may not be appropriate. It may be true for one characteristic by considering different set of inputs and dataset but may not be true for the same with different inputs. The intension in the proposed work is to give a score for each metric proposed by the researchers based on the selected parameters, but certainly not to criticize any research contribution by authors. Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd.


Mallick B.,Thapar University | Garg D.,Thapar University | Grover P.S.,Guru Tegh Bahadur Institute of Technology
Intelligent Data Analysis | Year: 2013

Sequential pattern mining is a vital problem with broad applications. However, it is also challenging, as combinatorial high number of intermediate subsequences are generated that have to be critically examined. Most of the basic solutions are based on the assumption that the mining is performed on static database. But modern day databases are being continuously updated and are dynamic in nature. So, incremental mining of sequential patterns has become the norm. This article investigates the need for incremental mining of sequential patterns. An analytical study, focusing on the characteristics, has been made for more than twenty incremental mining algorithms. Further, we have discussed the issues associated with each of them. We infer that the better approach is incremental mining on the progressive database. The three more relevant algorithms, based on this approach, are also studied in depth along with the other work done in this area. This would give scope for future research direction. © 2013-IOS Press and the authors. All rights reserved.


Mallick B.,Thapar University | Mallick B.,Galgotias University | Garg D.,Thapar University | Grover P.S.,Guru Tegh Bahadur Institute of Technology
International Journal of Innovative Computing, Information and Control | Year: 2012

Prior researches in the field of mining sequential patterns are based on the concept of frequency and assume that the customer purchasing behavior sequences do not vary over time/purchasing money. To adapt the sequential patterns to these changes, two concepts, namely monetary and compactness, are incorporated with the conventional sequential pattern mining technique. Incorporating specific constraints with the sequential mining process has enabled the discovery of more user-centered patterns. In this paper, we incorporate two constraints, namely monetary and compactness in addition to frequency with the sequential mining process for discovering remarkable and helpful sequential patterns from sequential databases. For incorporating the constraints with the original PrefixSpan algorithm, we have presented a CFM-PrefixSpan algorithm for mining all CFM sequential patterns from the sequential database. The proposed CFM-PrefixSpan algorithm has been validated on synthetic and real sequential databases. The experimental results ensure the effectiveness of the discovered sequential patterns since purchasing money and time length were incorpora,ted with the sequential pattern mining process. © ICIC International 2012.


Mallick B.,Thapar University | Garg D.,Thapar University | Grover P.S.,Guru Tegh Bahadur Institute of Technology
International Journal of Computational Intelligence Systems | Year: 2013

Sequential pattern mining is a vital data mining task to discover the frequently occurring patterns in sequence databases. As databases develop, the problem of maintaining sequential patterns over an extensively long period of time turn into essential, since a large number of new records may be added to a database. To reflect the current state of the database where previous sequential patterns would become irrelevant and new sequential patterns might appear, there is a need for efficient algorithms to update, maintain and manage the information discovered. Several efficient algorithms for maintaining sequential patterns have been developed. Here, we have presented an efficient algorithm to handle the maintenance problem of CFM-sequential patterns (Compact, Frequent, Monetary-constraints based sequential patterns). In order to efficiently capture the dynamic nature of data addition and deletion into the mining problem, initially, we construct the updated CFM-tree using the CFM patterns obtained from the static database. Then, the database gets updated from the distributed sources that have data which may be static, inserted, or deleted. Whenever the database is updated from the multiple sources, CFM tree is also updated by including the updated sequence. Then, the updated CFM-tree is used to mine the progressive CFM-patterns using the proposed tree pattern mining algorithm. Finally, the experimentation is carried out using the synthetic and real life distributed databases that are given to the progressive CFM-miner. The experimental results and analysis provides better results in terms of the generated number of sequential patterns, execution time and the memory usage over the existing IncSpan algorithm. © 2013 Copyright the authors.


Pandey R.S.,Amity University | Kaur R.,Guru Tegh Bahadur Institute of Technology
Advances in Space Research | Year: 2016

In present paper, field aligned whistler mode waves are analyzed, in the presence of DC field in background plasma having relativistic distribution function in the magnetosphere of Uranus. The work has been examined for relativistic Maxwellian and loss-cone distribution function. In both the cases, we have studied the effect of various plasma parameters on the growth rate of waves by using the method of characteristics and discussed using data provided by Voyager 2. Growth rate has increased by increasing the magnitude of electric field, temperature anisotropy, energy density and number density of particles for Maxwellian and loss-cone background. However, when relativistic factor λ=1-v2/c2 increases, growth rate decreases. The significant increase in real frequency of whistler waves can be observed. The results can be used for comparative study of planetary magnetospheres. The derivation can also be adapted to study various other instabilities in magnetosphere of Uranus. © 2016 COSPAR


Kumar A.,Guru Tegh Bahadur Institute of Technology
E-Journal of Chemistry | Year: 2010

Dumbbell oligonucleotides with loops of various chemistry were synthesized. Incubation of dumbbell oligonucleotides containing phosphorothioate bonds or trimethylene phosphate linkages in loops with S1 nuclease did not result in significant cleavage under conditions which led to the degradation of dumbbell oligonucleotide containing phophodiester bonds in the loops. The binding of reverse transcriptase of Moloney Murine Leukemia Virus (MoMuLV) was evaluated with all the five oligonucleotides. The protein binds to all the dumbbell oligonucleotides with similar affinity. The dissociation constants evaluated using PAGE band mobility shift assays were of the order of 10-7. The inhibitory properties of the retroviral RNase H activity was evaluated using 3H -UTPlabeled RNA:RNA-DNA hybrid. It was found that the best dumbbell oligonucleotide, inhibitor contained phosphorothioate residues in both the loops. Our value studies demonstrated that this particularly designed oligonucleotide displays an IC50 of 18 nM in its inhibition on the reverse transcriptase RNase H activity, a magnitude lower than that of first nucleotide reverse transcriptase of HIV-1, tenofovir, introduced by Gilead Science in the market.


Mukhopadhyay S.,Guru Tegh Bahadur Institute of Technology
Proceedings of 6th IEEE Power India International Conference, PIICON 2014 | Year: 2014

Indian grid now totally synchronized and working as National Grid is poised for multi-prong development. It has already implemented and has ambitious plans for Smart Grid applications in both transmission and distribution segments. With the progress in Information and Communication Technology, full advantage of it is being taken for evolving the Smart Grid. A number of measures like implementation of wide area monitoring system using phasor measurement technology, continuance of network embedding with HVDC system, etc. are the means at transmission level to achieve the goal in this respect. While integration of renewable energy sources to grid with energy storage and transmitting surplus to far-flung areas of the country through interconnection is being made possible, on distribution front due to deployment of advanced metering infrastructure, demand response enabled peak load management is being attempted. With the proliferation of electric vehicle and other modes of transportation based on electricity, further step is contemplated to take care of the same, both as load and storage with increase in number. © 2014 IEEE.


Bhardwaj A.,Guru Tegh Bahadur Institute of Technology | Kumar V.,Society for Education and Research Development
14th International Conference on Computer and Information Technology, ICCIT 2011 | Year: 2011

Cloud Computing is the long dreamed vision of computing as a utility, to provide on-demand applications and services. Users can be relieved from the burden of local data storage and maintenance by hosting their data on the clouds. With all its inherent value, the cloud introduces significant security challenges for both the consumers and cloud service providers in all the public, private, and hybrid cloud configurations. In this paper, security challenges (specifically the identity breach) for both consumers and service providers is presented. Cloud security assessment with Quantitative risk and impact framework (QUIRC) and Wide-band Delphi method have been proposed as a suitable process for collecting input from expert consensus. Major security breach incidents of the past have been discussed along with the present day cloud challenges as per the Cloud Security Alliance. A Dymanic Identity Mapping Association N Discovery System (DIMANDS) as an identity solution for large scale heterogeneous network environments is also discussed. © 2011 IEEE.

Loading Guru Tegh Bahadur Institute of Technology collaborators
Loading Guru Tegh Bahadur Institute of Technology collaborators