Thesis deal with tuning of database Oracle, which is used by digital archive SAFE. In the concrete deal with setting parameters of database. It is divided to three parts. In first part it characterizes factors that influence performance of database. In second part it describes possibilities of tuning and setting Oracle database. In third part it is first introduced digital archive SAFE, after that it is chosen suitable testing tool for workload generation and described test scenarios and last are performed tests and compared results at different database database settings. Goal of thesis is description and trial tuning of Oracle database, which is used by digital archive SAFE. Other goal is test of files inserting into digital archive at different settings (saving to the database, on file system). These goals are achieved by testing tool workload generation and compare response time at different settings. Contribution of this thesis is above all trial of tuning Oracle database, which is used by digital archive SAFE. Document can be used like handbook for implementatory of tested implementation of digital archive SAFE.

Silicon photonics is a very promising technology for future low-cost high-bandwidth optical telecommunication applications down to the chip level. This is due to the high degree of integration, high optical bandwidth and large speed coupled with the development of a wide range of integrated optical functions. Silicon-based microring resonators are a key building block that can be used to realize many optical functions such as switching, multiplexing, demultiplaxing and detection of optical wave. The ability to tune the resonances of the microring resonators is highly desirable in many of their applications. In this work, the study and application of a thermally wavelength-tunable photonic switch based on silicon microring resonator is presented. Devices with 10µm diameter were systematically studied and used in the design. Its resonance wavelength was tuned by thermally induced refractive index change using a designed local micro-heater. While thermo-optic tuning has moderate speed compared with electro-optic and all-optic tuning, with silicon’s high thermo-optic coefficient, a much wider wavelength tunable range can be realized. The device design was verified and optimized by optical and thermal simulations. The fabrication and characterization of the device was also implemented. The microring resonator has a measured FSR of ~18 nm, FWHM in the range 0.1-0.2 nm and Q around 10,000. A wide tunable range (>6.4 nm) was achieved with the switch, which enables dense wavelength division multiplexing (DWDM) with a channel space of 0.2nm. The time response of the switch was tested on the order of 10 us with a low power consumption of ~11.9mW/nm. The measured results are in agreement with the simulations. Important applications using the tunable photonic switch were demonstrated in this work. 1×4 and 4×4 reconfigurable photonic switch were implemented by using multiple switches with a common bus waveguide. The results suggest the feasibility of on-chip DWDM for the development of large-scale integrated photonics. Using the tunable switch for output wavelength control, a fiber laser was demonstrated with Erbium-doped fiber amplifier as the gain media. For the first time, this approach integrated on-chip silicon photonic wavelength control.

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-07-12T13:16:29Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) tese_doutorado_amilcar-07-2016_versao-cd (1).pdf: 2101060 bytes, checksum: 21d268c59ad60238bce0cde073e6f3cd (MD5) / Made available in DSpace on 2017-07-12T13:16:29Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) tese_doutorado_amilcar-07-2016_versao-cd (1).pdf: 2101060 bytes, checksum: 21d268c59ad60238bce0cde073e6f3cd (MD5) Previous issue date: 2016-03-10 / A popularização de tecnologias de captura de dados geolocalizados aumentou a quantidade de dados de trajetórias disponível para análise. Trajetórias de objetos móveis são geradas a partir das posições de um objeto que se move durante um certo intervalo de tempo no espaço geográfico. Para diversas aplicações é necessário que as trajetórias sejam divididas em partições menores, denominadas segmentos, que representam algum comportamento relevante para a aplicação. A literatura reporta diversos trabalhos que propõem a segmentação de trajetórias. Entretanto, pouco se discute a respeito de quais algoritmos são mais adequados para um domínio ou quais valores de parâmetros de entrada fazem com que um algoritmo obtenha o melhor desempenho neste mesmo domínio. A grande maioria dos algoritmos de segmentação de trajetórias utiliza critérios pré-definidos para realizar esta tarefa. Poucos trabalhos procuram utilizar critérios nos quais não se sabe a priori que tipos de segmentos são gerados, sendo esta questão pouco explorada na literatura. Outra questão em aberto é o uso de exemplos para induzir um algoritmo de segmentação a encontrar segmentos semelhantes a estes exemplos em outras trajetórias. Esta proposta de tese objetiva resolver estas questões. Primeiro, são propostos os métodos GEnetic Algorithm based on Roc analysis (GEAR) e o Iterated F-Race for Trajectory Segmentation Algorithms (I/F-Race-TSA), que são métodos para auxiliar na escolha da melhor configuração (i.e. valores de parâmetros de entrada) de algoritmos de segmentação de trajetórias. Segundo, é proposto o Greedy Randomized Adaptive Search Procedure for Unsupervised Trajectory Segmentation (GRASP-UTS), com o objetivo de resolver o problema de segmentação de trajetórias quando o critério de segmentação não é previamente definido. Por último, propomos o GRASP for Semi-supervised Trajectory Segmentation (GRASP-SemTS). O GRASP-SemTS usa exemplos para induzir a tarefa de segmentação a encontrar segmentos semelhantes em outras trajetórias. Foram conduzidos experimentos com os métodos e algoritmos propostos para domínios distintos e para trajetórias reais de objetos móveis. Os resultados mostraram que ambos os métodos GEAR e I/F-Race-TSA foram capazes de calibrar automaticamente os parâmetros de entrada de algoritmos de segmentação de trajetórias para um dado domínio de aplicação. Os algoritmos GRASP-UTS e GRASP-SemTS obtiveram melhor desempenho quando comparados a outros algoritmos de segmentação de trajetórias da literatura contribuindo assim com importantes resultados para a área. / The popularization of technologies for geolocated data increased the amount of trajectory data available for analysis. Moving objects’ trajectories are generated from the positions of an object that moves in the geographical space during a certain amount of time. For many applications, it is necessary to partition trajectories into smaller pieces, named segments, which represent a relevant behavior to the application point of view. The literature reports many studies that propose trajectory segmentation approaches. However, there is a lack of discussions about which algorithm is more likely to be applied in a domain or which values of its input parameters obtain the best performance in the domain. Most algorithms for trajectory segmentation use pre-defined criteria to perform this task. Only few works make use of criteria where the characteristics of the segment are not known a priori and this topic is not well explored in the literature. Another open question is how to use a small amount of labeled segments to induce a segmentation algorithm in order to find such kind of behaviors into unseen trajectories. This thesis proposal aims to solve these questions. First, we propose the GEnetic Algorithm based on Roc analysis (GEAR) and the Iterated F-Race for Trajectory Segmentation Algorithms (I/F-RaceTSA), which are methods that are able to find the best configuration (i.e. input parameter values) of algorithms for trajectory segmentation. Second, we propose a Greedy Randomized Adaptive Search Procedure for Unsupervised Trajectory Segmentation (GRASP-UTS) aiming to solve the trajectory segmentation problem when the criteria is not determined a priori. Last, we propose the GRASP for Semi-supervised Trajectory Segmentation (RGRASP-SemTS). The GRASP-SemTS solves the problem of using a small amount of labeled data to induce the trajectory segmentation algorithm to find such behaviors into unseen trajectories. Experiments were conducted with the methods and algorithms algorithms using real world trajectory data. Results showed that GEAR and I/F-Race-TSA are capable of finding automatically the input parameter values for a domain. The GRASP-UTS and GRASP-SemTS obtained a better performance when compared to other segmentation algorithms from literature, contributing with important results for this field.

