<p>Many different approaches have been taken towards solving the stereo correspondence problem and great progress has been made within the field during the last decade. This is mainly thanks to newly evolved global optimization techniques and better ways to compute pixel dissimilarity between views. The most successful algorithms are based on approaches that explicitly model smoothness assumptions made about the physical world, with image segmentation and plane fitting being two frequently used techniques.</p><p>Within the project, a survey of state of the art stereo algorithms was conducted and the theory behind them is explained. Techniques found interesting were implemented for experimental trials and an algorithm aiming to achieve state of the art performance was implemented and evaluated. For several cases, state of the art performance was reached.</p><p>To keep down the computational complexity, an algorithm relying on local winner-take-all optimization, image segmentation and plane fitting was compared against minimizing a global energy function formulated on pixel level. Experiments show that the local approach in several cases can match the global approach, but that problems sometimes arise – especially when large areas that lack texture are present. Such problematic areas are better handled by the explicit modeling of smoothness in global energy minimization.</p><p>Lastly, disparity estimation for image sequences was explored and some ideas on how to use temporal information were implemented and tried. The ideas mainly relied on motion detection to determine parts that are static in a sequence of frames. Stereo correspondence for sequences is a rather new research field, and there is still a lot of work to be made.</p>

När den svenska regeringen beslöt sig för att sänka restaurangmomsen den 1 januari 2012, gjordes det för att stimulera restaurangbranschen att sänka priserna på måltiderna, nyanställa och eliminera svartjobb. Vid en sänkning av momsen frigörs kapital, ett extra ekonomiskt utrymme, som för företagen blir en tillgång som de själva får avgöra hur det kommer disponeras. Denna studie ämnar ta reda på vilka effekter momssänkningen kommer medföra för branschen och hur restaurangägarna disponerat det ekonomiska utrymmet. Material har införskaffats genom en enkätundersökning med restaurangägare, intervjuer med hotell- och restaurangfacket samt branschorganisationen Visita. Med utgångspunkter bland annat inom nationalekonomiska teorier visar undersökningen att restaurangägare valt att använda det ekonomiska utrymmet till att nyanställa, sänka sina priser, genomföra renoveringar eller till överlevnadsmarginaler. Detta tyder på att det finns en spridning över hur restaurangägarna handlat. Faktorer som kan vara av betydelse över hur restauranger agerar är företagets storlek och form samt hur konkurrenterna i dess omgivning agerar. / When the Swedish government decided to cut the restaurant VAT January 1st, 2012, was made for the purpose of encouraging the restaurant industry. In turn, the restaurants would choose to lower the prices of meals, hire new employees and eliminate illegal work. When VAT is lowered it releases capital, an additional financial fund. For the restaurants it’s an asset, which they can determine how it should be allocated. This study aims to determine the effects of VAT reduction on the industry and how restaurant owners have chosen to make with the additional funds. The material has been obtained by conducting a survey with restaurant owners, interviewing the restaurant union and the industry association Visita. With starting points in economic theories and previous studies on other VAT reductions, the study shows that restaurant owners have chosen to use the economic funds to create new jobs, lowering meal prices, renovations or to improve profit margins. This indicates that there is dispersion among the opportunities restaurant owners have chosen. Elements that could have importance in the actions of restaurant, is the size and form of the business, and the performance of the competition nearby.

The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs. By managing their customers' inventories, suppliers may be able to reduce demand variability and therefore distribution costs. We develop technology to measure the effectiveness of distribution strategies. We develop a methodology that allows the computation of tight lower bounds on the total mileage required to satisfy customer demand over a period of time. As a result, companies will be able to gain insight into the effectiveness of their distribution strategy. This technology can also be used to suggest desirable delivery patterns and to analyze tactical and strategic decisions. Secondly, we study the inventory routing problem with continuous moves (IRP-CM). The typical inventory routing problem deals with the repeated distribution of a single product, from a single facility, with an unlimited supply, to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the IRP-CM to study two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop a heuristic and an optimization algorithm to construct distribution plans. The heuristic is an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology. To solve the IRP-CM to optimality, we give a time-discretized integer programming model and develop a branch-and-cut algorithm. As instances of time-discretized models tend to be large we discuss several possibilities for reducing the problem size. We introduce a set of valid inequalities, called delivery cover inequalities, in order to tighten the bounds given by the LP relaxation of the time-discretized model. We also introduce branching schemes exploiting the underlying structure of the IRP-CM. An extensive computational study demonstrates the effectiveness of the optimization algorithm. Finally, we present an integrated approach using heuristics and optimization algorithms providing effective and efficient technology for solving inventory problems with continuous moves.

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

