Hydrophobic channels in crystals of an alpha-aminoisobutyric acid pentapeptide

The crystal structure of the pentapeptide p-toluene-sulfonyl-(α-aminoisobutyryl)5-methyl ester (Tosyl-(Aib)5-OMe) has been determined in the space group PImage . Pentapeptide molecules are folded in the 310 helical conformation and packed together, so as to yield a hydrophobic channel with a minimim diameter of 5.2 �. The channel contains crystallographically disordered material. This structure provides a model for channel formation by hydrophobic peptide aggregates and should prove useful in studies of alamethicin, suzukacillin and related Aib containing membrane channels. Triclinic (PImage ) crystals of the pentapeptide are obtained in the presence of LiClO4 in aqueous methanol, whereas crystallization from methanol alone yields crystals in the space group Pbca. The conformations of the peptide in the two crystal forms are very similar and only the molecular packing is dramatically different.

Relaxation Labeling with Learning Automata

Relaxation labeling processes are a class of mechanisms that solve the problem of assigning labels to objects in a manner that is consistent with respect to some domain-specific constraints. We reformulate this using the model of a team of learning automata interacting with an environment or a high-level critic that gives noisy responses as to the consistency of a tentative labeling selected by the automata. This results in an iterative linear algorithm that is itself probabilistic. Using an explicit definition of consistency we give a complete analysis of this probabilistic relaxation process using weak convergence results for stochastic algorithms. Our model can accommodate a range of uncertainties in the compatibility functions. We prove a local convergence result and show that the point of convergence depends both on the initial labeling and the constraints. The algorithm is implementable in a highly parallel fashion.

Multipliers of Sobolev spaces

Let Wm,p denote the Sobolev space of functions on Image n whose distributional derivatives of order up to m lie in Lp(Image n) for 1 less-than-or-equals, slant p less-than-or-equals, slant ∞. When 1 < p < ∞, it is known that the multipliers on Wm,p are the same as those on Lp. This result is true for p = 1 only if n = 1. For, we prove that the integrable distributions of order less-than-or-equals, slant1 whose first order derivatives are also integrable of order less-than-or-equals, slant1, belong to the class of multipliers on Wm,1 and there are such distributions which are not bounded measures. These distributions are also multipliers on Lp, for 1 < p < ∞. Moreover, they form exactly the multiplier space of a certain Segal algebra. We have also proved that the multipliers on Wm,l are necessarily integrable distributions of order less-than-or-equals, slant1 or less-than-or-equals, slant2 accordingly as m is odd or even. We have obtained the multipliers from L1(Image n) into Wm,p, 1 less-than-or-equals, slant p less-than-or-equals, slant ∞, and the multiplier space of Wm,1 is realised as a dual space of certain continuous functions on Image n which vanish at infinity.

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

Isotope shifts and hyperfine structure in the 555.8-nm S-1(0) -> P-3(1) line of Yb

We apply our technique of using a Rb-stabilized ring-cavity resonator to measure the frequencies of various spectral components in the 555.8-nm 1S0-->3P1 line of Yb. We determine the isotope shifts with 60 kHz precision, which is an order-of-magnitude improvement over the best previous measurement on this line. There are two overlapping transitions, 171Yb(1/2-->3/2) and 173Yb(5/2-->3/2), which we resolve by applying a magnetic field. We thus obtain the hyperfine constants in the 3P1 state of the odd isotopes with a significantly improved precision. Knowledge of isotope shifts and hyperfine structure should prove useful for high-precision calculations in Yb necessary to interpret ongoing experiments testing parity and time-reversal symmetry violation in the laws of physics.

Nanoindentation study on germania-doped silica glass preforms: evidence for the compaction-densification model of photosensitivity

Nanoindentation technique was employed to measure the changes in mechanical properties of a glass preform subjected to different levels of UV exposure. The results reveal that short-term exposure leads to an appreciable increase in the Young's modulus (E), suggesting the densification of the glass, confirming the compaction-densification model. However, on prolonged exposure, E decreases, which provides what we believe to be the first direct evidence of dilation in the glass leading into the Type IIA regime. The present results rule out the hypothesis that continued exposure leads to an irreversible compaction and prove that index modulation regimes are intrinsic to the glass matrix.

The Noether-Lefschetz theorem for the divisor class group

Let X be a normal projective threefold over a field of characteristic zero and vertical bar L vertical bar be a base-point free, ample linear system on X. Under suitable hypotheses on (X, vertical bar L vertical bar), we prove that for a very general member Y is an element of vertical bar L vertical bar, the restriction map on divisor class groups Cl(X) -> Cl(Y) is an isomorphism. In particular, we are able to recover the classical Noether-Lefschetz theorem, that a very general hypersurface X subset of P-C(3) of degree >= 4 has Pic(X) congruent to Z.

A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces

Learning automata are adaptive decision making devices that are found useful in a variety of machine learning and pattern recognition applications. Although most learning automata methods deal with the case of finitely many actions for the automaton, there are also models of continuous-action-set learning automata (CALA). A team of such CALA can be useful in stochastic optimization problems where one has access only to noise-corrupted values of the objective function. In this paper, we present a novel formulation for noise-tolerant learning of linear classifiers using a CALA team. We consider the general case of nonuniform noise, where the probability that the class label of an example is wrong may be a function of the feature vector of the example. The objective is to learn the underlying separating hyperplane given only such noisy examples. We present an algorithm employing a team of CALA and prove, under some conditions on the class conditional densities, that the algorithm achieves noise-tolerant learning as long as the probability of wrong label for any example is less than 0.5. We also present some empirical results to illustrate the effectiveness of the algorithm.

Development and characterization of lysine based tripeptide analogues as inhibitors of Sir2 activity

Sirtuins are NAD(+) dependent deacetylases that modulate various essential cellular functions. Development of peptide based inhibitors of Sir2s would prove useful both as pharmaceutical agents and as effectors by which downstream cellular alterations can be monitored. Click chemistry that utilizes Huisgen's 1,3-dipolar cycloaddition permits attachment of novel modifications onto the side chain of lysine. Herein, we report the synthesis of peptide analogues prepared using click reactions on N epsilon-propargyloxycarbonyl protected lysine residues and their characterization as inhibitors of Plasmodium falciparum Sir2 activity. The peptide based inhibitors exhibited parabolic competitive inhibition with respect to acetylated-peptide substrate and parabolic non-competitive inhibition with NAD(+) supporting the formation of EI2 and E.NAD(+).I-2 complexes. Cross-competition inhibition analysis with the non-competitive inhibitor nicotinamide (NAM) ruled out the possibility of the NAM-binding site being the second inhibitor binding site, suggesting the presence of a unique alternate pocket commodating the inhibitor. One of these compounds was also found to be a potent inhibitor of the intraerythrocytic growth of P. falciparum with 50% inhibitory concentration in the micromolar range.

Dependence of pH and surfactant effect in the synthesis of magnetite(Fe3O4) nanoparticles and its properties

Nanoparticles of Fe3O4 were synthesized by co-precipitation in an aqueous solution containing ferrous and ferric salts (1:2) at varying pH with ammonia as a base. It was found that the value of pH influences the reaction mechanism for the formation of Fe3O4. Furthermore, the addition of mercaptoethanol significantly reduced the crystalline size of Fe3O4 nanoparticles from 15.03 to 8.02 nm. X-ray diffraction (XRD) spectra revealed that the synthesized nanoparticles were epsilon-Fe2O3 or Fe3O4 phase. To further prove the composition of the product, as-prepared Fe3O4 were examined by X-rayphotoelectron spectroscopy (XPS). Magnetic properties of the obtained particles were determined by vibrating sample magnetometer (VSM). Further analysis of the X-ray studies shows that while maintaining a pH value of 6 and 9 in a solution containing iron salts II and III ions produces epsilon-Fe2O3. Whereas a pH value of 11 produces magnetite (Fe3O4) phase. All of these results show that the pH has a major role in the observed phase formation of (Fe3O4) nanoparticles.

Singular value decomposition based computationally efficient algorithm for rapid dynamic near-infrared diffuse optical tomography

Purpose: A computationally efficient algorithm (linear iterative type) based on singular value decomposition (SVD) of the Jacobian has been developed that can be used in rapid dynamic near-infrared (NIR) diffuse optical tomography. Methods: Numerical and experimental studies have been conducted to prove the computational efficacy of this SVD-based algorithm over conventional optical image reconstruction algorithms. Results: These studies indicate that the performance of linear iterative algorithms in terms of contrast recovery (quantitation of optical images) is better compared to nonlinear iterative (conventional) algorithms, provided the initial guess is close to the actual solution. The nonlinear algorithms can provide better quality images compared to the linear iterative type algorithms. Moreover, the analytical and numerical equivalence of the SVD-based algorithm to linear iterative algorithms was also established as a part of this work. It is also demonstrated that the SVD-based image reconstruction typically requires O(NN2) operations per iteration, as contrasted with linear and nonlinear iterative methods that, respectively, requir O(NN3) and O(NN6) operations, with ``NN'' being the number of unknown parameters in the optical image reconstruction procedure. Conclusions: This SVD-based computationally efficient algorithm can make the integration of image reconstruction procedure with the data acquisition feasible, in turn making the rapid dynamic NIR tomography viable in the clinic to continuously monitor hemodynamic changes in the tissue pathophysiology.

Two-level k-means clustering algorithm for k-tau relationship establishment and linear-time classification

Partitional clustering algorithms, which partition the dataset into a pre-defined number of clusters, can be broadly classified into two types: algorithms which explicitly take the number of clusters as input and algorithms that take the expected size of a cluster as input. In this paper, we propose a variant of the k-means algorithm and prove that it is more efficient than standard k-means algorithms. An important contribution of this paper is the establishment of a relation between the number of clusters and the size of the clusters in a dataset through the analysis of our algorithm. We also demonstrate that the integration of this algorithm as a pre-processing step in classification algorithms reduces their running-time complexity.

Information Ambiguity

We propose a quantity called information ambiguity that plays the same role in the worst-case information-theoretic nalyses as the well-known notion of information entropy performs in the corresponding average-case analyses. We prove various properties of information ambiguity and illustrate its usefulness in performing the worst-case analysis of a variant of distributed source coding problem.

Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.