Rockfalls is a major problem around the world, if they occur in populated areas, they can cause major damage to infrastructure, injure or kill people. For this reason, it is important to be able to predict where the risk of rockfalls and how to prevent and protect populated areas from them. However, it is no easy task to predict rockfalls. Although if an area with potential area for rockfall is localized it may seem easy to construct protective meshing or bolting potential blocks down. But in many cases this is not easy to do due to practical issues or economic reasons, for example in rock cuts on older railways in Sweden. Fall heights from rock cuts like that are not particularly high but the risk of damage to the trains and infrastructure in the track area is high, however, it is unknown how extensive the damage may be. Trafikverket, the Swedish authority responsible for Sweden's roads and railways, has for some years investigated a new method for classifying and minimize the risk of rockfalls from rock cuts next to the railways. This study include aims to include the potential maximum distance of a block from the rockfall can travel to the existing method. This master's work is part of the investigation and will include full scale field test where the rockfalls are examined by filming them and then evaluate the “bounce coefficient”, coefficient of restitution, from the individual rockfalls using photogrammetric methods. During the field study, a geotechnical testing equipment, DCP test rig, to be evaluated for its ability of an easy way in the field to produce an estimated value on the coefficient of restitution. During the evaluation, two rockfall simulating software be used to investigate how well the results from them match the true blocks movements. / Stenras är ett stort problem runtom i världen, om de inträffar i bebyggda områden kan de leda till stora skador på infrastruktur, skador eller dödsfall. Av den anledningen är det viktigt att kunna förutse vart det finns risk för stenras och hur man kan förebygga dem och skydda bebyggda områden från dem. Dock är det ingen lätt uppgift att förutse stenras. Även om det finns ett potentiellt område för stenras kan det tyckas lätt att placera ut skyddsnät eller bulta fast potentiella block. Men i många fall är detta inte praktiskt, eller ekonomiskt, till exempel i bergsskärningar på äldre järnvägar i Sverige. Fallhöjderna här är inte speciellt höga men risken för skador på tåg och infrastruktur i spårområdet är hög, dock är det okänt hur omfattande skadorna kan bli. Trafikverket, den svenska myndigheten som ansvarar för Sveriges vägar och järnvägar, har under flera år utrett en ny metod för att klassificera och minimera riskerna för stenras från bergskärningar bredvid järnvägar. Denna utredning syftar bland annat till att till att väga in det potentiella maximalt avstånd ett block från stenras kan färdas i den befintliga modellen. Det här mastersarbetet är en del i den utredningen och kommer att innefatta ett fullskaligt fältförsök där stenras undersöks genom att de filmas och sedan utvärderas studskoefficienten, coefficient of restitution, från de enskilda rasen i stereo. Under fältstudien kommer en geoteknisk testutrustning, DCP test rigg, att utvärderas för sin förmåga att lätt i fält få fram ett uppskattat värde på studskoefficienten. Under utvärderingen kommer två stenrassimuleringsprogram att användas för att undersöka hur väl de stämmer med de verkliga blockens rörelser.

La SNCF utilise plusieurs engins spécialisés pour ausculter les fissures internes du rail. La fréquence d’auscultation de chaque rail est fonction du tonnage cumulé qui passe dessus. La programmation des engins d’auscultations ultrasonores est aujourd’hui décentralisée. Dans le cadre d’une étude de réorganisation, la SNCF souhaite étudier la faisabilité de l’optimisation de certaines tournées d’inspection. Dans le cadre de cette thèse de doctorat, l’optimisation de la programmation des engins d’auscultation à ultrasons est étudiée.Une modélisation mathématique sous forme de problème de tournées sur arcs généralisant plusieurs problèmes académiques est proposées. Une méthode de résolution exacte, appliquant la décomposition de Benders, est détaillée. À partir de cette approche, une heuristique de génération de colonnes et de contraintes est présentée et analysée numériquement sur des données réelles de 2009. Enfin, un logiciel industriel développé autour de cette approche est présenté / SNCF is using specialised rolling stock units to inspect internal defects in rails. Rail’s inspection frequency is defined by the cumulative weight of the trains which are going through. In2009, the scheduling of these train units is decentralised. SNCF is studying the centralisation of this process. In this Ph.D. thesis, a new problem, the Railroad Track Inspection SchedulingProblem is studied.A mathematical formulation, based on the generalization of classical arc routing models,is proposed. An exact solving approach, based on Benders’ decomposition scheme, is detailed.From this approach, a column and cut generation heuristic is developed, implemented, andtested on real datasets for 2009. The industrial software developed around this heuristic is presented.

No description available.

No description available.

With the rapidly growing need for long-term decision making in the presence of stochastic future events, it is important to devise novel mathematical optimization tools and develop computationally efficient solution approaches for solving them. Two-stage stochastic programming is one of the powerful modeling tools that allows probabilistic data parameters in mixed integer programming, a well-known tool for optimization modeling with deterministic input data. However, akin to the mixed integer programs, these stochastic models are theoretically intractable and computationally challenging to solve because of the presence of integer variables. This dissertation focuses on theory, algorithms and applications of two-stage stochastic mixed integer (non)linear programs and it has three-pronged plan. In the first direction, we study two-stage stochastic p-order conic mixed integer programs (TSS-CMIPs) with p-order conic terms in the second-stage objectives. We develop so called scenario-based (non)linear cuts which are added to the deterministic equivalent of TSS-CMIPs (a large-scale deterministic conic mixed integer program). We provide conditions under which these cuts are sufficient to relax the integrality restrictions on the second-stage integer variables without impacting the integrality of the optimal solution of the TSS-CMIP. We also introduce a multi-module capacitated stochastic facility location problem and TSS-CMIPs with structured CMIPs in the second stage to demonstrate the significance of the foregoing results for solving these problems. In the second direction, we propose risk-neutral and risk-averse two-stage stochastic mixed integer linear programs for load shed recovery with uncertain renewable generation and demand. The models are implemented using a scenario-based approach where the objective is to maximize load shed recovery in the bulk transmission network by switching transmission lines and performing other corrective actions (e.g. generator re-dispatch) after the topology is modified. Experiments highlight how the proposed approach can serve as an offline contingency analysis tool, and how this method aids self-healing by recovering more load shedding. In the third direction, we develop a dual decomposition approach for solving two-stage stochastic quadratically constrained quadratic mixed integer programs. We also create a new module for an open-source package DSP (Decomposition for Structured Programming) to solve this problem. We evaluate the effectiveness of this module and our approach by solving a stochastic quadratic facility location problem. / Doctor of Philosophy / With the rapidly growing need for long-term decision making in the presence of stochastic future events, it is important to devise novel mathematical optimization tools and develop computationally efficient solution approaches for solving them. Two-stage stochastic programming is one of the powerful modeling tools that allows two-stages of decision making where the first-stage strategic decisions (such as deciding the locations of facilities or topology of a power transmission network) are taken before the realization of uncertainty, and the second-stage operational decisions (such as transportation decisions between customers and facilities or power flow in the transmission network) are taken in response to the first-stage decision and a realization of the uncertain (demand) data. This modeling tool is gaining wide acceptance because of its applications in healthcare, power systems, wildfire planning, logistics, and chemical industries, among others. Though intriguing, two-stage stochastic programs are computationally challenging. Therefore, it is crucial to develop theoretical results and computationally efficient algorithms, so that these models for real-world applied problems can be solved in a realistic time frame. In this dissertation, we consider two-stage stochastic mixed integer (non)linear programs, provide theoretical and algorithmic results for them, and introduce their applications in logistics and power systems. First, we consider a two-stage stochastic mixed integer program with p-order conic terms in the objective that has applications in facility location problem, power system, portfolio optimization, and many more. We provide a so-called second-stage convexification technique which greatly reduces the computational time to solve a facility location problem, in comparison to solving it directly with a state-of-the-art solver, CPLEX, with its default settings. Second, we introduce risk-averse and risk-neutral two-stage stochastic models to deal with uncertainties in power systems, as well as the risk preference of decision makers. We leverage the inherent flexibility of the bulk transmission network through the systematic switching of transmission lines in/out of service while accounting for uncertainty in generation and demand during an emergency. We provide abundant computational experiments to quantify our proposed models, and justify how the proposed approach can serve as an offline contingency analysis tool. Third, we develop a new solution approach for two-stage stochastic mixed integer programs with quadratic terms in the objective function and constraints and implement it as a new module for an open-source package DSP We perform computational experiments on a stochastic quadratic facility location problem to evaluate the performance of this module.

Lappugglans utbredningsområde kan vara påväg att förändras som respons till det moderna skogsbruket. I den här studien har jag fokuserat på lappugglors abundans vid kalhyggen av olika storlek med hypotesen att de föredrar hyggen av mindre storlek. Eftersom kalhyggena i södra Sverige i snitt är mindre så skulle det kunna vara en del i förklaringen att lappugglor börjat synas allt oftare söderut. Data laddades ned från artdatabanken och skogsstyrelsen och bearbetades i QGiS för att undersöka lappugglornas utbredning i relation till kalhyggen. Resultatet indikerar att ugglorna föredrar små framför stora kalhyggen och även kan dras till små hyggen. Resultaten visar också en trend söderut för ugglornas utbrednings mellan 2005 och 2020. Dessa resultat bekräftar att lappugglornas utbredningsmönster rör sig söderut och stödjer hypotesen att det är skogsbruk och kalhyggens storlek som driver denna utveckling. Mindre kalhyggen gynnar även andra arter än Lappugglor och kan därför generellt vara en god idé för att förena ekologi och ekonomi inom modernt skogsbruk. / The great grey owl may be adjusting its distribution area in Sweden in response to altered forestry practices. Here i focused on the abundance of owls in clear cut areas of different sizes with the hypothesis that owls prefer smaller clear cut areas. As clear cut areas are smaller in the south than in the north, such a preference could explain a trend of changing distribution southward. Data from artdatabanken and skogsstyrelsen were processed and analyzed in QGiS to investigate the spatial pattern of owl reports in relation to the locations of clear cuts. The results indicate that the owls prefer small over large clear cuts, and are indeed attracted to small clear cuts. The results also show a southward change in the distribution area from 2005 to 2020. These results confirm that the distribution of great grey owls moves southwards in Sweden and support the idea that this trend may be driven by the species being attracted to smaller clear cuts. Since smaller clear cuts benefit more species than owls it is generally a good idea to combine economy with ecology in modern forestry.

O objetivo desta dissertação é apresentar a construção dos números reais a partir de cortes de Dedekind. Para isso, vamos estudar os números naturais, os números inteiros, os números racionais e as propriedades envolvidas. Então, a partir dos números racionais, iremos construir o corpo dos números reais e estabelecer suas propriedades. Um corte de Dedekind, assim nomeado em homenagem ao matemático alemão Richard Dedekind, é uma partição dos números racionais em dois conjuntos não vazios A e B em que cada elemento de A é menor do que todos os elementos de B e A não contém um elemento máximo. Se B contiver um elemento mínimo, então o corte representará este elemento mínimo, que é um número racional. Se B não contiver um elemento mínimo, então o corte definirá um único número irracional, que preenche o espaço entre A e B. Desta forma, pode-se construir o conjunto dos números reais a partir dos racionais e estabelecer suas propriedades. Esta dissertação proporcionará aos estudantes do Ensino Médio, interessados em Matemática, uma formação sólida em um de seus pilares, que é o conjunto dos números reais e suas operações algébricas e propriedades. Isso será muito importante para a formação destes alunos e sua atuação educacional. / The purpose of this dissertation is to present the construction of the real numbers from Dedekind cuts. For this, we study the natural numbers, the integers, the rational numbers and some properties involved. Then, based on the rational numbers, we construct the field of the real numbers and establish their properties. A Dedekind cut, named after the German mathematician Richard Dedekind, is a partition of the rational numbers into two non-empty sets A and B, such that each element of A is smaller than all elements of B and A does not contain a maximum element. If B contains a minimum element, then the cut represents this minimum element, which is a rational number. If B does not contain a minimal element, then the cut defines a single irrational number, which \"fills the gap\" between A and B. In this way, one can construct the set of real numbers from the rationals and establish their properties. This dissertation provides students who like Mathematics a solid basis in one of the pillars of Mathematics, which is the set of real numbers and their algebraic operations and properties. This text will be very important for your educational background and performance.

