• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 326
  • 89
  • 39
  • 33
  • 31
  • 12
  • 8
  • 7
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 647
  • 114
  • 96
  • 64
  • 61
  • 61
  • 58
  • 55
  • 53
  • 52
  • 50
  • 45
  • 43
  • 40
  • 38
  • 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.
161

On-line Controller Tuning By Matlab Using Real System Responses

Pektas, Seda 01 December 2004 (has links) (PDF)
This thesis attempts to tune any controller without the mathematical model knowledge of the system it is controlling. For that purpose, the optimization algorithm of MATLAB&reg / 6.5 / Nonlinear Control Design Blockset (NCD) is adapted for real-time executions and combined with a hardware-in-the-loop simulation provided by MATLAB&reg / 6.5 / Real-Time Windows Target (RTWT). A noise-included model of a DC motor position control system is obtained in MATLAB&reg / / SIMULINK first and simulated to test the modified algorithm in some aspects. Then the presented methodology is verified using the physical plant (DC motor position control system) where tuning algorithm is driven mainly by the real system data and the required performance parameters specified by a user defined constraint window are successfully satisfied. Resultant improvements on the step response behavior of DC motor position control system are shown for two case studies.
162

Méthodes numériques pour la résolution accélérée des systèmes linéaires de grandes tailles sur architectures hybrides massivement parallèles / Numerical methods for the accelerated resolution of large scale linear systems on massively parallel hybrid architecture

