HauptbeschreibungDelivering humanitarian aid has become a complex issue in contemporary politics and practice. The expansion of the humanitarian field caused by an increasing number of humanitarian actors and international donors - such as the EU, the United States, and the United Nations - leads to new questions concerning complex coordination, legitimacy, and accountability. These changes in the humanitarian arena, the so-called "New Wars", and advances in international law confront humanitarian actors with additional challenges. In turn, such changes require a professionalization of aid in.
HauptbeschreibungDelivering humanitarian aid has become a complex issue in contemporary politics and practice. The expansion of the humanitarian field caused by an increasing number of humanitarian actors and international donors - such as the EU, the United States, and the United Nations - leads to new questions concerning complex coordination, legitimacy, and accountability. These changes in the humanitarian arena, the so-called "New Wars", and advances in international law confront humanitarian actors with additional challenges. In turn, such changes require a professionalization of aid in.
The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The model-checking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of the modal μ-calculus on restricted classes of graphs, specifically on classes of bounded Kelly-width or bounded DAG-width. In this process we also prove a general decomposition theorem for the modal μ-calculus and define a useful notion of type for this logic. Then, assuming a class of parity games has a polynomial time algorithm solving it, we consider the problem of extending this algorithm to larger classes of parity games. In particular, we show that joining games, pasting games, or adding single vertices preserves polynomial-time solvability. It follows that parity games can be solved in polynomial time if their underlying undirected graph is a tournament, a complete bipartite graph, or a block graph. In the last chapter we present the first non-trivial formal proof about parity games. We explain a formal proof of positional determinacy of parity games in the proof assistant Isabelle/HOL. Die Themen dieser Dissertation sind der modale μ-Kalkül und Paritätsspiele. Der modale μ-Kalkül ist eine häufig eingesetzte Logik im Bereich des Model-Checkings in der Informatik. Das Model-Checking-Problem des modalen μ-Kalküls ist polynomialzeitäquivalent zum Lösen von Paritätsspielen, einem 2-Spielerspiel auf beschrifteten, gerichteten Graphen. Wir präsentieren die ersten FPT-Algorithmen (fixed-parameter tractable) für das Model-Checking-Problem des modalen μ-Kalküls auf Klassen von Graphen mit beschränkter Kelly-Weite oder beschränkter DAG-Weite. Für diesen Zweck beweisen wir einen allgemeineren Zerlegungssatz für den modalen μ-Kalkül und stellen eine nützliche Definition von Typen für diese Logik vor. Angenommen, eine Klasse von Paritätsspielen hat einen Polynomialzeit-Lösungs-Algorithmus, betrachten wir danach das Problem, diese Klassen zu erweitern auf eine Weise, sodass Polynomialzeit-Lösbarkeit erhalten bleibt. Wir zeigen, dass dies beim Join von Paritätsspielen, beim Pasting und beim Hinzufügen einzelner Knoten der Fall ist. Wir folgern daraus, dass das Lösen von Paritätsspielen in Polynomialzeit möglich ist, falls der unterliegende ungerichtete Graph ein Tournament, ein vollständiger bipartiter Graph oder ein Blockgraph ist. Im letzten Kapitel präsentieren wir den ersten nicht-trivialen formalen Beweis über Paritätsspiele. Wir stellen einen formalen Beweis für die positionale Determiniertheit von Paritätsspielen im Beweis-Assistenten Isabelle/HOL vor.
This book pools the current know-how, and closes important knowledge gaps, to offer hands-on advice and practical answers to the many 'how to' questions relating to merger implementation. It provides a crucially important understanding of how to assess the chances of realising synergy potential and evaluate integration risks.
Innovations constitute one essential success factor for the development, progress, and success of companies. Thus, striving for the creation of innovation can be beneficial. One way to create innovations is to increase the innovation capability of companies in order to enhance the knowledge base in that company. In plenty of innovation-related research, it turned out that customers can be one important source of new knowledge. Thus, they can also be a driver for increasing innovation capability and hence ultimately help to foster the creation of innovations. Due to potential effects of customers on innovation capability, companies could strive to generally integrate customers into their innovation activities. However, companies should consider differences of customers in order to identify the most promising customers for their innovation activities. Therefore, the idea of competences of an individual is applied, since competences integrate abilities, skills, and knowledge and are thus a wide construct respecting different facets of a customer. With the concept of customer competences, companies might be enabled to identify the most beneficial customers for their innovation activities in order to increase their innovation capability. Accordingly, in order to explain interrelations between particular customer competences and the innovation capability of a company, this research delivers a well-founded basis by investigating the general existence of interrelations between customer competences and the innovation capability of companies. You can download the "Documentation Volume" for free here: https://cuvillier.de/uploads/cms_file/cms_file/351/Illigen_Documentation_Volume.pdf
Customer integration in the early innovation phase, considered the method of choice in theory and practice, has shown unexpected side effects that may even outweigh its recognized advantages. As a result, management needs to be able to assess in advance whether the involvement of customers will add overall value to an innovation project. This book develops a mathematical formula to support this decision.
This textbook provides a comprehensive overview of identity-based brand management based on current research. The authors focus on the design of the brand identity, which covers the internal perspective of brand management, and the resulting external brand image perceived by consumers and other audiences. The book covers topics such as brand positioning, the design of the brand architecture and brand elements, the management of brand touchpoints and the customer journey, as well as multi-sensory brand management and brand management in a digital environment. Further topics covered are international brand management, brand management in the retail sector, in social media and on digital brand platforms (electronic marketplaces). Numerous practical examples illustrate the applicability of the concept of identity-based brand management. The authors show that the concept of identity-based brand management is a valuable management model to make brands successful. In the 2nd edition, all chapters were fundamentally revised and up-to-date practical examples as well as latest research findings were added. Additional material is available via an app: Download the Springer Nature Flashcards App and use exclusive content to test your knowledge.
Christoph G. Schuetz examines the conceptual modeling aspects of multilevel business processes without neglecting the implementation aspects. Furthermore, he investigates the advantages of hetero-homogeneous models for quantitative business process analysis. Multilevel models reflect the reality of many information systems. In this respect process-aware information systems are no exception. Multilevel models capture interdependencies between business processes at different organizational levels and allow for a convenient representation of business process variability which, in turn, facilitates the analysis of business processes across different organizational units.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.