Aprendizado de máquina é uma área de pesquisa na qual se investiga como desenvolver sistemas capazes de aprender com a experiência. Muitos algoritmos de aprendizado possuem parâmetros cujos valores devem ser especificados pelo usuário. Em geral, esses valores influenciam diretamente no processo de aquisição do conhecimento, podendo gerar diferentes modelos. Recentemente, algoritmos de otimização bioinspirados têm sido aplicados com sucesso no ajuste de parâmetros de técnicas de aprendizado de máquina. Essas técnicas podem apresentar diferentes sensibilidades em relação aos valores escolhidos para seus parâmetros e diferentes algoritmos de ajuste de parâmetros podem apresentar desempenhos singulares. Esta dissertação investiga a utilização de algoritmos bioinspirados para o ajuste de parâmetros de redes neurais artificiais e máquinas de vetores de suporte em problemas de classificação. O objetivo dessa investigação é verificar quais são as técnicas que mais se beneficiam do ajuste de parâmetros e quais são os algoritmos mais eficientes para essas técnicas. Os resultados experimentais mostram que os algoritmos bioinspirados conseguem encontrar melhores clasificadores que outras abordagens. Porém, essa melhoria é estatisticamente significativa para alguns conjuntos de dados. Foi possível verificar que o uso dos valores padrão para os parâmetros das técnicas de classificação leva a desempenhos similares aos obtidos com os algoritmos bioinspirados. Entretanto, para alguns conjuntos de dados, o ajuste de parâmetros pode melhorar significativamente o desempenho dos classificadores / Machine learning is a research area whose main goal is to design computational systems capable of learning through experience. Many machine learning techniques have free parameters whose values are generally defined by the user. Usually, these values affect the knowledge acquisition process directly, resulting in different models. Recently, bioinspired optimization algorithms have been successfully applied to the parameter tuning of machine learning techniques. These techniques may present variable sensitivity to the selection of the values of its parameters and different parameter tuning algorithms may present different behaviors. This thesis investigates the use of bioinspired algorithms for the parameter tuning of artificial neural networks and support vector machines in classification problems. The goal of this thesis is to investigate which techniques benefits most from parameter tuning and which are the most efficient algorithms to use with these techniques. Experimental results show that these bioinspired algorithms can find better classifiers when compared to other approaches. However, this improvement is statistically significant only to some datasets. It was possible to verify that the use of standard parameter values for the classification techniques leads to similar performances to those obtained with the bioinspired algorithms. However, for some datasets, the parameter tuning may significantly improve a classifier performance

