Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Alkylation of toluene by methanol over alkali exchanged zeolite-X: side chain versus ring alkylation

The ring versus side-chain alkylation of toluene with methanol over alkali-exchanged zeolite-X of differing basicity has been investigated by in situ infrared spectroscopy and TPD measurements. Over the basic Cs-exchanged zeolite the product of alkylation is styrene/ethylbenzene while over the acidic Li-exchanged zeolite ring alkylation occurs to give mainly xylene as the product. FTIR and TPD investigations reveal that, the key difference in the two types of alkylation processes lies in the state of the adsorbed methanol present at higher temperatures in the zeolite. In basic zeolites, methanol decomposes to formaldehyde and formates. The former is the key ‘side-chain’ alkylating species that leads to the formation of styrene. In the acidic zeolites it is shown that methanol bound to the acid sites plays an active role in the ‘ring alkylation’ of toluene to xylene.

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

Surface pressure and heat transfer measurements in the unsteady separated hypersonic flow field over double cones

Reliable bench mark experimental database in the separated hypersonic flow regime is necessary to validate high resolution CFD codes. In this paper we report the surface pressure and heat transfer measurements carried out on double cones (first cone semi-apex angle = 15, 25 deg.; second cone semi-apex angle= 35, 68 deg.) at hypersonic speeds that will be useful for CFD code validation studies. The surface pressure measurements are carried out at nominal Mach number of 8.35 in the IISc hypersonic wind tunnel. On the other hand the surface heat transfer measurements are carried out at a nominal Mach number of 5.75 in the IISc hypersonic shock tunnel. The flow separation point on the first cone, flow reattachment on the second cone and the wild fluctuation of the transmitted shock on the second cone surface (25/68 deg. double cone) in the presence of severe adverse pressure gradient are some of the flow features captured in the measurements. The results from the CFD studies indicate good agreement with experiments in the attached flow regime while considerable differences are noticeable in the separated flow regime.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Sampling disturbances of soft sensitive clays

Sampling disturbance is unavoidable and hence the laboratory testing most often is on partially disturbed samples. This paper deals with the development of a simple method to assess degree of sample disturbance from the prediction of yield stress due to cementation and comparison of yield stress in compression of partially disturbed sample with reference to a predicted compression path of the clay devoid of any mechanical disturbance. The method uses simple parameters which are normally determined in routine investigations.

Esterification of stearic acid with p-cresol over modified Indian bentonite clay catalysts

The esterification of stearic acid with p-cresol using modified Indian bentonite clay catalysts has been reported. The reaction was studied over exchanged clays, acid activated clays, exchanged acid activated clays, aluminium pillared clay, aluminium pillared acid activated clay, molecular sieve Al-MCM-41, zeolite H beta, ZrO2, S-ZrO2, p-TSA, montmorillonite K10, and montmorillonite KSF in o-xylene for 6 h. The catalysts were characterized by X-ray diffraction and surface area measurements. The acidity was determined by n-butylamine back-titration method and DRIFTS after pyridine adsorption. Acid activated Indian bentonite (AAIB) was found to be a better catalyst compared to other catalysts in the esterification of stearic acid with p-cresol.

Plumes Dynamics and Heat Transfer over Horizontal Grooved Surfaces

This study investigates the free convection and plumes dynamics over horizontal surfaces with parallel V-grooves. The convection is studied in a tank of water with the bottom surface being a smooth or grooved surface and the top of the water surface exposed to ambient. Two groove heights were used-10 mm and 3 mm-and the experiment was done with two values of aspect ratio-2.9 and 1.8 (aspect ratio is the width of the fluid layer/height of fluid layer). Heat flux at the bottom surface was from electrical heating. Beyond a certain critical temperature difference, enhanced heat transfer is obtained on the grooved surface compared to a smooth surface. Nusselt numbers are evaluated for both smooth and grooved surfaces and correlated using modified Rayleigh numbers. Visualization shows that the enhanced heat transport in the rough cavities cannot be ascribed to the increase in the contact area; rather, it must be the local dynamics of the thermal boundary layer.

