Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

STM verification of the reduction of the Young's modulus of CdS nanoparticles at smaller sizes

We demonstrate the first STM evaluation of the Young's modulus (E) of nanoparticles (NPs) of different sizes. The sample deformation induced by tip-sample interaction has been determined using current-distance (I-Z) spectroscopy. As a result of tip-sample interaction, and the induced surface deformations, the I-z curves deviates from pure exponential dependence. Normally, in order to analyze the deformation quantitatively, the tip radius must be known. We show, that this necessity is eliminated by measuring the deformation on a substrate with a known Young's modulus (Au(111)) and estimating the tip radius, and afterwards, using the same tip (with a known radius) to measure the (unknown) Young's modulus of another sample (nanoparticles of CdS). The Young's modulus values found for 3 NP's samples of average diameters of 3.7, 6 and 7.5 nm, were E similar to 73%, 78% and 88% of the bulk value, respectively. These results are in a good agreement with the theoretically predicted reduction of the Young's modulus due to the changes in hydrostatic stresses which resulted from surface tension in nanoparticles with different sizes. Our calculation using third order elastic constants gives a reduction of E which scales linearly with 1/r (r is the NP's radius). This demonstrates the applicability of scanning tunneling spectroscopy for local mechanical characterization of nanoobjects. The method does not include a direct measurement of the tip-sample force but is rather based on the study of the relative elastic response. (C) 2014 Elsevier B.V. All rights reserved.

Adaptive evolution of a novel avian-origin influenza A/H7N9 virus

In China, the recent outbreak of novel influenza A/H7N9 virus has been assumed to be severe, and it may possibly turn brutal in the near future. In order to develop highly protective vaccines and drugs for the A/H7N9 virus, it is critical to find out the selection pressure of each amino acid site. In the present study, six different statistical methods consisting of four independent codon-based maximum likelihood (CML) methods, one hierarchical Bayesian (HB) method and one branch-site (BS) method, were employed to determine if each amino acid site of A/H7N9 virus is under natural selection pressure. Functions for both positively and negatively selected sites were inferred by annotating these sites with experimentally verified amino acid sites. Comprehensively, the single amino acid site 627 of PB2 protein was inferred as positively selected and it function was identified as a T-cell epitope (TCE). Among the 26 negatively selected amino acid sites of PB2, PB1, PA, HA, NP, NA, M1 and NS2 proteins, only 16 amino acid sites were identified to be involved in TCEs. In addition, 7 amino acid sites including, 608 and 609 of PA, 480 of NP, and 24, 25, 109 and 205 of M1, were identified to be involved in both B-cell epitopes (BCEs) and TCEs. Conversely, the function of positions 62 of PA, and, 43 and 113 of HA was unknown. In conclusion, the seven amino acid sites engaged in both BCEs and TCEs were identified as highly suitable targets, as these sites will be predicted to play a principal role in inducing strong humoral and cellular immune responses against A/H7N9 virus. (C) 2014 Elsevier Inc. All rights reserved.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

Rapid reduction of GO by hydrogen spill-over mechanism by in situ generated nanoparticles at room temperature and their catalytic performance towards 4-nitrophenol reduction and ethanol oxidation

Here, we report the clean and facile synthesis of Pt and Pd nanoparticles decorated on reduced graphene oxide (rGO) by the simultaneous reduction of graphene oxide (GO) and the metal ions in Mg/acid medium. As-generated Pt and Pd nanoparticles serve as a heterogeneous catalyst for the further reduction of the rGO by the hydrogen spill-over process. The C/O ratio is much higher as compared to the rGO obtained by the reduction of GO by only Mg/acid. Overall, the process is rapid, facile and green that does not require any toxic chemical agent or any rigorous chemical reactions. We perform the catalytic reduction of 4-nitophenol (4-NP) to 4-aminophenol (4-AP) at room temperature by Pd@rGO and Pt@rGO. The reduction is complete within 35 s for Pd@rGO and 60 s for Pt@rGO when 50 mu g of hybrid catalyst is used for 0.5 ml of 1 mM of 4-NP. In case of ethanol oxidation, the current density for Pd@rGO is comparable to commercial Pt/C but is doubled for Pt@rGO. Overall, both structures show highly stable catalytic activity compared to commercial Pt/C. (C) 2014 Elsevier B.V. All rights reserved.

Uninterrupted galvanic reaction for scalable and rapid synthesis of metallic and bimetallic sponges/dendrites as efficient catalysts for 4-nitrophenol reduction

Here, we demonstrate an uninterrupted galvanic replacement reaction (GRR) for the synthesis of metallic (Ag, Cu and Sn) and bimetallic (Cu M, M=Ag, Au, Pt and Pd) sponges/dendrites by sacrificing the low reduction potential metals (Mg in our case) in acidic medium. The acidic medium prevents the oxide formation on Mg surface and facilitates the uninterrupted reaction. The morphology of dendritic/spongy structures is controlled by the volume of acid used for this reaction. The growth mechanism of the spongy/dendritic microstructures is explained by diffusion-limited aggregate model (DLA), which is also largely affected by the volume of acid. The significance of this method is that the yield can be easily predicted, which is a major challenge for the commercialization of the products. Furthermore, the synthesis is complete in 1-2 minutes at room temperature. We show that the sponges/dendrites efficiently act as catalysts to reduce 4-nitrophenol (4-NP) to 4-aminophenol (4-AP) using NaBH4-a widely studied conversion process.

A smart approach to achieve an exceptionally high loading of metal nanoparticles supported by functionalized extended frameworks for efficient catalysis

The problem associated with metal nanoparticle (NP) agglomeration when trying to achieve a high loading amount has been solved by a new method of functionalization of MOFs' pores with terminal alkyne moieties. The alkynophilicity of the Au3+ ions has been utilized successfully for an exceptionally high loading (similar to 50 wt%) of Au-NPs on supported functionalized MOFs.

A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of O(n(2) log n) complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity O(n(4)) and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed. (C) 2014 Elsevier Inc. All rights reserved.

GBNV encoded movement protein (NSm) remodels ER network via C-terminal coiled coil domain

Plant viruses exploit the host machinery for targeting the viral genome-movement protein complex to plasmodesmata (PD). The mechanism by which the non-structural protein m (NSm) of Groundnut bud necrosis virus (GBNV) is targeted to PD was investigated using Agrobacterium mediated transient expression of NSm and its fusion proteins in Nicotiana benthamiana. GFP:NSm formed punctuate structures that colocalized with mCherry:plasmodesmata localized protein la (PDLP la) confirming that GBNV NSm localizes to PD. Unlike in other movement proteins, the C-terminal coiled coil domain of GBNV NSm was shown to be involved in the localization of NSm to PD, as deletion of this domain resulted in the cytoplasmic localization of NSm. Treatment with Brefeldin A demonstrated the role of ER in targeting GFP NSm to PD. Furthermore, mCherry:NSm co-localized with ER-GFP (endoplasmic reticulum targeting peptide (HDEL peptide fused with GFP). Co-expression of NSm with ER-GFP showed that the ER-network was transformed into vesicles indicating that NSm interacts with ER and remodels it. Mutations in the conserved hydrophobic region of NSm (residues 130-138) did not abolish the formation of vesicles. Additionally, the conserved prolines at positions 140 and 142 were found to be essential for targeting the vesicles to the cell membrane. Further, systematic deletion of amino acid residues from N- and C-terminus demonstrated that N-terminal 203 amino acids are dispensable for the vesicle formation. On the other hand, the C-terminal coiled coil domain when expressed alone could also form vesicles. These results suggest that GBNV NSm remodels the ER network by forming vesicles via its interaction through the C-terminal coiled coil domain. Interestingly, NSm interacts with NP in vitro and coexpression of these two proteins in planta resulted in the relocalization of NP to PD and this relocalization was abolished when the N-terminal unfolded region of NSm was deleted. Thus, the NSm interacts with NP via its N-terminal unfolded region and the NSm-NP complex could in turn interact with the ER membrane via the C-terminal coiled coil domain of NSm to form vesicles that are targeted to PD and there by assist the cell to cell movement of the viral genome complex. (C) 2015 Elsevier Inc. All rights reserved.

Effect of processing route on phase stability in equiatomic multicomponent Ti20Fe20Ni20Co20Cu20 high entropy alloy

The evolution of microstructure and phase formation in equiatomic Ti20Fe20Ni20Co20Cu20 high entropy alloy synthesised by conventional arc melting followed with suction casting and ball milling with spark plasma sintering route is distinctly different. The cast microstructure exhibits one body centre cubic and two face centre cubic high entropy phases based on titanium, cobalt and copper respectively along with a eutectic containing Ti2Ni type Laves phase. On the contrary, spinodal decomposed microstructure consisting of cobalt and copper solid solution is obtained in the sintered sample. However, long term annealing of cast sample at 950 degrees C reveals a eutectoid transformation with different phases than the cast sample. The aforementioned observations are discussed using CALPHAD thermodynamical approach and available literature.

Coupled Mechanisms of Precipitation and Atomization in Burning Nanofluid Fuel Droplets

Understanding the combustion characteristics of fuel droplets laden with energetic nanoparticles (NP) is pivotal for lowering ignition delay, reducing pollutant emissions and increasing the combustion efficiency in next generation combustors. In this study, first we elucidate the feedback coupling between two key interacting mechanisms, namely, secondary atomization and particle agglomeration; that govern the effective mass fraction of NPs within the droplet. Second, we show how the initial NP concentration modulates their relative dominance leading to a masterslave configuration. Secondary atomization of novel nanofuels is a crucial process since it enables an effective transport of dispersed NPs to the flame (a pre-requisite condition for NPs to burn). Contrarily, NP agglomeration at the droplet surface leads to shell formation thereby retaining NPs inside the droplet. In particular, we show that at dense concentrations shell formation (master process) dominates over secondary atomization (slave) while at dilute particle loading it is the high frequency bubble ejections (master) that disrupt shell formation (slave) through its rupture and continuous outflux of NPs. This results in distinct combustion residues at dilute and dense concentrations, thereby providing a method of manufacturing flame synthesized microstructures with distinct morphologies.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that the number of hops in the path from each sensor to its BS is bounded by h(max), and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios.