• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 38
  • 8
  • 7
  • 5
  • 4
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 80
  • 34
  • 16
  • 12
  • 10
  • 9
  • 9
  • 9
  • 9
  • 9
  • 7
  • 7
  • 7
  • 6
  • 6
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Nondeterminism and Language Design in Deep Inference

Kahramanogullari, Ozan 13 April 2007 (has links) (PDF)
This thesis studies the design of deep-inference deductive systems. In the systems with deep inference, in contrast to traditional proof-theoretic systems, inference rules can be applied at any depth inside logical expressions. Deep applicability of inference rules provides a rich combinatorial analysis of proofs. Deep inference also makes it possible to design deductive systems that are tailored for computer science applications and otherwise provably not expressible. By applying the inference rules deeply, logical expressions can be manipulated starting from their sub-expressions. This way, we can simulate analytic proofs in traditional deductive formalisms. Furthermore, we can also construct much shorter analytic proofs than in these other formalisms. However, deep applicability of inference rules causes much greater nondeterminism in proof construction. This thesis attacks the problem of dealing with nondeterminism in proof search while preserving the shorter proofs that are available thanks to deep inference. By redesigning the deep inference deductive systems, some redundant applications of the inference rules are prevented. By introducing a new technique which reduces nondeterminism, it becomes possible to obtain a more immediate access to shorter proofs, without breaking certain proof theoretical properties such as cutelimination. Different implementations presented in this thesis allow to perform experiments on the techniques that we developed and observe the performance improvements. Within a computation-as-proof-search perspective, we use deepinference deductive systems to develop a common proof-theoretic language to the two fields of planning and concurrency.
52

Preisrisikomanagement im liberalisierten deutschen Strommarkt

Borgmann, Eberhard 15 July 2009 (has links) (PDF)
Die Entwicklung liberalisierter Strommärkte bis hin zum Handel an Kassa- und Terminbörsen wird anhand der Beispiele der USA, Skandinaviens und Deutschlands dargestellt. Wesentliche Merkmale ausländischer Strommärkte lassen sich auf den seit 1998 liberalisierten deutschen Markt übertragen. Kern der Arbeit ist die Gestaltung eines Preisrisikomanagementkonzeptes für den Strommarkt. In diesem Zusammenhang wird der Cost-of-Carry-Ansatz zur Bewertung von Warentermingeschäften um eine Komponente des thermischen Wirkungsgrades von fossilen Kraftwerken ergänzt und somit eine Übertragbarkeit des Konzeptes auf den Strombereich vorgeschlagen. Da die Kenntnisse der Preisprozesse für das Risikomanagement im Strombereich unverzichtbar sind, wird eine Analyse der Spotpreise an der Leipziger Strombörse durchgeführt.
53

Die Arthrodese an den Sprunggelenken / The arthrodesis of the ankle

Anger, Jan-Michael 15 February 2011 (has links)
No description available.
54

Angst vor dem Floating", "Angst vor festen Wechselkursen" und makroökonomische Performance / "Fear of floating", "fear of pegging" and macroeconomic performance

Gao,Qunshan 31 August 2009 (has links)
No description available.
55

Compositional Synthesis and Most General Controllers

Klein, Joachim 18 December 2013 (has links) (PDF)
Given a formal model of the behavior of a system, an objective and some notion of control the goal of controller synthesis is to construct a (finite-state) controller that ensures that the system always satisfies the objective. Often, the controller can base its decisions only on limited observations of the system. This notion of limited observability induces a partial-information game between the controller and the uncontrollable part of the system. A successful controller then realizes an observation-based strategy that enforces the objective. In this thesis we consider the controller synthesis problem in the linear-time setting where the behavior of the system is given as a nondeterministic, labeled transitions system A, where the controller can only partially observe and control the behavior of A. The goal of the thesis is to develop a compositional approach for constructing controllers, suitable to treat conjunctive cascades of linear-time objectives P_1, P_2, ..., P_k in an online manner. We iteratively construct a controller C_1 for system A enforcing P_1, then a controller C_2 enforcing P_2 for the parallel composition of the first controller with the system, and so on. It is crucial for this approach that each controller C_i enforces P_i in a most general manner, being as permissive as possible. Otherwise, behavior that is needed to enforce subsequent objectives could be prematurely removed. Standard notions of strategies and controllers only allow the most general treatment for the limited class of safety objectives. We introduce a novel concept of most general strategies and controllers suited for the compositional treatment of objectives beyond safety. We demonstrate the existence of most general controllers for all enforceable, observation-based omega-regular objectives and provide algorithms for the construction of such most general controllers, with specialized variants for the subclass of safety and co-safety objectives. We furthermore adapt and apply our general framework for the compositional synthesis of most general controllers to the setting of exogenous coordination in the context of the channel-based coordination language Reo and the constraint automata framework and report on our implementation in the verification toolset Vereofy. The construction of most general controllers in Vereofy for omega-regular objectives relies on our tool ltl2dstar for generating deterministic omega-automata from Linear Temporal Logic (LTL) formulas. We introduce a generic improvement for exploiting insensitiveness to stuttering during the determinization construction and evaluate its effectiveness in practice. We further investigate the performance of recently proposed variants of Safra\'s determinization construction in practice.
56

