Catalytic oxidative polymerization of 1,1-diphenylethylene at ambient temperature and potential application of peroxide macroinitiator

The Co(II)TPP(Py) complex was used as an efficient dioxygen carrier for the radical polymerization of 1,1-diphenylethylene (DPE), which has a low ceiling temperature, at ambient temperature and low oxygen pressure. The mechanism of polymerization is discussed' on the basis of kinetic data, W-vis, ESR, and H-1 NMR studies. The rate of polymerization (RP) and number-average molecular weights (M) of poly(1,1-diphenylethylene peroxide) (PDPEP) are higher and the polydispersity is lower than in 2,2'-azobis(isobutyronitrile) (AIBN) initiated polymerization. PDPEP was further. used as a macroinitiator for the polymerization of MMA. The polymerization obeys classical kinetics. The K-2 value of the PDPEP has been determined from the slope of R-P(2) VS [M](2)[I], which reveals that it can also be used at higher temperature for the polymerization. An "active" PMMA was also synthesized, containing initiating segments in the polymer backbone.

Training and Voids in Receive Antenna Subset Selection in Time-Varying Channels

Receive antenna selection (AS) provides many benefits of multiple-antenna systems at drastically reduced hardware costs. In it, the receiver connects a dynamically selected subset of N available antennas to the L available RF chains. Due to the nature of AS, the channel estimates at different antennas, which are required to determine the best subset for data reception, are obtained from different transmissions of the pilot sequence. Consequently, they are outdated by different amounts in a time-varying channel. We show that a linear weighting of the estimates is necessary and optimum for the subset selection process, where the weights are related to the temporal correlation of the channel variations. When L is not an integer divisor of N , we highlight a new issue of ``training voids'', in which the last pilot transmission is not fully exploited by the receiver. We then present new ``void-filling'' methods that exploit these voids and greatly improve the performance of AS. The optimal subset selection rules with void-filling, in which different antennas turn out to have different numbers of estimates, are also explicitly characterized. Closed-form equations for the symbol error probability with and without void-filling are also developed.

Continuous-time Single Network Adaptive Critic for Regulator Design of Nonlinear Control Affine Systems

An optimal control law for a general nonlinear system can be obtained by solving Hamilton-Jacobi-Bellman equation. However, it is difficult to obtain an analytical solution of this equation even for a moderately complex system. In this paper, we propose a continuoustime single network adaptive critic scheme for nonlinear control affine systems where the optimal cost-to-go function is approximated using a parametric positive semi-definite function. Unlike earlier approaches, a continuous-time weight update law is derived from the HJB equation. The stability of the system is analysed during the evolution of weights using Lyapunov theory. The effectiveness of the scheme is demonstrated through simulation examples.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1

Antihyperlipidemic potential of Cedrus deodara extracts in monosodium glutamate induced obesity in neonatal rats

Objective: To study the antihyperlipidemic effect of Cedrus deodara (C. deodara) against monosodium glutamate (MSG) induced obesity in neonatal rats. Materials and Methods: The studies were carried out on newborn neonatal rats and were injected intraperitoneally with 2 mg/g of MSG on the 2(nd) and 4(th) postnatal days and 4 mg/g on 6(th), 8(th) and 10(th) postnatal days. Ethanolic extract (EE) and acetone extract (AE) of C. deodara was administered in a dose of 100 and 200 mg/kg, p.o./day at the age of 65 days. On day 60 of treatment, body weight, locomotor activity, body temperature, and various biochemical parameters like serum glucose, total cholesterol, triglyceride, and organs weights were recorded. Results: There was a significant reduction in body weight, organs and increased body temperature, locomotor activity after treatment with extracts. C. deodara decreased serum glucose, total cholesterol and triglyceride, low density lipoprotein (LDL) and very low density lipoprotein (VLDL) levels and increased high density lipoprotein (HDL) significantly has compared to MSG-control rats. Conclusion: C. deodara extracts exhibited antihyperlipidemic effect and it possesses anti-obesity properties in MSG induced obese rats.

Microscopic study of the 2/5 fractional quantum Hall edge

This paper reports on our study of the edge of the 2/5 fractional quantum Hall state, which is more complicated than the edge of the 1/3 state because of the presence of edge sectors corresponding to different partitions of composite fermions in the lowest two Lambda levels. The addition of an electron at the edge is a nonperturbative process and it is not a priori obvious in what manner the added electron distributes itself over these sectors. We show, from a microscopic calculation, that when an electron is added at the edge of the ground state in the [N(1), N(2)] sector, where N(1) and N(2) are the numbers of composite fermions in the lowest two Lambda levels, the resulting state lies in either [N(1) + 1, N(2)] or [N(1), N(2) + 1] sectors; adding an electron at the edge is thus equivalent to adding a composite fermion at the edge. The coupling to other sectors of the form [N(1) + 1 + k, N(2) - k], k integer, is negligible in the asymptotically low-energy limit. This study also allows a detailed comparison with the two-boson model of the 2/5 edge. We compute the spectral weights and find that while the individual spectral weights are complicated and nonuniversal, their sum is consistent with an effective two-boson description of the 2/5 edge.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Amphiphilic poly(meta-phenylene)s: A novel conjugated polysoap; A possible foldamer?

Novel amphiphilic poly(meta-phenylene)s were prepared by an oxidative coupling approach. These polymers were synthesized to shed light on their solution properties with special emphasis on aggregation and folding behavior. The polymers were characterized by NMR spectroscopy and molecular weights were determined by Gel Permeation Chromatography using Universal calibration. Literature studies revealed that the backbone of these PMPs can be helical moreover, the light emitting properties of this conjugated polymer can be used as a handle to study the possible aggregation or self-assembling behavior. In this report we show the synthesis, characterization and preliminary aggregation properties that points out that one of the synthesized PMP behave as a polysoap.

Smart polymer mediated purification and recovery of active proteins from inclusion bodies

Obtaining correctly folded proteins from inclusion bodies of recombinant proteins expressed in bacterial hosts requires solubilization with denaturants and a refolding step. Aggregation competes with the second step. Refolding of eight different proteins was carried out by precipitation with smart polymers. These proteins have different molecular weights, different number of disulfide bridges and some of these are known to be highly prone to aggregation. A high throughput refolding screen based upon fluorescence emission maximum around 340 nm (for correctly folded proteins) was developed to identify the suitable smart polymer. The proteins could be dissociated and recovered after the refolding step. The refolding could be scaled up and high refolding yields in the range of 8 mg L-1 (for CD4D12, the first two domains of human CD4) to 58 mg L-1 (for malETrx, thioredoxin fused with signal peptide of maltose binding protein) were obtained. Dynamic light scattering (DLS) showed that polymer if chosen correctly acted as a pseuclochaperonin and bound to the proteins. It also showed that the time for maximum binding was about 50 min which coincided with the time required for incubation (with the polymer) before precipitation for maximum recovery of folded proteins. The refolded proteins were characterized by fluorescence emission spectra, circular dichroism (CD) spectroscopy, melting temperature (T-m), and surface hydrophobicity measurement by ANS (8-anilinol-naphthalene sulfonic acid) fluorescence. Biological activity assay for thioredoxin and fluorescence based assay in case of maltose binding protein (MBP) were also carried out to confirm correct refolding. (C) 2012 Elsevier B.V. All rights reserved.

Human action recognition using a fast learning fully complex-valued classifier

In this paper, we use optical flow based complex-valued features extracted from video sequences to recognize human actions. The optical flow features between two image planes can be appropriately represented in the Complex plane. Therefore, we argue that motion information that is used to model the human actions should be represented as complex-valued features and propose a fast learning fully complex-valued neural classifier to solve the action recognition task. The classifier, termed as, ``fast learning fully complex-valued neural (FLFCN) classifier'' is a single hidden layer fully complex-valued neural network. The neurons in the hidden layer employ the fully complex-valued activation function of the type of a hyperbolic secant function. The parameters of the hidden layer are chosen randomly and the output weights are estimated as the minimum norm least square solution to a set of linear equations. The results indicate the superior performance of FLFCN classifier in recognizing the actions compared to real-valued support vector machines and other existing results in the literature. Complex valued representation of 2D motion and orthogonal decision boundaries boost the classification performance of FLFCN classifier. (c) 2012 Elsevier B.V. All rights reserved.

Low complexity adaptation for SISO channel shortening equalizers

Since the days of Digital Subscriber Links (DSL), time domain equalizers (TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation to the channel itself, and provide excellent approximations to the new TEQ weights. Adaptation methods for two existing Channel shortening algorithms are proposed and their performance over randomly varying, randomly perturbed channels is studied. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems. (C) 2012 Elsevier GmbH. All rights reserved.

Progressive structure-based alignment of homologous proteins: Adopting sequence comparison strategies

Comparison of multiple protein structures has a broad range of applications in the analysis of protein structure, function and evolution. Multiple structure alignment tools (MSTAs) are necessary to obtain a simultaneous comparison of a family of related folds. In this study, we have developed a method for multiple structure comparison largely based on sequence alignment techniques. A widely used Structural Alphabet named Protein Blocks (PBs) was used to transform the information on 3D protein backbone conformation as a ID sequence string. A progressive alignment strategy similar to CLUSTALW was adopted for multiple PB sequence alignment (mulPBA). Highly similar stretches identified by the pairwise alignments are given higher weights during the alignment. The residue equivalences from PB based alignments are used to obtain a three dimensional fit of the structures followed by an iterative refinement of the structural superposition. Systematic comparisons using benchmark datasets of MSTAs underlines that the alignment quality is better than MULTIPROT, MUSTANG and the alignments in HOMSTRAD, in more than 85% of the cases. Comparison with other rigid-body and flexible MSTAs also indicate that mulPBA alignments are superior to most of the rigid-body MSTAs and highly comparable to the flexible alignment methods. (C) 2012 Elsevier Masson SAS. All rights reserved.

A versatile resolving agent for diffusion edited separation of enantiomers, complex mixtures and constitutional isomers

The study is the first report of the utilization of a crown ether as a new and versatile resolving agent for the diffusion edited separation of enantiomers, complex mixtures and constitutional isomers. As a consequence of different binding affinities of enantiomers of a chiral molecule and individual components of the complex mixtures with the crown ether, the molecules diffuse at different rates. The enhanced separation achieved due to matrix assisted diffusion permitted their separation in the diffusion dimension. The generality and wide utility of the new resolving agent and the methodology are demonstrated on diverse examples, such as an organic chiral molecule, constitutional isomers and complex mixture of molecules possessing different functional groups that possess nearly identical molecular weights.

Anomalous structural and dynamical phase transitions of soft colloidal binary mixtures

We report microscopic structural and dynamical measurements on binary mixtures of homopolymers and polymer grafted nanoparticles at high densities in good solvent. We find strong and unexpected anomalies in the structure and dynamics of these binary mixtures, including appearance of spontaneous orientational alignment, as a function of added homopolymers of different molecular weights. Our experiments point to the possibility of exploiting the phase space in density and homopolymer size, of such hybrid systems, to create new materials with novel structural and physical properties.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.