• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 183
  • 72
  • 33
  • 17
  • 16
  • 12
  • 9
  • 8
  • 5
  • 4
  • 4
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 392
  • 72
  • 63
  • 59
  • 55
  • 47
  • 38
  • 36
  • 33
  • 31
  • 27
  • 24
  • 23
  • 22
  • 22
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
71

A conjectura de Bateman-Horn e o Lambda-cálculo de Golomb / The Bateman-Horn conjecture and Golomb\'s Lambda-method

Pontes, Pedro Henrique 02 July 2012 (has links)
A Conjectura de Bateman-Horn dá condições sobre uma família de polinômios com coeficientes inteiros $f_1(X),\\dots,f_k(X)$ para que hajam infinitos $n \\in \\N$ tais que $f_1(n),\\dots,f_k(n)$ sejam todos primos, e determina qual deve ser o comportamento assintótico de tais inteiros $n$. Neste texto, vamos estudar essa conjectura, assim como um método desenvolvido por Solomon W. Golomb que pode ser usado para demonstrá-la. Veremos que esse cálculo prova a Conjectura de Bateman-Horn a menos da troca de um limite com uma série infinita, que é o único passo ainda não provado desse método. Também estudaremos uma tentativa para solucionar esse problema por meio do uso de teoremas abelianos de regularidade, e provaremos que teoremas tão gerais não são suficientes para provar a troca do limite com a série. / Given a family of polynomials with integer coefficients $f_1(X),\\dots,f_k(X)$, one would like to answer the following question: does there exist infinitely many $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes? Schinzel conjectured that if these polynomials satisfy certain simple conditions, then the answer to this question is affirmative. Assuming these conditions, Bateman and Horn proposed a formula for the asymptotic density of the integers $n \\in \\N$ such that $f_1(n),\\dots,f_k(n)$ are all primes. In this text, we shall study the Bateman-Horn Conjecture, as well as a method proposed by Solomon W. Golomb that may be used to prove this conjecture. We shall see that Golomb\'s $\\Lambda$-method would prove the Bateman-Horn Conjecture, except for a single unproved step, namely, the commutation of a limit with an infinite series.
72

Controle da mistura ar/combustível em um motor a combustão interna: sistema em malha fechada. / Air/fuel ratio control in an internal combustion engine: closed loop system.

Pereira, Bruno Silva 11 May 2015 (has links)
O controle da mistura ar/combustível é muito importante para o correto funcionamento dos motores à combustão interna ciclo Otto. A relação entre o ar e o combustível influencia diretamente no funcionamento do motor, na emissão de poluentes e no consumo de combustível. Este trabalho apresenta o desenvolvimento de um controle da mistura ar/combustível a partir do estudo de modelos de malha fechada deste sistema. Esse controle tem por objetivo manter a mistura o mais próxima possível do ponto estequiométrico, a fim de otimizar a taxa de conversão de gases poluentes pelo catalisador, e utiliza um sensor de oxigênio, conhecido como sonda lambda, para realizar a realimentação do sistema, indicando se a mistura está no ponto estequiométrico. Este trabalho também apresenta o desenvolvimento de um compensador em malha fechada para controlar a mistura a/c (ar/combustível) em outros pontos, além do estequiométrico, através do uso de uma sonda lambda de banda larga. / The control of the air/fuel mixture is very important for the correct operation of Otto cycle internal combustion engines. The relationship between the air and the fuel directly influences the engine operation, pollutant emissions and fuel consumption. This work presents the development of an air/fuel ratio controller, based on the study of closed loop systems. This control aims to keep the A/F mixture as close as possible of the stoichiometric point, in order to optimize the conversion rate of pollutant gases by the catalytic converter, and uses an oxygen sensor, known as lambda probe to perform the feedback to the system, indicating whether the mixture is at the stoichiometric point or not. This work also presents the development of a closed loop controller for the air fuel ratio at values other than the stoichiometric one, by using a wide band lambda sensor.
73

Du typage vectoriel / On vectorial typing

