Dual Drug Delivery Microcapsules via Layer-by-Layer Self-Assembly

The integration of hydrophobic and hydrophilic drugs in the polymer microcapsule offers the possibility of developing a new drug delivery system that combines the best features of these two distinct classes of material. Recently, we have reported the encapsulation of an uncharged water-insoluble drug in the polymer membrane. The hydrophobic drug is deposited using a layer-by-layer (LbL) technique, which is based on the sequential adsorption of oppositely charged polyelectrolytes onto a charged substrate. In this paper, we report the encapsulation of two different drugs, which are invariably different in structure and in their solubility in water. We have characterized these dual drug vehicular capsules by confocal laser scanning microscopy, atomic force microscopy, visible microscopy, and transmission electron microscopy. The growth of a thin film on a flat substrate by LbL was monitored by UV−vis spectra. The desorption kinetics of two drugs from the thin film was modeled by a second-order rate model.

(v, k, λ) Configurations and self-dual codes

The incidence matrix of a (v, k, λ) configuration is used to construct a (2v, v) and a (2v + 2, v + 1) self-dual code. If the incidence matrix is a circulant, the codes obtained are quasi-cyclic and extended quasi-cyclic, respectively. The weight distributions of some codes of this type are obtained.

Self-consistent theory of localization in weakly disordered systems

An analytic treatment of localization in a weakly disordered system is presented for the case where the real lattice is approximated by a Cayley tree. Contrary to a recent assertion we find that the mobility edge moves inwards into the band as disorder increases from zero.

Optical Barker sequences and self-orthogonal convolutional codes

The relation between optical Barker codes and self-orthogonal convolutional codes is pointed out. It is then used to update the results in earlier publication.

Self-image (autoidolon) techniques for the realisation of optical computing type operations

Abstract is not available.

Self-Assembly of a Pd-6-Molecular Double-Square and a Cu-3-Trigonalbipyramidal Cage via a New Tripodal Flexible Ligand

A new tripodal flexible ligand (L) containing pyrazolyl functionality has been prepared and successfully used to obtain a pd(6) (1) molecular double-square and a cu(3) trigonalbipyramidal cage (2), where complex 1 represents the first example of a double-square obtained using a flexible tripodal ligand.

Spontaneous and reversible self-assembly of a polypeptide fragment of insulin-like growth factor binding protein-2 into fluorescent nanotubular structures

In this communication, we report the spontaneous and reversible in vitro self-assembly of a polypeptide fragment derived from the C-terminal domain of Insulin-like Growth Factor Binding Protein (IGFBP-2) into soluble nanotubular structures several micrometres long via a mechanism involving inter-molecular disulfide bonds and exhibiting enhanced fluorescence.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Surface cathepsin B protects cytotoxic lymphocytes from self-destruction after degranulation.

The granule exocytosis cytotoxicity pathway is the major molecular mechanism for cytotoxic T lymphocyte (CTL) and natural killer (NK) cytotoxicity, but the question of how these cytotoxic lymphocytes avoid self-destruction after secreting perforin has remained unresolved. We show that CTL and NK cells die within a few hours if they are triggered to degranulate in the presence of nontoxic thiol cathepsin protease inhibitors. The potent activity of the impermeant, highly cathepsin B-specific membrane inhibitors CA074 and NS-196 strongly implicates extracellular cathepsin B. CTL suicide in the presence of cathepsin inhibitors requires the granule exocytosis cytotoxicity pathway, as it is normal with CTLs from gld mice, but does not occur in CTLs from perforin knockout mice. Flow cytometry shows that CTLs express low to undetectable levels of cathepsin B on their surface before degranulation, with a substantial rapid increase after T cell receptor triggering. Surface cathepsin B eluted from live CTL after degranulation by calcium chelation is the single chain processed form of active cathepsin B. Degranulated CTLs are surface biotinylated by the cathepsin B-specific affinity reagent NS-196, which exclusively labels immunoreactive cathepsin B. These experiments support a model in which granule-derived surface cathepsin B provides self-protection for degranulating cytotoxic lymphocytes.

High lithium storage in micrometre sized mesoporous spherical self-assembly of anatase titania nanospheres and carbon

Composite of anatase titania (TiO2) nanospheres and carbon grown and self-assembled into micron-sized mesoporous spheres via a solvothermal synthesis route are discussed here in the context of rechargeable lithium-ion battery. The morphology and carbon content and hence the electrochemical performance are observed to be significantly influenced by the synthesis parameters. Synthesis conditions resulting in a mesoporous arrangement of an optimized amount carbon and TiO2 exhibited the best lithium battery performance. The first discharge cycle capacity of carbon-titania mesoporous spheres (solvothermal reaction at 150 degrees C at 6 h, calcination at 500 degrees C under air, BET surface area 80 m(2)g(-1)) was 334 mAhg(-1) (approximately 1 Li) at current rate of 0.066 Ag-1. High storage capacity and good cyclability is attributed to the nanostructuring of TiO2 (mesoporosity) as well as due to formation of a percolation network of carbon around the TiO2 nanoparticles. The micron-sized mesoporous spheres of carbon-titania composite nanoparticles also show good rate cyclability in the range (0.066-6.67) Ag-1.

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.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

Evolutionary Significance of Self-acylation Property in Acyl Carrier Proteins

Acyl carrier protein is an integral component of many cellular metabolic processes. A number of studies have reported self-acylation behavior in acyl carrier proteins. Although AM exhibit high levels of similarity in their primary and tertiary structures, self-acylation behavior is restricted to only some ACPs that can be classified into two major families based on their function. The first family of ACPs is involved in polyketide biosynthesis, whereas the second family participates in fatty acid synthesis. Facilitated by the growing number of genome sequences available for analyses, large-scale phylogenetic studies were used in these studies to uncover as to how self-acylation behavior of acyl carrier proteins is linked with the evolution of metabolic pathways in organisms. These studies show that self-acylation behavior in acyl carrier proteins was lost during the course of evolution, with certain organisms and organelles viz. plastids, retaining it for specified functions. (C) 2009 IUBMB IUBMB Life, 61(8): 853-859, 2009