Probing hemoglobin confinement inside submicron silica tubes using synchrotron SAXS and electrochemical response

The configuration of hemoglobin in solution and confined inside silica nanotubes has been studied using synchrotron small angle X-ray scattering and electrochemical activity. Confinement inside submicron tubes of silica aid in preventing protein aggregation, which is vividly observed for unconfined protein in solution. The radius of gyration (R-g) and size polydispersity (p) of confined hemoglobin was found to be lower than that in solution. This was also recently demonstrated in case of confined hemoglobin inside layered polymer capsules. The confined hemoglobin displayed a higher thermal stability with Rg and p showing negligible changes in the temperature range 25-75 degrees C. The differences in configuration between the confined and unconfined protein were reflected in their electrochemical activity. Reversible electrochemical response (from cyclic voltammograms) obtained in case of the confined hemoglobin, in contrary to the observance of only a cathodic response for the unconfined protein, gave direct indication of the differences between the residences of the electroactive heme center in a different orientation compared to that in solution state. The confined Hb showed loss of reversibility only at higher temperatures. The electron transfer coefficient (alpha) and electron transfer rate constant (k(s)) were also different, providing additional evidence regarding structural differences between the unconfined and confined states of hemoglobin. Thus, absence of any adverse effects due to confinement of proteins inside the inorganic matrices such as silica nanotubes opens up new prospects for utilizing inorganic matrices as protein ``encapsulators'', as well as sensors at varying temperatures.

Warped alternatives to Froggatt-Nielsen models

We consider the Randall-Sundrum (RS) setup to be a theory of flavor, as an alternative to Froggatt-Nielsen models instead of as a solution to the hierarchy problem. The RS framework is modified by taking the low-energy brane to be at the grand unified theory (GUT) scale. This also alleviates constraints from flavor physics. Fermion masses and mixing angles are fit at the GUT scale. The ranges of the bulk mass parameters are determined using a chi(2) fit taking into consideration the variation in O(1) parameters. In the hadronic sector, the heavy top quark requires large bulk mass parameters localizing the right-handed top quark close to the IR brane. Two cases of neutrino masses are considered: (a) Planck scale lepton number violation and (b) Dirac neutrino masses. Contrary to the case of weak scale RS models, both these cases give reasonable fits to the data, with the Planck scale lepton number violation fitting slightly better compared to the Dirac case. In the supersymmetric version, the fits are not significantly different except for the variation in tan beta. If the Higgs superfields and the supersymmetry breaking spurion are localized on the same brane, then the structure of the sfermion masses are determined by the profiles of the zero modes of the hypermultiplets in the bulk. Trilinear terms have the same structure as the Yukawa matrices. The resultant squark spectrum is around similar to 2-3 TeV required by the light Higgs mass to be around 125 GeV and to satisfy the flavor violating constraints.

Quantum entropic ambiguities: Ethylene

In a quantum system, there may be many density matrices associated with a state on an algebra of observables. For each density matrix, one can compute its entropy. These are, in general, different. Therefore, one reaches the remarkable possibility that there may be many entropies for a given state R. Sorkin (private communication)]. This ambiguity in entropy can often be traced to a gauge symmetry emergent from the nontrivial topological character of the configuration space of the underlying system. It can also happen in finite-dimensional matrix models. In the present work, we discuss this entropy ambiguity and its consequences for an ethylene molecule. This is a very simple and well-known system, where these notions can be put to tests. Of particular interest in this discussion is the fact that the change of the density matrix with the corresponding entropy increase drives the system towards the maximally disordered state with maximum entropy, where Boltzman's formula applies. Besides its intrinsic conceptual interest, the simplicity of this model can serve as an introduction to a similar discussion of systems such as colored monopoles and the breaking of color symmetry.

Characterization of Birkhoff-James orthogonality

The Birkhoff-James orthogonality is a generalization of Hilbert space orthogonality to Banach spaces. We investigate this notion of orthogonality when the Banach space has more structures. We start by doing so for the Banach space of square matrices moving gradually to all bounded operators on any Hilbert space, then to an arbitrary C*-algebra and finally a Hilbert C*-module.

Reduced-complexity partial-interference-cancellation group decoder for STBCs

In this letter, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.

Frustration induced oscillator death on networks