L'objectif de cette thèse est de faciliter le diagnostic du cancer de la vessie. Durant une cystoscopie, un endoscope est introduit dans la vessie pour explorer la paroi interne de l'organe qui est visualisée sur un écran. Cependant, le faible champ de vue de l'instrument complique le diagnostic et le suivi des lésions. Cette thèse présente des algorithmes pour la création de cartes bi- et tridimensionnelles à large champ de vue à partir de vidéo-séquences cystoscopiques. En utilisant les avancées récentes dans le domaine de la minimisation d'énergies discrètes, nous proposons des fonctions coût indépendantes des transformations géométriques requises pour recaler de façon robuste et précise des paires d'images avec un faible recouvrement spatial. Ces transformations sont requises pour construire des cartes lorsque des trajectoires d'images se croisent ou se superposent. Nos algorithmes détectent automatiquement de telles trajectoires et réalisent une correction globale de la position des images dans la carte. Finalement, un algorithme de minimisation d'énergie compense les faibles discontinuités de textures restantes et atténue les fortes variations d'illuminations de la scène. Ainsi, les cartes texturées sont uniquement construites avec les meilleures informations (couleurs et textures) pouvant être extraites des données redondantes des vidéo-séquences. Les algorithmes sont évalués quantitativement et qualitativement avec des fantômes réalistes et des données cliniques. Ces tests mettent en lumière la robustesse et la précision de nos algorithmes. La cohérence visuelle des cartes obtenues dépassent celles des méthodes de cartographie de la vessie de la littérature / The aim of this thesis is to facilitate bladder cancer diagnosis. The reference clinical examination is cystoscopy, where an endoscope, inserted into the bladder, allows to visually explore the organ's internal walls on a monitor. The main restriction is the small field of view (FOV) of the instrument, which complicates lesion diagnosis, follow-up and treatment traceability.In this thesis, we propose robust and accurate algorithms to create two- and three-dimensional large FOV maps from cystoscopic video-sequences. Based on recent advances in the field of discrete energy minimization, we propose transformation-invariant cost functions, which allow to robustly register image pairs, related by large viewpoint changes, with sub-pixel accuracy. The transformations linking such image pairs, which current state-of-the-art bladder image registration techniques are unable to robustly estimate, are required to construct maps with several overlapping image trajectories. We detect such overlapping trajectories automatically and perform non-linear global map correction. Finally, the proposed energy minimization based map compositing algorithm compensates small texture misalignments and attenuates strong exposure differences. The obtained textured maps are composed by a maximum of information/quality available from the redundant data of the video-sequence. We evaluate the proposed methods both quantitatively and qualitatively on realistic phantom and clinical data sets. The results demonstrate the robustness of the algorithms, and the obtained maps outperform state-of-the-art approaches in registration accuracy and global map coherence

