Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 11
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Journal of food science 41 (1976), S. 0 
    ISSN: 1750-3841
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition , Process Engineering, Biotechnology, Nutrition Technology
    Notes: The mono- and oligosaccharide composition of two different varieties of groundnuts has been determined. 70% alcohol was used for the extraction of mono- and oligosaccharides. The total monosaccharides constituted 5.08 and 5.00%, and were identified as D-glucose (2.89 and 2.88%) and D-fructose (2.19 and 2.11%); while the total oligosaccharides amounted only to 3.23 and 3.38% of the flour solids, respectively for the two varieties, and were identified as sucrose, 0.91 and 0.95%; raffinose, 0.94 and 1.06%; stachyose, 1.04 and 0.51%; and verbascoy, 0.2 and 0.38%. Final identification of the sugars was achieved by gas liquid chromatographic analysis as their trimethylsilyl derivatives. In addition, one of the varieties “Nambyquarae” (hybrid peanut) also contained ajugose, 0.48%. These groundnuts are unusual in that they contain a high proportion of free monosaccharides.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    [s.l.] : Nature Publishing Group
    Nature 174 (1954), S. 229-230 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] Rabbits of both sexes, average weight 1 -5 kgm., were used. The hyperglycsemic glycogenolytic factor was extracted from the pancreas of four groups of animals : (a) normal rabbits ; (6) rabbits treated with cobalt chloride (50 mgm./kgm. body-weight as a 5 per cent solution by intravenous injection ...
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    [s.l.] : Nature Publishing Group
    Nature 128 (1931), S. 413-413 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] IT is known that there is no reaction between hydrogen sulphide and sulphur dioxide in the dry state, and that mercury, benzene, or carbon tetra-chloride have no effect on a mixture of the dry gases. In the course of an investigation on the reaction between hydrogen sulphide and sulphur ...
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Journal of food biochemistry 6 (1982), S. 0 
    ISSN: 1745-4514
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Process Engineering, Biotechnology, Nutrition Technology
    Notes: Polyphenol oxidase from the peel of ripe mango fruit (Mangifera indica. Var. Raspuri) was purifed 126-fold to homogeneity by ammoniun sulphate fractionation, column chromatography on Blue Sepharose CL-6B and gel chromatography on Sephadex G-200. It had an iso-electric point (pI) of 4.1±0.2 and molecular weight of 137,000 daltons as determined by sodium dodecyl sulphate—polyacrylamide gel electrophoresis and gel filtration. It was more specific for catechol (than for other substatres tested) with a Km of 8.2 mM. 2-mercaptoethanol, L-cysteine, sodium diethyldithiocarbamate and thiourea were effective inhibitors of this enzyme. It had pH and temperature optima of 5.5 and 460C, respectively. It lost 50% activity by exposure to 850, 750 and 650C for 3, 16 and 25.5 min, respectively. Copper content was one atom per mole of enzyme and copper was essential for its activity. Unlike most of the polyphenol oxidases, multiple forms were not detected in the crude extract.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 59 (1993), S. 87-115 
    ISSN: 1436-4646
    Keywords: Graph partition ; multiway cut ; polytope ; facet
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 64 (1994), S. 231-246 
    ISSN: 1436-4646
    Keywords: Steiner tree ; Polyhedron ; Facets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This is the second part of two papers addressing the study of the facial structure of the Steiner tree polyhedron. In this paper we identify several classes of facet defining inequalities and relate them to special classes of graphs on which the Steiner tree problem is known to be NP-hard.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 35-47 
    ISSN: 1436-4646
    Keywords: Perfect matrices ; balanced matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we define wheel matrices and characterize some properties of matrices that are perfect but not balanced. A consequence of our results is that if a matrixA is perfect then we can construct a polynomial number of submatricesA I,⋯,A n ofA such thatA is balanced if and only if all the submatricesA 1,⋯,A n ofA are perfect. This implies that if the problem of testing perfection is polynomially solvable, then so is the problem of testing balancedness.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 55 (1992), S. 129-168 
    ISSN: 1436-4646
    Keywords: Polyhedral combinatorics ; integrality of polytopes ; decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Claude Berge defines a (0, 1) matrix A to be linear ifA does not contain a 2 × 2 submatrix of all ones.A(0, 1) matrixA is balanced ifA does not contain a square submatrix of odd order with two ones per row and column. The contraction of a rowi of a matrix consists of the removal of rowi and all the columns that have a 1 in the entry corresponding to rowi. In this paper we show that if a linear balanced matrixA does not belong to a subclass of totally unimodular matrices, thenA orA T contains a rowi such that the submatrix obtained by contracting rowi has a block-diagonal structure.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 64 (1994), S. 209-229 
    ISSN: 1436-4646
    Keywords: Steiner tree ; Polyhedron ; Facets ; Projection
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs and study the associated polyhedra. We give some families of facets for the undirected case along with some compositions and extensions. We also give a projection that relates the Steiner tree polyhedron on an undirected graph to the polyhedron for the corresponding directed graph. This is used to show that the LP-relaxation of the directed formulation is superior to the LP-relaxation of the undirected one.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 45 (1989), S. 279-294 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A cycle of a bipartite graphG(V+, V−; E) is odd if its length is 2 (mod 4), even otherwise. An odd cycleC is node minimal if there is no odd cycleC′ of cardinality less than that ofC′ such that one of the following holds:C′ ∩V + ⊂C ∩V + orC′ ∩V − ⊂C ∩V −. In this paper we prove the following theorem for bipartite graphs: For a bipartite graphG, one of the following alternatives holds: -All the cycles ofG are even. -G has an odd chordless cycle. -For every node minimal odd cycleC, there exist four nodes inC inducing a cycle of length four. -An edge (u, v) ofG has the property that the removal ofu, v and their adjacent nodes disconnects the graphG. To every (0, 1) matrixA we can associate a bipartite graphG(V+, V−; E), whereV + andV − represent respectively the row set and the column set ofA and an edge (i,j) belongs toE if and only ifa ij = 1. The above theorem, applied to the graphG(V+, V−; E) can be used to show several properties of some classes of balanced and perfect matrices. In particular it implies a decomposition theorem for balanced matrices containing a node minimal odd cycleC, having the property that no four nodes ofC induce a cycle of length 4. The above theorem also yields a proof of the validity of the Strong Perfect Graph Conjecture for graphs that do not containK 4−e as an induced subgraph.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...