Conference Papers

Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506

Browse

Author: search.filters.author.Kumar, P.Has files: No

Search Results

Now showing 1 - 10 of 29
  • No Thumbnail Available
    Item
    Design and analysis of microstrip elliptical low pass filter
    (IEEE Computer Society, 2009) Kumar, P.; Chaturvedi, A.
    Design and analysis of a stepped impedance elliptical microstrip low pass filter has been described in this paper. To improve the frequency response, fractals have been proposed in the conventional design. Conventional geometry and fractalized geometry have been simulated and thus obtained results are reported and compared.
  • No Thumbnail Available
    Item
    Parallel method for discovering frequent itemsets using weighted tree approach
    (2009) Kumar, P.; Ananthanarayana, V.S.
    Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support. © 2009 IEEE.
  • No Thumbnail Available
    Item
    Discovery of weighted association rules mining
    (2010) Kumar, P.; Ananthanarayana, V.S.
    Mining of association rules for basket databases, has been investigated by [1] [3] [4], [9], [12], etc. Most of these works focus on mining binary association rules, i.e, most of the association rules mining algorithms to discover frequent itemsets do not consider the quantity in which items have been purchased. This paper discusses an efficient method for discovering a weighted association rules from a large volumes of data in a single scan of the database. The data structure used here is called Weighted Tree. We found that this algorithm is more efficient than Cai's Algorithm. ©2010 IEEE.
  • No Thumbnail Available
    Item
    Attribute -TID method for discovering sequence of attributes
    (2012) Kumar, P.; Ananthanarayana, V.S.
    The abstraction based algorithms read databases in sequential order and then construct abstraction of the database in memory. Given any database with n attributes, it is possible to read the same in n! ways. These different n! ways lead to abstractions of different sizes. In this paper, for a given a set of transactions D, we find the sequence or order of the attributes in which the database is read, a representation which is compact than PC-tree, can be obtained in the memory. © 2012 Springer-Verlag.
  • No Thumbnail Available
    Item
    Geographical location based hierarchical routing strategy for wireless sensor networks
    (2012) Kumar, P.; Chaturvedi, A.; Kulkarni, M.
    The overall performance and thus the achievable efficiency of wireless sensor networks (WSNs) rely on the type of protocols deployed to support particular application in hand. In WSN, network's lifetime depends upon the residual energy of individual nodes. In this paper; a brief survey comprises of various reported methodologies that make uses of geographical location attributes for routing in WSN is presented. To assist the routing algorithm on location aspect of the source and destination as well as other intermediate nodes; a location index is formulated based on binary encoded spatial frames. The merit of proposed spatial encoding scheme is its supportiveness on scalability aspects, so it can be easily tailored to accommodate hierarchy based network architectures. Further, the scheme incorporates an effective mechanism to select cluster heads for each cluster in such a way so as to avoid the localization of hot spot effects right from cluster level to network level. © 2012 IEEE.
  • No Thumbnail Available
    Item
    An energy efficient algorithm to avoid hot spot effects in Wireless Sensor Networks
    (IEEE Computer Society help@computer.org, 2013) Kumar, P.; Chaturvedi, A.
    In this paper, a novel approach is proposed to minimize the hot spot effect to improve the life time of Wireless Sensor Networks (WSNs) based on energy of each sensor node. To implement the proposed approach, the spatial locations of geographical area under surveillance are motioned using binary location index. The simulation work is carried out for two different case studies; in first case the sink/base station is remains stationary during entire observation, whereas in other case the sink is reallocated to appropriate locations at suitable time instants. Timely varying pattern of residual energy of all network nodes and total number of queries supported by entire network till it attains targeted life time is presented and discussed. © 2013 IEEE.
  • No Thumbnail Available
    Item
    Life time enhancement of wireless Sensor Network using fuzzy c-means clustering algorithm
    (Institute of Electrical and Electronics Engineers Inc., 2014) Kumar, P.; Chaturvedi, A.
    The major issues in wireless Sensor Networks (WSNs) are efficient uses of limited resources and appropriate routing of network paths under severely constrained energy scenarios. To overcome these issues; k-means and fuzzy c-means algorithms are investigated to form clusters and for subsequent selection of cluster heads. For all these clusters; selection of cluster head is done based on member sensor nodes residual energy status (RES) and estimation of Euclidean distances. Depending upon the Euclidean distance measure between the sink node and center of gravity of clusters; these clusters are classified into five types. Further, RES estimations are presented for cluster heads as well simple sensor network nodes. © 2014 IEEE.
  • No Thumbnail Available
    Item
    Performance analysis of energy aware routing protocol for Wireless Sensor Networks
    (Institute of Electrical and Electronics Engineers Inc., 2014) Kumar, P.; Chaturvedi, A.
    The main issues in wireless Sensor Networks (WSNs) are efficient uses of limited resources and appropriate routing of network path. To overcome these issues multiple sinks are most efficient and effective with proper routing protocols. The residual energy status of entire network nodes of single stationary and multiple sink are compared with number of queries supported and its performances are also evaluated. © 2014 IEEE.
  • No Thumbnail Available
    Item
    Performance measures of fuzzy C-means algorithm in wireless sensor networks
    (Inderscience Publishers, 2017) Kumar, P.; Chaturvedi, A.
    The major issues that govern performance of wireless sensor networks (WSNs) are efficient uses of limited resources and appropriate routing decisions of network paths under the severely constrained energy scenario. In this work, to address these issues uses of k-means and fuzzy C-means algorithms are investigated for clusters formation and subsequent selection of cluster heads (CHs). For all these newly formed clusters; selection of cluster head is done based on member sensor nodes residual energy status (RES) followed by estimation of Euclidean distances. Depending upon the Euclidean distance measures between the sink node and the estimated energy-centroid (EC) of clusters these clusters are classified into five types. The RES estimation is exercised for all the CHs and sensor nodes (SNs) of the network. Outcomes of simulation results indicate superior performance of fuzzy-c means algorithm compared to k-means algorithm. Further, a case study is presented, wherein the sink is allowed to have some movements in the service area. Here, different quadrant of service area exhibits different pattern of query spatial distribution. The optimal location of sink is sought to support energy efficient operational aspects of the WSNs. © © 2017 Inderscience Enterprises Ltd.
  • No Thumbnail Available
    Item
    Effect of Heat Treatment on the High Cycle Fatigue Behaviour of S2205 Duplex Stainless Steels
    (Elsevier Ltd, 2017) Shamanth, V.; Kumar, P.; Ravishankar, K.S.
    This paper deals with the effect of heat treatment on the high cycle fatigue behavior of duplex stainless steels. In this investigation the specimens were annealed, aged, reversion heat treated and re-aged for varying periods. The results obtained showed that the microstructure plays an important role in the change in fatigue lives. The fatigue resistance was high in the aged and re-aged heat treated condition because of the presence of alpha, alpha prime and some molybdenum rich chromium nitride precipitates in their ferrite matrix. While in the annealed and reversion heat treated condition the samples were free from the precipitates and also there was no much difference in the hardness values of austenite and ferrite phases, hence there was a significant change in their fatigue lives when compared to that of the embrittled samples. © 2017 Elsevier Ltd.