This Diploma thesis is focused on design monolithic concrete construction of multi-storey administrative builiding including its foundation. The slab construction over the first floor is designed like locally supported. Calculation of internal forces is made by computer software called Dlubal RFEM. Results of internal forces are checked by simplified method.

The diploma thesis describes structural design of selected elements of monolitic reinforced concrete seven-storey building. Structure is designed as a combined reinforced concrete frame with shear walls and core. The main point of structural analysis is design of locally supported RC slab above the 2ND basement floor, column on the 2ND basement floor, piles and analysis of foundation of building and its influence of support stiffness on connected load-bearing structures.

This project is dedicated to the problem of vehicle classification using inductive loop sensors. We created the dataset that contains more than 11000 labeled inductive loop signatures collected at different times and from different parts of the world. Multiple classification methods and their optimizations were employed to the vehicle classification. Final model that combines K-nearest neighbors and logistic regression achieves 94\% accuracy on classification scheme with 9 classes. The vehicle classifier was implemented in C++.

Soit G un schéma en groupes réductif, connexe et déployé sur l’anneau d’entiers d’une extension finie du corps de nombres p-adiques. Un théorème important dans la théorie des groupes c’est le théorème de localisation, ce qui a été démontré par A. Beilinson et J. Bernstein, et par J.L. Brylinsky et M. Kashiwara. Il s’agit d’un résultat de D-affinité pour la variété de drapeaux de la fibre générique de G. En caractéristique mixte un progrès important se trouve dans les travaux de C. Huyghe et T. Schmidt. Ils donnent une réponse partielle en considérant des caractères algébriques. Les premières quatre chapitres de cette thèse sont consacrés à étendre cette correspondance (le théorème de localisation arithmétique) pour des caractères arbitraires. Dans les chapitres cinq et six, nous traiterons l’objectif principal de cette thèse qui concerne les représentations localement analytiques. Nous montrerons que pour un caractère algébrique, qui est de plus dominant et régulier, la catégorie des représentations admissibles localement analytiques, à caractère central, c’est équivalente à une catégorie de modules arithmétiques coadmissibles et équivariants sur la famille des modèles formels de la variété de drapeaux rigide. / Let G be a split connected, reductive group scheme over the ring of integers of a finite extension of the field of p-adic numbers.. An important theorem in group theory is the localization theorem, demonstrated by A. Beilinson and J. Bernstein, and by J.L. Brylinsky and M. Kashiwara. This is a result about the D-affinity of the flag variety of the generic fiber of G). In mixed characteristic an important progress is found in the work of C. Huyghe and T. Schmidt. They give a partial answer by considering algebraic characters. The first four chapters of this thesis are dedicated to extending this correspondence (the arithmetic localization theorem) for arbitrary characters. In chapters five and six, we will treat the principal objective of this thesis, which concerns admissible locally analytic representations. We will show that for an algebraic character, which is dominant and regular, the category of admissible locally analytic representations, with central character, it is equivalent to the category of coadmissible equivariant arithmetic modules over the family of formal models of the rigid flag variety.

We characterize the structure of the domain of a pure jump-type Dirichlet form which is given by a Beurling–Deny formula. In particular, we obtain su cient conditions in terms of the jumping kernel guaranteeing that the test functions are a core for the Dirichlet form and that the form is a Silverstein extension. As an application we show that for recurrent Dirichlet forms the extended Dirichlet space can be interpreted in a natural way as a homogeneous Dirichlet space. For reflected Dirichlet spaces this leads to a simple purely analytic proof that the active reflected Dirichlet space (in the sense of Chen, Fukushima and Kuwae) coincides with the extended active reflected Dirichlet space. / Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.

Dans ce mémoire, nous nous intéressons à une nouvelle classe de distributions instrumentales informatives dans le cadre de l'algorithme Metropolis-Hastings. Ces distributions instrumentales, dites en équilibre, sont obtenues en ajoutant de l'information à propos de la distribution cible à une distribution instrumentale non informative. Une chaîne de Markov générée par une distribution instrumentale en équilibre est réversible par rapport à la densité cible sans devoir utiliser une probabilité d'acceptation dans deux cas extrêmes: le cas local lorsque la variance instrumentale tend vers 0 et le cas global lorsqu'elle tend vers l'infini. Il est nécessaire d'approximer les distributions instrumentales en équilibre afin de pouvoir les utiliser en pratique. Nous montrons que le cas local mène au Metropolis-adjusted Langevin algorithm (MALA), tandis que le cas global mène à une légère modification du MALA. Ces résultats permettent de concevoir un nouvel algorithme généralisant le MALA grâce à l'ajout d'un nouveau paramètre. En fonction de celui-ci, l'algorithme peut utiliser l'équilibre local ou global ou encore une interpolation entre ces deux cas. Nous étudions ensuite la paramétrisation optimale de cet algorithme en fonction de la dimension de la distribution cible sous deux régimes: le régime asymptotique puis le régime en dimensions finies. Diverses simulations permettent d'illustrer les résultats théoriques obtenus. De plus, une application du nouvel algorithme à un problème de régression logistique bayésienne permet de comparer son efficacité à des algorithmes existants. Les résultats obtenus sont satisfaisants autant d'un point de vue théorique que computationnel. / In this master's thesis, we are interested in a new class of informed proposal distributions for Metropolis-Hastings algorithms. These new proposals, called balanced proposals, are obtained by adding information about the target density to an uninformed proposal distribution. A Markov chain generated by a balanced proposal is reversible with respect to the target density without the need for an acceptance probability in two extreme cases: the local case, where the proposal variance tends to zero, and the global case, where it tends to infinity. The balanced proposals need to be approximated to be used in practice. We show that the local case leads to the Metropolis-adjusted Langevin algorithm (MALA), while the global case leads to a small modification of the MALA. These results are used to create a new algorithm that generalizes the MALA by adding a new parameter. Depending on the value of this parameter, the new algorithm will use a locally balanced proposal, a globally balanced proposal, or an interpolation between these two cases. We then study the optimal choice for this parameter as a function of the dimension of the target distribution under two regimes: the asymptotic regime and a finite-dimensional regime. Simulations are presented to illustrate the theoretical results. Finally, we apply the new algorithm to a Bayesian logistic regression problem and compare its efficiency to existing algorithms. The results are satisfying on a theoretical and computational standpoint.

Studien som utförs i detta examensarbete behandlar ämnet datalagring för applikationen Vklass. Problemet som studeras i detta arbete består i att det varje månad inkommer ett stort antal filer till applikationen som lagras på en server lokalt i Stockholm där regelbun-den säkerhetskopiering görs till en annan server. Den implementerade datalagringslösning-en innebär att servern som lagrar data växer ständigt och utan särskild struktur då filerna lagras i en och samma mapp, vilket i sin tur innebär en mer komplex och mindre överskåd-lig lagring av filerna i lagringsmedierna samtidigt som prestandabegränsningar uppstår vid återläsning av säkerhetskopian. Kunden efterfrågar en lösning som innebär en mer effektiv hantering för alla de filer som lagras i applikationen på ett kostnads- och prestandaeffektivt vis. Lösningen bör även möjliggöra lagring av data med en mer överskådlig och lätthanter-lig struktur. De lösningsmetoder som undersökts i arbetet avser datalagring lokalt samt datalagring i molntjänster från de mest framstående aktörerna. Undersökningen och analysen av de valda lösningsmetoderna visade att datalagring i molntjänster uppfyller kraven som den nya data-lagringslösningen ämnar uppnå till skillnad från datalagring lokalt som visade brister och som därmed inte uppfyllde dessa krav. Slutsatsen i arbetet identifierade Microsoft Azure Storage som den mest lämpliga molnleverantören för datalagring då data lagras på ett pre-standa- och struktureffektivt sätt. Lösningen är även kostnadseffektiv då det dyraste lag-ringsalternativet som Microsoft erbjuder sänker lagringskostnaderna för Vklass med 84 % under de kommande fem åren i jämförelse med aktuell lagringsmetod. / The study in this report examines data storage for the application Vklass. The problem that has been studied in this work is that the application receives and stores a big amount of files which are stored on a server locally in Stockholm where back up is made to another server on a regular basis. Today’s implemented solution for data storage endorse that the server that stores the files continues to grow each month without further structure since all the upload files is stored in the same folder which yields a more complex and less lucid storage and management for the data. This yields limitations for the performance of the application when the backup-copy needs to be restored. The owners of the application request a solu-tion that gives a more effective management of the stored data with a cost and performance effective technique. The solution that will be presented in this study should also enable stor-ing data with a more lucid and convenient structure. The studied methods for the solution include storing data locally and data storage in the biggest public cloud services. The investigation and analysis of the chosen methods proved that data storage in cloud services fulfilled the requirements for the identified solution as opposed to the methods for storing data locally that proved to yield deficits which would not fulfill these requirements. The deduction of this study identified Microsoft Azure Sto-rage to be the best public cloud solution for the given problem since data is stored in a per-formance and structure effective way. It was also proven that even the most expensive sto-rage solution provided by Azure Storage lowered the costs for data storage by 84 percent compared to today’s data storage solution during the first five years.

