Submitted by Maykon Nascimento (maykon.albani@hotmail.com) on 2015-10-19T19:19:50Z No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) / Approved for entry into archive by Elizabete Silva (elizabete.silva@ufes.br) on 2015-11-03T19:59:38Z (GMT) No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) / Made available in DSpace on 2015-11-03T19:59:38Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Modelo matematico e meta heuristica simulated annealing para elaboração de roteiros turísticos com base no tourist trip design problem.pdf: 2271247 bytes, checksum: faaad9e85f6978197ce7c7b03933a2ca (MD5) Previous issue date: 2015 / Modelo Matemático e Meta-Heurística Simulated Annealing para Elaboração de Roteiros Turísticos com base no Tourist Trip Design Problem / Modelo Matemático e Meta-Heurística Simulated Annealing para Elaboração de Roteiros Turísticos com base no Tourist Trip Design Problem

Orientador: Francisco de Assis Magalhães Gomes Neto / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-12T23:12:18Z (GMT). No. of bitstreams: 1 Vieira_HeloisaPassarelli_M.pdf: 1211437 bytes, checksum: 312aded4a440d526d723ab88a2a23588 (MD5) Previous issue date: 2008 / Resumo: Nos últimos anos, diversas heurísticas e meta-heurísticas foram propostas para o Problema de Roteamento de Veículos com Janela de Tempo (PRVJT), cujo objetivo é determinar a rota a ser seguida por uma frota de veículos para servir um número de clientes em um dado intervalo de tempo, sem violar a capacidade dos veículos. Cada cliente é visitado por exatamente um veículo e somente uma vez. Esta disertação apresenta um estudo das técnicas utilizadas para o PRVJT, dando ênfase para os Algoritmos Genéticos. Diversos tipos de cruzamento e esquemas de mutação, além de outras técnicas avançadas, tal como o Hill-Climbing, são analisados. Para o algoritmo que implementamos, são apresentados vários resultados numéricos baseados em um conjunto de 56 problemas, cada qual com 100 clientes, proposto por Solomon. O desempenho do algoritmo que implementamos também é comparado aos melhores resultados publicados na literatura / Abstract: In recent years, several heuristic and metaheuristic methods were proposed for the Vehicle Routing Problem with Time Windows (VRPTW). The objective of the problem is to serve a set of customers within a given time interval, without violating the capacity of the vehicles. Each customer must be visited once and by only one vehicle. This dissertation presents a survey on the techniques used to solve the VRPTW, with emphasis on the genetic algorithms. Several crossover and mutation schemes, as well as other advanced techniques, such as the Hill-Climbing are analyzed. Numerical results based on Solomon's 56 VRPTW 100-customer instances are presented for the algorithm implemented here. The performance of our algorithm is also compared with the best results published in the specialized literature / Mestrado / Pesquisa Operacional / Mestre em Matemática Aplicada

