Die Sicherheit und Zuverlässigkeit von Anwendungen, welche schutzwürdige Daten verarbeiten, lässt sich durch die geschützte Verlagerung in die Cloud mit einer Kombination aus zielgrößenabhängiger Datenkodierung, kontinuierlicher mehrfacher Dienstauswahl, dienstabhängiger optimierter Datenverteilung und kodierungsabhängiger Algorithmen deutlich erhöhen und anwenderseitig kontrollieren. Die Kombination der Verfahren zu einer anwendungsintegrierten Stealth-Schutzschicht ist eine notwendige Grundlage für die Konstruktion sicherer Anwendungen mit zusicherbaren Sicherheitseigenschaften im Rahmen eines darauf angepassten Softwareentwicklungsprozesses. / The security and reliability of applications processing sensitive data can be significantly increased and controlled by the user by a combination of techniques. These encompass a targeted data coding, continuous multiple service selection, service-specific optimal data distribution and coding-specific algorithms. The combination of the techniques towards an application-integrated stealth protection layer is a necessary precondition for the construction of safe applications with guaranteeable safety properties in the context of a custom software development process.

Thesis (PhD)--Stellenbosch University, 2014. / ENGLISH ABSTRACT: The domination number of a graph is the cardinality of a smallest subset of its vertex set with the property that each vertex of the graph is in the subset or adjacent to a vertex in the subset. This graph parameter has been studied extensively since its introduction during the early 1960s and finds application in the generic setting where the vertices of the graph denote physical entities that are typically geographically dispersed and have to be monitored efficiently, while the graph edges model links between these entities which enable guards, stationed at the vertices, to monitor adjacent entities. In the above application, the guards remain stationary at the entities. In 2005, this constraint was, however, relaxed by the introduction of a new domination-related parameter, called the secure domination number. In this relaxed, dynamic setting, each unoccupied entity is defended by a guard stationed at an adjacent entity who can travel along an edge to the unoccupied entity in order to resolve a security threat that may occur there, after which the resulting configuration of guards at the entities is again required to be a dominating set of the graph. The secure domination number of a graph is the smallest number of guards that can be placed on its vertices so as to satisfy these requirements. In this generalised setting, the notion of edge removal is important, because one might seek the cost, in terms of the additional number of guards required, of protecting the complex of entities modelled by the graph if a number of edges in the graph were to fail (i.e. a number of links were to be eliminated form the complex, thereby disqualifying guards from moving along such disabled links). A comprehensive survey of the literature on secure graph domination is conducted in this dissertation. Descriptions of related, generalised graph protection parameters are also given. The classes of graphs with secure domination number 1, 2 or 3 are characterised and a result on the number of defenders in any minimum secure dominating set of a graph without end-vertices is presented, after which it is shown that the decision problem associated with computing the secure domination number of an arbitrary graph is NP-complete. Two exponential-time algorithms and a binary programming problem formulation are presented for computing the secure domination number of an arbitrary graph, while a linear algorithm is put forward for computing the secure domination number of an arbitrary tree. The practical efficiencies of these algorithms are compared in the context of small graphs. The smallest and largest increase in the secure domination number of a graph are also considered when a fixed number of edges are removed from the graph. Two novel cost functions are introduced for this purpose. General bounds on these two cost functions are established, and exact values of or tighter bounds on the cost functions are determined for various infinite classes of special graphs. Threshold information is finally established in respect of the number of possible edge removals from a graph before increasing its secure domination number. The notions of criticality and stability are introduced and studied in this respect, focussing on the smallest number of arbitrary edges whose deletion necessarily increases the secure domination number of the resulting graph, and the largest number of arbitrary edges whose deletion necessarily does not increase the secure domination number of the resulting graph. / AFRIKAANSE OPSOMMING: Die dominasiegetal van ’n grafiek is die kardinaalgetal van ’n kleinste deelversameling van die grafiek se puntversameling met die eienskap dat elke punt van die grafiek in die deelversameling is of naasliggend is aan ’n punt in die deelversameling. Hierdie grafiekparameter is sedert die vroeë 1960s uitvoerig bestudeer en vind toepassing in die generiese situasie waar die punte van die grafiek fisiese entiteite voorstel wat tipies geografies verspreid is en doeltreffend gemonitor moet word, terwyl die lyne van die grafiek skakels tussen hierdie entiteite voorstel waarlangs wagte, wat by die entiteite gebaseer is, naasliggende entiteite kan monitor. In die bogenoemde toepassing, bly die wagte bewegingloos by die fisiese entiteite waar hulle geplaas word. In 2005 is hierdie beperking egter verslap met die daarstelling van ’n nuwe dominasie-verwante grafiekparameter, bekend as die sekure dominasiegetal. In hierdie verslapte, dinamiese situasie word elke punt sonder ’n wag deur ’n wag verdedig wat by ’n naasliggende punt geplaas is en wat langs die verbindingslyn na die leë punt kan beweeg om daar ’n bedreiging te neutraliseer, waarna die gevolglike plasing van wagte weer ’n dominasieversameling van die grafiek moet vorm. Die sekure dominasiegetal van ’n grafiek is die kleinste getal wagte wat op die punte van die grafiek geplaas kan word om aan hierdie vereistes te voldoen. Die beginsel van lynverwydering speel ’n belangrike rol in hierdie veralgemeende situasie, omdat daar gevra mag word na die koste, in terme van die addisionele getal wagte wat vereis word, om die kompleks van entiteite wat deur die grafiek gemodelleer word, te beveilig indien ’n aantal lynfalings in die grafiek plaasvind (m.a.w. indien ’n aantal skakels uit die kompleks van entiteite verwyder word, en wagte dus nie meer langs sulke skakels mag beweeg nie). ’n Omvattende literatuurstudie oor sekure dominasie van grafieke word in hierdie verhandeling gedoen. Beskrywings van verwante, veralgemeende verdedigingsparameters in grafiekteorie word ook gegee. Die klasse van grafieke met sekure dominasiegetal 1, 2 of 3 word gekarakteriseer en ’n resultaat oor die getal verdedigers in enige kleinste sekure dominasieversameling van ’n grafiek sonder endpunte word daargestel, waarna daar getoon word dat die beslissingsprobleem onderliggend aan die berekening van die sekure dominasiegetal van ’n arbitrêre grafiek NP- volledig is. Twee eksponensiële-tyd algoritmes en ’n binêre programmeringsformulering word vir die bepaling van die sekure dominasiegetal van ’n arbitrêre grafiek daargestel, terwyl ’n lineêre algoritme vir die berekening van die sekure dominasiegetal van ’n arbitrêre boom ontwerp word. Die praktiese doeltreffendhede van hierdie algoritmes word vir klein grafieke met mekaar vergelyk. Die kleinste en groostste toename in die sekure dominasiegetal van ’n grafiek word ook oorweeg wanneer ’n vaste getal lyne uit die grafiek verwyder word. Twee nuwe kostefunksies word vir hierdie doel daargestel en algemene grense word op hierdie kostefunksies vir arbitrêre grafieke bepaal, terwyl eksakte waardes van of verbeterde grense op hierdie kostefunksies vir verskeie oneindige klasse van spesiale grafieke bereken word. Drempelinligting word uiteindelik bepaal in terme van die moontlike getal lynverwyderings uit ’n grafiek voordat die sekure dominasiegetal daarvan toeneem. Die konsepte van kritiekheid en stabiliteit word in hierdie konteks bestudeer, met ’n fokus op die kleinste getal arbitrêre lynfalings wat noodwendig die sekure dominasiegetal van die gevolglike grafiek laat toeneem, of die grootste getal arbitrêre lynfalings wat noodwendig die sekure dominasiegetal van die gevolglike grafiek onveranderd laat.

