Search

Laser wakefield electron acceleration in the blow-out regime and the associated betatron X-rayradiation were investigated experimentally as a function of the plasma density in a configuration where the laser is guided. Dielectric capillary tubes were employed to assist the laser keeping self-focused over a long distance by collecting the laser energy around its central focal spot. With a 40 fs, 16 TW pulsed laser, electron bunches with tens of pC charge were measured to be accelerated to an energy up to 300 MeV, accompanied by X-ray emission with a peak brightness of the order of 10 21 ph/s/mm 2 / mrad 2 /0.1%BW. Electron trapping and acceleration were studied using the emitted X-ray beamdistribution to map the acceleration process; the number of betatron oscillations performed by theelectrons was inferred from the correlation between measured X-ray fluence and beam charge. A studyof the stability of electron and X-ray generation suggests that the fluctuation of X-ray emission can be reduced by stabilizing the beam charge. The experimental results are in good agreement with 3D particle-in-cell (PIC) simulation. Fil: Ju, L.. Universite de Paris Xi; Francia; Fil: Svensson, K.. Lund University; Suecia Fil: Ferrari, Hugo Emilio. Comisión Nacional de Energía Atómica. Gerencia del Area de Investigación y Aplicaciones No Nucleares. Gerencia de Física (centro Atómico Bariloche); Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina Fil: Döpp, A.. Universite de Paris Xi; Francia; Fil: Cassou, K.. Universite de Paris Xi; Francia; Fil: Genoud, G.. Lund University; Suecia; Fil: Wojda, F.. Lund University; Suecia; Fil: Burza, M.. Lund University; Suecia; Fil: Persson, A.. Lund University; Suecia; Fil: Lundh, O.. Lund University; Suecia; Fil: Wahlström, C. G.. Lund University; Suecia; Fil: Cros, B.. Universite de Paris Xi; Francia

