Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs

A claw is an induced subgraph isomorphic to K-1,K-3. The claw-point is the point of degree 3 in a claw. A graph is called p-claw-free when no p-cycle has a claw-point on it. It is proved that for p greater than or equal to 4, p-claw-free graphs containing at least one chordless p-cycle are edge reconstructible. It is also proved that chordal graphs are edge reconstructible. These two results together imply the edge reconstructibility of claw-free graphs. A simple proof of vertex reconstructibility of P-4-reducible graphs is also presented. (C) 1995 John Wiley and Sons, Inc.

Treatment of electroplating effluent through emulsion-free liquid embrane

Separation of dissolved heavy metals such-as Cr(VI) and Cu(II) from electroplating effluents using a new technique of emulsion-free liquid membrane (EFLM) has been studied. Experimental results show that nearly 95% extraction is obtained resulting in stripping phase enrichment up to 50 times relative to feed. It is also found that emulsion-free liquid membranes are highly efficient and superior to other types of liquid membranes.

Uracil excision repair in Mycobacterium tuberculosis cell-free extracts

Uracil excision repair is ubiquitous in all domains of life and initiated by uracil DNA glycosylases (UDGs) which excise the promutagenic base, uracil, from DNA to leave behind an abasic site (AP-site). Repair of the resulting AP-sites requires an AP-endonuclease, a DNA polymerase, and a DNA ligase whose combined activities result in either short-patch or long-patch repair. Mycobacterium tuberculosis, the causative agent of tuberculosis, has an increased risk of accumulating uracils because of its G + C-rich genome, and its niche inside host macrophages where it is exposed to reactive nitrogen and oxygen species, two major causes of cytosine deamination (to uracil) in DNA. In vitro assays to study DNA repair in this important human pathogen are limited. To study uracil excision repair in mycobacteria, we have established assay conditions using cell-free extracts of M. tuberculosis and M. smegmatis (a fast-growing mycobacterium) and oligomer or plasmid DNA substrates. We show that in mycobacteria, uracil excision repair is completed primarily via long-patch repair. In addition, we show that M. tuberculosis UdgB, a newly characterized family 5 UDG, substitutes for the highly conserved family 1 UDG, Ung, thereby suggesting that UdgB might function as backup enzyme for uracil excision repair in mycobacteria. (C) 2011 Elsevier Ltd. All rights reserved.

Lasing in active, sub-mean-free path-sized systems with dense, random, weak scatterers

We report enhanced emission and gain narrowing in Rhodamine 590 perchlorate dye in an aqueous suspension of polystyrene microspheres. A systematic experimental study of the threshold condition for and the gain narrowing of the stimulated emission over a wide range of dye concentrations and scatterer number densities showed several interesting features, even though the transport mean free path far exceeded the system size. The conventional diffusive-reactive approximation to radiative transfer in an inhomogeneously illuminated random amplifying medium, which is valid for a transport mean-free path much smaller than the system size, is clearly inapplicable here. We propose a new probabilistic approach for the present case of dense, random, weak scatterers involving the otherwise rare and ignorable sub-mean-free-path scatterings, now made effective by the high gain in the medium, which is consistent: with experimentally observed features. (C) 1997 Optical Society of America.

Metal-billed and hollow carbon nanotubes obtained by the decomposition of metal-containing free precursor molecules

Vapor-phase pyrolysis of Fe(CO)(5) in the presence of another carbon source such as CO or Ca He yields iron-filled or hollow nanotubes depending on the relative concentration of the carbon source. Essentially single-walled nanotubes are obtained when the C6H6/Fe(CO)(5) ratio is high. Pyrolysis of metallocenes yields metal-filled nanotubes and hollow nanotubes are obtained when metallocenes are pyrolyzed along with benzene. Metal-decorated nanotubes are also obtained by this method.

Ultrafast Microwave-Assisted Route to Surfactant-Free Ultrafine Pt Nanoparticles on Graphene: Synergistic Co-reduction Mechanism and High Catalytic Activity