Vários métodos tradicionais de segmentação de imagens, como a transformada de watershed de marcado- res e métodos de conexidade fuzzy (Relative Fuzzy Connectedness- RFC, Iterative Relative Fuzzy Connected- ness - IRFC), podem ser implementados de modo eficiente utilizando o método em grafos da Transformada Imagem-Floresta (Image Foresting Transform - IFT). No entanto, a carência de termos de regularização de fronteira em sua formulação fazem com que a borda do objeto segmentado possa ser altamente irregular. Um modo de contornar isto é por meio do uso de restrições de forma do objeto, que favoreçam formas mais regulares, como na recente restrição de convexidade geodésica em estrela (Geodesic Star Convexity - GSC). Neste trabalho, apresentamos uma nova restrição de forma, chamada de Faixa de Restrição Geodésica (Geodesic Band Constraint - GBC), que pode ser incorporada eficientemente em uma sub-classe do fra- mework de corte em grafos generalizado (Generalized Graph Cut - GGC), que inclui métodos pela IFT. É apresentada uma prova da otimalidade do novo algoritmo em termos de um mínimo global de uma função de energia sujeita às novas restrições de borda. A faixa de restrição geodésica nos ajuda a regularizar a borda dos objetos, consequentemente melhorando a segmentação de objetos com formas mais regulares, mantendo o baixo custo computacional da IFT. A GBC pode também ser usada conjuntamente com um mapa de custos pré estabelecido, baseado em um modelo de forma, de modo a direcionar a segmentação a seguir uma dada forma desejada, com grau de liberdade de escala e demais deformações controladas por um parâmetro único. Essa nova restrição também pode ser combinada com a GSC e com as restrições de polaridade de borda sem custo adicional. O método é demonstrado em imagens naturais, sintéticas e médicas, sendo estas provenientes de tomografias computadorizadas e de ressonância magnética. / In this work, we present a novel boundary constraint, which we denote as the Geodesic Band Constraint (GBC), and we show how it can be efficiently incorporated into a subclass of the Generalized Graph Cut framework (GGC). We include a proof of the optimality of the new algorithm in terms of a global minimum of an energy function subject to the new boundary constraints. The Geodesic Band Constraint helps regularizing the boundary, and consequently, improves the segmentation of objects with more regular shape, while keeping the low computational costs of the Image Foresting Transform (IFT). It can also be combined with the Geodesic Star Convexity prior, and with polarity constraints, at no additional cost.

Esta dissertação apresenta em primeira etapa o trabalho desenvolvido para averiguar a adequação dos modelos reológicos de Mohr-Coulomb e de Endurecimento de solo, para representar as deformações e distorções que ocorrem no sistema soloestrutura, quando do processo de escavação de valas escoradas. Além disto, em uma segunda etapa fazem-se estimativas de previsão de danos causados em edificações, em decorrência das escavações de uma vala escorada da linha 1 do Metropolitano de São Paulo (Metrô S.P.). A primeira e a segunda etapa foram feitas através de 810 simulações numéricas, em elementos finitos utilizando-se o software PLAXIS, associadas a retroanálise por processo direto do módulo de deformabilidade a 50% da tensão de ruptura dos solos utilizando-se para isto o processo direto. Apresenta-se também uma síntese da formação e dos tipos de solos que constituem a bacia sedimentar de São Paulo, onde se localiza a seção experimental nº1 objeto de estudo desta dissertação. Faz-se uma breve revisão bibliográfica a respeito das técnicas de retroanálise. Apresentam-se critérios para escolha de intervalos de parâmetros geotécnicos que representem o sistema solo-estrutura no processo de escavação. Foram feitas análises paramétricas para determinar os parâmetros geotécnicos que mais influenciam o sistema solo-estrutura. Comparam-se os modelos constitutivos de Mohr-Coulomb e de endurecimento na previsão das deformações. Por fim, faz-se a previsão do nível de danos causados pelas escavações da vala, a um edifício hipotético / This dissertation presents, in a first part, the work done to verify how appropriate are the Mohr-Coulomb and hardening soil constitutive models to represent the strains and the distortions associated with escavations of braced wall process. In the second part, estimates are made of the damages in constructions due to the braced excavations of line one of Sao Paulo Subway (Metrô S.P.). In the two phases, 810 numeric simulations were made, in finite elements using the software PLAXIS, associated the back analysis for direct process. It is presented a synthesis of the formation and the types of soils that constitute the basin of the sediments of the city of São Paulo, where is located the section experimental nº1, object of study of this dissertation. It is presented an short bibliographical revision regarding the back analysis techniques. Criteria for choice of intervals of parameters geotechnical that represent the system soil-structure in the excavation process are presented. Parametric analyses are made to determine which the parameters have larger influence in the behavior of the system soil-structure. The behavior of the soil-structure system is simulated using the Mohr-Coulomb and hardening soil constitutive models. The Mohr-Coulomb and hardening soil constitutive models are compared in the forecast of the deformations. Finally, it is made the forecast of the level of damages to a hypothetical building caused by the braced excavations