Experimental osteoarthritis in rabbits: lesion progression

The aim of this study was to evaluate the progression of lesions in different stages of osteoarthritis (OA) experimental by radiography (RX), computed tomography (CT), macroscopic and histopathology, linking these different diagnostic methods, helped to provide information that helps the best time for the therapeutic approach. Four experimental periods were delineated at 3, 6, 9 and 12 weeks after induction of OA, known as PI, PII, PIII and PIV, respectively, each with six animals. We evaluated the five compartments of the femorotibial joint: medial femoral condyle (MFC), lateral femoral condyle (LFC), medial tibial plateau (MTP), lateral tibial plateau (LTP) and femoral trochlea (FT). Therefore we established an index by compartment (IC) and by adding such an index was estimated joint femorotibial (IFT). It was observed that the CFM was the compartment with the highest IC also differed significantly (p<0.05) from other compartments. Compartments showed no significant difference (p>0.05) between the PI and PII, however contrary fact occurred between the PII and PIII (p<0.05), PIII and PIV (p<0.01) and between PI and PIV (p<0.001). Similarly the IFT, showed a significant difference in the animals of PIV compared to PI (p<0.001), PII (p<0.001) and PIII (p<0.01), and there was no statistical difference (p> 0.05) between the PI and PII. In the variation of the average interval between periods, there was a higher value between the PIII PIV and for the other intervals of time periods (PI, PII, and PIII-PII). However, these intervals showed no statistically significant difference (p>0.05). Through the RX, CT, macroscopic and histopathological findings, we found similar patterns among individuals within the same period demonstrating a gradual progression of the disease. These results show that between 3 and 6 weeks progression of the lesion is slower and probably also can be reversed in comparison to other ranges where proved further progression between 9 and 12 weeks after induction of trauma OA. These results may provide a better therapeutic approach aimed at reversing the lesions in early stages of OA. We conclude that the interconnection of the four diagnostic methods individually classified into scores, which were unified in both indices in the evaluation by the femorotibial joint compartment and may represent a diagnostic condition closer to the true condition of the injury and its progression.

Taajuusmuuttaja aktiivisesti säädetyn magneettilaakerin virtalähteenä

Työssä tutkitaan mahdollisuutta hyödyntää sähkömoottorien nopeudensäätöön suunniteltuja kaupallisia taajuusmuuttajia osana aktiivisesti säädetyn magneettilaakeroinnin säätöjärjestelmää. Magneettilaakerijärjestelmän ohjaamiseksi tarvitaan vahvistin, jonka tehtävänä on muuntaa paikkasäätöjärjestelmältä tuleva ohjearvo virraksi, jännitteeksi tai magneettivuoksi voiman tuottamiseksi laakerikäämityksellä. Nykyaikaiset modernit taajuusmuuttajat mahdollistavat säätöalgoritmien suorittamisen sekä liitynnän muuhun automaatiojärjestelmään kenttäväylien kautta. Tämän järjestelmäintegraation myötä olisi mahdollista rakentaa modulaarinen säätöjärjestelmä hyödyntäen luotettavaksi todettuja teollisuusautomaatiotuotteita vain muutamalla itse magneettilaakerijärjestelmään liittyvällä tuotteella. Haluttaessa hyödyntää kolmivaiheinen taajuusmuuttaja mahdollisimman tehokkaasti magneettilaakerin teholähteenä tulee laakerikäämityksien kytkeytymistä taajuusmuuttajaan tarkastella tarkemmin. Kirjallisuustutkimuksessa keskitytään taajuusmuuttajan tehokytkimien muodostaman vaihtosuuntaajan eri rakennevaihtoehtojen sekä virtasäädön dynaamisten ominaisuuksien tarkasteluun. Soveltuvien rakennevaihtoehtojen sekä virtasäädön suorituskyky todennetaan simuloinnein ja lopuksi todellisella koelaitteistolla. Magneettilaakeroinnilla varustetun sähkökoneen roottorin onnistunut leijuttaminen viiden vapausasteen suhteen paikkasäädettynä sekä mittauksien tulokset osoittavat, ettei taajuusmuuttajien järjestelmäarkkitehtuurista löydy merkittäviä esteitä muuttajien hyödyntämiseksi magneettilaakerisovelluksissa.

Design Space Exploration for MPSoC Architectures

