On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Long range emission enhancement and anisotropy in coupled quantum dots induced by aligned gold nanoantenna

Quantum dot arrays have been projected as the material of choice for next generation displays and photodetectors. Extensive ongoing research aims at improving optical and electrical efficiencies of such devices. We report experimental results on non-local long range emission intensity enhancement and anisotropy in quantum dot assemblies induced by isolated and partially aligned gold nanoantennas. Spatially resolved photoluminescence clearly demonstrate that the effect is maximum, when the longitudinal surface plasmon resonance of the nanoantenna is resonant with the emission maxima of the quantum dots. We estimated the decay length of this enhancement to be similar to 2.6 mu m, which is considerably larger than the range of near field interaction of metal nanoantenna. Numerical simulations qualitatively capture the near field behavior of the nanorods but fail to match the experimentally observed non-local effects. We have suggested how strong interactions of quantum dots in the close packed assemblies, mediated by the nanoantennas, could lead to such observed behavior. (C) 2014 AIP Publishing LLC.

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.

Development of SnS quantum dot solar cells by SILAR method

SnS quantum dot solar cell is fabricated by Successive Ionic Layer Adsorption and Reaction (SILAR) method. SnS layer is optimized by different SILAR cycles of deposition. The particle size increased with the increase in number of SILAR cycles. Cu2S coated FTO is used as counter electrode against the conventional Platinum electrode. On comparison with a cell having a counter electrodeelectrolyte combination of Platinum-Iodine, Cu2S-polysulfide combination is found to improve both the short circuit current and fill factor of the solar cell. A maximum efficiency of 0.54% is obtained with an open circuit voltage of 311 mV and short circuit current density of 4.86 mA/cm. (C) 2014 Elsevier Ltd. All rights reserved.

Recent NMR Methodological Developments for Chiral Analysis in Isotropic Solutions

Chiral auxiliaries are used for NMR spectroscopic study of enantiomers. Often the presence of impurities, severe overlap of peaks, excessive line broadening and complex multiplicity pattern restricts the chiral analysis using 1D H-1 NMR spectrum. There are few approaches to resolve the overlapped peaks. One approach is to use suitable chiral auxiliary, which induces large chemical shift difference between the discriminated peaks (Delta delta(R,S)) and minimize the overlap. Another direction of approach is to design appropriate NMR experiments to circumvent some of these problems, viz, enhancing spectral resolution, unravelling the superimposed spectra of enantiomers, and reduction of spectral complexity. Large number of NMR techniques, such as two dimensional selective F-1 decoupling, RES-TOCSY, multiple quantum detection, frequency selective homodecoupling, band selective homodecoupling, broadband homodecoupling, etc. have been reported for such a purpose. Many of these techniques have aided in chiral analysis for molecules of diverse functionality in the presence of chiral auxiliaries. The present review summarizes the recently reported NMR experimental methodologies, with a special emphasis on the work carried out in authors' laboratory.

Carbon quantum dots as a macromolecular crowder

Fluorescent carbon quantum dots (CQD) induce macromolecular crowding making them suitable for probing the structure, function and dynamics of both hydrophilic and hydrophobic peptides/proteins under near in-cell conditions.

Logarithmic corrections to twisted indices from the quantum entropy function

We compute logarithmic corrections to the twisted index B-6(g) in four-dimensional N = 4 and N = 8 string theories using the framework of the Quantum Entropy Function. We find that these vanish, matching perfectly with the large-charge expansion of the corresponding microscopic expressions.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Nanorod to quantum dot conversion in ZnO dispersions with co-surfactants

A chemically-induced nanorod to quantum dot transition is reported in ZnO. This transition is achieved using co-surfactants in a marginally polar solvent in chimie douce (soft chemical) conditions. This is different from the physical instability driven transitions reported so far in metal nanowires and polymers. We propose a suitable mechanism for the observed phenomenon.

Efficient Solid-State Light-Emitting CuCdS Nanocrystals Synthesized in Air

Semiconductor nanocrystals (NCs) possess high photoluminescence (PL) typically in the solution phase. In contrary, PL rapidly quenches in the solid state. Efficient solid state luminescence can be achieved by inducing a large Stokes shift. Here we report on a novel synthesis of compositionally controlled CuCdS NCs in air avoiding the usual complexity of using inert atmosphere. These NCs show long-range color tunability over the entire visible range with a remarkable Stokes shift up to about 1.25eV. Overcoating the NCs leads to a high solid-state PL quantum yield (QY) of ca. 55% measured by using an integrating sphere. Unique charge carrier recombination mechanisms have been recognized from the NCs, which are correlated to the internal NC structure probed by using extended X-ray absorption fine structure (EXAFS) spectroscopy. EXAFS measurements show a Cu-rich surface and Cd-rich interior with 46% Cu-I being randomly distributed within 84% of the NC volume creating additional transition states for PL. Color-tunable solid-state luminescence remains stable in air enabling fabrication of light-emitting diodes (LEDs).

Structural, thermal and quantum chemical studies of p-coumaric and caffeic acids

Two hydroxycinnamic acids viz., p-coumaric, and caffeic acids have been extracted and purified from Parthenium hysterophorus, subsequently characterized by elemental analysis, FT-IR, NMR, single crystal X-ray crystallography. The optimized structures of these acids were calculated in terms of density functional theory by Gaussian 09. The validation of experimental and theoretically obtained data for structural parameters such as bond lengths and bond angles has have been carried out to analyze the statistical significance by curve fitting analysis and the values of correlation coefficient found to be 0.985, 0.992, and 0.984, 0.975 in p-coumaric, and caffeic acids, respectively. The calculated HOMO and LUMO energies show the eventual charge transfer interaction within the molecule. Thermal studies were also carried out by thermogravimetry (TG), differential thermogravimetric analysis (DTA), and derivative thermogravimetry (DTG). (C) 2014 Elsevier B.V. All rights reserved.

Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)

QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beamforming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR QRD) where we reduce the computational complexity of GR and exploit higher degree of parallelism. This low complexity Column-wise GR (CGR) can annihilate multiple elements of a column of a matrix simultaneously. The algorithm is first realized on a Two-Dimensional (2 D) systolic array and then implemented on REDEFINE which is a Coarse Grained run-time Reconfigurable Architecture (CGRA). We benchmark the proposed implementation against state-of-the-art implementations to report better throughput, convergence and scalability.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

Tailoring local density of optical states to control emission intensity and anisotropy of quantum dots in hybrid photonic-plasmonic templates

We report results of controlled tuning of the local density of states (LDOS) in versatile, flexible, and hierarchical self assembled plasmonic templates. Using 5 nm diameter gold (Au) spherical nanoantenna within a polymer template randomly dispersed with quantum dots, we show how the photoluminescence intensity and lifetime anisotropy of these dots can be significantly enhanced through LDOS tuning. Finite difference time domain simulations corroborate the experimental observations and extend the regime of enhancement to a wider range of geometric and spectral parameters bringing out the versatility of these functional plasmonic templates. It is also demonstrated how the templates act as plasmonic resonators for effectively engineer giant enhancement of the scattering efficiency of these nano antenna embedded in the templates. Our work provides an alternative method to achieve spontaneous emission intensity and anisotropy enhancement with true nanoscale plasmon resonators. (C) 2015 AIP Publishing LLC.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .