926 resultados para Multilevel Graph Partitioning
Resumo:
An investigation of clavulanic acid behavior in an aqueous two-phase micellar system employing the surfactants n-decyltetraethylene oxide (C(10)E(4)) and dodecyldimethylamine oxide (DDAO) was carried out. According to the results, clavulanic acid partitions evenly between the two phases of DDAO micellar system, mixed DDAO C(10)E(4) micellar system, as well as C10E4 micellar system. Therefore, electrostatic interactions between positively charged DDAO-containing micelles and negatively charged drug were not strong enough to influence the partitioning. Nevertheless, clavulanic acid extraction from Streptomyces clavuligerus fermentation broth in C(10)E(4) micellar system employing a previous protein denaturation step provided recovery of 52% clavulanic acid with removal of 70% of the contaminant proteins, which is already promising as a purification strategy. (C) 2011 International Union of Biochemistry and Molecular Biology, Inc. Volume 58, Number 2, March/April 2011, Pages 103-108. E-mail: corangel@usp.br
Resumo:
Nisin is a natural additive for conservation of food, and can also be used as a therapeutic agent. Nisin inhibits the outgrowth of spores, the growth of a variety of Gram-positive and Grain-negative bacteria. In this paper we present a potentially scalable and cost-effective way to purify commercial and biosynthesized in bioreactor nisin, including simultaneously removal of impurities and contaminants, increasing nisin activity. Aqueous two-phase micellar systems (ATPMS) are considered promising for bioseparation and purification purposes. Triton X-114 was chosen as the as phase-forming surfactant because it is relatively mild to proteins and it also forms two coexisting phases within a convenient temperature range. Nisin activity was determined by the agar diffusion assay utilizing Lactobacillus sake as a sensitive indicator microorganism. Results indicated that nisin partitions preferentially to the micelle rich-phase, despite the surfactant concentration tested, and its antimicrobial activity increases. The successful implementation of this peptide partitioning, from a suspension containing other compounds, represents an important step towards developing a separation method for nisin, and more generally, for other biomolecules of interest. (C) 2007 Elsevier Inc. All rights reserved.
Resumo:
Specimens of the red alga Bostrychia tenella J Agardh (Rhodomelaceae, Ceramiales) were collected from the Sao Paulo coast and submitted to loom temperature solvent extraction The resulting extract was fractionated by partitioning with organic solvent The n-hexane (BT-H) and dichloromethane (BT-D) fractions showed antiprotozoal potential in biological tests with Trypanosoma cruzi and Leishmania amazonensis and presented high activity in an antifungal assay with the phytopathogenic fungi Cladosporium cladosporioides and Cladosporium sphaerospermum Chromatography methods were used to generate subfractions from BT-H (H01 to H11) and from BT-D (D01 to 019) The subtractions were analyzed by gas chromatography-mass spectrometry (GC/MS). and the substances were identified by retention index (Kovats) and by comparison to databases of commercial mass spectra The volatile compounds found in marine algae were identified as fatty acids, low molecular mass hydrocarbons, esters and steroids, some of these have been previously described in the literature based on other biological activities Moreover, uncommon substances. such as neophytadiene were also identified In a trypanocidal assay, fractions BT-H and BT-D showed IC(50) values of 168 and 19 1 mu g/mL. respectively, and were mote active than the gentian violet standard (31 mu g/ml.); subfractions H02. H03, D01 and D02 were active against L amasonensis, exhibiting IC(50) values of 1 S. 2 7, 4 4. and 4 3 mu g/mL., respectively (standard amphotericin B IC(50) = 13 mu g/mL.) All fractions showed antifungal potential this work reports the biological activity and identification of compounds by GC/MS for the marine red alga B tenella for the first time (C) 2010 Elsevier B V All lights reserved
Resumo:
A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.
Resumo:
In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features.
Resumo:
The trade spectrum of a simple graph G is defined to be the set of all t for which it is possible to assemble together t copies of G into a simple graph H, and then disassemble H into t entirely different copies of G. Trade spectra of graphs have applications to intersection problems, and defining sets, of G-designs. In this investigation, we give several constructions, both for specific families of graphs, and for graphs in general.
Resumo:
In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given.
Resumo:
A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.
Resumo:
The minimal irreducible representations of U-q[gl(m|n)], i.e. those irreducible representations that are also irreducible under U-q[osp(m|n)] are investigated and shown to be affinizable to give irreducible representations of the twisted quantum affine superalgebra U-q[gl(m|n)((2))]. The U-q[osp(m|n)] invariant R-matrices corresponding to the tensor product of any two minimal representations are constructed, thus extending our twisted tensor product graph method to the supersymmetric case. These give new solutions to the spectral-dependent graded Yang-Baxter equation arising from U-q[gl(m|n)((2))], which exhibit novel features not previously seen in the untwisted or non-super cases.
Resumo:
A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.
Resumo:
The XSophe-Sophe-XeprView((R)) computer simulation software suite enables scientists to easily determine spin Hamiltonian parameters from isotropic, randomly oriented and single crystal continuous wave electron paramagnetic resonance (CW EPR) spectra from radicals and isolated paramagnetic metal ion centers or clusters found in metalloproteins, chemical systems and materials science. XSophe provides an X-windows graphical user interface to the Sophe programme and allows: creation of multiple input files, local and remote execution of Sophe, the display of sophelog (output from Sophe) and input parameters/files. Sophe is a sophisticated computer simulation software programme employing a number of innovative technologies including; the Sydney OPera HousE (SOPHE) partition and interpolation schemes, a field segmentation algorithm, the mosaic misorientation linewidth model, parallelization and spectral optimisation. In conjunction with the SOPHE partition scheme and the field segmentation algorithm, the SOPHE interpolation scheme and the mosaic misorientation linewidth model greatly increase the speed of simulations for most spin systems. Employing brute force matrix diagonalization in the simulation of an EPR spectrum from a high spin Cr(III) complex with the spin Hamiltonian parameters g(e) = 2.00, D = 0.10 cm(-1), E/D = 0.25, A(x) = 120.0, A(y) = 120.0, A(z) = 240.0 x 10(-4) cm(-1) requires a SOPHE grid size of N = 400 (to produce a good signal to noise ratio) and takes 229.47 s. In contrast the use of either the SOPHE interpolation scheme or the mosaic misorientation linewidth model requires a SOPHE grid size of only N = 18 and takes 44.08 and 0.79 s, respectively. Results from Sophe are transferred via the Common Object Request Broker Architecture (CORBA) to XSophe and subsequently to XeprView((R)) where the simulated CW EPR spectra (1D and 2D) can be compared to the experimental spectra. Energy level diagrams, transition roadmaps and transition surfaces aid the interpretation of complicated randomly oriented CW EPR spectra and can be viewed with a web browser and an OpenInventor scene graph viewer.
Resumo:
This is the first in a series of three articles which aimed to derive the matrix elements of the U(2n) generators in a multishell spin-orbit basis. This is a basis appropriate to many-electron systems which have a natural partitioning of the orbital space and where also spin-dependent terms are included in the Hamiltonian. The method is based on a new spin-dependent unitary group approach to the many-electron correlation problem due to Gould and Paldus [M. D. Gould and J. Paldus, J. Chem. Phys. 92, 7394, (1990)]. In this approach, the matrix elements of the U(2n) generators in the U(n) x U(2)-adapted electronic Gelfand basis are determined by the matrix elements of a single Ll(n) adjoint tensor operator called the del-operator, denoted by Delta(j)(i) (1 less than or equal to i, j less than or equal to n). Delta or del is a polynomial of degree two in the U(n) matrix E = [E-j(i)]. The approach of Gould and Paldus is based on the transformation properties of the U(2n) generators as an adjoint tensor operator of U(n) x U(2) and application of the Wigner-Eckart theorem. Hence, to generalize this approach, we need to obtain formulas for the complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The nonzero shift coefficients are uniquely determined and may he evaluated by the methods of Gould et al. [see the above reference]. In this article, we define zero-shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis which are appropriate to the many-electron problem. By definition, these are proportional to the corresponding two-shell del-operator matrix elements, and it is shown that the Racah factorization lemma applies. Formulas for these coefficients are then obtained by application of the Racah factorization lemma. The zero-shift adjoint reduced Wigner coefficients required for this procedure are evaluated first. All these coefficients are needed later for the multishell case, which leads directly to the two-shell del-operator matrix elements. Finally, we discuss an application to charge and spin densities in a two-shell molecular system. (C) 1998 John Wiley & Sons.
Resumo:
This is the second in a series of articles whose ultimate goal is the evaluation of the matrix elements (MEs) of the U(2n) generators in a multishell spin-orbit basis. This extends the existing unitary group approach to spin-dependent configuration interaction (CI) and many-body perturbation theory calculations on molecules to systems where there is a natural partitioning of the electronic orbital space. As a necessary preliminary to obtaining the U(2n) generator MEs in a multishell spin-orbit basis, we must obtain a complete set of adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. The zero-shift coefficients were obtained in the first article of the series. in this article, we evaluate the nonzero shift adjoint coupling coefficients for the two-shell composite Gelfand-Paldus basis. We then demonstrate that the one-shell versions of these coefficients may be obtained by taking the Gelfand-Tsetlin limit of the two-shell formulas. These coefficients,together with the zero-shift types, then enable us to write down formulas for the U(2n) generator matrix elements in a two-shell spin-orbit basis. Ultimately, the results of the series may be used to determine the many-electron density matrices for a partitioned system. (C) 1998 John Wiley & Sons, Inc.
Resumo:
For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.