Scandinavian companies of banking, retailing and hotel sectors investing into the Baltic States-developing service sector

Diplomityö tehtiin Lappeenrannan yliopistossa päätavoitteenaan selvittää tärkeimmät motiivit, jotka ovat saaneet pohjoismaiset palvelualan yrityksetinvestoimaan Baltian maiden kehittyvillä markkinoilla. Pohjoismaiset yritykset ovat olleet aiemmin aktiivisia hyödyntämään Baltian maiden työvoimaa tuotantosektorilla. Suomalaiset yritykset ovat investoineet aiemmin telekommunikaatio- sekävaatetussektoreihin, mutta nykyisin investointien pääpaino on siirtynyt palvelualalle. Pankkisektori on erittäin kehittynyt pohjoismaissa ja ruotsalaiset yritykset ovat onnistuneet myös Baltiassa siirtyen markkinoille yksityistämisen tuomien mahdollisuuksien avulla. Nykyisin näillä yrityksillä on vahva jalansija Virossa sekä ovat etabloituneet myös Latviaan ja Liettuaan. Suomalaiset pankkialan yritykset ovat olleet vaatimattomampia tällä sektorilla. Vähittäiskauppiaat ovat vasta kansainvälistymisprosessinsa alkutaipaleella. Suomalaiset yritykset ovat laajentuneet Viroon ja tehneet yhteistyötä ruotsalaisten yritysten kanssa. Hotellisektorilla suomalaiset ja ruotsalaiset ovat edenneet rauhallisesti, mutta norjalainen ketju, Reval Hotel, on laajentunut kaikkiin Baltian maihin. Hotellisektorilla on luvassa kasvua lähivuosina. Kilpailutilanne on kiristynyt kaikilla palvelualan sektoreilla sekä paikallisten yritysten kasvun että ulkomaisten investoijien myötä. Elinolojen paraneminen vaikuttaa myös kilpailutilanteeseen kiristävästi, sillä se luo mahdollisuuksia yrityksille laajentua. Tämä diplomityö selvittäätilannetta valittujen yritysten kannalta niiden kansainvälistymisen alkutaipaleella.

Modeling information in software languages

Ohjelmiston kehitystyökalut käyttävät infromaatiota kehittäjän tuottamasta lähdekoodista. Informaatiota hyödynnetään ohjelmistoprojektin eri vaiheissa ja eri tarkoituksissa. Moderneissa ohjelmistoprojekteissa käytetyn informaation määrä voi kasvaa erittäin suureksi. Ohjelmistotyökaluilla on omat informaatiomallinsa ja käyttömekanisminsa. Informaation määrä sekä erilliset työkaluinformaatiomallit tekevät erittäin hankalaksi rakentaa joustavaa työkaluympäristöä, erityisesti ongelma-aluekohtaiseen ohjelmiston kehitysprosessiin. Tässä työssä on analysoitu perusinformaatiometamalleja Unified Modeling language kielestä, Python ohjelmointikielestä ja C++ ohjelmointikielestä. Metainformaation taso on rajoitettu rakenteelliselle tasolle. Ajettavat rakenteet on jätetty pois. ModelBase metamalli on yhdistetty olemassa olevista analysoiduista metamalleista. Tätä metamallia voidaan käyttää tulevaisuudessa ohjelmistotyökalujen kehitykseen.

Tests of International Asset Pricing Models in Scandinavian Stock Markets

This thesis examines whether global, local and exchange risks are priced in Scandinavian countries’ equity markets by using conditional international asset pricing models. The employed international asset pricing models are the world capital asset pricing model, the international asset pricing model augmented with the currency risk, and the partially segmented model augmented with the currency risk. Moreover, this research traces estimated equity risk premiums for the Scandinavian countries. The empirical part of the study is performed using generalized method of moments approach. Monthly observations from February 1994 to June 2007 are used. Investors’ conditional expectations are modeled using several instrumental variables. In order to keep system parsimonious the prices of risk are assumed to be constant whereas expected returns and conditional covariances vary over time. The empirical findings of this thesis suggest that the prices of global and local market risk are priced in the Scandinavian countries. This indicates that the Scandinavian countries are mildly segmented from the global markets. Furthermore, the results show that the exchange risk is priced in the Danish and Swedish stock markets when the partially segmented model is augmented with the currency risk factor.

On Commutation and Conjugacy of Rational Languages and the Fixed Point Method

