Debayan Ganguly - Academia.edu (original) (raw)

Papers by Debayan Ganguly

Research paper thumbnail of Parallel communicating one-way reversible finite automata system

ArXiv, 2019

In this paper, we discuss the computational power of parallel communicating finite automata syste... more In this paper, we discuss the computational power of parallel communicating finite automata system with 1-way reversible finite automaton as components. We show that unlike the multi-head one way reversible finite automata model (where we are still not sure whether it accepts all the regular languages) parallel communicating one-way reversible finite automata systems can accept all the regular languages. Moreover for every multi-head one way reversible finite automaton there exist a parallel communicating one-way reversible finite automata system which accepts the same language. We also make an interesting observation that although the components of the system are reversible the system as a whole is not reversible. On the basis of which we conjecture that parallel communicating one-way reversible finite automata systems may accept languages not accepted by multi-head one way reversible finite automata.

Research paper thumbnail of Extraction from MRI of Brain Image

Automated segmentation of white matter (WM) and gray matter (GM) is a very important task for det... more Automated segmentation of white matter (WM) and gray matter (GM) is a very important task for detecting multiple diseases. The paper proposed a simple method for WM and GM extraction form magnetic resonance imaging (MRI) of brain. The proposed methods based on binarization, wavelet decomposition, and convexhull produce very effective results in the context of visual inspection and as well as quantifiably. It tested on three different (Transvers, Sagittal, Coronal) types of MRI of brain image and the validation of experiment indicate accurate detection and segmentation of the interesting structures or particular region of MRI of brain image.

Research paper thumbnail of Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata

Copyright © 2013 Kumar Sankar Ray et al. This is an open access article distributed under the Cre... more Copyright © 2013 Kumar Sankar Ray et al. This is an open access article distributed under the Creative Commons Attribution Li-cense, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.

Research paper thumbnail of How Successful is a Lockdown During a Pandemic?

2020 IEEE 17th India Council International Conference (INDICON), 2020

Social distancing, leading to lockdown, has been followed as a measure to restrict the spread of ... more Social distancing, leading to lockdown, has been followed as a measure to restrict the spread of COVID-19 infection in almost every country. In this paper, we study the impact of the United States of America's lockdown measures during this pandemic in restricting the spread of infection. We have split the lockdown into two types - hard lockdown and soft lockdown. A hard lockdown is defined as the period when only essential services are provided. On the other hand, in the soft lockdown period, non-essential services are allowed, but with prevailing social distancing measures. Our findings suggest that a properly implemented Hard Lockdown followed by a soft Lockdown is indeed effective in reducing the reproduction number (R0). Although R0 increases during the soft lockdown, the rate of increase is restricted if the hard lockdown was implemented favorably. As exceptions to this general trend, we have observed that in Washington state Hard Lockdown has failed to reduce R0, and Vermo...

Research paper thumbnail of Prediction of the final rank of Players in PUBG with the optimal number of features

ArXiv, 2021

PUBG is an online video game that has become very popular among the youths in recent years. Final... more PUBG is an online video game that has become very popular among the youths in recent years. Final rank, which indicates the performance of a player, is one of the most important feature for this game. This paper focuses on predicting the final rank of the players based on their skills and abilities. In this paper we have used different machine learning algorithms to predict the final rank of the players on a dataset obtained from kaggle which has 29 features. Using the correlation heatmap,we have varied the number of features used for the model. Out of these models GBR and LGBM have given the best result with the accuracy of 91.63% and 91.26% respectively for 14 features and the accuracy of 90.54% and 90.01% for 8 features. Although the accuracy of the models with 14 features is slightly better than 8 features, the empirical time taken by 8 features is 1.4x lesser than 14 features for LGBM and 1.5x lesser for GBR. Furthermore, reducing the number of features any more significantly h...

Research paper thumbnail of 2-tape 1-way Quantum Finite State Automata

ArXiv, 2016