Multi-decadal variation of the net downward shortwave radiation over south Asia: The solar dimming effect

The solar radiation flux at the earth's surface has gone through decadal changes of decreasing and increasing trends over the globe. These phenomena known as dimming and brightening, respectively, have attracted the scientific interest in relation to the changes in radiative balance and climate. Despite the interest in the solar dimming/brightening phenomenon in various parts of the world, south Asia has not attracted great scientific attention so far. The present work uses the net downward shortwave radiation (NDSWR) values derived from satellites (Modern Era Retrospective-analysis for Research and Applications, MERRA 2D) in order to examine the multi-decadal variations in the incoming solar radiation over south Asia for the period of 1979-2004. From the analysis it is seen that solar dimming continues over south Asia with a trend of -0.54 Wm(-2) yr(-1). Assuming clear skies an average decrease of -0.05 Wm(-2)yr(-1) in NDSWR was observed, which is attributed to increased aerosol emissions over the region. There is evidence that the increase in cloud optical depth plays the major role for the solar dimming over the area. The cloud optical depth (MERRA retrievals) has increased by 10.7% during the study period, with the largest increase to be detected for the high-level (atmospheric pressure P < 400 hPa) clouds (31.2%). Nevertheless, the decrease in solar radiation and the role of aerosols and clouds exhibit large monthly and seasonal variations directly affected by the local monsoon system, the anthropogenic and natural aerosol emissions. All these aspects are examined in detail aiming at shedding light into the solar dimming phenomenon over a densely populated area. (C) 2011 Elsevier Ltd. All rights reserved.

Flow visualization in turbulent free convection over horizontal smooth and grooved surfaces

The present paper discusses the flow visualization for turbulent free convection in a tank of water with the bottom surface being a smooth or a grooved surface and the top of the water surface exposed to ambient. The grooved surface is of parallel 90 degrees V-grooves with groove height of 10 mm and groove width of 20 mm. The experiment is carried out with aspect ratio (AR) of 2.9 and Rayleigh number (Ra) in the range, 1.3 x 10(7) - 4 x 10(7). Here AR is the aspect ratio (= width of fluid layer/height of fluid layer). Heat flux at the bottom surface is from electrical heating. From the pH-dye visualization, interesting flow structures are observed and these structures are analyzed with the help of plumes dynamics and temperature variations with time. (C) 2011 Elsevier Ltd. All rights reserved.

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.

Northeast monsoon over India: variability and prediction

South peninsular India experiences a large portion of the annual rainfall during the northeast monsoon season (October to December). In this study, the facets of diurnal, intra-seasonal and inter-annual variability of the northeast monsoon rainfall (the NEMR) over India have been examined. The analysis of satellite derived hourly rainfall reveals that there are distinct features of diurnal variation over the land and oceans during the season. Over the land, rainfall peaks during the late afternoon/evening, while over the oceans an early morning peak is observed. The harmonic analysis of hourly data reveals that the amplitude and variance are the largest over south peninsular India. The NEMR also exhibits significant intra-seasonal variability on a 20-40 day time scale. Analysis also shows significant northward propagation of the maximum cloud zone from south of equator to the south peninsula during the season. The NEMR exhibits large inter-annual variability with the co-efficient of variation (CV) of 25%. The positive phases of ENSO and the Indian Ocean Dipole (IOD) are conducive for normal to above normal rainfall activity during the northeast monsoon. There are multi-decadal variations in the statistical relationship between ENSO and the NEMR. During the period 2001-2010 the statistical relationship between ENSO and the NEMR has significantly weakened. The analysis of seasonal rainfall hindcasts for the period 1960-2005 produced by the state-of-the-art coupled climate models, ENSEMBLES, reveals that the coupled models have very poor skill in predicting the inter-annual variability of the NEMR. This is mainly due to the inability of the ENSEMBLES models to simulate the positive relationship between ENSO and the NEMR correctly. Copyright (C) 2012 Royal Meteorological Society