An early detection of hearing loss in children is important for the child's speech and language development. For children between 3-6 months, a reliable method to measure hearing and determine hearing thresholds is missing. A hearing test based on the pupillary response to auditory signal detection as measured by eye tracking is based on an automatic physiological response. This hearing test could be used instead of the objective hearing tests used today. The presence of pupillary response has been shown in response to speech, but it is unstudied in response to sinus tones. The objective of this thesis was to study whether there is a consistent pupillary response to different sinus tone frequencies commonly used in hearing tests and if yes, to determine reliably the time window of this response. Four different tests were done. The adult pupillary response in regard to sinus tone stimuli with four frequency levels (500 Hz, 1000 Hz, 2000 Hz and 4000 Hz), and four loudness levels (silence, 30 dB, 50 dB and 70 dB) was tested (N=20, 15 females, 5 males). Different brightness levels and distractions on the eye tracking screen were investigated in three substudies (N=5, 4 females, 1 male). Differences between silence and loudness levels within frequency levels were tested for statistical significance. A pupillary response in regard to sinus tones occurred consistently between 300 ms and 2000 ms with individual variation, i.e. earlier than for speech sounds. Differences between silence and loudness levels were only statistically significant for 4000 Hz. No statistical difference was shown between different brightness levels or if there were distractions present on the eye tracker screen. The conclusion is that pupillary response to pure sinus tones in adults is a possible measure of hearing threshold for at least 4000 Hz. Larger studies are needed to confirm this, and also to more thoroughly investigate the other frequencies. / En tidig upptäckt av hörselnedsättning hos barn är viktig för barnets tal- och språkutveckling. För barn mellan 3-6 månader saknas det en tillförlitlig metod för att mäta hörsel och bestämma hörtrösklar. Ett hörseltest baserad på pupillreaktion på ljud som mäts med en eye tracker bygger på en automatisk fysiologisk reaktion och skulle kunna användas istället för de objektiva test som används idag. Hitintills har pupillreaktion på tal påvisats, men det saknas studier som studerat eventuella reaktioner på sinustoner. Syftet med denna uppsats var att undersöka om det finns en enhetlig pupillreaktion på de olika frekvenserna av sinustoner som vanligen används i hörseltest. Vidare var studiens syfte att fastställa ett tillförlitligt tidsfönster för pupillreaktion. Fyra olika typer av tester utfördes. Pupillreaktionen mot sinustoner med fyra olika frekvensnivåer (500 Hz, 1000 Hz, 2000 Hz och 4000 Hz), och fyra olika ljudnivåer (tystnad, 30 dB, 50 dB och 70 dB) undersöktes i ett test på vuxna deltagare (N=20, 15 kvinnor, 5 män). Olika ljusnivåer och distraktioner på eye tracker-skärmen undersöktes i tre test (N=5, 4 kvinnor, 1 man). Skillnaderna mellan ljudnivåer och frekvensnivåer testades med statistiska tester. Resultaten visade att pupillreaktion på sinustoner inträffade konsekvent mellan 300 ms och 2000 ms med individuella variationer. Denna reaktionstid inträffar tidigare än för taljud. En statistisk signifikant skillnad mellan tystnad och olika ljudnivåer kunde endast ses för frekvensnivån 4000 Hz. Ingen statistisk skillnad uppmättes mellan olika ljudnivåer eller om det fanns distraktioner på eye tracker-skärmen. De i studien framkomna resultaten tyder på att pupillreaktioner mot rena sinustoner hos vuxna är en möjlig metod för att identifiera hörseltrösklar för åtminstone 4000 Hz. Större studier behöver göras för att fastställa detta och en noggrannare undersökning behöver genomföras för de andra frekvenserna.

Der ischämische Schlaganfall ist global eine der bedeutendsten Volkskrankheiten. Die derzeit verfügbaren kurativen Therapieoptionen werden vorrangig durch ein enges therapeutisches Zeitfenster limitiert. Ziel der aktuellen Schlaganfallforschung ist die Entwicklung von über dieses Zeitfenster hinaus wirksamen Therapien. Ein vielversprechender neuer Ansatz ist die experimentelle Behandlung mit humanen Nabelschnurblutzellen. Diese Arbeit erforscht das therapeutische Zeitfenster für die systemische Therapie des ischämischen Schlaganfalls mittels mononukleärer Nabelschnurblutzellen (hUCB MNC) in spontanhypertensiven Ratten nach permanentem Verschluss der Arteria cerebri media (pMCAO). Hierzu wurden die Therapiezeitpunkte 4, 24, 72, 120 Stunden und 14 Tage nach experimentellem Schlaganfall in einem komplexen Studiendesign inklusive neurofunktioneller Tests, magnetresonanztomographischer und immunhistochemischer Verfahren untersucht. In vitro wurde der Einfluss kokultivierter hUCB MNC auf Nekrose und Apoptose in neuralem Gewebe unter Sauerstoff-Glukose-Deprivation betrachtet. Die Studie ergab eine verbesserte funktionelle Rekonvaleszenz und eine geringere Ausprägung von Atrophie und Astroglianarbe bei Therapie innerhalb eines 72- Stunden-Zeitfensters. In vitro wurde eine signifikante Reduktion von Nekrose und Apoptose durch kokultivierte hUCB MNC beobachtet. Eine histologische Relokalisierung der intravenös applizierten Zellen war in keiner Therapiegruppe möglich. Die Integration der hUCB MNC ins Hirnparenchym stellt somit keine conditio sine qua non für die funktionelle Erholung nach Schlaganfall dar. Trotz des beobachteten erweiterten Zeitfensters ist die Translation dieses Therapieansatzes in die klinische Realität kritisch zu diskutieren, da weiterführende Studien unserer Arbeitsgruppe eine limitierte Wirksamkeit unter sehr praxisnahen Bedingungen (z.B. Einsatz kryokonservierter hUCB MNC) gezeigt haben. / Experimental treatment strategies using human umbilical cord blood mononuclear cells (hUCB MNCs) represent a promising option for alternative stroke therapies. An important point for clinical translation of such treatment approaches is knowledge on the therapeutic time window. Although expected to be wider than for thrombolysis, the exact time window for hUCB MNC therapy is not known. Our study aimed to determine the time window of intravenous hUCB MNC administration after middle cerebral artery occlusion (MCAO). Male spontaneously hypertensive rats underwent MCAO and were randomly assigned to hUCB MNC administration at 4h, 24h, 72h, 120h or 14d. Influence of cell treatment was observed by magnetic resonance imaging on days 1, 8 and 29 following MCAO and by assessment of functional neurological recovery. On day 30, brains were screened for glial scar development and presence of hUCB MNCs. Further, influence of hUCB MNCs on necrosis and apoptosis in post-ischemic neural tissue was investigated in hippocampal slices cultures. Transplantation within a 72h time window resulted in an early improvement of functional recovery, paralleled by a reduction of brain atrophy and diminished glial scarring. Cell transplantation 120h post MCAO only induced minor functional recovery without changes in the brain atrophy rate and glial reactivity. Later transplantation (14d) did not show any benefit. No evidence for intracerebrally localized hUCB MNCs was found in any treatment group. In vitro hUCB MNCs were able to significantly reduce post-ischemic neural necrosis and apoptosis. Our results for the first time indicate a time window of therapeutic hUCB MNC application of at least 72 hours. The time window is limited, but wider than compared to conventional pharmacological approaches. The data furthermore confirms that differentiation and integration of administered cells is not a prerequisite for poststroke functional improvement and lesion size reduction.

