Dense network of O-H ... O and C-H ... O interactions in the solid state structure of n-pentyl-2-chloro-2-deoxy-alpha-D-manno-sept 3-uloside

Single crystal X-ray structural analysis of a septanoside, namely, n-pentyl-2-chloro-2-deoxy sept-3-uloside (1) provides many finer details of the molecular structure, in addition to its preferred twist-chair conformation, namely, (TC3,4)-T-5,6 conformation. Structural analysis reveals a dense network of O-H...O, C-H...O and van der Waals interactions that stabilize interdigitized, planar bi-layer structure of the crystal lattice. (C) 2014 Elsevier Ltd. All rights reserved.

A Stochastic Chemical Dynamic Approach to Correlate Autoimmunity and Optimal Vitamin-D Range

Motivated by several recent experimental observations that vitamin-D could interact with antigen presenting cells (APCs) and T-lymphocyte cells (T-cells) to promote and to regulate different stages of immune response, we developed a coarse grained but general kinetic model in an attempt to capture the role of vitamin-D in immunomodulatory responses. Our kinetic model, developed using the ideas of chemical network theory, leads to a system of nine coupled equations that we solve both by direct and by stochastic (Gillespie) methods. Both the analyses consistently provide detail information on the dependence of immune response to the variation of critical rate parameters. We find that although vitamin-D plays a negligible role in the initial immune response, it exerts a profound influence in the long term, especially in helping the system to achieve a new, stable steady state. The study explores the role of vitamin-D in preserving an observed bistability in the phase diagram (spanned by system parameters) of immune regulation, thus allowing the response to tolerate a wide range of pathogenic stimulation which could help in resisting autoimmune diseases. We also study how vitamin-D affects the time dependent population of dendritic cells that connect between innate and adaptive immune responses. Variations in dose dependent response of anti-inflammatory and pro-inflammatory T-cell populations to vitamin-D correlate well with recent experimental results. Our kinetic model allows for an estimation of the range of optimum level of vitamin-D required for smooth functioning of the immune system and for control of both hyper-regulation and inflammation. Most importantly, the present study reveals that an overdose or toxic level of vitamin-D or any steroid analogue could give rise to too large a tolerant response, leading to an inefficacy in adaptive immune function.

Efficient simulation of unitary operators by combining two numerical algorithms: An NMR simulation of the mirror-inversion propagator of an XY spin chain

Precise experimental implementation of unitary operators is one of the most important tasks for quantum information processing. Numerical optimization techniques are widely used to find optimized control fields to realize a desired unitary operator. However, finding high-fidelity control pulses to realize an arbitrary unitary operator in larger spin systems is still a difficult task. In this work, we demonstrate that a combination of the GRAPE algorithm, which is a numerical pulse optimization technique, and a unitary operator decomposition algorithm Ajoy et al., Phys. Rev. A 85, 030303 (2012)] can realize unitary operators with high experimental fidelity. This is illustrated by simulating the mirror-inversion propagator of an XY spin chain in a five-spin dipolar coupled nuclear spin system. Further, this simulation has been used to demonstrate the transfer of entangled states from one end of the spin chain to the other end.

Kinetics of phase separation in polymer mixtures: A molecular dynamics study

We present detailed results from a molecular dynamics (MD) simulation of phase-separation kinetics in polymer mixtures. Our MD simulations naturally incorporate hydrodynamic effects. We find that polymeric phase separation (with dynamically symmetric components) is in the same universality class as segregation of simple fluids: the degree of polymerization only slows down the segregation kinetics. For d = 2 polymeric fluids, the domain growth law is L(t) similar to t(phi) with phi showing a crossover from 1/3 -> 1/2 -> 2/3. For d = 3 polymeric fluids, we see the crossover phi = 1/3 -> 1. Our MD simulations do not yet access the inertial hydrodynamic regime (with L similar to t(2/3)) of phase separation in 3-d fluids. (C) 2014 AIP Publishing LLC.

A FUNCTIONAL MODEL FOR PURE Gamma-CONTRACTIONS

