A novel variable resolution global spectral method on the sphere

A variable resolution global spectral method is created on the sphere using High resolution Tropical Belt Transformation (HTBT). HTBT belongs to a class of map called reparametrisation maps. HTBT parametrisation of the sphere generates a clustering of points in the entire tropical belt; the density of the grid point distribution decreases smoothly in the domain outside the tropics. This variable resolution method creates finer resolution in the tropics and coarser resolution at the poles. The use of FFT procedure and Gaussian quadrature for the spectral computations retains the numerical efficiency available with the standard global spectral method. Accuracy of the method for meteorological computations are demonstrated by solving Helmholtz equation and non-divergent barotropic vorticity equation on the sphere. (C) 2011 Elsevier Inc. All rights reserved.

Enhanced efficiency of tri-layered dye solar cells with hydrothermally synthesized titania nanotubes as light scattering outer layer

In the present study dye sensitized solar cells (DSSCs) have been fabricated with a tri-layer photo anode consisting of hydrothermally prepared titania nano tubes (TNT) having a diameter of 9-10 nm and length of several micrometers as outer layer, P25 TiO2 powder as transparent light absorbing middle layer and a compact TiO2 inner layer to improve the adhesion of different layers on a transparent conducting oxide coated substrate. In comparison to cells fabricated using TNTs or P25 alone, the tri-layer DSSCs exhibit an enhanced efficiency of 7.15% with a current density of 17.12 mA cm(-2) under AM 1.5 illumination. The enhancement is attributed to the light scattering generated by TNTs aggregates, reduction in electron transport resistance at the TiO2/dye/electrolyte interface and an improvement in electron life-time. (c) 2012 Elsevier B.V. All rights reserved.

Minimizing the complexity of fast sphere decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain a best ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Black hole formation in fuzzy sphere collapse

We study the collapse of a fuzzy sphere, that is a spherical membrane built out of D0-branes, in the Banks-Fischler-Shenker-Susskind model. At weak coupling, as the sphere shrinks, open strings are produced. If the initial radius is large then open string production is not important and the sphere behaves classically. At intermediate initial radius the backreaction from open string production is important but the fuzzy sphere retains its identity. At small initial radius the sphere collapses to form a black hole. The crossover between the later two regimes is smooth and occurs at the correspondence point of Horowitz and Polchinski.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.

Role of outer membrane exopolymers of Acidithiobacillus ferrooxidans in adsorption of cells onto pyrite and chalcopyrite

Bacterial surface polymers play a major role in the adhesion of bacterial cells to solid surfaces. Lipopolysaccharides (LPS) are essential constituents of the cell walls of almost all Gram-negative bacteria. This paper reports the results of the investigations on the role of outer membrane exopolymers (LPS) of the chemolithotroph, Acidithiobacillus ferrooxidans, in adsorption of the cells onto pyrite and chalcopyrite. Optimization of EDTA treatment for removal of LPS from cell surface and the surface characterization of EDTA-treated cells are outlined. There was no change in cell morphology or loss in cell motility upon treatment with upto 0.04 mM EDTA for 1 h. Partial removal of LPS by EDTA treatment resulted in reduced adsorption of the cells on both pyrite and chalcopyrite. The protein profile of the EDTA-extractable fraction showed presence of certain outer membrane proteins indicating that EDTA treatment results in temporary gaps in the outer membrane. Also, specificity towards pyrite compared to chalcopyrite that was exhibited by untreated cells was lost when their exopolymer layers were stripped off, which could be attributed to the role of outer membrane proteins in the mineral-specificity exhibited by the bacteria. (C) 2013 Elsevier B.V. All rights reserved.

Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the decoding complexity of a sphere decoder using a depth first search approach. Simulation results of the decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Formation of annular austenitic ring between outer ferrite layer and solid globule in a semi-solid processed SS 304L

The microstructure of an austenitic SS 304L rapidly quenched from its semi-solid state shows a unique annular austenitic ring in between the core of each globule and its ferritic outer layer. On the basis of experimental results and microstructural analysis, it is proposed that the ring is formed as a result of preferential austenitic phase nucleation in a small quantity of liquid entrapped between adjacent solid globules during rapid quenching, in spite of the fact that ferrite is the thermodynamically stable phase for the alloy. (C) 2014 Elsevier B.V. All rights reserved.