We demonstrate an ultrafast method for the formation of, graphene supported Pt catalysts by the co-reduction of graphene oxide and Pt salt using ethylene glycol under microwave irradiation conditions. Detailed analysis of the mechanism of formation of the hybrids indicates a synergistic co-reduction mechanism whereby the presence of the Pt ions leads to a faster reduction of GO and the presence of the defect sites on the reduced GO serves as anchor points for the heterogeneous nucleation of Pt. The resulting hybrid consists of ultrafine nanoparticles of Pt uniformly distributed on the reduced GO susbtrate. We have shown that the hybrid exhibits good catalytic activity for methanol oxidation and hydrogen conversion reactions. The mechanism is general and applicable for the synthesis of other multifunctional hybrids based on graphene.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Nonsimilar solutions for free convection in non-Newtonian fluids along a vertical plate in a porous medium

A nonsimilar boundary layer analysis is presented for the problem of free convection in power-law type non-Newtonian fluids along a permeable vertical plate with variable wall temperature or heat flux distribution. Numerical results are presented for the details of the velocity and temperature fields. A discussion is provided for the effect of viscosity index on the surface heat transfer rate.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

A template-free, combustion-chemical route to macroporous nickel monoliths displaying a hierarchy of pore sizes

Recently, we demonstrated a very general route to monolithic macroporous materials prepared without the use of templates (Rajamathi et al. J. Mater. Chem. 2001, 11, 2489). The route involves finding a precursor containing two metals, A and B, whose oxides are largely immiscible. Firing of the precursor followed by suitable sintering results in a monolith from which one of the oxide phases can be chemically leached out to yield a macroporous mass of the other oxide phase. The metals A and B that we employed in the demonstration were Ni and Zn. From the NiO-ZnO monolith that was obtained by decomposing the precursor, ZnO could be leached out at high pH to yield macroporous NiO. In the present work, we show that combustion-chemical (also called self-propagating) decomposition of a mixture of Ni and Zn nitrates with urea as a fuel yields an intimate mixture of the oxides that can be sintered and leached with alkali to form a macroporous NiO monolith. The new process that we present here thereby avoids the need for a crystalline single-source precursor. A novel and unanticipated aspect of the present work is that the combination of high temperatures and rapid quenching associated with combustion synthesis results in an intimate mixture of wurtzite ZnO and the metastable rock-salt Ni1-xZnxO where x is about 0.3. Leaching this monolith with alkali gives a macroporous mass of rock-salt Ni1-xZnxO, which upon reduction in H-2/Ar forms macroporous Ni and ZnO. There are thus two stages in the process that lead to two modes of pore formation. The first is associated with leaching of ZnO by alkali. The second is associated with the reduction of porous Ni1-xZnxO to give porous Ni and ZnO.

Artifact-free reconstruction from off-axis digital holograms through nonlinear filtering

We present experimental investigation of a new reconstruction method for off-axis digital holographic microscopy (DHM). This method effectively suppresses the object auto-correlation, commonly called the zero-order term, from holographic measurements, thereby suppressing the artifacts generated by the intensities of the two beams employed for interference from complex wavefield reconstruction. The algorithm is based on non-linear filtering, and can be applied to standard DHM setups, with realistic recording conditions. We study the applicability of the technique under different experimental configurations, such as topographic images of microscopic specimens or speckle holograms.

PRUNE and PROBE-two modular web services for protein-protein docking

The protein-protein docking programs typically perform four major tasks: (i) generation of docking poses, (ii) selecting a subset of poses, (iii) their structural refinement and (iv) scoring, ranking for the final assessment of the true quaternary structure. Although the tasks can be integrated or performed in a serial order, they are by nature modular, allowing an opportunity to substitute one algorithm with another. We have implemented two modular web services, (i) PRUNE: to select a subset of docking poses generated during sampling search (http://pallab.serc.iisc.ernet.in/prune) and (ii) PROBE: to refine, score and rank them (http://pallab.serc.iisc.ernet.in/probe). The former uses a new interface area based edge-scoring function to eliminate > 95% of the poses generated during docking search. In contrast to other multi-parameter-based screening functions, this single parameter based elimination reduces the computational time significantly, in addition to increasing the chances of selecting native-like models in the top rank list. The PROBE server performs ranking of pruned poses, after structure refinement and scoring using a regression model for geometric compatibility, and normalized interaction energy. While web-service similar to PROBE is infrequent, no web-service akin to PRUNE has been described before. Both the servers are publicly accessible and free for use.