Diaz Caro, Alejandro 23 September 2011 (has links)
L'objectif de cette thèse est de développer une théorie de types pour le λ-calcul linéaire-algébrique, une extension du λ-calcul motivé par l'informatique quantique. Cette extension algébrique comprend tous les termes du λ-calcul plus leurs combinaisons linéaires, donc si t et r sont des termes, α.t+β.r est aussi un terme, avec α et β des scalaires pris dans un anneau. L'idée principale et le défi de cette thèse était d'introduire un système de types où les types, de la même façon que les termes, constituent un espace vectoriel, permettant la mise en évidence de la structure de la forme normale d'un terme. Cette thèse présente le système Lineal , ainsi que trois systèmes intermédiaires, également intéressants en eux-même : Scalar, Additive et λCA, chacun avec leurs preuves de préservation de type et de normalisation forte. / The objective of this thesis is to develop a type theory for the linear-algebraic λ-calculus, an extension of λ-calculus motivated by quantum computing. This algebraic extension encompass all the terms of λ-calculus together with their linear combinations, so if t and r are two terms, so is α.t + β.r, with α and β being scalars from a given ring. The key idea and challenge of this thesis was to introduce a type system where the types, in the same way as the terms, form a vectorial space, providing the information about the structure of the normal form of the terms. This thesis presents the system Lineal, and also three intermediate systems, however interesting by themselves: Scalar, Additive and λCA, all of them with their subject reduction and strong normalisation proofs.
74

Propagação de sinais em meios Lambda

Vale, Suzana Karina Silva January 2012 (has links)
Tese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 2012
75

Assessment of the immunogenicity of porcine <i>Circovirus</i> 2 (PCV2) vaccines : a prototype vaccine and a lambda display vaccine

Angunna Gamage, Lakshman Nihal 30 March 2010
Porcine <i>Circovirus</i> 2 (PCV2) associated diseases (PCVAD) cause economic loss to the global swine industry. Control measures for PCVAD largely depend on the use of PCV2 vaccines. The available commercial PCV2 vaccines contain either inactivated whole virus particles or recombinant PCV2 capsid protein. These preparations most likely contain varying amounts of immune-irrelevant proteins that can cause adverse injection site reactions, with compromised efficacy due to alteration of protective immune epitopes arising during the viral inactivation process. Other constraints include high production cost attributed to propagation of slow growing virus and expression and extraction of recombinant proteins, a requirement for adjuvants, and the induction of a Th2-biased immune response. Hence, development of new PCV2 vaccines is necessary.<p> There are two recommended PCV2 vaccination strategies. They are i. vaccinating sows, which relies on the passive transfer of maternal immunity to offspring, and ii. immunizing young piglets to induce an active immune response. The piglet vaccination has been shown to confer better protection from mortality. Maternal antibody interference to the induction of an active immune response is an obstacle when piglets are vaccinated at an early age. Can we sidestep this maternal antibody interference? To address this issue, I investigated whether a prototypical PCV2 vaccine, parenterally administered, could override maternally-derived PCV2 antibodies in seropositive piglets. The results of this study were not conclusive. However, they laid the foundation for future studies based upon using varying levels of vaccine antigen with different adjuvants, and administered to piglets with defined maternally derived PCV2 antibodies.<p> Subsequently, I examined if a new PCV2 vaccine candidate comprised of bacteriophage lambda particles displaying part of the PCV2 capsid protein could induce anti-PCV2 immunity. Initial experiments showed that pigs do not have pre-existing anti-lambda antibodies and thus will not neutralize display particles used as a vaccine at primary vaccination. I produced and characterized lambda phage particles displaying four immunodominant regions of porcine circovirus 2 (PCV2) capsid protein fused to the lambda capsid protein D i.e., D-CAP, phage display particles. Expression of D-CAP in <i>Escherichia coli</i> (<i>E. coli</i>) and its presence in the vaccine preparation was shown by ELISA and Western blots using anti-PCV2 polyclonal antiserum from a gnotobiotic pig. The vaccine, lambda particles displaying PCV2 capsid protein immunogenic epitopes fused to lambda D protein (LDP-D-CAP), administered without an adjuvant induced both humoral and cellular immunity to PCV2 in conventional pigs, as shown by ELISA, Western blots, virus neutralization assay and delayed type hypersensitivity (DTH) reactions. This work produced the first potential phage vaccine to PCV2. In order to further investigate the feasibility of using the lambda display technology. I produced and characterized two additional lambda display particle preparations, LDP-D-FLAG and LDP-D-GFP, displaying a FLAG tag and the green fluorescent proteins, respectively.
76

