No description available.

No description available.

We need to employ modern-day technologies in our daily lives to make our life easier. In this thesis, we analyze the user’s oral hygiene habits and core body temperature to help people to track the state of their health. We designed a system in which the data are directly extracted from the mouth, then stored and presented in the application. By means of the system, the people can keep track oftheir core temperature without any extra function apart from their daily chores.The system can also help to keep track of the health of people with symptoms ofdementia and Alzheimer. We used an LM35 temperature sensor to measure temperature. The sensor is mounted on a powered toothbrush head. When the user starts to brush, the sensor records the temperature data for seven times in two minutes of an average brush time and sends it to the mobile application using WiFi. We used a NodeMCUboard, ThingSpeak server and MIT inventor app to transfer the data and designthe mobile application.

Structural frames have been established in many technical applications and typically consist of interconnected profiles. The profiles are commonly joined with node elements. For lightweight structures, the use of composite node elements is expedient. Due to the anisotropic mechanical properties of the fibers, high demands are placed on the orientation of the fibers in the textile reinforcement structure. A continuous fiber course around the circumference and at the junctions is necessary for an excellent force transmission. A special binding and forming process was developed based on the weaving technology. It allows the production of near-net-shaped node elements with branches in any spatial direction, which meet the requirements of load-adjusted fiber orientation. The principles by which these three-dimensional (3D) node elements are converted into a suitable geometry for weaving as a net shape multilayer fabric are reported. The intersections of the branches are described mathematically and flattened to a plane. This is the basis for the weave pattern development. Forming simulations on the macro- and meso-scales complement the analyses. A macro-scale model based on the finite element method (FEM) is used to verify the general formability and the accuracy of the flattenings. Since yarns are pulled through the textile structure in the novel forming process, the required tensile forces and the pulling lengths of the individual yarns are analyzed with a meso-scale FEM model. The flattening for two different node structures is realized successfully, and the simulation proves formability. Furthermore, the necessary forming forces are determined. Finally, the developed method for flattening the 3D geometry is suitable for the design of a variety of spatial node structures and the simulation supports the design of automated forming processes.

The increasing need of consistent implementation of lightweight constructions in many technical fields makes the manufacture of near net-shaped node structure to be used in textile-reinforced composites a subject of great interest. The manufacture of the node structure is required to provide a strong node point whilst maintaining the circumference of each adjoining strut. Despite a variety of available methods to produce three-dimensional nodal fabric, the required geometry for the complex nodular connection element has not yet been fully achieved. Furthermore, the available methods have limitations. The developed woven concept in this work allows for maintaining the configuration of the node structure and dimensions of the tubes, especially at the node points. As a result, all tubes positioned at node points are fully open; this is accomplished without distorting the surrounding area once the flat woven node structure is removed from the loom and erected into three-dimensional configuration. In order to produce a three-dimensional structure on a conventional weaving machine, the structure must be flattened in an appropriate way. By using a mathematical algorithm, it is possible to graph the flattened structure precisely. The developed weaving concept and relating calculation are applied to create the weaving plan of the spatial nodal structures, which can be produced on a shuttle weaving loom. The developed concept in this paper will provide repeatable manufacturing of complex node structures by using the conventional weaving loom. The struts of node structures manufactured using this method can be woven at any angle and with spatial arrangements.

