نتایج جستجو برای: liposome characterization

تعداد نتایج: 381014  

2006
E. YAZAR

In the current study, intracellular (neutrophil and monocyte) concentrations of free and liposome encapsulated ampicillin in sheep were investigated. Free ampicillin (5 mg/kg b.w.) and liposome encapsulated ampicillin (5 mg/kg b.w.) were administered as a bolus intravenous injection to sheep. After the injections, blood samples (5 ml) were collected into tubes from v. jugularis at 10, 30, 60 mi...

Journal: :International immunopharmacology 2012
Siddikuzzaman V M Berlin Grace

The purpose of this study was to investigate whether all trans retinoic acid (ATRA) incorporated in liposome composed of distearoylphosphatidylcholine (DSPC/cholesterol) could inhibit the metastatic lung cancer in mice more efficiently than free ATRA. Metastatic lung cancer model was developed by intravenous injection of B16F10 cells and it is also referred as melanoma model. In this present st...

2014
Hongbo Wang Jianqiao Zhang Guangyao Lv Jinbo Ma Pengkai Ma Guangying Du Zongliang Wang Jingwei Tian Weishuo Fang Fenghua Fu

Lx2-32c is a novel taxane that has been demonstrated to have robust antitumor activity against different types of tumors including several paclitaxel-resistant neoplasms. Since the delivery vehicles for taxane, which include cremophor EL, are all associated with severe toxic effects, liposome-based Lx2-32c has been developed. In the present study, the pharmacokinetics, biodistribution, antitumo...

Journal: :Australasian J. Combinatorics 2010
Y. M. Borse

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

Journal: :Discrete Mathematics 2015
Premysl Holub Zdenek Ryjácek Ingo Schiermeyer

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...

Journal: :Order 2013
Michael K. Kinyon Jonathan Leech

Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.

2012
Van Bang Le Dieter Rautenbach

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.

Journal: :Discrete Mathematics & Theoretical Computer Science 2007
Van Bang Le H. N. de Ridder

An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...

Journal: :JDCTA 2009
Reza Ebrahimpour Mohammad R. Moradian Alireza Esmkhani Farzad M. Jafarlou

A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...

Journal: :J. Comb. Theory, Ser. A 2011
Suho Oh

Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید