Search

Your search keyword '"Banerjee, Indranil"' showing total 678 results
Start Over Author "Banerjee, Indranil"
678 results on '"Banerjee, Indranil"'

2. Study on Escapes Probability of Gas Bubble in Surge Tank Using Water Model Experiment

Author

Lijukrishnan, P., Banerjee, Indranil, Manikandan, S., Rammohan, S., Vinod, V., Raghupathy, S., Chaari, Fakher, Series Editor, Gherardini, Francesco, Series Editor, Ivanov, Vitalii, Series Editor, Haddar, Mohamed, Series Editor, Cavas-Martínez, Francisco, Editorial Board Member, di Mare, Francesca, Editorial Board Member, Kwon, Young W., Editorial Board Member, Trojanowska, Justyna, Editorial Board Member, Xu, Jinyang, Editorial Board Member, Singh, Krishna Mohan, editor, Dutta, Sushanta, editor, Subudhi, Sudhakar, editor, and Singh, Nikhil Kumar, editor

Published
2024
Full Text
View/download PDF

3. Experimental Modelling to Measure the Seat Leakage in Shutdown System of PFBR

Author

Aggarwal, Piyush Kumar, Banerjee, Indranil, Vinod, V., Raghupathy, S., Chaari, Fakher, Series Editor, Gherardini, Francesco, Series Editor, Ivanov, Vitalii, Series Editor, Haddar, Mohamed, Series Editor, Cavas-Martínez, Francisco, Editorial Board Member, di Mare, Francesca, Editorial Board Member, Kwon, Young W., Editorial Board Member, Trojanowska, Justyna, Editorial Board Member, Xu, Jinyang, Editorial Board Member, Singh, Krishna Mohan, editor, Dutta, Sushanta, editor, Subudhi, Sudhakar, editor, and Singh, Nikhil Kumar, editor

Published
2024
Full Text
View/download PDF

5. Influenza A Virus: Cellular Entry

Author

Miyake, Yasuyuki, Hara, Yuya, Umeda, Miki, Banerjee, Indranil, Harris, J. Robin, Series Editor, Kundu, Tapas K., Advisory Editor, Korolchuk, Viktor, Advisory Editor, Bolanos-Garcia, Victor, Advisory Editor, Marles-Wright, Jon, Advisory Editor, Vijayakrishnan, Swetha, editor, and Jiu, Yaming, editor

Published
2023
Full Text
View/download PDF

9. Contributors

Author

Allam, Jaya Prakash, primary, Anis, Arfat, additional, Ari, Samit, additional, Arya, B., additional, Banerjee, Indranil, additional, Barui, Ananya, additional, Bharti, Deepti, additional, Bhattacharyya, Saugat, additional, Boreyko, M., additional, Borkar, Pranjali, additional, Chaikovsky, I., additional, Chakravarty, Sumit, additional, Chowdhary, Rashmi, additional, Dhananjay, B., additional, Emrani, Zahra, additional, Etehadtavakol, Mahnaz, additional, Frolov, Yu., additional, Kazmirchuk, A., additional, Liu, Chen, additional, Majhi, Manoja K., additional, Malhotra, Anvita Gupta, additional, Mohanty, Satyapriya, additional, Nayak, Suraj K., additional, Nedayvoda, I., additional, Ng, E.Y.K., additional, Pal, Kunal, additional, Popov, Anton, additional, Pradhan, Bikash K., additional, Primin, M., additional, Qaisar, Saeed Mian, additional, Ravikanth, Chavali, additional, Raza, Haider, additional, Sahu, Deepak K., additional, Samantray, Saunak, additional, Sarkar, Angana, additional, Sarkar, Preetam, additional, Singh, Sarman, additional, Sivaraman, J., additional, Venkatesh, N. Prasanna, additional, and Wilczynski, Slawomir, additional

Published
2023
Full Text
View/download PDF

10. Contributors

Author

