Thèses sur le sujet « Algortimi »

I disordini neurologici costituiscono il 6,3% delle cause di malattia in tutto il mondo, diventando una delle priorità della sanità globale. Per trattare questi disordini si utilizzano farmaci, ma alcuni pazienti possono risultarne resistenti. La Neuroingegneria propone soluzioni innovative per la cura e la riabilitazione di queste patologie, proponendo, tra le varie soluzioni, le neuroprotesi, capaci di sostituire un’area danneggiata del cervello o di ricollegare artificialmente due aree disconnesse bypassando la lesione che ha causato il danno. Tra questi, il dispositivo sviluppato presso la University of Kansas (KUMC) si è dimostrato essere efficace in esperimenti effettuati su topi con lesione focale in area motoria. Il funzionamento di questo dispositivo è basato sull’impianto di micro-elettrodi in due regioni cerebrali disconnesse a causa di una lesione. Questi creano un ponte in grado di ricollegare le due aree scollegate attraverso la registrazione di eventi (spike) in una delle due aree, e la seguente somministrazione di corrente nella seconda. In questo tipo di dispositivi, è importantissimo effettuare una identificazione corretta degli spikes. Il mio lavoro di tesi si inserisce nell’ambito della collaborazione tra il Rehab Technologies Lab (IIT, Genova), dove ho svolto il tirocinio, e la KUMC in relazione al progetto per lo sviluppo di neuroprotesi innovative per il recupero motorio a seguito di danni cerebrali. Nello specifico, il mio lavoro di Tesi si concentra sulla Spike Detection (SD), di cui uno dei problemi fondamentali è la mancanza di un ground truth, ovvero di una conoscenza a priori della localizzazione degli spikes nel tracciato. Nel contesto descritto sopra, si inseriscono gli obiettivi di questa Tesi: fornire un ground truth, studiare e adattare un set di algoritmi di SD già presenti in letteratura, modificare un algoritmo ad alte prestazioni sviluppato all’interno di IIT in passato e confrontare le prestazioni di tutti gli algoritmi di SD.

In questo manoscritto vengono discussi le principali sfide computazionali nel campo della inferenza di filogenesi tumorale a vengono proposte diverse soluzione per i tre principali problemi di (i) ricostruzione dell'evoluzioni di un campione tumorale, (ii) clustering di dati SCS per una piu' pulita e veloce inferenza e (iii) il confronto di diverse filogenesi. Inoltre viene discusso come combinare le diverse soluzioni in una singola pipeline per una piu' rapida analisi.
In this manuscript we described the main computational challenges of the cancer phylogenetic field and we proposed different solutions for the three main problems of (i) the progression reconstruction of a tumor sample, (ii) the clustering of SCS data to allow for a cleaner and faster inference and (iii) the evaluation of different phylogenies. Furthermore we combined them into a usable pipeline to allow for a faster analysis.

This diploma thesis deals with constructing of algorithms of consisting a puzzle and suggesting of the workplace for its imaging. There are studied two methods of forming a puzlle. First method is forming of the puzzle with a known pattern. For this method is used the Harris operator and the correlation. In the second method is the puzzle formed without a pattern. Fot this method is used the correlation. In the last part there is a mutual evaluation of these two methods.

An ad hoc network is comprised of wireless mobile nodes without the need of wired network infrastructure. Due to the limited transmission range of nodes, the exchange of data between them may not be possible using direct communication. Partitioning the network into clusters and electing a clusterhead for each cluster to assist with the resource allocation and data packet transmissions among its members and neighboring clusterheads is one of the most common ways of providing support for the existing ad hoc routing protocols. This thesis presents the performance comparison of four ad hoc network clustering protocols: Dynamic Mobile Adaptive Clustering (DMAC), Highest-Degree and Lowest-ID algorithms, and Weighted Clustering Algorithm (WCA). Yet Another Extensible Simulation (YAES) was used as the simulator to carry out the simulations.
M.S.Cp.E.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering

Sono sempre di più le città alla ricerca di uno sviluppo sostenibile delle politiche e degli strumenti volti a garantire un’efficiente ed efficace mobilità urbana per passeggeri e merci. Oggigiorno, il veicolo maggiormente utilizzato per il trasporto merci è il camion, il quale influisce sull’aumento del traffico urbano, sul numero di incidenti e sull’emissione di sostanze inquinanti. In questo testo si propone un metodo alternativo per il trasporto della merce, utilizzando la rete ferroviaria urbana come soluzione potenziale per decrementare l’inquinamento atmosferico e per ridurre il flusso stradale spostandolo su quello ferroviario. Il problema trattato si chiama Freight Rail Transport Scheduling (FRTS), ovvero la pianificazione del trasporto della merce per ferrovia. Si tratta della condivisione comune della rete ferroviaria urbana per trasportare i passeggeri e la merce. In particolare, si tratta di assegnare le domande dei clienti a treni appartenenti ad una linea ferroviaria, dove ogni stazione può essere utilizzata come piattaforma per lo scarico/carico della merce. L’obiettivo è la minimizzazione del tempo totale d’attesa delle merci nelle stazioni per massimizzare il turnover della merce. Poiché il problema è di tipo NP-difficile, si propone un Algoritmo Genetico (AG) come metodo risolutivo. L’algoritmo è costituito da una lista di individui, identificati da una serie di domande ordinate in base alla priorità di assegnazione ai treni. La soluzione ricercata è una lista di treni a cui sono state assegnate le domane dei clienti. Gli operatori principali dell’algoritmo sono il crossover e la mutazione, i quali permettono di trovare la soluzione ottima o sub-ottima. In aggiunta, verrà presentato un caso pratico di implementazione dell’algoritmo per trasportare pacchi nella città di Parigi, utilizzando la linea 14 della metropolitana. Le emissioni di CO2 verranno poi calcolate e valutate per l’attuale e per l'alternativo modo di trasporto

Syftet med undersökningen är att ge ett bidrag till debatten kring algoritmens betydelse i skolundervisningen. Frågan som undersökning vilar på är om elever har ett bättre självförtroende åt sina beräkningar om de använder sig av algoritmer i de fyra grundräknesätten? I undersökning jämförs svenska elever mot åländska elever. Metoden som har legat till grund för att ge ett svar på frågan är först och främst en enkätstudie och därefter förekommer även intervjuer som syftar till att bredda vyn runt frågan. Det framgår utifrån undersökningen att algoritmanvändare har ett högre självförtroende för sina beräkningar samt presterar fler rätta svar än elever som använder den alternativa beräkningsmetoden. Det framgår utifrån intervjuer att de elever vilket är lärda inom algoritmanvändning har svårt för att motivera varför deras svar blir rätt, utan att hänvisa till algoritmernas användningsregler. Med dessa elever förekommer också reflektionen kring deras svars rimlighet mer sällan.