<p>Companies learn through their employees. In this paper I make research into how knowledge transfer and learning occur at Metso Paper Karlstad AB, which is a partly project based organization.</p><p>The result is that there are many factors that affect the knowledge transfer in a company. Knowledge transfer occurs mainly between individuals within the company, but also between departments and other actors outside the company. In the gaps between these actors, there is a risk that knowledge is not transferred, which is an obstacle to learning. A great deal of the knowledge transfer and the learning is carried out through individual’s own drive and motivation. I have found that individuals have different motives for transferring or not transferring knowledge. There are types of individuals that understand and act in the interest of the company but also those who act in their own interest, such as power or career. The willingness to transfer knowledge is also affected by the feeling of being secure, both as an individual but also in the employment. These aspects are presented in a model in the paper. There are also individuals that have resigned and do not have a specific interest neither for the company nor their own career, which is a more passive attitude. A mapping of these different types of individuals can help the company to choose the correct actions to be made, in purpose to increase the knowledge transfer. Some general activities that affect knowledge transfer are the understanding of the management of the importance of transferring knowledge and to work in long-term. It is important that the employees understand their role in the total process of the company, and also their role as bearer of knowledge. Increased interactions between departments and internal training sessions based on real competence gaps will most likely stimulate the transferring between departments.</p> / <p>Företag lär genom sina medarbetare. Med denna uppsats vill jag undersöka hur kunskapsöverföring och lärande sker hos Metso Paper Karlstad AB, en organisation med delvis projektbaserat arbetssätt.</p><p>Resultatet av undersökningen är att det finns många faktorer som påverkar kunskapsöverföringen inom företag. Kunskapsöverföring sker mellan individer, mellan avdelningar och mellan övriga aktörer. I ”glappen” mellan alla dessa aktörer föreligger risk att kunskap inte överförs vilket således är hinder för lärande. Mycket av kunskapsöverföringen och lärandet sker idag utifrån individers egen drivkraft och motivation. Jag funnit att individer har olika motiv för att överföra kunskap eller att inte överföra. Det finns individer som förstår och agerar för företagets bästa men även de som agerar utifrån sina egna syften, vilket kan vara makt och karriär. Viljan att överföra kunskap påverkas även av hur trygg eller otrygg man känner sig i sin yrkesroll och i sin anställning. Därutöver tillkommer de individer som resignerat och inte intresserar sig vare sig för företagets bästa eller för egen vinning, de har en mera passiv hållning. Dessa faktorer presenteras i en modell i uppsatsen. En kartläggning av omfattningen av dessa olika typer av individer kan hjälpa företaget att välja rätt insatser för att öka kunskapsöverföringen. Några generella aktiviteter som påverkar kunskapsöverföring inom företag är ledningens förståelse av betydelsen att överföra kunskap och långsiktighet i arbetet. Det är även viktigt att medarbetarna förstår sin roll i företagets process men även sin roll som bärare av kunskap. Ökad interaktion mellan avdelningar och behovsanpassade interna utbildningar stimulerar sannolikt kunskapsöverföring mellan avdelningar.</p>