Banerjee, Indranil, primary, Basu, Bikramjit, additional, Bowman, Anthony D., additional, Buddhiraju, Hima Sree, additional, Carbonell-Caballero, José, additional, Chandy, Thomas, additional, Clark, Ashley, additional, Das, Bodhisatwa, additional, Eranki, Avinash, additional, Gaikwad, Hanmant K., additional, Goswami, Rohan M., additional, Gowtham, N.H., additional, Gozzi, Noemi, additional, Hickerson, Darren H.M., additional, Hueso, Miguel, additional, Hunsberger, Joshua, additional, Jaswandkar, Sharad V., additional, Jololian, Leon, additional, Kanagaraj, Subramani, additional, Katti, Dinesh R., additional, Katti, Kalpana S., additional, Kommeri, Remya, additional, Kumar, Ravinder, additional, Mech, Dhruba Jyoti, additional, Montagud, Arnau, additional, Morrison, Nancy, additional, Mukherjee, Anwesha, additional, Murugappan, Sivasubramanian, additional, Pal, Kunal, additional, Paul, Willi, additional, Pemmada, Rakesh, additional, Pradhan, Bikash K., additional, Ramasubramanian, Krishna Vyas, additional, Ramasubramanian, Krishnamurthy, additional, Rengan, Aravind Kumar, additional, Rizvi, Mohd Suhail, additional, Saha, Sahely, additional, Sahani, Ashish, additional, Sarker, Sumit, additional, Sarmah, Arnab, additional, Sharma, Chandra P., additional, Srinivasan, Mirra, additional, Thangaraj, Padma Pradha, additional, Thangaraj, Santhosh Raja, additional, Thomas, Vinoy, additional, Álvarez, Rafael, additional, Unal, Aynur, additional, Valencia, Alfonso, additional, Valle, Giacomo, additional, Vellido, Alfredo, additional, and Xia, Yiyun, additional

Published
2023
Full Text
View/download PDF

11. List of contributors

Author

Aggrawal, Richa, primary, Akhtar, Memoona, additional, Anupam, Kumar, additional, Arooj, Mahreen, additional, Arslan-Yıldız, Ahu, additional, Balakrishnan, Anandan, additional, Banerjee, Indranil, additional, Baruah, Manash Jyoti, additional, Barui, Ananya, additional, Basak, Piyali, additional, Basu, Aalok, additional, Begam, Howa, additional, Bharti, Deepti, additional, Bhaskar, Thallada, additional, Biçen Ünlüer, Özlem, additional, Biswas, Bhabatosh, additional, Biswas, Shreya, additional, Cengiz, Ibrahim Fatih, additional, Cerqueira, Miguel A., additional, Chameettachal, Shibu, additional, Chowdhury, Soham, additional, Das, Apurba, additional, Das, Pratik, additional, Datta, Pallab, additional, Dey, Rimita, additional, Dhiman, Jitender, additional, Dias, Marisol, additional, Dutt, Dharm, additional, Dutta, Anurag, additional, Dwivedi, Umesh K., additional, Dwivedi, Umesh Kumar, additional, Ersöz, Arzu, additional, Fatima, Samra, additional, Fauzi, Mh Busra, additional, Ganeasan M, Sundara, additional, Gogoi, Satyabrat, additional, Gopi, D., additional, Hada, Vaishnavi, additional, Hanuman, Srividya, additional, Hashmi, S.A.R., additional, Jadam, Rajpal S., additional, Jarzębski, Maciej, additional, Kate, Adinath, additional, Kavitha, L., additional, Kaviya, M., additional, Keçili, Rüstem, additional, Kim, Doman, additional, Kumari, Neelam, additional, Lal, Priti Shivhare, additional, Lo, Samantha, additional, Majumdar, Abhijit, additional, Mandal, Gurudas, additional, Manoravi, P., additional, Masri, Syafira, additional, Mazlan, Zawani, additional, Mili, Medha, additional, Mishra, Shashank, additional, Modhera, Bharat, additional, Mohamed, Ahmed A., additional, Mohapatra, Debabandya, additional, Mohd Isa, Isma Liza, additional, Mokhtar, Sabarul Afian, additional, Nayak, Amit Kumar, additional, Nickhil, C., additional, Nune, Manasa, additional, Oliveira, Joaquim Miguel, additional, Özmen, Ece, additional, Pal, Bidyut, additional, Pal, Kunal, additional, Parambath, Javad B.M., additional, Parashar, Vishal, additional, Pastrana, Lorenzo M., additional, Pati, Falguni, additional, Pinto, Ana Mafalda, additional, Pradhan, Bikash K., additional, Ramya, S., additional, Rathore, Deepshikha, additional, Rawat, Ramesh, additional, Rehman, Muhammad Atiq Ur, additional, Reis, Rui L., additional, Roy, Arpita, additional, Sagiri, Sai S., additional, Saravanakumar, P., additional, Sarfraz, Muhammad Farrukh, additional, Sarkar, Preetam, additional, Sarmah, Jayanta Kumar, additional, Say, Rıdvan, additional, Sharma, Shradha, additional, Shinyjoy, E., additional, Shrivastava, Ram Krishna, additional, Sillankorva, Sanna, additional, Singh, Adhish, additional, Sinha, Arijit, additional, Sridhar, T.M., additional, Srivastava, A.K., additional, Srivastva, Rahul M., additional, Subramanian, Bhuvaneshwaran, additional, Thakur, Goutam, additional, Thambirajoo, Maheswary, additional, Tripathi, Manoj Kumar, additional, Ünlüer, Özlem Biçen, additional, Verma, Sarika, additional, Vijay, Amulya, additional, Vijayasankar, K.N., additional, Yadav, Ajay, additional, Yeleswarapu, Sriya, additional, Yıldırım, Özüm, additional, Zimran, Steffi, additional, and Zulkiflee, Izzat, additional