Multiprocessor system-on-chip (MPSoC) designs utilize the available technology and communication architectures to meet the requirements of the upcoming applications. In MPSoC, the communication platform is both the key enabler, as well as the key differentiator for realizing efficient MPSoCs. It provides product differentiation to meet a diverse, multi-dimensional set of design constraints, including performance, power, energy, reconfigurability, scalability, cost, reliability and time-to-market. The communication resources of a single interconnection platform cannot be fully utilized by all kind of applications, such as the availability of higher communication bandwidth for computation but not data intensive applications is often unfeasible in the practical implementation. This thesis aims to perform the architecture-level design space exploration towards efficient and scalable resource utilization for MPSoC communication architecture. In order to meet the performance requirements within the design constraints, careful selection of MPSoC communication platform, resource aware partitioning and mapping of the application play important role. To enhance the utilization of communication resources, variety of techniques such as resource sharing, multicast to avoid re-transmission of identical data, and adaptive routing can be used. For implementation, these techniques should be customized according to the platform architecture. To address the resource utilization of MPSoC communication platforms, variety of architectures with different design parameters and performance levels, namely Segmented bus (SegBus), Network-on-Chip (NoC) and Three-Dimensional NoC (3D-NoC), are selected. Average packet latency and power consumption are the evaluation parameters for the proposed techniques. In conventional computing architectures, fault on a component makes the connected fault-free components inoperative. Resource sharing approach can utilize the fault-free components to retain the system performance by reducing the impact of faults. Design space exploration also guides to narrow down the selection of MPSoC architecture, which can meet the performance requirements with design constraints.

Invenio customization for CERN Document Server

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

University Institutional Repository and its Place in the University Information Infrastructure

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

Let's do data research work: the creation of a portal with research information from Catalan Universities

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

Organizing for Systemic Innovations – Research on Knowledge, Interaction and Organizational Interdependencies

Systemic innovation has emerged as an important topic due to the interconnected technological and sociotechnical change of our current complex world. This study approaches the phenomenon from an organizing perspective, by analyzing the various actors, collaborative activities and resources available in innovation systems. It presents knowledge production for innovation and discusses the organizational challenges of shared innovation activities from a dynamic perspective. Knowledge, interaction, and organizational interdependencies are seen as the core elements of organizing for systemic innovations. This dissertation is divided into two parts. The first part introduces the focus of the study and the relevant literature and summarizes conclusions. The second part includes seven publications, each reporting on an important aspect of the phenomenon studied. Each of the in-depth single-case studies takes a distinct and complementary systems approach to innovation activities – linking the refining of knowledge to the enabling of organizations to participate in shared innovation processes. These aspects are summarized as theoretical and practical implications for recognizing innovation opportunities and turning ideas into innovations by means of using information and organizing activities in an efficient manner. Through its investigation of the existing literature and empirical case studies, this study makes three main contributions. First, it describes the challenges inherent in utilizing information and transforming it into innovation knowledge. Secondly, it presents the role of interaction and organizational interdependencies in innovation activities from various novel perspectives. Third, it highlights the interconnection between innovations and organizations, and the related path dependency and anticipatory aspects in innovation activities. In general, the thesis adds to our knowledge of how different aspects of systems form innovations through interaction and organizational interdependencies. It highlights the continuous need to redefine information and adjust organizations and networks based on ongoing activities – stressing the emergent, systemic nature of innovation.

Sekaelementit absoluuttisten solmukoordinaattien menetelmässä

Tässä lisensiaatintyössä käsitellään sekaelementtien sovellusmahdollisuuksia absoluuttisten solmukoordinaattien menetelmässä. Absoluuttisten solmukoordinaattien menetelmä on uudentyyppinen lähestymistapa elementtimenetelmän elementtien koordinaattien määrittämiseksi ja sen yhtenä tavoitteena on tehostaa suuria siirtymiä tai kiertymiä sisältävien elementtien laskentatehokkuutta. Tässä työssä absoluuttisten solmukoordinaattien menetelmä esitellään pääpiirteittäin sekä annetaan esimerkkejä muutamista tyypillisimmistä elementeistä lausuttuna edellä mainittujen koordinaattien perusteella. Sekaelementeiksi kutsutaan elementtityyppejä, missä tuntemattomien muuttujien joukkoja on aina enemmän kuin yksi. Sekaelementit erottavat redusoitumattomista elementeistä siirtymäkentän sisältyminen muuttujaryhmään ja hybridielementeistä muuttujien identtiset ulottuvuudet. Sekaelementtejä käytetään esimerkiksi kokoonpuristumattomien materiaalien rakenneanalyyseissä, alentamaan elementiltä vaadittavia jatkuvuusehtoja tai mallintamaan ilmiöitä, missä fysikaaliset ominaisuudet ovat jostain syystä voimakkaasti toisistaan riippuvaisia. Tämän lisensiaatintyön kirjoittamiseksi on tehty tutkimusta sekaelementtien mahdollisuuksista toimia absoluuttisten solmukoordinaattien menetelmässä. Tutkimuksen tuloksena on saatu aikaan kaksi tässä työssä esiteltävää, varsin rajatun toimintakyvyn omaavaa sekaelementtityyppiä, joiden siirtymäkentät on määritelty globaalien koordinaattien suhteen sisältäen myös orientaatiotermit. Tutkimusaihe vaatii kuitenkin vielä paljon lisätyötä, ennen kuin sekaelementtityyppejä voidaan kauttaaltaan soveltaa absoluuttisten solmukoordinaattien menetelmällä toteutetuissa rakenneanalyyseissä.

