Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

Jet Engine Health Signal Denoising Using Optimally Weighted Recursive Median Filters

The removal of noise and outliers from health signals is an important problem in jet engine health monitoring. Typically, health signals are time series of damage indicators, which can be sensor measurements or features derived from such measurements. Sharp or sudden changes in health signals can represent abrupt faults and long term deterioration in the system is typical of gradual faults. Simple linear filters tend to smooth out the sharp trend shifts in jet engine signals and are also not good for outlier removal. We propose new optimally designed nonlinear weighted recursive median filters for noise removal from typical health signals of jet engines. Signals for abrupt and gradual faults and with transient data are considered. Numerical results are obtained for a jet engine and show that preprocessing of health signals using the proposed filter significantly removes Gaussian noise and outliers and could therefore greatly improve the accuracy of diagnostic systems. [DOI: 10.1115/1.3200907].

Bond graph model of doubly fed three phase induction motor using the Axis Rotator element for frame transformation

Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Optimal multicommodity flow through the complete graph with random edge capacities

We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.

Uuden median murros Alma Mediassa, Sanoma Oy:ssä ja Yleisradiossa 1994-2004

This is a qualitative and multimethodological comparative study, which consists of two main parts: examining the development of new media and analysing and comparing the new media strategies of the three companies studied (Alma Media, Sanoma and the Finnish Broadcasting Company Yleisradio). The study includes the first large-scale review in Finnish of the development of new media, paying attention to the birth of the Internet as well as to mobile media, web TV and any other element of new media. It also concentrates on the function of electronic distribution channels before the age of the Internet, e.g. cable text and videotext. Answers about how the three traditional Finnish media houses began spreading their content to the Internet and wireless applications in 1994–2004 are also given. In researching the new media strategies the study pays special attention to the attitudes that the three media companies adopted towards the Internet and other forms of new media in their strategies during the years in question. By analysing and comparing, e.g., the companies’ strategies and their investments, the study ascertains whether the companies had a joint functional model in adopting new media or acted totally on their own without taking too much notice of the media field overall. The study makes extensive use of previously published material. The researcher has also interviewed almost twenty people who were involved in getting the companies’ new media functions under way. The methods for the interviews were dialogue and snowball sampling. The researcher has created a classification in which he divides the business strategies into four different categories: active strategy, careful strategy, permissive strategy, and passive strategy. In comparing and analysing the companies the researcher has used the classification devised by Allan Afuah & Christopher L. Tucci. The seven element classification consists of dominant managerial logic, competency trap, fear of cannibalisation and loss of revenue, channel conflict, political power, co-opetitor power and emotional attachment. In analysing the company strategies the researcher has also noted the classifications of convergence made by Everette E. Dennis and Graham Murdock as well as the aspects formulated by Sylvia Chan-Olmsted and Louisa Ha concerning the success of the companies in adopting the Internet into their functions. Based on all these classifications and by further developing them the researcher analyses and compares the success of the new media strategies of the three Finnish companies. The outcome of the study is a conclusion as to what kind of strategies the companies have carried out their new media functions and how they have succeeded in it.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Kuluttajien kokemukset lastenvaatteiden ja -tarvikkeiden verkkokaupan palvelun laadusta sosiaalisen median keskusteluissa

Tämän pro gradu- tutkielman tavoitteena oli löytää kuluttajien palvelukokemukseen vaikuttavat tekijät lastenvaatteiden- ja tarvikkeiden -verkkokaupassa. Empiirinen tutkimus lähestyi aihetta netnografian avulla. Aineistoksi tähän tutkielmaan valittiin sosiaalisen median keskustelut. Tutkimuksen teoreettinen osa muodostui kolmesta aiheesta: verkko-ostamisesta ja palvelun laadusta, sosiaalisesta mediasta sekä word-of-mouth-viestinnästä. Verkko-ostamisessa käsiteltiin ostamisen eri vaiheet, kuluttajien motivaatiot verkosta ostamiseen, sekä siihen liittyvät riskit ja tarkasteltiin sähköisen palvelun laatua. Sosiaalinen media-luku kertoi sosiaalisen median käytöstä sekä eri medioista. Word-of-mouth-viestintä esitteli perinteisen word-of-mouth-viestinnän lisäksi sähköisen WOM-viestinnän ulottuvuudet. Empiirinen tutkimus oli laadullinen ja se toteutettiin netnografisesti. Netnografia on etnografiaan perustuva menetelmä, jota käytetään internet-aineistoissa. Aineiston analysoinnissa käytettiin teemoittelua. Aihetta lähestyttiin faktanäkökulmasta, eli tutkimuksessa oltiin kiinnostuneita niistä tosiasioista joita keskustelijat kertoivat. Aineisto kerättiin perhe-aiheisten lehtien keskustelupalstoilta sekä blogeista Google-haun avulla. Sosiaalisen median keskustelut valittiin aineistoksi, koska niistä uskottiin saatavan kaikkein totuudenmukaisinta tietoa, johon tutkijan kysymyksen asettelu ei vaikuta. Spontaanit keskustelut antavat erilaista tietoa kuin suoran kysymyksen vastaukset. Tutkimuksen tuloksena löytyi seitsemän teemaa, joita keskusteluissa käsiteltiin. Nämä ovat toimitus, palvelu, palautus ja normalisointi, ulkoasu ja toimivuus, hinta, maksaminen sekä tuotteet ja valikoima. Sen sijaan teorian pohjalta odotettavissa olleet turvallisuus ja yksityisyys eivät tulleet aineistosta lainkaan esiin. Erityisen huonona palveluna asiakkaat pitivät varastosaldojen paikkansapitämättömyyttä, hitaita toimituksia sekä epäystävällistä palvelua. Hyvää palvelua olivat nopeat toimitukset sekä yksilöllinen palvelu ja reklamaatioiden hyvä hoito.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Sosiaalisen median odotuksia ja käyttötarpeita osana asiantuntijaorganisaation viestintää