Published
2023
Full Text
View/download PDF

12. Lumefantrine, an antimalarial drug, reverses radiation and temozolomide resistance in glioblastoma

Author

Rajesh, Yetirajam, Biswas, Angana, Kumar, Utkarsh, Banerjee, Indranil, Das, Subhayan, Maji, Santanu, Das, Swadesh K, Emdad, Luni, Cavenee, Webster K, Mandal, Mahitosh, and Fisher, Paul B

Subjects
Neurosciences, Brain Cancer, Brain Disorders, Rare Diseases, Orphan Drug, Cancer, 5.1 Pharmaceuticals, Development of treatments and therapeutic interventions, Good Health and Well Being, Antimalarials, Antineoplastic Agents, Alkylating, Brain Neoplasms, Cell Line, Tumor, Drug Resistance, Neoplasm, Epithelial-Mesenchymal Transition, Gene Expression Regulation, Neoplastic, Glioblastoma, Heat-Shock Proteins, Humans, Lumefantrine, Microfilament Proteins, Molecular Chaperones, Temozolomide, Trans-Activators, glioblastoma, HSPB1, Fli-1, radioresistance, TMZ resistance
Abstract

Glioblastoma multiforme (GBM) is an aggressive cancer without currently effective therapies. Radiation and temozolomide (radio/TMZ) resistance are major contributors to cancer recurrence and failed GBM therapy. Heat shock proteins (HSPs), through regulation of extracellular matrix (ECM) remodeling and epithelial mesenchymal transition (EMT), provide mechanistic pathways contributing to the development of GBM and radio/TMZ-resistant GBM. The Friend leukemia integration 1 (Fli-1) signaling network has been implicated in oncogenesis in GBM, making it an appealing target for advancing novel therapeutics. Fli-1 is linked to oncogenic transformation with up-regulation in radio/TMZ-resistant GBM, transcriptionally regulating HSPB1. This link led us to search for targeted molecules that inhibit Fli-1. Expression screening for Fli-1 inhibitors identified lumefantrine, an antimalarial drug, as a probable Fli-1 inhibitor. Docking and isothermal calorimetry titration confirmed interaction between lumefantrine and Fli-1. Lumefantrine promoted growth suppression and apoptosis in vitro in parental and radio/TMZ-resistant GBM and inhibited tumor growth without toxicity in vivo in U87MG GBM and radio/TMZ-resistant GBM orthotopic tumor models. These data reveal that lumefantrine, an FDA-approved drug, represents a potential GBM therapeutic that functions through inhibition of the Fli-1/HSPB1/EMT/ECM remodeling protein networks.