Made available in DSpace on 2014-07-29T15:07:51Z (GMT). No. of bitstreams: 1 Dissertacao2008_Leonado_Franca.pdf: 610450 bytes, checksum: 1fc7bfc6096780687d2226f632e6aa85 (MD5) Previous issue date: 2008-08-28 / Intending to stipulate the parcel of Listeria spp. and L. monocytogenes in several sources, using the PCR techicic, 360 samples were analyzed in the period between november 2006 and february 2008, proceeding from 25 commercial abattoirs of five companies all licensed to export from some Brazilian States. Primers U1/LI1 for Listeria spp. and LM1/LM2 and LL5/LL6 for L. monocytogenes. Listeria spp. was detected in 19,72% of the samples, with percentage of 23% in the bone rooms, cold chamber and half carcass, 15% in beef cuts and 10% in the slaughter rooms. In the slaughterhouses it was detected in 19,42% in the A, 17,72% in the B, 22,95% in the C and 20% in the D and E. Analyzing the states, 16,34% in São Paulo, 23,94% in Mato Grosso do Sul, 14,06% in Goiás, 32% in Mato Grosso, 27,27% in Bahia and 14,28% in Pará were positive for its genus. No matter the pair of &#8223;primers&#8223;&#8223; used for amplication, L. monocytogenes were detected in 14,72% of the samples, 20% in cold chambers, 15,83% in bone rooms, 13.33% in halfcarcass and in beef cuts and 10% in slaughter rooms. In the slaughterhouse A, 12,57% of the samples were detected positive&#8223;, 11,39% in B, 21,31% in C and 13,33% in D e E. The bacterium was detected in São Paulo in 12,42% of positive samples, 14,08% in Mato Grosso do Sul, 12,30% in Goiás, 24%, in Mato Grosso, 27,27% in Bahia and 14,28% in Pará. The pair of primer LM1/LM2 revealed better efficience than the LL5/LL6 and although this last one has presented low efficiency to detection, the total of positive samples of L. monocytogenes of this research only was possible by the association of both. Listeria spp. and L. monocytogenes are largely propagated in the sources and studied places, and, therefore, disseminated in all slaughterhouses and analyzed States, excepting Minas Gerais. The results of this research revealed the necessariness of adoption of urgent providences about the control of the pathogen in the bovine slaughterhouses in Brazil and must alert the possibility of occurrence of outbreak of listeriosis of nutritious transmission, considering the occurrence and the frequency repetition here verified in half-carcass and beef cuts / Objetivando determinar a distribuição de Listeria spp. e L. monocytogenes em fontes diversas, pela técnica de PCR, foram analisadas 360 amostras no período de novembro de 2006 a fevereiro de 2008, procedentes de 25 unidades frigoríficas de cinco empresas habilitadas para comércio internacional localizadas em alguns Estados. Foram utilizados os primers U1/LI1 para Listeria spp. e LM1/LM2 e LL5/LL6 para L. monocytogenes. Listeria spp. foi detectada em 19,72% do total analisado, com percentuais de 23% em salas de desossa, câmaras-frias e meiascarcaças, 15% em cortes cárneos e 10% em salas de matança. Nos matadouros frigoríficos foi identificada em 19,42% no A, 17,72% no B, 22,95% no C e 20% no D e E. Em relação aos Estados, 16,34% em São Paulo, 23,94% no Mato Grosso do Sul, 14,06% em Goiás, 32% no Mato Grosso, 27,27% na Bahia e 14,28% no Pará foram positivas para o gênero. Independente do par de primers utilizado para amplificação, L. monocytogenes foi detectada em 14,72% da amostragem, sendo 20% em câmaras-frias, 15,83% em salas de desossa, 13,33% em meiascarcaças e em cortes cárneos e 10% em salas de matança. Foram obtidas 12,57% de amostras positivas no matadouro-frigorifico A, 11,39% no B, 21,31% no C e 13,33% no D e E. A espécie foi detectada em São Paulo, com 12,42% de amostras positivas, 14,08% no Mato Grosso do Sul, 12,30% em Goiás, 24% no Mato Grosso, 27,27% na Bahia e 14,28% no Pará. O par de primer LM1/LM2 revelou maior eficiência que o LL5/LL6 e, apesar deste último ter apresentado baixa eficiência para detecção, a totalidade de amostras positivas para L. monocytogenes deste trabalho só foi possível com a associação de ambos. Listeria spp. e L. monocytogenes se encontram amplamente distribuídas nas fontes e sítios estudados, estando disseminadas em todos os matadourosfrigoríficos e Estados analisados, com exceção de Minas Gerais. Os resultados deste trabalho revelam a necessidade de adoção de medidas urgentes para o controle do patógeno nos estabelecimentos de abate de bovinos no Brasil e devem servir de alerta para a possibilidade de ocorrência de surtos de listeriose de veiculação alimentar, dadas as freqüências de ocorrência aqui verificadas em meias-carcaças e cortes cárneos

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.

