48 resultados para maximin
Resumo:
Amphibian skin is a rich resource of antimicrobial peptides, like maximins and maximin Hs from frog Bombina maxima. Novel cDNA clones encoding a precursor protein, which comprises a novel maximin peptide (maximin 9) and reported maximin H3, were isolated from two constructed skin cDNA libraries of B. maxima. The predicted primary structure of maximin 9 is GIGRKFLGGVKTTFRCGVKDFASKHLY-NH2. A surprising substitution is at position 16, with a free cysteine in maximin 9 rather than usual conserved glycine in other reported maximins. Maximin 9, the homodimer form and its Cys(16) to Gly(16) mutant were synthesized and their antimicrobial activities were evaluated. Unlike previously reported maximin 3, the tested bacterial and fungal strains were resistant to maximin 9, its homodimer and the Cys(16) to Gly(16) mutant (with MICs > 100 mu M). On the other hand, interestingly, while eight clinical Mollicutes strains were generally resistant to maximin 9 homodimer and its Cys(16) to Gly(16) mutant, most of them are sensitive to maximin 9 at a peptide concentration of 30 mu M, especially in the presence of dithiothreitol. These results indicate that the presence of a reactive Cys residue in maximin 9 is important for its antimycoplasma activity. The diversity of antimicrobial peptide cDNA structures encountered in B. maxima skin cDNA libraries and the antimicrobial specificity differences of the peptides may reflect well the species' adaptation to the unique microbial environments. (c) 2005 Federation of European Biochemical Societies. Published by Elsevier B.V. All rights reserved.
Resumo:
In this letter, we consider beamforming strategies in amplified-and-forward (AF) two-way relay channels, where two terminals and the relay are equipped with multiple antennas. Our aim is to optimize the worse end-to-end signal-to-noise ratio of the two links so that the reliability of both terminals can be guaranteed. We show that the optimization problem can be recast as a generalized fractional programing and be solved by using the Dinkelbach-type procedure combined with semidefinite programming. Simulation results confirm the efficiency of the proposed strategies.
Resumo:
Die wohl um 700 aus einer Priestersozietät an der Grabeskirche des Trierer Bischofs Maximin (329-vor 347) herausgebildete Mönchsgemeinschaft im Trierer Stadtgebiet gehörte im Mittelalter zu den fünf begütertsten Reichsabteien. Dies erlaubte der Abtei trotz ihrer Anfänge als Bischofskloster schon bald eine weitgehend selbständige Stellung zwischen den regionalen Mächten Trier und Luxemburg, die sie bis zu ihrer Aufhebung im Jahre 1802 behaupten konnte. Einen religiösen und kulturellen Höhepunkt bewirkte im 10. Jahrhundert die Nähe der Abtei zum ottonischen Herrscherhaus. Durch die Nutzung der Maximiner Reformordnung als Mittel der Intensivierung der Kirchenpolitik seitens der Ottonen erlangte das Kloster den Status einer Reichsabtei, führte zahlreiche Reformen in den Gliedern der Reichskirche durch und wurde zur Ausbildungsstätte des höheren Klerus, so dass in dieser Ära aus dem Maximiner Konvent 42 Äbte anderer Klöster hervorgingen. Bemerkenswert an dieser Abtei war nicht nur ihre spezifische Ausformung der Benedictusregel und ihr materieller Reichtum, sondern auch ihr zeitweilig sehr produktives, um 1000 mit der Egbert-Schule verbundenes Skriptorium.
Resumo:
We consider online prediction problems where the loss between the prediction and the outcome is measured by the squared Euclidean distance and its generalization, the squared Mahalanobis distance. We derive the minimax solutions for the case where the prediction and action spaces are the simplex (this setup is sometimes called the Brier game) and the \ell_2 ball (this setup is related to Gaussian density estimation). We show that in both cases the value of each sub-game is a quadratic function of a simple statistic of the state, with coefficients that can be efficiently computed using an explicit recurrence relation. The resulting deterministic minimax strategy and randomized maximin strategy are linear functions of the statistic.
Resumo:
In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
Para cualquier alumno de Ciencias Sociales que esté interesado en saber analizar juegos en los que existe interacción estratégica entre los jugadores. Contenido: Introducción, Conceptos Básicos, Juegos simultáneos, Ejercicios de autoevaluación, el equilibrio de Nash, problemas del equilibrio de Nash, algunos resultados de interés, algunas aplicaciones del equilibrio de Nash, Ejercicios de autoevaluación, Las estrategias Maximin, las estrategias mixtas, Ejercicios de autoevaluación, el dilema del prisionero, Ejercicios de autoevaluación, Juegos sucesivos o secuenciales, Ejercicios de autoevaluación, paso de la forma extensiva a la normal, Ejercicios de autoevaluación, los juegos repetidos, Ejercicios de autoevaluación, Ejercicio de repaso, solución a los Ejercicios de autoevaluación, respuesta al ejercicio de repaso, Ejercicios, Apéndice: Aplicaciones Económicas, Bibliografía.
Resumo:
Este trabalho apresenta o projeto e os algoritmos de controle, de um sistema de geração de energia híbrido. Este sistema é formado por conversores de potência conectados em Back-to-Back associados a um arranjo solar fotovoltaico, que por sua vez é conectado no lado CC dos conversores. Em relação ao sistema de geração fotovoltaico, a contribuição consiste no desenvolvimento de cinco algoritmos para determinar o ponto de máxima potência (MPP) do arranjo fotovoltaico. O primeiro algoritmo consiste em uma versão modificada do algoritmo de Perturbar e Observar (PeO); o segundo algoritmo proposto é baseado no método do gradiente (MG); e o terceiro é baseado na otimização do MG (MGO). Porém, são desenvolvidos algoritmos híbridos que combinam rede neural com o método PeO, e rede neural com o algoritmo MGO. O sistema foi desenvolvido e simulado utilizando o Matlab/Simulink, e os resultados de simulação são apresentados com objetivo da avaliar o comportamento do sistema e a resposta dos diferentes algoritmos. Esta resposta foi avaliada para condições transitórias e de regime permanente, considerando diferentes requisitos de consumo na carga, irradiância e temperatura.