Un component important de molts sistemes de distribució és el càlcul de les rutes dels vehicles per servir els clients. El Vehicle Routing Problem (VRP) proporciona el marc teòric per tractar aquest tipus de problemes logístics relacionats amb la distribució física de béns. Per la seva complexitat i aplicabilitat, aquest tipus de problemes logístics es troba entre les línies de recerca més populars en optimització combinatòria. Aquesta tesi de doctorat té com a objectiu la introducció de tres metodologies diferents per resoldre el VRP. Aquestes metodologies han estat especialment dissenyades per ser flexibles, en el sentit que poden ser utilitzades, amb adaptacions menors, per resoldre diferents variants del VRP presents en casos d’aplicació industrial. En les tres metodologies descrites en aquest treball s’utilitzen diferents tècniques per aconseguir la flexibilitat, l’eficiència i la robustesa desitjades. Constraint Programming (CP) ha estat escollit com a paradigma de modelat per descriure les principals restriccions presents en el VRP. CP proporciona la flexibilitat desitjada per les tres metodologies, atès que afegir restriccions addicionals presents en molts casos d’aplicació real només afecta al modelat del problema, però no a la definició dels algorismes de cerca. En les dues primeres metodologies descrites, el model de CP només s’utilitza per comprovar la factibilitat de les solucions durant la cerca. La tercera metodologia presenta un model més ric del VRP que permet tractar diferents variants del problema. En aquest cas, la cerca es realitza i es controla fent servir els mecanismes que CP proporciona. La Relaxació Lagrangiana (LR) i una versió probabilística de l’heurística Clarke and Wright Savings (RCWS) s’utilitzen amb una finalitat molt específica dins de les metodologies. LR s’utilitza per minimitzar la distància total recorreguda pels vehicles, mentre que la RCWS es fa servir per calcular una solució inicial de bona qualitat. Ambdós mètodes proporcionen una aproximació eficient als problemes respectius. A més, la utilització de LR permet reduir la complexitat computacional dels processos de cerca local i, d’aquesta manera, redueix el temps computacional necessari per resoldre el VRP. Totes les metodologies es basen en la metaheurística coneguda com Variable Neighborhood Search (VNS). El VNS està format per una família d’algorismes que aprofiten sistemàticament la idea de canviar el veïnat explorat al voltant d’una solució, tant en el procés de cerca per trobar un mínim local com en el procés de pertorbació, per escapar de la vall corresponent. Malgrat que és un mètode bastant estès, hi ha pocs exemples d’aplicació en el VRP. En tot cas, fins i tot els mètodes VNS més simples han aconseguit bons resultats quan han estat aplicats en aquest problema. Aquesta tesi té com a objectiu contribuir en la recerca de l’aplicació de la metaheurística VNS en el VRP. Aquesta ha estat escollida com a marc en el que integrar les tècniques mencionades. Així, la metaheurística s’utilitza per guiar la cerca, mentre que l’eficiència desitjada s’aconsegueix mitjançant els mètodes que s’hi integren. D’altra banda, utilitzar CP com a paradigma de modelat proporciona la flexibilitat requerida. Aquesta característica és especialment rellevant en el cas de la darrera metodologia descrita. En aquest cas, la cerca de CP es guia mitjançant una combinació de les metaheurístiques VNS i Large Neighborhood Search (LNS). Aquesta metodologia representa una primera aproximació a la resolució eficient de problemes VRP més complexos, similars a casos d’aplicació real.
An important component of many distribution systems is routing vehicles to serve customers. The Vehicle Routing Problem (VRP) provides a theoretical framework for approaching this class of logistics problems dealing with physical distribution. Because of its complexity and applicability, this class of logistics problems is among the most popular research areas in combinatorial optimization. This PhD. Thesis is aimed to introduce three different yet related hybrid methodologies to solve the VRP. These methodologies have been especially designed for being flexible in the sense that they can be used, with minor adaptations, for solving different variants of the VRP present in industrial application cases. In the three methodologies described in this work, different technologies are used to achieve the desired flexibility, efficiency, and robustness. Constraint Programming (CP) has been chosen as the modeling paradigm to describe the main constraints involved in the VRP. CP provides the pursued flexibility for the three methodologies, since adding side constraints present in most real application cases becomes a modeling issue and does not affect the search algorithm definition. In the first two hybrid methodologies, the CP model is used to check solution's feasibility during search. The third methodology presents a richer model for the VRP capable of tackling different problem variants. In this case, the search is performed and controlled from a CP perspective. Lagrangian Relaxation (LR) and a probabilistic version of the Clarke and Wright Savings (CWS) heuristic are used for specific purposes within the proposed methodologies. The former is used for minimizing the total traveled distance and the latter to provide a good initial solution. Both methods provide an efficient approach to the respectively faced problems. Moreover, the use of LR permits reducing the computational complexity of the performed local search processes and therefore reduces the required computational time to solve the VRP. All methodologies are based on the so-called Variable Neighborhood Search (VNS) metaheuristic. The VNS is formed by a family of algorithms that exploits systematically the idea of neighborhood changes both in the search phase to find a local minimum, and in perturbation phase, to escape from the corresponding valley. Although it is an extended method, there are few examples of its application to the VRP. However, interesting results have been obtained even applying the simplest VNS algorithms to this problem. The present thesis is aimed to contribute to the current research on the application of the VNS metaheuristic to the VRP. It has been chosen as the framework where the mentioned techniques are embedded. Hence, the metaheuristic is used to guide the search, while the desired efficiency is provided by the composing methods. On the other hand, using CP as the modeling paradigm provides the required flexibility. This characteristic is enhanced in the last described methodology. In this case, the CP search is guided by a combination of the VNS and the Large Neighborhood Search (LNS) metaheuristics. This methodology represents an initial approach for tackling efficiently more complex and richer VRP, similar to real application cases.

Evolvable Hardware (EHW) is a promising area in electronics today. Evolutionary Algorithms (EA), together with a circuit simulation tool or real hardware, automatically designs a circuit for a given problem. The circuits evolved may have unconventional designs and be less dependent on the personal knowledge of a designer. Nowadays, EA are represented by Genetic Algorithms (GA), Genetic Programming (GP) and Evolutionary Strategy (ES). While GA is definitely the most popular tool, GP has rapidly developed in recent years and is notable by its outstanding results. However, to date the use of ES for analogue circuit synthesis has been limited to a few applications. This work is devoted to exploring the potential of ES to create novel analogue designs. The narrative of the thesis starts with a framework of an ES-based system generating simple circuits, such as low pass filters. Then it continues with a step-by-step progression to increasingly sophisticated designs that require additional strength from the system. Finally, it describes the modernization of the system using novel techniques that enable the synthesis of complex multi-pin circuits that are newly evolved. It has been discovered that ES has strong power to synthesize analogue circuits. The circuits evolved in the first part of the thesis exceed similar results made previously using other techniques in a component economy, in the better functioning of the evolved circuits and in the computing power spent to reach the results. The target circuits for evolution in the second half are chosen by the author to challenge the capability of the developed system. By functioning, they do not belong to the conventional analogue domain but to applications that are usually adopted by digital circuits. To solve the design tasks, the system has been gradually developed to support the ability of evolving increasingly complex circuits. As a final result, a state-of-the-art ES-based system has been developed that possesses a novel mutation paradigm, with an ability to create, store and reuse substructures, to adapt the mutation, selection parameters and population size, utilize automatic incremental evolution and use the power of parallel computing. It has been discovered that with the ability to synthesis the most up-to-date multi-pin complex analogue circuits that have ever been automatically synthesized before, the system is capable of synthesizing circuits that are problematic for conventional design with application domains that lay beyond the conventional application domain for analogue circuits.

Made available in DSpace on 2014-06-11T19:27:10Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-10-22Bitstream added on 2014-06-13T18:47:57Z : No. of bitstreams: 1 souza_ccl_me_rcla.pdf: 694689 bytes, checksum: 6f7ac4f1f83b7264538168e98f437103 (MD5)
Neste trabalho, apresentamos sistemas criptográ cos clássicos, como o criptossistema Di e-Hellman, o criptossistema RSA e o criptossistema de ElGamal. Estudamos alguns aspectos da criptogra a quântica e alguns sistemas de criptogra a pós-quântica, como o criptossistema Ajtai-Dwork, o criptossistema NTRU, o criptossistema de McEliece e o criptossistema de Niederreiter. Discutimos a segurança dos métodos de criptogra a e possíveis soluções apresentadas para garantir a troca de informações con - dencias mesmo com o avanço da computação quântica
In this work, we show classic cryptography systems, as the Di e-Hellman cryptosystem, the RSA cryptosystem and the ElGamal cryptosystem. We studied some aspects of quantum cryptography and some post-quantum cryptography systems, as the Ajtai-Dwork cryptosystem, the NTRU cryptosystem, the McEliece cryptosystem and the Niederreiter cryptosystem. We discussed the classic cryptography methods security and possible solutions that are introduced to ensure the con dential information exchange even with the quantum computing advancement

Orientador: Carina Alves
Banca: Marta Cilene Gadotti
Banca: Antonio Aparecido de Andrade
Banca: Edson Donizete de Carvalho
Resumo: Neste trabalho, apresentamos sistemas criptográ cos clássicos, como o criptossistema Di e-Hellman, o criptossistema RSA e o criptossistema de ElGamal. Estudamos alguns aspectos da criptogra a quântica e alguns sistemas de criptogra a pós-quântica, como o criptossistema Ajtai-Dwork, o criptossistema NTRU, o criptossistema de McEliece e o criptossistema de Niederreiter. Discutimos a segurança dos métodos de criptogra a e possíveis soluções apresentadas para garantir a troca de informações con - dencias mesmo com o avanço da computação quântica
Abstract: In this work, we show classic cryptography systems, as the Di e-Hellman cryptosystem, the RSA cryptosystem and the ElGamal cryptosystem. We studied some aspects of quantum cryptography and some post-quantum cryptography systems, as the Ajtai-Dwork cryptosystem, the NTRU cryptosystem, the McEliece cryptosystem and the Niederreiter cryptosystem. We discussed the classic cryptography methods security and possible solutions that are introduced to ensure the con dential information exchange even with the quantum computing advancement
Mestre