Cheik Ahamed, Abal-Kassim 07 July 2015 (has links)
Les progrès en termes de puissance de calcul ont entraîné de nombreuses évolutions dans le domaine de la science et de ses applications. La résolution de systèmes linéaires survient fréquemment dans le calcul scientifique, comme par exemple lors de la résolution d'équations aux dérivées partielles par la méthode des éléments finis. Le temps de résolution découle alors directement des performances des opérations algébriques mises en jeu.Cette thèse a pour but de développer des algorithmes parallèles innovants pour la résolution de systèmes linéaires creux de grandes tailles. Nous étudions et proposons comment calculer efficacement les opérations d'algèbre linéaire sur plateformes de calcul multi-coeur hétérogènes-GPU afin d'optimiser et de rendre robuste la résolution de ces systèmes. Nous proposons de nouvelles techniques d'accélération basées sur la distribution automatique (auto-tuning) des threads sur la grille GPU suivant les caractéristiques du problème et le niveau d'équipement de la carte graphique, ainsi que les ressources disponibles. Les expérimentations numériques effectuées sur un large spectre de matrices issues de divers problèmes scientifiques, ont clairement montré l'intérêt de l'utilisation de la technologie GPU, et sa robustesse comparée aux bibliothèques existantes comme Cusp.L'objectif principal de l'utilisation du GPU est d'accélérer la résolution d'un problème dans un environnement parallèle multi-coeur, c'est-à-dire "Combien de temps faut-il pour résoudre le problème?". Dans cette thèse, nous nous sommes également intéressés à une autre question concernant la consommation énergétique, c'est-à-dire "Quelle quantité d'énergie est consommée par l'application?". Pour répondre à cette seconde question, un protocole expérimental est établi pour mesurer la consommation d'énergie d'un GPU avec précision pour les opérations fondamentales d'algèbre linéaire. Cette méthodologie favorise une "nouvelle vision du calcul haute performance" et apporte des réponses à certaines questions rencontrées dans l'informatique verte ("green computing") lorsque l'on s'intéresse à l'utilisation de processeurs graphiques.Le reste de cette thèse est consacré aux algorithmes itératifs synchrones et asynchrones pour résoudre ces problèmes dans un contexte de calcul hétérogène multi-coeur-GPU. Nous avons mis en application et analysé ces algorithmes à l'aide des méthodes itératives basées sur les techniques de sous-structurations. Dans notre étude, nous présentons les modèles mathématiques et les résultats de convergence des algorithmes synchrones et asynchrones. La démonstration de la convergence asynchrone des méthodes de sous-structurations est présentée. Ensuite, nous analysons ces méthodes dans un contexte hybride multi-coeur-GPU, qui devrait ouvrir la voie vers les méthodes hybrides exaflopiques.Enfin, nous modifions la méthode de Schwarz sans recouvrement pour l'accélérer à l'aide des processeurs graphiques. La mise en oeuvre repose sur l'accélération par les GPUs de la résolution locale des sous-systèmes linéaires associés à chaque sous-domaine. Pour améliorer les performances de la méthode de Schwarz, nous avons utilisé des conditions d'interfaces optimisées obtenues par une technique stochastique basée sur la stratégie CMA-ES (Covariance Matrix Adaptation Evolution Strategy). Les résultats numériques attestent des bonnes performances, de la robustesse et de la précision des algorithmes synchrones et asynchrones pour résoudre de grands systèmes linéaires creux dans un environnement de calcul hétérogène multi-coeur-GPU. / Advances in computational power have led to many developments in science and its applications. Solving linear systems occurs frequently in scientific computing, as in the finite element discretization of partial differential equations. The running time of the overall resolution is a direct result of the performance of the involved algebraic operations.In this dissertation, different ways of efficiently solving large and sparse linear systems are put forward. We present the best way to effectively compute linear algebra operations in an heterogeneous multi-core-GPU environment in order to make solvers such as iterative methods more robust and therefore reduce the computing time of these systems. We propose new techniques to speed algorithms up the auto-tuning of the threading design, according to the problem characteristics and the equipment level in the hardware and available resources. Numerical experiments performed on a set of large-size sparse matrices arising from diverse engineering and scientific problems, have clearly shown the benefit of the use of GPU technology to solve large sparse systems of linear equations, and its robustness and accuracy compared to existing libraries such as Cusp.The main priority of the GPU program is computational time to obtain the solution in a parallel environment, i.e, "How much time is needed to solve the problem?". In this thesis, we also address another question regarding energy issues, i.e., "How much energy is consumed by the application?". To answer this question, an experimental protocol is established to measure the energy consumption of a GPU for fundamental linear algebra operations accurately. This methodology fosters a "new vision of high-performance computing" and answers some of the questions outlined in green computing when using GPUs.The remainder of this thesis is devoted to synchronous and asynchronous iterative algorithms for solving linear systems in the context of a multi-core-GPU system. We have implemented and analyzed these algorithms using iterative methods based on sub-structuring techniques. Mathematical models and convergence results of synchronous and asynchronous algorithms are presented here, as are the convergence results of the asynchronous sub-structuring methods. We then analyze these methods in the context of a hybrid multi-core-GPU, which should pave the way for exascale hybrid methods.Lastly, we modify the non-overlapping Schwarz method to accelerate it, using GPUs. The implementation is based on the acceleration of the local solutions of the linear sub-systems associated with each sub-domain using GPUs. To ensure good performance, optimized conditions obtained by a stochastic technique based on the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) are used. Numerical results illustrate the good performance, robustness and accuracy of synchronous and asynchronous algorithms to solve large sparse linear systems in the context of an heterogeneous multi-core-GPU system.
163

Content Adaption and Design In Mobile Learning of Wind Instruments

Priyadarshani, Neha January 2021 (has links)
No description available.
164

Probing and modeling of optical resonances in rolled-up structures