Embedded Service Bus for Internet of Things Interoperability

Internet of Things (IoT) technologies are developing rapidly, and therefore there exist several standards of interconnection protocols and platforms. The existence of heterogeneous protocols and platforms has become a critical challenge for IoT system developers. To mitigate this challenge, few alliances and organizations have taken the initiative to build a framework that helps to integrate application silos. Some of these frameworks focus only on a specific domain like home automation. However, the resource constraints in the large proportion of connected devices make it difficult to build an interoperable system using such frameworks. Therefore, a general purpose, lightweight interoperability framework that can be used for a range of devices is required. To tackle the heterogeneous nature, this work introduces an embedded, distributed and lightweight service bus, Lightweight IoT Service bus Architecture (LISA), which fits inside the network stack of a small real-time operating system for constrained nodes. LISA provides a uniform application programming interface for an IoT system on a range of devices with variable resource constraints. It hides platform and protocol variations underneath it, thus facilitating interoperability in IoT implementations. LISA is inspired by the Network on Terminal Architecture, a service centric open architecture by Nokia Research Center. Unlike many other interoperability frameworks, LISA is designed specifically for resource constrained nodes and it provides essential features of a service bus for easy service oriented architecture implementation. The presented architecture utilizes an intermediate computing layer, a Fog layer, between the small nodes and the cloud, thereby facilitating the federation of constrained nodes into subnetworks. As a result of a modular and distributed design, the part of LISA running in the Fog layer handles the heavy lifting to assist the lightweight portion of LISA inside the resource constrained nodes. Furthermore, LISA introduces a new networking paradigm, Node Centric Networking, to route messages across protocol boundaries to facilitate interoperability. This thesis presents a concept implementation of the architecture and creates a foundation for future extension towards a comprehensive interoperability framework for IoT.

A arquitetura do sistema financeiro internacional contemporâneo

This paper discusses some features of financial institutions and instruments which originated the financial crisis triggered by increasing default rate, household real estate and financial asset depreciation combined with U.S. subprime mortgages. The first part presents major crisis events in a chronological order. The second part describes the interconnection of the institutions and markets which engendered a global shadow financial system. The third part focuses on an overview of measures taken by government authorities and large banks to bring about possible solutions for the global financial crisis.

A year after Crimea: continuity and change of Finnish-Russian relations reflected in the views of the government officials of Finland and Russia

This thesis discusses the dynamism of bilateral relations between Finland and Russia and their interconnection with wider EU-Russia relations in the sight of the recent conflict in Ukraine. In particular, incorporation of Crimea in the territory of Russia in March 2014 is believed to have triggered a series of disputes between the European Union and Russia and thus, have impacted the course of the bilateral Finnish-Russian relations. The study leans on a premise that there are some historical traditions and regularities in the Finnish foreign policy course towards Russia which make the bilateral Finnish-Russian relations special. These traditions are distinguished and described in the book “Russia Forever? Towards Pragmatism in Finnish/Russian relations” (2008) edited by H. Rytövuori-Apunen. Assuming that the featured traditions take place in modern relations between Finland and Russia, the aim of the thesis is to find out how these traditions reappear during the year shaped by the events in Ukraine. In order to do that, author follows the timeline of happenings around the Ukraine crisis starting with Crimea’s referendum on independence, and exams the way these events were commented on and evaluated by the key government officials and political institutions of Finland and Russia. The main focus is given to the Finnish official discourse on Russia during the study period. The data collection, consisting of mostly primary sources (ministerial press releases and comments, statements, speeches and blog posts of individual policy makers) is processed using the thematic analysis supported by the content analysis. The study reveals that the consequences of the Ukraine crisis have brought, among others, complications to the economic cooperation between Finland and Russia, and have stimulated the increased attention of the Finnish decision makers to the country’s security questions. As a result, the character and importance of some historical regularities of the Finnish foreign policies on Russia, like the Continental Dilemma, have taken new shape.

Disrupting heterosexual space? : the implementation of a campus Positive Space Campaign

Drawing on a growing literature on the interconnection of queer theory, sexuality and space, this thesis critically assesses the development, implementation and impact of a campus-based Positive Space Campaign aimed at raising the visibility and number of respectful, supportive, educational and welcoming spaces for lesbian, gay, bi, trans, two-spirited, queer and questioning (LGBTQ) students staff and faculty. The analysis, based on participatory action research (PAR), interrogates the extent to which the Positive Space Campaign challenges heteronormativity on campus. I contend that the Campaign, in its attempt to challenge dominant notions of sex, gender and sexuality, disrupts heterosexual space. Further, as I consider the meanings of 'queer', I consider the extent to which Positive Space Campaigns may be 'queering' space, by contributing to an 'imagined' campus space free of sexual and gender-based discrimination. The case study contributes to queer theory, the literature on sexuality and space, the literature on queer organizing in educational spaces and to broader queer organizing efforts in Canada.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.