Abstract At the heart of the smart space vision is the idea that devices interoperate with each other autonomously to assist people in their everyday activities. In order to make this vision a reality, it is important to achieve semantic-level interoperability between devices. The goal of this dissertation is to enable Semantic Web technology-based interoperability in smart spaces. There are many challenges that need to be solved before this goal can be achieved. In this dissertation, the focus has been on the following four challenges: The first challenge is that the Semantic Web technologies have neither been designed for sharing real-time data nor large packets of data such as video and audio files. This makes it challenging to apply them in smart spaces, where it is typical that devices produce and consume this type of data. The second challenge is the verbose syntax and encoding formats of Semantic Web technologies that make it difficult to utilise them in resource-constrained devices and networks. The third challenge is the heterogeneity of smart space communication technologies that makes it difficult to achieve interoperability even at the connectivity level. The fourth challenge is to provide users with simple means to interact with and configure smart spaces where device interoperability is based on Semantic Web technologies. Even though autonomous operation of devices is a core idea in smart spaces, this is still important in order to achieve successful end-user adoption. The main result of this dissertation is a semantic interoperability framework, which consists of following individual contributions: 1) a semantic-level interoperability architecture for smart spaces, 2) a knowledge sharing protocol for resource-constrained devices and networks, and 3) an approach to configuring Semantic Web-based smart spaces. The architecture, protocol and smart space configuration approach are evaluated with several reference implementations of the framework components and proof-of-concept smart spaces that are also key contributions of this dissertation. / Tiivistelmä Älytilavision ydinajatuksena on, että erilaiset laitteet tuottavat yhteistyössä ihmisten elämää helpottavia palveluita. Vision toteutumisen kannalta on tärkeää saavuttaa semanttisen tason yhteentoimivuus laitteiden välillä. Tämän väitöskirjan tavoitteena on mahdollistaa semanttisen webin teknologioihin pohjautuva yhteentoimivuus älytilan laitteiden välillä. Monenlaisia haasteita täytyy ratkaista, ennen kuin tämä tavoite voidaan saavuttaa. Tässä työssä keskityttiin seuraaviin neljään haasteeseen: Ensimmäinen haaste on, että semanttisen webin teknologioita ei ole suunniteltu reaaliaikaiseen kommunikaatioon, eivätkä ne sovellu isojen tiedostojen jakamiseen. Tämän vuoksi on haasteellista hyödyntää niitä älytiloissa, joissa laitteet tyypillisesti jakavat tällaista tietoa. Toinen haaste on, että semanttisen webin teknologiat perustuvat syntakseihin ja koodausformaatteihin, jotka tuottavat laitteiden kannalta tarpeettoman pitkiä viestejä. Tämä tekee niiden hyödyntämisestä hankalaa resurssirajoittuneissa laitteissa ja verkoissa. Kolmas haaste on, että älytiloissa hyödynnetään hyvin erilaisia kommunikaatioteknologioita, minkä vuoksi jopa tiedonsiirto laitteiden välillä on haasteellista. Neljäs haaste on tarjota loppukäyttäjälle helppoja menetelmiä sekä vuorovaikutukseen semanttiseen webiin pohjautuvien älytilojen kanssa että tällaisen älytilan muokkaamiseen käyttäjän tarpeiden mukaiseksi. Vaikka laitteiden itsenäinen toiminta onkin älytilojen perusajatuksia, tämä on kuitenkin tärkeää teknologian hyväksymisen ja käyttöönoton kannalta. Väitöskirjan päätulos on laitteiden semanttisen yhteentoimivuuden viitekehys, joka koostuu seuraavista itsenäisistä kontribuutioista: 1) semanttisen tason yhteentoimivuusarkkitehtuuri älytiloille, 2) tiedonjakoprotokolla resurssirajoittuneille laitteille ja verkoille sekä 3) menetelmä semanttiseen webiin pohjautuvien älytilojen konfigurointiin. Näiden kontribuutioiden evaluointi suoritettiin erilaisten järjestelmäkomponenttien referenssitoteutuksilla ja prototyyppiälytiloilla, jotka kuuluvat myös väitöskirjan keskeisiin kontribuutioihin.

Expectations regarding the contributions of academics to entrepreneurial activity in addition to their primary role of carrying out teaching and research have increased in recent years. Nevertheless, research on academic entrepreneurship has, to date, been carried out mainly in developed nations and there has been little emphasis on developing countries, particularly low income ones. Developing countries, when compared with developed nations, have been reported to face relatively high levels of resource scarcity that involve shortages of skills, finance, physical infrastructure, technology, and institutions needed for innovation and entrepreneurship. This gap in our knowledge leads to the main objective of this study, which is to investigate academic entrepreneurship in a resource constrained environment. Referring to the entrepreneurship and diversification literature, the current study argues that, as a strategy to extract value from a resource constrained environment, academic entrepreneurs may diversify their entrepreneurial engagements, which is named in this research as ‘plural activity’. In order to achieve the main objective, this thesis derives four specific objectives; namely, investigating the ‘plural activities’ of academic entrepreneurs, studying the motivations of academic entrepreneurs, examining the influence of multilevel causal factors on ‘plural activities’, and investigating the impacts of academic entrepreneurship on universities and wider economy. Sequential mixed methods were adopted in three stages; namely, an initial context specific data gathering stage, an on-line survey, and in-depth interviews. Initial context specific data were used to design two subsequent data collection phases. This approach was believed to improve the construct validity of the study. The main purpose of the on-line survey was to obtain a broad understanding of the entrepreneurial engagements of academics, while that of in-depth interviews was to obtain detailed context specific data, required to achieve research objectives. This sequential mixed method design of a survey being followed up by in-depth interviews was also considered to improve the internal validity of this research.The results suggested that entrepreneurial activity was a means of overcoming resource barriers in a resource constrained environment as opposed to resources are a means of becoming entrepreneurial in a resource rich environment. The majority of academic entrepreneurs had overcome resource and opportunity constraints by diversifying their entrepreneurial engagements. ‘Plural activity’ was found to generate synergies between multiple academic entrepreneurial activities. Diversifying into a greater number of different activities was found to generate more synergistic effects than diversifying into a limited number of similar activities. Nevertheless, there remained synergies between those who adopted different diversification strategies. Moreover, academic entrepreneurship was found to enable the overcoming of resource barriers to university teaching and research as well as deliver positive outcomes to universities and wider economy. Furthermore, it was evident that academics were initially motivated by ‘push’ motives and over time the influence of ‘push’ factors declined, while the impact of ‘pull’ motives increased. As a result of a lack of research capabilities of industry and funding for universities, there was a higher mutual interdependence between universities and industry. However, due to the unavailability of supportive mechanisms or formal institutional infrastructure to promote academic entrepreneurship, university-industry interactions were driven by individuals, and thus, were scattered and isolated. Policy implications and future research avenues were considered in conclusion.

