Die Arbeit liefert einen Betrag zur Objektivierung der Bewertung und Auswertung von waffenspezifischen Spuren auf Geschossen. Durch den Vergleich der Spuren können Geschosse den verwendeten Waffen zugeordnet werden. Es wurde ein Algorithmus entwickelt, der die Auswahl der relevanten Spurenbereiche aus großflächigen Bilder ermöglicht. Ein weiterer Algorithmus kann die Spuren automatisiert um den Drallwinkel korrigieren. Zwei bekannte Vergleichsmodelle wurden an den vorliegenden Spuren angewandt. Ein Vergleichsalgorithmus, basierend auf der Fuzzy-Theorie, wurde zum Spurenvergleich entwickelt. Der Vergleich mittels dieses Algorithmus kann eindimensional oder zweidimensional erfolgen. Eine Gegenüberstellung der Vergleichsansätze zeigt, dass ein Spurenvergleich mit dem Fuzzy-Modell, bei welchen nur die Lage der Riefenspuren einfließt, bessere Ergebnisse liefert als die anderen Modelle und so für die Begründung von Untersuchungsergebnissen im Spurenvergleich verwendet werden kann.

Bakgrund och problem: Införandet av New Public Management har lett till förändringar inom hälso- och sjukvården. Förändringar som ska minska sjukvårdens kostnader samtidigt som den ska upprätthålla kvaliteten. Den offentliga sektorn har utmaningar som består av höga sjuktal, önskemål om högre lön och bättre arbetsmiljö. Inom hälso- och sjukvården finns det flera institutionella logiker som formar olika beteenden hos medarbetaren inom organisationen. När dessa möts kan det uppstå motstånd som resulterar i konflikter. Hur stor påverkan institutionella logiker har på medarbetarens dagliga arbete behöver studeras närmare för att på så vis öka kunskapen kring utmaningarna.Syfte: Syftet är att undersöka hur institutionella logiker kan visa sig i organisationen samt hur logiker kan påverka medarbetaren i det dagliga arbetet. Studien avser att ge organisationer inom hälso- och sjukvården en djupare bild över de två idealtyperna managementlogiken och professionslogiken och vilka effekter de kan få på medarbetaren.Metod: Eftersom studiens syfte är att få en insyn i hur medarbetaren påverkas av institutionella logiker baseras studien på kvalitativ metod. För att skapa en djupare bild kring medarbetares uppfattning av sin sociala kontext valdes en fallstudie att genomföras. Studien är baserad på nio stycken kvalitativa intervjuer med informanter som innehar olika professioner inom hälso- och sjukvården.Slutsats: Studien visar att de två idealtyperna av logiker, managementlogiken och professionslogiken existerar i verksamheten där professionslogiken är mest dominant. Den visar även att institutionella logiker påverkar medarbetaren i sitt dagliga arbete. Hur mycket beror på vilken logik medarbetaren identifierar sig med. Det gick även att urskilja att det existerar flera professionslogiker i verksamheten, vilket leder till spänningar mellan olika professionsgrupper. / Background and problem: The introduction of New Public Management has led to changes in healthcare. Changes in purpose to reduce healthcare costs while maintaining quality. However, on the contrary, this has resulted in challenges that consist of high rates of illness, a desire for higher wages and a better working environment. Within the healthcare organization, there are several institutional logics that shape different behaviors of employees within the organization. When they meet, resistance can result in conflicts. How much the impact of institutional logics has on the employee's daily work needs to be studied more closely in order to increase knowledge about the challenges.Purpose: The purpose is to investigate how institutional logics can manifest themselves in the organization as well as influence the employee in daily work. The study intends to give healthcare organizations a deeper picture of the two ideal types, management logic and professional logic and what effects they can have on the employee.Method: Since the purpose of the study is to gain an insight into how the employee is affected by institutional logic, the study is based on a qualitative method. In order to create a deeper understanding of employees' perceptions of their social context, a case study was chosen to be conducted. The study is based on nine qualitative interviews with informants who hold various healthcare professions.Conclusion: The study shows that the two ideal types of logics, management logic and professional logic exist in the business where professional logic is most dominant. It also shows that institutional logics influence the employee in their daily work. How much depends on which logic the employee identifies with. It was also possible to distinguish that there are several professional logics in the business, which leads to tensions between different professional groups.