1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting... more 1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper, we replace the single tape of 1-way 2-head quantum finite state automaton with two tapes. The content of the second tape is determined using a relation defined on input alphabet. The main claims of this paper are as follows: (1)We establish that 2-tape 1-way quantum finite state automaton(2T1QFA(2)) can accept all regular languages (2)A language which cannot be accepted by any multi-head deterministic finite automaton can be accepted by 2-tape 1-way quantum finite state automaton(2T1QFA(2)) .(3) Exploiting the superposition property of quantum automata we show that 2-tape 1-way quantum finite state au...

Research paper thumbnail of A Brief Survey of Steganographic Methods for ECG Signal

Research paper thumbnail of Transfer Learning in Skin Lesion Classification

Research paper thumbnail of Voting in Watts-Strogatz Small-World Network

Research paper thumbnail of Multi-head Watson-Crick quantum finite automata

ArXiv, 2020

Watson-Crick quantum finite automata were introduced by Ganguly this http URL. by combining prope... more Watson-Crick quantum finite automata were introduced by Ganguly this http URL. by combining properties of DNA and Quantum automata. In this paper we introduce a multi-head version of the above automaton. We further show that the multi-head variant is computationally more powerful than one-way multi-head reversible finite automata. In fact we also show that the multi-head variant accepts a language which is not accepted by any one-way multi-head deterministic finite automata.

Research paper thumbnail of Stationarity and Self-similarity Determination of Time Series Data Using Hurst Exponent and R/S Ration Analysis

Advances in Intelligent Systems and Computing, 2021

Time series data is highly varying in nature. Determining the quality of predictability of the da... more Time series data is highly varying in nature. Determining the quality of predictability of the data is necessary to describe it. Self-similarity and stationarity are the key tools to determine the property. In this paper, visual and quantitative results to measure predictability of time series data are shown by rescaled ratio (R/S) analysis and Hurst exponent. We use several transformations and scaling to avoid the noise and vastness of stock data. Case-based studies are done on various kinds of stocks from Bombay Stock Exchange to establish the necessity of the R/S ratio with Hurst exponent. From the results of this study, an inference has drawn about the nature of stocks. The predictability is quantified depending on the value of Hurst exponent and Hurst co-efficient. Another factor named roughness factor is included for analyzing the result of the R/S ratio.

Research paper thumbnail of Two-way Nanoscale automata

In this paper, we show the all final subclass of two-way Watson-Crick automata have the same comp... more In this paper, we show the all final subclass of two-way Watson-Crick automata have the same computational power as the classical two-way Watson-Crick automata. Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum finite automata cannot accept.

Research paper thumbnail of State Complexity of Reversible Watson-Crick Automata

ArXiv, 2020

Reversible Watson-Crick automata introduced by Chatterjee this http URL. is a reversible variant ... more Reversible Watson-Crick automata introduced by Chatterjee this http URL. is a reversible variant of an Watson-Crick automata. It has already been shown that the addition of DNA properties to reversible automata significantly increases the computational power of the model. In this paper, we analyze the state complexity of Reversible Watson-Crick automata with respect to non-deterministic finite automata. We show that Reversible Watson-Crick automata in spite of being reversible in nature enjoy state complexity advantage over non deterministic finite automata. The result is interesting because conversion from non deterministic to deterministic automata results in exponential blow up of the number of states and classically increase in number of heads of the automata cannot compensate for non-determinism in deterministic and reversible models.

Research paper thumbnail of Effect of Climatic Conditions on Gender Segregated COVID-19 Infections and Fatalities

2020 IEEE 17th India Council International Conference (INDICON), 2020

In this paper, a sex-segregated study of COVID-19 infected patients and casualties is done for di... more In this paper, a sex-segregated study of COVID-19 infected patients and casualties is done for different climatic conditions. We study the COVID data to identify the trend of infections and casualties based on the change in temperature and other climatic features. The countries with non-homogeneous climates are broken down into respective subdivisions which consist of uniform climate. It is found that, with an increase in temperature, the sex ratio in COVID-19 infected patients and especially casualties become more disproportionate. Males have a higher mortality rate and the susceptibility of females decreases as we move from a cold to a hot climate.

