An approximately H-1-optimal Petrov-Galerkin meshfree method: application to computation of scattered light for optical tomography

Nearly pollution-free solutions of the Helmholtz equation for k-values corresponding to visible light are demonstrated and verified through experimentally measured forward scattered intensity from an optical fiber. Numerically accurate solutions are, in particular, obtained through a novel reformulation of the H-1 optimal Petrov-Galerkin weak form of the Helmholtz equation. Specifically, within a globally smooth polynomial reproducing framework, the compact and smooth test functions are so designed that their normal derivatives are zero everywhere on the local boundaries of their compact supports. This circumvents the need for a priori knowledge of the true solution on the support boundary and relieves the weak form of any jump boundary terms. For numerical demonstration of the above formulation, we used a multimode optical fiber in an index matching liquid as the object. The scattered intensity and its normal derivative are computed from the scattered field obtained by solving the Helmholtz equation, using the new formulation and the conventional finite element method. By comparing the results with the experimentally measured scattered intensity, the stability of the solution through the new formulation is demonstrated and its closeness to the experimental measurements verified.

Vertical uplift resistance of two closely spaced horizontal strip anchors embedded in cohesive-frictional weightless medium

The vertical uplift resistance of two closely spaced horizontal strip plate anchors has been investigated by using lower and upper bound theorems of the limit analysis in combination with finite elements and linear optimization. The interference effect on uplift resistance of the two anchors is evaluated in terms of a nondimensional efficiency factor (eta(c)). The variation of eta(c) with changes in the clear spacing (S) between the two anchors has been established for different combinations of embedment ratio (H/B) and angle of internal friction of the soil (phi). An interference of the anchors leads to a continuous reduction in uplift resistance with a decrease in spacing between the anchors. The uplift resistance becomes a minimum when the two anchors are placed next to each other without any gap. The critical spacing (S-cr) between the two anchors required to eliminate the interference effect increases with an increase in the values of both H/B and phi. The value of S-cr was found to lie approximately in the range 0.65B-1.5B with H/B = 1 and 11B-14B with H/B = 7 for phi varying from 0 degrees to 30 degrees.

Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Phase Evolution in the AuCu/Sn System by Solid-State Reactive Diffusion

The interfacial reactions between several Au(Cu) alloys and pure Sn were studied experimentally at 200A degrees C. Amounts of Cu in the AuSn4 and AuSn2 phases were as low as 1 at.%. On the basis of these experimental results there is no continuous solid solution between (Au,Cu)Sn and (Cu,Au)(6)Sn-5. The copper content of (Au,Cu)Sn was determined to be approximately 7-8 at.%. Substantial amounts of Au were present in the (Cu,Au)(6)Sn-5 and (Cu,Au)(3)Sn phases. Two ternary compounds were formed, one with stoichiometry varying from (Au40.5Cu39)Sn-20.5 to (Au20.2Cu59.3)Sn-20.5 (ternary ``B''), the other with the composition Au34Cu33Sn33 (ternary ``C''). The measured phase boundary compositions of the product phases are plotted on the available Au-Cu-Sn isotherm and the phase equilibria are discussed. The complexity and average thickness of the diffusion zone decreases with increasing Cu content except for the Au(40 at.%Cu) couple.

Non-polio enterovirus association with persistent diarrhea in children as revealed by a follow-up study of an Indian cohort during the first two years of life

Background: We recently reported significant association of non-polio enteroviruses (NPEVs) with acute diarrhea in children. Persistent diarrhea (PD) remains a major cause of morbidity and mortality in infants below two years of age in developing countries. Understanding age-dependent frequency and duration of NPEV infections is important to determine their association with persistent diarrhea and disease burden. Objectives: A cohort of 140 infants was followed for 6 months to 2 years of age to determine the frequency, duration, and association with PD of NPEV infections in comparison with rotavirus and other agents. Study design: Stool samples were collected every 14 days, and diarrheal episodes and their duration were recorded. Enteroviruses were characterized by RT-PCR and VP1 gene sequence analysis, rotavirus by electropherotyping, and other agents by PCR. Results: Of 4545 samples, negative for oral polio vaccine strains, 3907 (85.96%) and 638 (14.04%) were NPEV-negative and NPEV-positive, respectively, representing 403 (8.87%) infection episodes. About 68% of NPEV infections occurred during the first year with every child having at least one episode lasting between four days and four months. Approximately 38% and 22% of total diarrheal episodes were positive for NPEV and RV, respectively. While about 18% of NPEV infection episodes were associated with diarrhea, 6% being persistent, 13% of total diarrheal episodes were persistent involving infections by monotype NPEV strains or sequential infections by multiple strains and other agents. Conclusions: This is the first report revealing NPEVs as the single most frequently and persistently detected viral pathogen in every PD episode. (C) 2014 Elsevier B.V. All rights reserved.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Genetic diversity and proviral DNA load in different neural compartments of HIV-1 subtype C infection