Tato pr´ace pˇredstavuje nov´e metody pro verifikaci program°u pracuj´ıc´ıch s neomezen´ymiceloˇc´ıslen´ymi promˇenn´ymi, konkr´etnˇe metody pro anal´yzu dosaˇzitelnosti a koneˇcnosti.Vˇetˇsina tˇechto metod je zaloˇzena na akceleraˇcn´ıch technik´ach, kter´e poˇc´ıtaj´ı tranzitivn´ıuz´avˇery cykl°u programu.V pr´aci je nejprve pˇredstaven algoritmus pro akceleraci nˇekolika tˇr´ıd celoˇc´ıseln´ychrelac´ı. Tento algoritmus je aˇz o ˇctyˇri ˇr´ady rychlejˇs´ı neˇz existuj´ıc´ı techniky. Z teoretick´ehohlediska pr´ace dokazuje, ˇze uvaˇzovan´e tˇr´ıdy relac´ı jsou periodick´e a poskytuje tud´ıˇzjednotn´e ˇreˇsen´ı prol´emu akcelerace.Pr´ace d´ale pˇredstavuje semi-algoritmus pro anal´yzu dosaˇzitelnosti celoˇc´ıseln´ych program°u, kter´y sleduje relace mezi promˇenn´ymi programu a aplikuje akceleraˇcn´ı technikyza ´uˇcelem modul´arn´ıho v´ypoˇctu souhrn°u procedur. D´ale je v pr´aci navrˇzen alternativn´ıalgoritmus pro anal´yzu dosaˇzitelnosti, kter´y integruje predik´atovou abstrakci s accelerac´ıs c´ılem zv´yˇsit pravdˇepodobnost konvergence v´ypoˇctu. Proveden´e experimenty ukazuj´ı, ˇzeoba algoritmy lze ´uspˇeˇsnˇe aplikovat k verifikaci program°u, na kter´ych pˇredchoz´ı metodyselh´avaly.Pr´ace se rovnˇeˇz zab´yv´a probl´emem koneˇcnosti bˇehu program°u a dokazuje, ˇze tentoprobl´em je rozhodnuteln´y pro nˇekolik tˇr´ıd celoˇc´ıseln´ych relac´ı. Pro nˇekter´e z tˇechto tˇr´ıdrelac´ı je v pr´aci navrˇzen algoritmus, kter´y v polynomi´aln´ım ˇcase vypoˇc´ıt´a mnoˇzinu vˇsechkonfigurac´ı programu, z nichˇz existuje nekoneˇcn´y bˇeh. Tento algoritmus je integrov´ando metody, kter´a analyzuje koneˇcnost bˇeh°u celoˇc´ıseln´ych program°u. Efektivnost t´etometody je demonstrov´ana na nˇekolika netrivi´aln´ıch celoˇc´ıseln´ych programech.; This work presents novel methods for verification of reachability and termination properties of programs that manipulate unbounded integer data. Most of these methods are based on acceleration techniques which compute transitive closures of program loops. We first present an algorithm that accelerates several classes of integer relations and show that the new method performs up to four orders of magnitude better than the previous ones. On the theoretical side, our framework provides a common solution to the acceleration problem by proving that the considered classes of relations are periodic. Subsequently, we introduce a semi-algorithmic reachability analysis technique that tracks relations between variables of integer programs and applies the proposed acceleration algorithm to compute summaries of procedures in a modular way. Next, we present an alternative approach to reachability analysis that integrates predicate abstraction with our acceleration techniques to increase the likelihood of convergence of the algorithm. We evaluate these algorithms and show that they can handle a number of complex integer programs where previous approaches failed. Finally, we study the termination problem for several classes of program loops and show that it is decidable. Moreover, for some of these classes, we design a polynomial time algorithm that computes the exact set of program configurations from which non-terminating runs exist. We further integrate this algorithm into a semi-algorithmic method that analyzes termination of integer programs, and show that the resulting technique can verify termination properties of several non-trivial integer programs.; Les travaux présentés dans cette thèse sont lies aux problèmes de vérification de l'atteignabilité et de la terminaison de programmes qui manipulent des données entières non-bornées. On décrit une nouvelle méthode de vérification basée sur une technique d'accélération de boucle, qui calcule, de manière exacte, la clôture transitive d'une relation arithmétique. D'abord, on introduit un algorithme d'accélération de boucle qui peut calculer, en quelques secondes, des clôtures transitives pour des relations de l'ordre d'une centaine de variables. Ensuite, on présente une méthode d'analyse de l'atteignabilité, qui manipule des relations entre les variables entières d'un programme, et applique l'accélération pour le calcul des relations entrée-sortie des procédures, de façon modulaire. Une approche alternative pour l'analyse de l'atteignabilité, présentée également dans cette thèse, intègre l'accélération avec l'abstraction par prédicats, afin de traiter le problème de divergence de cette dernière. Ces deux méthodes ont été évaluées de manière pratique, sur un nombre important d'exemples, qui étaient, jusqu'a présent, hors de la portée des outils d'analyse existants. Dernièrement, on a étudié le problème de la terminaison pour certaines classes de boucles de programme, et on a montré la décidabilité pour les relations étudiées. Pour ces classes de relations arithmétiques, on présente un algorithme qui s'exécute en temps au plus polynomial, et qui calcule l'ensemble d'états qui peuvent générer une exécution infinie. Ensuite on a intégré cet algorithme dans une méthode d'analyse de la terminaison pour des programmes qui manipulent des données entières.