L’informatique en nuage (Cloud computing) est une technologie prometteuse facilitant la réservation et de l'utilisation des ressources d’une manière flexible et dynamique. En plus des ressources informatiques traditionnelles, les utilisateurs du Cloud attendent à ce que des ressources réseaux leurs soient dédiées afin de faciliter le déploiement des fonctions et services réseau. Ils souhaitent pouvoir gérer l'ensemble d'un réseau virtuel (VN) ou infrastructure. Ainsi, les fournisseurs du Cloud doivent déployer des solutions de provisionnement des ressources dynamiques et adaptatives afin d’allouer des réseaux virtuels qui reflètent les besoins variables dans le temps des applications hébergés dans le Cloud. L’état de l’art sur l’allocation des réseaux virtuels s’est uniquement intéressé au problème de mapping des nœuds et liens virtuels composant une demande de réseau virtuel dans les nœuds et chemins du réseau de physique (infrastructure Cloud), connu sous le nom du problème de virtual network embedding (VNE). Peu d'attention a été accordée à la gestion des ressources allouées pour répondre en permanence aux besoins variables des réseaux virtuels hébergés dans le réseau physique et afin d'assurer une utilisation efficace des ressources. L'objectif de cette thèse est de permettre l'allocation des réseaux virtuels d’une manière dynamique et préventive pour faire face aux fluctuations de la demande au cours de la durée de vie du réseau virtuel, et pour améliorer l'utilisation des ressources du substrat. Pour atteindre ces objectifs, la thèse propose d'adaptation des algorithmes d'allocation des ressources pour répondre à l’évolution des demandes du réseau virtuel. Premièrement, nous allons étudier en profondeur l'extension d'un nœud virtuel, à savoir le cas où un nœud virtuel hébergé nécessite plus de ressources alors le nœud physique qui l’héberge n'a pas assez de ressources disponibles. Deuxièmement, nous allons améliorer la proposition précédente afin de considérer la rentabilité du réseau de substrat. Et enfin, nous allons gérer la variation de la demande en bande passante dans les liens virtuels. Par conséquent, la première partie de cette thèse fournit un algorithme heuristique qui traite la fluctuation de la demande dans les nœuds virtuels. L'idée principale de l'algorithme est de réallouer un ou plusieurs nœuds virtuels co-localisés dans du nœud de substrat, qui héberge le nœud en évolution pour libérer des ressources (ou faire de la place) pour le nœud en évolution. En plus de réduire le coût de réaffectation, notre proposition prend en compte et réduit l'interruption de service pendant la migration. L'algorithme précédent a été étendu pour concevoir un algorithme de reconfiguration préventif pour améliorer la rentabilité du réseau physique. En fait, notre proposition profite de la perturbation de la demande de ressources pour ranger le réseau physique à un coût minimal et sans perturbations. Lors de la réaffectation des nœuds virtuels pour faire place pour le nœud en extension, nous réaffectant les liens virtuels les plus congestionnées dans des ressources physiques moins saturées afin d’équilibrer la charge sur le réseau. Notre proposition offre le meilleur compromis entre le coût de réaffectation et l'équilibrage des charges. Enfin, un framework distribué, parallèle et à vue locale a été mis au point pour traiter toutes les formes de fluctuations de la demande en bande passante dans les liens virtuels. Elle se compose d'un contrôleur et trois algorithmes exécutés dans chaque nœud du substrat d'une manière distribuée et parallèle. Le framework est basé sur l'auto-stabilisation, et peut gérer de nombreuses et différentes formes de variations de la demande de bande passante simultanément / Cloud computing is a promising technology enabling IT resources reservation and utilization on a pay-as-you-go manner. In addition to the traditional computing resources, cloud tenants expect compete networking of their dedicated resources to easily deploy network functions and services. They need to manage an entire Virtual Network (VN) or infrastructure. Thus, Cloud providers should deploy dynamic and adaptive resource provisioning solutions to allocate virtual networks that reflect the time-varying needs of Cloud-hosted applications. Prior work on virtual network resource provisioning only focused on the problem of mapping the virtual nodes and links composing a virtual network request to the substrate network nodes and paths, known as the Virtual network embedding (VNE) problem. Little attention was paid to the resource management of the allocated resources to continuously meet the varying demands of embedded virtual networks and to ensure efficient substrate resource utilization. The aim of this thesis is to enable dynamic and preventive virtual network resources provisioning to deal with demand fluctuation during the virtual network lifetime, and to enhance the substrate resources usage. To reach these goals, the thesis proposes adaptive resource allocation algorithms for evolving virtual network requests. We adress the extension of an embedded virtual node requiring more resources and consider the substrate network profitability. We also deal with the bandwidth demand variation in embedded virtual links. We first provide a heuristic algorithm to deal with virtual nodes demand fluctuation. The work is extended by designing a preventive re-configuration scheme to enhance substrate network profitability. Finally, a distributed, local-view and parallel framework was devised to handle embedded virtual links bandwidth fluctuations. The approach is composed of a controller and three algorithms running in each substrate node in a distributed and parallel manner. The framework is based on the self-stabilization approach, and can manage various forms of bandwidth demand variations simultaneously

PlanetLab as a distributed systems testbed offers a unique opportunity for developing and testing new applications useful for future Internet. This work brings up a scheme and a solution of the problem with accessing PlanetLab by a larger group of students e.g. for the purpose of solving their courseworks. A designed system empowers its administrator to create and control virtual user accounts which provide possibility for all its users to connect to selected nodes in the PlanetLab.

The diploma thesis Park and Ride deals with the design of a car park in the town of Hranice, which is known mainly for its important transport train node and Hranice Abyss. The city now suffers from the high intensity of car traffic in the city center due to insufficient street network. This network is disrupted by a four-lane road that was built in the 1980s and cut natural transport links. The abolition of the four-lane road, which is now lacking in transport services, releases a large amount of development area, which is primarily used as an agri-recreational area. Part of this green belt is the parking house, which prevents the entry of surplus cars into the city center. The parking house is a new transport hub of the city, which also includes elements of alternative transport - transfer to public transport or bicycle, which makes it possible to create a city center pleasant for pedestrians.