An array of identical maps with Ising symmetry, with both positive and negative couplings, is studied. We divide the maps into two groups, with positive intra-group couplings and negative inter-group couplings. This leads to antisynchronization between the two groups which have the same stability properties as the synchronized state. Introducing a certain degree of randomness in signs of these couplings destabilizes the anti-synchronized state. Further increasing the randomness in signs of these couplings leads to oscillator death. This is essentially a frustration induced phenomenon. We explain the observed results using the theory of random matrices with nonzero mean. We briefly discuss applications to coupled differential equations. (C) 2013 AIP Publishing LLC.

Classification calibration dimension for general multiclass losses

We study consistency properties of surrogate loss functions for general multiclass classification problems, defined by a general loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficient conditions for a surrogate loss to be classification calibrated with respect to a loss matrix in this setting. We then introduce the notion of \emph{classification calibration dimension} of a multiclass loss matrix, which measures the smallest `size' of a prediction space for which it is possible to design a convex surrogate that is classification calibrated with respect to the loss matrix. We derive both upper and lower bounds on this quantity, and use these results to analyze various loss matrices. In particular, as one application, we provide a different route from the recent result of Duchi et al.\ (2010) for analyzing the difficulty of designing `low-dimensional' convex surrogates that are consistent with respect to pairwise subset ranking losses. We anticipate the classification calibration dimension may prove to be a useful tool in the study and design of surrogate losses for general multiclass learning problems.

Melting and solidification behavior of Pb-Sn embedded alloy nano-particles

Nano-sized bimetallic dispersoids consisting of (Pb) and beta-(Sn) phases of eutectic composition (Pb26.1Sn73.9) embedded in aluminum and Al-Cu-Fe quasicrystalline matrices have been prepared by rapid solidification processing. The two phases, face centered cubic (Pb) and body center tetragonal, beta-(Sn) solid solution co-exist in all the embedded nanoparticles at room temperature. The phases bear crystallographic orientation relationship with the matrix. In situ TEM study has been carried out for the alloy particles to study the melting and the solidification behavior. The detailed microscopic observations indicate formation of a single-phase metastable fcc (Pb) in the nano-particles prior to the melting during heating. Solidification of these particles begins with nucleation of fcc (Pb), which phase separates into fcc (Pb) and beta-(Sn) lamellae in the solid state. In situ X-ray diffraction study is carried out to obtain lattice parameter of metastable fcc (Pb) and thereby an estimate of amount of Sn dissolved in the metastable (Pb) prior to the melting. The results are discussed in terms of a metastable phase diagram between fcc Pb and fcc Sn and invoking the size effect on the metastable phase diagram. The size factor is found to play a critical role in deciding the pathway of phase transformation as well as the extension of solid solubility of Sn in fcc (Pb) in the nano-particles.

Eigen-profiles of spatio-temporal fragments for adaptive region-based tracking

We propose a novel space-time descriptor for region-based tracking which is very concise and efficient. The regions represented by covariance matrices within a temporal fragment, are used to estimate this space-time descriptor which we call the Eigenprofiles(EP). EP so obtained is used in estimating the Covariance Matrix of features over spatio-temporal fragments. The Second Order Statistics of spatio-temporal fragments form our target model which can be adapted for variations across the video. The model being concise also allows the use of multiple spatially overlapping fragments to represent the target. We demonstrate good tracking results on very challenging datasets, shot under insufficient illumination conditions.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Curvature based mobility analysis and form closure of smooth planar curves with multiple contacts

This paper presents a simple second-order, curvature based mobility analysis of planar curves in contact. The underlying theory deals with penetration and separation of curves with multiple contacts, based on relative configuration of osculating circles at points of contact for a second-order rotation about each point of the plane. Geometric and analytical treatment of mobility analysis is presented for generic as well as special contact geometries. For objects with a single contact, partitioning of the plane into four types of mobility regions has been shown. Using point based composition operations based on dual-number matrices, analysis has been extended to computationally handle multiple contacts scenario. A novel color coded directed line has been proposed to capture the contact scenario. Multiple contacts mobility is obtained through intersection of the mobility half-spaces. It is derived that mobility region comprises a pair of unbounded or a single bounded convex polygon. The theory has been used for analysis and synthesis of form closure configurations, revolute and prismatic kinematic pairs. (C) 2013 Elsevier Ltd. All rights reserved.

A finite element method for the Saint-Venant torsion and bending problems for prismatic beams