Introducció: el dolor toràcic suggestiu d´isquèmia miocàrdica és un motiu de consulta molt freqüent en el SU, si bé, s’acaba descartant origen coronari en la majoria d´aquests pacients. Cal optimitzar el maneig diagnòstic d´aquesta entitat. Actualment, la determinació seriada de Tnc ( valor Δ ) és un component imprescindible en el diagnòstic de l´IAMSEST. Recentment s´han introduït noves immunoanàlisis denominades Tnc-es que han canviat el paradigma del diagnòstic d´IAMSEST. Aquestes immunoanàlisis faciliten un diagnòstic precoç de l´IAMSEST, permeten el diagnòstic d´IAMSEST de petita mida, ja que són molt específiques per diagnosticar lesió miocàrdica, però no són específiques per identificar la causa de la lesió miocàrdica; és a dir, la determinació de Tnc-es pot ser elevada en situacions diferents d´una oclusió trombòtica coronària. Es recomana la implementació d´algoritmes basats en la determinació de Tnc-es per al diagnòstic precoç de l´IAMSEST, si bé hi ha qüestions no resoltes sobre la seva utilització:  Ús d´algoritmes de diagnòstic ràpid d´IAMSEST.  Moment temporal òptim per fer la determinació seriada.  Valor Δ òptim (absolut o percentual) per fer el diagnòstic d´IAMSEST . Objectius: Validar un algoritme per a l´exclusió precoç de l´IAMSEST. Valorar el moment temporal òptim per fer la determinació seriada i determinar el tipus de valor òptim per al diagnòstic d´IAMSEST Mètodes: Cohort prospectiva reclutada en el servei d´urgències d´un hospital universitari en la què es realitzen determinacions seriades de TnTc-es: a la inclusió, a 1 hora, a 2 hores i >4 hores. Resultats: La determinació seriada a 0->4h té millor rendiment diagnòstic que les determinacions a 0-1h, 0-2h (p<0.05). En l´interval 0->4h es pot fer servir valor Δ absolut o percentual (p = 0.36). L´ús d´un algoritme a 0->4h amb valor Δ percentual o absolut permet excloure el diagnòstic d´IAMSEST (Se 100%). L´ús d´un algoritme a menys de 4h genera un grup de casos en els quals és obligat utilitzar criteris addicionals per confirmar o excloure el diagnòstic d´IAMSEST. Conclusions: L´ús d´un algoritme a 0->4h amb valor Δ percentual o absolut permet excloure el diagnòstic d´IAMSEST. En casos seleccionats, es pot excloure o confirmar el diagnòstic amb una determinació única de TnTc-es o plantejar l´ús d´algoritme 1 h amb valor Δ absolut. L´ús d´aquests algoritmes no es pot utilitzar per donar d´alta de forma precoç als pacients sense IAMSEST; alguns d´aquests casos són AI, i requereixen proves addicionals per al seu maneig.
Background: Chest pain suggestive of myocardial ischemia is a very common chief complaint in the Emergency Department. However, myocardial ischemia is ruled out in the majority of these cases. It is necessary to optimize the diagnostic management of chest pain. A rise and/or fall (Δ value) in levels in cTn is obligatory criteria for the diagnosis of NSTEMI. The development and introduction of new immunoassay (hs-cTnT) have changed the diagnostic approach of NSTEMI. This immunoassay not only facilitates early diagnosis of NSTEMI, but it also allows the diagnosis of small size NSTEMI. This immunoassay is highly specific tool for diagnosing myocardial injury; however, they do not identify the cause of myocardial injury. As a consequence, hs-cTnT can be elevated in many situations different of a thrombotic occlusion of a coronary artery. It is recommended the implementation of algorithms based on hs-cTnT for the early diagnosis of NSTEMI, although there are unresolved questions about its use:  Implementation of rapid diagnostic algorithms for NSTEMI.  Best moment for sample collection.  Optimal Δ value (absolute or relative) for NSTEMI diagnosis. Objectives: To validate an algorithm for early exclusion of acute myocardial infarction diagnosis. To evaluate the best moment to sample collection and to determine the optimal kinetic change for the diagnosis of NSTEMI. Methods: Prospective cohort enrolled in an emergency department of a university hospital. Sample collection were obtained at study inclusion, and at 1 hour, 2 hours and >4 hours Results: Determination 0->4hours has a better diagnostic performance than 0-1h or 0-2h (p>0.05). In this interval, there is no difference between relative and absolute Δ values (p=0.36). The use of an algorithm 0->4h with absolute or relative Δ values allows to exclude NSTEMI (Sensitivity 100%). The use of an algorithm 0-1h generates a group of patients who require additional criteria to confirm or exclude NSTEMI. Conclusions: Using an algorithm with 0->4h with absolute or relative Δ value allows to exclude NSTEMI. In selected cases, it is possible to confirm or exclude the diagnosis with a single sample. In some situations, it can be useful an algorithm with 0-1h with absolute Δ value. These algorithms cannot be used to discharge patients without NSTEMI. Some of these cases are unstable anginas and require additional tests for diagnosis.

Objective of this master's thesis is optimizing of neral network topology using some of evolutionary algorithms. The backpropagation neural network was optimized using genetic algorithms, evolutionary programming and evolutionary strategies. The text contains an application in the Matlab environment which applies these methods to simple tasks as pattern recognition and function prediction. Created graphs of fitness and error functions are included as a result of this thesis.

Gli effetti sulla salute umana dei campi elettromagnetici artificiali sono argomento d’interesse scientifico sin dalla fine dell’800 ed hanno ricevuto particolare attenzione negli ultimi 40 anni. Le valutazioni dei campi elettromagnetici vengono effettuati da software di calcolo professionale che stimano le distanza di prima approssimazione da rispettare per la costruzione degli edifici e la distanza che le persone devono rispettare. Le formulazione matematica principale implementata è quella della norma CEI 211-4 con l’approssimazione bidimensionale, utilizzata in molte simulazioni di calcolo. Per calcoli più precisi e esatti viene implementata la formula per il calcolo tridimensionale, la quale nella maggior parte dei casi implementa la formula di Laplace con la tecnica di calcolo dei coseni direttori. Tale formula prevede calcoli complessi e la implementazione in un codice di calcolo non è banale, causando così tempi di calcolo molto lunghi. L’innovazione della tesi qui descritta è la scrittura di un algoritmo innovativo che implementa un’ulteriore formula, la formula di Laplace vettoriale di facile uso e implementazione a livello software. Tale formula grazie alla sua semplicità e compattezza prevede tempi di calcolo più brevi e operazioni meno complesse. L’oggetto della tesi è così quello di scrivere un algoritmo per il calcolo dei campi magnetici, o più precisamente dell’induzione magnetica, generata da linee elettriche aeree con conduttori nudi in configurazioni complesse. Viene quindi proposto un algoritmo innovativo per il calcolo tridimensionale di campo magnetico che implementa la formula di Laplace. L’algoritmo permette la discretizzazione della catenaria in elementi differenziali e implementa la formula differenziale di Laplace in modo da ottenere le tre componenti del campo magnetico Bx, By e Bz. La componente risultante sarà il campo magnetico totale.

Present day air traffc control is reaching its operational limits and accommodating future traffic growth will be a challenging task for air traffic service providers and airline operators. Free Flight is a proposed transition from a highly-structured and centrally-controlled air traffic system to a self-optimized and highly-distributed system. In Free Flight, pilots will have the flexibility of real-time trajectory planning and dynamic route optimization given airspace constraints (traffic, weather etc.). A variety of advanced air traffc management (ATM) concepts are proposed as enabling technologies for the realization of Free Flight. Since these concepts can be exposed to unforeseen and challenging scenarios in Free Flight, they need to be validated and evaluated in order to implement the most effective systems in the field. Evaluation of advanced ATM concepts is a challenging task due to the limitations in the existing scenario generation methodologies and limited availability of a common platform (air traffic simulator) where diverse ATM concepts can be modeled and evaluated. Their rigorous evaluation on safety metrics, in a variety of complex scenarios, can provide an insight into their performance, which can help improve upon them while developing new ones. In this thesis, I propose a non-propriety, non-commercial air traffic simulation system, with a novel representation of airspace, which can prototype advanced ATM concepts such as conflict detection and resolution, airborne weather avoidance and cockpit display of traffic information. I then propose a novel evolutionary computation methodology to algorithmically generate a massive number of conflict scenarios of increasing complexity in order to evaluate conflict detection algorithms. I illustrate the methodology in detail by quantitative evaluation of three conflict detection algorithms, from the literature, on safety metrics. I then propose the use of data mining techniques for the discovery of interesting relationships, that may exist implicitly, in the algorithm's performance data. The data mining techniques formulate the conflict characteristics, which may lead to algorithm failure, using if-then rules. Using the rule sets for each algorithm, I propose an ensemble of conflict detection algorithms which uses a switch mechanism to direct the subsequent conflict probes to an algorithm which is less vulnerable to failure in a given conflict scenario. The objective is to form a predictive model for algorithm's vulnerability which can then be included in an ensemble that can minimize the overall vulnerability of the system. In summary, the contributions of this thesis are: 1. A non-propriety, non-commercial air traffic simulation system with a novel representation of airspace for efficient modeling of advanced ATM concepts. 2. An Ant-based dynamic weather avoidance algorithm for traffic-constrained enroute airspace. 3. A novel representation of 4D air traffic scenario that allows the use of an evolutionary computation methodology to evolve complex conflict scenarios for the evaluation of conflict detection algorithms. 4. An evaluation framework where scenario generation, scenario evaluation and scenario evolution processes can be carried out in an integrated manner for rigorous evaluation of advanced ATM concepts. 5. A methodology for forming an intelligent ensemble of conflict detection algorithms by data mining the scenario space.