Research paper thumbnail of Bengali Handwritten Character Classification Using Transfer Learning on Deep Convolutional Network

Intelligent Human Computer Interaction

Bengali is the sixth most popular spoken language in the world. Computerized detection of handwri... more Bengali is the sixth most popular spoken language in the world. Computerized detection of handwritten Bengali (Bangla Lekha) character is very difficult due to the diversity and veracity of characters. In this paper, we have proposed a modified state-of-the-art deep learning to tackle the problem of Bengali handwritten character recognition. This method used the lesser number of iterations to train than other comparable methods. The transfer learning on Resnet-50 deep convolutional neural network model is used on pretrained ImageNet dataset. One cycle policy is modified with varying the input image sizes to ensure faster training. Proposed method executed on BanglaLekha-Isolated dataset for evaluation that consists of 84 classes (50 Basic, 10 Numerals and 24 Compound Characters). We have achieved 97.12% accuracy in just 47 epochs. Proposed method gives very good results in terms of epoch and accuracy compare to other recent methods by considering number of classes. Without ensembling, proposed solution achieves state-of-the-art result and shows the effectiveness of ResNet-50 for classification of Bangla HCR.

Research paper thumbnail of Watson–Crick quantum finite automata

Acta Informatica

one-way quantum finite automata are reversible in nature, which greatly reduces its accepting pro... more one-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The noninjective complementarity relation of Watson-Crick automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of one-way Quantum finite automata significantly. We establish that Watson-Crick quantum finite automata can accept all regular languages and that it also accepts some languages which are not accepted by any multi-head deterministic finite automata. Exploiting the superposition property of quantum finite automata we show that Watson-Crick quantum finite automata accept the language L={ww |w∈ , * }.

Research paper thumbnail of Innovative Ranking Strategy for IPL Team Formation

International Journal of Engineering and Advanced Technology

Indian Premier League (IPL) is a tournament of twenty over cricket matches. Teams of this tournam... more Indian Premier League (IPL) is a tournament of twenty over cricket matches. Teams of this tournament are selected via an auction from a pool of players. Each team employs a think-tank to build the best possible team. Few studies have been performed to automate the process of team selection. However, those studies mostly concentrate either on the current form of the players, or their long term performance. In this paper, we have (i) selected traditional features as well as determined some derived features, which are generated from the traditional features, for batsmen and bowlers, (ii) formulated heuristics for clustering batsmen into openers, middle order batsmen and finishers, (iii) formulated heuristics for relative ranking of batsmen and bowlers considering the current performance as well as the experience of each player, and (iv) have proposed two greedy algorithms for team selection where the total credit point of the team and the number of players in each cluster is fixed. Our...

Research paper thumbnail of 1-Way Multihead Quantum Finite State Automata

Applied Mathematics, 2016

1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-w... more 1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can't accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can't be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.

Research paper thumbnail of Bengali Handwritten Character Classification using Transfer Learning on Deep Convolutional Neural Network

In this paper, we propose a solution which uses state-of-the-art techniques in Deep Learning to t... more In this paper, we propose a solution which uses state-of-the-art techniques in Deep Learning to tackle the problem of Bengali Handwritten Character Recognition ( HCR ). Our method uses lesser iterations to train than most other comparable methods. We employ Transfer Learning on ResNet 50, a state-of-the-art deep Convolutional Neural Network Model, pretrained on ImageNet dataset. We also use other techniques like a modified version of One Cycle Policy, varying the input image sizes etc. to ensure that our training occurs fast. We use the BanglaLekha-Isolated Dataset for evaluation of our technique which consists of 84 classes (50 Basic, 10 Numerals and 24 Compound Characters). We are able to achieve 96.12% accuracy in just 47 epochs on BanglaLekha-Isolated dataset. When comparing our method with that of other researchers, considering number of classes and without using Ensemble Learning, the proposed solution achieves state of the art result for Handwritten Bengali Character Recognit...

Research paper thumbnail of Parallel communicating one-way reversible finite automata system