Li, Shilong 30 January 2015 (has links) (PDF)
Optical microcavities (OMs) are receiving increasing attention owing to their potential applications ranging from cavity quantum electrodynamics, optical detection to photonic devices. Recently, rolled-up structures have been demonstrated as OMs which have gained considerable attention owing to their excellent customizability. To fully exploit this customizability, asymmetric and topological rolled-up OMs are proposed and investigated in addition to conventional rolled-up OMs in this thesis. By doing so, novel phenomena and applications are demonstrated in OMs. The fabrication of conventional rolled-up OMs is presented in details. Then, dynamic mode tuning by a near-field probe is performed on a conventional rolled-up OM. Next, mode splitting in rolled-up OMs is investigated. The effect of single nanoparticles on mode splitting in a rolled-up OM is studied. Because of a non-synchronized oscillating shift for different azimuthal split modes induced by a single nanoparticle at different positions, the position of the nanoparticle can be determined on the rolled-up OM. Moreover, asymmetric rolled-up OMs are fabricated for the purpose of introducing coupling between spin and orbital angular momenta (SOC) of light into OMs. Elliptically polarized modes are observed due to the SOC of light. Modes with an elliptical polarization can also be modeled as coupling between the linearly polarized TE and TM mode in asymmetric rolled-up OMs. Furthermore, by adding a helical geometry to rolled-up structures, Berry phase of light is introduced into OMs. A -π Berry phase is generated for light in topological rolled-up OMs so that modes have a half-integer number of wavelengths. In order to obtain a deeper understanding for existing rolled-up OMs and to develop the new type of rolled-up OMs, complete theoretical models are also presented in this thesis.
165

Probing and modeling of optical resonances in rolled-up structures

Li, Shilong 22 January 2015 (has links)
Optical microcavities (OMs) are receiving increasing attention owing to their potential applications ranging from cavity quantum electrodynamics, optical detection to photonic devices. Recently, rolled-up structures have been demonstrated as OMs which have gained considerable attention owing to their excellent customizability. To fully exploit this customizability, asymmetric and topological rolled-up OMs are proposed and investigated in addition to conventional rolled-up OMs in this thesis. By doing so, novel phenomena and applications are demonstrated in OMs. The fabrication of conventional rolled-up OMs is presented in details. Then, dynamic mode tuning by a near-field probe is performed on a conventional rolled-up OM. Next, mode splitting in rolled-up OMs is investigated. The effect of single nanoparticles on mode splitting in a rolled-up OM is studied. Because of a non-synchronized oscillating shift for different azimuthal split modes induced by a single nanoparticle at different positions, the position of the nanoparticle can be determined on the rolled-up OM. Moreover, asymmetric rolled-up OMs are fabricated for the purpose of introducing coupling between spin and orbital angular momenta (SOC) of light into OMs. Elliptically polarized modes are observed due to the SOC of light. Modes with an elliptical polarization can also be modeled as coupling between the linearly polarized TE and TM mode in asymmetric rolled-up OMs. Furthermore, by adding a helical geometry to rolled-up structures, Berry phase of light is introduced into OMs. A -π Berry phase is generated for light in topological rolled-up OMs so that modes have a half-integer number of wavelengths. In order to obtain a deeper understanding for existing rolled-up OMs and to develop the new type of rolled-up OMs, complete theoretical models are also presented in this thesis.
166

Novel Closed-Loop Matching Network Topology for Reconfigurable Antenna Applications

Smith, Nathanael J. 21 May 2014 (has links)
No description available.
167

Harry Partch: And on the Seventh Day Petals Fell on Petaluma

Nicholl, Matthew James 08 1900 (has links)
Harry Partch's tuning system is an important contribution to tuning theory, and his music is original and significant. Part One of this study presents a brief biography of Partch, a discussion of his musical aesthetics (Monophony and Corporeality), and a technical summary of his tuning system. These elements are placed in historical perspective. Part Two presents a comprehensive analysis of "And on the Seventh Day Petals Fell on Petaluma," discussing the organization of formal, textural, rhythmic, linear, and tonal elements in the thirty-four "verses" of the work. Part Two concludes by showing how large-scale structure in the work is achieved through an overlay process.
168

A guitarra dos séculos XVII e XVIII em seus aspectos técnicos e estilístico-históricos através da tradução comentada e análise do Instruccion de musica sobre la guitarra española de Gaspar Sanz, 1697 / -

