Global ETD Search

711	Energy-aware scheduling : complexity and algorithms / Ordonnancement sous contrainte d'énergie : complexité et algorithmes Renaud-Goud, Paul 05 July 2012 (has links) Dans cette thèse, nous nous sommes intéressés à des problèmes d'ordonnancement sous contrainte d'énergie, puisque la réduction de l'énergie est devenue une nécessité, tant sur le plan économique qu'écologique. Dans le premier chapitre, nous exhibons des bornes strictes sur l'énergie d'un algorithme classique qui minimise le temps d'exécution de tâches indépendantes. Dans le second chapitre, nous ordonnançons plusieurs applications chaînées de type « streaming », et nous étudions des problèmes contraignant l'énergie, la période et la latence. Nous effectuons une étude de complexité exhaustive, et décrivons les performances de nouvelles heuristiques. Dans le troisième chapitre, nous étudions le problème de placement de répliques dans un réseau arborescent. Nous nous plaçons dans un cadre dynamique, et nous bornons à minimiser l'énergie. Après une étude de complexité, nous confirmons la qualité de nos heuristiques grâce à un jeu complet de simulations. Dans le quatrième chapitre, nous revenons aux applications « streaming », mais sous forme de graphes série-parallèles, et nous tentons de les placer sur un processeur multi-cœur. La découverte d'un algorithme polynomial sur un problème simple nous permet la conception d'heuristiques sur le problème le plus général dont nous avons établi la NP-complétude. Dans le cinquième chapitre, nous étudions des bornes énergétiques de politiques de routage dans des processeurs multi-cœurs, en comparaison avec le routage classique XY, et développons de nouvheuristiques de routage. Dans le dernier chapitre, nous étudions expérimentalement le placement d'applications sous forme de DAG sur des machines réelles. / In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the literature that tackle the problem of mapping DAG applications to minimize the energy consumption. Minimisation d'énergie Puissance Ordonnancement Complexité Heuristique Algorithmes optimaux Algorithme glouton Travaux indépendants Processeurs parallèles Placement Applications concurrentes Plate-forme hétérogène Partage de ressources Énergie Latence Période Placement de répliques Réseau arborescent Stratégies de mise à jour Algorithme de programmation dynamique Graphe série-parallèle Routage Multiprocesseur Manhattan Chemin unique Chemin multiples DAG Energy minimization Power Scheduling Complexity Makespan Heuristics Optimal algorithms Greedy algorithm Independent jobs Parallel processors Mapping Concurrent streaming applications Heterogeneous platforms Resource sharing Energy Latency Period Workflow Replica placement Tree networks Update strategies Dynamic programming algorithms Series-parallel graph Routing Chip multiprocesseur Manhattan Single path Multiple paths Slack reclamation DAG
712	Databáze akustických nahrávek / Database of acoustic records Terz, Marek January 2008 (has links) The databsae of accoustical recordings is a web-based application, which is accessible with an usual web browser. There were used technologies, that are ussually used in web applications. This ensures, that the application is open for using by wide range of users. The application enables uploading WAWE files to the server and allows the user to add various description of the recordings. The application allows also comparing the quality of recordings, which were processed with some method for highlighting the accoustical signal from noise. This function is established by listening tests, which are open for every user, who wants to join the tests.
713	Computational Methods for Renewable Energies: A Multi-Scale Perspective Diego Renan Aguilar Alfaro (19195102) 23 July 2024 (has links) <p dir="ltr">The urgent global shift towards decarbonization necessitates the development of robust frameworks to navigate the complex technological, financial, and regulatory challenges emerging in the clean energy transition. Furthermore, the increased adoption of renewable energy sources (RES) is correlated to the exponential growth in weather data research over the last few years. This circular relationship, where big data drives renewable growth, which feeds back the data pipeline, serves as the primary focus of this study: the development of computational tools across diverse spatial and temporal scales for the optimal design and operation of renewable energy-based systems. Two scales are considered, differentiated by their primary objectives and techniques used. </p><p dir="ltr"> In the first one, the integration of probabilistic forecasts into the operations of RES microgrids (MGs) is studied in detail. It is revealed that longer scheduling horizons can reduce dispatch costs but at the expense of forecast accuracy due to increased prediction accuracy decay (PAD). To address this, a novel method that determines how to split the time horizon into timeblocks to minimize dispatch costs and maximize forecast accuracy is proposed. This forms the basis of an optimal rolling horizon strategy (ORoHS) which schedules distributed energy resources over varying prediction/execution horizons. Results offer Pareto-optimal fronts, showing the trade-offs between cost and accuracy at varying confidence levels. Solar power proved more cost-effective than wind power due to lower variability, despite wind’s higher energy output. The ORoHS strategy outperformed common scheduling methods. In the case study, it achieved a cost of \$4.68 compared to \$9.89 (greedy policy) and \$9.37 (two-hour RoHS). The second study proposes the Caribbean Energy Corridor (CEC) project, a novel, ambitious initiative that aims to achieve total grid connectivity between the Caribbean islands. The analysis makes use of thorough data procedures and optimization methods for the resource assessment and design tasks needed to build such an infrastructure. Renewable energy potentials are quantified under different temporal and spatial coverages to maximize usage. Prioritizing offshore wind development, the CEC’s could significantly surpass anticipated growth in energy demand, with an estimated installed capacity of 34 GW of clean energy upon completion. The corridor is modeled as an HVDC grid with 32 nodes and 31 links. Underwater transmission is optimized with a Submarine-Cable-Dynamic-Programming (SCDP) algorithm that determines the best routes across the bathymetry of the region. It is found that the levelized cost of electricity remains on the low end at \$0.11/kWh, despite high initial capital investments. Projected savings reach \$ 100 billion when compared with ”business-as-usual” scenarios and the current social cost of carbon. Furthermore, this infrastructure has the potential to create around 50,000 jobs in construction, policy, and research within the coming decades, while simultaneously establishing a robust and sustainable energy-water nexus in the region. Finally, the broader implications of these works are explored, highlighting their potential to address global challenges such as energy accessibility, prosperity in conflict zones, and sharing these discoveries with the upcoming generations.</p> Electrical energy storage Photovoltaic power systems Evolutionary computation Modelling and simulation Planning and decision making Satisfiability and optimisation Data engineering and data science Neural networks Reinforcement learning Renewable Energies Optimization Power Systems Microgrids Energy Corridors Machine Learning Artificial Intelligence Robust Optimization Genetic Algorithm Mixed Integer Linear Programming Multi-objective Optimization Economic Dispatch Unit Commitment Wind Energy Solar Energy Caribbean Energy Corridor HVDC Submarine Power Transmission Dynamic Programming Wandering Salesman Problem Big Data Offshore Wind Battery Energy Storage System
714	The Stixel World Pfeiffer, David 31 August 2012 (has links) Die Stixel-Welt ist eine neuartige und vielseitig einsetzbare Zwischenrepräsentation zur effizienten Beschreibung dreidimensionaler Szenen. Heutige stereobasierte Sehsysteme ermöglichen die Bestimmung einer Tiefenmessung für nahezu jeden Bildpunkt in Echtzeit. Das erlaubt zum einen die Anwendung neuer leistungsfähiger Algorithmen, doch gleichzeitig steigt die zu verarbeitende Datenmenge und der dadurch notwendig werdende Aufwand massiv an. Gerade im Hinblick auf die limitierte Rechenleistung jener Systeme, wie sie in der videobasierten Fahrerassistenz zum Einsatz kommen, ist dies eine große Herausforderung. Um dieses Problem zu lösen, bietet die Stixel-Welt eine generische Abstraktion der Rohdaten des Sensors. Jeder Stixel repräsentiert individuell einen Teil eines Objektes im Raum und segmentiert so die Umgebung in Freiraum und Objekte. Die Arbeit stellt die notwendigen Verfahren vor, um die Stixel-Welt mittels dynamischer Programmierung in einem einzigen globalen Optimierungsschritt in Echtzeit zu extrahieren. Dieser Prozess wird durch eine Vielzahl unterschiedlicher Annahmen über unsere von Menschenhand geschaffene Umgebung gestützt. Darauf aufbauend wird ein Kalmanfilter-basiertes Verfahren zur präzisen Bewegungsschätzung anderer Objekte vorgestellt. Die Arbeit stellt umfangreiche Bewertungen der zu erwartenden Leistungsfähigkeit aller vorgestellten Verfahren an. Dafür kommen sowohl vergleichende Ansätze als auch diverse Referenzsensoren, wie beispielsweise LIDAR, RADAR oder hochpräzise Inertialmesssysteme, zur Anwendung. Die Stixel-Welt ist eine extrem kompakte Abstraktion der dreidimensionalen Umgebung und bietet gleichzeitig einfachsten Zugriff auf alle essentiellen Informationen der Szene. Infolge dieser Arbeit war es möglich, die Effizienz vieler auf der Stixel-Welt aufbauender Algorithmen deutlich zu verbessern. / The Stixel World is a novel and versatile medium-level representation to efficiently bridge the gap between pixel-based processing and high-level vision. Modern stereo matching schemes allow to obtain a depth measurement for almost every pixel of an image in real-time, thus allowing the application of new and powerful algorithms. However, it also results in a large amount of measurement data that has to be processed and evaluated. With respect to vision-based driver assistance, these algorithms are executed on highly integrated low-power processing units that leave no room for algorithms with an intense calculation effort. At the same time, the growing number of independently executed vision tasks asks for new concepts to manage the resulting system complexity. These challenges are tackled by introducing a pre-processing step to extract all required information in advance. Each Stixel approximates a part of an object along with its distance and height. The Stixel World is computed in a single unified optimization scheme. Strong use is made of physically motivated a priori knowledge about our man-made three-dimensional environment. Relying on dynamic programming guarantees to extract the globally optimal segmentation for the entire scenario. Kalman filtering techniques are used to precisely estimate the motion state of all tracked objects. Particular emphasis is put on a thorough performance evaluation. Different comparative strategies are followed which include LIDAR, RADAR, and IMU reference sensors, manually created ground truth data, and real-world tests. Altogether, the Stixel World is ideally suited to serve as the basic building block for today''s increasingly complex vision systems. It is an extremely compact abstraction of the actual world giving access to the most essential information about the current scenario. Thanks to this thesis, the efficiency of subsequently executed vision algorithms and applications has improved significantly. Bildsegmentierung Freiraum Optischer Fluss Die Stixel-Welt Stixel Stereo vision Dichtes Stereo Zwischenrepräsentation Szenenrepräsentation Maximum a posteriori Schätzproblem Globale Optimierung Dynamische Programmierung Hindernisse Objektrepräsentation Bewegungsschätzung Objektverfolgung Bewegungzustandschätzung Kalmanfilter Auswertung LIDAR RADAR KLT-Tracker Robustheit Sensormodell evaluation Kalman filter Image segmentation The Stixel World Stixels Stereo vision Dense stereo Medium-level representation Scene representation Maximum a posteriori estimation Global optimization Dynamic programming Obstacles Freespace Object representation Motion estimation Object tracking LIDAR RADAR Optical flow KLT-tracker Robustness Sensor model 004 Informatik 28 Informatik, Datenverarbeitung ST 330 ddc:004
715	Highway Development Decision-Making Under Uncertainty: Analysis, Critique and Advancement El-Khatib, Mayar January 2010 (has links) While decision-making under uncertainty is a major universal problem, its implications in the field of transportation systems are especially enormous; where the benefits of right decisions are tremendous, the consequences of wrong ones are potentially disastrous. In the realm of highway systems, decisions related to the highway configuration (number of lanes, right of way, etc.) need to incorporate both the traffic demand and land price uncertainties. In the literature, these uncertainties have generally been modeled using the Geometric Brownian Motion (GBM) process, which has been used extensively in modeling many other real life phenomena. But few scholars, including those who used the GBM in highway configuration decisions, have offered any rigorous justification for the use of this model. This thesis attempts to offer a detailed analysis of various aspects of transportation systems in relation to decision-making. It reveals some general insights as well as a new concept that extends the notion of opportunity cost to situations where wrong decisions could be made. Claiming deficiency of the GBM model, it also introduces a new formulation that utilizes a large and flexible parametric family of jump models (i.e., Lévy processes). To validate this claim, data related to traffic demand and land prices were collected and analyzed to reveal that their distributions, heavy-tailed and asymmetric, do not match well with the GBM model. As a remedy, this research used the Merton, Kou, and negative inverse Gaussian Lévy processes as possible alternatives. Though the results show indifference in relation to final decisions among the models, mathematically, they improve the precision of uncertainty models and the decision-making process. This furthers the quest for optimality in highway projects and beyond. highway development decision making under uncertainty real options jump processes infinitely divisible distributions Lévy processes measure theory characteristic function characteristic exponent Lévy jump measure probability measure cádlág stochastic process Wiener process Poisson process compound Poisson process finite activity models jump diffusion models Merton model Gaussian jump process Kou model double exponential jump process leptokurtic volatility smile infinite activity models pure jumps process generalized hyperbolic model modified Bessel function negative inverse Gaussian model geometric Brownian motion model log-normal distribution model normality assumption heavy-tailed distribution asymmetric distribution quantile-quantile plot Rydberg algorithm parameter calibration moments cummulants sum of squares Monte Carlo simulation least-squares regression backward dynamic programming discrete-time Markov chain land price traffic demand highway service quality index data collection traffic volume Annual Average Daily Traffic Ontario Ministry of Transportation Land Registry Office Freedom of Information Act seasonality value of transportation types of transportation systems importance of highway systems cost of wrong decisions monetary cost private sector cost human cost land expropriation environmental cost irreversibility cost factor time cost factor political cost factor opportunity cost opportunity cost of wrong decisions economic cost of wrong decisions economic cost of mis-estimation economic profit of wrong decisions cost of inaction price of making right decisions scope of decisions rehabilitation decision land acquisition decision expansion decision uncertainty modeling land acquisition cost expropriation cost construction cost material cost Montréal-Mirabel International Airport Pickering Airport 407 Express Toll Route Highway 407 Statistics
716	Highway Development Decision-Making Under Uncertainty: Analysis, Critique and Advancement El-Khatib, Mayar January 2010 (has links) While decision-making under uncertainty is a major universal problem, its implications in the field of transportation systems are especially enormous; where the benefits of right decisions are tremendous, the consequences of wrong ones are potentially disastrous. In the realm of highway systems, decisions related to the highway configuration (number of lanes, right of way, etc.) need to incorporate both the traffic demand and land price uncertainties. In the literature, these uncertainties have generally been modeled using the Geometric Brownian Motion (GBM) process, which has been used extensively in modeling many other real life phenomena. But few scholars, including those who used the GBM in highway configuration decisions, have offered any rigorous justification for the use of this model. This thesis attempts to offer a detailed analysis of various aspects of transportation systems in relation to decision-making. It reveals some general insights as well as a new concept that extends the notion of opportunity cost to situations where wrong decisions could be made. Claiming deficiency of the GBM model, it also introduces a new formulation that utilizes a large and flexible parametric family of jump models (i.e., Lévy processes). To validate this claim, data related to traffic demand and land prices were collected and analyzed to reveal that their distributions, heavy-tailed and asymmetric, do not match well with the GBM model. As a remedy, this research used the Merton, Kou, and negative inverse Gaussian Lévy processes as possible alternatives. Though the results show indifference in relation to final decisions among the models, mathematically, they improve the precision of uncertainty models and the decision-making process. This furthers the quest for optimality in highway projects and beyond. highway development decision making under uncertainty real options jump processes infinitely divisible distributions Lévy processes measure theory characteristic function characteristic exponent Lévy jump measure probability measure cádlág stochastic process Wiener process Poisson process compound Poisson process finite activity models jump diffusion models Merton model Gaussian jump process Kou model double exponential jump process leptokurtic volatility smile infinite activity models pure jumps process generalized hyperbolic model modified Bessel function negative inverse Gaussian model geometric Brownian motion model log-normal distribution model normality assumption heavy-tailed distribution asymmetric distribution quantile-quantile plot Rydberg algorithm parameter calibration moments cummulants sum of squares Monte Carlo simulation least-squares regression backward dynamic programming discrete-time Markov chain land price traffic demand highway service quality index data collection traffic volume Annual Average Daily Traffic Ontario Ministry of Transportation Land Registry Office Freedom of Information Act seasonality value of transportation types of transportation systems importance of highway systems cost of wrong decisions monetary cost private sector cost human cost land expropriation environmental cost irreversibility cost factor time cost factor political cost factor opportunity cost opportunity cost of wrong decisions economic cost of wrong decisions economic cost of mis-estimation economic profit of wrong decisions cost of inaction price of making right decisions scope of decisions rehabilitation decision land acquisition decision expansion decision uncertainty modeling land acquisition cost expropriation cost construction cost material cost Montréal-Mirabel International Airport Pickering Airport 407 Express Toll Route Highway 407 Statistics

Page generated in 0.0796 seconds