PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language

Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Embodied energy assessment of building materials in India using process and input-output analysis

Growing demand for urban built spaces has resulted in unprecedented exponential rise in production and consumption of building materials in construction. Production of materials requires significant energy and contributes to pollution and green house gas (GHG) emissions. Efforts aimed at reducing energy consumption and pollution involved with the production of materials fundamentally requires their quantification. Embodied energy (EE) of building materials comprises the total energy expenditure involved in the material production including all upstream processes such as raw material extraction and transportation. The current paper deals with EE of a few common building materials consumed in bulk in Indian construction industry. These values have been assessed based on actual industrial survey data. Current studies on EE of building materials lack agreement primarily with regard to method of assessment and energy supply assumptions (whether expressed in terms of end use energy or primary energy). The current paper examines the suitability of two basic methods; process analysis and input-output method and identifies process analysis as appropriate for EE assessment in the Indian context. A comparison of EE values of building materials in terms of the two energy supply assumptions has also been carried out to investigate the associated discrepancy. The results revealed significant difference in EE of materials whose production involves significant electrical energy expenditure relative to thermal energy use. (C) 2014 Elsevier B.V. All rights reserved.

Relative entropy in higher spin holography

We examine relative entropy in the context of the higher spin/CFT duality. We consider 3D bulk configurations in higher spin gravity which are dual to the vacuum and a high temperature state of a CFT with W-algebra symmetries in the presence of a chemical potential for a higher spin current. The relative entropy between these states is then evaluated using the Wilson line functional for holographic entanglement entropy. In the limit of small entangling intervals, the relative entropy should vanish for a generic quantum system. We confirm this behavior by showing that the difference in the expectation values of the modular Hamiltonian between the states matches with the difference in the entanglement entropy in the short-distance regime. Additionally, we compute the relative entropy of states corresponding to smooth solutions in the SL(2, Z) family with respect to the vacuum.

A spectral element for wave propagation in honeycomb sandwich construction considering core flexibility

Spectral elements are found to be extremely resourceful to study the wave propagation characteristics of structures at high frequencies. Most of the aerospace structures use honeycomb sandwich constructions. The existing spectral elements use single layer theories for a sandwich construction wherein the two face sheets vibrate together and this model is sufficient for low frequency excitations. At high frequencies, the two face sheets vibrate independently. The Extended Higher order SAndwich Plate theory (EHSaPT) is suitable for representing the independent motion of the face sheets. A 1D spectral element based on EHSaPT is developed in this work. The wave number and the wave speed characteristics are obtained using the developed spectral element. It is shown that the developed spectral element is capable of representing independent wave motions of the face sheets. The propagation speeds of a high frequency modulated pulse in the face sheets and the core of a honeycomb sandwich are demonstrated. Responses of a typical honeycomb sandwich beam to high frequency shock loads are obtained using the developed spectral element and the response match very well with the finite element results. It is shown that the developed spectral element is able to represent the flexibility of the core resulting into independent wave motions in the face sheets, for which a finite element method needs huge degrees of freedom. (C) 2015 Elsevier Ltd. All rights reserved.

Coding of relative size in monkey inferotemporal cortex

We seldom mistake a closer object as being larger, even though its retinal image is bigger. One underlying mechanism could be to calculate the size of the retinal image relative to that of another nearby object. Here we set out to investigate whether single neurons in the monkey inferotemporal cortex (IT) are sensitive to the relative size of parts in a display. Each neuron was tested on shapes containing two parts that could be conjoined or spatially separated. Each shape was presented in four versions created by combining the two parts at each of two possible sizes. In this design, neurons sensitive to the absolute size of parts would show the greatest response modulation when both parts are scaled up, whereas neurons encoding relative size would show similar responses. Our main findings are that 1) IT neurons responded similarly to all four versions of a shape, but tuning tended to be more consistent between versions with proportionately scaled parts; 2) in a subpopulation of cells, we observed interactions that resulted in similar responses to proportionately scaled parts; 3) these interactions developed together with sensitivity to absolute size for objects with conjoined parts but developed slightly later for objects with spatially separate parts. Taken together, our results demonstrate for the first time that there is a subpopulation of neurons in IT that encodes the relative size of parts in a display, forming a potential neural substrate for size constancy.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Distribution, relative abundance, and conservation status of Asian elephants in Karnataka, southern India

