<p><p>Den här studiens syfte är att undersöka och jämföra hur förhållanden i tre av Sveriges till synes mest framgångsrika sport eventorganisationer ser ut, baserat på den mest grundläggande och äldsta managementteorin. Studien har genomförts som en kvalitativ metod med sammanlagt sex semistrukturerade intervjuer. Intervjuerna har genomförts med respektive chef och en anställd i varje sport eventorganisation för att skapa en helhetsbild av hur förhållandena ser ut i organisationerna.</p><p>Den framkomna empirin har vi analyserat i förhållande till Fayols managementteori och med utgångspunkt i det har vi sedan diskuterat resultatet. Resultatet ger en bild av hur förhållanden ser ut i respektive organisation. I resultatet framkommer också att organisationerna är lika till stor del, bland annat när det handlar om arbetsfördelning, grad av ansvar bland de anställda, initiativtagande samt känslan av samhörighet i organisationen.</p><p>Det framkommer även att det finns skillnader mellan organisationerna. Den största och mest intressanta skillnaden som framkommer är förhållandet som berör anställningstid och rekrytering av de huvudfunktionärer eller projektledare som arbetar med respektive event. Resultatet visar även att organisationerna skiljer sig åt när det handlar om betydelsen av kontinuitet bland huvudfunktionärerna eller projektledarna. En annan stor skillnad är huruvida rekryteringen ska ske externt eller internt. Slutligen diskuterar vi det som framkommit och ger där förslag på hur organisationerna möjligtvis kan utvecklas.</p></p>

Zugl.: Erlangen-Nürnberg, Universiẗat, Diss., 2008. / Literaturverz.

Zugl.: Chemnitz, Techn. Universiẗat, Diss., 2008.

An event store is a database for storing events in an event sourcing system. Instead of storing the current state, a very common way to persist data, an event sourcing system captures all changes to an application state as a sequence of events. Usually the event store is a relational database. Relational databases have several drawbacks and therefore NoSQL databases have been developed. The purpose of this thesis is to explore the possibility of using a NoSQL database in an event sourcing system. We will see how data is stored in an event store and then evaluate di↵erent solutions to find a suitable database. The graph database Neo4j was selected to be further investigated and a Neo4j event store has been implemented. At last the implemented solution is evaluated against the existing event store that uses a relational database. The conclusion of this thesis is that event store data could easily be modeled in Neo4j but some queries became complex to implement. The performance tests showed us that the implemented event store had poorer performance than the existing one using a relational database.

Owing to the ever increasing information deluge, it is becoming increasingly difficult to locate relevant information through traditional term-based search methods. Event–based text mining provides a more promising approach, as it also takes into account the semantic relationships between terms. Typical event representations only focus on identifying the type of the event, its par-ticipants and their types. However, additional information, which is essential for correct interpretation of the event, is often present in the text. This includes infor-mation about the polarity, certainty level, intensity/rate/frequency, type and source of the knowledge conveyed by the event. We refer to this additional information as meta-knowledge. This thesis focusses on our work involving the enrichment of events with meta-knowledge information. In this thesis we: • describe the annotation scheme designed specifically to capture meta-knowledge information at the event level• report on the corpora that have been enriched through deployment of the meta-knowledge annotation scheme• describe the work on automated identification of meta-knowledge including: - a broad-ranging study on analysis and identification of polarity of bio-events using three different bio-event corpora - a detailed study on analysis and identification of knowledge source in bio-events found in abstracts as well as in full papers - a first study on analysis and identification of bio-event manner• describe the initial work on a new approach to discourse analysis based on me-ta-knowledge annotations at the event level

Streaming analytics deploy Kleene pattern queries to detect and aggregate event trends against high-rate data streams. Despite increasing workloads, most state-of-the-art systems process each query independently, thus missing cost-saving sharing opportunities. Sharing complex event trend aggregation poses several technical challenges. First, the execution of nested and diverse Kleene patterns is difficult to share. Second, we must share aggregate computation without the exponential costs of constructing the event trends. Third, not all sharing opportunities are beneficial because sharing aggregation introduces overhead. We propose a novel framework, Muse (Multi-query Snapshot Execution), that shares aggregation queries with Kleene patterns while avoiding expensive trend construction. It adopts an online sharing strategy that eliminates re-computations for shared sub-patterns. To determine the beneficial sharing plan, we introduce a cost model to estimate the sharing benefit and design the Muse refinement algorithm to efficiently select robust sharing candidates from the search space. Finally, we explore optimization decisions to further improve performance. Our experiments over a wide range of scenarios demonstrate that Muse increases throughput by 4 orders of magnitude compared to state-of-the-art approaches with negligible memory requirements.