Published
2020

17. New Results On Routing Via Matchings On Graphs

Author

Banerjee, Indranil and Richards, Dana

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In this paper we present some new complexity results on the routing time of a graph under the \textit{routing via matching} model. This is a parallel routing model which was introduced by Alon et al\cite{alon1994routing}. The model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data (pebbles) with its matched partner. Let $G$ be a connected graph with vertices labeled from $\{1,...,n\}$ and the destination vertices of the pebbles are given by a permutation $\pi$. The problem is to find a minimum step routing scheme for the input permutation $\pi$. This is denoted as the routing time $rt(G,\pi)$ of $G$ given $\pi$. In this paper we characterize the complexity of some known problems under the routing via matching model and discuss their relationship to graph connectivity and clique number. We also introduce some new problems in this domain, which may be of independent interest., Comment: 15 Pages, 5 Figures , 21st International Symposium on Fundamentals of Computation Theory. arXiv admin note: text overlap with arXiv:1604.04978

Published
2017

18. Sorting Networks On Restricted Topologies

Author

Banerjee, Indranil, Richards, Dana, and Shinkar, Igor

Subjects
Computer Science - Data Structures and Algorithms
Abstract

The sorting number of a graph with $n$ vertices is the minimum depth of a sorting network with $n$ inputs and outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in terms of sorting numbers of different classes of graphs. In this paper we show the following general results about the sorting number of graphs. Any $n$-vertex graph that contains a simple path of length $d$ has a sorting network of depth $O(n \log(n/d))$. Any $n$-vertex graph with maximal degree $\Delta$ has a sorting network of depth $O(\Delta n)$. We also provide several results that relate the sorting number of a graph with its routing number, size of its maximal matching, and other well known graph properties. Additionally, we give some new bounds on the sorting number for some typical graphs., Comment: 16 pages, 3 figures

Published
2016

19. Routing Number Of A Pyramid

Author

Banerjee, Indranil and Richards, Dana

Subjects
Computer Science - Discrete Mathematics
Abstract

In this short note we give the routing number of pyramid graph under the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph $G$ with vertices labeled from $[1,...,n]$ and a permutation $\pi$ giving the destination of pebbles on the vertices the problem is to find a minimum step routing scheme. This is denoted as the routing time $rt(G,\pi)$ of $G$ given $\pi$. We show that a $d$-dimensional pyramid with $m$ levels has a routing number of $O(dN^{1/d})$., Comment: 3 pages, 2 figures

Published
2016

20. An Inquiry-Based Approach in Large Undergraduate Labs: Learning, by Doing It the 'Wrong' Way

Author

Bachhawat, Anand K., Pandit, Shashi Bhushan, Banerjee, Indranil, Anand, Shashi, Sarkar, Roman, Mrigwani, Arpita, and Mishra, Shravan Kumar

Abstract

Undergraduate laboratory courses, owing to their larger sizes and shorter time slots, are often conducted in highly structured modes. However, this approach is known to interfere with students' engagement in the experiments. To enhance students' engagement, we propose an alternative mode of running laboratory courses by creating some "disorder" in a previously adopted structure. After performing an experiment in the right way, the students were asked to repeat the experiment but with a variation at certain steps leading to the experiment being done the "wrong" way. Although this approach led to fewer experiments being conducted in a semester, it significantly enhanced the students' involvement. This was also reflected in the students' feedback. The majority of students preferred repeating an experiment with a variant protocol than performing a new experiment. Although we have tested this inquiry-based approach only for an undergraduate laboratory course in molecular biology, we believe such an approach could also be extended to undergraduate laboratory courses of other subjects.

Published
2020
Full Text
View/download PDF

24. Routing and Sorting Via Matchings On Graphs