Els sistemes de còmput complexos com els Serveis de Motors de Cerca proveeixen serveis a milions d'usuaris, i la seva demanda pot canviar sobtadament. Aquesta inestable demanda impacta significativament als components del servei (com xarxa de dades i nodes). El sistema hauria de ser capaç de gestionar escenaris inesperats, d'altra manera, els usuaris es podrien veure forçats a deixar el sistema. Un motor de cerca té una típica arquitectura composta per un Front Service que processa les sol·licituds dels usuaris, un Index Service que emmagatzema la informació recopilada d'Internet i un Cache Service que gestiona l'accés eficient al contingut d'ús més freqüent. Els avanços científics que proveeixen aquests serveis són en general tecnologia emergent. Els serveis de xarxa d'un motor de cerca requereixen una planificació especialitzada; la present investigació es desenvolupa amb l'estudi del patró de tràfic d'un motor de cerca i el disseny d'un model de enrutament dels missatges entre els nodes de la xarxa basats en les condicions de fluxos de dades del motor de cerca. El resultat esperat és un servei de xarxa especialitzat en el tràfic d'un motor de cerca que assigni els recursos de la xarxa de forma eficient segons sigui la demanda que suporta en temps real. La verificació del patró de tràfic va permetre identificar condicions de desequilibri de la xarxa de dades i congestió de missatges, així que es va dissenyar un model que combina diferents models de enrutament de la literatura i nous criteris basats en les condicions específiques del tràfic del motor de cerca. Per al disseny d'aquesta proposta ha estat necessari dissenyar un model a escala del motor de cerca utilitzant tècniques de simulació i s'ha usat tràfic d'un sistema real que ha permès verificar de forma precisa el model proposat i comparar-lo amb models de enrutament actualment disponibles a la literatura i tecnologia actual. Els resultats obtinguts demostren que el model proposat millora el rendiment de la xarxa del motor de cerca en termes de latència i throughput de la xarxa.
Los sistemas de cómputo complejos como los Servicios de Motores de Búsqueda proveen servicios a miles de usuarios, y su demanda puede cambiar repentinamente. Esta inestable demanda impacta significativamente a los componentes del servicio (como red de datos y nodos). El sistema debería ser capaz de gestionar escenarios inesperados, de otro modo, los usuarios se podrían ver forzados a dejar el sistema. Un motor de búsqueda tiene una típica arquitectura compuesta por un Front Service que procesa las solicitudes de usuarios, un Index Service que almacena la información recopilada de Internet y un Cache Service que gestiona el acceso eficiente a contenido de uso más frecuente. Los avances científicos que proveen estos servicios son en general tecnología emergente. Los servicios de red de un motor de búsqueda requieren de una planificación especializada; la presente investigación se lleva a cabo con el estudio del patrón de tráfico de un motor de búsqueda y el diseño de un modelo de enrutamiento de los mensajes entre los nodos de la red basado en las condiciones de flujo de datos del motor de búsqueda. El resultado esperado es un servicio de red especializado en el tráfico de un motor de búsqueda que asigne los recursos de red de forma eficiente según sea la demanda que soporta en tiempo real. La evaluación del patrón de tráfico permitió identificar condiciones de desbalance de la red de datos y congestión de mensajes, de modo que se diseñó un modelo que combina diferentes modelos de enrutamiento de la literatura y nuevos criterios basados en las condiciones específicas del tráfico del motor de búsqueda. Para el diseño de ésta propuesta ha sido necesario diseñar un modelo a escala del motor de búsqueda utilizando técnicas de simulación y se ha utilizado tráfico de un sistema real que ha permitido evaluar de forma precisa el modelo propuesto y compararlo con modelos de enrutamiento actualmente disponibles en la literatura y tecnología actual. Los resultados obtenidos demuestran que el modelo propuesto mejora el rendimiento de la red del motor de búsqueda en términos de latencia y throughput de la red.
Large-scale computer systems like Search Engines provide services to thousands of users, and their user demand can change suddenly. This unstable demand impacts sensitively to the service components (like network and hosts). The system should be able to address unexpected scenarios; otherwise, users would be forced to leave the service. A search engine has a typical architecture consisting of a Front Service, that processes the requests of users, an Index Service that stores the information collected from the internet and a Cache Service that manages the efficient access to content frequently used. The scientific advances that provide these services are in general emergent technology. The network services of a search engine require specialized planning; This research is carried out by studying the traffic pattern of a Search Engine and designing a routing model for messages between network nodes based on the data flow conditions of the Search Engine Service. The expected result is a network service specialized in the traffic of a Search Engine that allocates network resources efficiently according to demand it supports in real time. The evaluation of the traffic pattern allowed us to identify conditions of unbalance of the network and congestion of messages. Therefore model designed combines different routing models of the literature and a new criteria based on the specific conditions of the traffic of the Search Engine. For the design of this proposal it has been necessary to design a scale model of a Search Engine using simulation techniques and It has has used traffic from a real system that allowed us to accurately evaluate the proposed model and compare it with currently available routing models in the literature and technology. The results show that the proposed model improves the performance of the Search Engine network in terms of latency and network throughput.

The thesis proposes an optimization algorithm used a genetic algorithm. Optimization problem is demonstrated on issues of left turn which meets the requirements for systematic optimization - complexity of the problem, which can not be solved analytically, and the possibility of using templates, which enable automation of design and calculation of all variants.

La Tuberculosis es una de las enfermedades más letales a nivel mundial. Los esfuerzos en salud pública están dirigidos a la temprana detección de los casos bacilíferos, ya que son la fuente de infección. En el mundo la detección se realiza mediante baciloscopía, que consiste en la observación de muestras de esputo para identificar y contar bacilos con la ayuda de un microscopio. Sin embargo, el procedimiento es subjetivo y consume excesivo tiempo al personal de salud. El presente estudio tiene como objetivo identificar bacilos en imágenes digitales captadas desde el microscopio. Dichas imágenes muestran bacilos y otros artefactos con el mismo color. Ambos tipos de estructura se almacenaron y etiquetaron individualmente conformando la base de datos. Se analizó el espectro de magnitudes de los descriptores de Fourier de dichas estructuras, con el fin de seleccionar los necesarios para la óptima caracterización e identificación. Mediante el método sub-óptimo de selección de características hacia atrás (backward feature selection) se determinó los 14 descriptores que mejor discriminan entre las clases. Para comprobar este método se diseño un programa que procesó las 480 estructuras de la base de datos. Dicho programa obtuvo un porcentaje de acierto de 96.86%, una sensibilidad de 100% y una especificidad de 91.47% El estudio demuestra que es posible la identificación de bacilos mediante la clasificación de descriptores de Fourier previamente seleccionados. Estos resultados sugieren que las técnicas de procesamiento de imágenes digitales tienen el potencial de agilizar el diagnóstico de Tuberculosis.
Tesis

Mestrado em Matemática Aplicada
Nesta dissertação estuda-se o planeamento de redes com custo ótimo para o utilizador. Uma das aplicações deste problema é o transporte de materiais perigosos, que devido aos seus elevados níveis de risco, sensibilizam a população para esta atividade. Existem alguns métodos exatos e heurísticos para resolver o problema. Um método exato consiste em adaptar um algoritmo enumerativo proposto na literatura para resolver um problema de programação linear inteira em dois níveis. Nesta adaptação problemas de caminho mais curto surgem como subproblemas que necessitam ser resolvidos de forma efciente.
In this work we study a network planning problem with optimal cost for the user. One application of this problem is the transportation of hazardous materials. In the literature, we and some exact and heuristics methods to solve this problem. In this work another exact method to this problem is studied: we adapt an enumerative algorithm proposed in the literature to the solution of 0-1 bilevel linear programming problems. In this adaptation shortest path problems arise as subproblems that need to be solved effciently.

