4 resultados para Modal Flexibility Matrix
em Brock University, Canada
Resumo:
In the work reported here, optically clear, ultrathin TEOS derived sol-gel slides which were suitable for studies of tryptophan (Trp) fluorescence from entrapped proteins were prepared by the sol-gel technique and characterized. The monitoring of intrinsic protein fluorescence provided information about the structure and environment of the entrapped protein, and about the kinetics of the interaction between the entrapped protein and extemal reagents. Initial studies concentrated on the single Trp protein monellin which was entrapped into the sol-gel matrices. Two types of sol-gel slides, termed "wet aged", in which the gels were aged in buffer and "dry-aged", in which the gels were aged in air , were studied in order to compare the effect of the sol-gel matrix on the structure of the protein at different aging stages. Fluorescence results suggested that the mobility of solvent inside the slides was substantially reduced. The interaction of the entrapped protein with both neutral and charged species was examined and indicated response times on the order of minutes. In the case of the neutral species the kinetics were diffusion limited in solution, but were best described by a sum of first order rate constants when the reactions occurred in the glass matrix. For charged species, interactions between the analytes and the negatively charged glass matrix caused the reaction kinetics to become complex, with the overall reaction rate depending on both the type of aging and the charge on the analyte. The stability and conformational flexibility of the entrapped monellin were also studied. These studies indicated that the encapsulation of monellin into dry-aged monoliths caused the thermal unfolding transition to broaden and shift upward by 14°C, and causedthe long-term stability to improve by 12-fold (compared to solution). Chemical stability studies also showed a broader transition for the unfolding of the protein in dry-aged monoliths, and suggested that the protein was present in a distribution of environments. Results indicated that the entrapped proteins had a smaller range of conformational motions compared to proteins in solution, and that entrapped proteins were not able to unfold completely. The restriction of conformational motion, along with the increased structural order of the internal environment of the gels, likely resulted in the improvements in themial and long-term stability that were observed. A second protein which was also studied in this work is the metal binding protein rat oncomodulin. Initially, the unfolding behavior of this protein in aqueous solution was examined. Several single tryptophan mutants of the metal-binding protein rat oncomodulin (OM) were examined; F102W, Y57W, Y65W and the engineered protein CDOM33 which had all 12 residues of the CD loop replaced with a higher affinity binding loop. Both the thermal and the chemical stability were improved upon binding of metal ions with the order apo < Ca^^ < Tb^"^. During thermal denaturation, the transition midpoints (Tun) of Y65W appeared to be the lowest, followed by Y57W and F102W. The placement of the Trp residue in the F-helix in F102W apparently made the protein slightly more thermostable, although the fluorescence response was readily affected by chemical denaturants, which probably acted through the disruption of hydrogen bonds at the Cterminal end of the F-helix. Under both thermal and chemical denaturation, the engineered protein showed the highest stability. This indicated that increasing the number of metal ligating oxygens in the binding site, either by using a metal ion with a higher coordinatenumber (i.e. Tb^*) which binds more carboxylate ligands, or by providing more ligating groups, as in the CDOM33 replacement, produces notable improvements in protein stability. Y57W and CE)OM33 OM were chosen for further studies when encapsulated into sol-gel derived matrices. The kinetics of interaction of terbium with the entrapped proteins, the ability of the entrapped protein to binding terbium, as well as thermal stability of these two entrapped protein were compared with different levels of Ca^"*^ present in the matrix and in solution. Results suggested that for both of the proteins, the response time and the ability to bind terbium could be adjusted by adding excess calcium to the matrix before gelation. However, the less stable protein Y57W only retained at most 45% of its binding ability in solution while the more stable protein CDOM33 was able to retain 100% binding ability. Themially induced denaturation also suggested that CDOM33 showed similar stability to the protein in solution while Y57W was destabilized. All these results suggested that "hard" proteins (i.e. very stable) can easily survive the sol-gel encapsulation process, but "soft" proteins with lower thermodynamic stability may not be able to withstand the sol-gel process. However, it is possible to control many parameters in order to successfully entrap biological molecules into the sol-gel matrices with maxunum retention of activity.
Resumo:
Exch~nge energy of the He-He system is calculated using the one-density matrix which has been modified according to the supermolecular density formula quoted by Kolos. The exchange energy integrals are computed analytically and by the Monte Carlo method. The results obtained from both ways compared favourably,with the results obtained from the SCF program HONDO
Resumo:
Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.
Characterizing Dynamic Optimization Benchmarks for the Comparison of Multi-Modal Tracking Algorithms
Resumo:
Population-based metaheuristics, such as particle swarm optimization (PSO), have been employed to solve many real-world optimization problems. Although it is of- ten sufficient to find a single solution to these problems, there does exist those cases where identifying multiple, diverse solutions can be beneficial or even required. Some of these problems are further complicated by a change in their objective function over time. This type of optimization is referred to as dynamic, multi-modal optimization. Algorithms which exploit multiple optima in a search space are identified as niching algorithms. Although numerous dynamic, niching algorithms have been developed, their performance is often measured solely on their ability to find a single, global optimum. Furthermore, the comparisons often use synthetic benchmarks whose landscape characteristics are generally limited and unknown. This thesis provides a landscape analysis of the dynamic benchmark functions commonly developed for multi-modal optimization. The benchmark analysis results reveal that the mechanisms responsible for dynamism in the current dynamic bench- marks do not significantly affect landscape features, thus suggesting a lack of representation for problems whose landscape features vary over time. This analysis is used in a comparison of current niching algorithms to identify the effects that specific landscape features have on niching performance. Two performance metrics are proposed to measure both the scalability and accuracy of the niching algorithms. The algorithm comparison results demonstrate the algorithms best suited for a variety of dynamic environments. This comparison also examines each of the algorithms in terms of their niching behaviours and analyzing the range and trade-off between scalability and accuracy when tuning the algorithms respective parameters. These results contribute to the understanding of current niching techniques as well as the problem features that ultimately dictate their success.