Tarkastelen pro gradu -tutkielmassani työyhteisön viestintätapojen muutosta ja sosiaalisen mediai roolia muutoksessa. Tutkimukseni tavoitteena on jäsentää ja ymmärtää sosiaalisen median roolia työyhteisön viestinnässä ja tarkastella miten sosiaalinen media taipuu tietoperustaisen asiantuntiorganisaation tarpeisiin. Tutkimuksen teoreettisessa osuudessa selvitän sitä, miten työn tekemisessä tapahtuneet muutokset ovat muuttaneet työyhteisön tapaa ja tarvetta viestiä. Työn tekemisen uusia muotoja ja verkostoitumista jäsennän tutkimuskirjallisuuden Alvesson (2000), Gruber & Palonen (2007), Kasvio & Tjäder (2007), Sennett (2007) kautta. Työn uusia muotoja voidaan kuvata käsitteillä asiantuntijakeskeisyys, tietointensiivisyys ja tietoperustainen työ. Kuva tutkimuksessani myös sosiaalisen median käsitettä sekä sen tunnusomaisuuksia. Tarkastelen tietoperustaisen asiantuntijaorganisaation odotuksia ja käyttötarpeita sosiaaliselle medialle Elisa Juholinin (2008) määrittelemän työyhteisöviestinnän uuden agendan (agendamalli) viitekehykses Tutkimukseni empiirisessä osuudessa tarkastelen aihetta yhden tietoperustaisen asiantuntijaorganisaation jäsenten kautta. Tavoitteeni on selvittää 1) millaisia odotuksia asiantuntijaorganisaatiossa työskentelevillä on sosiaalisen median käytöstä osana työyhteisön viestintää sekä 2) millaisia käyttötarpeita asiantuntijaorganisaatiossa työskentelevillä on sosiaalis* median käytöstä osana työyhteisön viestintää. Tutkimusotteeni on laadullinen, ja aineiston keruur menetelmänä käytän fokusryhmäkeskustelua sekä teemahaastattelua. Analysoin aineiston teemoittelemalla. Aineiston koodauksessa käytin Atlas.ti -ohjelmaa. Tutkimukseni perusteella voidaan todeta, että tärkeimpänä sosiaalisen median odotuksiin ja käyttötarpeisiin liittyi ajatus käyttäjälähtöisyydestä ja vuorovaikutuksesta. Käyttäjälähtöisyys ja vuorovaikutus näkyivät erityisesti odotuksena viestinnän rutiinien, tiedon ja osaamisen jakamisena entistä avoimempaan ; vuorovaikutteisempaan suuntaan. Tutkimus antaa viitteitä siitä, että sosiaalisen median sovelluksilla on mahdollista tukea vuorovaikutusta juuri niissä työyhteisöviestinnän tehtävissä, joissa vuorovaikutus jää helposti vähäiseksi. Sosiaalisen median sovelluksia tarvitaan myös tietoperustaisen asiantuntijaorganisaation osaamisen ja ns. hiljaisen tiedonjakamiseen. Tutkimuksen perusteella sosiaalinen media osana työyhteisön viestintää taipuu tiedontarpeen tyydyttäjänä, tarjoaa vaihtoehdon viestintäkanaville ja viestinnän toimintamalleille, mahdollistaa osallistumaan ja vaikuttamaan työyhteisön asioihin sekä tarjoaa tavan koota työyhteisössä olevaa osaamista ja hiljaista tietoa.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

Three- and Seven-Point Optimally Weighted Recursive Median Filters for Gas Turbine Diagnostics

Measured health signals incorporate significant details about any malfunction in a gas turbine. The attenuation of noise and removal of outliers from these health signals while preserving important features is an important problem in gas turbine diagnostics. The measured health signals are a time series of sensor measurements such as the low rotor speed, high rotor speed, fuel flow, and exhaust gas temperature in a gas turbine. In this article, a comparative study is done by varying the window length of acausal and unsymmetrical weighted recursive median filters and numerical results for error minimization are obtained. It is found that optimal filters exist, which can be used for engines where data are available slowly (three-point filter) and rapidly (seven-point filter). These smoothing filters are proposed as preprocessors of measurement delta signals before subjecting them to fault detection and isolation algorithms.