Tato pr´ace pˇredstavuje nov´e metody pro verifikaci program°u pracuj´ıc´ıch s neomezen´ymiceloˇc´ıslen´ymi promˇenn´ymi, konkr´etnˇe metody pro anal´yzu dosaˇzitelnosti a koneˇcnosti.Vˇetˇsina tˇechto metod je zaloˇzena na akceleraˇcn´ıch technik´ach, kter´e poˇc´ıtaj´ı tranzitivn´ıuz´avˇery cykl°u programu.V pr´aci je nejprve pˇredstaven algoritmus pro akceleraci nˇekolika tˇr´ıd celoˇc´ıseln´ychrelac´ı. Tento algoritmus je aˇz o ˇctyˇri ˇr´ady rychlejˇs´ı neˇz existuj´ıc´ı techniky. Z teoretick´ehohlediska pr´ace dokazuje, ˇze uvaˇzovan´e tˇr´ıdy relac´ı jsou periodick´e a poskytuje tud´ıˇzjednotn´e ˇreˇsen´ı prol´emu akcelerace.Pr´ace d´ale pˇredstavuje semi-algoritmus pro anal´yzu dosaˇzitelnosti celoˇc´ıseln´ych program°u, kter´y sleduje relace mezi promˇenn´ymi programu a aplikuje akceleraˇcn´ı technikyza ´uˇcelem modul´arn´ıho v´ypoˇctu souhrn°u procedur. D´ale je v pr´aci navrˇzen alternativn´ıalgoritmus pro anal´yzu dosaˇzitelnosti, kter´y integruje predik´atovou abstrakci s accelerac´ıs c´ılem zv´yˇsit pravdˇepodobnost konvergence v´ypoˇctu. Proveden´e experimenty ukazuj´ı, ˇzeoba algoritmy lze ´uspˇeˇsnˇe aplikovat k verifikaci program°u, na kter´ych pˇredchoz´ı metodyselh´avaly.Pr´ace se rovnˇeˇz zab´yv´a probl´emem koneˇcnosti bˇehu program°u a dokazuje, ˇze tentoprobl´em je rozhodnuteln´y pro nˇekolik tˇr´ıd celoˇc´ıseln´ych relac´ı. Pro nˇekter´e z tˇechto tˇr´ıdrelac´ı je v pr´aci navrˇzen algoritmus, kter´y v polynomi´aln´ım ˇcase vypoˇc´ıt´a mnoˇzinu vˇsechkonfigurac´ı programu, z nichˇz existuje nekoneˇcn´y bˇeh. Tento algoritmus je integrov´ando metody, kter´a analyzuje koneˇcnost bˇeh°u celoˇc´ıseln´ych program°u. Efektivnost t´etometody je demonstrov´ana na nˇekolika netrivi´aln´ıch celoˇc´ıseln´ych programech., This work presents novel methods for verification of reachability and termination properties of programs that manipulate unbounded integer data. Most of these methods are based on acceleration techniques which compute transitive closures of program loops. We first present an algorithm that accelerates several classes of integer relations and show that the new method performs up to four orders of magnitude better than the previous ones. On the theoretical side, our framework provides a common solution to the acceleration problem by proving that the considered classes of relations are periodic. Subsequently, we introduce a semi-algorithmic reachability analysis technique that tracks relations between variables of integer programs and applies the proposed acceleration algorithm to compute summaries of procedures in a modular way. Next, we present an alternative approach to reachability analysis that integrates predicate abstraction with our acceleration techniques to increase the likelihood of convergence of the algorithm. We evaluate these algorithms and show that they can handle a number of complex integer programs where previous approaches failed. Finally, we study the termination problem for several classes of program loops and show that it is decidable. Moreover, for some of these classes, we design a polynomial time algorithm that computes the exact set of program configurations from which non-terminating runs exist. We further integrate this algorithm into a semi-algorithmic method that analyzes termination of integer programs, and show that the resulting technique can verify termination properties of several non-trivial integer programs., Les travaux présentés dans cette thèse sont lies aux problèmes de vérification de l'atteignabilité et de la terminaison de programmes qui manipulent des données entières non-bornées. On décrit une nouvelle méthode de vérification basée sur une technique d'accélération de boucle, qui calcule, de manière exacte, la clôture transitive d'une relation arithmétique. D'abord, on introduit un algorithme d'accélération de boucle qui peut calculer, en quelques secondes, des clôtures transitives pour des relations de l'ordre d'une centaine de variables. Ensuite, on présente une méthode d'analyse de l'atteignabilité, qui manipule des relations entre les variables entières d'un programme, et applique l'accélération pour le calcul des relations entrée-sortie des procédures, de façon modulaire. Une approche alternative pour l'analyse de l'atteignabilité, présentée également dans cette thèse, intègre l'accélération avec l'abstraction par prédicats, afin de traiter le problème de divergence de cette dernière. Ces deux méthodes ont été évaluées de manière pratique, sur un nombre important d'exemples, qui étaient, jusqu'a présent, hors de la portée des outils d'analyse existants. Dernièrement, on a étudié le problème de la terminaison pour certaines classes de boucles de programme, et on a montré la décidabilité pour les relations étudiées. Pour ces classes de relations arithmétiques, on présente un algorithme qui s'exécute en temps au plus polynomial, et qui calcule l'ensemble d'états qui peuvent générer une exécution infinie. Ensuite on a intégré cet algorithme dans une méthode d'analyse de la terminaison pour des programmes qui manipulent des données entières.

