Birla Institute of Technology and Science

About: Birla Institute of Technology and Science is a education organization based out in Pilāni, Rajasthan, India. It is known for research contribution in the topics: Computer science & Population. The organization has 8897 authors who have published 13947 publications receiving 170008 citations.

On the Reliability of Global and Local Electrophilicity Descriptors

Abstract: The global electrophilicity index w (as defined by Parr et al. J. Am. Chem. Soc. 1999, 121, 1992) and local “philicity” index, (as defined by Chattaraj et al. J. Phys. Chem. A 2003, 107, 4973) of some carbonyl compounds are evaluated on the basis of Mulliken population analysis (MPA) and Hirshfeld population analysis (HPA) schemes. It is observed that the local electrophilicity indices (i.e., ), extracted from both HPA and MPA based charge, produce reliable intermolecular electrophilicity trends except in one case each. However, the reliability is lost in some cases when w is used. It is also shown both through numerical demonstrations and analytical proof that for generating intramolecular reactivity trends “philicity” index does not provide any extra reliability over local softness or Fukui function values. “Relative electrophilicity” and “relative nucleophilicity”, as defined by Roy et al. (J. Phys. Chem. A 1998, 102, 3746), generate the most reliable intramolecular reactivity (i.e., site selectivity) ...

A Prey-Predator Model with a Reserved Area

Abstract: In this paper, a mathematical model is proposed and analysed to study the dynamics of a prey-predator model. It is assumed that the habitat is divided into two zones, namely free zone and reserved zone. Predators are not allowed to enter into the reserved zone. Criteria for the coexistence of predator-prey are obtained. The role of reserved zone is investigated and it is shown that the reserve zone has a stabilizing effect on predator-prey interactions.

A Lightweight Authentication and Attestation Scheme for In-Transit Vehicles in IoV Scenario

Abstract: With the rise of new technological paradigms such as the Internet of Things (IoT) and the Internet of Vehicles (IoV), we are going to see an unprecedented growth of connected vehicles on the roads. Also, with the ever-increasing complexity of vehicular electronics and with the increasing number of Electronic Control Units (ECUs) inside these next-generation vehicles, the need for verification of the firmware and software running on these ECUs using attestation techniques is heightened all the more. In this paper, we propose a lightweight and secure authentication and attestation scheme for attesting vehicles while they are on the roads. Since this attestation is proposed to be carried out on moving vehicles, there is also a need for authenticating the vehicles with the Road Side Units (RSUs) first before carrying out attestation. Therefore, a combined attestation and authentication scheme for verification of the vehicle ECU firmware is presented here. The ECU firmware running on the vehicles can be attested from the edge servers connected to the RSUs while the vehicles are in-transit and passing through these RSUs. We perform a security analysis of the proposed attestation and authentication protocol and compare it with other similar existing protocols. We also do a performance analysis of the proposed protocol and show the feasibility of its deployment.

On the Kernelization Complexity of Colorful Motifs

Abstract: The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every color in the graph exactly once. The problem is motivated by applications in computational biology and is also well-studied from the theoretical point of view. In particular, it is known to be NP-complete even on trees of maximum degree three [Fellows et al, ICALP 2007]. In their pioneering paper that introduced the color-coding technique, Alon et al. [STOC 1995] show, inter alia, that the problem is FPT on general graphs. More recently, Cygan et al. [WG 2010] showed that Colorful Motif is NP-complete on comb graphs, a special subclass of the set of trees of maximum degree three. They also showed that the problem is not likely to admit polynomial kernels on forests.