An exploration framework to identify and track movement of cloud systems

We describe a framework to explore and visualize the movement of cloud systems. Using techniques from computational topology and computer vision, our framework allows the user to study this movement at various scales in space and time. Such movements could have large temporal and spatial scales such as the Madden Julian Oscillation (MJO), which has a spatial scale ranging from 1000 km to 10000 km and time of oscillation of around 40 days. Embedded within these larger scale oscillations are a hierarchy of cloud clusters which could have smaller spatial and temporal scales such as the Nakazawa cloud clusters. These smaller cloud clusters, while being part of the equatorial MJO, sometimes move at speeds different from the larger scale and in a direction opposite to that of the MJO envelope. Hitherto, one could only speculate about such movements by selectively analysing data and a priori knowledge of such systems. Our framework automatically delineates such cloud clusters and does not depend on the prior experience of the user to define cloud clusters. Analysis using our framework also shows that most tropical systems such as cyclones also contain multi-scale interactions between clouds and cloud systems. We show the effectiveness of our framework to track organized cloud system during one such rainfall event which happened at Mumbai, India in July 2005 and for cyclone Aila which occurred in Bay of Bengal during May 2009.

Variability of cloud liquid water and ice over South Asia from TMI estimates

In this study, the Tropical Rainfall Measurement Mission based Microwave Imager estimates (2A12) have been used to compare and contrast the characteristics of cloud liquid water and ice over the Indian land region and the ocean surrounding it, during the premonsoon (May) and monsoon (June-September) seasons. Based on the spatial homogeneity of rainfall, we have selected five regions for our study (three over ocean, two over land). Comparison across three ocean regions suggests that the cloud liquid water (CLW) over the orographically influenced Arabian Sea (close to the Indian west coast) behaves differently from the CLW over a trapped ocean (Bay of Bengal) or an open ocean (equatorial Indian Ocean). Specifically, the Arabian Sea region shows higher liquid water for a lower range of rainfall, whereas the Bay of Bengal and the equatorial Indian Ocean show higher liquid water for a higher range of rainfall. Apart from geographic differences, we also documented seasonal differences by comparing CLW profiles between monsoon and premonsoon periods, as well as between early and peak phases of the monsoon. We find that the CLW during the lean periods of rainfall (May or June) is higher than during the peak and late monsoon season (July-September) for raining clouds. As active and break phases are important signatures of the monsoon progression, we also analysed the differences in CLW during various phases of the monsoon, namely, active, break, active-to-break and break-to-active transition phases. We find that the cloud liquid water content during the break-to-active transition phase is significantly higher than during the active-to-break transition phase over central India. We speculate that this could be attributed to higher amount of aerosol loading over this region during the break phase. We lend credence to this aerosol-CLW/rain association by comparing the central Indian CLW with that over southeast Asia (where the aerosol loading is significantly smaller) and find that in the latter region, there are no significant differences in CLW during the different phases of the monsoon. While our hypothesis needs to be further investigated with numerical models, the results presented in this study can potentially serve as a good benchmark in evaluating the performance of cloud resolving models over the Indian region.

Energy Efficient GPS Acquisition with Sparse-GPS

Following rising demands in positioning with GPS, low-cost receivers are becoming widely available; but their energy demands are still too high. For energy efficient GPS sensing in delay-tolerant applications, the possibility of offloading a few milliseconds of raw signal samples and leveraging the greater processing power of the cloud for obtaining a position fix is being actively investigated. In an attempt to reduce the energy cost of this data offloading operation, we propose Sparse-GPS(1): a new computing framework for GPS acquisition via sparse approximation. Within the framework, GPS signals can be efficiently compressed by random ensembles. The sparse acquisition information, pertaining to the visible satellites that are embedded within these limited measurements, can subsequently be recovered by our proposed representation dictionary. By extensive empirical evaluations, we demonstrate the acquisition quality and energy gains of Sparse-GPS. We show that it is twice as energy efficient than offloading uncompressed data, and has 5-10 times lower energy costs than standalone GPS; with a median positioning accuracy of 40 m.

DEEP WASHINGTON PHOTOMETRY OF INCONSPICUOUS STAR CLUSTER CANDIDATES IN THE LARGE MAGELLANIC CLOUD

