A cyber security architecture for military networks using a cognitive network approach

Cyber security is one of the main topics that are discussed around the world today. The threat is real, and it is unlikely to diminish. People, business, governments, and even armed forces are networked in a way or another. Thus, the cyber threat is also facing military networking. On the other hand, the concept of Network Centric Warfare sets high requirements for military tactical data communications and security. A challenging networking environment and cyber threats force us to consider new approaches to build security on the military communication systems. The purpose of this thesis is to develop a cyber security architecture for military networks, and to evaluate the designed architecture. The architecture is described as a technical functionality. As a new approach, the thesis introduces Cognitive Networks (CN) which are a theoretical concept to build more intelligent, dynamic and even secure communication networks. The cognitive networks are capable of observe the networking environment, make decisions for optimal performance and adapt its system parameter according to the decisions. As a result, the thesis presents a five-layer cyber security architecture that consists of security elements controlled by a cognitive process. The proposed architecture includes the infrastructure, services and application layers that are managed and controlled by the cognitive and management layers. The architecture defines the tasks of the security elements at a functional level without introducing any new protocols or algorithms. For evaluating two separated method were used. The first method is based on the SABSA framework that uses a layered approach to analyze overall security of an organization. The second method was a scenario based method in which a risk severity level is calculated. The evaluation results show that the proposed architecture fulfills the security requirements at least at a high level. However, the evaluation of the proposed architecture proved to be very challenging. Thus, the evaluation results must be considered very critically. The thesis proves the cognitive networks are a promising approach, and they provide lots of benefits when designing a cyber security architecture for the tactical military networks. However, many implementation problems exist, and several details must be considered and studied during the future work.

The adjustment from Russia to Finland for corporate repatriates: How the repatriation experience influences readjustment in the workplace

To manage foreign operations, companies must often send their employees on international assignments. Repatriating these expatriates can be difficult because they have been forgotten during their posting, and their new experiences are not utilised. In addition to the possible difficulties in organisational repatriation, the returnee can suffer from readjustment problems after a lengthy stay abroad has changed their habits and even identity. This thesis examines the repatriation experience of Finnish assignees returning from Russia. The purpose of the study is to understand how the repatriation experience influences their readjustment to work in Finland. This experience is influenced by many factors including personal and situational changes, the repatriation process, job and organisational factors, and individual’s motives. The theoretical background of the study is founded on two models of repatriation adjustment. A refined, holistic theoretical framework for the study is created. It describes the formation of the repatriation experience and its importance for readjustment to work and retention. The qualitative research approach is suitable for the thesis which examines the returnees’ personal experiences and feelings: a qualitative case study aims to explain the phenomenon in-depth and comprehensively. The data was collected in summer 2013 through semi-standardised interviews with eight Finnish repatriates. They had returned from Russia within the last two years. The data was analysed by structuring the interview transcripts using template analysis. The results supported earlier literature and suggest that the re-entry remains a challenging phase for both the individual and the company. For some, adjusting to a new job was difficult for various reasons. The repatriates underwent personal change and development and felt it was for the better. Many repatriates criticised the company’s repatriation process upon return. Finding a suitable return job was not clear. Instead, the returnees had to be active in finding a new position. Many assignees had only modest career-related motives regarding the assignment and they had realistic expectations about the return. Therefore they were not extremely surprised or dissatisfied when they were not actively offered positions or support by the company. The significance of motives stood out even more than the theory predicted. As predicted, they are linked to the expectations of employees. Moreover, if the employees are motivated to remain in the company, they can tolerate partly a negative repatriation experience. Despite the complexity of the return and readjustment, the assignment as a whole was seen as a rewarding experience by all participants.

Multi-source ingestion of publisher articles - The SCOAP3 repository experience

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

Data Management [in eprints] for arts research: the experience at University of the Arts London

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

Islandora Sync: Enabling Administrators and Developers

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

Hacking User Experience in a Repository Service: ScholarSphere as a Case Study

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

Big Data Processing in the Cloud: a Hydra/Sufia Experience

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

Self-deposit, discovery, and delivery of scientific GIS datasets using GeoHydra

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

Current State of Repository Interoperability: Work by the Confederation of Open Access Repositories (COAR)

Panel 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

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Stiffness based trajectory planning and feedforward based vibration suppression control of parallel robot machines