This research is concerned with the modeling and development of algorithmic approaches for solving airport operational problems that arise in Air Traffic Control (ATC) systems within the terminal area at hub airports. Specifically, the problems addressed include the Aircraft Sequencing Problem (ASP) for runway operations, the Network Assignment Problem (NAP) for taxiway operations, and a simulation model for the evaluation of current or proposed ATC system in detail. For the ASP, we develop a mathematical model and apply the Reformulation-Linearization-Technique (RLT) of Sherali and Adams to construct an enhanced tightened version of the proposed model. Since ASP is NP-Hard and in fact, it is a variation of the well-known Traveling Salesman Problem with time-windows, sub-optimal solutions are usually derived to accommodate the real-time constraints of ATC systems. Nevertheless, we exhibit a significant advancement in this challenging class of problem. Also for the purpose of solving relatively large sized problems in practice, we develop and test suitable heuristic procedures. For the NAP, we propose a quasi-dynamic assignment scheme which is based on the incremental assignment technique. This quasi-dynamic assignment method assumes that the current aircraft route is influenced only by the previous aircraft assigned to the network. This simplified assumption obviates the need for iterative rerouting procedures to reach a pure equilibrium state which might not be achievable in practical taxiway operations. To evaluate the overall system, we develop a microscopic simulation model. The simulation model is designed to have the capability for reproducing not only the dynamic behavior of aircraft, but also incorporates communication activities between controllers and pilots. These activities are critical in ATC operations, and in some instances, might limit the capacity of the facility. Finally, using the developed simulation model named Virginia Tech Airport Simulation Model (VTASM) in concert with ASP and NAP, we compare the overall efficiencies of several control strategies, including that of the existing control system as well as of the proposed advanced control system. / Ph. D.

