El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado. / Currently, the construction industry is characterized by a high competition between its companies. Due to this, companies must guarantee that the performance of their projects is possible by using an appropriate management system which allows an adequate planning of activities, since selecting an inadequate system can cause serious inconveniences such as having rework and increase cost and time in projects. Therefore, the construction industry is constantly searching for management models that can minimize the previously mentioned inconveniences in order to differentiate themselves and take advantage of their competitors. Precisely, the Scrum framework, conceived in the software engineering industry, is an alternative to traditional projects management, offering an exponential improvement in communication for project teams and improving the planning of activities, through an iterative framework that allows flexibility for changing requirements, reduces uncertainty and creates reliability for what was planned. Thus, this research adapts and applies the Scrum framework within a construction project, optimizing considerably the execution time.

No description available.

In this dissertation, we explore the issues related to opportunistic and cooperative communications in a multiuser environment. In the first part of the dissertation, we consider opportunistic scheduling for delay limited systems. Multiuser communication over fading channels is a challenging problem due to fast varying channel conditions. On the other hand, it provides opportunities to exploit the varying nature of the channel and maximize the throughput by scheduling the user (or users) with good channel. This gain is termed as multiuser diversity. The larger the number of users, the greater is the multiuser diversity gain. However, there is an inherent scheduling delay in exploiting multiuser diversity. The objective of this work is to design the scheduling schemes which use multiuser diversity to minimize the system transmit energy. We analyze the schemes in large system limit and characterize the energy--delay tradeoff. We show that delay tolerance in data transmission helps us to exploit multiuser diversity and results in an energy efficient use of the system resources. We assume a general multiuser environment but the proposed scheduling schemes are specifically suitable for the wireless sensor network applications where saving of transmit energyat the cost of delay in transmission is extremely useful to increase the life of battery for the sensor node. In the first part of the thesis, we propose scheduling schemes withthe objective of minimizing transmit energy for a given fixed tolerable transmission delay. The fixed delay is termed as hard deadline. A group of users with channels better than a transmission threshold are scheduled for transmission simultaneously using superposition coding. The transmission thresholds depend onthe fading statistics of the underlying channel and hard deadline of the data to be scheduled. As deadline is approached, the thresholds decrease monotonically to reflect the scheduling priority for theuser. We analyze the proposed schedulers in the large system limit. We compute the optimized transmission thresholds for the proposed scheduling schemes. We analyze the proposed schemes for practically relevant scenarios when the randomly arriving packets have individual, non--identical deadlines. We analyze the case when loss tolerance of the application is exploited to further decrease the system energy. The transmitted energy is not a convex function oftransmission thresholds. Therefore, we propose heuristic optimization procedures to compute the transmission thresholds and evaluate the performance of the schemes. Finally, we study the effect of outer cell interference on the proposed scheduling schemes. The second part of the thesis investigates the problem of cooperative communication between the nodes which relay the data of other sources multiplex with their own data towards a common destination, i.e. a relay node performs as a relay and data source at the same time. This problem setting is very useful in case of some wireless sensor network (WSN) applications where all the nodes relay sensed data towards a common destination sink node. The capacity region of a relay region is still an open problem. We use deterministic network model to study the problem. We characterizethe capacity region for a cooperative deterministic network with single source, multiple relays and single destination. We also characterize the capacity region when communicating nodes have correlated information to be sent to the destination. / Cross Layer Optimization of Wireless Sensor Networks