In this work, we present a finite element formulation for the Saint-Venant torsion and bending problems for prismatic beams. The torsion problem formulation is based on the warping function, and can handle multiply-connected regions (including thin-walled structures), compound and anisotropic bars. Similarly, the bending formulation, which is based on linearized elasticity theory, can handle multiply-connected domains including thin-walled sections. The torsional rigidity and shear centers can be found as special cases of these formulations. Numerical results are presented to show the good coarse-mesh accuracy of both the formulations for both the displacement and stress fields. The stiffness matrices and load vectors (which are similar to those for a variable body force in a conventional structural mechanics problem) in both formulations involve only domain integrals, which makes them simple to implement and computationally efficient. (C) 2014 Elsevier Ltd. All rights reserved.

THE KNICKKOPF DOMON DOMAIN IS ESSENTIAL FOR CUTICLE DIFFERENTIATION IN Drosophila melanogaster

The dopamine monoxygenase N-terminal (DOMON) domain is found in extracellular proteins across several eukaryotic and prokaryotic taxa. It has been proposed that this domain binds to heme or sugar moieties. Here, we have analyzed the role of four highly conserved amino acids in the DOMON domain of the Drosophila melanogaster Knickkopf protein that is inserted into the apical plasma membrane and assists extracellular chitin organization. In principal, we generated Knickkopf versions with exchanged residues tryptophan(299,) methionine(333), arginine(401), or histidine(437), and scored for the ability of the respective engineered protein to normalize the knickkopf mutant phenotype. Our results confirm the absolute necessity of tryptophan(299,) methionine(333), and histidine(437) for Knickkopf function and stability, the latter two being predicted to be critical for heme binding. In contrast, arginine(401) is required for full efficiency of Knickkopf activity. Taken together, our genetic data support the prediction of these residues to mediate the function of Knickkopf during cuticle differentiation in insects. Hence, the DOMON domain is apparently an essential factor contributing to the construction of polysaccharide-based extracellular matrices.

Automatic finite element formulation and assembly of hyperelastic higher order structural models

The formulation of higher order structural models and their discretization using the finite element method is difficult owing to their complexity, especially in the presence of non-linearities. In this work a new algorithm for automating the formulation and assembly of hyperelastic higher-order structural finite elements is developed. A hierarchic series of kinematic models is proposed for modeling structures with special geometries and the algorithm is formulated to automate the study of this class of higher order structural models. The algorithm developed in this work sidesteps the need for an explicit derivation of the governing equations for the individual kinematic modes. Using a novel procedure involving a nodal degree-of-freedom based automatic assembly algorithm, automatic differentiation and higher dimensional quadrature, the relevant finite element matrices are directly computed from the variational statement of elasticity and the higher order kinematic model. Another significant feature of the proposed algorithm is that natural boundary conditions are implicitly handled for arbitrary higher order kinematic models. The validity algorithm is illustrated with examples involving linear elasticity and hyperelasticity. (C) 2013 Elsevier Inc. All rights reserved.

Approximation of Spatio-Temporal Random Processes Using Tensor Decomposition

A new representation of spatio-temporal random processes is proposed in this work. In practical applications, such processes are used to model velocity fields, temperature distributions, response of vibrating systems, to name a few. Finding an efficient representation for any random process leads to encapsulation of information which makes it more convenient for a practical implementations, for instance, in a computational mechanics problem. For a single-parameter process such as spatial or temporal process, the eigenvalue decomposition of the covariance matrix leads to the well-known Karhunen-Loeve (KL) decomposition. However, for multiparameter processes such as a spatio-temporal process, the covariance function itself can be defined in multiple ways. Here the process is assumed to be measured at a finite set of spatial locations and a finite number of time instants. Then the spatial covariance matrix at different time instants are considered to define the covariance of the process. This set of square, symmetric, positive semi-definite matrices is then represented as a third-order tensor. A suitable decomposition of this tensor can identify the dominant components of the process, and these components are then used to define a closed-form representation of the process. The procedure is analogous to the KL decomposition for a single-parameter process, however, the decompositions and interpretations vary significantly. The tensor decompositions are successfully applied on (i) a heat conduction problem, (ii) a vibration problem, and (iii) a covariance function taken from the literature that was fitted to model a measured wind velocity data. It is observed that the proposed representation provides an efficient approximation to some processes. Furthermore, a comparison with KL decomposition showed that the proposed method is computationally cheaper than the KL, both in terms of computer memory and execution time.