Water contamination is a major source of diseasearound the world. Therefore, the reliable monitoring of harmfulcontamination in water distribution networks requires considerableeffort and attention. It is a vital necessity to possess a reliablemonitoring system in order to detect harmful contamination inwater distribution networks. To measure the potential contamination,a new sensor called an ’electric tongue’ was developedin Link¨opings University. It was created for the purpose ofmeasuring various features of the water reliably. This projecthas developed a supervised machine learning algorithm that usesan artificial neural network for the detection of anomalies in thesystem. The algorithm can detect anomalies with an accuracy ofaround 99.98% based on the data that was available. This wasachieved through a binary classifier, which reconstructs a vectorand compares it to the expected outcome. Despite the limitationsof the problem and the system’s capabilities, binary classificationis a potential solution to this problem. / Vatten kontaminering är en huvudsaklig anledning till sjukdom runtom i världen. Därför är det en avgörande nödvändighet att ha ett tillförlitligt övervakningssystem för att upptäcka skadliga föroreningar i vattendistributionsnät. För att mäta den potentiella föroreningen skapades en ny sensor, den så kallade ”Electric Tongue” vid Linköpings universitet Den skapades i syfte att mäta olika egenskaper i vattnet på ett tillförlitligt sätt. Genom att använda ett artificiellt neuralt nätverk utvecklades en supervised machine learning algoritm för att upptäcka anomalier i systemet. Algoritmen kan upptäcka anomalier med 99.98% säkerhet som baseras på befintliga data. Detta uppnåddes genom att rekonstruera en vektor och jämföra det med det förväntade resultatet genom att använda en binär klassificerare. Trots att det finns begränsningar som orsakats både av problemet men också systemets förmågor, så är binär klassificering en potentiell lösning till detta problem. / Kandidatexjobb i elektroteknik 2022, KTH, Stockholm

ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / The Central Test and Evaluation Investment Program (CTEIP) Integrated Network Enhanced Telemetry (iNET) program is currently testing networked telemetry transceivers (IP.TM-Tx/Rx) using the Internet Protocol (IP), for use in telemetry (TM) channels. A unique characteristic of networked telemetry channel is packet drops due to radio frequency (RF) signal dynamics, i.e., terrain, weather, aircraft attitude, manmade objects, etc.. One of the key measures of the IP.TMTx/ Rx is reliability is link availability (LA), and a key element of LA is time to resynchronize after RF link loss.

[pt] Uma generalização do problema de roteamento de veículos (VRP) presente em aplicações práticas em portos e operações em minas é o objeto desta dissertação. Nesta variante do VRP cada cliente pode demandar diferentes tipos de veículos para cumprir tarefas colaborativamente. Nesta atividade, os veículos podem aguardar o início da operação no local porém, devem iniciar as tarefas ao mesmo tempo. O objetivo é determinar as rotas dos veículos disponíveis de modo a maximizar a soma (ponderada) dos clientes atendidos enquanto a distância total percorrida é minimizada. O caso específico onde todos os clientes são atendidos e a distância total percorrida é minimizada determina o problema central estudado nessa dissertação. Este caso particular pode ser visto como uma generalização direta do, muito estudado e conhecido problema de roteamento, VRP com janelas de tempo (VRPTW) onde a capacidade dos veículos é suficientemente grande. Esta escolha de um problema mais restrito é justificada por permitir uma clara comparação de sua dificuldade através da sua relação com o VRPTW. A partir da classificação dos casos de sincronização em problemas de roteamento proposta por (DREXL, 2012), denominamos o problema aqui estudado de Problema de Roteamento de Veículos com Janelas de Tempo e Sincronização exata da Operação (VRPTWEOS). Neste trabalho damos uma definição formal ao VRPTWEOS. Modelos de programação inteira são propostos e analisados. Também apressentamos métodos de resolução baseados na decomposição Dantzig-Wolfe, dos quais são derivados algoritmos exatos e aproximados. Com o propósito de avaliar a eficiencia desses algoritmos, foi criado um grupo de instancias de teste baseado no benchmark do Solomon para o VRPTW. O método usado para criar o conjunto de instancias de teste é descrito em detalhe. Experimentos computacionais sobre este conjunto de instancias mostraram que o método de resolução proposto é promissor para a resolução do VRPTWEOS. / [en] This dissertation addresses a generalization of the vehicle routing problem (VRP) that arises in real life applications in ports and mine operations. In this VRP variant, each customer may demand different types of vehicles to perform a task collaboratively. Vehicles are allowed to wait at the locations but they must start operating at the same time. The objective is to route the available vehicles while maximizing the (weighted) sum of served customers and minimizing the total distance traveled. The specific case where all customers must be served while minimizing the total distance traveled is the central problem here studied. This special case can be viewed as a straightforward generalization of, a well known and more specific routing problem, the VRP with time windows (VRTPTW) where the capacity of the vehicles is sufficiently large. We support this narrower scope by stating that it allows a clear comparison of the problem hardness by its relation to the VRPTW. Sticking to the classification of synchronization in vehicle routing proposed by (DREXL, 2012) we named this problem as the Vehicle Routing Problem with Time Windows and Exact Operation Synchronization (VRPTWEOS). In this work, a formal definition for the VRPTWEOS is provided. Integer programming models for this problem are proposed and analyzed. Furthermore, we propose a solution method based on the Dantzig-Wolfe decomposition for which exact and aproximated resolution algorithms are described. In order to test the performance of those algorithms, a group of benchmark instances for the VRPTWEOS was created on top of the Solomon benchmark for the VRPTW. The method used to create the benchmark instances is described in detail. Computational experiments over the mentioned set of instances showed that the proposed solution approach is a promising alternative for solving the VRPTWEOS.