The subject of these diploma work is estimation marketing strategy of the company, which is making events. In first and theoretic part of this diploma work I dealing with prodigy of eventu and his mening in today´s companies. There is also mention about story when this mark is started to use at all, when modern society has been started interest about it, as aviable part of marketing mix. I enlarge here theoretics contributions and reasons why is important arrange him. In practical part I dealing with aspects of event himself and process of realization. Because in this time I working in company creating this events, I had posibility to look on this evets from the another side. I also had posibility notice mistakes which are making on actions, in this part of marketing. In final part I mented about efectivity events and outlines the future.

The subject of these diploma work is estimation marketing strategy of the company, which is making events. In first and theoretic part of this diploma work I dealing with prodigy of eventu and his mening in today´s companies. There is also mention about story when this mark is started to use at all, when modern society has been started interest about it, as aviable part of marketing mix. I enlarge here theoretics contributions and reasons why is important arrange him. In practical part I dealing with aspects of event himself and process of realization. Because in this time I working in company creating this events, I had posibility to look on this evets from the another side. I also had posibility notice mistakes which are making on actions, in this part of marketing. In final part I mented about efectivity events and outlines the future.

Introducing event sourcing to a system that is based on a model following Create, Read, Update and Delete (CRUD) operations can be a challenging task and requires an extensive rework of the current system. By introducing coarse-grained events it is possible to persist the structure of the data in a CRUD model and still gain the benefits of event sourcing, avoiding an extensive rework of the system. This thesis investigates how large amounts of data can be handled with coarse-grained events and still gain the benefits of event sourcing, by comparing with the conventional way of using fine-grained events. The data to be examined is trade data fed into a data warehouse. Based on research, an event sourcing application is implemented for coarse-grained as well as fine-grained events, to measure the difference between the two event types. The difference is limited to the metrics, latency and size of storage. The application is verified with an error handler, using example data and a profiler to make sure that it does not have any unnecessary bottlenecks. The resulting performance of the two cases show that fine-grained events have excessively larger latency than coarse-grained events in most cases whereas the size of storage is strictly smaller for fine-grained events. / Att introducera event sourcing i ett system baserat på en model som använder Create-, Read-, Update- och Delete-operationer (CRUD) kan vara en utmanande uppgift och kräver en omfattande omstrukturering av det nuvarande systemet. Genom att introducera grova händelser är det möjligt att bevara hela strukturen på datan i en CRUD-modell och ändå få fördelarna med event sourcing, för att därigenom undvika en omfattande omarbetning av systemet. Detta arbete undersöker hur stora datamängder kan hanteras genom grova händelser och ändå ge fördelarna med event sourcing, genom att jämföra med det konventionella sättet att använda fina händelser. Datan som undersöks är transaktionsdata på finansiella derivat som matas in i ett datalager. Baserat på forskning implementeras en event sourcing-applikation för både grova och fina händelser, för att mäta skillnaden mellan dessa två händelsetyper. Skillnaden är avgränsad till latens och lagringsutrymme. Applikationen verifieras genom felhantering, exempeldata och profilering för att säkerställa att den inte har några onödiga flaskhalsar. Den resulterande prestandan visar att fina händelser har betydligt större latens än grova händelser i de flesta fallen, medan lagringsutrymmet är strikt mindre för fina händelser.

This thesis considers probabilistic supervisory control of probabilistic discrete event systems (PDES). PDES are modeled as generators of probabilistic languages. The probabilistic supervisors employed are a generalization of the deterministic ones previously employed in the literature. At any state, the supervisor enables/disables events with certain probabilities. The probabilistic supervisory control problem (PSCP) that has previously been considered in the literature is revisited: find, if possible, a supervisor under whose control the behavior of a plant is identical to a given probabilistic specification. The existing results are unified, complemented with a solution of a special case and the computational analysis of synthesis problem and the solution. The central place in the thesis is given to the solution of the optimal probabilistic supervisory control problem (OPSCP) in the framework: if the conditions for the existence of probabilistic supervisor for PSCP problem are not satisfied, find a probabilistic supervisor such that the achievable behaviour is as close as possible to the desired behaviour. The proximity is measured using the concept of pseudometric on states of generators. The distance between two systems is defined as the distance in the pseudometric between the initial states of the corresponding generators. The pseudometric is adopted from the research in formal methods community and is defined as the greatest fixed point of a monotone function. Starting from this definition, we suggest two algorithms for finding the distances in the pseudometric. Further, we give a logical characterization of the same pseudometric such that the distance between two systems is measured by a formula that distinguishes between the systems the most. A trace characterization of the pseudometric is then derived from the logical characterization by which the pseudometric measures the difference of (appropriately discounted) probabilities of traces and sets of traces generated by systems, as well as some more complicated properties of traces. Then, the solution to the optimal probabilistic supervisory control problem is presented. Further, the solution of the problem of approximation of a given probabilistic generator with another generator of a prespecified structure is suggested such that the new model is as close as possible to the original one in the pseudometric (probabilistic model fitting). The significance of the approximation is then discussed. While other applications are briefly discussed, a special attention is given to the use of ideas of probabilistic model fitting in the solution of a modified optimal probabilistic supervisory control problem. / Thesis / Doctor of Philosophy (PhD)