安全多方計算是資訊安全研究裡的一個重要主題，其概念為多方在不洩漏各自私有資訊下能一起完成某種函式的計算。在安全多方計算研究領域裡，有一種作法是以scalar product來當作計算的基礎演算邏輯單元，重而建構其他更複雜的安全多方計算。本論文首先針對scalar product發展一套平行性實作架構，藉此我們再實作出多個不同演算法之comparison計算，其中包含了循序演算法以及平行演算法。我們透過實驗來找出適當的平行計算基礎架構與影響執行時間效能的主要因子，並以執行時間效能上的分析來推導相關時間公式。由上述實證研究我們對於不同演算法之comparison計算來作執行時間效能的預測，從實驗結果可以得知我們推導出來之時間公式極為準確，希望能給予使用者在執行comparison計算有所考量，使其在不同執行環境執行comparison計算能有最佳的執行時間效能。 / Loosely speaking, secure multi-party computation (SMC) involves computing functions with inputs from two or more parties in a distributed network while ensuring that no additional information, other than what can be inferred from each participant’s input and output, is revealed to parties not privy to that information. This thesis concerns the parallel implementation of SMC using a scalar-product (SP) based approach. In this approach, SP is considered as the basic building block for constructing more complex SMC. My thesis first develops a concurrent architecture for implementing two-party scalar product computation. Then it implements several algorithms of secure comparison. Finally, a series of experiments are conducted to collect performance statistics for building time functions that can predict the execution time of comparison computation based on that of the scalar product and other parameters, such as CPU core numbers. From the experimental results, we find that these time functions are very accurate. Hence we argue that these time functions can assist users to obtain the better runtime performance for comparison protocols under their specific execution environments.

