HupB, a Nucleoid-Associated Protein of Mycobacterium tuberculosis, Is Modified by Serine/Threonine Protein Kinases In Vivo

HU, a widely conserved bacterial histone-like protein, regulates many genes, including those involved in stress response and virulence. Whereas ample data are available on HU-DNA communication, the knowledge on how HU perceives a signal and transmit it to DNA remains limited. In this study, we identify HupB, the HU homolog of the human pathogen Mycobacterium tuberculosis, as a component of serine/threonine protein kinase (STPK) signaling. HupB is extracted in its native state from the exponentially growing cells of M. tuberculosis H37Ra and is shown to be phosphorylated on both serine and threonine residues. The STPKs capable of modifying HupB are determined in vitro and the residues modified by the STPKs are identified for both in vivo and the in vitro proteins through mass spectrometry. Of the identified phosphosites, Thr(65) and Thr(74) in the DNA-embracing beta-strand of the N-terminal domain of HupB (N-HupB) are shown to be crucial for its interaction with DNA. In addition, Arg(55) is also identified as an important residue for N-HupB-DNA interaction. N-HupB is shown to have a diminished interaction with DNA after phosphorylation. Furthermore, hupB is shown to be maximally expressed during the stationary phase in M. tuberculosis H37Ra, while HupB kinases were found to be constitutively expressed (PknE and PknF) or most abundant during the exponential phase (PknB). In conclusion, HupB, a DNA-binding protein, with an ability to modulate chromatin structure is proposed to work in a growth-phase-dependent manner through its phosphorylation carried out by the mycobacterial STPKs.

Orthorhombic-tetragonal phase coexistence and enhanced piezo-response at room temperature in Zr, Sn, and Hf modified BaTiO3

The effect of Zr, Hf, and Sn in BaTiO3 has been investigated at close composition intervals in the dilute concentration limit. Detailed structural analysis by x-ray and neutron powder diffraction revealed that merely 2mol. % of Zr, Sn, and Hf stabilizes a coexistence of orthorhombic (Amm2) and tetragonal (P4mm) phases at room temperature. As a consequence, all the three systems show substantial enhancement in the longitudinal piezoelectric coefficient (d(33)), with Sn modification exhibiting the highest value similar to 425 pC/N. (C) 2014 AIP Publishing LLC.

Backbone-modified amphiphilic cyclic di- and tetrasaccharides

Synthesis of amphiphilic, cyclic di- and tetrasaccharides, which incorporate a methylene moiety at the inter-glycosidic bond, is reported. The amphiphilic properties of the new cyclic tetrasaccharide host were identified through assessing the solubilities of guests in aqueous and in organic solvents. The glycosidic bond stability of the cyclic tetrasaccharide under aqueous acidic condition was also verified.

Skip Decision and Reference Frame Selection for Low-Complexity H.264/AVC Surveillance Video Coding

H. 264/advanced video coding surveillance video encoders use the Skip mode specified by the standard to reduce bandwidth. They also use multiple frames as reference for motion-compensated prediction. In this paper, we propose two techniques to reduce the bandwidth and computational cost of static camera surveillance video encoders without affecting detection and recognition performance. A spatial sampler is proposed to sample pixels that are segmented using a Gaussian mixture model. Modified weight updates are derived for the parameters of the mixture model to reduce floating point computations. A storage pattern of the parameters in memory is also modified to improve cache performance. Skip selection is performed using the segmentation results of the sampled pixels. The second contribution is a low computational cost algorithm to choose the reference frames. The proposed reference frame selection algorithm reduces the cost of coding uncovered background regions. We also study the number of reference frames required to achieve good coding efficiency. Distortion over foreground pixels is measured to quantify the performance of the proposed techniques. Experimental results show bit rate savings of up to 94.5% over methods proposed in literature on video surveillance data sets. The proposed techniques also provide up to 74.5% reduction in compression complexity without increasing the distortion over the foreground regions in the video sequence.

Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography

We address the problem of reconstructing a sparse signal from its DFT magnitude. We refer to this problem as the sparse phase retrieval (SPR) problem, which finds applications in tomography, digital holography, electron microscopy, etc. We develop a Fienup-type iterative algorithm, referred to as the Max-K algorithm, to enforce sparsity and successively refine the estimate of phase. We show that the Max-K algorithm possesses Cauchy convergence properties under certain conditions, that is, the MSE of reconstruction does not increase with iterations. We also formulate the problem of SPR as a feasibility problem, where the goal is to find a signal that is sparse in a known basis and whose Fourier transform magnitude is consistent with the measurement. Subsequently, we interpret the Max-K algorithm as alternating projections onto the object-domain and measurement-domain constraint sets and generalize it to a parameterized relaxation, known as the relaxed averaged alternating reflections (RAAR) algorithm. On the application front, we work with measurements acquired using a frequency-domain optical-coherence tomography (FDOCT) experimental setup. Experimental results on measured data show that the proposed algorithms exhibit good reconstruction performance compared with the direct inversion technique, homomorphic technique, and the classical Fienup algorithm without sparsity constraint; specifically, the autocorrelation artifacts and background noise are suppressed to a significant extent. We also demonstrate that the RAAR algorithm offers a broader framework for FDOCT reconstruction, of which the direct inversion technique and the proposed Max-K algorithm become special instances corresponding to specific values of the relaxation parameter.

A simulation-based algorithm for optimal pricing policy under demand uncertainty

We propose a simulation-based algorithm for computing the optimal pricing policy for a product under uncertain demand dynamics. We consider a parameterized stochastic differential equation (SDE) model for the uncertain demand dynamics of the product over the planning horizon. In particular, we consider a dynamic model that is an extension of the Bass model. The performance of our algorithm is compared to that of a myopic pricing policy and is shown to give better results. Two significant advantages with our algorithm are as follows: (a) it does not require information on the system model parameters if the SDE system state is known via either a simulation device or real data, and (b) as it works efficiently even for high-dimensional parameters, it uses the efficient smoothed functional gradient estimator.

CuIn1-xAlxSe2 Solar Cells Fabricated on the Flexible Substrates by CoSputtering and Modified Selenization

CuIn1-xAlxSe2 (CIAS) thin films were grown on the flexible stainless steel substrates, by de co-sputtering from the elemental cathodes. CuInAl alloyed precursor films were selenized both by noble gas assisted Se vapor transport and vacuum evaporation of Se. X-ray diffraction, scanning electron microscopy and UV-visible absorption spectroscopy were used to characterize the selenized films The composition (x=Al/Al+In) with 0 <= x <= 0.65 was varied by substituting Al with indium in CuInSe2. Lattice parameters, average crystallite sizes and compact density of the films compared to CuInSe2, decreased and (112) peak shifted to higher Bragg's angle, with Al incorporation. Cells were fabricated with the device structure SS/Mo/CIAS/CdS/iZno-AZO/Al. Best cell showed the efficiency of 6.8%, with x=0.13, Eg=1.17 eV, fill factor 45.04, short circuit current density J 30 mA/cm(2).

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. 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. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Iminodiacetic acid functionalized polypyrrole modified electrode as Pb(II) sensor: Synthesis and DPASV studies

An electrochemical lead ion sensor has been developed by modification of carbon paste electrode (CPE) using polypyrrole functionalized with iminodiacetic acid (IDA-PPy) containing carboxyl group. The electrochemical response of Pb2+ ion on the IDA-PPy modified CPE has been evaluated and the controling parameters have been optimized using differential pulse anodic stripping voltammetry (DPASV). The IDA-PPy modified CPE shows a linear correlation for Pb2+ concentrations in the range of 1 x 10(-6) to 5 x 10(-9) M and the lower detection limit of Pb2+ has been found to be 9.6 x 10(-9) M concentration. Other tested metal ions, namely Cu2+, Cd2+, Co2+, Hg2+, Ni2+ and Zn2+, do not exhibit any voltammetric stripping response below 1 x 10(-7) M concentration. However, the Pb2+ response is affected in the presence of molar equivalents or higher concentrations of Cu2+, Cd2+ and Co2+ ions in binary systems with Pb2+, consequent to their ability to bind with iminodiacetic acid, while Hg2+, Ni2+ and Zn2+ do not interfere at all. A good correlation has been observed between the lead concentrations as analyzed by DPASV using IDA-PPy modified CPE and atomic absorption spectrophotometry for a lead containing industrial effluent sample. (C) 2014 Elsevier Ltd. All rights reserved.

