Prostaglandin E2 (PGE2), a metabolite of arachidonic acid, plays a role in water and sodium reabsorption in the collecting duct of the kidney. The collecting duct is responsible for the fine tuning of water and electrolytes. Only a small fraction of the filtered water and sodium is reabsorbed in the collecting duct, a fraction crucial to the regulation of water and electrolyte balance. This current study addresses the role of EP1, one of four PGE2 receptors, in the collecting duct. It is well documented that PGE2 inhibits sodium and water reabsorption in the collecting duct, however the exact mechanism is still debated. To determine whether the EP1 receptor mitigates AngII renal effects, an in vivo study was performed with EP1-/- mice. Global EP1-/- knockout mice were crossed with a renin overexpressing mouse line (herein denoted as “Ren”) and subjected to a high salt (HS) and low salt (LS) diet. Ren mice displayed an 11mmHg increase in systolic blood pressure (BP) on a HS diet and a decrease in BP of 14mmHg on a LS diet compared to the normal salt (NS) diet. Ren EP1-/- mice did not display a significant increase or decrease in BP on a HS or LS diet. On a LS diet, Ren EP1-/- displayed a drop in urine osmolarity (1641 mOsm/ kgH2O) vs. wild type (WT) mice (2107 mOsm/ kgH2O), consistent with increased sodium reabsorption. Narrowing in on the collecting duct, Ren EP1-/- mice had enhanced αENaC levels compared to Ren mice. In ex vivo microperfusion experiments, EP1-/- tubules show no response to PGE2 in the presence of AVP, whereas PGE2 inhibits AVP induced water reabsorption in WT mice. An increase in αENaC membrane accumulation due to EP1 gene ablation results in increased sodium reabsorption subsequently leading to a rise in BP. This contributes to the lack of salt sensitivity in EP1-/- mice. Overall, the EP1 receptor in the collecting duct represents a potential therapeutic target for the treatment of hypertension.

Dans cette thèse, nous étudions les décompositions arborescentes qui satisfont certaines contraintes supplémentaires et nous proposons des algorithmes pour les calculer dans certaines classes de graphes. Finalement, nous résolvons des problèmes liés au routage en utilisant ces décompositions ainsi que des propriétés structurelles des graphes. Cette thèse est divisée en deux parties. Dans la première partie, nous étudions les décompositions arborescentes satisfaisant des propriétés spécifiques. Dans le Chapitre 2, nous étudions les décompositions de taille minimum, c’est-À-Dire avec un nombre minimum de sacs. Etant donné une entier k 4 fixé, nous prouvons que le problème de calculer une décomposition arborescente de largeur au plus k et de taille minimum est NP-Complet dans les graphes de largeur arborescente au plus 4. Nous décrivons ensuite des algorithmes qui calculent des décompositions de taille minimum dans certaines classes de graphes de largeur arborescente au plus 3. Ces résultats ont été présentés au workshop international ICGT 2014. Dans le Chapitre 3, nous étudions la cordalité des graphes et nous introduisons la notion de k-Good décomposition arborescente. Nous étudions tout d’abord les jeux de Gendarmes et Voleur dans les graphes sans long cycle induit. Notre résultat principal est un algorithme polynomial qui, étant donné un graphe G, soit trouve un cycle induit de longueur au moins k+1, ou calcule une k-Good décomposition de G. Ces résultats ont été publiés à la conférence internationale ICALP’12 et dans la revue internationale Algorithmica. Dans la seconde partie de la thèse, nous nous concentrons sur des problèmes de routage. / A tree decomposition of a graph is a way to represent it as a tree by preserving some connectivity properties of the initial graph. Tree decompositions have been widely studied for their algorithmic applications, in particular using dynamic programming approach. In this thesis, we study tree decompositions satisfying various constraints and design algorithms to compute them in some graph classes. We then use tree decompositions or specific graph properties to solve several problems related to routing. The thesis is divided into two parts. In the first part, we study tree decompositions satisfying some properties. In Chapter 2, we investigate minimum size tree decompositions, i.e., with minimum number of bags. Given a fixed k 4, we prove it is NP-Hard to compute a minimum size decomposition with width at most k in the class of graphs with treewidth at least 4. We design polynomial time algorithms to compute minimum size tree decompositions in some classes of graphs with treewidth at most 3 (including trees). Part of these results will be presented in ICGT 2014. In Chapter 3, we study the chordality (longest induced cycle) of graphs and introduce the notion of good tree decomposition (where each bag must satisfy some particular structure). Precisely, we study the Cops and Robber games in graphs with no long induced cycles. Our main result is the design of a polynomial-Time algorithm that either returns an induced cycle of length at least k+1 of a graph G or compute a k-Good tree decomposition of G. These results have been published in ICALP 2012 and Algorithmica. In the second part of the thesis, we focus on routing problems.

The thesis discusses current state of Czech market and trade with contemporary and modern art via the phenomenon of collectables. Major emphasis is given to the specifics of both young contemporary art in the context of collecting and trading, and using art as a form of investment. Theoretical part is derived from the limited present literature and describes basic mechanisms and theoretical processes of the art market. Practical part presents a mixture of statistics of art market parameters and interviews with professionals, and poses very concrete constructive questions in relation to investigation of the real manifestation of these processes. The thesis concludes with demonstrating that neither assumptions based on theory nor foreign common practice can be employed (due to numerous aspects) on the Czech market, which can be described as strongly conservative.