Eine Herausforderung der Softwareentwicklung ist, die Korrektheit einer Software sicherzustellen. Testen bietet es keine mathematische Korrektheit. Formale Verifikation ist jedoch oft zu aufwändig. Laufzeitverifikation steht zwischen den beiden Methoden. Laufzeitverifikation beantwortet die Frage, ob ein Eingabe-Ausgabe-Paar korrekt ist. Ein zertifizierender Algorithmus überzeugt seinen Nutzer durch ein Korrektheitsargument zur Laufzeit. Dafür berechnet ein zertifizierender Algorithmus für eine Eingabe zusätzlich zur Ausgabe noch einen Zeugen – ein Korrektheitsargument. Jeder zertifizierende Algorithmus besitzt ein Zeugenprädikat: Ist dieses erfüllt für eine Eingabe, eine Ausgabe und einen Zeugen, so ist das Eingabe-Ausgabe-Paar korrekt. Ein simpler Algorithmus, der das Zeugenprädikat für den Nutzer entscheidet, ist ein Checker. Die Korrektheit des Checkers ist folglich notwendig für den Ansatz und die formale Instanzverifikation, bei der wir Checker verifizieren und einen maschinen-geprüften Beweis für die Korrektheit eines Eingabe-Ausgabe-Paars zur Laufzeit gewinnen. Zertifizierende sequentielle Algorithmen sind gut untersucht. Verteilte Algorithmen, die auf verteilten Systemen laufen, unterscheiden sich grundlegend von sequentiellen Algorithmen: die Ausgabe ist über das System verteilt oder der Algorithmus läuft fortwährend. Wir untersuchen zertifizierende verteilte Algorithmen. Unsere Forschungsfrage ist: Wie können wir das Konzept zertifizierender sequentieller Algorithmen so auf verteilte Algorithmen übertragen, dass wir einerseits nah am ursprünglichen Konzept bleiben und andererseits die Gegebenheiten verteilter Systeme berücksichtigen? Wir stellen eine Methode der Übertragung vor. Die beiden Ziele abwägend entwickeln wir eine Klasse zertifizierender verteilter Algorithmen, die verteilte Zeugen berechnen und verteilte Checker besitzen. Wir präsentieren Fallstudien, Entwurfsmuster und ein Framework zur formalen Instanzverifikation.
A major problem in software engineering is to ensure the correctness of software. Testing offers no mathematical correctness. Formal verification is often too costly. Runtime verification stands between the two methods. Runtime verification answers the question whether an input-output pair is correct. A certifying algorithm convinces its user at runtime by offering a correctness argument. For each input, a certifying algorithm computes an output and additionally a witness. Each certifying algorithm has a witness predicate – a predicate with the property: being satisfied for an input, output and witness implies the input-output pair is correct. A simple algorithm deciding the witness predicate for the user is a checker. Hence, the checker’s correctness is crucial to the approach and motivates formal instance verification where we verify checkers and obtain machine-checked proofs for the correctness of an input-output pair at runtime. Certifying sequential algorithms are well-established. Distributed algorithms, designed to run on distributed systems, behave fundamentally different from sequential algorithms: their output is distributed over the system or they even run continuously. We investigate certifying distributed algorithms. Our research question is: How can we transfer the concept of certifying sequential algorithms to distributed algorithms such that we are in line with the original concept but also adapt to the conditions of distributed systems? In this thesis, we present a method to transfer the concept: Weighing up both sometimes conflicting goals, we develop a class of certifying distributed algorithms that compute distributed witnesses and have distributed checkers. We offer case studies, design patterns and a framework for formal instance verification. Additionally, we investigate other methods to transfer the concept of certifying algorithms to distributed algorithms.

In this paper we suggest a lightning detection system capable of warning a local populous of incoming lightning weather using a combination of the AS3935 sensor and the one-board-computer Raspberry Pi, in an attempt to design a product that is cheap, mobile and easy to use. The product is composed of a sensor net that registers and reports lightnings on a webserver. The server is reachable as a normal website based on the LAMP method. The project reached a stadium which should satisfy a “proof of concept”, however, the product is far from complete, as it lacks the necessary algorithms needed for proper data computation. The current system only uses Raspberry pi, but it is theoretically possible to introduce other hardware to the system, but the current developed product does not support such functionality.
I den här rapporten föreslår vi ett blixtlokaliseringssystem kapabelt att varna lokal befolkningen om inkommande blixtväder med hjälp av en kombination av sensorn AS3935 och enchipsdatorn Raspberry Pi, i ett försök att skapa en produkt som är billig, mobil och användarvänlig. Systemet består av ett nät av sensorer som registrerar och rapporterar blixtaktivitet på en webbserver. Servern är nåbar som en vanlig hemsida som är byggd enligt LAMP metoden. Projektet har nått ett stadium som borde uppnå kraven för ett ”bevis av ett koncept”, men produkten är långt ifrån färdig, då den saknar de nödvändiga algoritmerna som krävs för ordentlig databehandling. Det nuvarande systemet använder sig enbart av Rasberry Pi:s, men i teorin vore det fullt möjligt att introducera ny hårdvara i nätet, men den nuvarande produkten stöder inte sådan funktionalitet.

Cette thèse porte sur la caractérisation de structures mécaniques, au travers de leurs paramètres structuraux, à partir d'observations perturbées par des bruits de mesure, supposés additifs blancs gaussiens et centrés. Pour cela, nous proposons d'utiliser des modèles à temps discret à parties linéaire et non-linéaire séparables. La première permet de retrouver les paramètres recherchés tandis que la seconde renseigne sur la non-linéarité présente. Dans le cadre d'une modélisation non-récursive par des séries de Volterra, nous présentons une approche à erreurs-dans-les-variables lorsque les variances des bruits ne sont pas connues ainsi qu'un algorithme adaptatif du type LMS nécessitant la connaissance de la variance du bruit d'entrée. Dans le cadre d'une modélisation par un modèle récursif polynomial, nous proposons deux méthodes à partir d'algorithmes évolutionnaires. La première inclut un protocole d'arrêt tenant compte de la variance du bruit de sortie. Dans la seconde, les fonctions fitness sont fondées sur des fonctions de corrélation dans lesquelles l'influence du bruit est supprimée ou compensée
This PhD deals with the caracterisation of mechanical structures, by its structural parameters, when only noisy observations disturbed by additive measurement noises, assumed to be zero-mean white and Gaussian, are available. For this purpose, we suggest using discrete-time models with distinct linear and nonlinear parts. The first one allows the structural parameters to be retrieved whereas the second one gives information on the nonlinearity. When dealing with non-recursive Volterra series, we propose an errors-in-variables (EIV) method to jointly estimate the noise variances and the Volterra kernels. We also suggest a modified unbiased LMS algorithm to estimate the model parameters provided that the input-noise variance is known. When dealing with recursive polynomial model, we propose two methods using evolutionary algorithms. The first includes a stop protocol that takes into account the output-noise variance. In the second one, the fitness functions are based on correlation criteria in which the noise influence is removed or compensated

