Pradeep Kaushik - Academia.edu (original) (raw)

Uploads

Papers by Pradeep Kaushik

International Journal of Computer Applications

This paper presents a review of the application of facial emotion recognition and eye tracking te... more This paper presents a review of the application of facial emotion recognition and eye tracking technology for mentally fit intensive speech, disabled persons. It also presents a review of the augmentative and alternative communication (AAC), already developed emotion recognition systems or frameworks and some current speech disability support devices selected from the internet. Employing these techniques, the design of simplex-based automatic real-time expressive communication system to facilitate effective interpretation of thoughts of speech-disabled is advocated in this paper. While several devices are available, some with eye-tracking capability, but there is still a need for more versatile, cost-effective device or framework and the challenge is to achieve speech like a human from AAC based device.

SSRN Electronic Journal, 2019

Indian government has removed the disputed article-370 from Jammu and Kashmir. This article was a... more Indian government has removed the disputed article-370 from Jammu and Kashmir. This article was a barrier between the people of Jammu and Kashmir and rest of India. This paper presents the positive impact of the abolition of article 370 from Kashmir from the investment point of view because the state has a lack of jobs; local youth goes to other states in search of jobs.

SSRN Electronic Journal, 2019

This article presents an imagination and analysis of a solar power plant over the waste area of t... more This article presents an imagination and analysis of a solar power plant over the waste area of the Yamuna River in Delhi. Delhi is the capital of largest democracy in the world, this city has population approx 19 million [1] and pollution is one of the major problems of Delhi, so solar energy power plant is a good idea for this national capital city of India but this is national capital city and huge population reside in this city, so this city has lack of land resource. But Delhi has a river Yamuna. The total length of River Yamuna in the NCR region is 48 km, of which 22 km lies in main capital and the rest falls in the National Capital Region. So, a solar power plant can be established over the river by building pillars in the river and making a structure over these pillars and then solar panels can be installed over these structures. The flow of the river can be also maintained in this project. The whole 22 km open area can be used to set up a solar power plant, and this will produce at least 5 Megawatt electricity. This is the clean energy so it will reduce pollution and will fulfill the energy need of this city, this area is already waste (can’t be utilized for other purposes) and today, India has the technical capability to establish this kind of project.

International Journal of Computer Applications, Mar 15, 2013

In this paper we have discussed all existing approaches to solve the problem for calculating the ... more In this paper we have discussed all existing approaches to solve the problem for calculating the min-cut tree of an undirected edge-weighted graph and present a new approximation algorithm for constructing the minimum-cut tree. We discussed Gomory-Hu algorithm. The algorithm proposed by Gomory and Hu has time complexity O(V*time complexity of finding a min s-t cut). We also have discussed Ford-Fulkerson method. Running time of Ford-Fulkerson algorithm is O(ve 2). The asymptotically fastest maximumflow algorithms are based on push-relabel method and have the running time of O(V 3). M. Stoer and F. Wagner have given a simple and compact algorithm for finding the minimum cut of a graph. The algorithm is remarkably simple and has the fastest running time so far the algorithm consists of |V|-1 identical phases each of which requires O(|e| + |V| log |V|) time yielding an overall running time of O(|V||e| + log |V|). We present a new approximation algorithm for constructing the minimum cut tree. We calculate an upperbound value for each node in the graph. We define the upper bound value of each node as the value of cut which separates this node from rest of the graph and our algorithm runs in O(V 2 .logV + V 2 .d), where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sorts of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less (usually for less than 5% pairs) and for most of the pairs we obtain correct values of max-flow or min-cut.

International Journal of Computer Applications, Nov 15, 2012

Many reconstruction algorithms for binary tree have been discussed in this paper. A particular fo... more Many reconstruction algorithms for binary tree have been discussed in this paper. A particular focus of this paper is on "A new Non-Recursive Algorithm for Reconstructing a Binary Tree from its Traversals". The computation time required for executing the reconstruction algorithm are O(N) and space complexity is O(NlogN) where N is the number of nodes in the binary tree. This algorithm works well for most of the input cases, but it has some drawbacks. There are some sequences of pre-order and in-order for which no legitimate tree can be constructed but the algorithm didn't take these cases into consideration and constructed a wrong tree for these cases. In this paper, we have proposed a solution to the problem in the previous algorithm and designed an algorithm which is the modified version of the previous algorithm for generating a correct binary tree. The new modified algorithm is implemented in C language and tested in GCC Compiler in Linux, for all types of input cases. The New modified algorithm works well for all types of input cases. We have calculated the best case time complexity of modified algorithm and show that a correct tree can be reported in O(N) time in best case and O(NlogN) space where N is the number of nodes in the tree. We have discussed some applications of the new modified algorithm in Huffman Coding, compiler design, text processing and searching algorithms.

International Journal of Computer Applications, 2013

In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edg... more In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in 2 2 (.log .) O V V V d  , where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sort of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less and for most of the pairs we obtain correct values of max-flow or mincut. This algorithm is implemented in JAVA language and checked for many input cases.

International Journal of Computer Applications