The purpose of this study was to gain an in-depth understanding of whether or not, and how teachers in a resource-constrained rural school sustain their motivation in and commitment to teaching over a life-span. The Social Cognitive Career Theory was chosen as theoretical framework because it recognises the importance that factors in the environment play when the career paths of individuals unfold. A conceptual framework for ‘teacher career resilience’ was developed by merging current thinking on resilience, teacher resilience and career resilience. The life-history design was framed methodologically as biographical research with participatory principles. Teacher participants (n=5, 3=female and 2=male) were selected according to purposive sampling. Data were generated through participatory interview-conversations, which were audio-recorded and transcribed verbatim, as well as memory books, joint photograph-taking and field notes in a researcher diary. Five themes emerged from the guided phenomenological analysis process (Hycner, 1985) and narrative comparison. First, this study exposes illiteracy of learners’ parents, demotivated learners, and a negative national teacher fraternity as sources of adversity not previously noted as significant for teachers in rural settings. Second, rural teachers in this study drew strength from their own life experiences of adversity (being from rural areas themselves); and they relied on their own agency in problem solving. Third, in addition participating rural teachers make use of encouraging memories of their own teachers from childhood and partake in informal professional development activities such as collaborative peer discussions rather than mentoring to grow professionally. Fourth, participating teachers in rural resource-constrained South Africa thus use similar internal protective resources (problem solving, strategizing, cognitive restructuring and emotional regulation) in their adaptive coping repertoire to those of other teachers globally. Fifth, teachers did not enter the teaching profession in the same way as has been documented elsewhere; but entered the teaching profession as a result of socio-political and financial influences, chance happenings and the influence of significant teachers in their past. Teachers seem to balance their use of protective resources between internal and external resources in their current practice. Over time, however they draw more on internal protective resources. Teachers conceptualised their teacher career resilience on a continuum: persevering through adversity, both as young children, and as growing professionals. They use their self-efficacy beliefs, embedded in an adversity drenched past, to manage, overcome and cope despite current chronic adversity. Teachers’ overt behavior in adaptive coping processes was dependent on the interrelatedness between their attributes (especially internal protective resources), the environment (chronic adversity) and the continuous loop of influence (appraisal) between these three factors. Teachers became skilled in resilience processes because of the chronic adversity they face. Teachers’ self-efficacy beliefs about their adaptive coping extended beyond what they themselves can achieve to what their efforts in teaching may mean to model hope to learners, as their teachers modelled to them, fostering a certain altruistic career anchor. / Thesis (PhD)--University of Pretoria, 2013. / gm2014 / Educational Psychology / unrestricted

No description available.

The expectations in performing high-performance cyber-physical applications in resource-constrained devices are continuously increasing. The available hardware is still a main limitation in this context, both in terms of computation capability and energy limits. On the other hand, one must ensure the robust and accurate execution of the applications deployed, since their failure may entail risks for humans and the surrounding environment. The limits and risks are enhanced when multiple applications are executed on the same device. The focus of this thesis is to provide a trade-off between the required performance and power consumption. The focus is on two fundamental applications in the mobile autonomous vehicles scenario: localization and object detection. The multi-objective optimization is performed in a cross-layer manner, exploring both applications and platform configurable parameters with Design Space Exploration (DSE). The focus is on localization and detection accuracy, detection latency and power consumption. Predictive models are designed to estimate the metrics of interest and ensure robust execution, excluding potential faulty configurations from the design space. The research is approached empirically, performing tests on the Nvidia Jetson AGX and NX platforms. Results show that optimal configurations for a single application are in general sub-optimal or faulty for the concurrent execution case, while the opposite is sometimes applicable. / Resursbegränsade enheter förväntas utföra mer och mer krävande cyberfysiska program. Hårdvaran är en av de huvudsakliga begränsningarna både vad gäller beräkningshastighet och energigränser. Samtidigt måste programmen som körs vara robusta och noggranna, eftersom ett fel kan påverka människor och deras omgivning. När flera program körs på samma enhet blir både begränsningar och risker större. Den här avhandlingen fokuserar på att göra en avvägning mellan krav på prestanda och energiförbrukning för två tillämpningar inom området autonoma fordon: lokalisering och objektigenkänning. Med hjälp av Design Space Exploration (DSE) utforskas parametrar både i applikationerna och på plattformen genom att utföra tvärlageroptimering med flera mål. Lokaliserings- och detekteringsnoggrannhet, fördröjning i igenkänning och energiförbrukning är egenskaper i fokus. Prediktiva modeller designas för att estimera måtten som är av intresse och garantera robust körning genom att utesluta potentiellt felaktiga konfigurationer. Empirisk forskning görs med tester på Nvidia Jetson AGXoch NX-plattformarna. Resultaten visar att de optimala konfigurationerna för ett enda program i allmänhet är suboptimala eller felaktiga vid körning av flera program samtidigt, medan motsatsen ibland är tillämplig.