Noncommutative geometry has over the past four of decades grown into a rich field of study. Novel ideas and concepts are rapidly being developed, and a notable application of the theory outside of pure mathematics is quantum theory. This thesis will focus on a derivation-based approach to noncommutative geometry using the framework of real calculi, which is a rather direct approach to the subject. Due to their direct nature, real calculi are useful when studying classical concepts in Riemannian geometry and how they may be generalized to a noncommutative setting. This thesis aims to shed light on algebraic aspects of real calculi by introducing a concept of morphisms of real calculi, which enables the study of real calculi on a structural level. In particular, real calculi over matrix algebras are discussed both from an algebraic and a geometric perspective.Morphisms are also interpreted geometrically, giving a way to develop a noncommutative theory of embeddings. As an example, the noncommutative torus is minimally embedded into the noncommutative 3-sphere. / Ickekommutativ geometri har under de senaste fyra decennierna blivit ett etablerat forskningsområde inom matematiken. Nya idéer och koncept utvecklas i snabb takt, och en viktig fysikalisk tillämpning av teorin är inom kvantteorin. Denna avhandling kommer att fokusera på ett derivationsbaserat tillvägagångssätt inom ickekommutativ geometri där ramverket real calculi används, vilket är ett relativt direkt sätt att studera ämnet på. Eftersom analogin mellan real calculi och klassisk Riemanngeometri är intuitivt klar så är real calculi användbara när man undersöker hur klassiska koncept inom Riemanngeometri kan generaliseras till en ickekommutativ kontext. Denna avhandling ämnar att klargöra vissa algebraiska aspekter av real calculi genom att introducera morfismer för dessa, vilket möjliggör studiet av real calculi på en strukturell nivå. I synnerhet diskuteras real calculi över matrisalgebror från både ett algebraiskt och ett geometriskt perspektiv. Morfismer tolkas även geometriskt, vilket leder till en ickekommutativ teori för inbäddningar. Som ett exempel blir den ickekommutativa torusen minimalt inbäddad i den ickekommutativa 3-sfären.

The study of nonmonotonic logics is one mayor field of Artificial Intelligence (AI). The reason why such kind of formalisms are so attractive to model human reasoning is that they allow to withdraw former conclusion. At the end of the 1980s the novel idea of using argumentation to model nonmonotonic reasoning emerged in AI. Nowadays argumentation theory is a vibrant research area in AI, covering aspects of knowledge representation, multi-agent systems, and also philosophical questions. Phan Minh Dung’s abstract argumentation frameworks (AFs) play a dominant role in the field of argumentation. In AFs arguments and attacks between them are treated as primitives, i.e. the internal structure of arguments is not considered. The major focus is on resolving conflicts. To this end a variety of semantics have been defined, each of them specifying acceptable sets of arguments, so-called extensions, in a particular way. Although, Dung-style AFs are among the simplest argumentation systems one can think of, this approach is still powerful. It can be seen as a general theory capturing several nonmonotonic formalisms as well as a tool for solving well-known problems as the stable-marriage problem. This thesis is mainly concerned with the investigation of metalogical properties of Dung’s abstract theory. In particular, we provide cardinality, monotonicity and splitting results as well as characterization theorems for equivalence notions. The established results have theoretical and practical gains. On the one hand, they yield deeper theoretical insights into how this nonmonotonic theory works, and on the other the obtained results can be used to refine existing algorithms or even give rise to new computational procedures. A further main part is the study of problems regarding dynamic aspects of abstract argumentation. Most noteworthy we solve the so-called enforcing and the more general minimal change problem for a huge number of semantics.

Deligne and Howe described polarized abelian varieties over finite fields in terms of finitely generated free Z-modules satisfying a list of easy to state axioms. In this thesis we address the problem of developing an effective algorithm to compute isomorphism classes of (principally) polarized abelian varieties over a finite field, together with their automorphism groups. Performing such computations requires the knowledge of the ideal classes (both invertible and non-invertible) of certain orders in number fields. Hence we describe a method to compute the ideal class monoid of an order and we produce concrete computations in dimension 2, 3 and 4.

Inspired by the idea of vision zero, there is a lot of work that needs to be done in the field of advance driver assistance systems to develop more safer systems. Driver intention detection with a prediction of upcoming behavior of the driver is one possible solution to reduce the fatalities in road traffic. Driver intention detection provides an early warning of the driver's behavior to an Advanced Driver Assistance Systems (ADAS) and at the same time reduces the risk of non-essential warnings. This will significantly reduce the problem of warning dilemma and the system will become more safer. A driving maneuver prediction can be regarded as an implementation of driver's behavior. So the aim of this thesis is to determine the driver's intention by early prediction of a driving maneuver using Controller Area Network (CAN) bus data. The focus of this thesis is to optimize and further develop an algorithm for driver intention detection with fuzzy logic and edit distance method. At first the basics concerning driver's intention detection are described as there exists different ways to determine it. This work basically uses CAN bus data to determine a driver's intention. The algorithm overview with the design parameters are described next to have an idea about the functioning of the algorithm. Then different implementation tasks are explained for optimization and further development of the algorithm. The main aim to execute these implementation tasks is to improve the overall performance of the algorithm concerning True Positive Rate (TPR), False Positive Rate (FPR) and earliness values. At the end, the results are validated to check the algorithm performance with different possibilities and a test drive is performed to evaluate the real time capability of the algorithm. Lastly the use of driver intention detection algorithm for an ADAS to make it more safer is described in details. The early warning information can be feed to an ADAS, for example, an automatic collision avoidance or a lane change assistance ADAS to further improve safety for these systems.