This paper presents a review of the application of facial emotion recognition and eye tracking te... more This paper presents a review of the application of facial emotion recognition and eye tracking technology for mentally fit intensive speech, disabled persons. It also presents a review of the augmentative and alternative communication (AAC), already developed emotion recognition systems or frameworks and some current speech disability support devices selected from the internet. Employing these techniques, the design of simplex-based automatic real-time expressive communication system to facilitate effective interpretation of thoughts of speech-disabled is advocated in this paper. While several devices are available, some with eye-tracking capability, but there is still a need for more versatile, cost-effective device or framework and the challenge is to achieve speech like a human from AAC based device.

SSRN Electronic Journal, 2019

Indian government has removed the disputed article-370 from Jammu and Kashmir. This article was a... more Indian government has removed the disputed article-370 from Jammu and Kashmir. This article was a barrier between the people of Jammu and Kashmir and rest of India. This paper presents the positive impact of the abolition of article 370 from Kashmir from the investment point of view because the state has a lack of jobs; local youth goes to other states in search of jobs.

SSRN Electronic Journal, 2019

This article presents an imagination and analysis of a solar power plant over the waste area of t... more This article presents an imagination and analysis of a solar power plant over the waste area of the Yamuna River in Delhi. Delhi is the capital of largest democracy in the world, this city has population approx 19 million [1] and pollution is one of the major problems of Delhi, so solar energy power plant is a good idea for this national capital city of India but this is national capital city and huge population reside in this city, so this city has lack of land resource. But Delhi has a river Yamuna. The total length of River Yamuna in the NCR region is 48 km, of which 22 km lies in main capital and the rest falls in the National Capital Region. So, a solar power plant can be established over the river by building pillars in the river and making a structure over these pillars and then solar panels can be installed over these structures. The flow of the river can be also maintained in this project. The whole 22 km open area can be used to set up a solar power plant, and this will produce at least 5 Megawatt electricity. This is the clean energy so it will reduce pollution and will fulfill the energy need of this city, this area is already waste (can’t be utilized for other purposes) and today, India has the technical capability to establish this kind of project.

International Journal of Computer Applications, Mar 15, 2013

In this paper we have discussed all existing approaches to solve the problem for calculating the ... more In this paper we have discussed all existing approaches to solve the problem for calculating the min-cut tree of an undirected edge-weighted graph and present a new approximation algorithm for constructing the minimum-cut tree. We discussed Gomory-Hu algorithm. The algorithm proposed by Gomory and Hu has time complexity O(V*time complexity of finding a min s-t cut). We also have discussed Ford-Fulkerson method. Running time of Ford-Fulkerson algorithm is O(ve 2). The asymptotically fastest maximumflow algorithms are based on push-relabel method and have the running time of O(V 3). M. Stoer and F. Wagner have given a simple and compact algorithm for finding the minimum cut of a graph. The algorithm is remarkably simple and has the fastest running time so far the algorithm consists of |V|-1 identical phases each of which requires O(|e| + |V| log |V|) time yielding an overall running time of O(|V||e| + log |V|). We present a new approximation algorithm for constructing the minimum cut tree. We calculate an upperbound value for each node in the graph. We define the upper bound value of each node as the value of cut which separates this node from rest of the graph and our algorithm runs in O(V 2 .logV + V 2 .d), where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sorts of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less (usually for less than 5% pairs) and for most of the pairs we obtain correct values of max-flow or min-cut.

International Journal of Computer Applications, Nov 15, 2012

Many reconstruction algorithms for binary tree have been discussed in this paper. A particular fo... more Many reconstruction algorithms for binary tree have been discussed in this paper. A particular focus of this paper is on "A new Non-Recursive Algorithm for Reconstructing a Binary Tree from its Traversals". The computation time required for executing the reconstruction algorithm are O(N) and space complexity is O(NlogN) where N is the number of nodes in the binary tree. This algorithm works well for most of the input cases, but it has some drawbacks. There are some sequences of pre-order and in-order for which no legitimate tree can be constructed but the algorithm didn't take these cases into consideration and constructed a wrong tree for these cases. In this paper, we have proposed a solution to the problem in the previous algorithm and designed an algorithm which is the modified version of the previous algorithm for generating a correct binary tree. The new modified algorithm is implemented in C language and tested in GCC Compiler in Linux, for all types of input cases. The New modified algorithm works well for all types of input cases. We have calculated the best case time complexity of modified algorithm and show that a correct tree can be reported in O(N) time in best case and O(NlogN) space where N is the number of nodes in the tree. We have discussed some applications of the new modified algorithm in Huffman Coding, compiler design, text processing and searching algorithms.

International Journal of Computer Applications, 2013

In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edg... more In this paper a new approximation algorithm for calculating the min-cut tree of an undirected edgeweighted graph has been proposed. This algorithm runs in 2 2 (.log .) O V V V d  , where V is the number of vertices in the given graph and d is the degree of the graph. It is a significant improvement over time complexities of existing solutions. However, because of an assumption it does not produce correct result for all sort of graphs but for the dense graphs success rate is more than 90%. Moreover in the unsuccessful cases, the deviation from actual result is very less and for most of the pairs we obtain correct values of max-flow or mincut. This algorithm is implemented in JAVA language and checked for many input cases.