Today, a large number of devices with small form factors and limited resources are being integrated with processes to perform complex tasks such as localization and mapping. One example of this are headsets used for Extended Reality. These devices are expected to perform under changing conditions in the environment and in the available resources, which require sophisticated control policies. In this thesis project, we start investigating the feasibility of online control of the image resolution of the camera sensor used for Visual Localization, for the purpose of minimizing the requirements of the process without decreasing the performance. Specifically, we perform extensive experiments on two Visual Simultaneous Localization and Mapping systems and a Visual Odometry system on two platforms with limited resources to see how the performance metrics are affected by the image resolution. Moreover, we model the localization error of ORB-SLAM3 with the use of feature matching statistics and the camera velocity. Our experimental results show that savings in terms of the execution time of Visual Localization by adapting the image resolution is possible in some situations. But we did not find significant potential savings in terms of the power consumption of the devices. We also found that the feature matching statistics improve predictions about the localization error of ORB-SLAM3 in several situations compared to only using the camera velocity. But the results are limited to a set of known scenarios, which highlights the difficulty of the modelling problem. Nevertheless, this thesis provides valuable insights into how sensor parameters affect the performance of Visual Localization, and how the localization error relates to tracking statistics inside the localization process. / Idag utrustas fler resursbegränsade enheter med förmågan att utföra komplicerade uppgifter, såsom lokalisering och kartläggning i realtid. Efterfrågan av att små enheter med begränsade resurser ska kunna lokalisera i realtid styrs bland annat av intresset för virtuella upplevelser, till exempel med hjälp av smarta glasögon. Men för att leva upp till förväntningarna krävs en nogrann avvägning mellan prestanda och resurseffektivitet, något som försvåras av en föränderlig omgivning. I det här examensarbetet så utreds möjligheten att påverka prestandan och resurskraven av bildbaserad lokalisering i realtid genom att anpassa bildupplösningen av kameran. Att minska resurskraven för denna processen gör att det blir enklare att uppnå acceptabel prestanda på resursbegränsade enheter och underlättar avlastning av delar av processen med hjälp av molntjänster. I samband med utredningen så modelleras felet av ORB-SLAM3 med hjälp av interna mätetal som karakteriserar lokaliseringsprocessen för att i framtiden kunna informera beslut om bildupplösningen. Resultaten tyder på att det i vissa fall är möjligt att minska resurskraven av bildbaserad lokalisering utan att försämra prestandan. Vad gäller modelleringen av felet, så tyder resultaten på att de valda mätetalen inte är nog för att förutspå felet med någon vidare säkerhet. Men genom att kombinera mätetalen med kamerans hastighet så kan man till viss mån förutspå felet av ORB-SLAM3 i ett urval av kända scenarion. Däremot visar sig resultaten inte vara generaliserbara till nya scenarion som modellerna inte har tränats på, vilket understryker svårigheten av problemet. Genom detta arbetet har vi bidragit med värdefulla insikter som kan leda forskningen inom området vidare.