In 1994, Alur and Dill introduced timed automata as a simple mathematical model for modelling the behaviour of real-time systems. In this thesis, we extend timed automata with weights. More detailed, we equip both the states and transitions of a timed automaton with weights taken from an appropriate mathematical structure. The weight of a transition determines the weight for taking this transition, and the weight of a state determines the weight for letting time elapse in this state. Since the weight for staying in a state depends on time, this model, called weighted timed automata, has many interesting applications, for instance, in operations research and scheduling. We give characterizations for the behaviours of weighted timed automata in terms of rational expressions and logical formulas. These formalisms are useful for the specification of real-time systems with continuous resource consumption. We further investigate the relation between the behaviours of weighted timed automata and timed automata. Finally, we present important decidability results for weighted timed automata.

In this work, we are interested in expressing and studying certain formal properties of multi-agent games. In particular, we are interested in the case in which a team of agents with imperfect information is playing against the environment. This is modeled by a non-deterministic game, where the agents can only partially distinguish its states, to varying degrees. We will study these games under the lens of the multi-agent knowledge-based subset construction (MKBSC), which, when applied to a game, reduces the degree of imperfect information the agents have. An appropriate language to express interesting and complex properties in these type of games is the epistemic μ-calculus, an extension of classicepistemic logic with a recursive operator. We define two semantics forthis language, one corresponding to a global view of the game, and onecorresponding to a local one. We state a claim relating these two semantics,while proving an analogous statement for epistemic logic. / I detta arbete är vi intresserade av att uttrycka och studera vissa formellaegenskaper hos spel med flera agenter. Särskilt intresserade är vi av falletdär ett lag av agenter med ofullständig information samarbetar mot miljön.Detta modelleras av ett icke-deterministiskt spel, där agenterna endast delviskan särskilja dess tillstånd, i varierande grad. Vi kommer att studera dessa isammanhanget av den kunskapsbaserade multiagent-konstruktionen (MKBSC),som när den tillämpas på ett spel minskar graden av ofullständig informationagenterna har.Ett lämpligt språk för att uttrycka intressanta och komplexa egenskaper idenna typ av spel är den epistemiska μ-kalkylen, en utvidgning av klassiskepistemisk logik genom en rekursiv operator. Vi definierar två semantikerför detta språk, ett som motsvarar ett globalt perspektiv på spelet, och ettmotsvarande ett lokalt perspektiv. Vi formulerar ett påstående som rör dessatvå semantiker för μ-kalkylen, och bevisar ett analogt påstående för epistemisklogik.

Inom linja ̈r algebra har varje vektorrum ett s ̊a kallat dualrum, vilket är ett vektorrum bestående av alla linjära funktioner från det ursprungliga rummet till sin kropp. Att beräkna dimensionen av ett dualrum tillhörande ett ändlig-dimensionellt vektorrum är relativt enkelt, för oändlig-dimensionella vektorrum är det mer komplicerat. Den sats vi ska diskutera, Erdős–Kaplansky Satsen, ämnar lösa den frågan med påståendet att ett dualrum tillhörande ett oändlig-dimensionellt vektorrum har dimension lika med sin kardinalitet.

Despite great progress of lab-on-a-chip (LoC) technology platforms in the last 30 years, there is a lack of standardized microfluidic components, real on-chip utomation and progressive functional scalability of the fluidic circuits. Hydrogel-based microfluidic circuits have a high scaling potential and provide on-chip automation, but are complex in system design. An advanced circuit concept for planar microfluidic chip architectures, originating from the early era of the semiconductor-based resistor-transistor-logic (RTL) is presented and the hydrogel-based chemical volume phase transition transistor (CVPT) for logic gate operations is implemented. The circuit concept (CVPT-RTL) is robust and simple in design, feasible with common materials and manufacturing techniques of the LoC technology. Thereby, three major challenges are solved: contamination issues, maintaining the signal compliance for cascadability, and chemical signal inversion. As a central element, a CVPT cascode is introduced. The functionality of the concept is verified by a 24 h test of the NAND gate operation and a self-automated chemofluidic analog-to-digital converter, utilized as interface between bioreactors and extended microfluidic logic circuits. Moreover, the CVPT-RTL cascode demonstrates the expected selfstabilizing performance of the NAND gate. Accompanying simulations of the component behavior based on a network description implemented in Matlab Simscape match with the experimental results.