Como resposta às exigências do mundo actual, a projecção e construção de estruturas sofreram grandes alterações, assistindo-se à construção de estruturas cada vez mais esbeltas, integradas no ambiente circundante, transparentes, ousadas. Consequentemente a sua concepção constituí um desafio que é suportado por avanços na arte da engenharia, novos materiais e pela sensibilidade dos projectistas. Neste sentido as passagens superiores de peões não constituem excepção. São construídas desde os tempos remotos porém, hoje, querem-se mais ousadas, esbeltas, transparentes, integradas no ambiente circundante, económicas e eficientes, como forma de responder às exigências do mundo actual. Inicialmente forma de vencer obstáculos naturais, são hoje em dia, um meio para vencer a forte obstáculos inerentes as modificações da rede viária e à forte ocupação do espaço, fruto da crescente urbanização. Estas estruturas têm carregamentos baixos, o que possibilita a construção de vãos longos com esbeltas secções transversais, tornando-se estruturas muito flexíveis, com reduzida massa e rigidez, de que resultam frequências próprias de vibração baixas conduzindo a uma maior sensibilidade às vibrações. Com a construção das novas Vias Rápidas na ilha da Madeira, houve a necessidade de repor acessos pedonais por meio destas pontes. Apesar de existirem várias destas pontes, são essencialmente de dois tipos: de tabuleiro em treliça espacial mista ou tabuleiro do tipo “bi-viga” mista. Assim, no âmbito de um estágio na empresa Estradas da Madeira (RAMEDM, S.A.), procurou-se estudar uma ponte de cada um dos tipos mencionados, com intuito de compreender a acção pedonal, as suas características e formas de simular verificando a eficiência de ambos os modelos, os níveis de conforto que oferecem, e a segurança face aos valores limites apresentados nalguns regulamentos. Construíram-se modelos computacionais usando o programa SAP2000, nos quais se simulou quatro movimentos característicos da acção pedonal (andamento normal, andamento acelerado, jogging e corrida), através das respectivas funções de carga. Por já se encontrar construído, o tabuleiro em treliça mista foi ensaiado, de forma a validar o modelo computacional. Verificou-se que as frequências obtidas no modelo são próximas das reais. Verificou-se que ambos os modelos, apresentam um bom comportamento no que concerne às vibrações na direcção transversal, já que têm frequências de vibração suficientemente afastadas da gama excitável pela acção humana. Quanto às vibrações na direcção vertical, uma vez que ambos os tabuleiros têm frequências fundamentais coincidentes com as frequências de alguns dos movimentos simulados, verificaram-se acelerações acentuadas. O estudo destas estruturas mostrou em traços genéricos, que além das vantagens construtivas, ambos os modelos apresentam bom comportamento à acção pedonal. As an answer to today’s world demands, the projection and construction of structures has suffered great changes, so that we have been watching the build of structures increasingly slim, integrated in the surrounding environment, transparent and bold. Thus their conception constitutes a challenge that is supported by advances in the art of engineering and new materials. In this regard pedestrian bridges are no exception. Built since ancient times to overcome natural obstacles, today they have to be bolder, slender, and transparent, integrated into the surrounding environment, economic and efficient, as a way to respond to the societies requirements. They are a way to overcome obstacles inherent to the strong development of road net and the heavy use of space as the result of the growing urbanization. Their low level of loading allows the construction of long spans with slender cross-sections, reduced mass and stiffness, leading to low vibration frequencies and greater sensitivity to vibrations. With the construction of news expressways in Madeira, it was necessary to restore some pedestrian access through these bridges. Although there are several of these bridges, they have essentially two deck configurations: composite space truss and composite “two-beam”. In the context of a traineeship in the company Estradas da Madeira (RAMEDM, S.A.), it was looked to study a bridge of each of the mentioned types, to understand the pedestrian action, their characteristics and ways of verifying the efficiency of both models , the comfort levels they offer and the security face to the limits presented in some regulations. To carry out this study, it had been constructed two numeric models using the computational program SAP 2000, in each it was simulated four characteristic movements of pedestrian action, by their load functions. Once that the space truss deck was already built some tests have been performed, in order to validate the numeric model. It was found that the frequencies obtained in the model are very close to the real ones. Both models have shown a good behavior to vibrations in the transverse direction, since the transverse frequencies are far enough from the range of human action. The vibration in vertical direction is very pronounced, since both decks have fundamental frequencies close to the frequency of some of the simulated movements.

Submitted by Ana Lavado (sofialavado@yahoo.com) on 2012-03-05T12:26:54Z No. of bitstreams: 1 Desenvolvimento do Sistema de Tracção de um Veículo Eléctrico Ecológico com Travagem Regenerativa.pdf: 194222 bytes, checksum: bdc245b72952ac70501ff834bd8e60a1 (MD5) Made available in DSpace on 2012-03-05T12:26:54Z (GMT). No. of bitstreams: 1 Desenvolvimento do Sistema de Tracção de um Veículo Eléctrico Ecológico com Travagem Regenerativa.pdf: 194222 bytes, checksum: bdc245b72952ac70501ff834bd8e60a1 (MD5) Previous issue date: 2011-12