scispace - formally typeset
Search or ask a question
Institution

Indian Institute of Technology Bombay

EducationMumbai, India
About: Indian Institute of Technology Bombay is a education organization based out in Mumbai, India. It is known for research contribution in the topics: Population & Thin film. The organization has 16756 authors who have published 33588 publications receiving 570559 citations.


Papers
More filters
Journal ArticleDOI
B. P. Abbott1, Richard J. Abbott1, T. D. Abbott2, Fausto Acernese3  +1195 moreInstitutions (139)
TL;DR: In this paper, the authors used the observed time delay of $(+1.74\pm 0.05)\,{\rm{s}}$ between GRB 170817A and GW170817 to constrain the difference between the speed of gravity and speed of light to be between $-3
Abstract: On 2017 August 17, the gravitational-wave event GW170817 was observed by the Advanced LIGO and Virgo detectors, and the gamma-ray burst (GRB) GRB 170817A was observed independently by the Fermi Gamma-ray Burst Monitor, and the Anti-Coincidence Shield for the Spectrometer for the International Gamma-Ray Astrophysics Laboratory. The probability of the near-simultaneous temporal and spatial observation of GRB 170817A and GW170817 occurring by chance is $5.0\times {10}^{-8}$. We therefore confirm binary neutron star mergers as a progenitor of short GRBs. The association of GW170817 and GRB 170817A provides new insight into fundamental physics and the origin of short GRBs. We use the observed time delay of $(+1.74\pm 0.05)\,{\rm{s}}$ between GRB 170817A and GW170817 to: (i) constrain the difference between the speed of gravity and the speed of light to be between $-3\times {10}^{-15}$ and $+7\times {10}^{-16}$ times the speed of light, (ii) place new bounds on the violation of Lorentz invariance, (iii) present a new test of the equivalence principle by constraining the Shapiro delay between gravitational and electromagnetic radiation. We also use the time delay to constrain the size and bulk Lorentz factor of the region emitting the gamma-rays. GRB 170817A is the closest short GRB with a known distance, but is between 2 and 6 orders of magnitude less energetic than other bursts with measured redshift. A new generation of gamma-ray detectors, and subthreshold searches in existing detectors, will be essential to detect similar short bursts at greater distances. Finally, we predict a joint detection rate for the Fermi Gamma-ray Burst Monitor and the Advanced LIGO and Virgo detectors of 0.1–1.4 per year during the 2018–2019 observing run and 0.3–1.7 per year at design sensitivity.

2,633 citations

Journal ArticleDOI
01 May 2002-Fuel
TL;DR: In this article, a unified correlation for computation of higher heating value (HHV) from elemental analysis of fuels is proposed, which has been derived using 225 data points and validated for additional 50 data points.

1,955 citations

Journal ArticleDOI
TL;DR: Various aspects of energy harvesting sensor systems- architecture, energy sources and storage technologies and examples of harvesting-based nodes and applications are surveyed and the implications of recharge opportunities on sensor node operation and design of sensor network solutions are discussed.
Abstract: Sensor networks with battery-powered nodes can seldom simultaneously meet the design goals of lifetime, cost, sensing reliability and sensing and transmission coverage. Energy-harvesting, converting ambient energy to electrical energy, has emerged as an alternative to power sensor nodes. By exploiting recharge opportunities and tuning performance parameters based on current and expected energy levels, energy harvesting sensor nodes have the potential to address the conflicting design goals of lifetime and performance. This paper surveys various aspects of energy harvesting sensor systems- architecture, energy sources and storage technologies and examples of harvesting-based nodes and applications. The study also discusses the implications of recharge opportunities on sensor node operation and design of sensor network solutions.

1,870 citations

Journal ArticleDOI
17 May 1999
TL;DR: A new hypertext resource discovery system called a Focused Crawler that is robust against large perturbations in the starting set of URLs, and capable of exploring out and discovering valuable resources that are dozens of links away from the start set, while carefully pruning the millions of pages that may lie within this same radius.
Abstract: The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers and search engines In this paper we describe a new hypertext resource discovery system called a Focused Crawler The goal of a focused crawler is to selectively seek out pages that are relevant to a pre-defined set of topics The topics are specified not using keywords, but using exemplary documents Rather than collecting and indexing all accessible Web documents to be able to answer all possible ad-hoc queries, a focused crawler analyzes its crawl boundary to find the links that are likely to be most relevant for the crawl, and avoids irrelevant regions of the Web This leads to significant savings in hardware and network resources, and helps keep the crawl more up-to-date To achieve such goal-directed crawling, we designed two hypertext mining programs that guide our crawler: a classifier that evaluates the relevance of a hypertext document with respect to the focus topics, and a distiller that identifies hypertext nodes that are great access points to many relevant pages within a few links We report on extensive focused-crawling experiments using several topics at different levels of specificity Focused crawling acquires relevant pages steadily while standard crawling quickly loses its way, even though they are started from the same root set Focused crawling is robust against large perturbations in the starting set of URLs It discovers largely overlapping sets of resources in spite of these perturbations It is also capable of exploring out and discovering valuable resources that are dozens of links away from the start set, while carefully pruning the millions of pages that may lie within this same radius Our anecdotes suggest that focused crawling is very effective for building high-quality collections of Web documents on specific topics, using modest desktop hardware © 1999 Published by Elsevier Science BV All rights reserved

1,700 citations

Journal ArticleDOI

1,696 citations


Authors

Showing all 17055 results

NameH-indexPapersCitations
Jovan Milosevic1521433106802
C. N. R. Rao133164686718
Robert R. Edelman11960549475
Claude Andre Pruneau11461045500
Sanjeev Kumar113132554386
Basanta Kumar Nandi11257243331
Shaji Kumar111126553237
Josep M. Guerrero110119760890
R. Varma10949741970
Vijay P. Singh106169955831
Vinayak P. Dravid10381743612
Swagata Mukherjee101104846234
Anil Kumar99212464825
Dhiman Chakraborty9652944459
Michael D. Ward9582336892
Network Information
Related Institutions (5)
Royal Institute of Technology
68.4K papers, 1.9M citations

94% related

Nanyang Technological University
112.8K papers, 3.2M citations

93% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

93% related

Georgia Institute of Technology
119K papers, 4.6M citations

93% related

Delft University of Technology
94.4K papers, 2.7M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023175
2022433
20213,013
20203,093
20192,760
20182,549