Direct Observation of Valley Hybridization and Universal Symmetry of Graphene with Mesoscopic Conductance Fluctuations

In graphene, the valleys represent spinlike quantities and can act as a physical resource in valley-based electronics to produce novel quantum computation schemes. Here we demonstrate a direct route to tune and read the valley quantum states of disordered graphene by measuring the mesoscopic conductance fluctuations. We show that the conductance fluctuations in graphene at low temperatures are reduced by a factor of 4 when valley triplet states are gapped in the presence of short-range potential scatterers at high carrier densities. We also show that this implies a gate tunable universal symmetry class that outlines a fundamental feature arising from graphene's unique crystal structure.

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

Orthogonal biofunctionalization of magnetic nanoparticles via ``clickable'' poly(ethylene glycol) silanes: a ``universal ligand'' strategy to design stealth and target-specific nanocarriers

The present work demonstrates a novel strategy to synthesize orthogonally bio-engineered magnetonanohybrids (MNPs) through the design of versatile, biocompatible linkers whose structure includes: (i) a robust anchor to bind with metal-oxide surfaces; (ii) tailored surface groups to act as spacers and (iii) a general method to implement orthogonal functionalizations of the substrate via ``click chemistry''. Ligands that possess the synthetic generality of features (i)-(iii) are categorized as ``universal ligands''. Herein, we report the synthesis of a novel, azido-terminated poly(ethylene glycol) (PEG) silane that can easily self-assemble on MNPs through hetero-condensation between surface hydroxyl groups and the silane end of the ligand, and simultaneously provide multiple clickable sites for high density, chemoselective bio-conjugation. To establish the universal-ligand-strategy, we clicked alkyl-functionalized folate onto the surface of PEGylated MNPs. By further integrating a near-infrared fluorescent (NIRF) marker (Alexa-Fluor 647) with MNPs, we demonstrated their folate-receptor mediated internalization inside cancer cells and subsequent translocation into lysosomes and mitochondria. Ex vivo NIRF imaging established that the azido-PEG-silane developed in course of the study can effectively reduce the sequestration of MNPs by macrophage organs (viz. liver and spleen). These folate-PEG-MNPs were not only stealth and noncytotoxic but their dual optical and magnetic properties aided in tracking their whereabouts through combined magnetic resonance and optical imaging. Together, these results provided a strong motivation for the future use of the ``universal ligand'' strategy towards development of ``smart'' nanohybrids for theragnostic applications.

Computing Reeb Graphs as a Union of Contour Trees

The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. This paper describes a fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds. The key idea in the proposed approach is to maximally leverage the efficient contour tree algorithm to compute the Reeb graph. The algorithm proceeds by dividing the input into a set of subvolumes that have loop-free Reeb graphs using the join tree of the scalar function and computes the Reeb graph by combining the contour trees of all the subvolumes. Since the key ingredient of this method is a series of union-find operations, the algorithm is fast in practice. Experimental results demonstrate that it outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input. The algorithm also extends to handle large data that do not fit in memory.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Analysing modifica-tions in the synthesis of multiple state mechanical devices using configuration space and topology graphs

Automated synthesis of mechanical designs is an important step towards the development of an intelligent CAD system. Research into methods for supporting conceptual design using automated synthesis has attracted much attention in the past decades. In our research, ten experimental studies are conducted to find out how designers synthesize solution concepts for multi-state mechanical devices. The designers are asked to think aloud, while carrying out the synthesis. These design synthesis processes are video recorded. It has been found that modification of kinematic pairs and mechanisms is the major activity carried out by all the designers. This paper presents an analysis of these synthesis processes using configuration space and topology graph to identify and classify the types of modifications that take place. Understanding of these modification processes and the context in which they happened is crucial to develop a system for supporting design synthesis of multiple state mechanical devices that is capable of creating a comprehensive variety of solution alternatives.

Nonparametric distributed sequential detection via universal source coding

We consider nonparametric or universal sequential hypothesis testing when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated from spectrum sensing in Cognitive Radios and intruder detection in wireless sensor networks. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. The algorithms are first proposed for discrete alphabet. Their performance and asymptotic properties are studied theoretically. Later these are extended to continuous alphabets. Their performance with two well known universal source codes, Lempel-Ziv code and KT-estimator with Arithmetic Encoder are compared. These algorithms are also compared with the tests using various other nonparametric estimators. Finally a decentralized version utilizing spatial diversity is also proposed and analysed.

