Target Cell Topography and Cytoskeletal Reorganization in Natural Killer Cell Activity

The immune system has to recognize and destroy abnormal or infected cells to maintain homeostasis. Natural killer (NK) cells directly recognize and kill transformed or virus-infected cells without prior sensitization. We have studied both virus-infected and tumor cells in order to identify the target structures involved in triggering NK activity. Mouse/human cell hybrids containing various human chromosomes were used as targets. The human chromosome responsible for activating NK cell killing was identified to chromosome number 6. The results suggest that activated NK cells recognize ligands that are encoded on human chromosome 6. We showed that the ligand on the target cell side was intercellular adhesion molecule 2 (ICAM-2). There was no difference in the level of expression of ICAM-2, however, but a drastic difference was seen in the distribution of the molecule: ICAM-2 was evenly distributed on the surface of the NK-resistant cells, but almost totally redistributed to the tip of uropods, bud-like extensions, which were absent from the parental cells. Interestingly, the gene coding for cytoskeletal linker protein ezrin has been localized to human chromosome 6, and there was a colocalization of ezrin and ICAM-2 in the uropods. Furthermore, the transfected human ezrin into NK cell-resistant cells induced uropod formation, ICAM-2 and ezrin redistribution to newly formed uropods, and sensitized target cells to NK cell killing. These data reveal a novel form of NK cell recognition: target structures are already present on normal cells; they become detectable only after abnormal redistribution into hot spots on the target cell membrane. NK cells are central players in the defence against virus infections. They inhibit the spread of infection, allowing time for specific immune responses to develop. The virus-proteins that directly activate human NK cell killing are largely unknown. We studied the sensitivity of virus-specific early proteins of Semliki Forest virus (SFV) to NK killing. The viral non-structural proteins (nsP1-4) translated early in the virus cycle were transfected in NK-resistant cells. Viral early gene nsP1 alone efficiently sensitized target cells to NK activity, and the tight membrane association of nsP1 seems to be critical in the triggering of NK killing. NsP1 protein colocalized with (redistributed) ezrin in filopodia-like structures to which the NK cells were bound. The results suggest that also in viral infections NK cells react to rapid changes in membrane topography. Based on the results of this thesis, a new model of target cell recognition of NK cells can be suggested: reorganization of the cytoskeleton induces alterations in cell surface topography, and this new pattern of surface molecules is recognized as "altered-self".

From challenges to activities: Categories of play in videogames

Creating better gameplay experiences is dependent upon understand the act of gameplay. An expert focus group of games researchers, designers and players refined 16 activity categories from an existing list of 30 commonly used videogame challenges. Identifying categories of play activities has future potential to facilitate better research design and game design.

Engaging in videogame play: An activity-centric analysis of the player experience

This paper focuses on examining play activities in people's favourite videogame experience. Through interviews with 30 videogame players we discovered which types of play activities are most appealing. Our research identifies the level of appeal of a wide range of game play activities. We have established that high levels of engagement for many participants is grounded in play as power and play as strategy, with play as fantasy adding to the experience. Through our study we established that conflict-based activities hold strong appeal. We subsequently investigated the context in which players talked about their experience of conflict within game. By using activities as a categorisation of gameplay we have been able to capture the play experience across a range of games and a range of gaming contexts. By examining players' individual experience we begin to understand why conflict in videogames appears to be a popular choice of activities.

Hakoah men's soccer team at a game against Graz Hasair; Vienna Portraits Men

Score 2:1 Hakoah; Names of players with numbers handwritten on verso

What does the future hold for our traditional department stores?

Years of buy-outs, takeovers, mergers and rebranding have whittled a once plentiful landscape of department store competitors down to two major players, Myer and David Jones. Now, despite David Jones confirming it refused a potential A$3 billion merger proposal approach from its arch-competitor in October 2013, we must face the distinct possibility of there only being room for one, full line, up-market department store in Australia.

How your shopping choices will help Coles and Woolworths take on the banks

The days when Coles and Woolworths only sold groceries are long gone. Both are now established players in a broad range of consumer markets, with interests in liquor and hotels, fuel and convenience, general merchandise and mobile phones. With a network of over 1,600 supermarkets, 1,100 service stations, 2,200 liquor stores and nearly 400 hotels, the supermarket duo are now getting ready for a war with Australia’s big four banks.

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

On Games on Non-Wellfounded Sets and Stationary Sets