Author

Banerjee, Indranil and Richards, Dana

Subjects
Computer Science - Discrete Mathematics
Abstract

The paper is divided in to two parts. In the first part we present some new results for the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph $G$ with vertices labeled from $[1,...,n]$ and a permutation $\pi$ giving the destination of pebbles on the vertices the problem is to find a minimum step routing scheme. This is denoted as the routing time $rt(G,\pi)$ of $G$ given $\pi$. In this paper we present the following new results, which answer one of the open problems posed in \cite{5}: 1) Determining whether $rt(G,\pi)$ is $\le 2$ can be done in $O(n^{2.5})$ deterministic time for any arbitrary connected graph $G$. 2) Determining whether $rt(G,\pi)$ is $\le k$ for any $k \ge 3$ is NP-Complete. In the second part we study a related property of graphs, which measures how easy it is to design sorting networks using only the edges of a given graph. Informally, \textit{sorting number} of a graph is the minimum depth sorting network that only uses edges of the graph. Many of the classical results on sorting networks can be represented in this framework. We show that a tree with maximum degree $\Delta$ can accommodate a $O(\min(n\Delta^2,n^2))$ depth sorting network. Additionally, we give two instance of trees for which this bound is tight., Comment: 14 pages, submitted to ESA 2016

Published
2016

26. Sorting Under 1-$\infty$ Cost Model

Author

Banerjee, Indranil and Richards, Dana

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In this paper we study the problem of sorting under non-uniform comparison costs, where costs are either 1 or $\infty$. If comparing a pair has an associated cost of $\infty$ then we say that such a pair cannot be compared (forbidden pairs). Along with the set of elements $V$ the input to our problem is a graph $G(V, E)$, whose edges represents the pairs that we can compare incurring an unit of cost. Given a graph with $n$ vertices and $q$ forbidden edges we propose the first non-trivial deterministic algorithm which makes $O((q + n)\log{n})$ comparisons with a total complexity of $O(n^2 + q^{\omega/2})$, where $\omega$ is the exponent in the complexity of matrix multiplication. We also propose a simple randomized algorithm for the problem which makes $\widetilde{O}(n^2/\sqrt{q + n} + n\sqrt{q})$ probes with high probability. When the input graph is random we show that $\widetilde{O}(\min{(n^{3/2}, pn^2)})$ probes suffice, where $p$ is the edge probability., Comment: 12 pages, 1 figure, submitted to STOC 2016

Published
2015

27. Computing Maximal Layers Of Points in $E^{f(n)}$

Author

Banerjee, Indranil and Richards, Dana

Subjects
Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms
Abstract

In this paper we present a randomized algorithm for computing the collection of maximal layers for a point set in $E^{k}$ ($k = f(n)$). The input to our algorithm is a point set $P = \{p_1,...,p_n\}$ with $p_i \in E^{k}$. The proposed algorithm achieves a runtime of $O\left(kn^{2 - {1 \over \log{k}} + \log_k{\left(1 + {2 \over {k+1}}\right)}}\log{n}\right)$ when $P$ is a random order and a runtime of $O(k^2 n^{3/2 + (\log_{k}{(k-1)})/2}\log{n})$ for an arbitrary $P$. Both bounds hold in expectation. Additionally, the run time is bounded by $O(kn^2)$ in the worst case. This is the first non-trivial algorithm whose run-time remains polynomial whenever $f(n)$ is bounded by some polynomial in $n$ while remaining sub-quadratic in $n$ for constant $k$. The algorithm is implemented using a new data-structure for storing and answering dominance queries over the set of incomparable points., Comment: 13 pages, submitted to LATIN 2016

Published
2015

30. Sorting Networks on Restricted Topologies

Author

Banerjee, Indranil, Richards, Dana, Shinkar, Igor, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Catania, Barbara, editor, Královič, Rastislav, editor, Nawrocki, Jerzy, editor, and Pighizzini, Giovanni, editor

Published
2019
Full Text
View/download PDF

45. Contributors

Author