Oppositional Reinforcement Learning with Applications

Shokri, Maryam 05 September 2008 (has links)
Machine intelligence techniques contribute to solving real-world problems. Reinforcement learning (RL) is one of the machine intelligence techniques with several characteristics that make it suitable for the applications, for which the model of the environment is not available to the agent. In real-world applications, intelligent agents generally face a very large state space which limits the usability of reinforcement learning. The condition for convergence of reinforcement learning implies that each state-action pair must be visited infinite times, a condition which can be considered impossible to be satisfied in many practical situations. The goal of this work is to propose a class of new techniques to overcome this problem for off-policy, step-by-step (incremental) and model-free reinforcement learning with discrete state and action space. The focus of this research is using the design characteristics of RL agent to improve its performance regarding the running time while maintaining an acceptable level of accuracy. One way of improving the performance of the intelligent agents is using the model of environment. In this work, a special type of knowledge about the agent actions is employed to improve its performance because in many applications the model of environment may only be known partially or not at all. The concept of opposition is employed in the framework of reinforcement learning to achieve this goal. One of the components of RL agent is the action. For each action we define its associate opposite action. The actions and opposite actions are implemented in the framework of reinforcement learning to update the value function resulting in a faster convergence. At the beginning of this research the concept of opposition is incorporated in the components of reinforcement learning, states, actions, and reinforcement signal which results in introduction of the oppositional target domain estimation algorithm, OTE. OTE reduces the search and navigation area and accelerates the speed of search for a target. The OTE algorithm is limited to the applications, in which the model of the environment is provided for the agent. Hence, further investigation is conducted to extend the concept of opposition to the model-free reinforcement learning algorithms. This extension contributes to the generating of several algorithms based on using the concept of opposition for Q(lambda) technique. The design of reinforcement learning agent depends on the application. The emphasize of this research is on the characteristics of the actions. Hence, the primary challenge of this work is design and incorporation of the opposite actions in the framework of RL agents. In this research, three different applications, namely grid navigation, elevator control problem, and image thresholding are implemented to address this challenge in context of different applications. The design challenges and some solutions to overcome the problems and improve the algorithms are also investigated. The opposition-based Q(lambda) algorithms are tested for the applications mentioned earlier. The general idea behind the opposition-based Q(lambda) algorithms is that in Q-value updating, the agent updates the value of an action in a given state. Hence, if the agent knows the value of opposite action then instead of one value, the agent can update two Q-values at the same time without taking its corresponding opposite action causing an explicit transition to opposite state. If the agent knows both values of action and its opposite action for a given state, then it can update two Q-values. This accelerates the learning process in general and the exploration phase in particular. Several algorithms are outlined in this work. The OQ(lambda) will be introduced to accelerate Q(lambda) algorithm in discrete state spaces. The NOQ(lambda) method is an extension of OQ(lambda) to operate in a broader range of non-deterministic environments. The update of the opposition trace in OQ(lambda) depends on the next state of the opposite action (which generally is not taken by the agent). This limits the usability of this technique to the deterministic environments because the next state should be known to the agent. NOQ(lambda) will be presented to update the opposition trace independent of knowing the next state for the opposite action. The results show the improvement of the performance in terms of running time for the proposed algorithms comparing to the standard Q(lambda) technique.
77

Oppositional Reinforcement Learning with Applications