In India, the low prevalence of HIV-associated dementia (HAD) in the Human immunodeficiency virus type 1 (HIV-1) subtype C infection is quite paradoxical given the high-rate of macrophage infiltration into the brain. Whether the direct viral burden in individual brain compartments could be associated with the variability of the neurologic manifestations is controversial. To understand this paradox, we examined the proviral DNA load in nine different brain regions and three different peripheral tissues derived from ten human subjects at autopsy. Using a highly sensitive TaqMan probe-based real-time PCR, we determined the proviral load in multiple samples processed in parallel from each site. Unlike previously published reports, the present analysis identified uniform proviral distribution among the brain compartments examined without preferential accumulation of the DNA in any one of them. The overall viral DNA burden in the brain tissues was very low, approximately 1 viral integration per 1000 cells or less. In a subset of the tissue samples tested, the HIV DNA mostly existed in a free unintegrated form. The V3-V5 envelope sequences, demonstrated a brain-specific compartmentalization in four of the ten subjects and a phylogenetic overlap between the neural and non-neural compartments in three other subjects. The envelope sequences phylogenetically belonged to subtype C and the majority of them were R5 tropic. To the best of our knowledge, the present study represents the first analysis of the proviral burden in subtype C postmortem human brain tissues. Future studies should determine the presence of the viral antigens, the viral transcripts, and the proviral DNA, in parallel, in different brain compartments to shed more light on the significance of the viral burden on neurologic consequences of HIV infection.

An approximation to the QoS aware throughput region of a tree network under IEEE 802.15.4 CSMA/CA with application to wireless sensor network design

In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.

Surface modification of mild steel by a self-assembled cetyl-trimethyl ammonium bromide (CTAB) monolayer: Evaluation of its corrosion protection property

The surface of mild steel was modified by generating cetyl-trimethyl ammonium bromide (CTAB) self-assembled monolayer (SAM) to enhance the corrosion resistance property. The experimental parameters (pH and time) for SAM generation were optimized. The modified surface was characterized by infrared reflection absorption spectroscopy (IRRAS) and contact angle measurements. The SAM generated in 1 mM solution of CTAB at pH 2.5 for 2 h showed a regimented monolayer. Polarization and electrochemical impedance spectroscopic (EIS) studies demonstrated a significant enhancement in the corrosion resistance property of the SAM protected steel in both 1 M HCl and 3.5% NaCl solution. The CTAB SAM surface substantially reduced the corrosion rate by approximately 4 times in 1 M HCl and 1.5 times in 3.5% NaCl media as compared to bare steel. Scanning electron microscopy images confirmed the formation of lesser amounts of corrosion products on the SAM protected surface. (C) 2015 Elsevier B.V. All rights reserved.

Immune responses against hepatitis C virus genotype 3a virus-like particles in mice: A novel VLP prime-adenovirus boost strategy

Chronic hepatitis C virus (HCV) infection represents a major health threat to global population. In India, approximately 15-20% of cases of chronic liver diseases are caused by HCV infection. Although, new drug treatments hold great promise for HCV eradication in infected individuals, the treatments are highly expensive. A vaccine for preventing or treating HCV infection would be of great value, particularly in developing countries. Several preclinical trials of virus-like particle (VLP) based vaccine strategies are in progress throughout the world. Previously, using baculovirus based system, we have reported the production of hepatitis C virus-like particles (HCV-LPs) encoding structural proteins for genotype 3a, which is prevalent in India. In the present study, we have generated HCV-LPs using adenovirus based system and tried different immunization strategies by using combinations of both kinds of HCV-LPs with other genotype 3a-based immunogens. HCV-LPs and peptides based ELISAs were used to evaluate antibody responses generated by these combinations. Cell-mediated immune responses were measured by using T-cell proliferation assay and intracellular cytokine staining. We observed that administration of recombinant adenoviruses expressing HCV structural proteins as final booster enhances both antibody as well as T-cell responses. Additionally, reduction of binding of VLP and JFH1 virus to human hepatocellular carcinoma cells demonstrated the presence of neutralizing antibodies in immunized sera. Taken together, our results suggest that the combined regimen of VLP followed by recombinant adenovirus could more effectively inhibit HCV infection, endorsing the novel vaccine strategy. (C) 2015 Elsevier Ltd. All rights reserved.