Browsing by Author "Dixit, B."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    Effect of deposition time on the characteristics of high phosphorous nickel deposit, deposited using electroless route
    (2012) Reddy, V.R.; Dixit, B.; Udaya, Bhat, K.
    Electroless Ni-high P alloy is deposited on commercial aluminium. Parameters are set so that deposit will be crystalline in nature with a very high phosphorous content. Deposition time is the variable. It is observed that all the deposits have nodular morphology indicating nucleation and growth phenomena. The nodules become coarse with increase in the deposition time. The deposit changes from clear crystalline to nanocrystalline with increase in deposition time. Coatings with lower deposition times have porosity in it. � (2012) Trans Tech Publications.
  • No Thumbnail Available
    Item
    Effect of deposition time on the characteristics of high phosphorous nickel deposit, deposited using electroless route
    (Trans Tech Publications Ltd ttp@transtec.ch, 2012) Reddy, V.R.; Dixit, B.; Bhat, K.
    Electroless Ni-high P alloy is deposited on commercial aluminium. Parameters are set so that deposit will be crystalline in nature with a very high phosphorous content. Deposition time is the variable. It is observed that all the deposits have nodular morphology indicating nucleation and growth phenomena. The nodules become coarse with increase in the deposition time. The deposit changes from clear crystalline to nanocrystalline with increase in deposition time. Coatings with lower deposition times have porosity in it. © (2012) Trans Tech Publications.
  • No Thumbnail Available
    Item
    Optimizing set of paths connecting multiple source-sink pairs
    (2017) Agrawal, A.; Dixit, B.; Karve, V.U.; Chandavarkar, B.R.
    In this paper we aim to propose an algorithm for finding the most optimal path with some must-include nodes. The algorithm will be used to look for the best path that includes all the required nodes arranged in static topology in the most cost efficient way while keeping in mind the given constraint. We have developed the algorithm for nodes, where information about all nearby nodes is available beforehand. The main aim of the algorithm is to get the optimal paths between nodes with the given constraints. After getting all optimal paths, the algorithm will use a heuristic function to determine the best path out of the all paths as the final path. The main aim of our proposed methodology is to minimize the input resources to achieve the maximum output. For doing this we have proposed a method to combine multiple paths from a source to sink in one single optimal path, thus reducing the number of paths and achieving the same output. For developing this algorithm we have used concepts of graph theory, combinatorial optimizations and well known approach of Knuth for finding exact cover for given graph. � 2016 IEEE.
  • No Thumbnail Available
    Item
    Optimizing set of paths connecting multiple source-sink pairs
    (Institute of Electrical and Electronics Engineers Inc., 2017) Agrawal, A.; Dixit, B.; Karve, V.U.; Chandavarkar, B.R.
    In this paper we aim to propose an algorithm for finding the most optimal path with some must-include nodes. The algorithm will be used to look for the best path that includes all the required nodes arranged in static topology in the most cost efficient way while keeping in mind the given constraint. We have developed the algorithm for nodes, where information about all nearby nodes is available beforehand. The main aim of the algorithm is to get the optimal paths between nodes with the given constraints. After getting all optimal paths, the algorithm will use a heuristic function to determine the best path out of the all paths as the final path. The main aim of our proposed methodology is to minimize the input resources to achieve the maximum output. For doing this we have proposed a method to combine multiple paths from a source to sink in one single optimal path, thus reducing the number of paths and achieving the same output. For developing this algorithm we have used concepts of graph theory, combinatorial optimizations and well known approach of Knuth for finding exact cover for given graph. © 2016 IEEE.