vikram garg - Academia.edu (original) (raw)

Papers by vikram garg

SN Computer Science

Target searching and tracking using a swarm of robots is a classical problem in the domain of rob... more Target searching and tracking using a swarm of robots is a classical problem in the domain of robotics. The cooperation among the swarm robots has got increasing attention lately due to the different versions of the problem and complex environment. In this paper, a centralized control algorithm is proposed which utilizes cooperation among the swarm of robots for searching and tracking targets which is the velocity inspired robotic fruit fly algorithm (VRFA). The particle velocity concept of the particle swarm optimization is added to the fruit fly algorithm to improve the parameters such as local extremum and low convergence. The simulation results of the proposed technique in different scenarios demonstrate the effectiveness of the algorithm and its ability to keep tracking the targets until the exit condition matched. At last, the simulation result is shown with different environments and parameter settings.

International Journal of Computer Applications, 2016

Data mining over the web data and mining page ranking is field of interest where several research... more Data mining over the web data and mining page ranking is field of interest where several research is been performed in order to find page rank according to its acquired data. Recently different clustering, web data mining and ranking technique proposed to provide low computation time and high accuracy over the number of links provided. In this paper related technique is described and a proposed technique EPRAD for effective page rank. Mining is performed on the KDD which contain links, further the result outcome shows the proposed algorithm is efficient as compared to existing PageRank algorithm.

International Journal of Computer Applications, 2015

String matching algorithms is become one of the most important topic in the computer science worl... more String matching algorithms is become one of the most important topic in the computer science world. These algorithms are used in many real world problems like as scanning the threat in intrusion detection system, finding the pattern in text mining, match the similarity of the document in the plagiarism detection system, recognition in bio informatics and so on. String Matching Algorithms are broadly categorized into single pattern string matching and multiple pattern string matching algorithms. To get the faster solution of the problem most of the cases multiple pattern matching is the best choice. Aho-Corasick, Shift-OR, Robin Karp but Wu Manber Algorithm is better choice because it search the pattern faster(take less time) as well as occupies less space. This paper discus the various pit falls of the wu manber algorithm with their detailed explanation. Also discuss the various improved wu manber algorithm and comparison between these algorithms.

International Journal of Computer Applications, 2015

To improve user experience while accessing the, website. Web usage mining is used to evaluate use... more To improve user experience while accessing the, website. Web usage mining is used to evaluate user's previous experiences, which helps to improve functionality of that website. In this paper a technique for web usage mining is proposed, which extends features of synaptic search and Frequent Pattern Growth algorithm. Proposed technique uses synaptic search property to search data on web on the basis of location and uses FP growth algorithm to generate results.

International Journal of Computer Applications, 2015

Shortest path algorithms finds applications in large real world domains. All pair shortest path (... more Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra's algorithm is compared on dense graphs have positive edge weights ranging from 1 to 10. It is found that Dijkstra's algorithm is better than Floyd warshall algorithm in sequencial implementation. But as there is less parallelism identified in dijkstra algorithm as compared to parallel to parallel FW gives less execution time as compared to Dijkstra's.

International Journal of Computer Applications, 2015

Parallel computing becomes a need to perform task as soon as possible. This can be done in two wa... more Parallel computing becomes a need to perform task as soon as possible. This can be done in two way improve hardware or use parallel programming language i.e. improve software. Improvement in the hardware is costlier solution compared to software solution. So we have two basic heterogeneous parallel languages CUDA and OpenCL which run on both CPU and GPU according to necessity. When program does not contain high parallelism it works on CPU which contains less number of cores. On other hand program contain high degree of parallelism so each independent code runs on separate core of GPU. This paper gives the basic idea of the parallel computing and how these carried out. Explain the working of both parallel language CUDA and OpenCL with their detailed architecture. In the last section comparison of both languages is described.

International Journal of Computer Applications, 2015

Although ant is not one of those smart creatures, when swarm, however cooperate with each other w... more Although ant is not one of those smart creatures, when swarm, however cooperate with each other while foraging(in search of food) they have this great ability to unearth an optimal solution to their problem thus coming up with the shortest path from their nest to the food source in case of foraging. Ants grant excellent efficiency while solving combinatorial problems and also have the potential of combining with other algorithms with ease. This survey includes: 1) Generalized ant inspired algorithm and different applications of ant Colony Optimization (ACO). 2) Proposed parallel approaches to those applications. As ACO is intrinsically parallel so in this survey GPU implementation using OpenCL is proposed to parallel approaches and only those application areas are explored whose parallel approaches are discussed.