A exploração eficiente do paralelismo no nível de threads tem sido um desafio para os desenvolvedores de softwares. Como muitas aplicações não escalam com o número de núcleos, aumentar cegamente o número de threads pode não produzir os melhores resultados em desempenho ou energia. No entanto, a tarefa de escolher corretamente o número ideal de threads não é simples: muitas variáveis estão envolvidas (por exemplo, saturação do barramento off-chip e sobrecarga de sincronização de dados), que mudam de acordo com diferentes aspectos do sistema (por exemplo, conjunto de entrada, micro-arquitetura) e mesmo durante a execução da aplicação. Para abordar esse complexo cenário, esta tese apresenta Aurora. Ela é capaz de encontrar automaticamente, em tempo de execução e com o mínimo de sobrecarga, o número ideal de threads para cada região paralela da aplicação e se readaptar nos casos em que o comportamento de uma região muda durante a execução. Aurora trabalha com o OpenMP e é completamente transparente tanto para o programador quanto para o usuário final: dado um binário de uma aplicação OpenMP, Aurora o otimiza sem nenhuma transformação ou recompilação de código. Através da execução de quinze benchmarks conhecidos em quatro processadores multi-core, mostramos que Aurora melhora o trade-off entre desempenho e energia em até: 98% sobre a execução padrão do OpenMP; 86% sobre o recurso interno do OpenMP que ajusta dinamicamente o número de threads; e 91% quando comparado a uma emulação do feedback-driven threading. / Efficiently exploiting thread-level parallelism has been challenging for software developers. As many parallel applications do not scale with the number of cores, blindly increasing the number of threads may not produce the best results in performance or energy. However, the task of rightly choosing the ideal amount of threads is not straightforward: many variables are involved (e.g. off-chip bus saturation and overhead of datasynchronization), which will change according to different aspects of the system at hand (e.g., input set, micro-architecture) and even during execution. To address this complex scenario, this thesis presents Aurora. It is capable of automatically finding, at run-time and with minimum overhead, the optimal number of threads for each parallel region of the application and re-adapt in cases the behavior of a region changes during execution. Aurora works with OpenMP and is completely transparent to both designer and end-user: given an OpenMP application binary, Aurora optimizes it without any code transformation or recompilation. By executing fifteen well-known benchmarks on four multi-core processors, Aurora improves the trade-off between performance and energy by up to: 98% over the standard OpenMP execution; 86% over the built-in feature of OpenMP that dynamically adjusts the number of threads; and 91% over a feedback-driven threading emulation.