Approved for public release, distribution is unlimited / A thorough examination of the Secure Application Integration Methodology (SAIM) for applicability in the Department of the Navy (DON) would provide useful information about a beneficial methodology. SAIM is analyzed, by accessing its step by step directions, for suitability in the integration of the Enterprise Resource Planning (ERP) projects implemented by the SYSTEMS COMMANDS (SYSCOMS). The Navy Enterprise Convergence Team (NECT) that leads the ERP integration effort could benefit from a sound Enterprise Application Integration methodology. Results do not support SAIM as the sole guiding EAI methodology however it could have some value to the NECT. SAIM has three primary benefits which NECT could employ: 1) It provides a complete walkthrough of the EAI process, 2) It emphasizes the importance of an Enterprise Architecture, and 3) It provides useful management checklists along with other important considerations. SAIM also has some significant shortcomings: 1) It does not support all the DON Chief Information Officer requirements, 2) It does not provide Change Management Guidance, 3) It does not take into account the uniqueness of the Navy's environment, and finally 4) SAIM relies on an Enterprise Architecture as its foundation which the Navy does not currently have. / Lieutenant Commander, United States Navy

近年來手機的普及率日漸增加，手機逐漸成為生活中不可或缺的工具，因此許多生活方式逐漸的偏向由手機端完成，例如:找路不需要再透過地圖,上網查資料不需要再透過電腦，人們逐漸地把實體錢包轉向利用手機支付的電子錢包，像是中國支付寶等支付系統。利用手機當作錢包已經是現今手機發展的主要方向，然而對於手機的安全支付議題也日漸重視，近年來有安全晶片的保護下使用者的手機安全也有一定程度的提升，但是在離線交易的情況下惡意使用者的操作依然是可以欺騙安全晶片並製造出雙重支付的問題。 2016年陳等人提出了一個基於NFC系統的匿名行動付款協定，然而該協定中必須要有銀行端的介入才能執行交易。在本論文中，我們基於陳等人的線上交易協定為基礎下發展了本篇論文的新交易協定，此交易協定可以適用於離線以及線上的環境。 離線環境下的雙重支付行為一直交易的過程中難以預防的攻擊，在本篇論文中我們透過安全晶片、符號化和本論文研究的雜湊鍊來預防雙重支付行為，且能保障使用者在交易過程中的匿名性。 / As the coverage of mobile phone has been constantly increased in recent years, the mobile phones have become an indispensable tool in life. Many ways of lives are gradually done through the mobile terminals, for example: No longer need to find the way through the map or search information through the computer, people have also gradually turned to electronic payment via e-wallets instead of paying via physical wallets, such as AliPay in China. Adopting the mobile phone as a wallet is nowadays the main development direction of mobile phones. Meanwhile, people are paying more and more attention to the topics on the security of mobile payment than before. In recent years, under the protection of secure element, the security of users’ mobile phone has been enhanced to a certain extent. In the case of off-line transactions, malicious users are capable of fooling secure element and making double spending. In 2016, Chen et al. proposed a NFC-Based anonymous mobile payment protocol. In that protocol the transaction can only be executed with the involvement of issuer. In this research, we introduce a new protocol which can support both on-line and off-line transactions. Our protocol is modified from that of Chen et al.’s idea. In our protocol, to prevent a malicious user, we use a secure element which stores sensitive information that cannot be altered by the user. In this way, the cheating behavior of a malicious user can be prevented. On the other hand, by using the token techniques, the anonymity of a user can be achieved from the view of a merchant. In this study, we focus on double spending which can make merchant a lot of cost at off-line transaction. We used hash chain to verify the correctness of transactions and prevent the double spending.