We present deep Washington photometry of 45 poorly populated star cluster candidates in the Large Magellanic Cloud (LMC). We have performed a systematic study to estimate the parameters of the cluster candidates by matching theoretical isochrones to the cleaned and dereddened cluster color-magnitude diagrams. We were able to estimate the basic parameters for 33 clusters, out of which 23 are identified as single clusters and 10 are found to be members of double clusters. The other 12 cluster candidates have been classified as possible clusters/asterisms. About 50% of the true clusters are in the 100-300 Myr age range, whereas some are older or younger. We have discussed the distribution of age, location, and reddening with respect to field, as well as the size of true clusters. The sizes and masses of the studied sample are found to be similar to that of open clusters in the Milky Way. Our study adds to the lower end of cluster mass distribution in the LMC, suggesting that the LMC, apart from hosting rich clusters, also has formed small, less massive open clusters in the 100-300 Myr age range.

History of Computing in India: 1955-2010

The history of computing in India is inextricably intertwined with two interacting forces: the political climate determined by the political party in power) and the government policies mainly driven by the technocrats and bureaucrats who acted within the boundaries drawn by the political party in power. There were four break points (which occurred in 1970, 1978, 1991 and 1998) that changed the direction of the development of computers and their applications. This article explains why these breaks occurred and how they affected the history of computing in India.

Dependence of ``critical cloud fraction' on aerosol composition

Recent studies, over regions influenced by biomass burning aerosol, have shown that it is possible to define a critical cloud fraction' (CCF) at which the aerosol direct radiative forcing switch from a cooling to a warming effect. Using 4 years of multi-satellite data analysis, we show that CCF varies with aerosol composition and changed from 0.28 to 0.13 from postmonsoon to winter as a result of shift from less absorbing to moderately absorbing aerosol. Our results indicate that we can estimate aerosol absorption from space using independently measured top of the atmosphere (TOA) fluxes Cloud Aerosol Lidar with Orthogonal Polarization-Moderate resolution Imaging Spectroradiometer-Clouds and the Earth's Radiant Energy System (CALIPSO-MODIS-CERES)] combined algorithms for example.

Converses For Secret Key Agreement and Secure Computing

We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application's throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based lookahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from Amazon AWS IaaS public cloud. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

Photometric metallicity map of the Large Magellanic Cloud

We have estimated a metallicity map of the Large Magellanic Cloud (LMC) using the Magellanic Cloud Photometric Survey (MCPS) and Optical Gravitational Lensing Experiment (OGLE III) photometric data. This is a first of its kind map of metallicity up to a radius of 4 degrees-5 degrees, derived using photometric data and calibrated using spectroscopic data of Red Giant Branch (RGB) stars. We identify the RGB in the V, (V - I) colour-magnitude diagrams of small subregions of varying sizes in both data sets. We use the slope of the RGB as an indicator of the average metallicity of a subregion, and calibrate the RGB slope to metallicity using spectroscopic data for field and cluster red giants in selected subregions. The average metallicity of the LMC is found to be Fe/H] = -0.37 dex (sigmaFe/H] = 0.12) from MCPS data, and Fe/H] = -0.39 dex (sigmaFe/H] = 0.10) from OGLE III data. The bar is found to be the most metal-rich region of the LMC. Both the data sets suggest a shallow radial metallicity gradient up to a radius of 4 kpc (-0.049 +/- 0.002 dex kpc(-1) to -0.066 +/- 0.006 dex kpc(-1)). Subregions in which the mean metallicity differs from the surrounding areas do not appear to correlate with previously known features; spectroscopic studies are required in order to assess their physical significance.

Hydrogen Bonds Computing Server (HBCS): an online web server to compute hydrogen-bond interactions and their precision

Hydrogen bonds in biological macromolecules play significant structural and functional roles. They are the key contributors to most of the interactions without which no living system exists. In view of this, a web-based computing server, the Hydrogen Bonds Computing Server (HBCS), has been developed to compute hydrogen-bond interactions and their standard deviations for any given macromolecular structure. The computing server is connected to a locally maintained Protein Data Bank (PDB) archive. Thus, the user can calculate the above parameters for any deposited structure, and options have also been provided for the user to upload a structure in PDB format from the client machine. In addition, the server has been interfaced with the molecular viewers Jmol and JSmol to visualize the hydrogen-bond interactions. The proposed server is freely available and accessible via the World Wide Web at http://bioserver1.physics.iisc.ernet.in/hbcs/.