25,571 results on '"Chowdhury P"'
Search Results
2. Deep Neural Network-Based Sign Language Recognition: A Comprehensive Approach Using Transfer Learning with Explainability
- Author
-
Ridwan, A. E. M, Chowdhury, Mushfiqul Islam, Mary, Mekhala Mariam, and Abir, Md Tahmid Chowdhury
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
To promote inclusion and ensuring effective communication for those who rely on sign language as their main form of communication, sign language recognition (SLR) is crucial. Sign language recognition (SLR) seamlessly incorporates with diverse technology, enhancing accessibility for the deaf community by facilitating their use of digital platforms, video calls, and communication devices. To effectively solve this problem, we suggest a novel solution that uses a deep neural network to fully automate sign language recognition. This methodology integrates sophisticated preprocessing methodologies to optimise the overall performance. The architectures resnet, inception, xception, and vgg are utilised to selectively categorise images of sign language. We prepared a DNN architecture and merged it with the pre-processing architectures. In the post-processing phase, we utilised the SHAP deep explainer, which is based on cooperative game theory, to quantify the influence of specific features on the output of a machine learning model. Bhutanese-Sign-Language (BSL) dataset was used for training and testing the suggested technique. While training on Bhutanese-Sign-Language (BSL) dataset, overall ResNet50 with the DNN model performed better accuracy which is 98.90%. Our model's ability to provide informational clarity was assessed using the SHAP (SHapley Additive exPlanations) method. In part to its considerable robustness and reliability, the proposed methodological approach can be used to develop a fully automated system for sign language recognition.
- Published
- 2024
3. Meeting the Challenges of Online Education during COVID-19 Pandemic: Implications for Blended Learning
- Author
-
Nehreen Maj, Arjumand Ara, and Sarwar R. Chowdhury
- Abstract
In response to the COVID-19 pandemic, technological and administrative systems for implementing online learning, and the infrastructure that supports its access and delivery, had to be adapted quickly. While disparity in accessibility existed between urban and rural students, extensive resources had been allocated and processes developed to connect learners with course activities and materials, to facilitate communication between instructors and students, and to manage the administration of online learning. Educators needed to make way for this transition with the available technological support and their existing IT skills. Although the pandemic is over, online education still remains a viable option for continuing education in an emergency situation. Exploring the challenges faced during the COVID-19 pandemic and delving deep into the nature and the types of these challenges and their possible reasons will pave the way of translating these insights into academic practices required for laying the foundation of blended learning (BL) in higher education. Recently the University Grants Commission of Bangladesh has published a proposal for adopting BL in the higher education institutions of Bangladesh. This case study consisting of both quantitative and qualitative research, explores the challenges faced by the teachers of the University of Asia Pacific (UAP) during the online shift of education because of the pandemic. Based on the findings, a blended learning framework has been developed which can be applied in tertiary level education in Bangladesh and elsewhere.
- Published
- 2024
4. Nearest Neighbor Normalization Improves Multimodal Retrieval
- Author
-
Chowdhury, Neil, Wang, Franklin, Shenoy, Sumedh, Kiela, Douwe, Schwettmann, Sarah, and Thrush, Tristan
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Multimodal models leverage large-scale pre-training to achieve strong but still imperfect performance on tasks such as image captioning, visual question answering, and cross-modal retrieval. In this paper, we present a simple and efficient method for correcting errors in trained contrastive image-text retrieval models with no additional training, called Nearest Neighbor Normalization (NNN). We show an improvement on retrieval metrics in both text retrieval and image retrieval for all of the contrastive models that we tested (CLIP, BLIP, ALBEF, SigLIP, BEiT) and for both of the datasets that we used (MS-COCO and Flickr30k). NNN requires a reference database, but does not require any training on this database, and can even increase the retrieval accuracy of a model after finetuning.
- Published
- 2024
5. Physics of collective transport and traffic phenomena in biology: progress in 20 years
- Author
-
Chowdhury, Debashish, Schadschneider, Andreas, and Nishinari, Katsuhiro
- Subjects
Physics - Biological Physics ,Condensed Matter - Statistical Mechanics ,Nonlinear Sciences - Cellular Automata and Lattice Gases ,Quantitative Biology - Quantitative Methods - Abstract
Enormous progress have been made in the last 20 years since the publication of our review \cite{csk05polrev} in this journal on transport and traffic phenomena in biology. In this brief article we present a glimpse of the major advances during this period. First, we present similarities and differences between collective intracellular transport of a single micron-size cargo by multiple molecular motors and that of a cargo particle by a team of ants on the basis of the common principle of load-sharing. Second, we sketch several models all of which are biologically motivated extensions of the Asymmetric Simple Exclusion Process (ASEP); some of these models represent the traffic of molecular machines, like RNA polymerase (RNAP) and ribosome, that catalyze template-directed polymerization of RNA and proteins, respectively, whereas few other models capture the key features of the traffic of ants on trails. More specifically, using the ASEP-based models we demonstrate the effects of traffic of RNAPs and ribosomes on random and `programmed' errors in gene expression as well as on some other subcellular processes. We recall a puzzling empirical result on the single-lane traffic of predatory ants {\it Leptogenys processionalis} as well as recent attempts to account for this puzzle. We also mention some surprising effects of lane-changing rules observed in a ASEP-based model for 3-lane traffic of army ants. Finally, we explain the conceptual similarities between the pheromone-mediated indirect communication, called stigmergy, between ants on a trail and the floor-field-mediated interaction between humans in a pedestrian traffic. For the floor-field model of human pedestrian traffic we present a major theoretical result that is relevant from the perspective of all types of traffic phenomena., Comment: 17 pages including 8 figures; to be submitted to "Physics of Life Reviews"
- Published
- 2024
6. Fr\'ohlich versus Bose-Einstein Condensation in Pumped Bosonic Systems
- Author
-
Xu, Wenhao, Bagrov, Andrey A., Chowdhury, Farhan T., Smith, Luke D., Kattnig, Daniel R., Kappen, Hilbert J., and Katsnelson, Mikhail I.
- Subjects
Condensed Matter - Quantum Gases ,Quantum Physics - Abstract
Magnon-condensation, which emerges in pumped bosonic systems at room temperature, continues to garner great interest for its long-lived coherence. While traditionally formulated in terms of Bose-Einstein condensation, which typically occurs at ultra-low temperatures, it could potentially also be explained by Fr\"ohlich-condensation, a hypothesis of Bose-Einstein-like condensation in living systems at ambient temperatures. Here, we elucidate the essential features of magnon-condensation in an open quantum system (OQS) formulation, wherein magnons dissipatively interact with a phonon bath. Our derived equations of motion for expected magnon occupations turns out to be similar in form to the rate equations governing Fr\"ohlich-condensation. Provided that specific system parameters result in correlations amplifying or diminishing the condensation effects, we thereby posit that our treatment offers a better description of high-temperature condensation as opposed to traditional descriptions using equilibrium thermodynamics. By comparing our OQS derivation with the original uncorrelated and previous semi-classical rate equations, we furthermore highlight how both classical anti-correlations and quantum correlations alter the bosonic occupation distribution., Comment: 7 pages, 2 figures, plus supplementary material (8 pages)
- Published
- 2024
7. Detection of Dark Matter using levitated nanoparticles within a Bessel-Gaussian beam via Yukawa coupling
- Author
-
Chowdhury, Iftekher S., Akhouri, Binay Prakash, Haque, Shah, Bacci, Martin H., and Howard, Eric
- Subjects
High Energy Physics - Phenomenology ,General Relativity and Quantum Cosmology ,High Energy Physics - Experiment - Abstract
We present a novel experimental approach to detect dark matter by probing Yukawa interactions, commonly referred to as a fifth force, between dark matter and baryonic matter. Our method involves optically levitating nanoparticles within a Bessel-Gaussian beam to detect minute forces exerted by potential dark matter interaction with test masses. The non-diffracting properties of Bessel-Gaussian beams, combined with feedback cooling techniques, provide exceptional sensitivity to small perturbations in the motion of the nanoparticles. This setup allows for precise control over trapping conditions and enhances the detection sensitivity to forces on the order of \(10^{-18}\) N. We explore the parameter space of the Yukawa interaction, focusing on the coupling strength (\(\alpha\)) and interaction range (\(\lambda\)), and discuss the potential of this experiment to place new constraints on dark matter couplings, complementing existing direct detection methods., Comment: 22 pages, 7 figures, 1 table
- Published
- 2024
8. Fast Hyperspectral Neutron Tomography
- Author
-
Chowdhury, Mohammad Samin Nur, Yang, Diyu, Tang, Shimin, Venkatakrishnan, Singanallur V., Bilheux, Hassina Z., Buzzard, Gregery T., and Bouman, Charles A.
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Electrical Engineering and Systems Science - Signal Processing - Abstract
Hyperspectral neutron computed tomography is a tomographic imaging technique in which thousands of wavelength-specific neutron radiographs are typically measured for each tomographic view. In conventional hyperspectral reconstruction, data from each neutron wavelength bin is reconstructed separately, which is extremely time-consuming. These reconstructions often suffer from poor quality due to low signal-to-noise ratio. Consequently, material decomposition based on these reconstructions tends to lead to both inaccurate estimates of the material spectra and inaccurate volumetric material separation. In this paper, we present two novel algorithms for processing hyperspectral neutron data: fast hyperspectral reconstruction and fast material decomposition. Both algorithms rely on a subspace decomposition procedure that transforms hyperspectral views into low-dimensional projection views within an intermediate subspace, where tomographic reconstruction is performed. The use of subspace decomposition dramatically reduces reconstruction time while reducing both noise and reconstruction artifacts. We apply our algorithms to both simulated and measured neutron data and demonstrate that they reduce computation and improve the quality of the results relative to conventional methods.
- Published
- 2024
9. Exocentric To Egocentric Transfer For Action Recognition: A Short Survey
- Author
-
Thatipelli, Anirudh, Lo, Shao-Yuan, and Roy-Chowdhury, Amit K.
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Egocentric vision captures the scene from the point of view of the camera wearer while exocentric vision captures the overall scene context. Jointly modeling ego and exo views is crucial to developing next-generation AI agents. The community has regained interest in the field of egocentric vision. While the third-person view and first-person have been thoroughly investigated, very few works aim to study both synchronously. Exocentric videos contain many relevant signals that are transferrable to egocentric videos. In this paper, we provide a broad overview of works combining egocentric and exocentric visions.
- Published
- 2024
10. GPT-4o System Card
- Author
-
OpenAI, Hurst, Aaron, Lerer, Adam, Goucher, Adam P., Perelman, Adam, Ramesh, Aditya, Clark, Aidan, Ostrow, AJ, Welihinda, Akila, Hayes, Alan, Radford, Alec, Mądry, Aleksander, Baker-Whitcomb, Alex, Beutel, Alex, Borzunov, Alex, Carney, Alex, Chow, Alex, Kirillov, Alex, Nichol, Alex, Paino, Alex, Renzin, Alex, Passos, Alex Tachard, Kirillov, Alexander, Christakis, Alexi, Conneau, Alexis, Kamali, Ali, Jabri, Allan, Moyer, Allison, Tam, Allison, Crookes, Amadou, Tootoochian, Amin, Tootoonchian, Amin, Kumar, Ananya, Vallone, Andrea, Karpathy, Andrej, Braunstein, Andrew, Cann, Andrew, Codispoti, Andrew, Galu, Andrew, Kondrich, Andrew, Tulloch, Andrew, Mishchenko, Andrey, Baek, Angela, Jiang, Angela, Pelisse, Antoine, Woodford, Antonia, Gosalia, Anuj, Dhar, Arka, Pantuliano, Ashley, Nayak, Avi, Oliver, Avital, Zoph, Barret, Ghorbani, Behrooz, Leimberger, Ben, Rossen, Ben, Sokolowsky, Ben, Wang, Ben, Zweig, Benjamin, Hoover, Beth, Samic, Blake, McGrew, Bob, Spero, Bobby, Giertler, Bogo, Cheng, Bowen, Lightcap, Brad, Walkin, Brandon, Quinn, Brendan, Guarraci, Brian, Hsu, Brian, Kellogg, Bright, Eastman, Brydon, Lugaresi, Camillo, Wainwright, Carroll, Bassin, Cary, Hudson, Cary, Chu, Casey, Nelson, Chad, Li, Chak, Shern, Chan Jun, Conger, Channing, Barette, Charlotte, Voss, Chelsea, Ding, Chen, Lu, Cheng, Zhang, Chong, Beaumont, Chris, Hallacy, Chris, Koch, Chris, Gibson, Christian, Kim, Christina, Choi, Christine, McLeavey, Christine, Hesse, Christopher, Fischer, Claudia, Winter, Clemens, Czarnecki, Coley, Jarvis, Colin, Wei, Colin, Koumouzelis, Constantin, Sherburn, Dane, Kappler, Daniel, Levin, Daniel, Levy, Daniel, Carr, David, Farhi, David, Mely, David, Robinson, David, Sasaki, David, Jin, Denny, Valladares, Dev, Tsipras, Dimitris, Li, Doug, Nguyen, Duc Phong, Findlay, Duncan, Oiwoh, Edede, Wong, Edmund, Asdar, Ehsan, Proehl, Elizabeth, Yang, Elizabeth, Antonow, Eric, Kramer, Eric, Peterson, Eric, Sigler, Eric, Wallace, Eric, Brevdo, Eugene, Mays, Evan, Khorasani, Farzad, Such, Felipe Petroski, Raso, Filippo, Zhang, Francis, von Lohmann, Fred, Sulit, Freddie, Goh, Gabriel, Oden, Gene, Salmon, Geoff, Starace, Giulio, Brockman, Greg, Salman, Hadi, Bao, Haiming, Hu, Haitang, Wong, Hannah, Wang, Haoyu, Schmidt, Heather, Whitney, Heather, Jun, Heewoo, Kirchner, Hendrik, Pinto, Henrique Ponde de Oliveira, Ren, Hongyu, Chang, Huiwen, Chung, Hyung Won, Kivlichan, Ian, O'Connell, Ian, Osband, Ian, Silber, Ian, Sohl, Ian, Okuyucu, Ibrahim, Lan, Ikai, Kostrikov, Ilya, Sutskever, Ilya, Kanitscheider, Ingmar, Gulrajani, Ishaan, Coxon, Jacob, Menick, Jacob, Pachocki, Jakub, Aung, James, Betker, James, Crooks, James, Lennon, James, Kiros, Jamie, Leike, Jan, Park, Jane, Kwon, Jason, Phang, Jason, Teplitz, Jason, Wei, Jason, Wolfe, Jason, Chen, Jay, Harris, Jeff, Varavva, Jenia, Lee, Jessica Gan, Shieh, Jessica, Lin, Ji, Yu, Jiahui, Weng, Jiayi, Tang, Jie, Yu, Jieqi, Jang, Joanne, Candela, Joaquin Quinonero, Beutler, Joe, Landers, Joe, Parish, Joel, Heidecke, Johannes, Schulman, John, Lachman, Jonathan, McKay, Jonathan, Uesato, Jonathan, Ward, Jonathan, Kim, Jong Wook, Huizinga, Joost, Sitkin, Jordan, Kraaijeveld, Jos, Gross, Josh, Kaplan, Josh, Snyder, Josh, Achiam, Joshua, Jiao, Joy, Lee, Joyce, Zhuang, Juntang, Harriman, Justyn, Fricke, Kai, Hayashi, Kai, Singhal, Karan, Shi, Katy, Karthik, Kavin, Wood, Kayla, Rimbach, Kendra, Hsu, Kenny, Nguyen, Kenny, Gu-Lemberg, Keren, Button, Kevin, Liu, Kevin, Howe, Kiel, Muthukumar, Krithika, Luther, Kyle, Ahmad, Lama, Kai, Larry, Itow, Lauren, Workman, Lauren, Pathak, Leher, Chen, Leo, Jing, Li, Guy, Lia, Fedus, Liam, Zhou, Liang, Mamitsuka, Lien, Weng, Lilian, McCallum, Lindsay, Held, Lindsey, Ouyang, Long, Feuvrier, Louis, Zhang, Lu, Kondraciuk, Lukas, Kaiser, Lukasz, Hewitt, Luke, Metz, Luke, Doshi, Lyric, Aflak, Mada, Simens, Maddie, Boyd, Madelaine, Thompson, Madeleine, Dukhan, Marat, Chen, Mark, Gray, Mark, Hudnall, Mark, Zhang, Marvin, Aljubeh, Marwan, Litwin, Mateusz, Zeng, Matthew, Johnson, Max, Shetty, Maya, Gupta, Mayank, Shah, Meghan, Yatbaz, Mehmet, Yang, Meng Jia, Zhong, Mengchao, Glaese, Mia, Chen, Mianna, Janner, Michael, Lampe, Michael, Petrov, Michael, Wu, Michael, Wang, Michele, Fradin, Michelle, Pokrass, Michelle, Castro, Miguel, de Castro, Miguel Oom Temudo, Pavlov, Mikhail, Brundage, Miles, Wang, Miles, Khan, Minal, Murati, Mira, Bavarian, Mo, Lin, Molly, Yesildal, Murat, Soto, Nacho, Gimelshein, Natalia, Cone, Natalie, Staudacher, Natalie, Summers, Natalie, LaFontaine, Natan, Chowdhury, Neil, Ryder, Nick, Stathas, Nick, Turley, Nick, Tezak, Nik, Felix, Niko, Kudige, Nithanth, Keskar, Nitish, Deutsch, Noah, Bundick, Noel, Puckett, Nora, Nachum, Ofir, Okelola, Ola, Boiko, Oleg, Murk, Oleg, Jaffe, Oliver, Watkins, Olivia, Godement, Olivier, Campbell-Moore, Owen, Chao, Patrick, McMillan, Paul, Belov, Pavel, Su, Peng, Bak, Peter, Bakkum, Peter, Deng, Peter, Dolan, Peter, Hoeschele, Peter, Welinder, Peter, Tillet, Phil, Pronin, Philip, Tillet, Philippe, Dhariwal, Prafulla, Yuan, Qiming, Dias, Rachel, Lim, Rachel, Arora, Rahul, Troll, Rajan, Lin, Randall, Lopes, Rapha Gontijo, Puri, Raul, Miyara, Reah, Leike, Reimar, Gaubert, Renaud, Zamani, Reza, Wang, Ricky, Donnelly, Rob, Honsby, Rob, Smith, Rocky, Sahai, Rohan, Ramchandani, Rohit, Huet, Romain, Carmichael, Rory, Zellers, Rowan, Chen, Roy, Chen, Ruby, Nigmatullin, Ruslan, Cheu, Ryan, Jain, Saachi, Altman, Sam, Schoenholz, Sam, Toizer, Sam, Miserendino, Samuel, Agarwal, Sandhini, Culver, Sara, Ethersmith, Scott, Gray, Scott, Grove, Sean, Metzger, Sean, Hermani, Shamez, Jain, Shantanu, Zhao, Shengjia, Wu, Sherwin, Jomoto, Shino, Wu, Shirong, Shuaiqi, Xia, Phene, Sonia, Papay, Spencer, Narayanan, Srinivas, Coffey, Steve, Lee, Steve, Hall, Stewart, Balaji, Suchir, Broda, Tal, Stramer, Tal, Xu, Tao, Gogineni, Tarun, Christianson, Taya, Sanders, Ted, Patwardhan, Tejal, Cunninghman, Thomas, Degry, Thomas, Dimson, Thomas, Raoux, Thomas, Shadwell, Thomas, Zheng, Tianhao, Underwood, Todd, Markov, Todor, Sherbakov, Toki, Rubin, Tom, Stasi, Tom, Kaftan, Tomer, Heywood, Tristan, Peterson, Troy, Walters, Tyce, Eloundou, Tyna, Qi, Valerie, Moeller, Veit, Monaco, Vinnie, Kuo, Vishal, Fomenko, Vlad, Chang, Wayne, Zheng, Weiyi, Zhou, Wenda, Manassra, Wesam, Sheu, Will, Zaremba, Wojciech, Patil, Yash, Qian, Yilei, Kim, Yongjik, Cheng, Youlong, Zhang, Yu, He, Yuchen, Zhang, Yuchen, Jin, Yujia, Dai, Yunxing, and Malkov, Yury
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Computers and Society ,Computer Science - Machine Learning ,Computer Science - Sound ,Electrical Engineering and Systems Science - Audio and Speech Processing - Abstract
GPT-4o is an autoregressive omni model that accepts as input any combination of text, audio, image, and video, and generates any combination of text, audio, and image outputs. It's trained end-to-end across text, vision, and audio, meaning all inputs and outputs are processed by the same neural network. GPT-4o can respond to audio inputs in as little as 232 milliseconds, with an average of 320 milliseconds, which is similar to human response time in conversation. It matches GPT-4 Turbo performance on text in English and code, with significant improvement on text in non-English languages, while also being much faster and 50\% cheaper in the API. GPT-4o is especially better at vision and audio understanding compared to existing models. In line with our commitment to building AI safely and consistent with our voluntary commitments to the White House, we are sharing the GPT-4o System Card, which includes our Preparedness Framework evaluations. In this System Card, we provide a detailed look at GPT-4o's capabilities, limitations, and safety evaluations across multiple categories, focusing on speech-to-speech while also evaluating text and image capabilities, and measures we've implemented to ensure the model is safe and aligned. We also include third-party assessments on dangerous capabilities, as well as discussion of potential societal impacts of GPT-4o's text and vision capabilities.
- Published
- 2024
11. Benchmarking quantum chaos from geometric complexity
- Author
-
Bhattacharyya, Arpan, Brahma, Suddhasattwa, Chowdhury, Satyaki, and Luo, Xiancong
- Subjects
High Energy Physics - Theory ,General Relativity and Quantum Cosmology ,Quantum Physics - Abstract
Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to benchmark the quantum chaos in a well-known oscillator model. In particular, we study the circuit complexity for the unitary time-evolution operator of a non-Gaussian bosonic quantum mechanical system. Our results indicate that, within some limitations, geometric complexity can indeed be a good indicator of quantum chaos., Comment: 23 pages, 4 figures
- Published
- 2024
12. Probing Ranking LLMs: Mechanistic Interpretability in Information Retrieval
- Author
-
Chowdhury, Tanya and Allan, James
- Subjects
Computer Science - Information Retrieval ,Computer Science - Machine Learning - Abstract
Transformer networks, especially those with performance on par with GPT models, are renowned for their powerful feature extraction capabilities. However, the nature and correlation of these features with human-engineered ones remain unclear. In this study, we delve into the mechanistic workings of state-of-the-art, fine-tuning-based passage-reranking transformer networks. Our approach involves a probing-based, layer-by-layer analysis of neurons within ranking LLMs to identify individual or groups of known human-engineered and semantic features within the network's activations. We explore a wide range of features, including lexical, document structure, query-document interaction, advanced semantic, interaction-based, and LLM-specific features, to gain a deeper understanding of the underlying mechanisms that drive ranking decisions in LLMs. Our results reveal a set of features that are prominently represented in LLM activations, as well as others that are notably absent. Additionally, we observe distinct behaviors of LLMs when processing low versus high relevance queries and when encountering out-of-distribution query and document sets. By examining these features within activations, we aim to enhance the interpretability and performance of LLMs in ranking tasks. Our findings provide valuable insights for the development of more effective and transparent ranking models, with significant implications for the broader information retrieval community. All scripts and code necessary to replicate our findings are made available., Comment: 9 pages
- Published
- 2024
13. SERN: Simulation-Enhanced Realistic Navigation for Multi-Agent Robotic Systems in Contested Environments
- Author
-
Hossain, Jumman, Dey, Emon, Chugh, Snehalraj, Ahmed, Masud, Anwar, MS, Faridee, Abu-Zaher, Hoppes, Jason, Trout, Theron, Basak, Anjon, Chowdhury, Rafidh, Mistry, Rishabh, Kim, Hyun, Freeman, Jade, Suri, Niranjan, Raglin, Adrienne, Busart, Carl, Gregory, Timothy, Ravi, Anuradha, and Roy, Nirmalya
- Subjects
Computer Science - Robotics ,Computer Science - Multiagent Systems - Abstract
The increasing deployment of autonomous systems in complex environments necessitates efficient communication and task completion among multiple agents. This paper presents SERN (Simulation-Enhanced Realistic Navigation), a novel framework integrating virtual and physical environments for real-time collaborative decision-making in multi-robot systems. SERN addresses key challenges in asset deployment and coordination through a bi-directional communication framework using the AuroraXR ROS Bridge. Our approach advances the SOTA through accurate real-world representation in virtual environments using Unity high-fidelity simulator; synchronization of physical and virtual robot movements; efficient ROS data distribution between remote locations; and integration of SOTA semantic segmentation for enhanced environmental perception. Our evaluations show a 15% to 24% improvement in latency and up to a 15% increase in processing efficiency compared to traditional ROS setups. Real-world and virtual simulation experiments with multiple robots demonstrate synchronization accuracy, achieving less than 5 cm positional error and under 2-degree rotational error. These results highlight SERN's potential to enhance situational awareness and multi-agent coordination in diverse, contested environments., Comment: Under Review for ICRA 2025
- Published
- 2024
14. Is the low-energy optical absorption in correlated insulators controlled by quantum geometry?
- Author
-
Mao, Dan, Mendez-Valderrama, Juan Felipe, and Chowdhury, Debanjan
- Subjects
Condensed Matter - Strongly Correlated Electrons - Abstract
Inspired by the discovery of a variety of correlated insulators in the moir\'e universe, controlled by interactions projected to a set of isolated bands with a narrow bandwidth, we examine here a partial sum-rule associated with the inverse frequency-weighted optical conductivity restricted to low-energies. Unlike standard sum-rules that extend out to $infinite$ frequencies, which include contributions from $all$ inter-band transitions, we focus here on transitions associated $only$ with the $projected$ degrees of freedom. We analyze the partial sum-rule in a non-perturbative but "solvable" limit for a variety of correlation-induced insulators. This includes (i) magic-angle twisted bilayer graphene at integer-filling with projected Coulomb interactions, starting from the chiral flat-band limit and including realistic perturbations, (ii) fractional fillings of Chern-bands which support generalized Laughlin-like states, starting from a Landau-level and including a periodic potential and magnetic-field, respectively, drawing connections to twisted MoTe$_2$, and (iii) integer filling in toy-models of non-topological flat-bands with a tunable quantum geometry in the presence of repulsive interactions. The partial sum-rule in all of these examples is implicitly constrained by the form of the band quantum geometry via the low-lying excitation spectrum, but is not related to it explicitly. For interacting Slater-determinant insulators, the partial sum-rule is related to a new quantity -- "many-body projected quantum geometry" -- obtained from the interaction-renormalized electronic bands. We also point out an intriguing connection between the partial sum-rule and the quantum Fisher information associated with the projected many-body position operator., Comment: Main text: 14 pages, 5 figures, Supplementary information: 5 pages
- Published
- 2024
15. Continuous relativistic high-harmonic generation from a kHz liquid-sheet plasma mirror
- Author
-
Cavagna, Antoine, Eder, Milo, Chowdhury, Enam, Kalouguine, André, Kaur, Jaismeen, Mourou, Gérard, Haessler, Stefan, and Martens, Rodrigo Lopez
- Subjects
Physics - Plasma Physics - Abstract
We report on continuous high-harmonic generation at 1 kHz repetition rate from a liquid-sheet plasma mirror driven by relativistic-intensity near-single-cycle light transients. Through precise control of both the surface plasma density gradient and the driving light waveform, we can produce highly stable and reproducible extreme ultraviolet spectral quasi-continua, corresponding to the generation of stable kHz-trains of isolated attosecond pulses in the time domain. This confirms the exciting potential of liquid sheet targets as one of the building blocks of future high-power attosecond lasers.
- Published
- 2024
16. UniMTS: Unified Pre-training for Motion Time Series
- Author
-
Zhang, Xiyuan, Teng, Diyan, Chowdhury, Ranak Roy, Li, Shuheng, Hong, Dezhi, Gupta, Rajesh K., and Shang, Jingbo
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Motion time series collected from mobile and wearable devices such as smartphones and smartwatches offer significant insights into human behavioral patterns, with wide applications in healthcare, automation, IoT, and AR/XR due to their low-power, always-on nature. However, given security and privacy concerns, building large-scale motion time series datasets remains difficult, preventing the development of pre-trained models for human activity analysis. Typically, existing models are trained and tested on the same dataset, leading to poor generalizability across variations in device location, device mounting orientation and human activity type. In this paper, we introduce UniMTS, the first unified pre-training procedure for motion time series that generalizes across diverse device latent factors and activities. Specifically, we employ a contrastive learning framework that aligns motion time series with text descriptions enriched by large language models. This helps the model learn the semantics of time series to generalize across activities. Given the absence of large-scale motion time series data, we derive and synthesize time series from existing motion skeleton data with all-joint coverage. Spatio-temporal graph networks are utilized to capture the relationships across joints for generalization across different device locations. We further design rotation-invariant augmentation to make the model agnostic to changes in device mounting orientations. Our model shows exceptional generalizability across 18 motion time series classification benchmark datasets, outperforming the best baselines by 340% in the zero-shot setting, 16.3% in the few-shot setting, and 9.2% in the full-shot setting., Comment: NeurIPS 2024. Code: https://github.com/xiyuanzh/UniMTS. Model: https://huggingface.co/xiyuanz/UniMTS
- Published
- 2024
17. Multi-modal Pose Diffuser: A Multimodal Generative Conditional Pose Prior
- Author
-
Ta, Calvin-Khang, Dutta, Arindam, Kundu, Rohit, Lal, Rohit, Cruz, Hannah Dela, Raychaudhuri, Dripta S., and Roy-Chowdhury, Amit
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
The Skinned Multi-Person Linear (SMPL) model plays a crucial role in 3D human pose estimation, providing a streamlined yet effective representation of the human body. However, ensuring the validity of SMPL configurations during tasks such as human mesh regression remains a significant challenge , highlighting the necessity for a robust human pose prior capable of discerning realistic human poses. To address this, we introduce MOPED: \underline{M}ulti-m\underline{O}dal \underline{P}os\underline{E} \underline{D}iffuser. MOPED is the first method to leverage a novel multi-modal conditional diffusion model as a prior for SMPL pose parameters. Our method offers powerful unconditional pose generation with the ability to condition on multi-modal inputs such as images and text. This capability enhances the applicability of our approach by incorporating additional context often overlooked in traditional pose priors. Extensive experiments across three distinct tasks-pose estimation, pose denoising, and pose completion-demonstrate that our multi-modal diffusion model-based prior significantly outperforms existing methods. These results indicate that our model captures a broader spectrum of plausible human poses.
- Published
- 2024
18. A dual physics-informed neural network for topology optimization
- Author
-
Singh, Ajendra, Chakraborty, Souvik, and Chowdhury, Rajib
- Subjects
Physics - Computational Physics - Abstract
We propose a novel dual physics-informed neural network for topology optimization (DPNN-TO), which merges physics-informed neural networks (PINNs) with the traditional SIMP-based topology optimization (TO) algorithm. This approach leverages two interlinked neural networks-a displacement network and an implicit density network-connected through an energy-minimization-based loss function derived from the variational principles of the governing equations. By embedding deep learning within the physical constraints of the problem, DPNN-TO eliminates the need for large-scale data and analytical sensitivity analysis, addressing key limitations of traditional methods. The framework efficiently minimizes compliance through energy-based objectives while enforcing volume fraction constraints, producing high-resolution designs for both 2D and 3D optimization problems. Extensive numerical validation demonstrates that DPNN-TO outperforms conventional methods, solving complex structural optimization scenarios with greater flexibility and computational efficiency, while addressing challenges such as multiple load cases and three-dimensional problems without compromising accuracy.
- Published
- 2024
19. Real-time steerable frequency-stepped Doppler Backscattering (DBS) System for local helicon wave electric field measurements on the DIII-D tokamak
- Author
-
Chowdhury, S., Crocker, N. A., Peebles, W. A., Lantsov, R., Rhodes, T. L., Zeng, L., Van Compernolle, B., Tang, S., Pinsker, R. I., Torrezan, A. C., Squire, J., Rupani, R., O'Neill, R., and Cengher, M.
- Subjects
Physics - Plasma Physics - Abstract
A new frequency-stepped Doppler backscattering (DBS) system has been integrated with a real-time steerable electron cyclotron heating launcher to probe local background turbulence (f<10 MHz) and high-frequency (20-550 MHz) density fluctuations in the DIII-D tokamak. The launcher enables 2D steering (horizontal and vertical) over wide angular ranges to optimize probe location and wavenumber response, with vertical steering adjustable in real time during discharges. The DBS system utilizes a programmable frequency synthesizer with adjustable dwell time, capable of stepping across the E-band frequency range (60-90 GHz) in real time, launching either O or X-mode polarized millimeter waves. This setup facilitates diagnosis of the complex spatial structure of high-power (>200 kW) helicon waves (476 MHz) during current drive experiments. Real-time scans reveal broadband density fluctuations around the helicon frequency, attributed to backscattering of the DBS millimeter wave probe from plasma turbulence modulated by the helicon wave. These fluctuations appear as high-frequency sidebands in the turbulence spectrum, effectively 'tagging' the background turbulence with the helicon wave's electric field. This method allows for monitoring local helicon wave amplitude by comparing high-frequency signal amplitude to background turbulence. Coupled with real-time scanning of measurement location and wavenumber, this allows for rapid helicon wave power distribution determination during steady-state plasma operation, potentially validating predictive models like GENRAY or AORSA for helicon current drive in DIII-D plasmas., Comment: 14 Pages, 10 figs
- Published
- 2024
20. When Not to Answer: Evaluating Prompts on GPT Models for Effective Abstention in Unanswerable Math Word Problems
- Author
-
Saadat, Asir, Sogir, Tasmia Binte, Chowdhury, Md Taukir Azam, and Aziz, Syem
- Subjects
Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
Large language models (LLMs) are increasingly relied upon to solve complex mathematical word problems. However, being susceptible to hallucination, they may generate inaccurate results when presented with unanswerable questions, raising concerns about their potential harm. While GPT models are now widely used and trusted, the exploration of how they can effectively abstain from answering unanswerable math problems and the enhancement of their abstention capabilities has not been rigorously investigated. In this paper, we investigate whether GPTs can appropriately respond to unanswerable math word problems by applying prompts typically used in solvable mathematical scenarios. Our experiments utilize the Unanswerable Word Math Problem (UWMP) dataset, directly leveraging GPT model APIs. Evaluation metrics are introduced, which integrate three key factors: abstention, correctness and confidence. Our findings reveal critical gaps in GPT models and the hallucination it suffers from for unsolvable problems, highlighting the need for improved models capable of better managing uncertainty and complex reasoning in math word problem-solving contexts., Comment: 11 pages, 7 figures, 2 tables
- Published
- 2024
21. Metal Price Spike Prediction via a Neurosymbolic Ensemble Approach
- Author
-
Lee, Nathaniel, Ngu, Noel, Sahdev, Harshdeep Singh, Motaganahall, Pramod, Chowdhury, Al Mehdi Saadat, Xi, Bowen, and Shakarian, Paulo
- Subjects
Computer Science - Machine Learning - Abstract
Predicting price spikes in critical metals such as Cobalt, Copper, Magnesium, and Nickel is crucial for mitigating economic risks associated with global trends like the energy transition and reshoring of manufacturing. While traditional models have focused on regression-based approaches, our work introduces a neurosymbolic ensemble framework that integrates multiple neural models with symbolic error detection and correction rules. This framework is designed to enhance predictive accuracy by correcting individual model errors and offering interpretability through rule-based explanations. We show that our method provides up to 6.42% improvement in precision, 29.41% increase in recall at 13.24% increase in F1 over the best performing neural models. Further, our method, as it is based on logical rules, has the benefit of affording an explanation as to which combination of neural models directly contribute to a given prediction.
- Published
- 2024
22. Self-DenseMobileNet: A Robust Framework for Lung Nodule Classification using Self-ONN and Stacking-based Meta-Classifier
- Author
-
Rahman, Md. Sohanur, Chowdhury, Muhammad E. H., Rahman, Hasib Ryan, Ahmed, Mosabber Uddin, Kabir, Muhammad Ashad, Roy, Sanjiban Sekhar, and Sarmun, Rusab
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
In this study, we propose a novel and robust framework, Self-DenseMobileNet, designed to enhance the classification of nodules and non-nodules in chest radiographs (CXRs). Our approach integrates advanced image standardization and enhancement techniques to optimize the input quality, thereby improving classification accuracy. To enhance predictive accuracy and leverage the strengths of multiple models, the prediction probabilities from Self-DenseMobileNet were transformed into tabular data and used to train eight classical machine learning (ML) models; the top three performers were then combined via a stacking algorithm, creating a robust meta-classifier that integrates their collective insights for superior classification performance. To enhance the interpretability of our results, we employed class activation mapping (CAM) to visualize the decision-making process of the best-performing model. Our proposed framework demonstrated remarkable performance on internal validation data, achieving an accuracy of 99.28\% using a Meta-Random Forest Classifier. When tested on an external dataset, the framework maintained strong generalizability with an accuracy of 89.40\%. These results highlight a significant improvement in the classification of CXRs with lung nodules., Comment: 31 pages
- Published
- 2024
23. Messaging-based Intelligent Processing Unit (m-IPU) for next generation AI computing
- Author
-
Chowdhury, Md. Rownak Hossain and Rahman, Mostafizur
- Subjects
Computer Science - Hardware Architecture - Abstract
Recent advancements in Artificial Intelligence (AI) algorithms have sparked a race to enhance hardware capabilities for accelerated task processing. While significant strides have been made, particularly in areas like computer vision, the progress of AI algorithms appears to have outpaced hardware development, as specialized hardware struggles to keep up with the ever-expanding algorithmic landscape. To address this gap, we propose a new accelerator architecture, called messaging-based intelligent processing unit (m-IPU), capable of runtime configuration to cater to various AI tasks. Central to this hardware is a programmable interconnection mechanism, relying on message passing between compute elements termed Sites. While the messaging between compute elements is a known concept for Network-on-Chip or multi-core architectures, our hardware can be categorized as a new class of coarse-grained reconfigurable architecture (CGRA), specially optimized for AI workloads. In this paper, we highlight m-IPU's fundamental advantages for machine learning applications. We illustrate the efficacy through implementations of a neural network, matrix multiplications, and convolution operations, showcasing lower latency compared to the state-of-the-art. Our simulation-based experiments, conducted on the TSMC 28nm technology node, reveal minimal power consumption of 44.5 mW with 94,200 cells utilization. For 3D convolution operations on (32 x 128) images, each (256 x 256), using a (3 x 3) filter and 4,096 Sites at a frequency of 100 MHz, m-IPU achieves processing in just 503.3 milliseconds. These results underscore the potential of m-IPU as a unified, scalable, and high-performance hardware architecture tailored for future AI applications., Comment: 12 Pages, 8 Figures, Journal
- Published
- 2024
24. Exploring Demonstration Retrievers in RAG for Coding Tasks: Yeas and Nays!
- Author
-
He, Pengfei, Wang, Shaowei, Chowdhury, Shaiful, and Chen, Tse-Hsun
- Subjects
Computer Science - Software Engineering - Abstract
Retrieval-Augmented Generation (RAG) enhances Large Language Models (LLMs) by integrating external knowledge bases, achieving state-of-the-art results in various coding tasks. The core of RAG is retrieving demonstration examples, which is essential to balance effectiveness (generation quality) and efficiency (retrieval time) for optimal performance. However, the high-dimensional nature of code representations and large knowledge bases often create efficiency bottlenecks, which are overlooked in previous research. This paper systematically evaluates the efficiency-effectiveness trade-off of retrievers across three coding tasks: Program Synthesis, Commit Message Generation, and Assertion Generation. We examined six retrievers: two sparse (BM25 and BM25L) and four dense retrievers, including one exhaustive dense retriever (SBERT's Semantic Search) and three approximate dense retrievers (ANNOY, LSH, and HNSW). Our findings show that while BM25 excels in effectiveness, it suffers in efficiency as the knowledge base grows beyond 1000 entries. In large-scale retrieval, efficiency differences become more pronounced, with approximate dense retrievers offering the greatest gains. For instance, in Commit Generation task, HNSW achieves a 44x speed up, while only with a 1.74% drop in RougeL compared with BM25. Our results also show that increasing the number of demonstrations in the prompt doesn't always improve the effectiveness and can increase latency and lead to incorrect outputs. Our findings provide valuable insights for practitioners aiming to build efficient and effective RAG systems for coding tasks., Comment: 11 pages, 6 figures, 6 tables
- Published
- 2024
25. Connecting quasi-normal modes with causality in Lovelock theories of gravity
- Author
-
Chowdhury, Avijit, Mishra, Akash K, and Chakraborty, Sumanta
- Subjects
General Relativity and Quantum Cosmology ,High Energy Physics - Theory - Abstract
The eikonal correspondence between the quasi-normal modes (QNMs) of asymptotically flat static spherically symmetric black holes and the properties of unstable null circular geodesics is studied in the case of higher dimensional Lovelock black holes (BHs). It is known that such correspondence does not generically hold for gravitational QNMs associated with BHs in Lovelock theories. In the present work, we revisit this correspondence and establish the relationship between the eikonal QNMs and the causal properties of the gravitational field equations in Lovelock theories of gravity., Comment: 13 pages, 2 figures, 4 table
- Published
- 2024
26. Goal-Oriented Communications for Real-time Inference with Two-Way Delay
- Author
-
Ari, Cagri, Shisher, Md Kamran Chowdhury, Sun, Yin, and Uysal, Elif
- Subjects
Computer Science - Networking and Internet Architecture ,Electrical Engineering and Systems Science - Signal Processing - Abstract
We design a goal-oriented communication strategy for remote inference, where an intelligent model (e.g., a pre-trained neural network) at the receiver side predicts the real-time value of a target signal based on data packets transmitted from a remote location. The inference error depends on both the Age of Information (AoI) and the length of the data packets. Previous formulations of this problem either assumed IID transmission delays with immediate feedback or focused only on monotonic relations where inference performance degrades as the input data ages. In contrast, we consider a possibly non-monotonic relationship between the inference error and AoI. We show how to minimize the expected time-average inference error under two-way delay, where the delay process can have memory. Simulation results highlight the significant benefits of adopting such a goal-oriented communication strategy for remote inference, especially under highly variable delay scenarios., Comment: 12 pages, 8 figures
- Published
- 2024
27. AI Surrogate Model for Distributed Computing Workloads
- Author
-
Park, David K., Ren, Yihui, Kilic, Ozgur O., Korchuganova, Tatiana, Vatsavai, Sairam Sri, Boudreau, Joseph, Chowdhury, Tasnuva, Feng, Shengyu, Khan, Raees, Kim, Jaehyung, Klasky, Scott, Maeno, Tadashi, Nilsson, Paul, Outschoorn, Verena Ingrid Martinez, Podhorszki, Norbert, Suter, Frederic, Yang, Wei, Yang, Yiming, Yoo, Shinjae, Klimentov, Alexei, and Hoisie, Adolfy
- Subjects
Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
Large-scale international scientific collaborations, such as ATLAS, Belle II, CMS, and DUNE, generate vast volumes of data. These experiments necessitate substantial computational power for varied tasks, including structured data processing, Monte Carlo simulations, and end-user analysis. Centralized workflow and data management systems are employed to handle these demands, but current decision-making processes for data placement and payload allocation are often heuristic and disjointed. This optimization challenge potentially could be addressed using contemporary machine learning methods, such as reinforcement learning, which, in turn, require access to extensive data and an interactive environment. Instead, we propose a generative surrogate modeling approach to address the lack of training data and concerns about privacy preservation. We have collected and processed real-world job submission records, totaling more than two million jobs through 150 days, and applied four generative models for tabular data -- TVAE, CTAGGAN+, SMOTE, and TabDDPM -- to these datasets, thoroughly evaluating their performance. Along with measuring the discrepancy among feature-wise distributions separately, we also evaluate pair-wise feature correlations, distance to closest record, and responses to pre-trained models. Our experiments indicate that SMOTE and TabDDPM can generate similar tabular data, almost indistinguishable from the ground truth. Yet, as a non-learning method, SMOTE ranks the lowest in privacy preservation. As a result, we conclude that the probabilistic-diffusion-model-based TabDDPM is the most suitable generative model for managing job record data., Comment: 8 pages, 5 figures, to be presented in SC24 AI4S Workshop
- Published
- 2024
28. A Computational Harmonic Detection Algorithm to Detect Data Leakage through EM Emanation
- Author
-
Bari, Md Faizul, Chowdhury, Meghna Roy, and Sen, Shreyas
- Subjects
Computer Science - Cryptography and Security ,Electrical Engineering and Systems Science - Signal Processing - Abstract
Unintended electromagnetic emissions from electronic devices, known as EM emanations, pose significant security risks because they can be processed to recover the source signal's information content. Defense organizations typically use metal shielding to prevent data leakage, but this approach is costly and impractical for widespread use, especially in uncontrolled environments like government facilities in the wild. This is particularly relevant for IoT devices due to their large numbers and deployment in varied environments. This gives rise to a research need for an automated emanation detection method to monitor the facilities and take prompt steps when leakage is detected. To address this, in the preliminary version of this work [1], we collected emanation data from 3 types of HDMI cables and proposed a CNN-based detection method that provided 95% accuracy up to 22.5m. However, the CNN-based method has some limitations: hardware dependency, confusion among multiple sources, and struggle at low SNR. In this extended version, we augment the initial study by collecting emanation data from IoT devices, everyday electronic devices, and cables. Data analysis reveals that each device's emanation has a unique harmonic pattern with intermodulation products, in contrast to communication signals with fixed frequency bands, spectra, and modulation patterns. Leveraging this, we propose a harmonic-based detection method by developing a computational harmonic detector. The proposed method addresses the limitations of the CNN method and provides ~100 accuracy not only for HDMI emanation (compared to 95% in the earlier CNN-based method) but also for all other tested devices/cables in different environments., Comment: This is the extended version of our previously published conference paper (DOI: 10.23919/DATE56975.2023.10137263) which can be found here: https://ieeexplore.ieee.org/abstract/document/10137263
- Published
- 2024
29. MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering
- Author
-
Chan, Jun Shern, Chowdhury, Neil, Jaffe, Oliver, Aung, James, Sherburn, Dane, Mays, Evan, Starace, Giulio, Liu, Kevin, Maksin, Leon, Patwardhan, Tejal, Weng, Lilian, and Mądry, Aleksander
- Subjects
Computer Science - Computation and Language - Abstract
We introduce MLE-bench, a benchmark for measuring how well AI agents perform at machine learning engineering. To this end, we curate 75 ML engineering-related competitions from Kaggle, creating a diverse set of challenging tasks that test real-world ML engineering skills such as training models, preparing datasets, and running experiments. We establish human baselines for each competition using Kaggle's publicly available leaderboards. We use open-source agent scaffolds to evaluate several frontier language models on our benchmark, finding that the best-performing setup--OpenAI's o1-preview with AIDE scaffolding--achieves at least the level of a Kaggle bronze medal in 16.9% of competitions. In addition to our main results, we investigate various forms of resource scaling for AI agents and the impact of contamination from pre-training. We open-source our benchmark code (github.com/openai/mle-bench/) to facilitate future research in understanding the ML engineering capabilities of AI agents., Comment: 10 pages, 17 pages appendix. Equal contribution by first seven authors, authors randomized. Corrected footnote 4
- Published
- 2024
30. Gaussian to log-normal transition for independent sets in a percolated hypercube
- Author
-
Chowdhury, Mriganka Basu Roy, Ganguly, Shirshendu, and Winstein, Vilas
- Subjects
Mathematics - Probability ,Condensed Matter - Statistical Mechanics ,Computer Science - Discrete Mathematics ,Mathematical Physics ,Mathematics - Combinatorics - Abstract
Independent sets in graphs, i.e., subsets of vertices where no two are adjacent, have long been studied, for instance as a model of hard-core gas. The $d$-dimensional hypercube, $\{0,1\}^d$, with the nearest neighbor structure, has been a particularly appealing choice for the base graph, owing in part to its many symmetries. Results go back to the work of Korshunov and Sapozhenko who proved sharp results on the count of such sets as well as structure theorems for random samples drawn uniformly. Of much interest is the behavior of such Gibbs measures in the presence of disorder. In this direction, Kronenberg and Spinka [KS] initiated the study of independent sets in a random subgraph of the hypercube obtained by considering an instance of bond percolation with probability $p$. Relying on tools from statistical mechanics they obtained a detailed understanding of the moments of the partition function, say $\mathcal{Z}$, of the hard-core model on such random graphs and consequently deduced certain fluctuation information, as well as posed a series of interesting questions. In particular, they showed in the uniform case that there is a natural phase transition at $p=2/3$ where $\mathcal{Z}$ transitions from being concentrated for $p>2/3$ to not concentrated at $p=2/3$. In this article, developing a probabilistic framework, as well as relying on certain cluster expansion inputs from [KS], we present a detailed picture of both the fluctuations of $\mathcal{Z}$ as well as the geometry of a randomly sampled independent set. In particular, we establish that $\mathcal{Z}$, properly centered and scaled, converges to a standard Gaussian for $p>2/3$, and to a sum of two i.i.d. log-normals at $p=2/3$. A particular step in the proof which could be of independent interest involves a non-uniform birthday problem for which collisions emerge at $p=2/3$., Comment: 35 pages, 1 figure. Abstract shortened to meet arXiv requirements
- Published
- 2024
31. Precision Cancer Classification and Biomarker Identification from mRNA Gene Expression via Dimensionality Reduction and Explainable AI
- Author
-
Tabassum, Farzana, Islam, Sabrina, Rizwan, Siana, Sobhan, Masrur, Ahmed, Tasnim, Ahmed, Sabbir, and Chowdhury, Tareque Mohmud
- Subjects
Quantitative Biology - Quantitative Methods ,Computer Science - Machine Learning - Abstract
Gene expression analysis is a critical method for cancer classification, enabling precise diagnoses through the identification of unique molecular signatures associated with various tumors. Identifying cancer-specific genes from gene expression values enables a more tailored and personalized treatment approach. However, the high dimensionality of mRNA gene expression data poses challenges for analysis and data extraction. This research presents a comprehensive pipeline designed to accurately identify 33 distinct cancer types and their corresponding gene sets. It incorporates a combination of normalization and feature selection techniques to reduce dataset dimensionality effectively while ensuring high performance. Notably, our pipeline successfully identifies a substantial number of cancer-specific genes using a reduced feature set of just 500, in contrast to using the full dataset comprising 19,238 features. By employing an ensemble approach that combines three top-performing classifiers, a classification accuracy of 96.61% was achieved. Furthermore, we leverage Explainable AI to elucidate the biological significance of the identified cancer-specific genes, employing Differential Gene Expression (DGE) analysis., Comment: 37 pages, 2 figures, 8 tables, Submitted to Journal of Computational Science
- Published
- 2024
32. Mutual information and correlation measures in holographic RG flows
- Author
-
Chowdhury, Iftekher S., Akhouri, Binay Prakash, Haque, Shah, and Howard, Eric
- Subjects
Quantum Physics ,General Relativity and Quantum Cosmology ,High Energy Physics - Theory - Abstract
This paper investigates the behavior of mutual information, entanglement negativity, and multipartite correlations in holographic RG flows, particularly during phase transitions. Mutual information provides a UV-finite measure of total correlations between subsystems, while entanglement negativity and multipartite correlations offer finer insights into quantum structures, especially near critical points. Through numerical simulations, we show that while mutual information remains relatively smooth, both entanglement negativity and multipartite correlations exhibit sharp changes near phase transitions. These results support the hypothesis that multipartite correlations play a dominant role in signaling critical phenomena in strongly coupled quantum systems., Comment: 21 pages, 5 figures
- Published
- 2024
33. Information Scrambling with Higher-Form Fields
- Author
-
Sil, Karunava, Maji, Sourav, Christodoulou, Stavros, and Chowdhury, Abhishek
- Subjects
High Energy Physics - Theory ,Condensed Matter - Statistical Mechanics ,General Relativity and Quantum Cosmology ,Quantum Physics - Abstract
The late time behaviour of OTOCs involving generic non-conserved local operators show exponential decay in chaotic many body systems. However, it has been recently observed that for certain holographic theories, the OTOC involving the $U(1)$ conserved current for a gauge field instead varies diffusively at late times. The present work generalizes this observation to conserved currents corresponding to higher-form symmetries that belong to a wider class of symmetries known as generalized symmetries. We started by computing the late time behaviour of OTOCs involving $U(1)$ current operators in five dimensional AdS-Schwarzschild black hole geometry for the 2-form antisymmetric $B$-fields. The bulk solution for the $B$-field exhibits logarithmic divergences near the asymptotic AdS boundary which can be regularized by introducing a double trace deformation in the boundary CFT. Finally, we consider the more general case with antisymmetric $p$-form fields in arbitrary dimensions. In the scattering approach, the boundary OTOC can be written as an inner product between asymptotic 'in' and 'out' states which in our case is equivalent to computing the inner product between two bulk fields with and without a shockwave background. We observe that the late time OTOCs have power law tails which seems to be a universal feature of the higher-form fields with $U(1)$ charge conservation., Comment: v2, improved presentation and added references, 30 pages, 2 figures, 2 appendices
- Published
- 2024
34. Robotics Meets Software Engineering: A First Look at the Robotics Discussions on Stackoverflow
- Author
-
Kidwai, Hisham, Bates, Danika Passler, Suhi, Sujana Islam, Young, James, and Chowdhury, Shaiful
- Subjects
Computer Science - Software Engineering - Abstract
Robots can greatly enhance human capabilities, yet their development presents a range of challenges. This collaborative study, conducted by a team of software engineering and robotics researchers, seeks to identify the challenges encountered by robot developers by analyzing questions posted on StackOverflow. We created a filtered dataset of 500 robotics-related questions and examined their characteristics, comparing them with randomly selected questions from the platform. Our findings indicate that the small size of the robotics community limits the visibility of these questions, resulting in fewer responses. While the number of robotics questions has been steadily increasing, they remain less popular than the average question and answer on StackOverflow. This underscores the importance of research that focuses on the challenges faced by robotics practitioners. Consequently, we conducted a thematic analysis of the 500 robotics questions to uncover common inquiry patterns. We identified 11 major themes, with questions about robot movement being the most frequent. Our analysis of yearly trends revealed that certain themes, such as Specifications, were prominent from 2009 to 2014 but have since diminished in relevance. In contrast, themes like Moving, Actuator, and Remote have consistently dominated discussions over the years. These findings suggest that challenges in robotics may vary over time. Notably, the majority of robotics questions are framed as How questions, rather than Why or What questions, revealing the lack of enough resources for the practitioners. These insights can help guide researchers and educators in developing effective and timely educational materials for robotics practitioners.
- Published
- 2024
35. Robust Offline Imitation Learning from Diverse Auxiliary Data
- Author
-
Ghosh, Udita, Raychaudhuri, Dripta S., Li, Jiachen, Karydis, Konstantinos, and Roy-Chowdhury, Amit K.
- Subjects
Computer Science - Machine Learning - Abstract
Offline imitation learning enables learning a policy solely from a set of expert demonstrations, without any environment interaction. To alleviate the issue of distribution shift arising due to the small amount of expert data, recent works incorporate large numbers of auxiliary demonstrations alongside the expert data. However, the performance of these approaches rely on assumptions about the quality and composition of the auxiliary data. However, they are rarely successful when those assumptions do not hold. To address this limitation, we propose Robust Offline Imitation from Diverse Auxiliary Data (ROIDA). ROIDA first identifies high-quality transitions from the entire auxiliary dataset using a learned reward function. These high-reward samples are combined with the expert demonstrations for weighted behavioral cloning. For lower-quality samples, ROIDA applies temporal difference learning to steer the policy towards high-reward states, improving long-term returns. This two-pronged approach enables our framework to effectively leverage both high and low-quality data without any assumptions. Extensive experiments validate that ROIDA achieves robust and consistent performance across multiple auxiliary datasets with diverse ratios of expert and non-expert demonstrations. ROIDA effectively leverages unlabeled auxiliary data, outperforming prior methods reliant on specific data assumptions.
- Published
- 2024
36. SIMP dark matter during reheating
- Author
-
Chowdhury, Debtosh and Show, Sudipta
- Subjects
High Energy Physics - Phenomenology ,Astrophysics - Cosmology and Nongalactic Astrophysics - Abstract
Strongly interacting massive particle (SIMP) has become one of the promising dark matter (DM) candidates due to its capability of addressing the small-scale anomaly, where the final DM abundance is set via the freeze-out of $3\rightarrow 2$ or $4\rightarrow 2$ annihilation process involving solely the dark sector particles. In this work, we explore the freeze-out of SIMP DM during the inflationary reheating epoch. During reheating, the radiation energy density evolves differently based on the shape of inflaton potential and spin of its decay products than the standard radiation-dominated picture; as a result, in this scenario, the freeze-out temperature varies distinctly with DM mass compared to the standard case. Large entropy injection due to inflaton decay demands a smaller cross-section to satisfy the observed relic than the standard radiation-dominated freeze-out case. The required cross-section, satisfying the relic density constraint and the maximum allowed thermally averaged cross-section by the unitarity of the $S$-matrix, set an upper limit on the DM mass. The upper bound on the mass of the dark matter for $3\rightarrow2$ ( $4\rightarrow2$ ) is $1$ GeV ($7$ MeV), assuming a radiation-dominated background. Interstingly, these limits get relaxed to $10^6$ ($10^4$) GeV for $3\rightarrow2$ ( $4\rightarrow2$ ) SIMP dark matter for quadratic inflaton potential. We find that a small amount of DM parameter space survives for reheating with quadratic inflaton potential after considering the lower bound of reheating temperature, put by the latest CMB observation depending on the inflationary models. In the case of the quartic inflaton potential, the allowed DM parameter space gets reduced compared to the quadratic case., Comment: 22 pages, 8 captioned figures. Comments are welcome
- Published
- 2024
37. Vector interaction bounds in NJL-like models from LQCD estimated curvature of the chiral crossover line
- Author
-
Ali, Mahammad Sabir, Biswas, Deeptak, and Islam, Chowdhury Aminul
- Subjects
Nuclear Theory ,High Energy Physics - Lattice ,High Energy Physics - Phenomenology - Abstract
We obtain improved bounds on both the flavor-independent and -dependent vector interactions in a $2+1$-flavor Nambu\textendash Jona-Lasinio (NJL) model using the latest precise LQCD results of the curvature coefficients of the chiral crossover line. We find that these lattice estimated curvature coefficients allow for both attractive and repulsive types of interactions in both the cases. With this constrained ranges of vector interactions, we further predict the behavior of the second $(\kappa_2^B)$ and fourth $(\kappa_4^B)$ order curvature coefficients as a function of the strangeness chemical potential $(\mu_S)$. We observe that the flavor mixing effects, arising from the flavor-independent vector interaction as well as from the 't Hooft interaction, play an important role in $k_2^B$. We propose that the mixing effects due to the vector interaction can be separated from those arising from the 't Hooft interaction by analyzing the behavior of $k_2^B$ as a function of $\mu_S$. Finally, we locate the critical endpoint in the $T-\mu_B$ plane using the model-estimated ranges of vector interactions and find the model's predictions to be consistent with the latest LQCD bounds.
- Published
- 2024
38. Cross-correlation between the curvature perturbations and magnetic fields in pure ultra slow roll inflation
- Author
-
Tripathy, Sagarika, Chowdhury, Debika, Ragavendra, H. V., and Sriramkumar, L.
- Subjects
Astrophysics - Cosmology and Nongalactic Astrophysics ,General Relativity and Quantum Cosmology ,High Energy Physics - Theory - Abstract
Motivated by the aim of producing significant number of primordial black holes, over the past few years, there has been a considerable interest in examining models of inflation involving a single, canonical field, that permit a brief period of ultra slow roll. Earlier, we had examined inflationary magnetogenesis - achieved by breaking the conformal invariance of the electromagnetic action through a coupling to the inflation - in situations involving departures from slow roll. We had found that a transition from slow roll to ultra slow roll inflation can lead to a strong blue tilt in the spectrum of the magnetic field over small scales and also considerably suppress its strength over large scales. In this work, we consider the scenario of pure ultra slow roll inflation and show that scale invariant magnetic fields can be obtained in such situations with the aid of a non-conformal coupling function that depends on the kinetic energy of the inflaton. Apart from the power spectrum, an important probe of the primordial magnetic fields are the three-point functions, specifically, the cross-correlation between the curvature perturbations and the magnetic fields. We calculate the three-point cross-correlation between the curvature perturbations and the magnetic fields in pure ultra slow roll inflation for the new choice of the non-conformal coupling function. In particular, we examine the validity of the consistency condition that is expected to govern the three-point function in the squeezed limit and comment on the wider implications of the results we obtain., Comment: 24 pages, 2 figures
- Published
- 2024
39. Finite-temperature CFT in Rindler Vacuum
- Author
-
Chowdhury, Iftekher S., Akhouri, Binay Prakash, Haque, Shah, and Howard, Eric
- Subjects
General Relativity and Quantum Cosmology ,High Energy Physics - Theory - Abstract
This paper investigates the finite-temperature behavior of Conformal Field Theory (CFT) in Rindler vacuum, focusing on the relation between acceleration and thermality in quantum field theory. We illustrate how uniformly accelerated observers perceive the vacuum as a thermal state via Unruh effect, shedding light on the thermal properties of Rindler horizon. Through numerical simulations of the heat kernel, Unruh temperature, Planck distribution, and detector response, we demonstrate that acceleration enhances the thermal characteristics of quantum fields. These results provide important insights into horizon-induced thermality, with significant implications for black hole thermodynamics and quantum gravity., Comment: 15 pages, 4 figures
- Published
- 2024
40. Non-representable six-functor formalisms
- Author
-
Chowdhury, Chirantan and D'Angelo, Alessandro
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - K-Theory and Homology - Abstract
In this article, we study the properties of motivic homotopy category $\mathcal{SH}_{\operatorname{ext}}(\mathcal{X})$ developed by Chowdhury and Khan-Ravi for $\mathcal{X}$ a Nis-loc Stack. In particular, we compare the above construction with Voevodsky's original construction using NisLoc topology. Using the techniques developed by Liu-Zheng and Mann's notion of $\infty$-category of correspondences and abstract six-functor formalisms, we also extend the exceptional functors and extend properties like projection formula, base change and purity to the non-representable situation.
- Published
- 2024
41. Language-guided Robust Navigation for Mobile Robots in Dynamically-changing Environments
- Author
-
Simons, Cody, Liu, Zhichao, Marcus, Brandon, Roy-Chowdhury, Amit K., and Karydis, Konstantinos
- Subjects
Computer Science - Robotics ,Computer Science - Computer Vision and Pattern Recognition - Abstract
In this paper, we develop an embodied AI system for human-in-the-loop navigation with a wheeled mobile robot. We propose a direct yet effective method of monitoring the robot's current plan to detect changes in the environment that impact the intended trajectory of the robot significantly and then query a human for feedback. We also develop a means to parse human feedback expressed in natural language into local navigation waypoints and integrate it into a global planning system, by leveraging a map of semantic features and an aligned obstacle map. Extensive testing in simulation and physical hardware experiments with a resource-constrained wheeled robot tasked to navigate in a real-world environment validate the efficacy and robustness of our method. This work can support applications like precision agriculture and construction, where persistent monitoring of the environment provides a human with information about the environment state.
- Published
- 2024
42. Presence of a Spatially Varying Electric Field at Lipid-Water Interface with Na/K ratio in Water
- Author
-
Bawali, Biplab, Chowdhury, Shubhadip, Mukherjee, Smita, Giglia, Angelo, Mahne, Nicola, Nannarone, Stefano, Mukhopadhyay, Mrinmay, Saha, Jayashree, and Datta, Alokmay
- Subjects
Physics - Biological Physics ,Condensed Matter - Soft Condensed Matter - Abstract
The ion-lipid interface in Langmuir monolayers of Dipalmitoylphosphatidylcholine (DPPC) on pure water and 10 mM solutions of Na+ and K+ at different [K+]/[Na+] (a), atom/atom ratios, were studied initially by Surface Pressure (p) versus Specific Molecular Area (A) isotherms. The values of a were chosen as 0 (no K+), 0.43 ([K+]:[Na+] = 30:70) and 1.0 ([K+]:[Na+] = 50:50) These monolayers were studied through X-Ray Reflectivity (XRR) and Near Edge X-ray Absorption Fine Structure (NEXAFS) spectroscopy at the O K-edge. The two-dimensional rigidity of the monolayer was found to increase with Na+ ions with respect to the pristine monolayer but fall drastically and non-linearly below the pristine value with introduction of the K+ ions, as a was increased. Analysis of the XRR profiles provided the thickness, average electron density (aed) and the interfacial roughness of the phosphatidylcholine head group and the two hydrocarbon tails of the monolayers on Si (001), from which the angle (f) between the head and the tails was determined. This was also follow the same as former one. From NEXAFS, it was found that a linear increase in the cation ratio towards K led to a nonlinear variation in the P=O bond energy and a weakening of the P-O bond energy, the latter becoming more pronounced with K ions, consistent with Fajans rule. Also a split in the C=O p-bond peak was observed at a = 1.0. These results cannot be explained with the model of a uniform electric field due to the cations, which would fall linearly with increase in the K+ proportion, and rather suggest a structured field due a spatial variation in charge density in an interfacial layer of high ion concentration assembled by the counterionic attraction of the phosphatidylcholine head groups. Our results have important implications for the cell membrane, where such mixtures at high concentrations constitute the norm.
- Published
- 2024
43. The Craft of Selective Prediction: Towards Reliable Case Outcome Classification -- An Empirical Study on European Court of Human Rights Cases
- Author
-
Santosh, T. Y. S. S., Chowdhury, Irtiza, Xu, Shanshan, and Grabmair, Matthias
- Subjects
Computer Science - Computation and Language - Abstract
In high-stakes decision-making tasks within legal NLP, such as Case Outcome Classification (COC), quantifying a model's predictive confidence is crucial. Confidence estimation enables humans to make more informed decisions, particularly when the model's certainty is low, or where the consequences of a mistake are significant. However, most existing COC works prioritize high task performance over model reliability. This paper conducts an empirical investigation into how various design choices including pre-training corpus, confidence estimator and fine-tuning loss affect the reliability of COC models within the framework of selective prediction. Our experiments on the multi-label COC task, focusing on European Court of Human Rights (ECtHR) cases, highlight the importance of a diverse yet domain-specific pre-training corpus for better calibration. Additionally, we demonstrate that larger models tend to exhibit overconfidence, Monte Carlo dropout methods produce reliable confidence estimates, and confident error regularization effectively mitigates overconfidence. To our knowledge, this is the first systematic exploration of selective prediction in legal NLP. Our findings underscore the need for further research on enhancing confidence measurement and improving the trustworthiness of models in the legal domain., Comment: Accepted to EMNLP Findings
- Published
- 2024
44. Growth of Massive Black-Holes in FFB Galaxies at Cosmic Dawn
- Author
-
Dekel, Avishai, Stone, Nicholas C., Chowdhury, Dhruba Dutta, Gilbaum, Shmuel, Li, Zhaozhou, Mandelker, Nir, and Bosch, Frank C. van den
- Subjects
Astrophysics - Astrophysics of Galaxies - Abstract
The scenario of feedback-free starbursts (FFB), which predicts excessively bright galaxies at cosmic dawn as observed using JWST, may provide a natural setting for black hole (BH) growth. This involves the formation of intermediate-mass seed BHs and their runaway mergers into super-massive BHs with high BH-to-stellar mass ratios and low AGN luminosities. We present a scenario of merger-driven BH growth in FFB galaxies and study its feasibility. BH seeds form within the building blocks of the FFB galaxies, namely, thousands of compact star clusters, each starbursting in a free-fall time of a few Myr before the onset of stellar and supernova feedback. The BH seeds form by rapid core collapse in the FFB clusters, in a few free-fall times, sped up by the migration of massive stars due to the young, broad stellar mass function and stimulated by a `gravo-gyro' instability due to internal cluster rotation and flattening. BHs of $10^4 M_\odot$ are expected in $10^6 M_\odot$ FFB clusters within sub-kpc galactic disks at $z \sim 10$. The BHs then migrate to the galaxy center by dynamical friction, hastened by the compact FFB stellar galactic disk configuration. Efficient mergers of the BH seeds will produce $10^{6-8} M_\odot$ BHs with a BH-to-stellar mass ratio $\sim 0.01$ by $z \sim 4-7$, as observed. The growth of the central BH by mergers can overcome the bottleneck introduced by gravitational wave recoils if the BHs inspiral within a relatively cold disk or if the escape velocity from the galaxy is boosted by a wet compaction event. Such events, common in massive galaxies at high redshifts, can also help by speeding up the inward BH migration and by providing central gas to assist with the final parsec problem. The cold disk version of the FFB scenario provides a feasible route for the formation of supermassive BHs., Comment: 24 pages, 14 figures
- Published
- 2024
45. Autoencoder-based learning of Quantum phase transitions in the two-component Bose-Hubbard model
- Author
-
Chowdhury, Iftekher S., Akhouri, Binay Prakash, Haque, Shah, and Howard, Eric
- Subjects
Condensed Matter - Quantum Gases ,High Energy Physics - Lattice ,Quantum Physics - Abstract
This paper investigates the use of autoencoders and machine learning methods for detecting and analyzing quantum phase transitions in the Two-Component Bose-Hubbard Model. By leveraging deep learning models such as autoencoders, we investigate latent space representations, reconstruction error analysis, and cluster distance calculations to identify phase boundaries and critical points. The study is supplemented by dimensionality reduction techniques such as PCA and t-SNE for latent space visualization. The results demonstrate the potential of autoencoders to describe the dynamics of quantum phase transitions., Comment: 24 pages, 7 figures
- Published
- 2024
46. The hypothetical track-length fitting algorithm for energy measurement in liquid argon TPCs
- Author
-
DUNE Collaboration, Abud, A. Abed, Abi, B., Acciarri, R., Acero, M. A., Adames, M. R., Adamov, G., Adamowski, M., Adams, D., Adinolfi, M., Adriano, C., Aduszkiewicz, A., Aguilar, J., Akbar, F., Alex, N. S., Allison, K., Monsalve, S. Alonso, Alrashed, M., Alton, A., Alvarez, R., Alves, T., Amar, H., Amedo, P., Anderson, J., Andreopoulos, C., Andreotti, M., Andrews, M. P., Andrianala, F., Andringa, S., Anfimov, N., Ankowski, A., Antic, D., Antoniassi, M., Antonova, M., Antoshkin, A., Aranda-Fernandez, A., Arellano, L., Diaz, E. Arrieta, Arroyave, M. A., Asaadi, J., Ashkenazi, A., Asner, D., Asquith, L., Atkin, E., Auguste, D., Aurisano, A., Aushev, V., Autiero, D., Azam, M. B., Azfar, F., Back, A., Back, H., Back, J. J., Bagaturia, I., Bagby, L., Balashov, N., Balasubramanian, S., Baldi, P., Baldini, W., Baldonedo, J., Baller, B., Bambah, B., Banerjee, R., Barao, F., Barbu, D., Barenboim, G., Alzás, P. Barham, Barker, G. J., Barkhouse, W., Barr, G., Monarca, J. Barranco, Barros, A., Barros, N., Barrow, D., Barrow, J. L., Basharina-Freshville, A., Bashyal, A., Basque, V., Batchelor, C., Bathe-Peters, L., Battat, J. B. R., Battisti, F., Bay, F., Bazetto, M. C. Q., Alba, J. L. L. Bazo, Beacom, J. F., Bechetoille, E., Behera, B., Belchior, E., Bell, G., Bellantoni, L., Bellettini, G., Bellini, V., Beltramello, O., Benekos, N., Montiel, C. Benitez, Benjamin, D., Neves, F. Bento, Berger, J., Berkman, S., Bernal, J., Bernardini, P., Bersani, A., Bertolucci, S., Betancourt, M., Rodríguez, A. Betancur, Bevan, A., Bezawada, Y., Bezerra, A. T., Bezerra, T. J., Bhat, A., Bhatnagar, V., Bhatt, J., Bhattacharjee, M., Bhattacharya, M., Bhuller, S., Bhuyan, B., Biagi, S., Bian, J., Biery, K., Bilki, B., Bishai, M., Bitadze, A., Blake, A., Blaszczyk, F. D., Blazey, G. C., Blucher, E., Bodek, A., Bogenschuetz, J., Boissevain, J., Bolognesi, S., Bolton, T., Bomben, L., Bonesini, M., Bonilla-Diaz, C., Bonini, F., Booth, A., Boran, F., Bordoni, S., Merlo, R. Borges, Borkum, A., Bostan, N., Bouet, R., Boza, J., Bracinik, J., Brahma, B., Brailsford, D., Bramati, F., Branca, A., Brandt, A., Bremer, J., Brew, C., Brice, S. J., Brio, V., Brizzolari, C., Bromberg, C., Brooke, J., Bross, A., Brunetti, G., Brunetti, M., Buchanan, N., Budd, H., Buergi, J., Bundock, A., Burgardt, D., Butchart, S., V., G. Caceres, Cagnoli, I., Cai, T., Calabrese, R., Calcutt, J., Calivers, L., Calvo, E., Caminata, A., Camino, A. F., Campanelli, W., Campani, A., Benitez, A. Campos, Canci, N., Capó, J., Caracas, I., Caratelli, D., Carber, D., Carceller, J. M., Carini, G., Carlus, B., Carneiro, M. F., Carniti, P., Terrazas, I. Caro, Carranza, H., Carrara, N., Carroll, L., Carroll, T., Carter, A., Casarejos, E., Casazza, D., Forero, J. F. Castaño, Castaño, F. A., Castillo, A., Castromonte, C., Catano-Mur, E., Cattadori, C., Cavalier, F., Cavanna, F., Centro, S., Cerati, G., Cerna, C., Cervelli, A., Villanueva, A. Cervera, Chakraborty, K., Chalifour, M., Chappell, A., Charitonidis, N., Chatterjee, A., Chen, H., Chen, M., Chen, W. C., Chen, Y., Chen-Wishart, Z., Cherdack, D., Chi, C., Chiapponi, F., Chirco, R., Chitirasreemadam, N., Cho, K., Choate, S., Choi, G., Chokheli, D., Chong, P. S., Chowdhury, B., Christian, D., Chukanov, A., Chung, M., Church, E., Cicala, M. F., Cicerchia, M., Cicero, V., Ciolini, R., Clarke, P., Cline, G., Coan, T. E., Cocco, A. G., Coelho, J. A. B., Cohen, A., Collazo, J., Collot, J., Conley, E., Conrad, J. M., Convery, M., Copello, S., Cova, P., Cox, C., Cremaldi, L., Cremonesi, L., Crespo-Anadón, J. I., Crisler, M., Cristaldo, E., Crnkovic, J., Crone, G., Cross, R., Cudd, A., Cuesta, C., Cui, Y., Curciarello, F., Cussans, D., Dai, J., Dalager, O., Dallavalle, R., Dallaway, W., D'Amico, R., da Motta, H., Dar, Z. A., Darby, R., Peres, L. Da Silva, David, Q., Davies, G. S., Davini, S., Dawson, J., De Aguiar, R., De Almeida, P., Debbins, P., De Bonis, I., Decowski, M. P., de Gouvêa, A., De Holanda, P. C., Astiz, I. L. De Icaza, De Jong, P., Sanchez, P. Del Amo, De la Torre, A., De Lauretis, G., Delbart, A., Delepine, D., Delgado, M., Dell'Acqua, A., Monache, G. Delle, Delmonte, N., De Lurgio, P., Demario, R., De Matteis, G., Neto, J. R. T. de Mello, DeMuth, D. M., Dennis, S., Densham, C., Denton, P., Deptuch, G. W., De Roeck, A., De Romeri, V., Detje, J. P., Devine, J., Dharmapalan, R., Dias, M., Diaz, A., Díaz, J. S., Díaz, F., Di Capua, F., Di Domenico, A., Di Domizio, S., Di Falco, S., Di Giulio, L., Ding, P., Di Noto, L., Diociaiuti, E., Distefano, C., Diurba, R., Diwan, M., Djurcic, Z., Doering, D., Dolan, S., Dolek, F., Dolinski, M. J., Domenici, D., Domine, L., Donati, S., Donon, Y., Doran, S., Douglas, D., Doyle, T. A., Dragone, A., Drielsma, F., Duarte, L., Duchesneau, D., Duffy, K., Dugas, K., Dunne, P., Dutta, B., Duyang, H., Dwyer, D. A., Dyshkant, A. S., Dytman, S., Eads, M., Earle, A., Edayath, S., Edmunds, D., Eisch, J., Englezos, P., Ereditato, A., Erjavec, T., Escobar, C. O., Evans, J. J., Ewart, E., Ezeribe, A. C., Fahey, K., Fajt, L., Falcone, A., Fani', M., Farnese, C., Farrell, S., Farzan, Y., Fedoseev, D., Felix, J., Feng, Y., Fernandez-Martinez, E., Ferry, G., Fialova, E., Fields, L., Filip, P., Filkins, A., Filthaut, F., Fine, R., Fiorillo, G., Fiorini, M., Fogarty, S., Foreman, W., Fowler, J., Franc, J., Francis, K., Franco, D., Franklin, J., Freeman, J., Fried, J., Friedland, A., Fuess, S., Furic, I. K., Furman, K., Furmanski, A. P., Gaba, R., Gabrielli, A., Gago, A. M., Galizzi, F., Gallagher, H., Gallice, N., Galymov, V., Gamberini, E., Gamble, T., Ganacim, F., Gandhi, R., Ganguly, S., Gao, F., Gao, S., Garcia-Gamez, D., García-Peris, M. Á., Gardim, F., Gardiner, S., Gastler, D., Gauch, A., Gauvreau, J., Gauzzi, P., Gazzana, S., Ge, G., Geffroy, N., Gelli, B., Gent, S., Gerlach, L., Ghorbani-Moghaddam, Z., Giammaria, T., Gibin, D., Gil-Botella, I., Gilligan, S., Gioiosa, A., Giovannella, S., Girerd, C., Giri, A. K., Giugliano, C., Giusti, V., Gnani, D., Gogota, O., Gollapinni, S., Gollwitzer, K., Gomes, R. A., Bermeo, L. V. Gomez, Fajardo, L. S. Gomez, Gonnella, F., Gonzalez-Diaz, D., Gonzalez-Lopez, M., Goodman, M. C., Goswami, S., Gotti, C., Goudeau, J., Goudzovski, E., Grace, C., Gramellini, E., Gran, R., Granados, E., Granger, P., Grant, C., Gratieri, D. R., Grauso, G., Green, P., Greenberg, S., Greer, J., Griffith, W. C., Groetschla, F. T., Grzelak, K., Gu, L., Gu, W., Guarino, V., Guarise, M., Guenette, R., Guerzoni, M., Guffanti, D., Guglielmi, A., Guo, B., Guo, F. Y., Gupta, A., Gupta, V., Gurung, G., Gutierrez, D., Guzowski, P., Guzzo, M. M., Gwon, S., Habig, A., Hadavand, H., Haegel, L., Haenni, R., Hagaman, L., Hahn, A., Haiston, J., Hakenmüller, J., Hamernik, T., Hamilton, P., Hancock, J., Happacher, F., Harris, D. A., Hart, A. L., Hartnell, J., Hartnett, T., Harton, J., Hasegawa, T., Hasnip, C. M., Hatcher, R., Hayrapetyan, K., Hays, J., Hazen, E., He, M., Heavey, A., Heeger, K. M., Heise, J., Hellmuth, P., Henry, S., Herner, K., Hewes, V., Higuera, A., Hilgenberg, C., Hillier, S. J., Himmel, A., Hinkle, E., Hirsch, L. R., Ho, J., Hoff, J., Holin, A., Holvey, T., Hoppe, E., Horiuchi, S., Horton-Smith, G. A., Houdy, T., Howard, B., Howell, R., Hristova, I., Hronek, M. S., Huang, J., Huang, R. G., Hulcher, Z., Ibrahim, M., Iles, G., Ilic, N., Iliescu, A. M., Illingworth, R., Ingratta, G., Ioannisian, A., Irwin, B., Isenhower, L., Oliveira, M. Ismerio, Itay, R., Jackson, C. M., Jain, V., James, E., Jang, W., Jargowsky, B., Jena, D., Jentz, I., Ji, X., Jiang, C., Jiang, J., Jiang, L., Jipa, A., Jo, J. H., Joaquim, F. R., Johnson, W., Jollet, C., Jones, B., Jones, R., Jovancevic, N., Judah, M., Jung, C. K., Jung, K. Y., Junk, T., Jwa, Y., Kabirnezhad, M., Kaboth, A. C., Kadenko, I., Kakorin, I., Kalitkina, A., Kalra, D., Kandemir, M., Kaplan, D. M., Karagiorgi, G., Karaman, G., Karcher, A., Karyotakis, Y., Kasai, S., Kasetti, S. P., Kashur, L., Katsioulas, I., Kauther, A., Kazaryan, N., Ke, L., Kearns, E., Keener, P. T., Kelly, K. J., Kemp, E., Kemularia, O., Kermaidic, Y., Ketchum, W., Kettell, S. H., Khabibullin, M., Khan, N., Khvedelidze, A., Kim, D., Kim, J., Kim, M. J., King, B., Kirby, B., Kirby, M., Kish, A., Klein, J., Kleykamp, J., Klustova, A., Kobilarcik, T., Koch, L., Koehler, K., Koerner, L. W., Koh, D. H., Kolupaeva, L., Korablev, D., Kordosky, M., Kosc, T., Kose, U., Kostelecký, V. A., Kothekar, K., Kotler, I., Kovalcuk, M., Kozhukalov, V., Krah, W., Kralik, R., Kramer, M., Kreczko, L., Krennrich, F., Kreslo, I., Kroupova, T., Kubota, S., Kubu, M., Kudenko, Y., Kudryavtsev, V. A., Kufatty, G., Kuhlmann, S., Kulagin, S., Kumar, J., Kumar, P., Kumaran, S., Kunzmann, J., Kuravi, R., Kurita, N., Kuruppu, C., Kus, V., Kutter, T., Kvasnicka, J., Labree, T., Lackey, T., Lalău, I., Lambert, A., Land, B. J., Lane, C. E., Lane, N., Lang, K., Langford, T., Langstaff, M., Lanni, F., Lantwin, O., Larkin, J., Lasorak, P., Last, D., Laudrain, A., Laundrie, A., Laurenti, G., Lavaut, E., Laycock, P., Lazanu, I., LaZur, R., Lazzaroni, M., Le, T., Leardini, S., Learned, J., LeCompte, T., Legin, V., Miotto, G. Lehmann, Lehnert, R., de Oliveira, M. A. Leigui, Leitner, M., Silverio, D. Leon, Lepin, L. M., Li, J. -Y, Li, S. W., Li, Y., Liao, H., Lin, C. S., Lindebaum, D., Linden, S., Lineros, R. A., Lister, A., Littlejohn, B. R., Liu, H., Liu, J., Liu, Y., Lockwitz, S., Lokajicek, M., Lomidze, I., Long, K., Lopes, T. V., Lopez, J., de Rego, I. López, López-March, N., Lord, T., LoSecco, J. M., Louis, W. C., Sanchez, A. Lozano, Lu, X. -G., Luk, K. B., Lunday, B., Luo, X., Luppi, E., MacFarlane, D., Machado, A. A., Machado, P., Macias, C. T., Macier, J. R., MacMahon, M., Maddalena, A., Madera, A., Madigan, P., Magill, S., Magueur, C., Mahn, K., Maio, A., Major, A., Majumdar, K., Mameli, S., Man, M., Mandujano, R. C., Maneira, J., Manly, S., Mann, A., Manolopoulos, K., Plata, M. Manrique, Corchado, S. Manthey, Manyam, V. N., Marchan, M., Marchionni, A., Marciano, W., Marfatia, D., Mariani, C., Maricic, J., Marinho, F., Marino, A. D., Markiewicz, T., Marques, F. Das Chagas, Marquet, C., Marshak, M., Marshall, C. M., Marshall, J., Martina, L., Martín-Albo, J., Martinez, N., Caicedo, D. A. Martinez, López, F. Martínez, Miravé, P. Martínez, Martynenko, S., Mascagna, V., Massari, C., Mastbaum, A., Matichard, F., Matsuno, S., Matteucci, G., Matthews, J., Mauger, C., Mauri, N., Mavrokoridis, K., Mawby, I., Mazza, R., McAskill, T., McConkey, N., McFarland, K. S., McGrew, C., McNab, A., Meazza, L., Meddage, V. C. N., Mefodiev, A., Mehta, B., Mehta, P., Melas, P., Mena, O., Mendez, H., Mendez, P., Méndez, D. P., Menegolli, A., Meng, G., Mercuri, A. C. E. A., Meregaglia, A., Messier, M. D., Metallo, S., Metcalf, W., Mewes, M., Meyer, H., Miao, T., Micallef, J., Miccoli, A., Michna, G., Milincic, R., Miller, F., Miller, G., Miller, W., Mineev, O., Minotti, A., Miralles, L., Mironov, C., Miryala, S., Miscetti, S., Mishra, C. S., Mishra, P., Mishra, S. R., Mislivec, A., Mitchell, M., Mladenov, D., Mocioiu, I., Mogan, A., Moggi, N., Mohanta, R., Mohayai, T. A., Mokhov, N., Molina, J., Bueno, L. Molina, Montagna, E., Montanari, A., Montanari, C., Montanari, D., Montanino, D., Zetina, L. M. Montaño, Mooney, M., Moor, A. F., Moore, Z., Moreno, D., Moreno-Palacios, O., Morescalchi, L., Moretti, D., Moretti, R., Morris, C., Mossey, C., Moura, C. A., Mouster, G., Mu, W., Mualem, L., Mueller, J., Muether, M., Muheim, F., Muir, A., Mukhamejanov, Y., Mulhearn, M., Munford, D., Munteanu, L. J., Muramatsu, H., Muraz, J., Murphy, M., Murphy, T., Muse, J., Mytilinaki, A., Nachtman, J., Nagai, Y., Nagu, S., Nandakumar, R., Naples, D., Narita, S., Navrer-Agasson, A., Nayak, N., Nebot-Guinot, M., Nehm, A., Nelson, J. K., Neogi, O., Nesbit, J., Nessi, M., Newbold, D., Newcomer, M., Nichol, R., Nicolas-Arnaldos, F., Nikolica, A., Nikolov, J., Niner, E., Nishimura, K., Norman, A., Norrick, A., Novella, P., Nowak, A., Nowak, J. A., Oberling, M., Ochoa-Ricoux, J. P., Oh, S., Oh, S. B., Olivier, A., Olshevskiy, A., Olson, T., Onel, Y., Onishchuk, Y., Oranday, A., Osbiston, M., Vélez, J. A. Osorio, O'Sullivan, L., Ormachea, L. Otiniano, Ott, J., Pagani, L., Palacio, G., Palamara, O., Palestini, S., Paley, J. M., Pallavicini, M., Palomares, C., Pan, S., Panda, P., Vazquez, W. Panduro, Pantic, E., Paolone, V., Papaleo, R., Papanestis, A., Papoulias, D., Paramesvaran, S., Paris, A., Parke, S., Parozzi, E., Parsa, S., Parsa, Z., Parveen, S., Parvu, M., Pasciuto, D., Pascoli, S., Pasqualini, L., Pasternak, J., Patrick, C., Patrizii, L., Patterson, R. B., Patzak, T., Paudel, A., Paulucci, L., Pavlovic, Z., Pawloski, G., Payne, D., Pec, V., Pedreschi, E., Peeters, S. J. M., Pellico, W., Perez, A. Pena, Pennacchio, E., Penzo, A., Peres, O. L. G., Gonzalez, Y. F. Perez, Pérez-Molina, L., Pernas, C., Perry, J., Pershey, D., Pessina, G., Petrillo, G., Petta, C., Petti, R., Pfaff, M., Pia, V., Pickering, L., Pietropaolo, F., Pimentel, V. L., Pinaroli, G., Pincha, S., Pinchault, J., Pitts, K., Plows, K., Pollack, C., Pollman, T., Pompa, F., Pons, X., Poonthottathil, N., Popov, V., Poppi, F., Porter, J., Paixão, L. G. Porto, Potekhin, M., Potenza, R., Pozzato, M., Prakash, T., Pratt, C., Prest, M., Psihas, F., Pugnere, D., Qian, X., Queen, J., Raaf, J. L., Radeka, V., Rademacker, J., Radics, B., Raffaelli, F., Rafique, A., Raguzin, E., Rahaman, U., Rai, M., Rajagopalan, S., Rajaoalisoa, M., Rakhno, I., Rakotondravohitra, L., Ralte, L., Delgado, M. A. Ramirez, Ramson, B., Rappoldi, A., Raselli, G., Ratoff, P., Ray, R., Razafinime, H., Razakamiandra, R. F., Rea, E. M., Real, J. S., Rebel, B., Rechenmacher, R., Reichenbacher, J., Reitzner, S. D., Sfar, H. Rejeb, Renner, E., Renshaw, A., Rescia, S., Resnati, F., Restrepo, Diego, Reynolds, C., Ribas, M., Riboldi, S., Riccio, C., Riccobene, G., Ricol, J. S., Rigan, M., Rincón, E. V., Ritchie-Yates, A., Ritter, S., Rivera, D., Rivera, R., Robert, A., Rocha, J. L. Rocabado, Rochester, L., Roda, M., Rodrigues, P., Alonso, M. J. Rodriguez, Rondon, J. Rodriguez, Rosauro-Alcaraz, S., Rosier, P., Ross, D., Rossella, M., Rossi, M., Ross-Lonergan, M., Roy, N., Roy, P., Rubbia, C., Ruggeri, A., Ferreira, G. Ruiz, Russell, B., Ruterbories, D., Rybnikov, A., Sacerdoti, S., Saha, S., Sahoo, S. K., Sahu, N., Sala, P., Samios, N., Samoylov, O., Sanchez, M. C., Bravo, A. Sánchez, Sánchez-Castillo, A., Sanchez-Lucas, P., Sandberg, V., Sanders, D. A., Sanfilippo, S., Sankey, D., Santoro, D., Saoulidou, N., Sapienza, P., Sarasty, C., Sarcevic, I., Sarra, I., Savage, G., Savinov, V., Scanavini, G., Scaramelli, A., Scarff, A., Schefke, T., Schellman, H., Schifano, S., Schlabach, P., Schmitz, D., Schneider, A. W., Scholberg, K., Schukraft, A., Schuld, B., Segade, A., Segreto, E., Selyunin, A., Senadheera, D., Senise, C. R., Sensenig, J., Shaevitz, M. H., Shanahan, P., Sharma, P., Kumar, R., Poudel, S. Sharma, Shaw, K., Shaw, T., Shchablo, K., Shen, J., Shepherd-Themistocleous, C., Sheshukov, A., Shi, J., Shi, W., Shin, S., Shivakoti, S., Shoemaker, I., Shooltz, D., Shrock, R., Siddi, B., Siden, M., Silber, J., Simard, L., Sinclair, J., Sinev, G., Singh, Jaydip, Singh, J., Singh, L., Singh, P., Singh, V., Chauhan, S. Singh, Sipos, R., Sironneau, C., Sirri, G., Siyeon, K., Skarpaas, K., Smedley, J., Smith, E., Smith, J., Smith, P., Smolik, J., Smy, M., Snape, M., Snider, E. L., Snopok, P., Snowden-Ifft, D., Nunes, M. Soares, Sobel, H., Soderberg, M., Sokolov, S., Salinas, C. J. Solano, Söldner-Rembold, S., Solomey, N., Solovov, V., Sondheim, W. E., Sorel, M., Sotnikov, A., Soto-Oton, J., Sousa, A., Soustruznik, K., Spinella, F., Spitz, J., Spooner, N. J. C., Spurgeon, K., Stalder, D., Stancari, M., Stanco, L., Steenis, J., Stein, R., Steiner, H. M., Lisbôa, A. F. Steklain, Stepanova, A., Stewart, J., Stillwell, B., Stock, J., Stocker, F., Stokes, T., Strait, M., Strauss, T., Strigari, L., Stuart, A., Suarez, J. G., Subash, J., Surdo, A., Suter, L., Sutera, C. M., Sutton, K., Suvorov, Y., Svoboda, R., Swain, S. K., Szczerbinska, B., Szelc, A. M., Sztuc, A., Taffara, A., Talukdar, N., Tamara, J., Tanaka, H. A., Tang, S., Taniuchi, N., Casanova, A. M. Tapia, Oregui, B. Tapia, Tapper, A., Tariq, S., Tarpara, E., Tatar, E., Tayloe, R., Tedeschi, D., Teklu, A. M., Vidal, J. Tena, Tennessen, P., Tenti, M., Terao, K., Terranova, F., Testera, G., Thakore, T., Thea, A., Thomas, S., Thompson, A., Thorn, C., Timm, S. C., Tiras, E., Tishchenko, V., Tiwari, S., Todorović, N., Tomassetti, L., Tonazzo, A., Torbunov, D., Torti, M., Tortola, M., Tortorici, F., Tosi, N., Totani, D., Toups, M., Touramanis, C., Tran, D., Travaglini, R., Trevor, J., Triller, E., Trilov, S., Truchon, J., Truncali, D., Trzaska, W. H., Tsai, Y., Tsai, Y. -T., Tsamalaidze, Z., Tsang, K. V., Tsverava, N., Tu, S. Z., Tufanli, S., Tunnell, C., Turnberg, S., Turner, J., Tuzi, M., Tyler, J., Tyley, E., Tzanov, M., Uchida, M. A., González, J. Ureña, Urheim, J., Usher, T., Utaegbulam, H., Uzunyan, S., Vagins, M. R., Vahle, P., Valder, S., Valdiviesso, G. A., Valencia, E., Valentim, R., Vallari, Z., Vallazza, E., Valle, J. W. F., Van Berg, R., Van de Water, R. G., Forero, D. V., Vannozzi, A., Van Nuland-Troost, M., Varanini, F., Oliva, D. Vargas, Vasina, S., Vaughan, N., Vaziri, K., Vázquez-Ramos, A., Vega, J., Ventura, S., Verdugo, A., Vergani, S., Verzocchi, M., Vetter, K., Vicenzi, M., de Souza, H. Vieira, Vignoli, C., Vilela, C., Villa, E., Viola, S., Viren, B., Vizarreta, R., Hernandez, A. P. Vizcaya, Vuong, Q., Waldron, A. V., Wallbank, M., Walsh, J., Walton, T., Wang, H., Wang, J., Wang, L., Wang, M. H. L. S., Wang, X., Wang, Y., Warburton, K., Warner, D., Warsame, L., Wascko, M. O., Waters, D., Watson, A., Wawrowska, K., Weber, A., Weber, C. M., Weber, M., Wei, H., Weinstein, A., Westerdale, S., Wetstein, M., Whalen, K., White, A., Whitehead, L. H., Whittington, D., Wilhlemi, J., Wilking, M. J., Wilkinson, A., Wilkinson, C., Wilson, F., Wilson, R. J., Winter, P., Wisniewski, W., Wolcott, J., Wolfs, J., Wongjirad, T., Wood, A., Wood, K., Worcester, E., Worcester, M., Wospakrik, M., Wresilo, K., Wret, C., Wu, S., Wu, W., Wurm, M., Wyenberg, J., Xiao, Y., Xiotidis, I., Yaeggy, B., Yahlali, N., Yandel, E., Yang, J., Yang, K., Yang, T., Yankelevich, A., Yershov, N., Yonehara, K., Young, T., Yu, B., Yu, H., Yu, J., Yu, Y., Yuan, W., Zaki, R., Zalesak, J., Zambelli, L., Zamorano, B., Zani, A., Zapata, O., Zazueta, L., Zeller, G. P., Zennamo, J., Zeug, K., Zhang, C., Zhang, S., Zhao, M., Zhivun, E., Zimmerman, E. D., Zucchelli, S., Zuklin, J., Zutshi, V., and Zwaska, R.
- Subjects
Physics - Instrumentation and Detectors ,High Energy Physics - Experiment - Abstract
This paper introduces the hypothetical track-length fitting algorithm, a novel method for measuring the kinetic energies of ionizing particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe impact of the dE/dx model on energy measurement performance. The method described in this paper to characterize the energy measurement performance can be repeated in any LArTPC experiment using stopping secondary charged pions.
- Published
- 2024
47. Bootstrapping string models with entanglement minimization and Machine-Learning
- Author
-
Bhat, Faizan, Chowdhury, Debapriyo, Saha, Arnab Priya, and Sinha, Aninda
- Subjects
High Energy Physics - Theory ,Mathematical Physics - Abstract
We present a new approach to bootstrapping string-like theories by exploiting a local crossing symmetric dispersion relation and field redefinition ambiguities. This approach enables us to use mass-level truncation and to go beyond the dual resonance hypothesis. We consider both open and closed strings, focusing mainly on open tree-level amplitudes with integer-spaced spectrum, and two leading Wilson coefficients as inputs. Using entanglement minimization in the form of the minimum of the first finite moment of linear entropy or entangling power, we get an excellent approximation to the superstring amplitudes, including the leading and sub-leading Regge trajectories. We find other interesting S-matrices which do not obey the duality hypothesis, but exhibit a transition from Regge behaviour to power law behaviour in the high energy limit. Finally, we also examine Machine-Learning techniques to do bootstrap and discuss potential advantages over the present approach., Comment: 48 pages, 21 figures
- Published
- 2024
48. Search for Dark Matter in association with a Higgs boson at the LHC: A model independent study
- Author
-
Baradia, Sweta, Bhattacharyya, Sanchari, Datta, Anindya, Dutta, Suchandra, Chowdhury, Suvankar Roy, and Sarkar, Subir
- Subjects
High Energy Physics - Phenomenology ,High Energy Physics - Experiment - Abstract
Astrophysical and cosmological observations strongly suggest the existence of Dark Matter. However, it's fundamental nature is still elusive. Collider experiments at Large Hadron Collider (LHC) offer a promising way to reveal the particle nature of the dark matter. In such an endeavour, we investigate the potential of the mono-Higgs plus missing $E_T$ signature at the LHC to search for dark matter. Without going in a particular Ultra-Violet complete model of dark matter, we have used the framework of Effective Field Theory to describe the dynamics of a relatively light fermionic dark matter candidate, which interacts with the Standard Model via dimension-6 and dimension-7 operators involving the Higgs and the gauge bosons. Both cut-based and Boosted Decision Tree (BDT) algorithms have been used to extract the signal for dark matter production over the Standard Model backgrounds, assuming an integrated luminosity of $3000~fb^{-1}$ at $\sqrt{s}~=~14$ TeV at the High Luminosity phase of the LHC (HL-LHC). The BDT is seen to separate the dark matter signal at $5\sigma$ significance, for masses below 200 GeV, showcasing the prospects of this search at the HL-LHC., Comment: 19 Pages, 8 Figures, 8 Tables
- Published
- 2024
49. Ophthalmic Biomarker Detection with Parallel Prediction of Transformer and Convolutional Architecture
- Author
-
Islam, Md. Touhidul, Chowdhury, Md. Abtahi Majeed, Hasan, Mahmudul, Quadir, Asif, and Aktar, Lutfa
- Subjects
Computer Science - Artificial Intelligence - Abstract
Ophthalmic diseases represent a significant global health issue, necessitating the use of advanced precise diagnostic tools. Optical Coherence Tomography (OCT) imagery which offers high-resolution cross-sectional images of the retina has become a pivotal imaging modality in ophthalmology. Traditionally physicians have manually detected various diseases and biomarkers from such diagnostic imagery. In recent times, deep learning techniques have been extensively used for medical diagnostic tasks enabling fast and precise diagnosis. This paper presents a novel approach for ophthalmic biomarker detection using an ensemble of Convolutional Neural Network (CNN) and Vision Transformer. While CNNs are good for feature extraction within the local context of the image, transformers are known for their ability to extract features from the global context of the image. Using an ensemble of both techniques allows us to harness the best of both worlds. Our method has been implemented on the OLIVES dataset to detect 6 major biomarkers from the OCT images and shows significant improvement of the macro averaged F1 score on the dataset., Comment: 5 pages
- Published
- 2024
50. A Hybrid Quantum-Classical AI-Based Detection Strategy for Generative Adversarial Network-Based Deepfake Attacks on an Autonomous Vehicle Traffic Sign Classification System
- Author
-
Salek, M Sabbir, Li, Shaozhi, and Chowdhury, Mashrur
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Emerging Technologies - Abstract
The perception module in autonomous vehicles (AVs) relies heavily on deep learning-based models to detect and identify various objects in their surrounding environment. An AV traffic sign classification system is integral to this module, which helps AVs recognize roadway traffic signs. However, adversarial attacks, in which an attacker modifies or alters the image captured for traffic sign recognition, could lead an AV to misrecognize the traffic signs and cause hazardous consequences. Deepfake presents itself as a promising technology to be used for such adversarial attacks, in which a deepfake traffic sign would replace a real-world traffic sign image before the image is fed to the AV traffic sign classification system. In this study, the authors present how a generative adversarial network-based deepfake attack can be crafted to fool the AV traffic sign classification systems. The authors developed a deepfake traffic sign image detection strategy leveraging hybrid quantum-classical neural networks (NNs). This hybrid approach utilizes amplitude encoding to represent the features of an input traffic sign image using quantum states, which substantially reduces the memory requirement compared to its classical counterparts. The authors evaluated this hybrid deepfake detection approach along with several baseline classical convolutional NNs on real-world and deepfake traffic sign images. The results indicate that the hybrid quantum-classical NNs for deepfake detection could achieve similar or higher performance than the baseline classical convolutional NNs in most cases while requiring less than one-third of the memory required by the shallowest classical convolutional NN considered in this study.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.