997 resultados para CARBOHYDRATE-BINDING MODULES


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Photosciences & Photonics, Chemical Sciences & Technology Division, National Institute for Interdisciplinary Science & Technology

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Glucoamylase was immobilized on acid activated montmorillonite clay via two different procedures namely adsorption and covalent binding. The immobilized enzymes were characterized by XRD, NMR and N2 adsorption measurements and the activity of immobilized glucoamylase for starch hydrolysis was determined in a batch reactor. XRD shows intercalation of enzyme into the clay matrix during both immobilization procedures. Intercalation occurs via the side chains of the amino acid residues, the entire polypeptide backbone being situated at the periphery of the clay matrix. 27Al NMR studies revealed the different nature of interaction of enzyme with the support for both immobilization techniques. N2 adsorption measurements indicated a sharp drop in surface area and pore volume for the covalently bound glucoamylase that suggested severe pore blockage. Activity studies were performed in a batch reactor. The adsorbed and covalently bound glucoamylase retained 49% and 66% activity of the free enzyme respectively. They showed enhanced pH and thermal stabilities. The immobilized enzymes also followed Michaelis–Menten kinetics. Km was greater than the free enzyme that was attributed to an effect of immobilization. The immobilized preparations demonstrated increased reusability as well as storage stability.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Màster Experimental en Química: Química Física

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Six new copper complexes of di-2-pyridyl ketone nicotinoylhydrazone (HDKN) have been synthesized. The complexes have been characterized by a variety of spectroscopic techniques and the structure of [Cu(DKN)2]·H2O has been determined by single crystal X-ray diffraction. The compound [Cu(DKN)2]·H2O crystallized in the monoclinic space group P21 and has a distorted octahedral geometry. The IR spectra revealed the presence of variable modes of chelation for the investigated ligand. The EPR spectra of compounds [Cu2(DKN)2( -N3)2] and [Cu2(DKN)2( -NCS)2] in polycrystalline state suggest a dimeric structure as they exhibited a half field signal, which indicate the presence of a weak interaction between two Cu(II) ions in these complexes

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Yacon (Smallanthus sonchifolius [Poepp. & Endl.] H. Robinson) is an under-exploited native root crop of the Andes, which stores oligofructans (fructo-oligosaccharides, FOS) as its main component of dry matter (DM). FOS are of increasing economic interest because of their low caloric value in human diets and bifidogenic benefits on colon health. Two on-farm experiments were conducted to: (i) determine the effect of shaded, short-term storage at 1990 and 2930 m a.s.l. in the Andean highlands; and (ii) address the effects of a traditional sunlight exposure (‘sunning’) on the carbohydrate composition in the DM of tuberous yacon roots. After a 6-day shade storage FOS concentrations were smaller at the lower (36–48% of DM) than at the higher altitude (39–58% of DM). After 12 days FOS concentrations were nearly equal at both sites (27–39% of DM). The concentration of free sugars (fructose, glucose, sucrose) increased accordingly from 29–34 to 48–52%. During the 6-day sunning experiment FOS concentrations decreased from 50–62 to 29–44% and free sugars increased from 29–34 to 45–51%. The results indicate that partial hydrolysis of oligofructans starts shortly after harvest. Storage in highland environments should wherever possible exploit the cooler temperatures at higher altitudes. Sunning of yacon’s tuberous roots effectively reduces much of the roots’ water content, in this experiment 40%, and thus allows energy to be saved if yacon is processed into dehydrated products.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The comparison between the experimental binding energies for the K, L, and M electrons for fermium and the results of our Dirac-Fock calculation, taking into account all tractable corrections, leads to agreement within about 20 eV. This shows that the present method of calculation is an adequate description of this problem and that nonlinear electrodynamical effects will not be present in nature or will be smaller than 1% compared to the values recently proposed. It is found that the energies of electronic transitions can now be used to estimate the nuclear radius.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Free-word order languages have long posed significant problems for standard parsing algorithms. This thesis presents an implemented parser, based on Government-Binding (GB) theory, for a particular free-word order language, Warlpiri, an aboriginal language of central Australia. The words in a sentence of a free-word order language may swap about relatively freely with little effect on meaning: the permutations of a sentence mean essentially the same thing. It is assumed that this similarity in meaning is directly reflected in the syntax. The parser presented here properly processes free word order because it assigns the same syntactic structure to the permutations of a single sentence. The parser also handles fixed word order, as well as other phenomena. On the view presented here, there is no such thing as a "configurational" or "non-configurational" language. Rather, there is a spectrum of languages that are more or less ordered. The operation of this parsing system is quite different in character from that of more traditional rule-based parsing systems, e.g., context-free parsers. In this system, parsing is carried out via the construction of two different structures, one encoding precedence information and one encoding hierarchical information. This bipartite representation is the key to handling both free- and fixed-order phenomena. This thesis first presents an overview of the portion of Warlpiri that can be parsed. Following this is a description of the linguistic theory on which the parser is based. The chapter after that describes the representations and algorithms of the parser. In conclusion, the parser is compared to related work. The appendix contains a substantial list of test cases ??th grammatical and ungrammatical ??at the parser has actually processed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This is a presentation introducing students to algorithmic concepts such as sequencing, pseudocode and modularity. It includes a class exercise to define the algorithm to make a cup of tea.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A short video describing what the University is seeking in new modules for the Curriculum Innovation Programme

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This is one of a series of short case studies describing how academic tutors at the University of Southampton have made use of learning technologies to support their students.