Karnataka state in southern India supports a globally significant and the country's largest population of the Asian elephant Elephas maximus. A reliable map of Asian elephant distribution and measures of spatial variation in their abundance, both vital needs for conservation and management action, are unavailable not only in Karnataka, but across its global range. Here, we use various data gathered between 2000 and 2015 to map the distribution of elephants in Karnataka at the scale of the smallest forest management unit, the `beat', while also presenting data on elephant dung density for a subset of `elephant beats.' Elephants occurred in 972 out of 2855 forest beats of Karnataka. Sixty percent of these 972 beats and 55% of the forest habitat lay outside notified protected areas (PM), and included lands designated for agricultural production and human dwelling. While median elephant dung density inside protected areas was nearly thrice as much as outside, elephants routinely occurred in or used habitats outside PM where human density, land fraction under cultivation, and the interface between human-dominated areas and forests were greater. Based on our data, it is clear that India's framework for elephant conservation which legally protects the species wherever it occurs, but protects only some of its habitats while being appropriate in furthering their conservation within PM, seriously falters in situations where elephants reside in and/or seasonally use areas outside PAs. Attempts to further elephant conservation in production and dwelling areas have extracted high costs in human, elephant, material and monetary terms in Karnataka. In such settings, conservation planning exercises are necessary to determine where the needs of elephants or humans must take priority over the other, and to achieve that in a manner that is based not only on reliable scientific data but also on a process of public reasoning. (C) 2015 Elsevier Ltd. All rights reserved.

Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Minimization Problems Based on Relative alpha-Entropy II: Reverse Projection

In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted I-alpha) were studied. Such minimizers were called forward I-alpha-projections. Here, a complementary class of minimization problems leading to the so-called reverse I-alpha-projections are studied. Reverse I-alpha-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (alpha > 1) and in constrained compression settings (alpha < 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse I-alpha-projection into a forward I-alpha-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.

Relative stabilities of condensed face sharing mono- and di-carboranes: CB20H18 and C2B19H18+

The relative energies of triangular face sharing condensed macro polyhedral carboranes: CB20H18 and C2B19H18+ derived from mono- and di-substitution of carbons in (4) B21H18- is calculated at B3LYP/6-31G* level. The relative energies, H center dot center dot center dot H non-bonding distances, NICS values, topological charge analysis and orbital overlap compatibility connotes the face sharing condensed macro polyhedral mono-carboranes, 8 (4-CB20H18) to be the lowest energy isomer. The di-carba- derivative, (36) 4,4'a-C2B19H18+ with carbons substituted in a different B-12 cage in (4) B21H18- in anti-fashion is the most stable isomer among 28 possibilities. This structure has less non-bonding H center dot center dot center dot H interaction and is in agreement with orbital-overlap compatibility, and these two have the pivotal role in deciding the stability of these clusters. An estimate of the inherent stability of these carboranes is made using near-isodesmic equations which show that CB20H18 (8) is in the realm of the possible. (C) 2015 Elsevier B.V. All rights reserved.

Explicit and Unique Construction of Tetrablock Unitary Dilation in a Certain Case

Consider the domain E in defined by This is called the tetrablock. This paper constructs explicit boundary normal dilation for a triple (A, B, P) of commuting bounded operators which has as a spectral set. We show that the dilation is minimal and unique under a certain natural condition. As is well-known, uniqueness of minimal dilation usually does not hold good in several variables, e.g., Ando's dilation is known to be not unique, see Li and Timotin (J Funct Anal 154:1-16, 1998). However, in the case of the tetrablock, the third component of the dilation can be chosen in such a way as to ensure uniqueness.