In breast cancer therapeutic decisions are based on the expression of estrogen (ER), progesterone (PR), the human epidermal growth factor 2 (HER2) receptors and the proliferation marker Ki67. However, only little is known concerning heterogeneity between the primary tumor and axillary lymph node metastases (LNM) in the primary site. We retrospectively analyzed receptor profiles of 215 early breast cancer patients with axillary synchronous LNM. Of our cohort, 69% were therapy naive and did not receive neoadjuvant treatment. Using immunohistochemistry, receptor status and Ki67 were compared between core needle biopsy of the tumor (t-CNB) and axillary LNM obtained during surgery. The discordance rates between t-CNB and axillary LNM were 12% for HER2, 6% for ER and 20% for PR. Receptor discordance appears to already occur at the primary site. Receptor losses might play a role concerning overtreatment concomitant with adverse drug effects, while receptor gains might be an option for additional targeted or endocrine therapy. Hence, not only receptor profiles of the tumor tissue but also of the synchronous axillary LNM should be considered in the choice of treatment.

In this thesis, an exploration mode for the PUREi9 robotic vacuum cleaner is implemented. This exploration would provide information for optimizing the cleaning path beforehand, and would allow the robot to relocalize itself or the charger more easily in case it gets lost. Two elements are needed in order to implement an exploration mode; first, an exploration algo-rithm which will decide the next position of the robot in order to obtain useful information about the environment (unknown areas, empty spaces, obstacles...), and second, an exploration map which stores that information and is updated each time a new relevant position is reached. These elements are related and generally both are required for performing successfully the exploration of a specific environment. A frontier-based strategy is adopted for the exploration algorithm, together with occupancy grid maps. This strategy has long been regarded as a key method for autonomous robots working in unknown or changing environments. The idea of frontier-based algorithms is to divide the environ-ment into cells of regular size and drive the robot to the frontiers between cells with no obstacles and cells for which no information has been gathered. It plans one step ahead by choosing a lo-cation which provides new environment information, instead of planning in advance all locations where the robot needs to acquire new sensor information. Based on frontier strategy, two different exploration algorithms are implemented in the project. The first one is called "random frontier strategy", which chooses arbitrarily the frontier to go among the frontiers set. The second is called "closest frontier strategy", which chooses the closest frontier as the NBV (Next Best View) the robot should drive to. A path planning algorithm, based on Dijkstra’s algorithm and a node graph, has also been implemented in order to guide the robot towards the frontiers. The two methods have been compared by means of simulations in different environments. In addition, both exploration strategies have been tested on a real device. It is found that the closest frontier strategy is more efficient in terms of path length between scanning points, while both methods give a similar exploration ratio, or percentage of fully explored cells within the final map. Some additional work is required in order to improve the performance of the exploration method in the future, such as detecting unreachable frontiers, implementing a more robust path planning algorithm, or filtering the laser measurements more extensively. / I den här rapporten har vi implementerat en utforskningsmod för robotdammsugaren Pure i9. Sådan utforskning skulle ge underlag för att optimera städmönstret i förhand och låta roboten relokalisera sig själv eller laddaren om den tappar bort sig. För att implementera utforskning behövs två saker. För det första krävs en algoritm för utforsk-ning, som bestämmer nästa position för roboten, med målet att samla användbar information om omgivningen (okända eller fria områden, hinder etc.) För det andra krävs en karta som lagrar informationen och uppdateras varje gång roboten når en relevant ny position. Dessa två hänger ihop och i allmänhet krävs båda för att framgångsrikt utforska ett specifikt område. Vi har valt en front-baserad strategi för utforskningsalgoritmen, tillsammans med en rutnäts-karta med sannolikheten för hinder. Denna strategi har länge betraktats som en nyckelmetod för autonoma robotar som arbetar i okända eller föränderliga miljöer. Idén med front-baserade strate-gier är att köra roboten till fronterna mellan celler utan hinder och celler där information saknas. Den planerar ett steg framåt genom att välja en plats som ger ny information om miljön, istället för att i förväg planera alla platser där roboten behöver samla in ny sensorinformation. Baserat på front-strategi, har vi implementerat två utforskningsalgoritmer i projektet. Den första är en slumpmässig strategi, som godtyckligt väljer en front att åka till, ur hela mängden av fronter. Den andra är en närmaste fronten-strategi som väljer den närmaste fronten som den nästa bästa utsiktspunkt som roboten ska åka till. Vi har också implementerat en algoritm för banplanering, baserad på Dijkstras algoritm och en nod-graf, för att styra roboten mot fronterna. Vi har jämfört de två metoderna genom simulering i olika miljöer. Dessutom har båda utforsk-ningsstrategierna testats på en riktig enhet. Närmaste fronten-strategin är effektivare med avse-ende på banlängd mellan skanningspunkter, medan båda metoderna ger liknande utforsknings-grad, eller samma procentandel av fullt utforskade celler inom den slutliga kartan.