Restaurangutläggen har ökat sedan 2010 och efterfrågan på lokalt producerad mat har ökat allt mer senaste tiden, vars syfte inte längre enbart syftar till att mätta idag. Trender har lett till att mervärden inom mat såsom kvalité, hållbarhet och ursprung efterfrågas, varpå restauranger har anpassat sig till detta för att skapa en matupplevelse. Restauranger efterfrågar därmed en större kvantitet av lokalt producerade råvaror. Grossister verkar mellan producenter och restauranger som en länk för att förmedla råvaror och dess mervärde, men trots det finns brister vid förmedlingen. Tidigare studier har påvisat att lokala producenter har hög kunskap inom sin produktion, men lägre kunskaper inom marknadsföring. Studien syftar till att studera värdekedjan mellan producent, grossist och restaurang samt förutsättningar för en grossists värdeskapande på en lokal marknad. För att kunna besvara syftet besvaras tre forskningsfrågor, vilka ämnar till att öka förståelsen för hur värdekedjan ser ut på en lokal marknad samt öka förståelse kring grossistens roll som värdeskapande aktör. Resultatet av studien visar att värdekedjan fungerar, men att det finns brister vid förmedlingen av mervärde mellan aktörerna. Mellan varje aktör verkar distributionskanaler var mervärden flödar. Ytterligare mervärden konstaterades efterfrågas, vilka inte framgick bland alla aktörer. Vidare kunde det konstateras att det råder otydligheter kring begreppet distribution, vilket anses vara en orsakande faktor till den brist kring förmedling av mervärde som råder idag. Studien har bidragit till att belysa de brister som råder idag, för att öka medvetenhet kring dessa. Vidare har en SWOT-analys lyft fram aspekter som anses vara väsentliga att ta hänsyn till. Studien anses därför vara till nytta för aktörer inom livsmedelsbranschen, specifikt de som verkar på en lokal marknad. / Restaurant outlays have increased since 2010 and the demand for locally produced food has increased more recently, the purpose of which is no longer solely to fill today. Trends have created other demands which restaurants have adapted to, to create a dining experience. Restaurants are thus demanding a larger quantity of locally produced raw ingredients. Wholesalers operate between producers and restaurants as a link to mediate raw ingredients and their added value. Yet, there are deficiencies in the mediation. Previous studies have shown that local producers are knowledgeable in their production, but less knowledgeable in marketing. The purpose is to study the value chain between producer, wholesaler, and restaurant as well as the conditions for a wholesaler's value creation in a local market. To be able to answer the purpose, three research questions have been proposed, which aim to increase the understanding of how the value chain looks like in a local market and increase the understanding of a wholesaler's role as a value-creating actor. The results of the study show that the value chain works, but that there is a deficiency in the mediation of added value between the actors. Distribution channels seem to flow between each actor where added value flows. Other added values were found to be in demand, which was not apparent among all actors. Furthermore, it was found that there is some ambiguity about the concept of distribution, which is considered to be a causative factor for the lack of value-added mediation that prevails today. The study has contributed to highlighting the shortcomings that exist today, to raise awareness of these. Furthermore, a SWOT-analysis has highlighted aspects that are considered to be essential to take into account. The study is therefore considered to be of benefit to actors in the food industry, specifically those operating on a local market.