ArXiv, 2019

In this paper, we discuss the computational power of parallel communicating finite automata syste... more In this paper, we discuss the computational power of parallel communicating finite automata system with 1-way reversible finite automaton as components. We show that unlike the multi-head one way reversible finite automata model (where we are still not sure whether it accepts all the regular languages) parallel communicating one-way reversible finite automata systems can accept all the regular languages. Moreover for every multi-head one way reversible finite automaton there exist a parallel communicating one-way reversible finite automata system which accepts the same language. We also make an interesting observation that although the components of the system are reversible the system as a whole is not reversible. On the basis of which we conjecture that parallel communicating one-way reversible finite automata systems may accept languages not accepted by multi-head one way reversible finite automata.

Research paper thumbnail of Extraction from MRI of Brain Image

Automated segmentation of white matter (WM) and gray matter (GM) is a very important task for det... more Automated segmentation of white matter (WM) and gray matter (GM) is a very important task for detecting multiple diseases. The paper proposed a simple method for WM and GM extraction form magnetic resonance imaging (MRI) of brain. The proposed methods based on binarization, wavelet decomposition, and convexhull produce very effective results in the context of visual inspection and as well as quantifiably. It tested on three different (Transvers, Sagittal, Coronal) types of MRI of brain image and the validation of experiment indicate accurate detection and segmentation of the interesting structures or particular region of MRI of brain image.

Research paper thumbnail of Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata

Copyright © 2013 Kumar Sankar Ray et al. This is an open access article distributed under the Cre... more Copyright © 2013 Kumar Sankar Ray et al. This is an open access article distributed under the Creative Commons Attribution Li-cense, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.

Research paper thumbnail of How Successful is a Lockdown During a Pandemic?

2020 IEEE 17th India Council International Conference (INDICON), 2020

Social distancing, leading to lockdown, has been followed as a measure to restrict the spread of ... more Social distancing, leading to lockdown, has been followed as a measure to restrict the spread of COVID-19 infection in almost every country. In this paper, we study the impact of the United States of America's lockdown measures during this pandemic in restricting the spread of infection. We have split the lockdown into two types - hard lockdown and soft lockdown. A hard lockdown is defined as the period when only essential services are provided. On the other hand, in the soft lockdown period, non-essential services are allowed, but with prevailing social distancing measures. Our findings suggest that a properly implemented Hard Lockdown followed by a soft Lockdown is indeed effective in reducing the reproduction number (R0). Although R0 increases during the soft lockdown, the rate of increase is restricted if the hard lockdown was implemented favorably. As exceptions to this general trend, we have observed that in Washington state Hard Lockdown has failed to reduce R0, and Vermo...

Research paper thumbnail of Prediction of the final rank of Players in PUBG with the optimal number of features

ArXiv, 2021

PUBG is an online video game that has become very popular among the youths in recent years. Final... more PUBG is an online video game that has become very popular among the youths in recent years. Final rank, which indicates the performance of a player, is one of the most important feature for this game. This paper focuses on predicting the final rank of the players based on their skills and abilities. In this paper we have used different machine learning algorithms to predict the final rank of the players on a dataset obtained from kaggle which has 29 features. Using the correlation heatmap,we have varied the number of features used for the model. Out of these models GBR and LGBM have given the best result with the accuracy of 91.63% and 91.26% respectively for 14 features and the accuracy of 90.54% and 90.01% for 8 features. Although the accuracy of the models with 14 features is slightly better than 8 features, the empirical time taken by 8 features is 1.4x lesser than 14 features for LGBM and 1.5x lesser for GBR. Furthermore, reducing the number of features any more significantly h...

Research paper thumbnail of 2-tape 1-way Quantum Finite State Automata

ArXiv, 2016

