Modeling of a reacting nanofilm on a composite substrate

This article provides a detailed computational analysis of the reaction of dense nanofilms and the heat transfer characteristics on a composite substrate. Although traditional energetic compounds based on organic materials have similar energy per unit weight, non-organic material in nanofilm configuration offers much higher energy density and higher flame speed. The reaction of a multilayer thin film of aluminum and copper oxide has been studied by varying the substrate material and thicknesses. The numerical analysis of the thermal transport of the reacting film deposited on the substrate combined a hybrid approach in which a traditional two-dimensional black box theory was used in conjunction with the sandwich model to estimate the appropriate heat flux on the substrate accounting for the heat loss to the surroundings. A procedure to estimate this heat flux using stoichiometric calculations is provided. This work highlights two important findings. One is that there is very little difference in the temperature profiles between a single substrate of silica and a composite substrate of silicon silica. Secondly, with increase in substrate thickness, the quenching effect is progressively diminished at a given speed. These findings show that the composite substrate is effective and that the average speed and quenching of flames depend on the thickness of the silica substrate, and can be controlled by a careful choice of the substrate configuration. (C) 2011 Elsevier Ltd. All rights reserved.

Amorphous, Monoclinic, and Tetragonal Porous Zirconia Through a Controlled Self-Sustained Combustion Route

Porous, large surface area, metastable zirconias, are of importance to catalytic, electrochemical, biological, and thermal insulation applications. Combustion synthesis is a very commonly used method for producing such zirconias. However, its rapid nature makes control difficult. A simple modification has been made to traditional solution combustion synthesis to address this problem. It involves the addition of starch to yield a starting mixture with a ``dough-like'' consistency. Just 5 wt% starch is seen to significantly alter the combustion characteristics of the ``dough.'' In particular, it helps to achieve better control over reaction zone temperature that is significantly lower than the one calculated by the adiabatic approximation typically used in self-propagating high-temperature synthesis. The effect of such control is demonstrated by the ability to tune dough composition to yield zirconias with different phase compositions from the relatively elusive ``amorphous'' to monoclinic (> 30 nm grain size) and tetragonal pure zirconia (< 30 nm grain size). The nature of this amorphous phase has been investigated using infrared spectroscopy. Starch content also helps tailor porosity in the final product. Zirconias with an average pore size of about 50 mu m and specific surface area as large as 110 m2/g have been obtained.

Role of feedback in mammalian vision: a new hypothesis and a computational model

This paper presents a novel hypothesis on the function of massive feedback pathways in mammalian visual systems. We propose that the cortical feature detectors compete not for the right to represent the output at a point, but for exclusive rights to abstract and represent part of the underlying input. Feedback can do this very naturally. A computational model that implements the above idea for the problem of line detection is presented and based on that we suggest a functional role for the thalamo-cortical loop during perception of lines. We show that the model successfully tackles the so called Cross problem. Based on some recent experimental results, we discuss the biological plausibility of our model. We also comment on the relevance of our hypothesis (on the role of feedback) to general sensory information processing and recognition. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

Gene Expression Profiling of Preovulatory Follicle in the Buffalo Cow: Effects of Increased IGF-I Concentration on Periovulatory Events

The preovulatory follicle in response to gonadotropin surge undergoes dramatic biochemical, and morphological changes orchestrated by expression changes in hundreds of genes. Employing well characterized bovine preovulatory follicle model, granulosa cells (GCs) and follicle wall were collected from the preovulatory follicle before, 1, 10 and 22 h post peak LH surge. Microarray analysis performed on GCs revealed that 450 and 111 genes were differentially expressed at 1 and 22 h post peak LH surge, respectively. For validation, qPCR and immunocytochemistry analyses were carried out for some of the differentially expressed genes. Expression analysis of many of these genes showed distinct expression patterns in GCs and the follicle wall. To study molecular functions and genetic networks, microarray data was analyzed using Ingenuity Pathway Analysis which revealed majority of the differentially expressed genes to cluster within processes like steroidogenesis, cell survival and cell differentiation. In the ovarian follicle, IGF-I is established to be an important regulator of the above mentioned molecular functions. Thus, further experiments were conducted to verify the effects of increased intrafollicular IGF-I levels on the expression of genes associated with the above mentioned processes. For this purpose, buffalo cows were administered with exogenous bGH to transiently increase circulating and intrafollicular concentrations of IGF-I. The results indicated that increased intrafollicular concentrations of IGF-I caused changes in expression of genes associated with steroidogenesis (StAR, SRF) and apoptosis (BCL-2, FKHR, PAWR). These results taken together suggest that onset of gonadotropin surge triggers activation of various biological pathways and that the effects of growth factors and peptides on gonadotropin actions could be examined during preovulatory follicle development.

Mossbauer study of La1-xCaxMn1-y (57)FeyO(3) with x = 0, 0.25; y=0.01

Temperature dependent Mossbauer measurements are done on the samples of La1- xCaxMn1-y (FeyO3)-Fe-57 with x=0 and 0.25, and y=0.01. With decreasing temperature, the specimen with x=0.25 shows a paramagnetic to ferromagnetic transition around 175 K. In the specimen x=0.0, the temperature dependence of both the center shift (delta) and the recoilless fraction (f) can be fitted very well with the Debye theory with a theta(D)=320+/-50 K. But for the specimens with x=0.25, f and delta show distinct deviations from the Debye behavior in the temperature range in which the resistivity shows a sharp decrease. Dips observed in both the f and delta around the transition temperature suggest that the Jahn-Teller distortion observed in these systems is dynamic in nature.

A convenient enantiospecific methodology for (-)-(1R,5S)-1,5-dimethylbicyclo[3.3.0]octa-2,7-dione: A formal total synthesis of (-)-ceratopicanol

An enantiospecific formal total synthesis of (-)-ceratopicanol starting from the readily and abundantly available monoterpene (R)-limonene is described. A combination of Claisen rearrangement-intramolecular diazo-ketone cyclopropanation-regiospecific reductive cyclopropane cleavage reactions are employed for the stereo- and regiospecific generation of the two vicinal ring junction quaternary carbon atoms.

Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, we outline an approach to the task of designing network codes in a non-multicast setting. Our approach makes use of the concept of interference alignment. As an example, we consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.