The ever-expanding volume of data generated by network devices such as smartphones, personal computers, and sensors has significantly contributed to the remarkable advancements in artificial intelligence (AI) and machine learning (ML) algorithms. However, effectively processing and learning from this extensive data usually requires substantial computational capabilities centralized in a server. Moreover, concerns regarding data privacy arise when collecting training data from distributed network devices. To address these challenges, collaborative ML with decentralized data has emerged as a promising solution for large-scale machine learning across distributed devices, driven by the parallel computing and learning trends. Collaborative and distributed ML can be broadly classified into two types: server-based and fully decentralized, based on whether the model aggregation is coordinated by a parameter server or performed in a decentralized manner through peer-to-peer communication. In cases where communication between devices occurs over wireless links, which are inherently imperfect, unreliable, and resource-constrained, how can we design communication protocols to achieve the best learning performance? This thesis investigates decentralized learning using decentralized stochastic gradient descent, an established algorithm for decentralized ML, in a novel setting with imperfect and constrained communication. "Imperfect" implies that communication can fail and "constrained" implies that communication resources are limited. The communication across a link between two devices is modeled as a binary event with either success or failure, depending on if multiple neighbouring devices are transmitting information. To compensate for communication failures, every communication round can have multiple communication slots, which are limited and must be carefully allocated over the learning process. The quality of communication is quantified by introducing normalized throughput, describing the ratio of successful links in a communication round. To decide when devices should broadcast, both random and deterministic medium access policies have been developed with the goal of maximizing throughput, which has shown very efficient learning performance. Finally, two schemes for allocating communication slots over communication rounds have been defined and simulated: Delayed-Allocation and the Periodic-Allocation schemes, showing that it is better to allocate slots late rather than early, and neither too frequently nor infrequently which can depend on several factors and requires further study