[EN] In this Thesis, we analyze an industry type that has two basic features: Its products are distributed in a geographic level and it reuses material after that is consumed to made new products. Because of these features, it represents a logistics challenge. This kind of supply chains is characterized also by having various stages that permit to carry the products from facility plants to the final customer. First, it is analyzed the supply chain structure, from production, in facility plants to the final customer by retailers, downstream; and from the customer, when returnable materials are liberated, classification and transport upstream to facility plants , where are prepared and used many times, until the end of their usable life. The attention focus is the integration of two fundamental functions of the supply chain management, in this case, production planning and distribution planning including the collection of reusable materials. It is precise to plan the production to satisfy retailers demand and to the procurement of returnable materials which after being consumed return to the process. It is made a bibliographical review about production planning, reverse logistics and vehicle routing and, it is built mathematical programming models to make decisions in production planning (in facility plants), inventories planning (in all the supply chain), and the deliveries that should be done in both senses in their respective routes. As a result of this research, there are three models of Mixed Integer Linear Programming: -Production planning model: Mathematical model which represents all the facilities in each one of the levels of the supply chain and their geographical localization. It lets to determine production and stock levels and delivery quantities in order to satisfy the demands in a planning horizon of several periods. This model has capacity constraints for both production and storage, constraints of demand, compatibility between products and facilities because not all the products can be in all facilities, and constraints of direct deliveries among determinate nodes in the supply chain (particularly between plants and retailers), especially. -Vehicle routing model: mathematical model that represents products distribution from different source nodes to destine nodes, it use a heterogeneous fleet, in a time period. One of the model assumptions is that a node acts as product emitting or recipient (facility plants or retailers). However, an intermediate node can take one of these roles depending if is the origin or destine of goods. This model has fleet use constraints, volume, and mass capacity vehicle constraints, fluxes in the supply chain. A vehicle can visit several destine nodes after leave from a source node, and a node can be visited by one or more vehicles (because of compatibility conditions between products and nodes or by economical aspects) and there are soft and strong time windows. -Integrated logistics and production management model: It is a model that join the two previous models, because of it, it is possible to plan production, inventories, and vehicle routing for a horizon time of several periods. Three proposed models have the objective of minimizing the total cost and are evaluated with testing instances. The Models were built using Gurobi 6.5.1 optimization model and Python2.7 pro- gramming language. Moreover, it was built a constructive heuristics and a genetic algorithm using Python programming language and Pyevolve software, as an alternative to solving routing vehicles, to reduce execution time.
[ES] En esta tesis se analiza un tipo de industria en el que: sus productos son distribuidos ampliamente a nivel geográfico y emplean elementos que una vez usados regresan al proceso de fabricación para hacer parte de nuevos productos. Este tipo de cadena se caracteriza por la presencia de varios eslabones que permiten acercar el producto al consumidor final. Se hace un análisis de la estructura de la cadena de suministros, desde la producción, en las plantas hasta su llegada al cliente final por intermedio de los detallistas, en el sentido "aguas abajo", y desde el consumo del producto y la consecuente liberación de los materiales reutilizables que deben conducirse "aguas arriba" hasta las plantas de producción, donde son preparados y utilizados una y otra vez hasta el final de su vida útil. El foco de atención consiste en la integración de dos funciones fundamentales de la cadena de suministros: la planeación de la producción y la distribución del producto con la consecuente recolección de los materiales de retorno. Se precisa realizar la planeación de la producción de manera que dé satisfacción a la demanda que tiene lugar en los detallistas, y que se abastezca de los materiales de retorno que una vez consumido el producto se reincorporan al proceso. Se hace una revisión bibliográfica sobre planeación de la producción, logística inversa y ruteo de vehículos y; se construyen modelos de programación matemática que soportan la toma de decisiones en la planeación de la producción, de los inventarios (en toda la cadena de suministros), y de los envíos que deben realizarse en uno y otro sentido en las correspondientes rutas. Como resultado de la investigación se presentan tres modelos de programación lineal entera mixta (MILP), así: -Modelo de planeación de la producción: representa la cadena de suministros a partir de las instalaciones de cada uno de los niveles y su ubicación geográfica, y determina los volúmenes a producir, a almacenar y las cantidades que se deben enviar desde cada nodo de la cadena de suministros a los demás, de modo que se satisfaga la demanda en un horizonte de planeación compuesto por varios periodos. Este modelo presenta restricciones de capacidad tanto de producción como de almacenamiento, de demanda, de compatibilidad de productos con las instalaciones, y de envíos directos entre determinados nodos de la cadena de suministros. -Modelo de ruteo de vehículos: representa la forma en que se deben distribuir los productos desde los diferentes nodos fuente a los diferentes nodos destino, haciendo uso de una flota heterogénea de vehículos, en un periodo de tiempo. El modelo se hace bajo el supuesto de que los nodos son o emisores o receptores del producto, un nodo intermedio asume uno de estos roles según si es origen o destino de las mercancías. Presenta restricciones asociadas al uso de la flota, a su capacidad tanto en masa como en volumen, los flujos a lo largo de la cadena bajo la premisa de que un vehículo parte de un nodo fuente y puede visitar varios nodos destino antes de regresar, y de que un nodo puede ser visitado por varios vehículos (por condiciones de compatibilidad entre nodos y productos o porque resulta más económico), ante la presencia de ventanas de tiempo tanto rígidas como suaves. -Modelo integrado de gestión de producción y logística: reúne los dos modelos anteriores, es decir, permite la planeación de la producción, la gestión de los inventarios y el ruteo de vehículos para un horizonte de planeación determinado. Los tres modelos se proponen con el objetivo de minimizar los costes totales y son evaluados con instancias de prueba. Los modelos fueron implementados haciendo uso del software de optimización Gurobi y del lenguaje de programación Python. Además, se implementó una heurística constructiva y un algortimo genético utilizando Python y el software Pyevolve, como alternativa a la solución del VRP, para reducir el tiem
[CAT] Aquesta tesi s'analitza un tipus d'indústria que: els seus productes són distribuïts àmpliament a nivell geogràfic i fan ús d'elements que una vegada usats tornen al procés de fabricació per a fer part dels nous productes. Aquest tipus de cadenes es caracteritza per la presència de diversos eslavons que permeten acostar el producte des de les plantes de producció fins a arribar al consumidor final. Es fa una anàlisi de l'estructura de la cadena de subministraments, des de la producció, en les plantes fins a la seua arribada al client final per mitjà dels detallistes, en el sentit "aigües a baix", i des del consum del producte i el conseqüent alliberament dels materials reutilitzables que han de conduir-se "aigües a dalt" fins a les plantes de producció, on són preparats i utilitzats una vegada i una altra, fins al final de la seua vida útil. El focus d'atenció consisteix en la integració de dues funcions fonamentals de la cadena de subministraments: la planificació de la producció i la distribució del producte amb la conseqüent recol·lecció dels materials de tornada. Sobre aquest tema, es precisa realitzar la planificació de la producció de manera que done satisfacció a la demanda que té lloc en els detallistes, i que es proveïsca dels materials de tornada que, una vegada consumit el producte, es reincorporen al procés. Es fa una revisió bibliogràfica del relacionat amb planificació de la producció, logística inversa i enrutament de vehicles i es construeixen models de programació matemàtica que suporten la presa de decisions en la planificació de la producció, dels inventaris (tota la cadena de subministraments), i dels enviaments que han de realitzar-se en un i un altre sentit en les corresponents rutes. Com a resultat de la recerca es presenten tres models de Programació Lineal Sencera Mixta (MILP), així: -Model de planificació de la producció: representa la cadena de subministraments a partir de les instal·lacions de cadascun dels nivells i la seua ubicació geogràfica, i es determinen els volums a produir, a emmagatzemar i les quantitats que s'han d'enviar des de cada node de la cadena de subministraments als altres, de manera que se satisfaça la demanda en un horitzó de planificació compost per diversos períodes. Aquest model presenta restriccions de capacitat tant de producció com d'emmagatzematge, de demanda, de compatibilitat de productes amb les instal·lacions, i d'enviaments directes entre determinats nodes de la cadena de subministraments, entre altres aspectes. -Model de enrutament de vehicles: representa la forma en què s'han de distribuir els productes des dels diferents nodes font als diferents nodes destine, fent ús d'una flota heterogènia de vehicles, en un període de temps. Els nodes són o emissors o receptors del producte, encara que en la seua utilització un node intermedi pot assumir un d'aquests rols segons si és origen o destinació de les mercaderies. Per a aquest model es tenen en compte les restriccions associades a l'ús de la flota, a la seua capacitat tant en massa com en volum, els fluxos al llarg de la cadena sota la premissa que un vehicle parteix d'un node font i pot visitar diversos nodes destine abans de tornar, i que un node pot ser visitat per diversos vehicles, davant la presència de finestres de temps tant rígides com suaus. -Model integrat de gestió de producció i logística: reuneix els dos models anteriors, és a dir, permet la planificació de la producció, la gestió dels inventaris i el enrutament de vehicles per a un horitzó de planificació determinat. Els tres models es proposen amb l'objectiu de minimitzar els costos totals i són avaluats amb instàncies de prova, apropiades. Els models van ser implementats fent ús del programari d'optimització Gurobi i del llenguatge de programació Python. A més, es va implementar una heurística constructiva i un algortime genètic utilitzant Python i el programari Pye
Parra Peña, J. (2016). Modelizado para la planeación de la producción y la logística directa e inversa de una cadena de suministro cuyo abastecimiento depende parcialmente de los materiales de retorno [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/73726
TESIS

El desarrollo sostenible de las zonas urbanas es un reto de alto interés a nivel mundial. En los años 70 nadie podía haber pensado en la información como un activo de nuestra sociedad. Hoy en día las nuevas tecnologías ponen a nuestro alcance una ingente cantidad de recursos impensable para manejar todos los datos generados por la ciudad. Una gestión adecuada de la ciudad dependerá del continente, de la cantidad y de la naturaleza de los datos y de los recursos e infraestructuras a tener en cuenta. Esto es el inicio de lo que puede hacer cambiar el concepto actual de ciudad permitiendo una mayor conectividad e interacción autónoma, sin intervención humana, entre todos los servicios que caracterizan un núcleo urbano, aproximándonos de este modo a lo que sería la 'ciudad inteligente' o SmartCity. Para desarrollar este concepto, una característica de gran importancia que debe tenerse en cuenta es la movilidad de los elementos que la componen y le dan vida, pues es aquello que permite el día a día en el núcleo urbano. Un elemento muy importante en este contexto es el vehículo eléctrico (FEV, 'Full Electric Vehicle'), por todas las razones que vemos en nuestro trabajo. Para una adecuada puesta en marcha del FEV es necesario integrarlo con el resto de infraestructuras que influyen en la movilidad en la ciudad. Esto permitirá hacer realidad ese nuevo modelo urbano inteligente que pretendemos alcanzar y que es nuestro futuro. Nuestro trabajo ha consistido en investigar y diseñar una solución de interoperabilidad que gestione la utilización del FEV en un entorno urbano, aprovechando las infraestructuras existentes, optimizando los recursos de que disponemos, e integrando las posibilidades de comunicación que las TIC nos ofrecen. Nos planteamos dos objetivos en nuestro trabajo, el primero de los cuales es integrar y poner en marcha el FEV en la SmartCity. Para ello hemos necesitado estudiar las partes más relevantes de un sistema de información centralizado para controlar la autonomía del FEV en la SmartCity, prever la demanda de energía a la red (es decir, estimar la energía total que tendrá que disponer inicialmente la red para atender la posible demanda de energía), controlar la disponibilidad neta de energía en las estaciones de carga de la red y finalmente diseñar el proceso de gestión activa de la demanda que permita optimizar el consumo energético y los precios. Por otra parte, el segundo de nuestros objetivos consiste en estudiar cómo los factores que intervienen en la movilidad dentro de la SmartCity pueden garantizar que el desplazamiento del FEV se lleve a cabo según lo planificado y con ello integrar adecuadamente los FEV en el sistema de movilidad urbano. Es decir, se trata de integrar el entorno de gestión del FEV, estudiado en la primera parte, con el entorno externo al FEV en la SmartCity, proporcionando así una solución global al problema de integración del FEV en el nuevo ecosistema de ciudades europeas. Para ello se requiere optimizar la interacción entre el FEV y los servicios de información meteorológica, de tráfico y de movilidad en la ciudad como son el transporte público, el estacionamiento y el alquiler (e-sharing), además de una necesaria estrategia de predicción del tráfico para la toma anticipada de decisiones.
Sustainable development of urban areas is a challenge of highest interest at global level. Never before could anyone have thought of the information as an asset of our society. The advent of the new technologies have provided us with a huge amount of unthinkable resources to manage the data generated by the city and make urban areas evolve. Nowadays a proper management of the city will depend on the continent, the amount and nature of the data and the resources and infrastructures to be taken into account. This is the beginning of what will make the current concept of city change. The new model of the city we will face is due to a higher connectivity and interaction, without human intervention, among all the services that determine an urban centre. This is an approach to what would be the 'intelligent city' or SmartCity. To develop this concept, a feature of paramount importance is the mobility of the elements that form it and make it live, as it is what supports the daily routine in the urban model. A very important element in this context is the electric vehicle (FEV, 'Full Electric Vehicle'), for all the reasons we see in our work. For a proper launching of the FEV it is necessary to integrate it with the rest of infrastructures that influence the mobility in the city. Our work has consisted of researching and designing an interoperability solution to manage the use of the FEV in the urban landscape. The first of our goals in this work is to put the FEV in place into the SmartCity. To achieve it, it is required to study the most relevant parts of a centralised information system in order to manage the vehicle autonomy, the energy demand in the city, the energy availability in each charge station and a user interface to communite with the system. Moreover, the system will be able to manage, in a proactive way, the needs of the network in order to optimise costs and improve efficiency. On the other hand, the second of our objectives is to study how the factors involved in the mobility within the SmartCity can ensure that FEV mobility is carried out as planned and, with it, conveniently integrate the FEV in the urban mobility system. In other words, our aim is to integrate the FEV management landscape, studied in the first part, with the other agents of mobility into the SmartCity, thus providing a comprehensive solution to the problem of integration of the FEV in the new European cities ecosystem. This requires optimizing the interaction between the FEV and the meteorological information, traffic and mobility services in the city such as public transport, parking and e-sharing, in addition to a necessary traffic forecasting strategy for the early decision-making.
El desenvolupament sostenible de les zones urbanes és un repte d'alt interès a nivell mundial. Fins els anys 70 ningú podia haver pensat en la informació com un actiu de la nostra societat. Avui en dia les noves tecnologies posen al nostre abast una ingent quantitat de recursos impensable per a gestionar totes les dades generades per la ciutat. Una gestió adequada de la ciutat dependrà del continent, de la quantitat i de la naturalesa de les dades i dels recursos i infraestructures a tenir en compte. Això és l'inici del que pot fer canviar el concepte actual de ciutat permetent una major connectivitat i interacció autònoma, sense intervenció humana, entre tots els serveis que caracteritzen un nucli urbà, aproximant d'aquesta manera el que serà la 'ciutat intel·ligent 'o SmartCity. Per desenvolupar aquest concepte, una característica de gran importància que cal tenir en compte és la mobilitat dels elements que la componen i li donen vida, ja que és allò que permet el dia a dia al nucli urbà. Un element molt important en aquest context és el vehicle elèctric (FEV, 'Full Electric Vehicle'), per totes les raons que veiem al nostre treball. Per a una adequada posada en marxa del FEV cal integrar-lo amb la resta d'infraestructures que influeixen en la mobilitat a la ciutat. Això permetrà fer realitat aquest nou model urbà intel·ligent que pretenem assolir. És sense dubte el nostre futur. El nostre treball ha consistit en investigar i dissenyar una solució d'interoperabilitat que gestione la utilització del FEV en un entorn urbà, aprofitant les infraestructures existents, optimitzant els recursos de què disposem, i integrant les possibilitats de comunicació que les TIC ens ofereixen. Ens plantegem dos objectius en el nostre treball, el primer dels quals és integrar i posar en marxa el FEV a la SmartCity. Per a això hem necessitat estudiar les parts més rellevants d'un sistema d'informació centralitzat per controlar l'autonomia del FEV a la SmartCity, preveure la demanda d'energia a la xarxa (és a dir, estimar l'energia total que haurà de disposar inicialment la xarxa per atendre la possible demanda d'energia), controlar la disponibilitat neta d'energia a les estacions de càrrega de la xarxa i finalment dissenyar el procés de gestió activa de la demanda que permeti optimitzar el consum energètic i els preus. D'altra banda, el segon dels nostres objectius consisteix a estudiar com els factors que intervenen en la mobilitat dins de la SmartCity poden garantir que el desplaçament del FEV es dugui a terme segons el planificat i amb això integrar adequadament els FEV en el sistema de mobilitat urbà. És a dir, es tracta d'integrar l'entorn de gestió del FEV, ja estudiat en la primera part, amb l'entorn extern al FEV a la SmartCity, proporcionant així una solució global al problema d'integració del FEV en el nou ecosistema de ciutats europees. Per a això es requereix optimitzar la interacció entre el FEV i els serveis d'informació meteorològica, de trànsit i de mobilitat a la ciutat com són el transport públic, l'estacionament i el lloguer (e-sharing), a més d'una necessària estratègia de predicció del trànsit per a la presa anticipada de decisions.
Fernández Pallarés, V. (2018). Interoperabilidad en el futuro ecosistema europeo de ciudades inteligentes [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/106365
TESIS

碩士
國立臺灣大學
電機工程學系
85
Due to the rapid progress of the ATM(Asynchronous Transfer Mode) technology, ATM has been wildly applied in computer network. ATM could afford to provide differentservices : constant bit rate (CBR), variable bit rate (VBR), available bit rate (ABR) and undefined service rate (UBR). Though every service has its own request of quality of service(QoS), its QoS will be affected in real network due to switching nodes. To solve the problem, a traffic shaper is provided.There are many discussions about traffic shaper, but not about CBR traffic shapers. The QoS of CBR stream is to allow an amount of jitter tolerance at a fixed period. All different kinds of CBR streams multiplexing on the multiplexer will result in jitter effect with each other. Eventually, QoS will be affected. In this paper, we provide a CBR traffic shaper to solve this problem. A CBR traffic shaper is divided into two parts: the front stage is the regulator, whichis to reduce jitter for those incoming streams and we will proposea simple and reasonable method; the next stage is the scheduler, which is to schedule the departure time of the cell from the regulator in avoidance with the chance of other cells' departure on the same slot time. FCFS (First Come First Serve) and EDD (Earliest Due-date) are the most popular methods for scheduling. In addition to them, we will propose a novel design:the Bipartite Algorithm, which could predict the possible events in the future and schedule the departure time of every cellexactly. Besides, we will discuss the modification of bipartite algorithm on every possible condition. In the last, we will compare threealgorithm via simulation results.

碩士
國立臺北科技大學
冷凍空調工程系所
93
The general chiller host revolves the usage of optimization, primarily focuseding on solving optimal chiller loading ( Optimal Chiller Loading brief name OCL) and optimal chiller scheduling ( Optimal Chiller Scheduling brief name OCS) , solve the two process methods after former research method also solve the optimal chiller loading first than the optimal chiller schesduling, past if can solving optimal chiller loading and optimal chiller scheduling to integrate to a solves the process method, not only can simplify the problem, but also saving to operate time. The genetic algorithm（GA） is the operation method that a kind of emulation nature evolves the way, in order to attain the Theory of Evolution of the text of " the proper exists, the unwell eliminates", theories foundation just so-called" the life is always would find out the loop for the oneself", as long as lift to go wrong, the way that will have resolved, this papers borrows with the genetic algorithm operation logic and it can on the computer fast operation ability to the usage problem that solve the air condition chiller operation optimization, expect to integrate the Optimal Chiller Loading and Optimal Chiller Scheduling for a purpose that solve process, make machine set work in biggest efficiency with attain economize energy, program a best air condition load control and comfortable air condition environment.

碩士
中華大學
科技管理學系(所)
95
Service time estimation has become increasingly important in a variety of service industries, particularly in those allowing reservations of service, which can greatly affect the service quality. The service time is usually determined by a number of factors, which are often unpredictable or non-linearly dependent of these factors. Such a situation has increased the difficulty in predicting the expected service time, resulting in system inefficiency because of increased customer waiting time, and the degradation of the service quality. This paper, focusing on the beauty solon industry, proposes a prediction model based on the service times collected in three months for evaluating the factor weights in order to estimate the service time in a more accurate way for a reservation using genetic algorithms. The testing results show that significant improvements have obtained by using the proposed model in terms of the averaged service time and the human-intervened judgments. The proposed model can be applied in numerous service industries where multiple factors are of concerned.

Trabalho final para a Licenciatura de Informática apresentada à Universidade Aberta, 2008
O presente trabalho tem como objectivo a implementação do algoritmo apresentado em [E. Demeulemeester, B. Dodin, and W. Herroelen, “A Random Activity Network Generator,” Operations Research, vol. 41, no. 5, pp. 972-980, 1993] que permite gerar redes actividades nos arcos, seguindo a filosofia de Engine Tester.

博士
國立清華大學
通訊工程研究所
95
The kurtosis maximization criterion has been effectively used for blind spatial extraction of one source from an instantaneous mixture of multiple non-Gaussian sources, such as the kurtosis maximization algorithm proposed by Ding and Nguyen, and the fast kurtosis maximization algorithm (FKMA) proposed by Chi et al. By empirical studies we found that the smaller the normalized kurtosis magnitude of the extracted source signal, the worst the performance of these algorithms. In this thesis, with the assumption that each source is a non-Gaussian linear process, a novel blind source extraction algorithm, called turbo source extraction algorithm (TSEA), is proposed. The ideas of the TSEA are to exploit signal temporal properties for increasing the normalized kurtosis magnitude, and to apply spatial and temporal processing in a cyclic fashion to improve the signal extraction performance. The proposed TSEA not only outperforms the FKMA, but also shares the convergence and computation advantages enjoyed by the latter. This thesis also considers the extraction of multiple sources, also known as source separation, by incorporating the proposed TSEA into the widely used multistage successive cancellation (MSC) procedure. A problem with the MSC procedure is its susceptibility to error propagation accumulated at each stage. Therefore, we propose two noncancellation multistage (NCMS) algorithms, referred to as NCMS-FKMA and NCMS-TSEA, that are free from the error propagation effects. In this thesis, the FKMA is further applied to blind multiuser detection and blind space-time decoding (BSTD) for multicarrier code-division multiple access (MC-CDMA) systems. Assuming that all the users' spreading sequences are given \emph{a priori}, a blind multiuser detection algorithm (BMDA), which comprises FKMA and a user identification algorithm, for the uplink of a quasi-synchronous modified MC-CDMA system (with multiple receive antennas) and a BSTD algorithm, which comprises FKMA and blind maximum ratio combining (BMRC), for the down-link of a space-time coded MC-CDMA system (with multiple transmit and receive antennas used) are proposed. Moreover, the FKMA is applied to blind multiuser detection for asynchronous multi-rate direct sequence/code division multiple access (DS/CDMA) systems. The ideas are to properly formulate discrete-time multiple-input multiple-output (MIMO) signal models by converting real multi-rate users into single-rate virtual users, followed by the use of FKMA for extraction of virtual users' data sequences associated with the desired user, and recovery of the data sequence of the desired user from estimated virtual users' data sequences. Therefore, two multi-rate BMDAs (with either a single receive antenna or multiple receive antennas), which also enjoy the merits of super-exponential convergence rate and guaranteed convergence of the FKMA, are proposed in the thesis, one based on a convolutional MIMO signal model and the other based on an instantaneous MIMO signal model. For blind co-channel interference and intersymbol interference (ISI) reduction in cellular wireless communications, the FKMA is applied to the design of the conventional cascade space-time receiver (CSTR) in this thesis. However, the receiver performance is limited as the normalized kurtosis magnitude of the ISI-distorted signal of interest is small. Then a blind turbo space-time receiver (TSTR) is further proposed that applies spatial and temporal processing using FKMA in a cyclic fashion to estimate the desired data sequence. The performance of the proposed blind TSTR is insensitive to the value of the normalized kurtosis magnitude of the ISI-distorted signal of interest, and therefore is superior to that of the blind CSTR. This thesis also considers blind beamforming of multiuser orthogonal frequency division multiplexing (OFDM) systems. Assuming that the channel is static within one OFDM block, a blind beamforming algorithm by kurtosis maximization based on subcarrier averaging over one OFDM block is proposed, which basically comprises source extraction, time delay estimation and compensation, classification, and BMRC. The designed beamformer is exactly the same for all the subcarriers, effectively utilizes multipath diversity for performance gain, and is robust against the effects of correlated sources. Finally, some simulation results are presented to demonstrate the effectiveness of the proposed blind source separation algorithms, BMDAs, BSTD algorithm, blind CSTR and TSTR, and blind beamforming algorithm.

碩士
樹德科技大學
資訊管理研究所
91
The optimal schedule for containers storage is an important issue for harbors’ activities. With the consideration of space, containers are always stored in stack and accessed only from the tops of stacks. Thus, the cost and efficiency of containers’ management depend on how the inventories are scheduled. Before the sailing date of containers’ exportation, all of containers have to be stacked in container yards. The way of stacking determine the cost and efficiency. Therefore, how containers are moved in and out is an interesting research topic, by which cargo companies can save cost of gasoline and labor hours. 　　The traditional technique to arrange the containers’ schedule is to use experience’s rules by the workers. However it is straightforward without any theoretical support. This study use the genetic algorithm to find the optimal schedule for containers’ storage based on the walking distance and the number of hoists’ raising.

Dissertação de Mestrado Integrado em Engenharia Electrotécnica e de Computadores apresentada à Faculdade de Ciências e Tecnologia
O processo de polimento de um molde ainda é realizado manualmente por trabalhadores ex-perientes que são capazes de ajustar o movimento e força do polimento dependendo das condiçõesda peça de trabalho e baseando-se na sua própria experiência. Este trabalho vai-se focar no desen-volvimento de uma arquitetura de controlo e num algoritmo para executar um padrão desejado pararealizar a tarefa de polimento de uma superfície via telemanipulação.Para isso, um estudo intensivo vai ser realizado para encontrar uma arquitetura de controloviável e desenvolver um sistema de telemanipulação intuitivo que consegue complementar o trabalhodo operador e o Kinova JACO2, o robô que vai ser utilizado para executar a tarefa de polimento eonde todas as arquiteturas de controlo são testadas antecipadamente.As arquiteturas de controlo vão ser implementadas em ambiente de simulação e em ambientereal e correspondem a um controlo do torque computado no espaço das juntas e de tarefa. De seguida,os diferentes controlos de impedância são implementados e testados em ambos os ambientes. Osresultados retirados em espaço-livre com o controlo de impedância não foram satisfatórios devido aproblemas de acoplação entre o controlo de posição e orientação, visto que, a fricção dos atuadoresdo robô nas últimas 3 juntas é dominante, ao contrário ao que acontece nas primeiras 3 onde a massaé que é a componente dominante.Para ultrapassar este problema, mais dois controlos foram desenvolvidos para desacoplar ocontrolo de posição e orientação em dois controladores diferentes. Um destes controladores temem consideração o espaço-nulo da posição quando é computado o torque para a orientação. Estecontrolo é o escolhido para a tarefa de polimento, que também é testada em ambiente de simulaçãoe real.Os resultados obtidos mostram que este controlo pode ser usado, efetivamente, para executaruma tarefa de polimento, apesar de a orientação ainda precisar um pouco mais de trabalho. O al-goritmo desenvolvido dá a possibilidade do operador executar a tarefa uma vez e de seguida o robôreplica as vezes que o operador desejar.
The polishing process of a mold is still applied manually by skilled workers who are capableof adjusting the polishing motion and force according to the workpiece conditions based on theirown experience. This work is going to focus in the development of a control architecture and analgorithm to execute a desired pattern to perform a polishing task of a surface via telemanipulation.For that, an extensive study is going to be made to find a feasible control architecture andto develop an intuitive telemanipulation system that can complement the operator’s work and theKinova JACO2, the robot that is going to be used to execute the polishing task and where all thecontrol architectures are tested beforehand.The control architectures are going to be implemented in simulation and real environment andcorrespond to computed torque control in the joint and task space. Then, the different impedancecontrols are implemented and tested in both environments. The results taken in free-space withthe impedance control were not satisfactory because of coupling problems between the position andorientation control, since in this robot the actuator’s friction in the last 3 joints is dominant as opposedto the first 3 where the mass is.To bypass this problem, two more controls are developed that decouples the position and ori-entation control in two different controllers. One of this controllers takes into consideration thenull-space of the position control when computing the torque for orientation. This is the chosencontrol for the polishing task, which is also tested in simulation and real environment.The results taken show that this control can be effectively used for executing the polishing task,even though the orientation still needs a little more work. Also, the developed algorithm gives thepossibility of an operator to execute the task once and then the robot replicates as many times as theoperator desires.