Microsoft Surface Platform

Import 29/09/2010Bakalářská práce se zabývá novou platformou Microsoft Surface. Práce je teoreticko-aplikačního charakteru. V teoretické části je uveden nejdøíve celkový rozbor této platformy, na který navazuje úvod do vývoje aplikací pro tuto platformu. V porovnání s programy pro bìžné počítače jsou zde nemalé rozdíly nejen ve vzhledu, ale i ovládání, a proto jsou v práci uvedena specifika vývoje pro tuto platformu. Práce se také zamýšlí nad možnou budoucností této technologie. Aplikační část se skládá z implementace ukázkové aplikace a její analýzy. Jedná se o jednu aplikaci implementující většinu profilových vlastností této platformy. Díky mnoha možnostem, které nabízí a podpory jedné z největších softwarových společností, se stává vývoj takových aplikací perspektivním oborem. A tato bakalářská práce přispívá k rychlému zorientování se a snadnějšímu začátku práce s touto novou technologií.Bachelor’s work deals with a new platform Microsoft Surface. The work is of both theoretical and practical character. In theoratical section, there is a complete analysis of the platform at first, at which builds introduction to development of applications for this platform. Compared to programmes for casual computers, there are considerable differences in appearance and control, therefore specifics of development for this platform are included in the work. The work thinks about the possible future of this technology. Practical section is consisted of sample application and its analysis. It is a one application implementing most of the main features of this platform. Thanks to the many possibilities and support of one of the biggest software companies, the development of such applications is becoming a promising field. And this bachelor’s work, helps to quick and better beginning of working with this new technologyPrezenční456 - Katedra informatikyvýborn

Design of control system of two wheels mobile robot

Cílem této bakalářské práce je návrh řídicího systému dvoukolého mobilního robotu a následná realizace tohoto systému pomocí dostupných senzorických prostředků a platformy Single-Board RIO firmy National Instruments. V úvodu je obecně nastíněna problematika dvoukolých mobilních robotů coby inverzních kyvadel, následuje přehled několika existujících řešení tohoto problému. Dále je popsán konkrétní robot včetně popisu jeho jednotlivých částí a matematického modelu. Následuje hlavní část práce, a to návrh senzorického a řídicího systému. V závěru práce je popsána realizace navrženého systému na uvedeném robotu a jsou zhodnoceny výsledky funkce navrženého systému.The aim of this bachelor thesis is to design control system of a two-wheel mobile robot and to subsequently implement this system using available sensor devices and National Instruments’ Single-Board RIO platform. The introduction briefly describes the general issue of two-wheel mobile robots as inverted pendulums, followed by an overview of several existing solutions to this problem. The following describes used robot including description of its parts and its mathematical model. Then the main part of the work follows, which is design of the sensory and control system. At the end of the thesis, the implementation is described along with evaluation of the stabilization system results.

Financial analysis of sport facility

Import 19/10/2011Tato diplomová práce je zaměřena na finanční rozbor provozu sportovního zařízení – aquaparku ve městě Kravaře. V diplomové práci jsou porovnány tři roky provozu aquaparku. Od roku 2008, kdy byl aquapark otevřen, až do roku 2010 jsou porovnány příjmy v měsících dubnu, červenci a říjnu. Zmíněny jsou i počty návštěvníků v jednotlivých dnech i měsících. Dále jsou zde srovnány náklady v jednotlivých letech. Výsledky jsou zpracovány v tabulkách a grafech. V příloze je uvedená také finanční analýza před samotnou výstavbou sportovního zařízení.This graduation theses sis concentrated on financial analysis of running sport facility – aquapark in Kravaře city. In the graduation theses there is comparison of three years running of aquapark. Since 2008, when the aquapark was openned, to 2010 there is comparation of revenues in april, july and october. There is mention about numbers of visitors in each days and months. There is comparation of costs in each year. Counts are processed to tables and diagrams. In attachement there is financial analysis before construction of this sport facilityPrezenční115 - Katedra managementuvýborn

Scheduling on Uniform Processors Revisited