Cette thèse étudie la coloration d'arcs et de cycles dans les graphes orientés. Elle se concentre sur les sujets suivants : la coloration propre d'arcs avec des sommet-distingué dans les graphes orientés, les cycles courts dans les graphes orientés avec des sous-graphes interdits, les cycles sommet-disjoints dans dans les tournois bipartis, les cycle-facteurs dans les tournois bipartis régulier et les arcs universels dans les tournois. La thèse est basée sur cinq articles originaux publiés ou présentés dans des journaux. Les principaux résultats sont les suivants. Nous introduisons la coloration propre d'arcs avec des sommet-distingué dans les graphes orientés. Nous avons proposé une conjecture sur le nombre arc-chromatique sommet-distingué et nous avons aussi donné quelque résultats partiels. Nous avons étendu un résultat de Razborov en prouvant que la conjecture de Caccetta-Häggkvist est vraie pour certains graphes orientés avec des sous-graphes interdits. Nous avons montré que chaque tournoi biparti avec degré sortant minimum au moins qr-1 contient r cycles de sommets-disjoints de toutes longueurs possibles. Le cas spécial q=2 confirme le cas du tournoi biparti de la conjecture de Bermond-Thomassen. Nous avons montré que chaque tournoi biparti k-régulier avec k>2 que l'on notera B a deux cycles complémentaires de longueurs 6 et |V(B)-6|, à moins que B soit isomorphe à un graphe spécifique, étayant ainsi une conjecture sur des 2-cycles-facteurs dans les tournois bipartis. En outre, nous montrons que tous les tournois bipartis réguliers ont un k-cycle-facteur. Nous donnons une condition nécessaire et suffisante pour l'existence d'un arc universel dans un tournoi et nous caractérisons tous les tournois où chaque arc est universel. / In this thesis, we study arc colorings and cycles in digraphs. The following topics are considered: vertex-distinguishing proper arc colorings in digraphs, short cycles in digraphs with forbidden subgraphs , disjoint cycles in bipartite tournaments, cycle factors in regualr bipartite tournaments and universal arcs in tournaments. The main results are contained in five original articles published or submitted to an international journal. We introduce vertex-distinguishing proper arc colorings of digraphs. A conjecture on the vertex-distinguishing arc-chromatic number is given and some partial results are obtained. We extend a result of Razborov by proving that the Caccetta-Häggkvist conjecture is true for digraphs with certain induced forbidden subgraphs or with certain forbidden subgraphs. We show that every bipartite tournament with minimum outdegree at least qr-1 has r vertex disjoint cycles of any given possible lengths. The special case q=2 of the result verifies the bipartite tournament case of the Bermond-Thomassen conjecture. As a partial support of a conjecture on 2-cycle-factors in bipartite tournaments, we prove that every k-regular bipartite tournament B with k>2 has two complementary cycles of lengths 6 and |V(B)|-6, unless B is isomorphic to a special digraph. Besides, we show that every k-connected regular bipartite tournament has a k-cycle-factor. We also give a sufficient and necessary condition for the existence of a universal arc in a tournament and characterize all the tournaments in which every arc is universal.

Final thesis deals with relocation of road I/34, specifically bypass Pelhřimov west. The crossing with roads I/19 and I/112 is solved by interchange roundabout in nothern part of bypass. Reason of construction is unification road I/34, which is a part of the international route E551, to category S11,5/70. The principal tasks was to keep it in the land use plan and the effort to maximize the alignment of volumes of earthworks.

This thesis deals with issues automatic composing panoramic photos from individual photos. Gradually examines the various steps of algorithms and methods used in them, which are used in creating panoramas. It also focuses on the design of the own system based on methods discussed to construct panoramas. This system is implemented using OpenCV library and it is created also a graphical interface using a Qt library. Finally, are in this thesis evaluated outcomes of this designed and implemented system on available datasets.