The main goal of my work was to develop a model that could facilitate Trafikverkets (the Swedish Transport Administration's) work in prioritizing different cycling measures. In order to develop a model, I first had to study the various tools available. This in order to be able to develop a model that suited my purpose. I have also examined the reasons why different decisions need to be made. It then became the basis of my model. In addition to studying different models and decision-making processes, I also needed to examine possible cycling measures. The measures could both increase the flow of cyclists and increase road safety. All to give the bike a bigger role in society and reduce car dependency. The result shows the model developed as well as some parameters that hopefully will make the process faster for Trafikverket in prioritizing. The parameters are also valued so that they can be used directly in the priority model. / Huvudmålet med mitt arbete var att utveckla en modell som kunde underlätta Trafikverkets arbete med att göra prioriteringar mellan olika cykelåtgärder. För att utveckla en modell var jag först tvungen att studera olika prioriteringsverktyg. Detta för att kunna utveckla en modell som passade för studiens syfte. Jag har också granskat orsakerna till att olika beslut behöver fattas. Det blev sedan grunden för min modell. Förutom att studera olika modeller och beslutsprocesser, behövde jag också undersöka vilka möjliga cykelåtgärder som finns. Åtgärderna kan både öka flödet av cyklister och öka trafiksäkerheten. Allt för att ge cykeln en större roll i samhället och minska bilberoendet. Resultatet visar den utvecklade modellen samt några parametrar som förhoppningsvis kommer att göra processen snabbare för Trafikverket vid prioritering. Parametrarna värderades också så att de kan användas direkt i modellen.

Modern computer software systems are complicated. Developers can change the behavior of the software system through software configurations. The large number of configuration option and their interactions make the task of software tuning, testing, and debugging very challenging. Performance is one of the key aspects of non-functional qualities, where performance bugs can cause significant performance degradation and lead to poor user experience. However, performance bugs are difficult to expose, primarily because detecting them requires specific inputs, as well as specific configurations. While researchers have developed techniques to analyze, quantify, detect, and fix performance bugs, many of these techniques are not effective in highly-configurable systems. To improve the non-functional qualities of configurable software systems, testing engineers need to be able to understand the performance influence of configuration options, adjust the performance of a system under different configurations, and detect configuration-related performance bugs. This research will provide an automated framework that allows engineers to effectively analyze performance-influence configuration options, detect performance bugs in highly-configurable software systems, and adjust configuration options to achieve higher long-term performance gains. To understand real-world performance bugs in highly-configurable software systems, we first perform a performance bug characteristics study from three large-scale opensource projects. Many researchers have studied the characteristics of performance bugs from the bug report but few have reported what the experience is when trying to replicate confirmed performance bugs from the perspective of non-domain experts such as researchers. This study is meant to report the challenges and potential workaround to replicate confirmed performance bugs. We also want to share a performance benchmark to provide real-world performance bugs to evaluate future performance testing techniques. Inspired by our performance bug study, we propose a performance profiling approach that can help developers to understand how configuration options and their interactions can influence the performance of a system. The approach uses a combination of dynamic analysis and machine learning techniques, together with configuration sampling techniques, to profile the program execution, analyze configuration options relevant to performance. Next, the framework leverages natural language processing and information retrieval techniques to automatically generate test inputs and configurations to expose performance bugs. Finally, the framework combines reinforcement learning and dynamic state reduction techniques to guide subject application towards achieving higher long-term performance gains.

A method for tuning the spring rate and damping rate of a mountain bike suspension based on a data-driven procedure is presented. The design and development of a custom data acquisition system, known as the MTB~DAQ, capable of measuring acceleration data at the front and rear axles of a bike are discussed. These data are input into a model that is used to calculate the vertical acceleration and pitching angular acceleration response of the bike and rider. All geometric and dynamic properties of the bike and rider system are measured and built into the model. The model is tested and validated using image processing techniques. A genetic algorithm is implemented with the model and used to calculate the best spring rate and damping rate of the mountain bike suspension such that the vertical and pitching accelerations of the bike and rider are minimized for a given trail. Testing is done on a variety of different courses and the performance of the bike when tuned to the results of the genetic algorithm is discussed. While more fine tuning of the model is possible, the results show that the genetic algorithm and model accurately predict the best suspension settings for each course necessary to minimize the vertical and pitching accelerations of the bike and rider.

In the amphibian auditory system, a subset of hair cells is known to be frequency tuned via electrical resonance. This tuning is thought to contribute to frequency selectivity of the information leaving the auditory periphery via the auditory afferent fibers. At the same time, while most, if not all, afferent fibers are shown to be frequency tuned, electrical resonance has only been experimentally demonstrated in a subset of amphibian auditory hair cells. In this thesis, we validate and use a novel Zap current method to probe the electrical resonance of the bullfrog amphibian papilla hair cells. We uncover the existence of two previously unknown types of electrically resonant auditory hair cells. We then show the existence of resonant hair cells across the length of amphibian papilla, with the range of frequency tuning that is nearly indistinguishable from that previously reported in the of auditory fibers. Therefore, this work further validates amphibian hair cell frequency resonance as the possible mechanism underlying frequency selectivity of the subsequent stages in auditory signal transduction.

[pt] Esta dissertação tem como objetivo avaliar algoritmos de segmentação para imagens de sensoriamento remoto. Quatro algoritmos de segmentação foram considerados neste estudo. Esses algoritmos têm abordagens diferentes tais como baseado em agrupamento, em crescimento de regiões, em modelos bayesianos e em grafos. Como cada algoritmo tem os seus próprios parâmetros, o processo de encontrar seus parâmetros ótimos foi feito usando um algoritmo de otimização, Nelder - Mead. O algoritmo Nelder - Mead procura os melhores parâmetros para cada algoritmo de segmentação, isto é, os parâmetros que proporcionam os resultados mais exatos com respeito a uma referência dada. A função objetivo foi definida a partir de sete métricas diferentes. Eles avaliam qualitativamente o resultado da segmentação baseadas na sua referência. Os experimentos foram realizados ao longo de três imagens de sensoriamento remoto de diferentes localidades do Brasil. Isso envolveu um total de 84 experimentos. Os resultados mostraram que as abordagens baseadas em grafos produzem os melhores resultados baseados em todas as métricas. As abordagens baseadas no crescimento de regiões e agrupamento apresentaram-se como boas opções para imagens de sensoriamento remoto. / [en] This dissertation aims to evaluate segmentation algorithms for remote sensing images. Four segmentation algorithms were considered in this study. These algorithms have different approaches such as clustering-based, region growing-based, bayesian-based and graph-based. As each algorithm has its own parameters, the process to find their optimum values was done using an optimization algorithm, Nelder - Mead. Nelder - Mead algorithm looks for the best parameters for each segmentation algorithm, i.e. the parameters that provide the most accurate results with respect to a given reference. The objective function was defined by seven different metrics. These metrics assess qualitatively the segmentation result based on its reference. The experiments were performed over three remote sensing images from different locations of Brazil. A total of 84 experiments have been performed. The results have shown that graph-based approaches produce the best results based on each metric. The region growing- and clustering-based approaches have shown to be good alternatives for remote sensing images.