A pair of commuting operators (S,P) defined on a Hilbert space H for which the closed symmetrized bidisc Gamma = {(z(1) + z(2), z(1)z(2)) : vertical bar z(1)vertical bar <= 1, vertical bar z(2)vertical bar <= 1} subset of C-2 is a spectral set is called a Gamma-contraction in the literature. A Gamma-contraction (S, P) is said to be pure if P is a pure contraction, i.e., P*(n) -> 0 strongly as n -> infinity Here we construct a functional model and produce a set of unitary invariants for a pure Gamma-contraction. The key ingredient in these constructions is an operator, which is the unique solution of the operator equation S - S*P = DpXDp, where X is an element of B(D-p), and is called the fundamental operator of the Gamma-contraction (S, P). We also discuss some important properties of the fundamental operator.

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.

Analysis of cracked and un-cracked semicircular rings under symmetric loading

Edge cracked specimens have been widely utilized for fracture testing. Edge cracked semicircular disk (ECSD) specimen has now been well characterized with regard to its form factor and weight function. This paper presents a modified semicircular ring version of this specimen to enhance the form factor in general while retaining other desirable features. The efficacy of the modified design is proved by combining theory of elasticity solutions with finite element results to arrive at the optimum design geometry. New insights emerging from this work are used to theoretically re-examine the arch-tension and the four-point bend specimens. (C) 2014 Elsevier Ltd. All rights reserved.

Symmetric supercapacitor based on partially exfoliated and reduced graphite oxide in neutral aqueous electrolyte

The partially exfoliated and reduced graphite oxide (PE-RGO) is prepared by low temperature thermal exfoliation of graphite oxide under air atmosphere. A symmetric carbon/carbon supercapacitor is studied in a Na2SO4 aqueous electrolyte. The discharge capacitance is 92 F g(-1), when symmetric cell is cycled between the potential ranges from 0 to 1.6 V. This system demonstrates a stable charge/discharge cycle behavior up to 3000 cycles when the cell is operated at a voltage window of 1.6 V. The utilization ratio of potential window is 90% for this system is attributed to the more negative value of electrodes potential when the cell voltage is set to 0 V. The low-temperature exfoliation approach is convenient for mass production of graphenes at low cost and it can be used as electrode material for energy storage applications. (C) 2014 Elsevier Ltd. All rights reserved.

Capturability Analysis of a 3-D Retro-PN Guidance Law for Higher Speed Nonmaneuvering Targets

This brief presents the capturability analysis of a 3-D Retro-proportional navigation (Retro-PN) guidance law, which uses a negative navigation constant (as against the usual positive one), for intercepting targets having higher speeds than interceptors. This modification makes it possible to achieve collision conditions that were inaccessible to the standard PN law. A modified polar coordinate system, that makes the model more compact, is used in this brief for capturability analysis. In addition to the ratio of the target to interceptor speeds, the directional cosines of the interceptor, and target velocity vectors play a crucial role in the capturability. The existence of nontrivial capture zone of the Retro-PN guidance law and necessary and sufficient conditions, for capturing the target in finite time, are presented. A sufficient condition on the navigation constant is derived to ensure finiteness of the line-of-sight turn rate. The results are more extensive than those available for 2-D engagements, which can be obtained as special cases of this brief. Simulation results are given to support the analytical results.

PROPER HOLOMORPHIC MAPS BETWEEN BOUNDED SYMMETRIC DOMAINS REVISITED

We prove that a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the various special cases in which this result is known. We discuss an application of these methods to domains having noncompact automorphism groups that are not assumed to act transitively.

Medium-Voltage Drive for Induction Machine With Multilevel Dodecagonal Voltage Space Vectors With Symmetric Triangles