Shokri, Maryam 05 September 2008 (has links)
Machine intelligence techniques contribute to solving real-world problems. Reinforcement learning (RL) is one of the machine intelligence techniques with several characteristics that make it suitable for the applications, for which the model of the environment is not available to the agent. In real-world applications, intelligent agents generally face a very large state space which limits the usability of reinforcement learning. The condition for convergence of reinforcement learning implies that each state-action pair must be visited infinite times, a condition which can be considered impossible to be satisfied in many practical situations. The goal of this work is to propose a class of new techniques to overcome this problem for off-policy, step-by-step (incremental) and model-free reinforcement learning with discrete state and action space. The focus of this research is using the design characteristics of RL agent to improve its performance regarding the running time while maintaining an acceptable level of accuracy. One way of improving the performance of the intelligent agents is using the model of environment. In this work, a special type of knowledge about the agent actions is employed to improve its performance because in many applications the model of environment may only be known partially or not at all. The concept of opposition is employed in the framework of reinforcement learning to achieve this goal. One of the components of RL agent is the action. For each action we define its associate opposite action. The actions and opposite actions are implemented in the framework of reinforcement learning to update the value function resulting in a faster convergence. At the beginning of this research the concept of opposition is incorporated in the components of reinforcement learning, states, actions, and reinforcement signal which results in introduction of the oppositional target domain estimation algorithm, OTE. OTE reduces the search and navigation area and accelerates the speed of search for a target. The OTE algorithm is limited to the applications, in which the model of the environment is provided for the agent. Hence, further investigation is conducted to extend the concept of opposition to the model-free reinforcement learning algorithms. This extension contributes to the generating of several algorithms based on using the concept of opposition for Q(lambda) technique. The design of reinforcement learning agent depends on the application. The emphasize of this research is on the characteristics of the actions. Hence, the primary challenge of this work is design and incorporation of the opposite actions in the framework of RL agents. In this research, three different applications, namely grid navigation, elevator control problem, and image thresholding are implemented to address this challenge in context of different applications. The design challenges and some solutions to overcome the problems and improve the algorithms are also investigated. The opposition-based Q(lambda) algorithms are tested for the applications mentioned earlier. The general idea behind the opposition-based Q(lambda) algorithms is that in Q-value updating, the agent updates the value of an action in a given state. Hence, if the agent knows the value of opposite action then instead of one value, the agent can update two Q-values at the same time without taking its corresponding opposite action causing an explicit transition to opposite state. If the agent knows both values of action and its opposite action for a given state, then it can update two Q-values. This accelerates the learning process in general and the exploration phase in particular. Several algorithms are outlined in this work. The OQ(lambda) will be introduced to accelerate Q(lambda) algorithm in discrete state spaces. The NOQ(lambda) method is an extension of OQ(lambda) to operate in a broader range of non-deterministic environments. The update of the opposition trace in OQ(lambda) depends on the next state of the opposite action (which generally is not taken by the agent). This limits the usability of this technique to the deterministic environments because the next state should be known to the agent. NOQ(lambda) will be presented to update the opposition trace independent of knowing the next state for the opposite action. The results show the improvement of the performance in terms of running time for the proposed algorithms comparing to the standard Q(lambda) technique.
78

Assessment of the immunogenicity of porcine <i>Circovirus</i> 2 (PCV2) vaccines : a prototype vaccine and a lambda display vaccine

