Turku Centre for Computer Science

About: Turku Centre for Computer Science is a facility organization based out in Turku, Finland. It is known for research contribution in the topics: Decidability & Word (group theory). The organization has 382 authors who have published 1027 publications receiving 19560 citations.

A Framework For State Transitions On The Self-Organizing Map: Some Temporal Financial Applications

Abstract: Self-organizing maps (SOMs) have commonly been used in temporal applications. This paper enhances the SOM paradigm for temporal data by presenting a framework for computing, summarizing and visualizing transition probabilities on the SOM. The framework includes computing matrices of node-to-node and node-to-cluster transitions and summarizing maximum state transitions. The computations are linked to the SOM grid using transition-plane visualizations. We demonstrate the usefulness of the framework on two SOM models for temporal financial analysis: financial performance comparison of banks and monitoring indicators of currency crises. Copyright © 2012 John Wiley & Sons, Ltd.

Process visibility: how mobile technology can enhance business-customer care in the paper industry

Abstract: The paper focuses on developing the idea that process visibility is a key aspect of effective cross-boundary organizational processes, specifically customer care, and that it is potentially enhanced by the capabilities provided by mobile technology. Process visibility enables specific actors to track the dynamics of a process, empowers them and provides a higher degree of involvement, what may result in increased customer satisfaction. We introduce the visibility concept into the domain of mobile information systems, and within the following case study we outline the unique opportunities it can offer when incorporated into business customer solutions. Results from the field experiment imply that a mobile system, once implemented in the case organization, could permanently change daily routines in customer service recovery and introduce new ways of reacting to problems, treating them in collaborative manner and learning together.

Minimal Reaction Systems Defining Subset Functions

Abstract: In reaction systems introduced by Ehrenfeucht and Rozenberg the number of resources is essential when various questions concerning generative capacity are investigated. While almost all functions from the set of subsets of a finite set \(S\) into itself can be defined by unrestricted reaction systems, only a specific subclass of such functions is defined by minimal reaction systems. In this paper we show that also minimal reaction systems suffice for defining all such functions, provided repetitive use is allowed. Specifically, everything generated by an arbitrary reaction system is generated by a minimal one in three steps. In this way also some functions not at all definable by reaction systems can be generated by minimal reaction systems. All subsets of \(S\), in any prechosen order, appear in the sequence of a minimal reaction system.