Affonso, Guilherme de Camargo Barros 30 April 2015 (has links)
Este trabalho se ocupa da tradução comentada para o português do Instruccion de Musica sobre la Guitarra Espanõla, de Gaspar Sanz (1697), um dos mais importantes livros de repertório e de instruções de como tocar a guitarra de cinco ordens, que ora denominamos guitarra barroca. A tradução procura contextualizar o texto de Sanz, levando ao leitor, mesmo aquele não habituado à leitura dos tratados dos séculos XVII e XVIII, subsídios que lhe permitam compreender o texto e tirar utilidade prática de seu conteúdo. Assim como o Instruccion, o trabalho aborda temas os mais diversos concernentes à guitarra barroca: música solística, para a compreensão da qual a afinação reentrante mostra-se essencial, música de acompanhamento em suas diferentes vertentes, Rasqueado, Ponteado e Obbligato, instruções de afinação, ornamentação, escolha das cordas e diferentes afinações. Abrange também, embora não como objetivo principal, uma proposta de metodologia para transcrição da tablatura original, levando em conta a afinação reentrante modificada. Os comentários sobre o vasto conteúdo do Instruccion baseiam-se na leitura da obra de Sanz, no cotejamento com outras fontes primárias e secundárias, mas também, e não menos importante, na minha experiência como instrumentista de cordas dedilhadas antigas há mais de quinze anos. Todos os exemplos e transcrições trazem o fac-símile para confronto, convidando o leitor a exercer sua curiosidade em relação às fontes primárias e fazendo disto, de fato, seu principal objetivo. / This work deals with the commented translation into Portuguese of the Instruccion de Musica sobre la Guitarra Española , by Gaspar Sanz (1697), one of the most important books of repertoire and instructions on how to play the five orders guitar, we now call baroque guitar. This translation aims to contextualize Sanz\'s, text, leading the reader, even those not used to reading the treaties of the seventeenth and eighteenth centuries, subsidies to help understanding the text and make practical use of it\'s content. As the Instruccion, this work addresses the most diverse topics concerning the baroque guitar: solo music, where reentrant tuning shows to be essential to their understanding, accompanying music in its various aspects, rasqueado, ponteado and obbligato, ornamentation, choice of chords and different tunings. It also covers, although not as its main objective, a proposed methodology for transcription of the original tablature, taking into account the modified reentrant tuning. Comments on the vast content of the Instruccion are based on the reading of Sanz\'s work in mutual comparison with other primary and secondary sources, but also, and not least, in my experience as a player of early plucked strings over fifteen years. All examples and transcriptions bring also the facsimile, inviting the reader to exercise their curiosity about primary sources and making it in fact their main goal.
169

Automatic Monte-Carlo tuning for minimum bias events at the LHC