Angunna Gamage, Lakshman Nihal 30 March 2010 (has links)
Porcine <i>Circovirus</i> 2 (PCV2) associated diseases (PCVAD) cause economic loss to the global swine industry. Control measures for PCVAD largely depend on the use of PCV2 vaccines. The available commercial PCV2 vaccines contain either inactivated whole virus particles or recombinant PCV2 capsid protein. These preparations most likely contain varying amounts of immune-irrelevant proteins that can cause adverse injection site reactions, with compromised efficacy due to alteration of protective immune epitopes arising during the viral inactivation process. Other constraints include high production cost attributed to propagation of slow growing virus and expression and extraction of recombinant proteins, a requirement for adjuvants, and the induction of a Th2-biased immune response. Hence, development of new PCV2 vaccines is necessary.<p> There are two recommended PCV2 vaccination strategies. They are i. vaccinating sows, which relies on the passive transfer of maternal immunity to offspring, and ii. immunizing young piglets to induce an active immune response. The piglet vaccination has been shown to confer better protection from mortality. Maternal antibody interference to the induction of an active immune response is an obstacle when piglets are vaccinated at an early age. Can we sidestep this maternal antibody interference? To address this issue, I investigated whether a prototypical PCV2 vaccine, parenterally administered, could override maternally-derived PCV2 antibodies in seropositive piglets. The results of this study were not conclusive. However, they laid the foundation for future studies based upon using varying levels of vaccine antigen with different adjuvants, and administered to piglets with defined maternally derived PCV2 antibodies.<p> Subsequently, I examined if a new PCV2 vaccine candidate comprised of bacteriophage lambda particles displaying part of the PCV2 capsid protein could induce anti-PCV2 immunity. Initial experiments showed that pigs do not have pre-existing anti-lambda antibodies and thus will not neutralize display particles used as a vaccine at primary vaccination. I produced and characterized lambda phage particles displaying four immunodominant regions of porcine circovirus 2 (PCV2) capsid protein fused to the lambda capsid protein D i.e., D-CAP, phage display particles. Expression of D-CAP in <i>Escherichia coli</i> (<i>E. coli</i>) and its presence in the vaccine preparation was shown by ELISA and Western blots using anti-PCV2 polyclonal antiserum from a gnotobiotic pig. The vaccine, lambda particles displaying PCV2 capsid protein immunogenic epitopes fused to lambda D protein (LDP-D-CAP), administered without an adjuvant induced both humoral and cellular immunity to PCV2 in conventional pigs, as shown by ELISA, Western blots, virus neutralization assay and delayed type hypersensitivity (DTH) reactions. This work produced the first potential phage vaccine to PCV2. In order to further investigate the feasibility of using the lambda display technology. I produced and characterized two additional lambda display particle preparations, LDP-D-FLAG and LDP-D-GFP, displaying a FLAG tag and the green fluorescent proteins, respectively.
79

Hyperon-Produktion und -Polarisation in der Reaktion p (3,5 GeV) + Nb mit HADES