International Journal of Computer Applications, 2015

A survey of various link analysis and clustering algorithms such as Page Rank, Hyperlink-Induced ... more A survey of various link analysis and clustering algorithms such as Page Rank, Hyperlink-Induced Topic Search, Weighted Page Rank based on Visit of Links K-Means, Fuzzy K-Means. Ranking algorithms illustrated, Weighted Page Rank is more efficient than Hyperlink-induced Topic Search Whereas clustering algorithms has described Fuzzy Soft, Rough K-Means is a mixture of Rough K-Means and fuzzy softest and provide efficient results than Rough K-Means approach and K-means. The literature survey shows how these algorithms are used for link-analysis and extracts the information, including contents and images from web pages efficiently. In new algorithm Weighted Page Content Rank user can get relevant and important pages easily as it employs web structure mining and web content mining. A webpage ranking analysis can be apply on the scenario where the searching and interaction with the numerous web data is required, so in order to provide effective result the technique can be used.

International Journal of Computer Applications, 2015

Web data mining is an emerging research area where mining data is an important task and various a... more Web data mining is an emerging research area where mining data is an important task and various algorithms has been proposed in order to solve the various issues related to the web mining in existing dataset. This paper focuses the concept of data mining and FP-Growth algorithm. As for FP-Growth algorithm, the effectiveness is limited by internal memory size because mining process is on the base of large tree-form data structure. This Research work concentrates on web usage mining and in particular focuses on discovering the web usage patterns of web sites from the server log files. This paper finds the procedure to work with the proposed technique which can be possible to remove the drawback of limitation of the existed technique in the web mining area. The various web usages mining technique can further work on various scientific area, medical area and social media application to approach for the research and security related area. A detail and pattern growth technique can help in getting more data and further on using line up algorithm we can illustrate the data states presentation effectively.

International Journal of Computer Applications, 2015

Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard ... more Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard problem. In this paper we have proposed GPU based implementation for TSP using OpenCL based on Multi colony Ant System. A comparative analysis is done among the standard travelling salesman problem, multi colony based implementation of travelling salesman problem and GPU based implementation. It is found that GPU based implementation is most efficient in terms of execution time and average tour length.

International Journal of Computer Applications, 2015

String matching is one of the most important concept used in computer science in various real lif... more String matching is one of the most important concept used in computer science in various real life applications like as Intrusion detection system, Data mining, Plagiarism detection system. There are many string matching algorithms which help to find pattern from the text. These algorithms are categorized in single string matching and multiple string matching. The Wu-Manber (WM) algorithm is multiple patterns algorithm which is the finest string matching algorithm. The performance of WM depends on various table build in pre processing phase these are prefix table, shift table and hase table. We introduce a new algorithm namely the Efficient Wu Manber algorithm (EWM) algorithm which is advance version of Wu Manber algorithm with respect to time. Efficient Wu-Manber Algorithm eliminate the prefix table which is unused most of the cases in wu manber, construct two shift table instead of single shift table and uses nonlinear data structure i.e. AVL tree instead of linear data structure i.e. linked list used in WM in Hash table, which reduce the traversed number of nodes to find exact match. The experimental results and analysis show that EWM algorithm has better performance as compare to WM and its existing improved algorithm and also better from various string matching