Jag har valt att fördjupa mig i relationen mellan kreativitet och skrivblockering. Hur påverkas ens kreativa skapande av att jobba mot deadlines med tydliga ramverk och hur kan man undvika att drabbas av skrivblockering är några av frågorna jag kommer att ta upp i denna uppsats. Jag dyker även in i fantasins viktiga betydelse för att försätta sig i ett kreativt flow och hur hjärnan växlar mellan fantasi och lekfullhet till den kritiska rösten. Uppsatsen bygger på mina egna genomlevda upplevelser från skapandet av mitt album men också på en intervju med artisten Eva Dahlgren. Målet har varit att utforska nya metoder för att skapa musik som i slutändan kan utveckla och fördjupa min kreativa process och föra mig framåt men också få en djupare förståelse för vad kreativitet egentligen är och hur andra upplever det. Resultatet blev åtta demos till mitt kommande album samt nya strategier och sätt att skapa musik på som berikat min kreativa process. Jag har även jämfört min och Eva Dahlgrens process och funnit både likheter och skillnader.

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23550号 / 情博第780号 / 新制||情||133(附属図書館) / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 大木 英司, 教授 原田 博司, 教授 湊 真一 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Internet of Things (IoT) blir allt vanligare i dagens samhälle. Allt fler vardagsenheter blir uppkopplade mot det trådlösa nätet. För det krävs kostnadseffektiv datorkraft vilket medför att det kan vara gynnsamt att undersöka mikrokontroller och hur de skulle klara av detta arbete. Dessa kan ses som mindre kompakta datorer vilka trots sin storlek erbjuder en hel del prestanda. Denna studie avser att underrätta om något befintligt operativsystem kan fungera ihop med mikrokontrollern PIC18F452 samt hur många processer som kan köras parallellt givet MCU:ns begränsade minne. Olika metodval undersöktes och diskuterades för att avgöra vilken metod som skulle generera bäst resultat. En undersökning och flera experiment genomfördes för att kunna besvara dessa frågor. Experimenten krävde att en speciell utvecklingsmiljö installerades och att den generiska FreeRTOS distributionen porterades till både rätt processor och experimentkort. Porteringen lyckades och experimenten visade att frågeställningen kunde besvaras med ett ja - det går att köra ett realtidsoperativsystem på en MCU med enbart 1,5 kB RAM-minne. Under arbetets gång konstaterade också projektet att Amazon byggt sin IoTsatsning på FreeRTOS. De hade dock satsat på en mer kraftfull MCU. Satsningen ville därmed framhålla det som en mer framtidssäker inriktning. / Internet of Things (IoT) is becoming more common in today's society. More and more everyday devices are connected to the wireless network. This requires costeffective computing power, which means that it can be beneficial to investigate the microcontroller and how they would cope with this task. These can be seen as smaller compact computers which despite their size offer a lot of performance. This study aims to inform if any existing operating system can work together with the microcontroller PIC18F452 and how many processes that can run in parallel given the MCU's limited memory. A survey and an experiment were conducted to answer these questions. Different choice of methods was investigated and discussed to determine which method would generate the best results. A survey and an experiment were conducted to answer these questions. The experiments required a special development environment to be installed and the generic FreeRTOS distribution was ported to both the correct processor and the experimental card. The porting succeeded and experiments showed that the research question could be answered with a yes. You can run a real-time operating system on an MCU with only 1,5 kB RAM memory. During the work, the project also found that Amazon built its IoT on FreeRTOS. However, they had invested in a more powerful MCU. The effort would thus emphasize it as a more future-proof approach.

This thesis work describes how to apply the stochastic analysis framework, presented in [1] for general priority-driven periodic real-time systems. The proposed framework is applicable to compute the response time distribution, the worst-case response time, and the deadline miss probability of the task under analysis in the fixed-priority driven scheduling system. To be specific, we modeled the task execution time by using the beta distribution. Moreover, we have evaluated the existing stochastic framework on a wide range of periodic systems with the help of defined evaluation parameters. In addition we have refined the notations used in system model and also developed new mathematics in order to facilitate the understanding with the concept. We have also introduced new concepts to obtain and validate the exact probabilistic task response time distribution.    Another contribution of this thesis is that we have extended the existing system model in order to deal with stochastic release time of a job. Moreover, a new algorithm is developed and validated using our extended framework where the stochastic dependencies exist due to stochastic release time patterns. / This is Second Version of the report. Submitted after few modifications made on the order of Thomas Nolte (Thesis Examiner). / START - Stochastic Real-Time Analysis of Embedded Software Systems