1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting... more 1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. We introduce 2-tape 1-way quantum finite state automaton (2T1QFA(2))which is a modified version of 1-way 2-head quantum finite state automaton(1QFA(2)). In this paper, we replace the single tape of 1-way 2-head quantum finite state automaton with two tapes. The content of the second tape is determined using a relation defined on input alphabet. The main claims of this paper are as follows: (1)We establish that 2-tape 1-way quantum finite state automaton(2T1QFA(2)) can accept all regular languages (2)A language which cannot be accepted by any multi-head deterministic finite automaton can be accepted by 2-tape 1-way quantum finite state automaton(2T1QFA(2)) .(3) Exploiting the superposition property of quantum automata we show that 2-tape 1-way quantum finite state au...

Research paper thumbnail of A Brief Survey of Steganographic Methods for ECG Signal

Research paper thumbnail of Transfer Learning in Skin Lesion Classification

Research paper thumbnail of Voting in Watts-Strogatz Small-World Network

Research paper thumbnail of Multi-head Watson-Crick quantum finite automata

ArXiv, 2020

Watson-Crick quantum finite automata were introduced by Ganguly this http URL. by combining prope... more Watson-Crick quantum finite automata were introduced by Ganguly this http URL. by combining properties of DNA and Quantum automata. In this paper we introduce a multi-head version of the above automaton. We further show that the multi-head variant is computationally more powerful than one-way multi-head reversible finite automata. In fact we also show that the multi-head variant accepts a language which is not accepted by any one-way multi-head deterministic finite automata.

Research paper thumbnail of Stationarity and Self-similarity Determination of Time Series Data Using Hurst Exponent and R/S Ration Analysis

Advances in Intelligent Systems and Computing, 2021

Time series data is highly varying in nature. Determining the quality of predictability of the da... more Time series data is highly varying in nature. Determining the quality of predictability of the data is necessary to describe it. Self-similarity and stationarity are the key tools to determine the property. In this paper, visual and quantitative results to measure predictability of time series data are shown by rescaled ratio (R/S) analysis and Hurst exponent. We use several transformations and scaling to avoid the noise and vastness of stock data. Case-based studies are done on various kinds of stocks from Bombay Stock Exchange to establish the necessity of the R/S ratio with Hurst exponent. From the results of this study, an inference has drawn about the nature of stocks. The predictability is quantified depending on the value of Hurst exponent and Hurst co-efficient. Another factor named roughness factor is included for analyzing the result of the R/S ratio.

Research paper thumbnail of Two-way Nanoscale automata

In this paper, we show the all final subclass of two-way Watson-Crick automata have the same comp... more In this paper, we show the all final subclass of two-way Watson-Crick automata have the same computational power as the classical two-way Watson-Crick automata. Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum finite automata cannot accept.

Research paper thumbnail of State Complexity of Reversible Watson-Crick Automata

ArXiv, 2020

Reversible Watson-Crick automata introduced by Chatterjee this http URL. is a reversible variant ... more Reversible Watson-Crick automata introduced by Chatterjee this http URL. is a reversible variant of an Watson-Crick automata. It has already been shown that the addition of DNA properties to reversible automata significantly increases the computational power of the model. In this paper, we analyze the state complexity of Reversible Watson-Crick automata with respect to non-deterministic finite automata. We show that Reversible Watson-Crick automata in spite of being reversible in nature enjoy state complexity advantage over non deterministic finite automata. The result is interesting because conversion from non deterministic to deterministic automata results in exponential blow up of the number of states and classically increase in number of heads of the automata cannot compensate for non-determinism in deterministic and reversible models.

Research paper thumbnail of Effect of Climatic Conditions on Gender Segregated COVID-19 Infections and Fatalities

2020 IEEE 17th India Council International Conference (INDICON), 2020

In this paper, a sex-segregated study of COVID-19 infected patients and casualties is done for di... more In this paper, a sex-segregated study of COVID-19 infected patients and casualties is done for different climatic conditions. We study the COVID data to identify the trend of infections and casualties based on the change in temperature and other climatic features. The countries with non-homogeneous climates are broken down into respective subdivisions which consist of uniform climate. It is found that, with an increase in temperature, the sex ratio in COVID-19 infected patients and especially casualties become more disproportionate. Males have a higher mortality rate and the susceptibility of females decreases as we move from a cold to a hot climate.