Universal flame propagation behavior in packed bed of biomass

This article aims at seeking the universal behavior of propagation rate variation with air superficial velocity (V-s) in a packed bed of a range of biomass particles in reverse downdraft mode while also resolving the differing and conflicting explanations in the literature. Toward this, measurements are made of exit gas composition, gas phase and condensed phase surface temperature (T-g and T-s), and reaction zone thickness for a number of biomass with a range of properties. Based on these data, two regimes are identified: gasificationvolatile oxidation accompanied by char reduction reactions up to 16 +/- 1cm/s of V-s and above this, and char oxidationsimultaneous char oxidation and gas phase combustion. In the gasification regime, the measured T-s is less than T-g; a surface heat balance incorporating a diffusion controlled model for flaming combustion gives and matches with the experimental results to within 5%. In the char oxidation regime, T-g and T-s are nearly equal and match with the equilibrium temperature at that equivalence ratio. Drawing from a recent study of the authors, the ash layer over the oxidizing char particle is shown to play a critical role in regulating the radiation heat transfer to fresh biomass in this regime and is shown to be crucial in explaining the observed propagation behavior. A simple model based on radiation-convection balance that tracks the temperature-time evolution of a fresh biomass particle is shown to support the universal behavior of the experimental data on reaction front propagation rate from earlier literature and the present work for biomass with ash content up to 10% and moisture fraction up to 10%. Upstream radiant heat transfer from the ash-laden hot char modulated by the air flow is shown to be the dominant feature of this model.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Rainbow colouring of split and threshold Graphs

A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. A Chordal Graph is a graph in which every cycle of length more than 3 has a chord. A Split Graph is a chordal graph whose vertices can be partitioned into a clique and an independent set. A threshold graph is a split graph in which the neighbourhoods of the independent set vertices form a linear order under set inclusion. In this article, we show the following: 1. The problem of deciding whether a graph can be rainbow coloured using 3 colours remains NP-complete even when restricted to the class of split graphs. However, any split graph can be rainbow coloured in linear time using at most one more colour than the optimum. 2. For every integer k ≥ 3, the problem of deciding whether a graph can be rainbow coloured using k colours remains NP-complete even when restricted to the class of chordal graphs. 3. For every positive integer k, threshold graphs with rainbow connection number k can be characterised based on their degree sequence alone. Further, we can optimally rainbow colour a threshold graph in linear time.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Hardness results for computing optimal locally Gabriel graphs

Delaunay and Gabriel graphs are widely studied geo-metric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Lo-cally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Gener-alized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily in-cluded or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge max-imum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G= (V, E) is a valid LGG.

Extension of the universal erosive burning law to partly symmetric propellant grain geometries

This paper aims at extending the universal erosive burning law developed by two of the present authors from axi-symmetric internally burning grains to partly symmetric burning grains. This extension revolves around three dimensional flow calculations inside highly loaded grain geometry and benefiting from an observation that the flow gradients normal to the surface in such geometries have a smooth behavior along the perimeter of the grain. These are used to help identify the diameter that gives the same perimeter the characteristic dimension rather than a mean hydraulic diameter chosen earlier. The predictions of highly loaded grains from the newly chosen dimension in the erosive burning law show better comparison with measured pressure-time curves while those with mean hydraulic diameter definitely over-predict the pressures. (c) 2013 IAA. Published by Elsevier Ltd. All rights reserved.

Spectrum sensing via universal source coding

We consider nonparametric sequential hypothesis testing when the distribution under null hypothesis is fully known and the alternate hypothesis corresponds to some other unknown distribution. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. These algorithms are motivated from spectrum sensing application in Cognitive Radios. Universal sequential hypothesis testing using Lempel Ziv codes and Krichevsky-Trofimov estimator with Arithmetic Encoder are considered and compared for different distributions. Cooperative spectrum sensing with multiple Cognitive Radios using universal codes is also considered.

Bipartite Powers of k-chordal Graphs

Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, Van Bang Le, and Thomas Szymczak. Duchet- type theorems for powers of HHD- free graphs. Discrete Mathematics, 177(1- 3): 9- 16, 1997.] showed that if G m is k - chordal, then so is G(m+2). Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m - th bipartite power G(m]) of a bipartite graph G is the bipartite graph obtained from G by adding edges (u; v) where d G (u; v) is odd and less than or equal to m. Note that G(m]) = G(m+1]) for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G m], where k, m are positive integers with k >= 4