Impact dynamics of high Weber number drops on chemically modified metallic surfaces

Hydrophobic/superhydrophobic metallic surfaces prepared via chemical treatment are encountered in many industrial scenarios involving the impingement of spray droplets. The effectiveness of such surfaces is understood through the analysis of droplet impact experiments. In the present study, three target surfaces with aluminum (Al-6061) as base material-acid-etched, Octadecyl Trichloro Silane (OTS) coated, and acid-etched plus OTS-coated-were prepared. Experiments on the impact of inertia dominated water drops on these chemically modified aluminum surfaces were carried out with the objective to highlight the effect of chemical treatment on the target surfaces on key sub-processes occurring in drop impact phenomenon. High speed videos of the entire drop impact dynamics were captured at three Weber number (We) conditions representative of high We (We > 200) regime. During the early stages of drop spreading, the drop impact resulted in ejection of secondary droplets from spreading drop front on the etched surfaces resembling prompt splash on rough surfaces whereas no such splashing was observable on untreated aluminum surface. Prominent development of undulations (fingers) were observed at the rim of drop spreading on the etched surfaces; between the etched surfaces the OTS-coated surface showed a subdued development of fingers than the uncoated surface. The impacted drops showed intense receding on OTS-coated surfaces whereas on the etched surface a highly irregular receding, with drop liquid sticking to the surface, was observed. Quantitative analyses were performed to reveal the effect of target surface characteristics on drop impact parameters such as temporal variation of spread factor of drop lamella, temporal variation of average finger length during spreading phase, maximum drop spreading, time taken to attain maximum spreading, sensitivity of maximum spreading to We, number of fingers at maximum spreading, and average receding velocity of drop lamella. Existing models for maximum drop spreading showed reasonably good agreement with the experimental measurements on the target surfaces except the acid-etched surface. (C) 2014 Elsevier B.V. All rights reserved.

Modified Adomian Decomposition Method for Van der Pol equations

In the paper, the well known Adomian Decomposition Method (ADM) is modified to solve the parabolic equations. The present method is quite different than the numerical method. The results are compared with the existing exact or analytical method. The already known existing Adomian Decomposition Method is modified to improve the accuracy and convergence. Thus, the modified method is named as Modified Adomian Decomposition Method (MADM). The Modified Adomian Decomposition Method results are found to converge very quickly and are more accurate compared to ADM and numerical methods. MADM is quite efficient and is practically well suited for use in these problems. Several examples are given to check the reliability of the present method. Modified Adomian Decomposition Method is a non-numerical method which can be adapted for solving parabolic equations. In the current paper, the principle of the decomposition method is described, and its advantages are shown in the form of parabolic equations. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/3.0/).

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

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.

Solving Dynamic Constraint Single Objective Functions using a Nature Inspired Technique

We present in this paper a new algorithm based on Particle Swarm Optimization (PSO) for solving Dynamic Single Objective Constrained Optimization (DCOP) problems. We have modified several different parameters of the original particle swarm optimization algorithm by introducing new types of particles for local search and to detect changes in the search space. The algorithm is tested with a known benchmark set and compare with the results with other contemporary works. We demonstrate the convergence properties by using convergence graphs and also the illustrate the changes in the current benchmark problems for more realistic correspondence to practical real world problems.

Antioxidant activity and electrochemical elucidation of the enigmatic redox behavior of curcumin and its structurally modified analogues

Here, we report studies on the antioxidant activity and redox behavior of curcumin and its structurally modified synthetic analogues. We have synthesized a number of analogues of curcumin which abrogate its keto-enol tautomerism or substitute the methylene group at the centre of its heptadione moiety implicated in the hydride transfer and studied their redox property. From cyclic voltammetric studies, it is demonstrated that H-atom transfer from CH2 group at the center of the heptadione link also plays an important role in the antioxidant properties of curcumin along with that of its phenolic -OH group. In addition, we also show that the conversion of 1, 3-dicarbonyl moiety of curcumin to an isosteric heterocycle as in pyrazole curcumin, which decreases its rotational freedom, leads to an improvement of its redox properties as well as its antioxidant activity. (C) 2014 Elsevier Ltd. All rights reserved.