Die zentrale europäische Verkehrsflusssteuerung (englisch: ATFM) und Luftverkehrsgesellschaften (englisch: Airlines) verwenden unterschiedliche Paradigmen für die Priorisierung von Flügen. Während ATFM jeden Flug als individuelle Einheit betrachtet, um die Kapazitätsauslastung aller Sektoren zu steuern, bewerten Airlines jeden Flug als Teilabschnitt eines Flugzeugumlaufes, eines Crew-Einsatzplanes bzw. einer Passagierroute. Infolgedessen sind ATFM-Zeitfenster für Flüge in Kapazitätsengpässen oft schlecht auf die Ressourcenabhängigkeiten innerhalb eines Airline-Netzwerks abgestimmt, sodass die Luftfahrzeug-Bodenabfertigung – als Verbindungselement bzw. Bruchstelle zwischen einzelnen Flügen im Netzwerk – als Hauptverursacher primärer und reaktionärer Verspätungen in Europa gilt. Diese Dissertation schließt die Lücke zwischen beiden Paradigmen, indem sie ein integriertes Optimierungsmodell für die Flugplanwiederherstellung entwickelt. Das Modell ermöglicht Airlines die Priorisierung zwischen Flügen, die von einem ATFM-Kapazitätsengpass betroffen sind, und berücksichtigt dabei die begrenzte Verfügbarkeit von Abfertigungsressourcen am Flughafen. Weiterhin werden verschiedene Methoden untersucht, um die errechneten Flugprioritäten vertraulich innerhalb von kooperativen Lösungsverfahren mit externen Stakeholdern austauschen zu können. Das integrierte Optimierungsmodell ist eine Erweiterung des Resource-Constrained Project Scheduling Problems und integriert das Bodenprozessmanagement von Luftfahrzeugen mit bestehenden Ansätzen für die Steuerung von Flugzeugumläufen, Crew-Einsatzplänen und Passagierrouten. Das Modell soll der Verkehrsleitzentrale einer Airline als taktische Entscheidungsunterstützung dienen und arbeitet dabei mit einer Vorlaufzeit von mehr als zwei Stunden bis zur nächsten planmäßigen Verkehrsspitze. Systemimmanente Unsicherheiten über Prozessabweichungen und mögliche zukünftige Störungen werden in der Optimierung in Form von stochastischen Prozesszeiten und mittels des neu-entwickelten Konzeptes stochastischer Verspätungskostenfunktionen berücksichtigt. Diese Funktionen schätzen die Kosten der Verspätungsausbreitung im Airline-Netzwerk flugspezifisch auf der Basis historischer Betriebsdaten ab, sodass knappe Abfertigungsressourcen am Drehkreuz der Airline den kritischsten Flugzeugumläufen zugeordnet werden können. Das Modell wird innerhalb einer Fallstudie angewendet, um die taktischen Kosten einer Airline in Folge von verschiedenen Flugplanstörungen zu minimieren. Die Analyseergebnisse zeigen, dass die optimale Lösung sehr sensitiv in Bezug auf die Art, den Umfang und die Intensität einer Störung reagiert und es folglich keine allgemeingültige optimale Flugplanwiederherstellung für verschiedene Störungen gibt. Umso dringender wird der Einsatz eines flexiblen und effizienten Optimierungsverfahrens empfohlen, welches die komplexen Ressourcenabhängigkeiten innerhalb eines Airline-Netzwerks berücksichtigt und kontextspezifische Lösungen generiert. Um die Effizienz eines solchen Optimierungsverfahrens zu bestimmen, sollte das damit gewonnene Steuerungspotenzial im Vergleich zu aktuell genutzten Verfahren über einen längeren Zeitraum untersucht werden. Aus den in dieser Dissertation analysierten Störungsszenarien kann geschlussfolgert werden, dass die flexible Standplatzvergabe, Passagier-Direkttransporte, beschleunigte Abfertigungsverfahren und die gezielte Verspätung von Abflügen sehr gute Steuerungsoptionen sind und während 95 Prozent der Saison Anwendung finden könnten, um geringe bis mittlere Verspätungen von Einzelflügen effizient aufzulösen. Bei Störungen, die zu hohen Verspätungen im gesamten Airline-Netzwerk führen, ist eine vollständige Integration aller in Betracht gezogenen Steuerungsoptionen erforderlich, um eine erhebliche Reduzierung der taktischen Kosten zu erreichen. Dabei ist insbesondere die Möglichkeit, Ankunfts- und Abflugzeitfenster zu tauschen, von hoher Bedeutung für eine Airline, um die ihr zugewiesenen ATFM-Verspätungen auf die Flugzeugumläufe zu verteilen, welche die geringsten Einschränkungen im weiteren Tagesverlauf aufweisen. Die Berücksichtigung von Unsicherheiten im nachgelagerten Airline-Netzwerk zeigt, dass eine Optimierung auf Basis deterministischer Verspätungskosten die taktischen Kosten für eine Airline überschätzen kann. Die optimale Flugplanwiederherstellung auf Basis stochastischer Verspätungskosten unterscheidet sich deutlich von der deterministischen Lösung und führt zu weniger Passagierumbuchungen am Drehkreuz. Darüber hinaus ist das vorgeschlagene Modell in der Lage, Flugprioritäten und Airline-interne Kostenwerte für ein zugewiesenes ATFM-Zeitfenster zu bestimmen. Die errechneten Flugprioritäten können dabei vertraulich in Form von optimalen Verspätungszeitfenstern pro Flug an das ATFM übermittelt werden, während die Definition von internen Kostenwerten für ATFM-Zeitfenster die Entwicklung von künftigen Handelsmechanismen zwischen Airlines unterstützen kann.:1 Introduction 2 Status Quo on Airline Operations Management 3 Schedule Recovery Optimization Approach with Constrained Resources 4 Implementation and Application 5 Case Study Analysis 6 Conclusions / Air Traffic Flow Management (ATFM) and airlines use different paradigms for the prioritisation of flights. While ATFM regards each flight as individual entity when it controls sector capacity utilization, airlines evaluate each flight as part of an aircraft rotation, crew pairing and passenger itinerary. As a result, ATFM slot regulations during capacity constraints are poorly coordinated with the resource interdependencies within an airline network, such that the aircraft turnaround -- as the connecting element or breaking point between individual flights in an airline schedule -- is the major contributor to primary and reactionary delays in Europe. This dissertation bridges the gap between both paradigms by developing an integrated schedule recovery model that enables airlines to define their optimal flight priorities for schedule disturbances arising from ATFM capacity constraints. These priorities consider constrained airport resources and different methods are studied how to communicate them confidentially to external stakeholders for the usage in collaborative solutions, such as the assignment of reserve resources or ATFM slot swapping. The integrated schedule recovery model is an extension of the Resource-Constrained Project Scheduling Problem and integrates aircraft turnaround operations with existing approaches for aircraft, crew and passenger recovery. The model is supposed to provide tactical decision support for airline operations controllers at look-ahead times of more than two hours prior to a scheduled hub bank. System-inherent uncertainties about process deviations and potential future disruptions are incorporated into the optimization via stochastic turnaround process times and the novel concept of stochastic delay cost functions. These functions estimate the costs of delay propagation and derive flight-specific downstream recovery capacities from historical operations data, such that scarce resources at the hub airport can be allocated to the most critical turnarounds. The model is applied to the case study of a network carrier that aims at minimizing its tactical costs from several disturbance scenarios. The case study analysis reveals that optimal recovery solutions are very sensitive to the type, scope and intensity of a disturbance, such that there is neither a general optimal solution for different types of disturbance nor for disturbances of the same kind. Thus, airlines require a flexible and efficient optimization method, which considers the complex interdependencies among their constrained resources and generates context-specific solutions. To determine the efficiency of such an optimization method, its achieved network resilience should be studied in comparison to current procedures over longer periods of operation. For the sample of analysed scenarios in this dissertation, it can be concluded that stand reallocation, ramp direct services, quick-turnaround procedures and flight retiming are very efficient recovery options when only a few flights obtain low and medium delays, i.e., 95% of the season. For disturbances which induce high delay into the entire airline network, a full integration of all considered recovery options is required to achieve a substantial reduction of tactical costs. Thereby, especially arrival and departure slot swapping are valuable options for the airline to redistribute its assigned ATFM delays onto those aircraft that have the least critical constraints in their downstream rotations. The consideration of uncertainties in the downstream airline network reveals that an optimization based on deterministic delay costs may overestimate the tactical costs for the airline. Optimal recovery solutions based on stochastic delay costs differ significantly from the deterministic approach and are observed to result in less passenger rebooking at the hub airport. Furthermore, the proposed schedule recovery model is able to define flight priorities and internal slot values for the airline. Results show that the priorities can be communicated confidentially to ATFM by using the concept of 'Flight Delay Margins', while slot values may support future inter-airline slot trading mechanisms.:1 Introduction 2 Status Quo on Airline Operations Management 3 Schedule Recovery Optimization Approach with Constrained Resources 4 Implementation and Application 5 Case Study Analysis 6 Conclusions