Les codes localement corrigibles ont été introduits dans le but d'extraire une partie de l'information contenue dans un mot de code bruité, en effectuant un nombre limité de requêtes à ses symboles, ce nombre étant appelé la localité du code. Ces dernières années ont vu la construction de trois familles de tels codes, dont la localité est sous-linéaire en la taille du message, et le rendement est arbitrairement grand. Ce régime de paramètres est particulièrement intéressant pour des considérations pratiques.Dans cette thèse, nous donnons une rapide revue de littérature des codes localement corrigibles, avant d'en proposer un modèle combinatoire générique, à base de block designs. Nous définissons et étudions ensuite un analogue, dans le cas projectif, des relèvements affine de codes introduits par Guo, Kopparty et Sudan. Nous établissons par ailleurs plusieurs liens entre ces deux familles, pour finir par une analyse précise de la structure monomiale de ces codes dans le cas du relèvement plan.Une deuxième partie de la thèse se focalise sur l'application de ces codes à deux protocoles cryptographiques. D'abord, nous proposons un protocole de récupération confidentielle d'information (private information retrieval, PIR) à partir de codes basés sur des designs transversaux, dont la taille des blocs s'apparente à la localité d'un code localement corrigible. Les protocoles ainsi construits ont l'avantage de n'exiger aucun calcul pour les serveurs, et de présenter une faible redondance de stockage ainsi qu'une complexité de communication modérée. Ensuite, nous donnons une construction générique de preuve de récupérabilité (proof of retrievability, PoR) à base de codes admettant une riche structure d'équations de parité à petit poids. Nous en donnons finalement une analyse de sécurité fine ainsi que plusieurs instanciations fondées sur des codes à propriétés locales. / Locally correctable codes (LCCs) were introduced in order to retrieve pieces of information from a noisy codeword, by using a limited number of queries to its symbols, this number being called the locality. Three main families of LCCs reaching sublinear locality and arbitrarily high rate have been built so far. This specific range of parameters is of particular interest concerning practical applications of LCCs.In this thesis, after giving a state of the art for LCCs, we study how they can be built using block designs. We then give an analogue over projective spaces of the family of affine lifted codes introduced by Guo, Kopparty and Sudan. We exhibit several links between both families, and we give a precise analysis of the monomial structure of the code in the case of the lifting of order 2.The second part of the thesis focuses on the application of these codes to two cryptographic protocols. We first build a new private informatin retrieval (PIR) protocol from codes based on transversal designs, whose block size defines the locality of the code. Our construction features no computation on the server side, low storage overhead and moderate communication complexity. Then, we propose a new generic construction of proof-of-retrievability (PoR) that uses codes equipped with an elaborate structure of low-weight parity-check equations. We give a rigorous analysis of the security of our scheme, and we finally propose practical instantiations based on codes with locality.

The subject of the master´s thesis is design documentation for the construction of a winery on the outskirts of the town Hustopeče. The building is designed on a slope between the vineyards and consists of two parts that are connected under the terrain. Under the terrain there is also an underlying part of the building so as not to disturb the landscape of the vineyards. The first part is used for wine production and the second part is used for the presentation of wine. The building is designed from in situ reinforced concrete with load-bearing walls and internal columns. The basement walls are made of waterproof concrete. The above-ground perimeter walls consist of sandwich structures consisting of a load-bearing wall, thermal insulation and a partition made of architectural concrete. At the same time, architectural concrete dominates the entire building. The foundation is designed on piles due to the subsoil. Horizontal structures are solved as locally supported slabs and the roofing is solved by two vegetation roofs and one load-bearing roof.