Wendisch, Christian 08 January 2015 (has links) (PDF)
Zur Erforschung des Verhaltens der Kernmaterie wurde mit dem Dielektronen-Spektrometer HADES am GSI Helmholtzzentrum für Schwerionenforschung in Darmstadt unter anderem die Reaktion p + Nb bei 3,5 GeV kinetischer Strahlenergie untersucht. Obwohl HADES primär für den Nachweis seltener leptonischer Zerfälle der Vektormesonen ρ, ω und φ konzipiert wurde, eignet sich das Spektrometer aufgrund seiner präzisen Spurrekonstruktion auch für die Untersuchung von hadronischen Kanälen. Zum Studium der Strangeness-Signaturen in der Reaktion p + Nb wird in dieser Arbeit der im Jahr 2008 aufgezeichnete Datensatz von ca. 4,2 Milliarden Kollisionen hinsichtlich der Produktion und der dabei auftretenden Polarisation von Λ-Hyperonen untersucht. Die polarisierte Produktion von Hyperonen in Kernreaktionen mit unpolarisierten Ausgangsteilchen wurde entgegen den theoretischen Erwartungen erstmals 1976 beobachtet und fand bis heute keine allgemein akzeptierte und alle beobachteten Abhängigkeiten umfassende Erklärung auf Grundlage der starken Wechselwirkung. Es werden zunächst die theoretischen Modelle der Hyperonpolarisation diskutiert und der experimentelle Zugang erklärt. Dieser gelingt über den schwachen Zerfall des Λ-Hyperons, der als natürliches Polarimeter wirkt und somit insbesondere in Reaktionen mit unpolarisierten Nukleonen ein ideales Instrument zur Untersuchung der Polarisation darstellt. Aufgrund der großen Raumwinkelabdeckung ermöglicht HADES, Λ-Hyperonen in einem weiten Phasenraumbereich zu rekonstruieren, sodass deren Produktionsrate und Polarisation in Abhängigkeit der Observablen Transversalimpuls pt und Rapidität y analysiert werden. Aus insgesamt 1,1 Millionen rekonstruierten Λ-Hyperonen werden nach der Korrektur bezüglich der Detektorakzeptanz und -effizienz transversale Massenspektren extrahiert. Deren inverser Steigungsparameter TB (y) nimmt ein Maximum von rund 90 MeV bei y = 1, d.h. unterhalb der Schwerpunktsrapidität im Nukleon-Nukleon-Stoß (ycm = 1,12), an und fällt zu kleinen Rapiditäten deutlich schneller ab als für Teilchen im thermischen Gleichgewicht. Die Λ-Rapiditätsdichte zeigt eine asymmetrische Verteilung, die aufgrund von Mehrfachstreuung der Λ-Hyperonen hauptsächlich mit Kern-Nukleonen deutlich zur Targetrapidität verschoben ist und mit steigender Rapidität > 0,3 stark abnimmt. Auf den vollständigen Phasenraum extrapoliert, erfüllt die Produktionsrate von 0,018 ± 0,004 Λ-0 Hyperons je Ereignis, verbunden mit der Multiplizität von Ks -Mesonen und den mittels Transportmodell abgeleiteten Produktionsverhältnissen zu den übrigen Kaonen und Hyperonen, die Strangeness-Erhaltung im Mittel der gemessenen Kollisionen. Darüber hinaus zeigt das Λ-Hyperon eine signifikant negative Polarisation relativ zur Normalen seiner Produktionsebene, die über den verfügbaren Phasenraum gemittelt Px = (−10,6 ± 1,3) % beträgt und deren Betrag mit steigendem Transversalimpuls entsprechend Px (pt ) = (−0,19 ± 0,02) (GeV/c)−1 pt linear zunimmt. Die Ergebnisse bezüglich der Λ-Polarisation und Phasenraumverteilung werden mit denen anderer Experimente ähnlicher Stoßsysteme verglichen und im Rahmen von systematischen Untersuchungen mit Transportmodellen interpretiert, um Details zur Dynamik der Hyperon-Produktion in Proton-Kern-Reaktionen abzuleiten. Derzeit verfügbare Versionen der GiBUU- und UrQMD-Modelle können die experimentellen Verteilungen im Phasenraum jedoch nicht hinreichend reproduzieren. Mit der Rekonstruktion von Ξ− -Hyperonen und φ-Mesonen wird ein Ausblick auf weiterführende Studien zur Strangeness-Produktion in Nukleon-Kern-Stößen gegeben. / With the dielectron spectrometer HADES, located at the GSI Helmholtzzentrum für Schwerionenforschung in Darmstadt, p + Nb reactions at a kinetic beam energy of 3.5 GeV were measured to study the behavior of nuclear matter. Although primarily designed for the detection of rare leptonic decays of the light vector mesons ρ, ω and φ, the spectrometer renders itself very well suited for the investigation of hadrons, due to its excellent tracking capability. This thesis presents results of the production and polarization of strange Λ hyperons in about 4.2 billion reactions of p + Nb recorded in 2008. In contrast to theoretical expectations, the polarized production of hyperons was observed in 1976 for the first time in nuclear reactions with unpolarized beams. Based on the fundamental properties of strong interaction, to date no single explanation exists describing all dependencies of the observed hyperon polarization. Therefore, common theoretical models of hyperon polarization are introduced. Acting as a natural polarimeter, the Λ hyperon represents an excellent tool to study the phenomenon of hyperon polarization especially in reactions with unpolarized beams and targets. Hence, the experimental technique for extracting the polarization using the weak decay of the Λ hyperon is explained. Due to a large solid angle coverage, HADES allows for the reconstruction of hadrons within a wide phase space range. Consequently, a double-differential analysis of the polarization and production probability as a function of transverse momentum pt and rapidity y is performed. In total, 1.1 million Λ hyperons are reconstructed and corrected for detector acceptance and efficiency. The inverse slope parameter TB is extracted from transverse mass spectra. Its rapidity dependence TB (y) shows a maximum of 90 MeV at y = 1, i.e. below the center-of-mass rapidity of the nucleon-nucleon collision ycm = 1.12, and a stronger decrease to lower rapidities than particles in thermal equilibrium. The Λ rapidity density shows an asymmetric distribution, shifted towards target rapidity, which is probably caused by multiple scattering on target nucleons. Extrapolated to the full phase space, the total multiplicity of 0.018 ± 0.004 Λ hyperons per event satisfies strangeness conservati- 0 on on average. For that purpose, the Ks production rate from another analysis and ratios to the other, unmeasured, strange hadrons, derived from transport simulations, are taken into account. Furthermore, the Λ hyperon shows a significant negative polarization perpendicular to its production plane, which amounts to Px = (−10.6 ± 1.3) % averaged over the phase space accessible to HADES. The measured Λ polarization increases almost linearly with increasing transverse momentum pt , according to Px (pt ) = (−0.19 ± 0.02) (GeV/c)−1 pt . In order to spot details on the dynamics of hyperon production in proton-nucleus reactions, the results on Λ polarization and phase space distribution are compared to those of similar reactions. Additionally, a systematic investigation with transport model simulations is performed. The experimental distributions can not be reproduced sufficiently well by the presently available GiBUU and URQMD models. Moreover, an outlook on further studies of strangeness production in nucleon-nucleus collisions by reconstruction of Ξ− hyperons and φ mesons is given.
80

