Simulation is a vital tool during development of JAS 39 Gripen, since money and time can be saved. The Auxiliary and Emergency Power System, AEPS, is a subsystem of the secondary power system in Gripen. It has the function of providing the aircraft with electrical and hydraulical power before activation and after deactivation of the main engine. The system also functions as backup in case of a safety critical problem in the main power supply system. The system basically consists of a control unit and an auxiliary gearbox. The gearbox is driven by an air turbine. An auxiliary generator and a hydraulic pump are mounted on the gearbox to provide the aircraft with electrical and hydraulical power. The airflow to the turbine is regulated by an Air Modulating Valve, AMV. This report describes a new model of the AEPS. The model encompasses the logical control unit and a physical description of AMV, air turbine, auxiliary gearbox, auxiliary generator and the auxiliary hydraulic pump. The logical model is connected to the physical model whereby simulation of the whole system is made possible. The model is implemented in Matlab/Simulink. This work provides a complete model of the AEPS which enables simulation of the dynamical processes. Verification was done by comparing simulation results with measurements from the real physical system. Satisfactory results are achieved, especially for inlet pressure for the air turbine and the speed of the auxiliary generator. / Simulering är ett viktigt verktyg under utveckling av JAS 39 Gripen, eftersom detta möjliggör att både pengar och tid kan sparas. Reserv- och nödkraftsystemet Auxiliary and Emergency Power System, AEPS, som är en del av Gripens hjälpkraftsystem, har till uppgift att försörja flygplanet med el- och hydraulkraft före uppstart och efter nedstängning av huvudmotor. Systemet fungerar även som backup vid bortfall av ordinarie kraftförsörjning. Grovt förenklat består systemet av en logisk kontrollenhet och en turbindriven reservväxellåda. På reservväxellådan finns en reservgenerator och en reservhydraulpump för elkraft respektive hydraulkraftförsörjning. Luftflödet till turbinen regleras av en så kallad Air Modulating Valve, AMV. Den här rapporten beskriver en ny modell av AEPS. Modellen omfattar den logiska kontrollenheten och en fysikalisk beskrivning av systemets reglerventil, turbin, växellåda, reservgenerator och reservhydraulpump. Den logiska modellen kopplas samman med den fysikaliska och möjliggör simulering av hela systemet. Implementeringen görs i Matlab/Simulink. Arbetet leder fram till en komplett modell för AEPS där dynamiska förlopp beskrivs. Verifiering görs genom att jämföra simuleringar med mätningar från det fysiska systemet. Tillfredställande resultat uppnås, speciellt för tryck in till turbin och varvtal för reservgenerator.

Am Institut für Print- und Medientechnik an der TU Chemnitz wird ein System entwickelt, welches gescannte Dokumente archivieren soll. Im Gegensatz zu bereits existierenden OCR-Systemen, sollen diese Dokumente hier jedoch nicht mittels einer Schrifterkennung verarbeitet werden. Vielmehr sind Textbereiche in den gescannten Vorlagen zu vektorisieren. Bereiche mit Grafiken und Illustrationen werden bei diesem Verfahren als ein Bildvektor gespeichert. Diese Vorgehensweise soll es ermöglichen, auch Dokumente mit Schriftsymbolen effizient zu archivieren, die keinen "herkömmlichen" Schriftsätzen zugehörig sind. Diese Studienarbeit stellt Merkmalsextraktionsverfahren vor, die aus einem gegebenen Teil (Segment) eines Dokumentenscans Merkmale extrahieren, die es ermöglichen sollen, diesen mittels eines Klassifikationsverfahrens einer Klasse Textblock oder einer Klasse Grafikblock zuzuordnen. Zusätzlich werden zwei Klassifikationsverfahren, ein Entscheidungsbaum und eine Fuzzy-Logik, auf die Nutzbarkeit für einen solchen Mustererkennungsprozess überprüft. Als Textblöcke erkannte Bereiche werden im zu entwickelnden Gesamtverfahren dann in nachfolgenden Verarbeitungsschritten einer Vektorisierung zugeführt.

Zugl.: Passau, Univ., Diss.

Zugl.: Liège, Univ., Diss., 2007

Der Aufsatz zeigt, dass Melanchthons Änderungen an den traditionellen Lehrinhalten der Dialektik (Logik) und der Rhetorik in erster Linie nicht inhaltlich, sondern durch die argumentationstheoretische Neuausrichtung der beiden Disziplinen motiviert ist.

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.

Description logics (DLs) are used to represent knowledge of an application domain and provide standard reasoning services to infer consequences of this knowledge. However, classical DLs are not suited to represent vagueness in the description of the knowledge. We consider a combination of DLs and Fuzzy Logics to address this task. In particular, we consider the t-norm-based semantics for fuzzy DLs introduced by Hájek in 2005. Since then, many tableau algorithms have been developed for reasoning in fuzzy DLs. Another popular approach is to reduce fuzzy ontologies to classical ones and use existing highly optimized classical reasoners to deal with them. However, a systematic study of the computational complexity of the different reasoning problems is so far missing from the literature on fuzzy DLs. Recently, some of the developed tableau algorithms have been shown to be incorrect in the presence of general concept inclusion axioms (GCIs). In some fuzzy DLs, reasoning with GCIs has even turned out to be undecidable. This work provides a rigorous analysis of the boundary between decidable and undecidable reasoning problems in t-norm-based fuzzy DLs, in particular for GCIs. Existing undecidability proofs are extended to cover large classes of fuzzy DLs, and decidability is shown for most of the remaining logics considered here. Additionally, the computational complexity of reasoning in fuzzy DLs with semantics based on finite lattices is analyzed. For most decidability results, tight complexity bounds can be derived.

Die vorliegende Studie untersucht die gesellschaftliche Rolle des gegenwärtigen Mathematikunterrichts an deutschen allgemeinbildenden Schulen aus einer soziologisch-kritischen Perspektive. In Zentrum des Interesses steht die durch den Mathematikunterricht erfahrene Sozialisation. Die Studie umfasst unter anderem eine Literaturdiskussion, die Ausarbeitung eines soziologischen Rahmens auf der Grundlage des Werks von Michel Foucault und zwei Teilstudien zur Soziologie der Logik und des Rechnens. Abschließend werden Dispositive des Mathematischen beschrieben, die darlegen, in welcher Art und mit welcher persönlichen und gesellschaftlichen Folgen der gegenwärtige Mathematikunterricht eine spezielle Geisteshaltung etabliert. / This study examines the social role of contemporary mathematics classes at German schools of general education from a sociological-critical perspective. At the centre of attention is the socialisation experienced by mathematics education. The study includes but is not limited to a discussion of literature, the development of a sociological frame on the basis of the work of Michel Foucault, and two sub-studies on the sociology of logic and calculation. Conclusively, I present dispositives of the mathematical, which show in which way and with which personal and social consequences contemporary mathematics education establish a special mentality.

No description available.

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.