Porous membranes designed from bi-phasic polymeric blends containing silver decorated reduced graphene oxide synthesized via a facile one-pot approach

In this work, porous membranes were designed by selectively etching the PEO phase, by water, from a melt-mixed PE/PEO blend. The pure water flux and the resistance across the membrane were systematically evaluated by employing an indigenously developed cross flow membrane setup. Both the phase morphology and the cross sectional morphology of the membranes was assessed by scanning electron microscopy and an attempt was made to correlate the observed morphology with the membrane performance. In order to design antibacterial membranes for water purification, partially reduced graphene oxide (rGO), silver nanoparticles (Ag) and silver nanoparticles decorated with rGO (rGO-Ag) were synthesized and incorporated directly into the blends during melt mixing. The loss of viability of bacterial cells was determined by the colony counting method using E. coli as a model bacterium. SEM images display that the direct contact with the rGO-Ag nanoparticles disrupts the cell membrane. In addition, the rGO-Ag nanoparticles exhibited a synergistic effect with respect to bacterial cell viability in comparison to both rGO and Ag nanoparticles. The possible mechanism associated with the antibacterial activity in the membranes was discussed. This study opens new avenues in designing antibacterial membranes for water purification.

One-pot synthesis of a TiO2-CdS nano-heterostructure assembly with enhanced photocatalytic activity

An unprecedented morphology of a titanium dioxide (TiO2) and cadmium sulfide (CdS) self-assembly obtained using a `truly' one-pot and highly cost effective method with a multi-gram scale yield is reported here. The TiO2-CdS assembly, comprising of TiO2 and CdS nanoparticles residing next to each other homogeneously self-assembling into `woollen knitting ball' like microspheres, exhibited remarkable potential as a visible light photocatalyst with high recyclability.

A matrix model for QCD

Gribov's observation that global gauge fixing is impossible has led to suggestions that there may be a deep connection between gauge fixing and confinement. We find an unexpected relation between the topological nontriviality of the gauge bundle and colored states in SU(N) Yang-Mills theory, and show that such states are necessarily impure. We approximate QCD by a rectangular matrix model that captures the essential topological features of the gauge bundle, and demonstrate the impure nature of colored states explicitly. Our matrix model also allows the inclusion of the QCD theta-term, as well as to perform explicit computations of low-lying glueball masses. This mass spectrum is gapped. Since an impure state cannot evolve to a pure one by a unitary transformation, our result shows that the solution to the confinement problem in pure QCD is fundamentally quantum information-theoretic.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4 `)biphenylophane and first preparation of a microporous polymer network from a macrocyclic precursor by cyclotrimerization

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4') biphenylophane (MC) was achieved in high yield; its structure was verified by single crystal X-ray analysis. As a first example, a microporous polymer network was formed from macrocycle MC via acid-catalysed cyclotrimerization yielding a BET surface area of ca. 570 m(2) g(-1).

Oriented nanometric aggregates of partially inverted zinc ferrite: One-step processing and tunable high-frequency magnetic properties

In this work, it is demonstrated that the in situ growth of oriented nanometric aggregates of partially inverted zinc ferrite can potentially pave a way to alter and tune magnetocrystalline anisotropy that, in turn, dictates ferromagnetic resonance frequency (f(FMR)) by inducing strain due to aggregation. Furthermore, the influence of interparticle interaction on magnetic properties of the aggregates is investigated. Mono-dispersed zinc ferrite nanoparticles (<5 nm) with various degrees of aggregation were prepared through decomposition of metal-organic compounds of zinc (II) and iron (III) in an alcoholic solution under controlled microwave irradiation, below 200 degrees C. The nanocrystallites were found to possess high degree of inversion (>0.5). With increasing order of aggregation in the samples, saturation magnetization (at 5 K) is found to decrease from 38 emu/g to 24 emu/g, while coercivity is found to increase gradually by up to 100% (525 Oe to 1040 Oe). Anisotropy-mediated shift of f(FMR) has also been measured and discussed. In essence, the result exhibits an easy way to control the magnetic characteristics of nanocrystalline zinc ferrite, boosted with significant degree of inversion, at GHz frequencies. (C) 2015 AIP Publishing LLC.

Coding of relative size in monkey inferotemporal cortex

We seldom mistake a closer object as being larger, even though its retinal image is bigger. One underlying mechanism could be to calculate the size of the retinal image relative to that of another nearby object. Here we set out to investigate whether single neurons in the monkey inferotemporal cortex (IT) are sensitive to the relative size of parts in a display. Each neuron was tested on shapes containing two parts that could be conjoined or spatially separated. Each shape was presented in four versions created by combining the two parts at each of two possible sizes. In this design, neurons sensitive to the absolute size of parts would show the greatest response modulation when both parts are scaled up, whereas neurons encoding relative size would show similar responses. Our main findings are that 1) IT neurons responded similarly to all four versions of a shape, but tuning tended to be more consistent between versions with proportionately scaled parts; 2) in a subpopulation of cells, we observed interactions that resulted in similar responses to proportionately scaled parts; 3) these interactions developed together with sensitivity to absolute size for objects with conjoined parts but developed slightly later for objects with spatially separate parts. Taken together, our results demonstrate for the first time that there is a subpopulation of neurons in IT that encodes the relative size of parts in a display, forming a potential neural substrate for size constancy.

Maximum group velocity in a one-dimensional model with a sinusoidally varying staggered potential

We use Floquet theory to study the maximum value of the stroboscopic group velocity in a one-dimensional tight-binding model subjected to an on-site staggered potential varying sinusoidally in time. The results obtained by numerically diagonalizing the Floquet operator are analyzed using a variety of analytical schemes. In the low-frequency limit we use adiabatic theory, while in the high-frequency limit the Magnus expansion of the Floquet Hamiltonian turns out to be appropriate. When the magnitude of the staggered potential is much greater or much less than the hopping, we use degenerate Floquet perturbation theory; we find that dynamical localization occurs in the former case when the maximum group velocity vanishes. Finally, starting from an ``engineered'' initial state where the particles (taken to be hard-core bosons) are localized in one part of the chain, we demonstrate that the existence of a maximum stroboscopic group velocity manifests in a light-cone-like spreading of the particles in real space.

Lower bounds on Ricci flow invariant curvatures and geometric applications

We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.

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.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Rapid and facile one-step synthesis of LiTaO3 nanorods

Single crystalline LiTaO3 nanorods (length of 2.5-6 mu m and diameter of 200-500 nm) were synthesized via a facile molten-salt technique. An individual single crystalline nanorod exhibited a piezoelectric coefficient of 8 pm V-1. An improved optical frequency-doubling efficiency was observed in the case of LiTaO3 nanorods as compared to that of cubic crystallites of similar size.

A novel DNA intercalator, 8-methoxy pyrimido4 `,5 `:4,5]thieno (2,3-b)quinoline-4(3H)-one induces apoptosis in cancer cells, inhibits the tumor progression and enhances lifespan in mice with tumor

Polycyclic aromatic molecules such as ellipticine intercalate into double-stranded DNA and interfere with physiological functions. In the present study, we evaluate the chemotherapeutic potential of MPTQ on animal models and its mode of action. In order to test the antitumor activity, monohydrochloride of MPTQ was orally administered in mice bearing tumor. Results showed a significant inhibition of tumor growth compared to that of untreated controls. More importantly, mean lifespan of tumor bearing animals treated with MPTQ was significantly higher as compared to that of untreated tumor bearing mice suggesting that the treatment affected viability of cancerous cells, but not of normal cells. Consistent with this, we find that administration of MPTQ to normal mice did not cause any major side effects as observed upon hematological and serum profiling. We also found that MPTQ induces cytotoxicity in cancer cell lines, by activating apoptosis both by intrinsic and extrinsic pathways. Thus, MPTQ could be used as a potential cancer therapeutic agent. (c) 2011 Wiley Periodicals, Inc.

A Multiantigenic DNA Vaccine That Induces Broad Hepatitis C Virus-Specific T-Cell Responses in Mice

There are 3 to 4 million new hepatitis C virus (HCV) infections annually around the world, but no vaccine is available. Robust T-cell mediated responses are necessary for effective clearance of the virus, and DNA vaccines result in a cell-mediated bias. Adjuvants are often required for effective vaccination, but during natural lytic viral infections damage-associated molecular patterns (DAMPs) are released, which act as natural adjuvants. Hence, a vaccine that induces cell necrosis and releases DAMPs will result in cell-mediated immunity (CMI), similar to that resulting from natural lytic viral infection. We have generated a DNA vaccine with the ability to elicit strong CMI against the HCV nonstructural (NS) proteins (3, 4A, 4B, and 5B) by encoding a cytolytic protein, perforin (PRF), and the antigens on a single plasmid. We examined the efficacy of the vaccines in C57BL/6 mice, as determined by gamma interferon enzyme-linked immunosorbent spot assay, cell proliferation studies, and intracellular cytokine production. Initially, we showed that encoding the NS4A protein in a vaccine which encoded only NS3 reduced the immunogenicity of NS3, whereas including PRF increased NS3 immunogenicity. In contrast, the inclusion of NS4A increased the immunogenicity of the NS3, NS4B, andNS5B proteins, when encoded in a DNA vaccine that also encoded PRF. Finally, vaccines that also encoded PRF elicited similar levels of CMI against each protein after vaccination with DNA encoding NS3, NS4A, NS4B, and NS5B compared to mice vaccinated with DNA encoding only NS3 or NS4B/5B. Thus, we have developed a promising ``multiantigen'' vaccine that elicits robust CMI. IMPORTANCE Since their development, vaccines have reduced the global burden of disease. One strategy for vaccine development is to use commercially viable DNA technology, which has the potential to generate robust immune responses. Hepatitis C virus causes chronic liver infection and is a leading cause of liver cancer. To date, no vaccine is currently available, and treatment is costly and often results in side effects, limiting the number of patients who are treated. Despite recent advances in treatment, prevention remains the key to efficient control and elimination of this virus. Here, we describe a novel DNA vaccine against hepatitis C virus that is capable of inducing robust cell-mediated immune responses in mice and is a promising vaccine candidate for humans.

Outer Bounds on the Sum Rate of the K-User MIMO Gaussian Interference Channel

This paper derives outer bounds on the sum rate of the K-user MIMO Gaussian interference channel (GIC). Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). The relative performance of the bounds yields insight into the performance limits of multiuser MIMO GICs and the relative merits of different schemes for interference management. These insights are confirmed by establishing the optimality of the bounds in specific cases using an inner bound on the GDOF derived by the authors in a previous work. It is also shown that many of the existing results on the GDOF of the GIC can be obtained as special cases of the bounds, e. g., by setting K = 2 or the number of antennas at each user to 1.