M’interrogeant sur l’inflation du mot « médiation », j’ai passé en revue quelques unes des pratiques les plus courantes invoquant un terme dont j’ai pu en constater, dans certains cas, l’usage abusif. À partir de là, j’ai tenté de tracer les contours d’un concept en mal de définition. J’ai ainsi dégagé deux caractéristiques intrinsèques de la médiation, à savoir la triangularité et la non-directivité ainsi que ses deux prérequis que sont le libre consentement des participants et la légitimation du médiateur. Par ailleurs, j’ai constaté que la médiation ne s’appliquait pas qu’aux situations conflictuelles et que son enjeu n’était pas exclusivement affectif. Il peut être également matériel, donnant alors lieu à une médiation de type « négociatif ». En croisant ces deux variables, j’ai proposé une typologie des pratiques de médiation. Dans une seconde partie de ma thèse, je me suis livré à une analyse phénoménologique de la médiation, me servant de l’enregistrement de jeux de rôles. Cette analyse m’a conduit à élargir mon champ de vision, d’une «médiation» comprise comme « action du médiateur » à une réalité plus complexe que j’ai appelée « situation médiative » où le médiateur agit autant sur les participants qu’il est agi par eux. Cette situation, loin de se réduire à une pratique instituée, constitue un véritable phénomène social, fréquent dans la vie courante. La confiance que les participants accordent au médiateur, le rôle qu’ils lui font jouer en tant que « base de sécurité » comme alternative au face à face et sa fonction d’étayage de la communication constituent des conditions essentielles de la situation médiative avant même les techniques de médiation. / Wondering about the increasing use of the word « mediation », I reviewed some of the most common practices referring to this word which was, in some cases, misused. On this basis, I strived to draw the outline of a concept in need of definition. In doing so, I identified two characteristics of mediation, namely the triangularity and the non-directivity, as well as its two prerequisites, i.e. the consent of the participants and the recognition of the mediator. Moreover, I noted that mediation does not apply only to situations of conflict and that its stake is not exclusively emotional. It could be material, leading to a negotiating mediation. Crossing these two variables, I then propose a typology of mediation practices. In a second part of my thesis, I set up a phenomenological analysis of mediation, using video recordings of role playing. This analysis led me to broaden my own perspective, from a mediation as « mediator’s action » to a more complex scenario that I called « mediative situation », where the mediator influences the participants and is in turn influenced by them. This situation, far from being restricted to an established practice, is indeed a social and frequent phenomenon. The confidence the participants have in the mediator, the role they give him/her as a “secure base” and as an alternative to the face to face situation, and his function in supporting communication, lay the basic condition of the mediative situation, a long way ahead of mediations techniques.

In my diploma thesis I am examining the importance of community circles and morning letters in primary education. I would like to give an explanation of the term community circle especially focusing on the community circles in the programme Step by Step. These were particularly inspiring for me. I am also looking into the community circles from the point of view of the Framework Educational Programme and acquiring key competencies. It is, indeed, in the community circles that the social and communication competencies are developed. The goal of my thesis is above all stating the terms of smooth establishment of a community circle. I hope to offer guidelines for a start-up of community circles and the development of short activities used in morning circles. I also suggest examples of various morning letters useful in any school. Keywords: community circles, morning letter, key competencies, Step by Step program, rules, communication, secure environment