SN Computer Science

Target searching and tracking using a swarm of robots is a classical problem in the domain of rob... more Target searching and tracking using a swarm of robots is a classical problem in the domain of robotics. The cooperation among the swarm robots has got increasing attention lately due to the different versions of the problem and complex environment. In this paper, a centralized control algorithm is proposed which utilizes cooperation among the swarm of robots for searching and tracking targets which is the velocity inspired robotic fruit fly algorithm (VRFA). The particle velocity concept of the particle swarm optimization is added to the fruit fly algorithm to improve the parameters such as local extremum and low convergence. The simulation results of the proposed technique in different scenarios demonstrate the effectiveness of the algorithm and its ability to keep tracking the targets until the exit condition matched. At last, the simulation result is shown with different environments and parameter settings.

International Journal of Computer Applications, 2016

Data mining over the web data and mining page ranking is field of interest where several research... more Data mining over the web data and mining page ranking is field of interest where several research is been performed in order to find page rank according to its acquired data. Recently different clustering, web data mining and ranking technique proposed to provide low computation time and high accuracy over the number of links provided. In this paper related technique is described and a proposed technique EPRAD for effective page rank. Mining is performed on the KDD which contain links, further the result outcome shows the proposed algorithm is efficient as compared to existing PageRank algorithm.

International Journal of Computer Applications, 2015

String matching algorithms is become one of the most important topic in the computer science worl... more String matching algorithms is become one of the most important topic in the computer science world. These algorithms are used in many real world problems like as scanning the threat in intrusion detection system, finding the pattern in text mining, match the similarity of the document in the plagiarism detection system, recognition in bio informatics and so on. String Matching Algorithms are broadly categorized into single pattern string matching and multiple pattern string matching algorithms. To get the faster solution of the problem most of the cases multiple pattern matching is the best choice. Aho-Corasick, Shift-OR, Robin Karp but Wu Manber Algorithm is better choice because it search the pattern faster(take less time) as well as occupies less space. This paper discus the various pit falls of the wu manber algorithm with their detailed explanation. Also discuss the various improved wu manber algorithm and comparison between these algorithms.

International Journal of Computer Applications, 2015

To improve user experience while accessing the, website. Web usage mining is used to evaluate use... more To improve user experience while accessing the, website. Web usage mining is used to evaluate user's previous experiences, which helps to improve functionality of that website. In this paper a technique for web usage mining is proposed, which extends features of synaptic search and Frequent Pattern Growth algorithm. Proposed technique uses synaptic search property to search data on web on the basis of location and uses FP growth algorithm to generate results.

International Journal of Computer Applications, 2015

Shortest path algorithms finds applications in large real world domains. All pair shortest path (... more Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra's algorithm is compared on dense graphs have positive edge weights ranging from 1 to 10. It is found that Dijkstra's algorithm is better than Floyd warshall algorithm in sequencial implementation. But as there is less parallelism identified in dijkstra algorithm as compared to parallel to parallel FW gives less execution time as compared to Dijkstra's.

International Journal of Computer Applications, 2015

Parallel computing becomes a need to perform task as soon as possible. This can be done in two wa... more Parallel computing becomes a need to perform task as soon as possible. This can be done in two way improve hardware or use parallel programming language i.e. improve software. Improvement in the hardware is costlier solution compared to software solution. So we have two basic heterogeneous parallel languages CUDA and OpenCL which run on both CPU and GPU according to necessity. When program does not contain high parallelism it works on CPU which contains less number of cores. On other hand program contain high degree of parallelism so each independent code runs on separate core of GPU. This paper gives the basic idea of the parallel computing and how these carried out. Explain the working of both parallel language CUDA and OpenCL with their detailed architecture. In the last section comparison of both languages is described.

International Journal of Computer Applications, 2015

Although ant is not one of those smart creatures, when swarm, however cooperate with each other w... more Although ant is not one of those smart creatures, when swarm, however cooperate with each other while foraging(in search of food) they have this great ability to unearth an optimal solution to their problem thus coming up with the shortest path from their nest to the food source in case of foraging. Ants grant excellent efficiency while solving combinatorial problems and also have the potential of combining with other algorithms with ease. This survey includes: 1) Generalized ant inspired algorithm and different applications of ant Colony Optimization (ACO). 2) Proposed parallel approaches to those applications. As ACO is intrinsically parallel so in this survey GPU implementation using OpenCL is proposed to parallel approaches and only those application areas are explored whose parallel approaches are discussed.