In the last decades, there has been a growing interest towards new use cases in the Internet of Things (IoT) domain, such as extended reality glasses, unmanned aerial vehicles (UAVs), and autonomous driving. The technological advancement observed in such scenarios has also been enabled by the increasing capabilities of small form factor devices. Although such devices allow to achieve remarkable computing performance with relatively low energy consumption, these are often used in contexts in which the trade-offs between power consumption and application performance play a key role (e.g., battery powered systems). Furthermore, if such trade-offs are not carefully set, the performance degradation can lead to system failure. The work proposed in this thesis aims at investigating this type of problems, and to propose a runtime model and controller pair based on the joint optimization of the platform and application parameters to reduce the likelihood of system failure. The proposed architecture is evaluated in a UAV emulated environment, in which the used platform embeds hardware features comparable to the ones of a drone, while the localization and mapping application executed on such device makes use of real-world visual-inertial datasets. The proposed runtime model-controller solution relies on the monitoring of the platform CPU peaks for identifying application failure. It has also been empirically demonstrated that the model-controller can substantially decrease the number of failures and, in specific scenarios, improve localization accuracy and power consumption even compared to the optimal static parameter configurations. Moreover, the solution has been proven to be simple and generalizable in scenarios characterized by different levels of concurrency, and in the datasets tested. / Under de senaste decennierna har det funnits ett växande intresse för nya användningsfall som Extended Reality-glasögon, obemannade flygfarkoster (UAV) och autonom körning. De tekniska framstegen som observerats i sådana scenarier har också möjliggjorts av den ökande kapaciteten hos små formfaktorenheter. Även om sådana enheter gör det möjligt att uppnå anmärkningsvärd datorprestanda med relativt låg energiförbrukning, används dessa ofta i sammanhang där kompromisserna mellan strömförbrukning och applikationsprestanda spelar en nyckelroll (t.ex. batteridrivna system). Dessutom, om sådana avvägningar inte är noggrant inställda, kan prestandaförsämringen leda till systemfel. Arbetet som föreslås i denna avhandling syftar till att undersöka denna typ av problem, och att föreslå en körtid modellstyrenhet baserad på gemensam optimering av plattformen och applikationsparametrar för att minska systemfel. Den föreslagna arkitekturen utvärderas i en UAV-emulerad miljö, där den använda plattformen har hårdvarufunktioner som är motsvarar en drönare, medan lokaliserings- och kartläggningsapplikationen som körs på en sådan enhet använder verkliga visuella tröghetsdatauppsättningar. Den föreslagna runtime-modellstyrningslösningen förlitar sig på övervakning av plattformens CPU-toppar för att identifiera programfel. Det har också visat sig empiriskt att modellstyrenheten avsevärt kan minska antalet fel och, i specifika scenarier, förbättra lokaliseringsnoggrannheten och strömförbrukningen även jämfört med de optimala statiska parameterkonfigurationerna. Dessutom har lösningen visat sig vara enkel och generaliserbar i scenarier som kännetecknas av olika nivåer av samtidighet och i de testade datamängderna.