The dissertation proposes two control strategies, which include the trajectory planning and vibration suppression, for a kinematic redundant serial-parallel robot machine, with the aim of attaining the satisfactory machining performance. For a given prescribed trajectory of the robot's end-effector in the Cartesian space, a set of trajectories in the robot's joint space are generated based on the best stiffness performance of the robot along the prescribed trajectory. To construct the required system-wide analytical stiffness model for the serial-parallel robot machine, a variant of the virtual joint method (VJM) is proposed in the dissertation. The modified method is an evolution of Gosselin's lumped model that can account for the deformations of a flexible link in more directions. The effectiveness of this VJM variant is validated by comparing the computed stiffness results of a flexible link with the those of a matrix structural analysis (MSA) method. The comparison shows that the numerical results from both methods on an individual flexible beam are almost identical, which, in some sense, provides mutual validation. The most prominent advantage of the presented VJM variant compared with the MSA method is that it can be applied in a flexible structure system with complicated kinematics formed in terms of flexible serial links and joints. Moreover, by combining the VJM variant and the virtual work principle, a systemwide analytical stiffness model can be easily obtained for mechanisms with both serial kinematics and parallel kinematics. In the dissertation, a system-wide stiffness model of a kinematic redundant serial-parallel robot machine is constructed based on integration of the VJM variant and the virtual work principle. Numerical results of its stiffness performance are reported. For a kinematic redundant robot, to generate a set of feasible joints' trajectories for a prescribed trajectory of its end-effector, its system-wide stiffness performance is taken as the constraint in the joints trajectory planning in the dissertation. For a prescribed location of the end-effector, the robot permits an infinite number of inverse solutions, which consequently yields infinite kinds of stiffness performance. Therefore, a differential evolution (DE) algorithm in which the positions of redundant joints in the kinematics are taken as input variables was employed to search for the best stiffness performance of the robot. Numerical results of the generated joint trajectories are given for a kinematic redundant serial-parallel robot machine, IWR (Intersector Welding/Cutting Robot), when a particular trajectory of its end-effector has been prescribed. The numerical results show that the joint trajectories generated based on the stiffness optimization are feasible for realization in the control system since they are acceptably smooth. The results imply that the stiffness performance of the robot machine deviates smoothly with respect to the kinematic configuration in the adjacent domain of its best stiffness performance. To suppress the vibration of the robot machine due to varying cutting force during the machining process, this dissertation proposed a feedforward control strategy, which is constructed based on the derived inverse dynamics model of target system. The effectiveness of applying such a feedforward control in the vibration suppression has been validated in a parallel manipulator in the software environment. The experimental study of such a feedforward control has also been included in the dissertation. The difficulties of modelling the actual system due to the unknown components in its dynamics is noticed. As a solution, a back propagation (BP) neural network is proposed for identification of the unknown components of the dynamics model of the target system. To train such a BP neural network, a modified Levenberg-Marquardt algorithm that can utilize an experimental input-output data set of the entire dynamic system is introduced in the dissertation. Validation of the BP neural network and the modified Levenberg- Marquardt algorithm is done, respectively, by a sinusoidal output approximation, a second order system parameters estimation, and a friction model estimation of a parallel manipulator, which represent three different application aspects of this method.

Rakennettu areenatähteys. Rock-konsertti globalisoituvana mediaspektaakkelina 1965-2013

Kulttuurihistorian alaan kuuluva artikkeliväitöskirja edustaa populaarikulttuurin ja tarkemmin populaarimusiikin tutkimusta kiinnittyen ennen muuta audiovisuaalisen mediakulttuurin muutokseen 1960-luvulta tähän päivään. Väitöskirja käsittelee Pink Floydin, The Rolling Stonesin, U2:n ja Peter Gabrielin areenakonserttikiertueita ja kyseisten kiertueiden lavasuunnittelijoiden Mark Fisherin ja Robert Lepagen toimintaa. Tutkimus tarkastelee, miten jättiläismäiset mediaspektaakkelit saivat alkunsa, ammattimaistuivat ja globalisoituivat vuosien 1965–2013 välillä. Analyysin kohteena on se, miten ne rakentuivat ja toisaalta rakensivat areenatähteyttä sekä uudistivat audiovisuaalista kulttuuria. Konserttien avainkohtia ja populaarijulkisia aineistoja hermeneuttisesti tulkiten ja lähilukien sekä historiallisesti kontekstoiden tutkimus rakentaa kulttuurihistoriallisen kokonaistulkinnan viihdeteollisuuden mahtipontiseksi muotoutuneen ilmiön tuotannosta. Tutkimuksen lähtökohtana on populaarimusiikkitähden vaikutus 1900-luvun jälkipuoliskon ja 2000-luvun alun massamediassa ja kulttuurissa. Tarkastelemalla areenarockin mediaspektaakkeleiden kulttuurihistoriaa tutkimus ottaa kantaa niihin kaupallisiin, teknologisiin ja poliittisiin muutoksiin, jotka ovat viimeisen viidenkymmenen vuoden aikana mahdollistaneet tähteyden globaalia leviämistä. Tämän muutoksen seurauksena lähes kenestä tahansa voi tulla tähti ja lähes mistä tahansa kulttuuri-ilmiöstä voi tulla populaaria. Mutta vain jotkut tähdet ja yhtyeet esiintyvät täysille areenoille. Areenakonsertit ovatkin tähteysilmiön keskeisiä huipentumia, globaalin viihdekulttuurin äärimmäisiä manifestaatioita. Nykyiset areenoilla tapahtuvat mediaspektaakkelit ovat monimutkaista audiovisuaalista musiikkiteatteria, jossa kaikkien esityksen elementtien – teatraalisten ja audiovisuaalisten efektien – tulee olla mahdollisimman suuria ja taitavasti rytmitettyjä. Mediaspektaakkelien analyysissa tulee erityisesti kohdistaa huomio erilaisten medioiden suhteisiin sekä kysymykseen siitä, miten suuri osa audiovisuaalista konserttikokemusta itse asiassa on ennalta rakennettua ja nauhoitettua. Lavasuunnittelu yhdistää esiintyjän teatraaliset eleet ja esiintymisen laajempaan audiovisuaaliseen ja ennalta mietittyyn temaattiseen kokonaisuuteen. Tähän kuuluvat suurten konserttilavojen kertakäyttöarkkitehtuuri, valon ja pintojen yhdistäminen populaariin kuvastoon sekä itse teoksien audiovisuaalisen kerronnan historiallisiin ja nostalgisiin viitteisiin.