La vérification et la validation des composants logiciels des systèmes temps réel est un des enjeuxmajeurs pour le développement de systèmes automatisés. Les modèles de tels systèmes doiventêtre vérifiés, et la conformité de leur implémentation par rapport à leur modèle doit être validée. Nous nous plaçons dans le cadre des systèmes récursifs temps réels modélisables par des automates à pile temporisés avec deadlines (TPAIO). Les deadlines imposent des conditions de progression du temps. L’objectif de cette thèse est de proposer des méthodes de génération de tests pour les TPAIO.Nos contributions sont les suivantes. Premièrement, une relation de conformité pour les TPAIO est introduite. Deuxièmement, une méthode polynomiale de génération de tests à partir d’un TPAIO déterministe avec deadline lazy est définie. Elle consiste à définir un algorithme de calcul d’un automate temporisé d’accessibilité incomplet en respectant les contraintes de pile. Cette méthode est incomplète. L’incomplétude n'étant pas un problème car l’activité de test est par essence incomplète. Troisièmement, nous définissons une méthode générant des cas de tests à partir d’un TPAIO déterministe avec sorties seulement et deadline delayable seulement. Elle d’applique aux abstractions de programmes récursifs temporisés. Elle consiste à générer des cas de tests en calculant un testeur sur-approximé. Finalement, nous avons proposé une généralisation du processus de génération de tests à partir d’un TPAIO général avec entrées/sorties et avec deadlines quelconques. La capacité de cette dernière méthode à détecter des implémentations non conformes est évaluée par une technique de mutation. / The verification and validation of software components for real-time systems is a major challenge for the development of automated systems. The models of such systems must be verified and the conformance of their implementation w.r.t their model must be validated. Our framework is that of real-time recursive systems modelled by timed pushdown automata with deadlines (TPAIO). The deadlines impose time progress conditions. The objective of this thesis is to propose test generation methods from TPAIO.Our contributions are as follows. Firstly, a conformance relation for TPAIO is introduced. Secondly, a polynomial method of test generation from a deterministic TPAIO with only lazy deadlines is defined. It consists of defining a polynomial algorithm that computes a partial reachability timed automaton by removing the stack constraints. This method is incomplete. The incompleteness is not a problem because software testing is an incomplete activity by nature. Thirdly, we define a method for generating test cases from a deterministic TPAIO with only outputs and delayable deadlines. It applies to the abstractions of timed recursive programs. It consists of generating test cases by computing an over-approximated tester. Finally, we propose a generalization of the test generation process from a non deterministic TPAIO with any deadlines. Its ability to detect non conform implementation is assessed by a mutation technique.

Energy consumption is increasingly affecting battery life and cooling for real- time systems. Dynamic Voltage and frequency Scaling (DVS) has been shown to substantially reduce the energy consumption of uniprocessor real-time systems. It is worthwhile to extend the efficient DVS scheduling algorithms to distributed system with dependent tasks. The dissertation describes how to extend several effective uniprocessor DVS schedul- ing algorithms to distributed system with dependent task set. Task assignment and deadline assignment heuristics are proposed and compared with existing heuristics concerning energy-conserving performance. An admission test and a deadline com- putation algorithm are presented in the dissertation for dynamic task set to accept the arriving task in a DVS scheduled real-time system. Simulations show that an effective distributed DVS scheduling is capable of saving as much as 89% of energy that would be consumed without using DVS scheduling. It is also shown that task assignment and deadline assignment affect the energy- conserving performance of DVS scheduling algorithms. For some aggressive DVS scheduling algorithms, however, the effect of task assignment is negligible. The ad- mission test accept over 80% of tasks that can be accepted by a non-DVS scheduler to a DVS scheduled real-time system.

<p>The ongoing wireless communication evolution offers improvements for industrial applications where traditional wireline solutions causes prohibitive problems in terms of cost and feasibility. Many of these new wireless applications are packet oriented and time-critical. The deadline dependent coding (DDC) communication protocol presented here is explicitly intended for wireless real-time applications. The objective of the work described in this thesis is therefore to develop the foundation for an efficient and reliable real-time communication protocol for critical deadline dependent communication over unreliable wireless channels.</p><p>Since the communication is packet oriented, block codes are suitable for error control. Reed-Solomon codes are chosen and incorporated in a concatenated coding scheme using iterative detection with trellis based decoding algorithms. Performance bounds are given for parallel and serially concatenated Reed-Solomon codes using BPSK. The convergence behavior of the iterative decoding process for serially concatenated block codes is examined and two different stopping criteria are employed based on the log-likelihood ratio of the information bits.</p><p>The stopping criteria are also used as a retransmission criterion, incorporating the serially concatenated block codes in a type-I hybrid ARQ (HARQ) protocol. Different packet combining techniques specifically adapted to the concatenated HARQ (CHARQ) scheme are used. The extrinsic information used in the iterative decoding process is saved and used when decoding after a retransmission. This technique can be seen as turbo code combining or concatenated code combining and is shown to improve performance. Saving the extrinsic information may also be seen as a doping criterion yielding faster convergence. As such, the extrinsic information can be used in conjunction with traditional diversity combining schemes. The performance in terms of bit error rate and convergence speed is improved with only negligible additional complexity.</p><p>Consequently, CHARQ based on serially concatenated block codes using iterative detection creates a flexible and reliable scheme capable of meeting specified required realtime constraints.</p>