Efficient Reorganisation of Hybrid Index Structures Supporting Multimedia Search Criteria

Kropf, Carsten 11 February 2017 (has links) (PDF)
This thesis describes the development and setup of hybrid index structures. They are access methods for retrieval techniques in hybrid data spaces which are formed by one or more relational or normalised columns in conjunction with one non-relational or non-normalised column. Examples for these hybrid data spaces are, among others, textual data combined with geographical ones or data from enterprise content management systems. However, all non-relational data types may be stored as well as image feature vectors or comparable types. Hybrid index structures are known to function efficiently regarding retrieval operations. Unfortunately, little information is available about reorganisation operations which insert or update the row tuples. The fundamental research is mainly executed in simulation based environments. This work is written ensuing from a previous thesis that implements hybrid access structures in realistic database surroundings. During this implementation it has become obvious that retrieval works efficiently. Yet, the restructuring approaches require too much effort to be set up, e.g., in web search engine environments where several thousands of documents are inserted or modified every day. These search engines rely on relational database systems as storage backends. Hence, the setup of these access methods for hybrid data spaces is required in real world database management systems. This thesis tries to apply a systematic approach for the optimisation of the rearrangement algorithms inside realistic scenarios. Thus, a measurement and evaluation scheme is created which is repeatedly deployed to an evolving state and a model of hybrid index structures in order to optimise the regrouping algorithms to make a setup of hybrid index structures in real world information systems possible. Thus, a set of input corpora is selected which is applied to the test suite as well as an evaluation scheme. To sum up, it can be said that this thesis describes input sets, a test suite including an evaluation scheme as well as optimisation iterations on reorganisation algorithms reflecting a theoretical model framework to provide efficient reorganisations of hybrid index structures supporting multimedia search criteria.
57

Živnostenské podnikání v ČR / Licensed Trades in the Czech Republic

Němcová, Veronika January 2008 (has links)
The thesis focuses on the current situation of legal regulation of small trades in the Czech Republic, in particular on the impacts following the so far latest of the more complex amendments of the trade law, implemented by the Act no. 130/2008 Coll. The sense of this amendment was to simplify the starting of trade activities and in maximal degree ease the bureacratic burden of businessmen in their contacts with Trade Licencing Offices. The most important changes brought by this amendment are described in the succession and context of the Trades Licencing Act content as a whole. The thesis deals with the historical evolution of the trade law,it also defines the basic concepts and institutes of trade activities, as subjects of trade law, trade licence, the Trades Register, Trade Licence Offices etc. The last part of the thesis delivers the results of a survey carried out among the traders and Trade Licence Offices.
58

Methodology for Conflict Detection and Resolution in Semantic Revision Control Systems

Hensel, Stephan, Graube, Markus, Urbas, Leon 11 November 2016 (has links) (PDF)
Revision control mechanisms are a crucial part of information systems to keep track of changes. It is one of the key requirements for industrial application of technologies like Linked Data which provides the possibility to integrate data from different systems and domains in a semantic information space. A corresponding semantic revision control system must have the same functionality as established systems (e.g. Git or Subversion). There is also a need for branching to enable parallel work on the same data or concurrent access to it. This directly introduces the requirement of supporting merges. This paper presents an approach which makes it possible to merge branches and to detect inconsistencies before creating the merged revision. We use a structural analysis of triple differences as the smallest comparison unit between the branches. The differences that are detected can be accumulated to high level changes, which is an essential step towards semantic merging. We implemented our approach as a prototypical extension of therevision control system R43ples to show proof of concept.
59

Ombyggnation av en fördelningsstation : Övergripande konceptförslag för spänningsutförande 130-10 kV