UM CATÁLOGO DE REFATORAÇÕES ENVOLVENDO EXPRESSÕES LAMBDA EM JAVA / A CATALOG OF REFACTORINGS INVOLVING LAMBDA EXPRESSIONS IN JAVA

Teixeira Júnior, Jânio Elias 28 August 2014 (has links)
Programming language evolution provides room for improving existing programs. Developers can upgrade their projects, applying new features available in the latest language versions. However, during maintenance activities, the code artefacts can become distant from their original conception. In this context, the use of transformation techniques and processes can be interesting, as it reduces the error-proneness when improving source code structure. Refactoring is a process of improving the design of a software system, modifying its internal structure without changing its external observable behavior. From this scenario, this work presents a refactoring catalog focused on the new features of the Java language. Such refactorings are related to lambda expressions and seek to allow the transformation of features implemented in Java 7 for the current version 8. To evaluate the proposed refactorings applicability, we developed a static analysis and used it in a set of open source projects aiming to search for opportunities to apply those refactorings. / A evolução de uma linguagem de programação fornece espaços para melhorias de programas existentes. Dessa forma, desenvolvedores podem atualizar projetos de sistemas de software, aplicando os novos recursos disponíveis na linguagem. No entanto, ao adaptar, melhorar e modificar um sistema de software, seu código pode se afastar de sua concepção original. Nesse contexto, o uso de técnicas e processos de transformação pode ser interessante, pois reduz a possibilidade de erros ao realizar uma melhoria em uma estrutura de código, por exemplo. A refatoração é um processo de melhoria do projeto de um sistema de software, que altera sua estrutura interna, sem modificar seu comportamento externo observável. A partir desse cenário, este trabalho tem como principal objetivo apresentar um catálogo de refatorações direcionadas às novas funcionalidades da linguagem Java. Tais refatorações estão relacionadas às expressões lambda e visam permitir a transformação de construções implementadas em Java 7 para sua atual versão 8. Para avaliar a aplicabilidade das refatorações propostas, um conjunto de projetos de código aberto foi submetido a uma ferramenta de análise estática, desenvolvida para realizar buscas por oportunidades de refatoração.

Page generated in 0.0346 seconds