Multilevel inverters with dodecagonal (12-sided polygon) voltage space vector structure have advantages, such as complete elimination of fifth and seventh harmonics, reduction in electromagnetic interference, reduction in device voltage ratings, reduction of switching frequency, extension of linear modulation range, etc., making it a viable option for high-power medium-voltage drives. This paper proposes two power circuit topologies capable of generating multilevel dodecagonal voltage space vector structure with symmetric triangles (for the first time) with minimum number of dc-link power supplies and floating capacitor H-bridges. The first power topology is composed of two hybrid cascaded five-level inverters connected to either side of an open-end winding induction machine. Each inverter consists of a three-level neutral-point-clamped inverter, which is cascaded with an isolated H-bridge making it a five-level inverter. The second topology is for a normal induction motor. Both of these circuit topologies have inherent capacitor balancing for floating H-bridges for all modulation indexes, including transient operations. The proposed topologies do not require any precharging circuitry for startup. A simple pulsewidth modulation timing calculation method for space vector modulation is also presented in this paper. Due to the symmetric arrangement of congruent triangles within the voltage space vector structure, the timing computation requires only the sampled reference values and does not require any offline computation, lookup tables, or angle computation. Experimental results for steady-state operation and transient operation are also presented to validate the proposed concept.

Exact Phase Retrieval for a Class of 2-D Parametric Signals

We address the problem of two-dimensional (2-D) phase retrieval from magnitude of the Fourier spectrum. We consider 2-D signals that are characterized by first-order difference equations, which have a parametric representation in the Fourier domain. We show that, under appropriate stability conditions, such signals can be reconstructed uniquely from the Fourier transform magnitude. We formulate the phase retrieval problem as one of computing the parameters that uniquely determine the signal. We show that the problem can be solved by employing the annihilating filter method, particularly for the case when the parameters are distinct. For the more general case of the repeating parameters, the annihilating filter method is not applicable. We circumvent the problem by employing the algebraically coupled matrix pencil (ACMP) method. In the noiseless measurement setup, exact phase retrieval is possible. We also establish a link between the proposed analysis and 2-D cepstrum. In the noisy case, we derive Cramer-Rao lower bounds (CRLBs) on the estimates of the parameters and present Monte Carlo performance analysis as a function of the noise level. Comparisons with state-of-the-art techniques in terms of signal reconstruction accuracy show that the proposed technique outperforms the Fienup and relaxed averaged alternating reflections (RAAR) algorithms in the presence of noise.

Jacobi forms and differential operators

We affirmatively answer a question due to S. Bocherer concerning the feasibility of removing one differential operator from the standard collection of m + 1 of them used to embed the space of Jacobi forms of weight 2 and index m into several pieces of elliptic modular forms. (C) 2014 Elsevier Inc. All rights reserved.

Admissible fundamental operators(star)

Let F and G be two bounded operators on two Hilbert spaces. Let their numerical radii be no greater than one. This note investigates when there is a Gamma-contraction (S, P) such that F is the fundamental operator of (S, P) and G is the fundamental operator of (S*, P*). Theorem 1 puts a necessary condition on F and G for them to be the fundamental operators of (S, P) and (S*, P*) respectively. Theorem 2 shows that this necessary condition is also sufficient provided we restrict our attention to a certain special case. The general case is investigated in Theorem 3. Some of the results obtained for Gamma-contractions are then applied to tetrablock contractions to figure out when two pairs (F1, F2) and (G(1), G(2)) acting on two Hilbert spaces can be fundamental operators of a tetrablock contraction (A, B, P) and its adjoint (A*, B*, P*) respectively. This is the content of Theorem 3. (C) 2015 Elsevier Inc. All rights reserved.

3-D GPU Based Real Time Diffuse Optical Tomographic System

3-Dimensional Diffuse Optical Tomographic (3-D DOT) image reconstruction algorithm is computationally complex and requires excessive matrix computations and thus hampers reconstruction in real time. In this paper, we present near real time 3D DOT image reconstruction that is based on Broyden approach for updating Jacobian matrix. The Broyden method simplifies the algorithm by avoiding re-computation of the Jacobian matrix in each iteration. We have developed CPU and heterogeneous CPU/GPU code for 3D DOT image reconstruction in C and MatLab programming platform. We have used Compute Unified Device Architecture (CUDA) programming framework and CUDA linear algebra library (CULA) to utilize the massively parallel computational power of GPUs (NVIDIA Tesla K20c). The computation time achieved for C program based implementation for a CPU/GPU system for 3 planes measurement and FEM mesh size of 19172 tetrahedral elements is 806 milliseconds for an iteration.