Indian Institute of Technology Bombay

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.

Coded Caching for Multi-level Popularity and Access

Abstract: To address the exponentially rising demand for wireless content, the use of caching is emerging as a potential solution. It has been recently established that joint design of content delivery and storage (coded caching) can significantly improve performance over conventional caching. Coded caching is well suited to emerging heterogeneous wireless architectures which consist of a dense deployment of local-coverage wireless access points (APs) with high data rates, along with sparsely-distributed, large-coverage macro-cell base stations (BS). This enables design of coded caching-and-delivery schemes that equip APs with storage, and place content in them in a way that creates coded-multicast opportunities for combining with macro-cell broadcast to satisfy users even with different demands. Such coded-caching schemes have been shown to be order-optimal with respect to the BS transmission rate, for a system with single-level content, i.e., one where all content is uniformly popular. In this paper, we consider a system with non-uniform popularity content which is divided into multiple levels, based on varying degrees of popularity. The main contribution of this paper is the derivation of an order-optimal scheme which judiciously shares cache memory among files with different popularities. To show order-optimality we derive new information-theoretic lower bounds, which use a sliding-window entropy inequality, effectively creating a non-cut-set bound. We also extend the ideas to when users can access multiple caches along with the broadcast. Finally, we consider two extreme cases of user distribution across caches for the multi-level popularity model: a single user per cache (single-user setup) versus a large number of users per cache (multi-user setup), and demonstrate a dichotomy in the order-optimal strategies for these two extreme cases.

Extending the 'Oriented Smoothness Constraint' into the Temporal Domain and the Estimation of Derivatives of Optical Flow

Abstract: Recent experimental results by Schnorr 89 with an approach based on a simplified ‘oriented smoothness constraint’ show considerable improvement at expected discontinuities of the optical flow field. It thus appears justified to study whether the local gray value variation can be exploited in the temporal as well as in the spatial domain in order to achieve further improvements at discontinuities in the optical flow field associated with the image areas of moving objects in image sequences. An extension of the oriented smoothness constraint into the temporal domain is presented. In this context, a local estimation approach for the spatio-temporal partial derivatives of optical flow has been developed. This, in turn, is used to compare two approaches for the definition of optical flow.

Precision Measurement of the Longitudinal Double-Spin Asymmetry for Inclusive Jet Production in Polarized Proton Collisions at s =200GeV

Abstract: We report a new measurement of the midrapidity inclusive jet longitudinal double-spin asymmetry, A_{LL}, in polarized pp collisions at center-of-mass energy sqrt[s]=200 GeV. The STAR data place stringent constraints on polarized parton distribution functions extracted at next-to-leading order from global analyses of inclusive deep-inelastic scattering (DIS), semi-inclusive DIS, and RHIC pp data. The measured asymmetries provide evidence at the 3σ level for positive gluon polarization in the Bjorken-x region x>0.05.