In this thesis we study a few games related to non-wellfounded and stationary sets. Games have turned out to be an important tool in mathematical logic ranging from semantic games defining the truth of a sentence in a given logic to for example games on real numbers whose determinacies have important effects on the consistency of certain large cardinal assumptions. The equality of non-wellfounded sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on stationary sets moving back to classical wellfounded set theory. We also describe a way to approximate non-wellfounded sets with hereditarily finite wellfounded sets. The framework used to do this is domain theory. In the Banach-Mazur game, also called the ideal game, the players play a descending sequence of stationary sets and the second player tries to keep their intersection stationary. The game is connected to precipitousness of the corresponding ideal. In the pressing down game first player plays regressive functions defined on stationary sets and the second player responds with a stationary set where the function is constant trying to keep the intersection stationary. This game has applications in model theory to the determinacy of the Ehrenfeucht-Fraisse game. We show that it is consistent that these games are not equivalent.

Inventing the Future: Intellectual Property and 3D Printing

A new technology – 3D printing – has the potential to make radical changes to aspects of the way in which we live. Put simply, it allows people to download designs and turn them into physical objects by laying down successive layers of material. Replacements or parts for household objects such as toys, utensils and gadgets could become available at the press of a button. With this innovation, however, comes the need to consider impacts on a wide range of forms of intellectual property, as Dr Matthew Rimmer explains. 3D Printing is the latest in a long line of disruptive technologies – including photocopiers, cassette recorders, MP3 players, personal computers, peer to peer networks, and wikis – which have challenged intellectual property laws, policies, practices, and norms. As The Economist has observed, ‘Tinkerers with machines that turn binary digits into molecules are pioneering a whole new way of making things—one that could well rewrite the rules of manufacturing in much the same way as the PC trashed the traditional world of computing.’

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

Planar pursuit-evasion with variable speeds, part 2, barrier sections

An iterative method of constructing sections of the game surfaces from the players'' extremal trajectory maps is discussed. Barrier sections are presented for aircraft pursuit-evasion at constant altitude, with one aircraft flying at sustained speed and the other varying its speed.

Computational Techniques for Haplotype Inference and for Local Alignment Significance

This thesis which consists of an introduction and four peer-reviewed original publications studies the problems of haplotype inference (haplotyping) and local alignment significance. The problems studied here belong to the broad area of bioinformatics and computational biology. The presented solutions are computationally fast and accurate, which makes them practical in high-throughput sequence data analysis. Haplotype inference is a computational problem where the goal is to estimate haplotypes from a sample of genotypes as accurately as possible. This problem is important as the direct measurement of haplotypes is difficult, whereas the genotypes are easier to quantify. Haplotypes are the key-players when studying for example the genetic causes of diseases. In this thesis, three methods are presented for the haplotype inference problem referred to as HaploParser, HIT, and BACH. HaploParser is based on a combinatorial mosaic model and hierarchical parsing that together mimic recombinations and point-mutations in a biologically plausible way. In this mosaic model, the current population is assumed to be evolved from a small founder population. Thus, the haplotypes of the current population are recombinations of the (implicit) founder haplotypes with some point--mutations. HIT (Haplotype Inference Technique) uses a hidden Markov model for haplotypes and efficient algorithms are presented to learn this model from genotype data. The model structure of HIT is analogous to the mosaic model of HaploParser with founder haplotypes. Therefore, it can be seen as a probabilistic model of recombinations and point-mutations. BACH (Bayesian Context-based Haplotyping) utilizes a context tree weighting algorithm to efficiently sum over all variable-length Markov chains to evaluate the posterior probability of a haplotype configuration. Algorithms are presented that find haplotype configurations with high posterior probability. BACH is the most accurate method presented in this thesis and has comparable performance to the best available software for haplotype inference. Local alignment significance is a computational problem where one is interested in whether the local similarities in two sequences are due to the fact that the sequences are related or just by chance. Similarity of sequences is measured by their best local alignment score and from that, a p-value is computed. This p-value is the probability of picking two sequences from the null model that have as good or better best local alignment score. Local alignment significance is used routinely for example in homology searches. In this thesis, a general framework is sketched that allows one to compute a tight upper bound for the p-value of a local pairwise alignment score. Unlike the previous methods, the presented framework is not affeced by so-called edge-effects and can handle gaps (deletions and insertions) without troublesome sampling and curve fitting.

AndroMedia - Towards a Context-aware Mobile Music Recommender