Agarwal, Saumya, primary, Ahmed, Jasim, additional, Amulyasai, B., additional, Anandharamakrishnan, C., additional, Anis, Arfat, additional, Arshad, Muhammad, additional, Banerjee, Indranil, additional, Bera, Manav Bandhu, additional, Bhaskar, Rakesh, additional, Bhattarai, Pravin, additional, Bishoyi, Nisarani, additional, Biswas, Prasanta Kumar, additional, Bodade, Ragini G, additional, Bodade, Anand G, additional, Bose, Subhadeep, additional, Çağlar, Muhammed Yusuf, additional, Çavuş, Mustafa, additional, Chen, Jianshe, additional, Chopra, Harish Kumar, additional, Chung, Donghwa, additional, David, Geta, additional, Deb, Raj, additional, Demirci, Mehmet, additional, Deng, Win-Ping, additional, Dhumal, Chanda Vilas, additional, Dubey, Navneet Kumar, additional, Dubey, Rajni, additional, Dutta, Sayantani, additional, Foujdar, Rimpi, additional, Ganguly, Advaita, additional, George, Ann Mary, additional, Gupta, Mukesh Kumar, additional, Hameed, Sadaf, additional, Hanh Nguyen, Thi Thanh, additional, Hasnain, Md Saquib, additional, Hoque, Monjurul, additional, Ilomuanya, Margaret O., additional, Jeslin, John, additional, Jin, Juhui, additional, Kar, Padmaja, additional, Kim, Hyo Jin, additional, Kim, Doman, additional, Kumar, Sanjeev, additional, Lee, Chi-Ching, additional, Lee Turner, Timothy, additional, Mahalakshmi, L., additional, Maity, Tanushree, additional, Maji, Samrendra, additional, Majumder, Kaustav, additional, Maria Leena, M., additional, Mohapatra, Nupur, additional, Moses, Jeyan A., additional, Mukherjee, Soma, additional, Nayak, Amit Kumar, additional, Nayak, Suraj Kumar, additional, Padhan, Bhagyashree, additional, Pal, Dilipkumar, additional, Pal, Kunal, additional, Patel, Ashok R., additional, Pradhan, Rehan Ali, additional, Prajapati, Sushant, additional, Qureshi, Dilshad, additional, Rao, K.J., additional, Ray, Sirsendu S., additional, Reddy Peddireddy, Sai Preetham, additional, Rodrigues, Fiona Concy, additional, Sagiri, Sai S., additional, Sapei, Lanny, additional, Sarkar, Nandini, additional, Sarkar, Preetam, additional, Sarkar, Angana, additional, Saxena, Alok, additional, Septiana, Iis, additional, Sharma, Kumakshi, additional, Sharma, Loveleen, additional, Singh, Abhinay Kumar, additional, Singh, Vinay K., additional, Suci Dharmayanti, Agustin Wulan, additional, Suzuki, Yumewo, additional, Syed, Irshaan, additional, Tabuchi, Akira, additional, Thakur, Goutam, additional, Ullah, Aman, additional, Upadhyay, Rituja, additional, Verma, Madan L., additional, Wang, Lei, additional, Wankhade, Varsha, additional, Yamada, Hiroyuki, additional, Yamatoya, Kazuhiko, additional, Zhang, Yue, additional, and Zubair, Muhammad, additional

Published
2020
Full Text
View/download PDF

50. Identification of diphenylurea derivatives as novel endocytosis inhibitors that demonstrate broad-spectrum activity against SARS-CoV-2 and influenza A virus both in vitro and in vivo

Author

Kumar, Nirmal, primary, Taily, Irshad Maajid, additional, Singh, Charandeep, additional, Kumar, Sahil, additional, Rajmani, Raju S., additional, Chakraborty, Debajyoti, additional, Sharma, Anshul, additional, Singh, Priyanka, additional, Thakur, Krishan Gopal, additional, Varadarajan, Raghavan, additional, Ringe, Rajesh P., additional, Banerjee, Prabal, additional, and Banerjee, Indranil, additional

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results