User Experience of Geocaching and Its Application to Tourism and Education

Advances in technology have provided new ways of using entertainment and game technology to foster human interaction. Games and playing with games have always been an important part of people’s everyday lives. Traditionally, human-computer interaction (HCI) research was seen as a psychological cognitive science focused on human factors, with engineering sciences as the computer science part of it. Although cognitive science has made significant progress over the past decade, the influence of people’s emotions on design networks is increasingly important, especially when the primary goal is to challenge and entertain users (Norman 2002). Game developers have explored the key issues in game design and identified that the driving force in the success of games is user experience. User-centered design integrates knowledge of users’ activity practices, needs, and preferences into the design process. Geocaching is a location-based treasure hunt game created by a community of players. Players use GPS (Global Position System) technology to find “treasures” and create their own geocaches; the game can be developed when the players invent caches and used more imagination to creations the caches. This doctoral dissertation explores user experience of geocaching and its applications in tourism and education. Globally, based on the Geocaching.com webpage, geocaching has been played about 180 countries and there are more than 10 million registered geocachers worldwide (Geocaching.com, 25.11.2014). This dissertation develops and presents an interaction model called the GameFlow Experience model that can be used to support the design of treasure hunt applications in tourism and education contexts. The GameFlow Model presents and clarifies various experiences; it provides such experiences in a real-life context, offers desirable design targets to be utilized in service design, and offers a perspective to consider when evaluating the success of adventure game concepts. User-centered game designs have adapted to human factor research in mainstream computing science. For many years, the user-centered design approach has been the most important research field in software development. Research has been focusing on user-centered design in software development such as office programs, but the same ideas and theories that will reflect the needs of a user-centered research are now also being applied to game design (Charles et al. 2005.) For several years, we have seen a growing interest in user experience design. Digital games are experience providers, and game developers need tools to better understand the user experience related to products and services they have created. This thesis aims to present what the user experience is in geocaching and treasure hunt games and how it can be used to develop new concepts for the treasure hunt. Engineers, designers, and researchers should have a clear understanding of what user experience is, what its parts are, and most importantly, how we can influence user satisfaction. In addition, we need to understand how users interact with electronic products and people, and how different elements synergize their experiences. This doctoral dissertation represents pioneering work on the user experience of geocaching and treasure hunt games in the context of tourism and education. The research also provides a model for game developers who are planning treasure hunt concepts.

Implementing Green IT approach for transferring Big Data over Parallel Data Link

The whole research of the current Master Thesis project is related to Big Data transfer over Parallel Data Link and my main objective is to assist the Saint-Petersburg National Research University ITMO research team to accomplish this project and apply Green IT methods for the data transfer system. The goal of the team is to transfer Big Data by using parallel data links with SDN Openflow approach. My task as a team member was to compare existing data transfer applications in case to verify which results the highest data transfer speed in which occasions and explain the reasons. In the context of this thesis work a comparison between 5 different utilities was done, which including Fast Data Transfer (FDT), BBCP, BBFTP, GridFTP, and FTS3. A number of scripts where developed which consist of creating random binary data to be incompressible to have fair comparison between utilities, execute the Utilities with specified parameters, create log files, results, system parameters, and plot graphs to compare the results. Transferring such an enormous variety of data can take a long time, and hence, the necessity appears to reduce the energy consumption to make them greener. In the context of Green IT approach, our team used Cloud Computing infrastructure called OpenStack. It’s more efficient to allocated specific amount of hardware resources to test different scenarios rather than using the whole resources from our testbed. Testing our implementation with OpenStack infrastructure results that the virtual channel does not consist of any traffic and we can achieve the highest possible throughput. After receiving the final results we are in place to identify which utilities produce faster data transfer in different scenarios with specific TCP parameters and we can use them in real network data links.