Portable music players have made it possible to listen to a personal collection of music in almost every situation, and they are often used during some activity to provide a stimulating audio environment. Studies have demonstrated the effects of music on the human body and mind, indicating that selecting music according to situation can, besides making the situation more enjoyable, also make humans perform better. For example, music can boost performance during physical exercises, alleviate stress and positively affect learning. We believe that people intuitively select different types of music for different situations. Based on this hypothesis, we propose a portable music player, AndroMedia, designed to provide personalised music recommendations using the user’s current context and listening habits together with other user’s situational listening patterns. We have developed a prototype that consists of a central server and a PDA client. The client uses Bluetooth sensors to acquire context information and logs user interaction to infer implicit user feedback. The user interface also allows the user to give explicit feedback. Large user interface elements facilitate touch-based usage in busy environments. The prototype provides the necessary framework for using the collected information together with other user’s listening history in a context- enhanced collaborative filtering algorithm to generate context-sensitive recommendations. The current implementation is limited to using traditional collaborative filtering algorithms. We outline the techniques required to create context-aware recommendations and present a survey on mobile context-aware music recommenders found in literature. As opposed to the explored systems, AndroMedia utilises other users’ listening habits when suggesting tunes, and does not require any laborious set up processes.

Feature - No pain, no gain: Pleasure and suffering in technologies of leidenschaft

Training for bodybuilding competition is clearly a serious business that inflicts serious demands on the competitor. Not only did Francis commit time and money to compete, but he also arguably put winning before his physical well-being—enduring pain and suffering from his injury. Bodybuilding may seem like an extreme example, but it is not the only activity in which people suffer in pursuit of their goals. Boxers fight each other in the ring; soccer players risk knee and ankle injuries, sometimes playing despite being hurt; and mountaineers risk their lives in dangerous climbs. In the arts there are many examples of people suffering to achieve their goals: Beethoven kept composing, conducting, and performing despite his hearing loss; van Gogh grappled with depression but kept painting, finding fame only posthumously; and Mozart lived the final years of his life impoverished but still composing. These examples show that many great achievements come at a price: severe suffering...

Tiedon jakaminen tiimityössä

Knowledge-sharing in a teamwork The study examines the link between knowledge-sharing that takes place in a team and the dimensions and objectives of the team s activities. The question the study poses is: How does knowledge-sharing in a team relate to the team s activities? The exchange of knowledge is examined using knowledge-sharing networks and the conversion model, which describes the process of knowledge formation. The answer to the question is sought through four empirical articles describing the activities of a team from the viewpoint of quality, fairness, power related to knowledge management, and performance. One of the articles used in the study describes the role of networks in work life more generally. It attempts to shed light on the manner in which team-related networks operate as part of a more extensive structure of organizational networks. Finland is one of the most eager users of teamwork, if numbers are used as a yardstick. About half of all Finnish wage earners worked in teams in 2009, and comparisons show that the use of teams in Finland is above the EU average. This study focuses on so-called semi-autonomous teams, which carry out permanent work tasks. In such teams, tasks are interdependent, and teams are jointly responsible for ensuring that the work is done. Team members may also, at least to some extent, agree between themselves on how the tasks are carried out and are able to take part in the decision-making process. Such teamwork makes knowledge-sharing an important element for the team s activities. Knowledge and knowledge-sharing have become a major resource, allowing organizations to operate and even compete in today s increasingly competitive markets. A single team or a single organization cannot, however, possess all the knowledge required for carrying out the tasks assigned to it. Although it is difficult to copy the knowledge generated in an organization, it is important to share the knowledge within and between organizations. External links supply teams and organizations with important knowledge that allows them to keep their operations up-to-date and their structures well-functioning. In fact, knowledge provides teams and organizations with an intangible resource that improves their capacity to interact with their environment and to adjust to it. For this reason, it is important to examine both the internal and external knowledge-sharing taking place in a team. The findings of the study show that in terms of quality, fairness, performance and the knowledge management issues concerning a team, its social network structure is both internally and externally connected with its activities. A team structure that is internally coherent and at the same time open to external contacts, is, with certain restrictions, connected with the quality, fairness, and performance of the team. The restrictions concern differences between procedural and interactional justice, public and private sectors, and the team leaders and ordinary team members. The role of the team leader is closely connected with the management of networks that are considered valuable. The results of the study indicate that teamwork is supervisor-dominated. Thus, teamwork does not substantially strengthen the influence of individual employees as players in knowledge-transfer networks. However, ordinary team members possess important peer contacts inside the organization. Teamwork clearly allows employees to interact in a democratic manner, and here the transfer of tacit knowledge plays an important role. Keywords: teamwork, knowledge-sharing, social networks, organization