The research on language equations has been active during last decades. Compared to the equations on words the equations on languages are much more difficult to solve. Even very simple equations that are easy to solve for words can be very hard for languages. In this thesis we study two of such equations, namely commutation and conjugacy equations. We study these equations on some limited special cases and compare some of these results to the solutions of corresponding equations on words. For both equations we study the maximal solutions, the centralizer and the conjugator. We present a fixed point method that we can use to search these maximal solutions and analyze the reasons why this method is not successful for all languages. We give also several examples to illustrate the behaviour of this method.

Prognosis of after spot volumes at the Scandinavian electricity market

The Thesis is dedicated to development of an operative tool to support decision making in after spot trading on the Nordic electricity market. The basics of the Nordic electricity market, trading mechanisms on the spot and after spot markets are presented in the Thesis. Mathematical equations that describe electricity balance condition in the power system are offered. The main driving factors that impact deviation of actual electricity balance from the scheduled one (object) in the power system have been explored and mathematically defined. The behavioral model of the object and principal trends in change of state of the object under an impact of the driving factors are determined with the help of regression analysis made in Microsoft Office Excel. The behavioral model gives an indication for the total regulation volume (Elbas trades volume, volume of regulation market, balance power) for a certain hour that serves as the base input in estimating prices on the after spot markets. Proposals for development of methodologies of forecasting the after spot electricity prices are offered.

Applications of graph transformation in tools for domain-specific modeling languages

The use of domain-specific languages (DSLs) has been proposed as an approach to cost-e ectively develop families of software systems in a restricted application domain. Domain-specific languages in combination with the accumulated knowledge and experience of previous implementations, can in turn be used to generate new applications with unique sets of requirements. For this reason, DSLs are considered to be an important approach for software reuse. However, the toolset supporting a particular domain-specific language is also domain-specific and is per definition not reusable. Therefore, creating and maintaining a DSL requires additional resources that could be even larger than the savings associated with using them. As a solution, di erent tool frameworks have been proposed to simplify and reduce the cost of developments of DSLs. Developers of tool support for DSLs need to instantiate, customize or configure the framework for a particular DSL. There are di erent approaches for this. An approach is to use an application programming interface (API) and to extend the basic framework using an imperative programming language. An example of a tools which is based on this approach is Eclipse GEF. Another approach is to configure the framework using declarative languages that are independent of the underlying framework implementation. We believe this second approach can bring important benefits as this brings focus to specifying what should the tool be like instead of writing a program specifying how the tool achieves this functionality. In this thesis we explore this second approach. We use graph transformation as the basic approach to customize a domain-specific modeling (DSM) tool framework. The contributions of this thesis includes a comparison of di erent approaches for defining, representing and interchanging software modeling languages and models and a tool architecture for an open domain-specific modeling framework that e ciently integrates several model transformation components and visual editors. We also present several specific algorithms and tool components for DSM framework. These include an approach for graph query based on region operators and the star operator and an approach for reconciling models and diagrams after executing model transformation programs. We exemplify our approach with two case studies MICAS and EFCO. In these studies we show how our experimental modeling tool framework has been used to define tool environments for domain-specific languages.

Numbers and Languages

The thesis presents results obtained during the authors PhD-studies. First systems of language equations of a simple form consisting of just two equations are proved to be computationally universal. These are systems over unary alphabet, that are seen as systems of equations over natural numbers. The systems contain only an equation X+A=B and an equation X+X+C=X+X+D, where A, B, C and D are eventually periodic constants. It is proved that for every recursive set S there exists natural numbers p and d, and eventually periodic sets A, B, C and D such that a number n is in S if and only if np+d is in the unique solution of the abovementioned system of two equations, so all recursive sets can be represented in an encoded form. It is also proved that all recursive sets cannot be represented as they are, so the encoding is really needed. Furthermore, it is proved that the family of languages generated by Boolean grammars is closed under injective gsm-mappings and inverse gsm-mappings. The arguments apply also for the families of unambiguous Boolean languages, conjunctive languages and unambiguous languages. Finally, characterizations for morphisims preserving subfamilies of context-free languages are presented. It is shown that the families of deterministic and LL context-free languages are closed under codes if and only if they are of bounded deciphering delay. These families are also closed under non-codes, if they map every letter into a submonoid generated by a single word. The family of unambiguous context-free languages is closed under all codes and under the same non-codes as the families of deterministic and LL context-free languages.

Digitization Project of Finno-Ugric Languages

Jussi-Pekka Hakkaraisen esitys Ala-Saksin Valtiollisessa ja Yliopistollisessa kirjastossa Göttingenissä 28.5.2013

Digitization Project of KIndred Languages

Jussi-Pekka Hakkaraisen esitys Viron kielen instituutissa (Eesti keele instituut) Tallinnassa 23.10.2013.