OFDM-Aided Differential Space-Time Shift Keying Using Iterative Soft Multiple-Symbol Differential Sphere Decoding

Soft-decision multiple-symbol differential sphere decoding (MSDSD) is proposed for orthogonal frequency-division multiplexing (OFDM)-aided differential space-time shift keying (DSTSK)-aided transmission over frequency-selective channels. Specifically, the DSTSK signaling blocks are generated by the channel-encoded source information and the space-time (ST) blocks are appropriately mapped to a number of OFDM subcarriers. After OFDM demodulation, the DSTSK signal is noncoherently detected by our soft-decision MSDSD detector. A novel soft-decision MSDSD detector is designed, and the associated decision rule is derived for the DSTSK scheme. Our simulation results demonstrate that an SNR reduction of 2 dB is achieved by the proposed scheme using an MSDSD window size of N-w = 4 over the conventional soft-decision-aided differential detection benchmarker, while communicating over dispersive channels and dispensing with channel estimation (CE).

Quantum entropy for the fuzzy sphere and its monopoles

Using generalized bosons, we construct the fuzzy sphere S-F(2) and monopoles on S-F(2) in a reducible representation of SU(2). The corresponding quantum states are naturally obtained using the GNS-construction. We show that there is an emergent nonabelian unitary gauge symmetry which is in the commutant of the algebra of observables. The quantum states are necessarily mixed and have non-vanishing von Neumann entropy, which increases monotonically under a bistochastic Markov map. The maximum value of the entropy has a simple relation to the degeneracy of the irreps that constitute the reducible representation that underlies the fuzzy sphere.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Sphere to ring morphological transformation in drying nanofluid droplets in a contact-free environment

Understanding the transients of buckling in drying colloidal suspensions is pivotal for producing new functional microstructures with tunable morphologies. Here, we report first observations and elucidate the buckling instability induced morphological transition (sphere to ring structure) in an acoustically levitated, heated nanosuspension droplet using dynamic energy balance. Droplet deformation featuring the formation of symmetric cavities is initiated by capillary pressure that is two to three orders of magnitude greater than the acoustic radiation pressure, thus indicating that the standing pressure field has no influence on the buckling front kinetics. With an increase in heat flux, the growth rate of surface cavities and their post-buckled volume increase while the buckling time period reduces, thereby altering the buckling pathway and resulting in distinct precipitate structures. However, irrespective of the heating rate, the volumetric droplet deformation exhibits a linear time dependence and the droplet vaporization is observed to deviate from the classical D-2-law.

Ni Nano-particle Encapsulated in Hollow Carbon Sphere Electrocatalyst in Polymer Electrolyte Membrane Water Electrolyzer

The present study evaluates the synthesis by solvo-thermal method and electrocatalytic activity of nickel nano-particles encapsulated in hollow carbon sphere, in hydrogen and oxygen evolution reaction in PEM water electrolyzer. The XRD patterns have ascertained the formation of nickel metal with different planes in face centered cubic (fcc) and hexagonal closed pack (hcp) form. SEM and TEM images have confirmed the nickel nano-particles with diameter of 10-50 nm inside the 0.2 mu m sized hollow carbon spheres. The BET surface area values gradually decreased with greater encapsulation of nickel; although the electrochemical active surface area (ECSA) values have been calculated as quite higher. It confirms the well dispersion of nickel in the materials and induces their electrocatalytic performance through the active surface sites. The cyclic voltammetric studies have evaluated hydrogen desorption peaks as five times more intense in nickel encapsulated materials, in comparison to the pure hollow carbon spheres. The anodic peak current density value has reached the highest level of 1.9 A cm(-2) for HCSNi10, which gradually decreases with lesser amount of nickel in the electrocatalysts. These electrocatalysts have been proved electrochemically stable during their usage for 48 h long duration under potentiostatic condition. (C) 2015 Elsevier Ltd. All rights reserved.

Outer Bounds on the Secrecy Rate of the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This paper derives outer bounds for the 2-user symmetric linear deterministic interference channel (SLDIC) with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. Five outer bounds are derived, under different assumptions of providing side information to receivers and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The usefulness of these outer bounds is shown by comparing the bounds with the inner bound on the achievable secrecy rate derived by the authors in a previous work. Also, the outer bounds help to establish that sharing random bits through the cooperative link can achieve the optimal rate in the very high interference regime.