We study the problem of scheduling jobs on uniform processors with the objective to minimize the makespan. In scheduling theory this problem is known as Q||Cmax. We present an EPTAS for scheduling on uniform machines avoiding the use of an MILP or ILP solver. Instead of solving (M)ILPs we solve the LP-relaxation and use structural information about the ``closest'' ILP solution. For a given LP-solution x we consider the distance to the closest ILP solution y in the infinity norm, i.e. ∥x−y∥∞. We call this distance max-gap(Aδ), where Aδ is the constraint matrix of the considered (I)LP. For identical machines and δ=Θ(ϵ) the matrix Aδ has integral entries in {0,…,(1+δ)/δ} and O(1/δlog(1/δ)) rows representing job sizes and 2O(1/δlog2(1/δ)) columns representing configurations of jobs, so that the column sums are bounded by (1+δ)/δ. The running-time of our algorithm is 2O(1/ϵlog(1/ϵ)log(C(Aδ))+O(nlogn) where C(Aδ) denotes an upper bound for max-gap(Aδ). Furthermore, we can generalize the algorithm for uniform machines and obtain a running-time of 2O(1/ϵlog(1/ϵ)log(C(A˜δ))+poly(n), where A˜δ is the constraint matrix for a sub-problem considered in this case. In both cases we show that C(Aδ),C(A˜δ)≤2O(1/ϵlog2(1/ϵ)). Consequently, our algorithm has running-time at most 2O(1/ϵ2log3(1/ϵ))+O(nlogn) for identical machines and 2O(1/ϵ2log3(1/ϵ))+poly(n) for uniform machines, the same as the current best algorithm. But, to our best knowledge, no instance is known to take on the value 2O(1/ϵlog2(1/ϵ)) for max-gap(Aδ) or max-gap(A˜δ). If C(A˜δ),C(Aδ)≤poly(1/ϵ), the running-time of the algorithm would be 2O(1/ϵlog2(1/ϵ))+poly(n) and thus improve the running-time of the current best algorithm

The role of cell-matrix interactions in atherosclerosis

Atherosclerosis is a complex disorder of the arterial wall characterized by prominent changes in the extracellular matrix and in smooth muscle cells (SMC), which are the predominant resident cells in the vessel wall. During atherogenesis SMC modulate their phenotype from the contractile state to the synthetic state.Biomedical Reviews 1992; 1: 7-12

Topography of Lipid Droplet-Associated Proteins: Insights from Freeze-Fracture Replica Immunogold Labeling

Lipid droplets are not merely storage depots for superfluous intracellular lipids in times of hyperlipidemic stress, but metabolically active organelles involved in cellular homeostasis. Our concepts on the metabolic functions of lipid droplets have come from studies on lipid droplet-associated proteins. This realization has made the study of proteins, such as PAT family proteins, caveolins, and several others that are targeted to lipid droplets, an intriguing and rapidly developing area of intensive inquiry. Our existing understanding of the structure, protein organization, and biogenesis of the lipid droplet has relied heavily on microscopical techniques that lack resolution and the ability to preserve native cellular and protein composition. Freeze-fracture replica immunogold labeling overcomes these disadvantages and can be used to define at high resolution the precise location of lipid droplet-associated proteins. In this paper illustrative examples of how freeze-fracture immunocytochemistry has contributed to our understanding of the spatial organization in the membrane plane and function of PAT family proteins and caveolin-1 are presented. By revisiting the lipid droplet with freeze-fracture immunocytochemistry, new perspectives have emerged which challenge prevailing concepts of lipid droplet biology and may hopefully provide a timely impulse for many ongoing studies

An Evaluation Server for Programming Contests

Import 11/07/2012Cílem této diplomové práce je prozkoumat veřejně dostupné vyhodnocovací servery pro soutěže v programování. Popsat jejich účel, strukturu, historii a technické aspekty. Ze získaných informací a údajů navrhnout a naimplementovat vlastní vyhodnocovací server. Systém rozdělit do modulů a u každého z nich popsat účel, problémy, návrh řešení těchto problémů a následně provést implementaci navrženého řešení.The goal of this thesis is to examine the publicly available servers for evaluating programming contests. To describe the purpose, structure, history and technical aspects. Then design and implement own server from collected information. Divide the system into modules and describe the purpose, problems and design of solutions of these problems and then to implement the proposed solution.460 - Katedra informatikyvýborn

Behaviorally Driven Train Timetable Design

The focus of this thesis is to include the passengers and their behavior inside the train timetable design. This is done through three main objectives: timetable design based on passenger satisfaction, exploitation of hybrid cyclicity and choice based revenue optimization. At first, a new Passenger Centric Train Timetabling Problem is introduced into the planning horizon of the passenger railway service. This problem is inter-disciplinary. It combines the discrete choice theory, that models the passengers' behavior, and operations research, that decides on the departure times of the trains (i.e. the timetable). The attributes affecting the passengers' choices with respect to the operated timetable are quantified into a single variable of passenger satisfaction. The objective of the proposed model is the trade-off between the profit of the train operating company and the overall satisfaction of the passengers. The problem is tested on the case study of the morning peak hours in S-train network of Canton Vaud in Switzerland. The results not only confirm that the passenger centric timetables outperform the operational timetable of Swiss Federal Railways (SBB), but they also demonstrate that there is a considerable gap between the performance of the cyclic and the non-cyclic timetable. The cause of this gap are the cyclicity constraints and therefore, new types of hybrid cyclicity are proposed and tested. The aim of the hybrid cyclic timetables is to provide similar level of flexibility (passenger satisfaction) as the non-cyclic timetables while keeping a certain level of regularity (cyclicity). The regularity is taken care of by the design and the flexibility is evaluated upon solving of the previously defined Passenger Centric Train Timetabling Problem. The new types of timetables are tested against the existing types on the case study of one day in the whole network of Israeli Railways. It is shown that the hybrid cyclic timetable can achieve both benefits (regularity and flexibility) at the same time. In the last part of this thesis, the passengers' actual choices are obtained through a discrete choice model. The model takes into account fundamental principles in economics such as demand elasticity, ticket price and opt-out option for passengers. Therefore, the probabilistic Elastic Passenger Centric Train Timetabling Problem provides more realistic solutions. Moreover, since the choice is explicitly modeled, the new problem is integrated with a ticket pricing, in order to improve the level of service. In other words, to prevent overcrowding or to secure the service for passengers who need it the most, etc. To summarize, this thesis makes significant contributions in the conceptual design of timetables by taking into account the passengers and their wishes. Indeed, the planning from the operator's point-of-view is in the state-of-the-art, whereas the passengers have been neglected or have been considered only as an abstract concept

Approximative Algorithmen für 2-dimensionale Packungs- und verwandte Schedulingprobleme

Main subject of this thesis are approximation algorithms for scheduling and packing, two classical geometrical problems in combinatorial optimization. It is divided into three parts. In the first part we consider a generalization of the strip packing problem or geometrical cutting stock problem. In strip packing a given set of rectangles has to be placed into a strip of fixed width and infinite height minimizing the total height used. In the generalized problem setup there are N strips available in which the rectangles have to be allocated and the objective is to minimize the maximum height used. The second part deals with a related scheduling problem. Here we are given parallel jobs instead of rectangles that have to be executed in $N$ platforms of processors. Such a job can be identified with a rectangle, but in contrast to rectangle packing in parallel job scheduling we are allowed to cut the jobs into vertical slides and place them into the platforms as long as all slides of a job start at the same time in the same platform. In the third part we investigate scheduling on uniform processors, a fundamental 1-dimensional scheduling problem. Here the jobs are described by a processing time only and have to be assigned to a set of processors that may run at different speeds.Zentrales Thema dieser Dissertation sind approximative Algorithmen für Ablaufplanungs- und Packungsprobleme, zwei klassische Problemstellungen der kombinatorischen Optimierung. Die vorliegende Arbeit besteht aus drei Teilen. Im ersten Teil betrachten wir eine Verallgemeinerung des Strip Packing Problems, auch geometrisches Zuschnittsproblem genannt. Beim Strip Packing soll eine gegebene Menge von Rechtecken in einen Streifen fester Breite und unendlicher Höhe platziert werden, so dass die genutzte Gesamthöhe minimal wird. Bei dem generalisierten Problem stehen N Streifen zur Verfügung, in welchen die Rechtecke angeordnet werden sollen. Ziel ist es das Maximum der genutzten Gesamthöhen zu minimieren. Der zweite Teil beschäftigt sich mit einem verwandten Problem der Ablaufplanung. Hierbei soll statt der Rechtecke eine Menge von parallelen Aufträgen in N Plattformen von Prozessoren ausgeführt werden. Solch ein Auftrag kann mit einem Rechteck identifiziert werden, aber im Gegensatz zum Packen von Rechtecken dürfen die Aufträge in vertikale Scheiben geschnitten und diese dann in den Plattformen angeordnet werden, solange alle Scheiben eines Auftrags zur gleichen Zeit in ein und derselben Plattform starten. Im dritten Teil untersuchen wir die Ablaufplanung auf uniformen Prozessoren, eine fundamentale 1-dimensionale Problemstellung der Ablaufplanung. Hierbei sind die Aufträge nur durch eine Ausführungszeit gegeben und sollen einer Menge von Prozessoren zugewiesen werden, die verschiedene Geschwindigkeiten haben können

Energy efficient hydraulic system design for force loading of vehicle drivetrain systems

Práce se zabývá návrhem hydraulického systému pro specifickou aplikaci hydrostatického regulovaného pohonu s ohledem na energetickou účinnost navrženého řešení. Použity jsou standardní hydraulické a elektronické komponenty převážně firmy Bosch Rexroth. Cílem práce je provést komplexní návrh od mechanické přes hydraulickou až po elektronickou složku systému. Po krátkém úvodu je v práci popsána a analyzována aplikace a poté jsou vysvětleny základní principy hydraulických zařízení a systémů. Následuje návrh vlastního řešení, respektive návrh několika možných variant. Tyto varianty jsou srovnány na základě vybraných kritérií a zvolené řešení je potom dále rozpracováno. V závěru jsou shrnuty výstupy práce a je nastíněn směr možného zlepšení metod návrhu.The thesis focuses on a hydraulic system design for a specific application of hydrostatic drive with regard to energy efficiency of proposed solution. Standard hydraulic and electronic components are used, mostly products of Bosch Rexroth. The aim of the thesis is to carry out a complex design from mechanic through hydraulic up to the electronic part of the system. After a short introduction in the beginning of the thesis is the particular application described and analyzed. Then the elemental principles of hydraulic devices and systems are explained. In the following part the actual solution is presented, which expands to several different alternatives. These alternatives are compared according to set criteria and the selected alternative is then further developed. At the end of the thesis, the outputs are evaluated and the direction of further possible improvements in the design is outlined.