Mainak Biswas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mainak Biswas has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Pawan Kumar Singh
Jadavpur University
2 shared publications - Ali Ahmadian
Istanbul Okan University
1 shared publication - Devarajan Sridharan
Affiliation Centre for Neuroscience, Indian Institute of Science, Bangalore, India
1 shared publication - Kamalularifin Subari
Fakulti Sains Sosial dan Kemanusiaan Sekolah Pendidikan, Universiti Teknologi Malaysia (UTM), Skudai, 81310 Johor Bahru, Johor, Malaysia
1 shared publication Kavya Rajendran
1 shared publication- Maroi Agrebi
Univ. Polytechnique Hauts-de-France, CNRS, UMR 8201–LAMIH
1 shared publication
Latest Publications
- Open Access
- 5 August 2025
- Published by Elsevier in NeuroImage
- Vol. 318
Neural mechanisms of attention, not expectation, govern spatial selection by probabilistic cueing
- 5 August 2025
- Published by Elsevier in NeuroImage
- Vol. 318
Open AccessNeural mechanisms of attention, not expectation, govern spatial selection by probabilistic cueing
- 29 September 2023
- Published by Springer Nature
- p. 83-108
Speech Emotion Recognition Using Deep CNNs Trained on Log-Frequency Spectrograms
- 29 September 2023
- Published by Springer Nature
- p. 83-108
Speech Emotion Recognition Using Deep CNNs Trained on Log-Frequency Spectrograms
- Open Access
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 311-317
Multiple Uniform Circle Formation by Fat Robots Under Limited Visibility
Formation of arbitrary shapes and patterns using swarm robots is a fairly well researched topic. However, there is still a long way to go. This is due to the hindrance caused by the immense complexity of distributed algorithms and their lack of scalability. This paper proposes a scalable algorithm that allows a set of identical, homogeneous, disk shaped fat mobile robots to form multiple uniform circles. All the robots run the same proposed (completely distributed and deterministic) algorithm. The robots follow a global coordinate system. All the points that the robots must occupy are pre-computed by them. The robots in this paper are not oblivious, and use a message passing technique to prevent collisions. The robots have the same limited visibility, within which they can observe other robots. Based on one’s current position and position of other robots in its visibility, a robot takes appropriate decisions so that the objective can be fulfilled. The algorithm guarantees formation of multiple uniform circles under a synchronous environment. At the end of the paper, we also discuss why this algorithm is independent of the shape the robots have to form, and can be extended to the formation of any arbitrary geometric shape by just changing the computation of the points that the robots eventually occupy.
- 4 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 311-317
Open AccessMultiple Uniform Circle Formation by Fat Robots Under Limited Visibility
Formation of arbitrary shapes and patterns using swarm robots is a fairly well researched topic. However, there is still a long way to go. This is due to the hindrance caused by the immense complexity of distributed algorithms and their lack of scalability. This paper proposes a scalable algorithm that allows a set of identical, homogeneous, disk shaped fat mobile robots to form multiple uniform circles. All the robots run the same proposed (completely distributed and deterministic) algorithm. The robots follow a global coordinate system. All the points that the robots must occupy are pre-computed by them. The robots in this paper are not oblivious, and use a message passing technique to prevent collisions. The robots have the same limited visibility, within which they can observe other robots. Based on one’s current position and position of other robots in its visibility, a robot takes appropriate decisions so that the objective can be fulfilled. The algorithm guarantees formation of multiple uniform circles under a synchronous environment. At the end of the paper, we also discuss why this algorithm is independent of the shape the robots have to form, and can be extended to the formation of any arbitrary geometric shape by just changing the computation of the points that the robots eventually occupy.
- 3 January 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (7) , 9565-9595
Automatic spoken language identification using MFCC based time series features
- 3 January 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (7) , 9565-9595
Automatic spoken language identification using MFCC based time series features