Research paper thumbnail of Bengali Handwritten Character Classification Using Transfer Learning on Deep Convolutional Network

Intelligent Human Computer Interaction

Bengali is the sixth most popular spoken language in the world. Computerized detection of handwri... more Bengali is the sixth most popular spoken language in the world. Computerized detection of handwritten Bengali (Bangla Lekha) character is very difficult due to the diversity and veracity of characters. In this paper, we have proposed a modified state-of-the-art deep learning to tackle the problem of Bengali handwritten character recognition. This method used the lesser number of iterations to train than other comparable methods. The transfer learning on Resnet-50 deep convolutional neural network model is used on pretrained ImageNet dataset. One cycle policy is modified with varying the input image sizes to ensure faster training. Proposed method executed on BanglaLekha-Isolated dataset for evaluation that consists of 84 classes (50 Basic, 10 Numerals and 24 Compound Characters). We have achieved 97.12% accuracy in just 47 epochs. Proposed method gives very good results in terms of epoch and accuracy compare to other recent methods by considering number of classes. Without ensembling, proposed solution achieves state-of-the-art result and shows the effectiveness of ResNet-50 for classification of Bangla HCR.

Research paper thumbnail of Watson–Crick quantum finite automata

Acta Informatica

one-way quantum finite automata are reversible in nature, which greatly reduces its accepting pro... more one-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The noninjective complementarity relation of Watson-Crick automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of one-way Quantum finite automata significantly. We establish that Watson-Crick quantum finite automata can accept all regular languages and that it also accepts some languages which are not accepted by any multi-head deterministic finite automata. Exploiting the superposition property of quantum finite automata we show that Watson-Crick quantum finite automata accept the language L={ww |w∈ , * }.

Research paper thumbnail of Innovative Ranking Strategy for IPL Team Formation

International Journal of Engineering and Advanced Technology

Indian Premier League (IPL) is a tournament of twenty over cricket matches. Teams of this tournam... more Indian Premier League (IPL) is a tournament of twenty over cricket matches. Teams of this tournament are selected via an auction from a pool of players. Each team employs a think-tank to build the best possible team. Few studies have been performed to automate the process of team selection. However, those studies mostly concentrate either on the current form of the players, or their long term performance. In this paper, we have (i) selected traditional features as well as determined some derived features, which are generated from the traditional features, for batsmen and bowlers, (ii) formulated heuristics for clustering batsmen into openers, middle order batsmen and finishers, (iii) formulated heuristics for relative ranking of batsmen and bowlers considering the current performance as well as the experience of each player, and (iv) have proposed two greedy algorithms for team selection where the total credit point of the team and the number of players in each cluster is fixed. Our...

Research paper thumbnail of 1-Way Multihead Quantum Finite State Automata

Applied Mathematics, 2016

1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-w... more 1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can't accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can't be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.

Research paper thumbnail of Bengali Handwritten Character Classification using Transfer Learning on Deep Convolutional Neural Network

In this paper, we propose a solution which uses state-of-the-art techniques in Deep Learning to t... more In this paper, we propose a solution which uses state-of-the-art techniques in Deep Learning to tackle the problem of Bengali Handwritten Character Recognition ( HCR ). Our method uses lesser iterations to train than most other comparable methods. We employ Transfer Learning on ResNet 50, a state-of-the-art deep Convolutional Neural Network Model, pretrained on ImageNet dataset. We also use other techniques like a modified version of One Cycle Policy, varying the input image sizes etc. to ensure that our training occurs fast. We use the BanglaLekha-Isolated Dataset for evaluation of our technique which consists of 84 classes (50 Basic, 10 Numerals and 24 Compound Characters). We are able to achieve 96.12% accuracy in just 47 epochs on BanglaLekha-Isolated dataset. When comparing our method with that of other researchers, considering number of classes and without using Ensemble Learning, the proposed solution achieves state of the art result for Handwritten Bengali Character Recognit...