International Journal of Computer Applications, 2015

A survey of various link analysis and clustering algorithms such as Page Rank, Hyperlink-Induced ... more A survey of various link analysis and clustering algorithms such as Page Rank, Hyperlink-Induced Topic Search, Weighted Page Rank based on Visit of Links K-Means, Fuzzy K-Means. Ranking algorithms illustrated, Weighted Page Rank is more efficient than Hyperlink-induced Topic Search Whereas clustering algorithms has described Fuzzy Soft, Rough K-Means is a mixture of Rough K-Means and fuzzy softest and provide efficient results than Rough K-Means approach and K-means. The literature survey shows how these algorithms are used for link-analysis and extracts the information, including contents and images from web pages efficiently. In new algorithm Weighted Page Content Rank user can get relevant and important pages easily as it employs web structure mining and web content mining. A webpage ranking analysis can be apply on the scenario where the searching and interaction with the numerous web data is required, so in order to provide effective result the technique can be used.

International Journal of Computer Applications, 2015

Web data mining is an emerging research area where mining data is an important task and various a... more Web data mining is an emerging research area where mining data is an important task and various algorithms has been proposed in order to solve the various issues related to the web mining in existing dataset. This paper focuses the concept of data mining and FP-Growth algorithm. As for FP-Growth algorithm, the effectiveness is limited by internal memory size because mining process is on the base of large tree-form data structure. This Research work concentrates on web usage mining and in particular focuses on discovering the web usage patterns of web sites from the server log files. This paper finds the procedure to work with the proposed technique which can be possible to remove the drawback of limitation of the existed technique in the web mining area. The various web usages mining technique can further work on various scientific area, medical area and social media application to approach for the research and security related area. A detail and pattern growth technique can help in getting more data and further on using line up algorithm we can illustrate the data states presentation effectively.

International Journal of Computer Applications, 2015

Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard ... more Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard problem. In this paper we have proposed GPU based implementation for TSP using OpenCL based on Multi colony Ant System. A comparative analysis is done among the standard travelling salesman problem, multi colony based implementation of travelling salesman problem and GPU based implementation. It is found that GPU based implementation is most efficient in terms of execution time and average tour length.

International Journal of Computer Applications, 2015

String matching is one of the most important concept used in computer science in various real lif... more String matching is one of the most important concept used in computer science in various real life applications like as Intrusion detection system, Data mining, Plagiarism detection system. There are many string matching algorithms which help to find pattern from the text. These algorithms are categorized in single string matching and multiple string matching. The Wu-Manber (WM) algorithm is multiple patterns algorithm which is the finest string matching algorithm. The performance of WM depends on various table build in pre processing phase these are prefix table, shift table and hase table. We introduce a new algorithm namely the Efficient Wu Manber algorithm (EWM) algorithm which is advance version of Wu Manber algorithm with respect to time. Efficient Wu-Manber Algorithm eliminate the prefix table which is unused most of the cases in wu manber, construct two shift table instead of single shift table and uses nonlinear data structure i.e. AVL tree instead of linear data structure i.e. linked list used in WM in Hash table, which reduce the traversed number of nodes to find exact match. The experimental results and analysis show that EWM algorithm has better performance as compare to WM and its existing improved algorithm and also better from various string matching