This thesis deals with out-of-equilibrium transport phenomena in strongly correlated low-dimensional fermionic systems, with special emphasis on π-conjugated molecular materials. The focus of this work is to study real-time dynamics of spin and charge transport in these systems in order to investigate non-equilibrium transport in single-molecule electronic and spintronic devices. Chapter 1 describes the electronic structure and dynamics of strongly correlated fermionic systems in general, and in one-dimension, in particular. For this purpose, effective low-energy model Hamiltonians (used in this work) are discussed. Whenever applicable, approximate analytical and numerical methods commonly used in the literature to deal with these model Hamiltonians, are outlined. In the context of one-dimensional strongly correlated fermionic systems, analytical techniques like the Bethe ansatz and bosonization, and numerical procedures like exact diagonalization and DMRG, used for solving finite systems, are discussed in detail. Chapter 2 provides an overview of the different zero-temperature (T = 0) time-dependent DMRG algorithms, which have been used to study out-of-equilibrium time-dependent phenomena in low-dimensional strongly correlated systems. In Chapter 3 we employ the time-dependent DMRG algorithm proposed by Luo, Xiang and Wang [Phys. Rev. Lett. 91, 049701 (2003)], to study the role of dimerization and electronic correlations on the dynamics of spin-charge separation. We employ the H¨uckel and Hubbard models for our studies. We have modified the algorithm proposed by Luo et. al to overcome some of its limitations. Chapter 4 presents a generalized adaptive time-dependent density matrix renormalization group (DMRG) scheme developed by us, called the Double Time Window Targeting (DTWT) technique, which is capable of giving accurate results with lesser computational resources than required by the existing methods. This procedure originates from the amalgamation of the features of pace keeping DMRG algorithm, first proposed by Luo et. al, [Phys.Rev. Lett. 91, 049701 (2003)], and the time-step targeting (TST) algorithm by Feiguin and White [Phys. Rev. B 72, 020404 (2005)]. In chapter 5 we apply the Double Time Window Targeting (DTWT) technique, which was discussed in the previous chapter, for studying real-time quantum dynamics of spin-charge separation in π-conjugated polymers. We employ the Pariser-Parr-Pople (PPP) model which has long-range electron-electron interactions. For investigating real-time dynamics of spin and charge transport, we inject a hole at one end of polyene chains of different lengths and study the temporal evolution of its spin and charge degrees of freedom, using the DTWT td-DMRG algorithm. Chapter 6 we investigate the effect of terminal substituents on the dynamics of spin and charge transport in donor-acceptor substituted polyenes (D- (CH)x- A) chains, also known as push-pull polyenes. We employ long-range correlated model Hamiltonian for the D- (CH)x- A system and, real-time DMRG dynamics for time propagating the wave packet obtained by injecting a hole at a terminal site in the ground state of the system. Our studies reveal that the end groups do not affect the spin and charge velocities in any significant way, but change the amount of charge transported. We have compared these with the polymethineimine (CN)x system in which besides electron affinities, the nature of pz orbitals in conjugation also alternate from site to site. Chapter 7 presents our investigation on the effect of static electron-phonon coupling (dimerization) on the dynamics of spin-charge separation in particular, and transport in general, in π-conjugated polyene chains. The polyenes are modeled by the Pariser-Parr-Pople Hamiltonian, having long-range electron-electron correlations. Our studies reveal that spin and charge velocities depend both on the chain length and dimerization. The spin and charge velocities increase as dimerization increases, but the amount of charge and spin transported along the chain decrease with enhancement in dimerization. Furthermore, in the range 0.3≤ δ≤0.5, it is observed that the dynamics of spin-charge separation becomes complicated, and the charge degree of freedom is affected more by electron-phonon coupling compared to the spin degree of freedom.

Frequent-pattern mining from databases has been widely studied and frequently observed. Unfortunately, these algorithms are not suitable for data stream processing. In frequent-pattern mining from data streams, it is important to manage sets of items and also their history. There are several reasons for this; it is not just the history of frequent items, but also the history of potentially frequent sets that can become frequent later. This requires more memory and computational power. This thesis describes two algorithms: Lossy Counting and FP-stream. An effective implementation of these algorithms in C# is an integral part of this thesis. In addition, the two algorithms have been compared.