This dissertation investigates the application of computational intelligence methods in the analysis of nonlinear chaotic systems in the framework of many known and newly designed complex systems. Parallel comparisons are made between these methods. This provides insight into the difficult challenges facing nonlinear systems characterization and aids in developing a generalized algorithm in computing algorithmic complexity measures, Lyapunov exponents, information dimension and topological entropy. These metrics are implemented to characterize the dynamic patterns of discrete and continuous systems. These metrics make it possible to distinguish order from disorder in these systems. Steps required for computing Lyapunov exponents with a reorthonormalization method and a group theory approach are formalized. Procedures for implementing computational algorithms are designed and numerical results for each system are presented. The advance-time sampling technique is designed to overcome the scarcity of phase space samples and the buffer overflow problem in algorithmic complexity measure estimation in slow dynamics feedback-controlled systems. It is proved analytically and tested numerically that for a quasiperiodic system like a Fibonacci map, complexity grows logarithmically with the evolutionary length of the data block. It is concluded that a normalized algorithmic complexity measure can be used as a system classifier. This quantity turns out to be one for random sequences and a non-zero value less than one for chaotic sequences. For periodic and quasi-periodic responses, as data strings grow their normalized complexity approaches zero, while a faster deceasing rate is observed for periodic responses. Algorithmic complexity analysis is performed on a class of certain rate convolutional encoders. The degree of diffusion in random-like patterns is measured. Simulation evidence indicates that algorithmic complexity associated with a particular class of 1/n-rate code increases with the increase of the encoder constraint length. This occurs in parallel with the increase of error correcting capacity of the decoder. Comparing groups of rate-1/n convolutional encoders, it is observed that as the encoder rate decreases from 1/2 to 1/7, the encoded data sequence manifests smaller algorithmic complexity with a larger free distance value.

Syftet med studien var att bidra till en djupare förståelse över hur organisationer arbetar med att kompetenssäkra verksamheten och hantera kunskapsförlust till följd av personalomsättning. Den här undersökningen utgörs av en fallstudie av Uppsala kommun och Svea Hovrätt och har en kvalitativ ansats. Det empiriska materialet har samlats in genom semistrukturerade intervjuer med sju respondenter. Studiens teoretiska ramverk vilar på Nonaka och Konnos uppdelning av kunskapsbegreppet i implicit respektive explicit kunskap. Hansen, Nohria och Tierneys begrepp kodifiering och personalisering om överföring och bevarande av kunskap samt Hansson respektive Lindelöws olika modeller över kompetensutveckling och behållande av personal. Studiens resultat visar att det effektivaste sättet att behålla kunskap och kompetens inom organisationen är genom att behålla personalen. Arbetet med att behålla personal inkluderar lönesättning, att organisationen erbjuder utvecklingsmöjligheter och andra hygienfaktorer som anställningstrygghet. Resultatet visar att kompetensutveckling fyller flera syften, både som ett sätt att se till att rätt kompetens finns inom organisationen, men också som ett sätt för att personalen ska trivas och vilja arbeta kvar. Arbetet med kompetensutveckling innehåller delar som introduktionskurser, medarbetarsamtal, seminarier och utbildningar samt uppföljning. Ytterligare ett sätt att kompetenssäkra verksamheten är att bevara den kunskap som finns inom organisation genom kodifiering och personalisering. Det framkommer i studien att det svåra är att dela och behålla implicit kunskap som bygger på erfarenhet när en medarbetare lämnar organisationen. / The purpose of the study was to contribute to a deeper understanding of how organizations work to secure the competence and handle knowledge loss as a result of staff turnover. This study consists of a case study of Uppsala kommun and Svea Hovrätt and has a qualitative approach. The empirical material has been collected through semi-structured interviews with seven respondents. The study's theoretical framework rests upon Nonaka and Konno's breakdown of the concept of knowledge in implicit and explicit knowledge. Hansen, Nohria and Tierneys concepts of codification and personalization on transfer and preservation of knowledge, as well as Hansson and Lindelöw's both models of competence development and retention of staff. The study's results show that the most effective way of retaining knowledge and competence within the organization is by retaining the staff. The work of retaining staff includes wage setting, that the organization offers development opportunities and other hygiene factors such as job security. The result shows that competence development fulfills several purposes, both as a way of ensuring that the right skills are within the organization, but also as a way for the staff to feel comfortable and want to work. The work on competence development includes parts such as introductory courses, staff appraisals, seminars and training courses and follow-up. Another way to secure the competence is to preserve the knowledge that exists within the organization through codification and personalization. It appears from the study that the difficult thing is to share and maintain implicit knowledge based on experience when an employee leaves the organization.