Search

Your search keyword '"Suresh, S"' showing total 21,010 results
Start Over Author "Suresh, S"

Refine your results

more »

more »

more »

more »

more »

more »
21,010 results on '"Suresh, S"'

6. Role of NH3 Binding Energy in the Early Evolution of Protostellar Cores

Author

Suresh, S. Kakkenpara, Sipila, O., Caselli, P., and Dulieu, F.

Subjects
Astrophysics - Astrophysics of Galaxies, Astrophysics - Solar and Stellar Astrophysics
Abstract

NH$_{3}$(ammonia) plays a critical role in the chemistry of star and planet formation, yet uncertainties in its binding energy (BE) values complicate accurate estimates of its abundances. Recent research suggests a multi-binding energy approach, challenging the previous single-value notion. In this work, we use different values of NH$_{3}$ binding energy to examine its effects on the NH$_{3}$ abundances and, consequently, in the early evolution of protostellar cores. Using a gas-grain chemical network, we systematically vary the values of NH$_{3}$ binding energies in a model Class 0 protostellar core and study the effects of these binding energies on the NH$_{3}$ abundances. Our simulations indicate that abundance profiles of NH$_{3}$ are highly sensitive to the binding energy used, particularly in the warmer inner regions of the core. Higher binding energies lead to lower gas-phase NH$_{3}$ abundances, while lower values of binding energy have the opposite effect. Furthermore, this BE-dependent abundance variation of NH$_{3}$ significantly affects the formation pathways and abundances of key species such as HNC, HCN, and CN. Our tests also reveal that the size variation of the emitting region due to binding energy becomes discernible only with beam sizes of 10 arcsec or less. These findings underscore the importance of considering a range of binding energies in astrochemical models and highlight the need for higher resolution observations to better understand the subtleties of molecular cloud chemistry and star formation processes.

Published
2024

31. Modeling of a Novel Correlation-Weighted Elman Neural Network for Building Automation System

Author

Kannan, R., Suresh, S., Bhuvanesh, A., Sivasankari, N., Nandu Krishna, S., Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Tan, Kay Chen, Series Editor, Shrivastava, Vivek, editor, Bansal, Jagdish Chand, editor, and Panigrahi, B. K., editor

Published
2025
Full Text
View/download PDF

38. Solving the insecurity problem for assertions

Author

Ramanujam, R, Sundararajan, Vaishnavi, and Suresh, S P

Subjects
Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security
Abstract

In the symbolic verification of cryptographic protocols, a central problem is deciding whether a protocol admits an execution which leaks a designated secret to the malicious intruder. Rusinowitch & Turuani (2003) show that, when considering finitely many sessions, this ``insecurity problem'' is NP-complete. Central to their proof strategy is the observation that any execution of a protocol can be simulated by one where the intruder only communicates terms of bounded size. However, when we consider models where, in addition to terms, one can also communicate logical statements about terms, the analysis of the insecurity problem becomes tricky when both these inference systems are considered together. In this paper we consider the insecurity problem for protocols with logical statements that include {\em equality on terms} and {\em existential quantification}. Witnesses for existential quantifiers may be unbounded, and obtaining small witness terms while maintaining equality proofs complicates the analysis considerably. We extend techniques from Rusinowitch & Turuani (2003) to show that this problem is also in NP.

Published
2023

Catalog

Books, media, physical & digital resources
See catalog results