Kama, Sami 25 February 2011 (has links)
Der Large Hadron Collider am CERN bei Genf, Schweiz, wird Protonen bei einer Schwerpunktsenergie von 14 TeV und Luminosität von 1034 cm-2 s-1 alle 25 ns kollidieren. Dabei enstehen per Strahkreuzung ca. 20 zusätzliche Proton-Proton-Wechselwirkungen, deren überlagerte Signale vom ATLAS Detektor gemessen werden. Diese Ereignisse müssen möglichst präzise verstanden werden, um neuartige physikalische Phänomene entdecken zu können, aber auch um das Verständnis bereits bestehender Konzepte zu verbesssern, die diese weichen Wechselwirkungen quantitativ beschreiben. In Monte-Carlo (MC) Generatoren wie EPOS, PHOJET und PYTHIA sind solche phänomenologischen Modelle weicher Prozesse eingebunden. Allerdings sind sie vielfach parametrisierbar und müssen mit experimentellen Daten angepasst werden. In dieser Arbeit wurde eine neue Methode entwickelt die auf genetischen Algorithmen und verteilten Analysetechniken basiet, um diese MC-Parameter anzupassen. Sie stellt einen alternativen Ansatz zu derzeit verfügbaren Methode wie PROFESSOR dar mit dem Vorteil, dass die Suche nach geeigneten Modellparametern automatisiert ist. Die Ergebnisse wurden mit den MC-Generatoren EPOS und PHOJET und Daten von UA5 CDF, CMS und ATLAS verglichen, wobei eine Reihe von charakteristischen Verteilungen untersucht wurde. Auch Vorhersagen für LHC-Energien werden auf Generatorlevel wie auch nach kompletter ATLAS-Detektor-Simulation präsentiert. Datenvergleiche beveoruzugen nicht eindeutig eines der in die Generatoren imple- mentierten Modelle, jedoch beschreibt EPOS die untersuchten Verteilungen etwas besser. Neue Daten von ATLAS und CMS zeigen höhere Multiplizitäten als erwartet und einen schnelleren Anstieg der zentralen Multiplizität mit der Schwerpunktsen- ergie. / The Large Hadron Collider near Geneva Switzerland will ultimately collide protons(p) at a center-of-mass(sqrt(s)) energy of 14 TeV and 40 MHz bunch crossing rate with a luminosity of 10^34cm^-2s^-1. At each bunch crossing about 20 soft p-p interactions are expected to happen. In order to study new phenomena and improve our current knowledge of the physics these events must be understood. However, the physics of soft interactions are not completely known at such high energies. Different phenomenological models, trying to explain these interactions, are implemented in several Monte-Carlo (MC) programs such as PYTHIA, PHOJET and EPOS. Some parameters in such MC programs can be tuned to improve the agreement with the data. In this thesis a new method for tuning the MC programs, based on Genetic Algorithms (GA) and distributed analysis techniques have been presented. This method represents the first and fully automated MC tuning technique that is based on true MC distributions. It is an alternative to parametrization-based automatic tuning. This new method is used in finding new tunes for PYTHIA 6 and 8. These tunes are compared to the tunes found by alternative methods and found to be equivalent or better. Charged particle multiplicity, dN_{ch}/d\eta, Lorentz-invariant yield, p_{T} and distributions at various sqrt(s) are generated using default tunes of EPOS, PHOJET and the GA tunes of PYTHIA 6 and 8. These distributions are compared to measurements from UA5, CDF, CMS and ATLAS in order to investigate the best model available. Their predictions for the ATLAS detector at LHC energies have been investigated both with generator level and full detector simulation studies. Comparison with the data did not favor any model implemented in the generators, but EPOS is found to describe investigated distributions better. New data from ATLAS and CMS show higher than expected multiplicities and a faster rise with the sqrt(s) in central particle multiplicity.
170

Automatização do processo de seleção de transformações para otimização do tempo de execução por meio de aprendizado de máquina no arcabouço da LLVM. / Transformation selection process automation for execution time optimization through machine learning on LLVM framework.

Sabaliauskas, Jorge Augusto 28 April 2015 (has links)
A rápida evolução do hardware demanda uma evolução contínua dos compiladores. Um processo de ajuste deve ser realizado pelos projetistas de compiladores para garantir que o código gerado pelo compilador mantenha uma determinada qualidade, seja em termos de tempo de processamento ou outra característica pré-definida. Este trabalho visou automatizar o processo de ajuste de compiladores por meio de técnicas de aprendizado de máquina. Como resultado os planos de compilação obtidos usando aprendizado de máquina com as características propostas produziram código para programas cujos valores para os tempos de execução se aproximaram daqueles seguindo o plano padrão utilizado pela LLVM. / The fast evolution of hardware demands a continue evolution of the compilers. Compiler designers must perform a tuning process to ensure that the code generated by the compiler maintain a certain quality, both in terms of processing time or another preset feature. This work aims to automate compiler adjustment process through machine learning techniques. As a result the compiler plans obtained using machine learning with the proposed features had produced code for programs whose values for the execution times approached those following the standard plan used by LLVM.

Page generated in 0.0321 seconds