Résumé indisponible. / In this thesis we have concerned ourselves with university timetabling problems both course timetabling and examination timetabling problems. Most of the timetabling problems are computationally NP-complete problems, which means that the amount of computation required to find solutions increases exponentially with problem size. These are idiosyncratic nature problems, for example different universities have their own set of constraints, their own definition of good timetable, feasible timetable and their own choice about the use of constraint type (as a soft or hard constraint). Unfortunately, it is often the case that a problem solving approach which is successfully applied for one specific problem may not become suitable for others. This is a motivation, we propose a generalized problem which covers many constraints used in different universities or never used in literature. Many university timetabling problems are sub problems of this generalized problem. Our proposed algorithms can solve these sub problems easily, moreover constraints can be used according to the desire of user easily because these constraints can be used as reference to penalty attached with them as well. It means that give more penalty value to hard constraints than soft constraint. Thus more penalty value constraints are dealt as a hard constraint by algorithm. Our algorithms can also solve a problem in two phases with little modification, where in first phase hard constraints are solved. In this work we have preferred and used two phase technique to solve timetabling problems because by using this approach algorithms have broader search space in first phase to satisfy hard constraints while not considering soft constraints at all. Two types of algorithms are used in literature to solve university timetabling problem, exact algorithms and approximation algorithms. Exact algorithms are able to find optimal solution, however in university timetabling problems exact algorithms constitute brute-force style procedures. And because these problems have the exponential growth rates of the search spaces, thus these kinds of algorithms can be applied for small size problems. On the other side, approximation algorithms may construct optimal solution or not but they can produce good practically useable solutions. Thus due to these factors we have proposed approximation algorithms to solve university timetabling problem. We have proposed metaheuristic based techniques to solve timetabling problem, thus we have mostly discussed metaheuristic based algorithms such as evolutionary algorithms, simulated annealing, tabu search, ant colony optimization and honey bee algorithms. These algorithms have been used to solve many other combinatorial optimization problems other than timetabling problem by modifying a general purpose algorithmic framework. We also have presented a bibliography of linear integer programming techniques used to solve timetabling problem because we have formulated linear integer programming formulations for our course and examination timetabling problems. We have proposed two stage algorithms where hard constraints are satisfied in first phase and soft constraints in second phase. The main purpose to use this two stage technique is that in first phase hard constraints satisfaction can use more relax search space because in first phase it does not consider soft constraints. In second phase it tries to satisfy soft constraints when maintaining hard constraints satisfaction which are already done in first phase. (...)