Evaluates the noise generated in the urban environment through the collecting of recyclable solid residues, done by compacting trucks. It is related the levels of noises to the concept of acoustic comfort. It demonstrates how is realized the recyclable solid residues in the residential zone, with predominantly familiar occupation. The levels of noise made in the collecting activity, in its totality, show superior values to what is allowed by NBR 10151/2000 in external diurnal residential areas. / Avalia-se o ruído gerado no meio urbano, pela coleta dos resíduos sólidos recicláveis, efetuada por caminhões compactadores. Relaciona os níveis de ruído aos conceitos para o conforto acústico. Demonstra como é realizada a coleta dos resíduos sólidos recicláveis em zona residencial, com ocupação predominantemente residencial unifamiliar. Os níveis de ruído produzidos nas atividades de coleta, em sua totalidade, indicaram valores superiores aos permissíveis pela NBR 10151/2000 para áreas residenciais externa e diurna.

Neste projeto estudamos algoritmos de aproximação para o problema da árvore de Steiner com coleta de prêmios. Trata-se de uma generalização do problema da árvore de Steiner, onde é dado um grafo com custos positivos nas arestas e penalidades positivas nos vértices. O objetivo é encontrar uma subárvore do grafo que minimize a soma dos custos das arestas mais a soma das penalidades dos vértices que não pertencem à subárvore. Em 2009, os autores Archer, Bateni, Hajiaghayi e Karloff obtiveram pela primeira vez um algoritmo com fator de aproximação estritamente menor do que 2. Além de analisarmos este algoritmo, estudamos também a implementação de algoritmos 2-aproximação para o problema da árvore de Steiner e da árvore de Steiner com coleta de prêmios. / In this project we analyze approximation algorithms for the prize-collecting Steiner tree problem. This is a generalization of the Steiner tree problem, in which it is given a graph with positive costs in edges and positive penalties in vertices. The goal is to find a subtree of the graph that minimizes the sum of costs of edges plus the sum of the penalties of the vertices that don\'t belong to the subtree. In 2009, the authors Archer, Bateni, Hajiaghayi e Karloff described, for the first time an algorithm with approximation factor strictly less than 2. Besides analyzing this algorithm, we also study the implementation of 2-approximation algorithms to the Steiner tree problem and prize-collecting Steiner tree problem.

京都大学 / 0048 / 新制・課程博士 / 博士(医学) / 甲第22879号 / 医博第4673号 / 新制||医||1047(附属図書館) / 京都大学大学院医学研究科医学専攻 / (主査)教授 川口 義弥, 教授 柳田 素子, 教授 小川 修 / 学位規則第4条第1項該当 / Doctor of Medical Science / Kyoto University / DFAM

This thesis is focused on designing and manufacturing a shredder for plastic waste 2H for small companies, households and blocks of flats. Thesis contains brief description of plastics, their properties and usage in praxis. It deals with excessive production of plastic, noncircular economy of waste and unsatisfactory processing of plastic waste. There are examples of collecting, sorting and recycling technologies and their application in praxis. It consists of current overview of shredders available on Czech and Slovak market and their comparison. Practical part of this thesis focuses on design itself, its components, parameters and economic issues of manufacturing. Annex contains 3D model of shredder assembly, bought components overview, assembly drawings and photo documentation of created shredder.

The diploma thesis describes theory that is needed for application development for acquisition of communication statistical data from network infrastructure devices. Aplication is called SDSKSI. The project compares protocols suitable for this purpose. Finally SNMP protocol was chosen because it is the most common in network devices. SNMP is described in detail. Each SNMP operation has its own practical demonstration. In the project there is also described MIB database and data types of MIB objects. Application is able to create network topology. Then administrator of network can imagine how the network looks like. For each device that support SNMP protocol are periodically collected and stored statistical data which can be exported to the file. For application development were chosen programming languages according to several criteria. Content of the laboratory exercise is presented. At the end of the project there are some system solutions for collecting statistical data. Diploma thesis contents two attachments. The first is containing the full text of laboratory task. The second is DVD disc. Disc is containing ready to boot aplication SDSKSI.

The diploma thesis focuses on design of e-commerce for selling of numismatic material especially two euro collectors coins. Product of this diploma thesis is an internet e-shop with two roles. First role is user and second is administrator. Administrator is able to edit and operate all orders with year’s sheet of profits and losses. Income trading of first months is also part of this thesis.

This dissertation entitled Crystals Collector is concerned with the phenomenon of collecting, and more specifically with crystals as objectes in an imaginary collection. The objects are selected based on a personal fascination of the author. However, the collection always has, similarly as a crystal, a predetermined internal structure. The meaning of individual parts only become apparent when they are viewed as a whole. The main artefacts of the collection are paintings on canvas - with the painting becoming a similar 'fetish' as a collected crystal. Mineral it the key artefact and as such it is subjected to deeper examination (experiments with growth of crystals, studies of crystals, artefacts having a close relationship to crystals...).