Wahlström, John January 2020 (has links)
Detta arbete har utförts hos Varberg Energi AB och syftat till att presentera olika koncept som alternativ till konventionella 130 kV luftisolerade fördelningsstationer. Arbetet är tänkt att kunna vara en del i en uppdragsbeskrivning för en kommande ombyggnation. De alternativ som står tillbuds bygger ofta på att någon eller flera komponenter innehåller svavelhexafluorid, SF6, vilken har en stor negativ påverkan på växthuseffekten om den släpps ut i atmosfären. De alternativ av komponenter, exempelvis brytare, som inte innehåller SF6 är få och väsentligt mycket dyrare. Dock är fortfarande konceptlösningar som använder sig av luft som isolationsmedium till komponenter som inte är brytare, frånskiljare eller dylikt de billigaste.  Alternativen som framkommit i denna rapport och studerats närmare är ABB:s Urban-koncept, GIS med SF6 och Siemens Blue GIS med renad luft och vakuumbrytare. Fokus har varit lösningarnas beskaffenhet gällande säkerhet för tredje man, enkelhet i underhåll, klimatpåverkan och tillförlitlighet. Önskvärt är en helhetslösning där underhåll eller reparationer kan utföras i de olika facken i 130 kV-stationen utan att det påverkar driften och orsakar ett avbrott. Att finna en lösning som inte kräver SF6-gas i någon del av fördelningsstationen ger många lättnader i regelverk, mindre övervakning och kostnader förknippade med denna. En balansgång behöver göras mellan ekonomiska intressen, miljöpåverkan, inspektionsintervall, felavhjälpning och eventuella framtida miljökrav för högspänningsanläggningar. Det förstärkta sabotageskyddet som en byggnad ger har varit en klar fördel som lyfts fram hos de besökta anläggningarna. Vid val av konceptlösning kan storleken hos och kompetensen inom den egna organisationen vara en faktor att ta hänsyn till. Även utformning och val av lösning för tidigare och framtida stationer kan behöva tas hänsyn till.
60

Three Essays in Market Design

Frys, Lucien 30 August 2018 (has links)
Diese Arbeit besteht aus drei unabhängigen Kapiteln. Jedes von ihnen untersucht, wie die Gestaltung von Allokationsregeln das Ergebnis eines Marktes beeinflussen kann. Das erste Kapitel untersucht die Folgen der Beschränkung der Mechanismen, die einem Monopsonisten zur Verfügung stehen, auf Mechanismen, die allen Verkäufern den selben Preis anbietet. Ich zeige, dass dies Beschränkung nicht immer verhindert, dass er Informationen der Verkäufer extrahiert und den Preis damit anpasst. Das zweite Kapitel befasst sich mit der Verteilung von Studentenwohnheimplätzen. Die Studenten dürfen eigene Präferenzen bezüglich eines Wohnheimplatzes sowie zur Zuteilung ihrer Freunde angeben. Ich zeige, dass der random serial dictatorship modifiziert werden kann, um diese neuen Präferenzen zu ermöglichen. Die beiden vorgeschlagenen Lösungen haben schwache Anreizeigenschaften, wenn die Studierenden kooperieren können. Ich zeige jedoch, dass dieses Problem für den ersten Lösungsvorschlag verschwindet, wenn der Markt groß und wettbewerbsfähig ist. Schließlich wird im letzten Kapitel untersucht, wie die Gestaltung von Aufnahmeprüfungen an Universitäten die Zusammensetzung von Gymnasien und Universitäten beeinflussen kann. Das Kapitel vergleicht zwei Aufnahmeprüfungen. In der ersten, werden die besten Schüler jedes Gymnasiums ausgewählt, während in der anderen die insgesamt besten Studenten ausgewählt werden. Wenn der Test verrauscht ist oder wenn die Peer-Effekte für die guten Schüler niedrig sind, schickt der erst Test bessere Studenten in der Universität und fordert Vielfalt in Gymnasien. / The three chapters of this thesis are independent. Each of them investigates how the design of allocation rules may shape the outcome of a market. The first chapter studies the consequences of restricting the mechanisms available to a monopsonist to uniform price posting mechanisms. I show that it doesn't always prevent him to extract meaningful information from the sellers before posting the price. I also show that conditioning this offer on the transaction achieving a minimal quantity facilitates this task. Finally, I address the welfare and the implementation issues and apply the results to takeover operations. The second chapter studies the allocation of houses to students, when students have preferences over the houses they receive and over their friends' allocation. I show that the random serial dictatorship can be modified to accommodate this new set-up. The two solutions proposed have weak incentive properties if students can cooperate. However, I show that this problem disappears for one of them if the market is large and competitive. Finally, the last chapter studies how the design of entrance university exams can be used to influence the composition of high schools and universities. It shows that if the test is noisy or if the peer effects for the good students are low, giving the university's slots to the best students of each high school selects better students than giving them to the best students overall and desegregates high schools.

Page generated in 0.0159 seconds