Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

Composition operators on vector-valued BMOA and related function spaces

A composition operator is a linear operator between spaces of analytic or harmonic functions on the unit disk, which precomposes a function with a fixed self-map of the disk. A fundamental problem is to relate properties of a composition operator to the function-theoretic properties of the self-map. During the recent decades these operators have been very actively studied in connection with various function spaces. The study of composition operators lies in the intersection of two central fields of mathematical analysis; function theory and operator theory. This thesis consists of four research articles and an overview. In the first three articles the weak compactness of composition operators is studied on certain vector-valued function spaces. A vector-valued function takes its values in some complex Banach space. In the first and third article sufficient conditions are given for a composition operator to be weakly compact on different versions of vector-valued BMOA spaces. In the second article characterizations are given for the weak compactness of a composition operator on harmonic Hardy spaces and spaces of Cauchy transforms, provided the functions take values in a reflexive Banach space. Composition operators are also considered on certain weak versions of the above function spaces. In addition, the relationship of different vector-valued function spaces is analyzed. In the fourth article weighted composition operators are studied on the scalar-valued BMOA space and its subspace VMOA. A weighted composition operator is obtained by first applying a composition operator and then a pointwise multiplier. A complete characterization is given for the boundedness and compactness of a weighted composition operator on BMOA and VMOA. Moreover, the essential norm of a weighted composition operator on VMOA is estimated. These results generalize many previously known results about composition operators and pointwise multipliers on these spaces.

Aspects of atomic decompositions and Bergman projections

The concept of an atomic decomposition was introduced by Coifman and Rochberg (1980) for weighted Bergman spaces on the unit disk. By the Riemann mapping theorem, functions in every simply connected domain in the complex plane have an atomic decomposition. However, a decomposition resulting from a conformal mapping of the unit disk tends to be very implicit and often lacks a clear connection to the geometry of the domain that it has been mapped into. The lattice of points, where the atoms of the decomposition are evaluated, usually follows the geometry of the original domain, but after mapping the domain into another this connection is easily lost and the layout of points becomes seemingly random. In the first article we construct an atomic decomposition directly on a weighted Bergman space on a class of regulated, simply connected domains. The construction uses the geometric properties of the regulated domain, but does not explicitly involve any conformal Riemann map from the unit disk. It is known that the Bergman projection is not bounded on the space L-infinity of bounded measurable functions. Taskinen (2004) introduced the locally convex spaces LV-infinity consisting of measurable and HV-infinity of analytic functions on the unit disk with the latter being a closed subspace of the former. They have the property that the Bergman projection is continuous from LV-infinity onto HV-infinity and, in some sense, the space HV-infinity is the smallest possible substitute to the space H-infinity of analytic functions. In the second article we extend the above result to a smoothly bounded strictly pseudoconvex domain. Here the related reproducing kernels are usually not known explicitly, and thus the proof of continuity of the Bergman projection is based on generalised Forelli-Rudin estimates instead of integral representations. The minimality of the space LV-infinity is shown by using peaking functions first constructed by Bell (1981). Taskinen (2003) showed that on the unit disk the space HV-infinity admits an atomic decomposition. This result is generalised in the third article by constructing an atomic decomposition for the space HV-infinity on a smoothly bounded strictly pseudoconvex domain. In this case every function can be presented as a linear combination of atoms such that the coefficient sequence belongs to a suitable Köthe co-echelon space.

Novel insights on functions of myotilin/palladin family members

Poikkijuovaisen luuranko- ja sydänlihaksen supistumisyksikkö, sarkomeeri, koostuu tarkoin järjestyneistä aktiini- ja myosiinisäikeistä. Rakenne eroaa muista solutyypeistä, joissa aktiinisäikeistö muovautuu jatkuvasti ja sen järjestyminen säätelee solun muotoa, solujakautumista, soluliikettä ja solunsisäisten organellien kuljetusta. Myotilin, palladin ja myopalladin kuuluvat proteiiniperheeseen, jonka yhteispiirteenä ovat immunoglobuliinin kaltaiset (Igl) domeenit. Proteiinit liittyvät aktiinitukirankaan ja niiden arvellaan toimivan solutukirangan rakenne-elementteinä ja säätelijöinä. Myotilinia ja myopalladinia ilmennetään poikkijuovaisessa lihaksessa. Sen sijaan palladinin eri silmukointimuotoja tavataan monissa kudostyypeissä kuten hermostossa, ja eri muodoilla saattaa olla solutyypistä riippuvia tehtäviä. Poikkijuovaisessa lihaksessa kaikki perheen jäsenet sijaitsevat aktiinisäikeitä yhdistävässä Z-levyssä ja ne sitovat Z-levyn rakenneproteiinia, -aktiniinia. Myotilingeenin pistemutaatiot johtavat periytyviin lihastauteihin, kun taas palladinin mutaatioiden on kuvattu liittyvän periytyvään haimasyöpään ja lisääntyneeseen sydäninfarktin riskiin. Tässä tutkimuksessa selvitettin myotilinin ja pallainin toimintaa. Kokeissa löydettiin uusia palladinin 90-92kDa alatyyppiin sitoutuvia proteiineja. Yksi niistä on aktiinidynamiikkaa säätelevä profilin. Profilinilla on kahdenlaisia tehtäviä; se edesauttaa aktiinisäikeiden muodostumista, mutta se voi myös eristää yksittäisiä aktiinimolekyylejä ja edistää säikeiden hajoamista. Solutasolla palladinin ja profilinin sijainti on yhtenevä runsaasti aktiinia sisältävillä solujen reuna-alueilla. Palladinin ja profilinin sidos on heikko ja hyvin dynaaminen, joka sopii palladinin tehtävään aktiinisäideiden muodostumisen koordinoijana. Toinen palladinin sitoutumiskumppani on aktiinisäikeitä yhteensitova -aktiniini. -Aktiniini liittää solutukirangan solukalvon proteiineihin ja ankkuroi solunsisäisiä viestintämolekyylejä. Sitoutumista välittävä alue on hyvin samankaltainen palladinissa ja myotilinissa. Luurankolihaksen liiallinen toistuva venytys muuttaa Z-levyjen rakennetta ja muotoa. Prosessin aikana syntyy uusia aktiinifilamenttejä sisältäviä tiivistymiä ja lopulta uusia sarkomeereja. Löydöstemme perusteella myotilinin uudelleenjärjestyminen noudattaa aktiinin muutoksia. Tämä viittaa siihen, että myotilin liittää yhteen uudismuodostuvia aktiinisäikeitä ja vakauttaa niitä. Myotilin saattaa myös ankkuroida viesti- tai rakennemolekyylejä, joiden tehtävänä on edesauttaa Z-levyjen uudismuodostusta. Tulostemme perusteella arvelemme, että myotilin toimii Z-levyjen rakenteen vakaajana ja aktiinisäikeiden säätelijänä. Palladinin puute johtaa sikiöaikaiseen kuolemaan hiirillä, mutta myotilinin puutoksella ei ole samanlaisia vaikutuksia. Tuotettujen myotilin poistogeenisten hiirten todetiin syntyvän ja kehittyvän normaalisti eikä niillä esiintynyt rakenteellisia tai toiminnallisia häiriöitä. Toisaalta aiemmissa kokeissa, joissa hiirille on siirretty ihmisen lihastautia aikaansaava myotilingeeni, nähdään samankaltaisia kuin sairailla ihmisillä. Näin ollen muuntunut myotilin näyttä olevan lihaksen toiminnalle haitallisempi kuin myotilinin puute. Myotilinin ja palladinin yhteisvaikutusta selvittääksemme risteytimme myotilin poistegeenisen hiiren ja hiirilinjan, joka ilmentää puutteellisesti palladinin 200 kDa muotoa. Puutteellisesti 200 kDa palladinia ilmentävien hiirten sydänlihaksessa todettiin vähäisiä hienorakenteen muutoksia, mutta risteytetyillä hiirillä tavattiin rakenteellisia ja toiminnallisia muutoksia myös luurankolihaksessa. Tulosten perusteella voidaan todeta, että palladinin 200 kDa muoto säätelee sydänlihassolujen rakennetta. Luurankolihaksessa sen sijaan myotilinilla ja palladinilla näyttäisi olevan päällekkäisiä tehtäviä.

Composition operators, Aleksandrov measures and value distribution of analytic maps in the unit disc

A composition operator is a linear operator that precomposes any given function with another function, which is held fixed and called the symbol of the composition operator. This dissertation studies such operators and questions related to their theory in the case when the functions to be composed are analytic in the unit disc of the complex plane. Thus the subject of the dissertation lies at the intersection of analytic function theory and operator theory. The work contains three research articles. The first article is concerned with the value distribution of analytic functions. In the literature there are two different conditions which characterize when a composition operator is compact on the Hardy spaces of the unit disc. One condition is in terms of the classical Nevanlinna counting function, defined inside the disc, and the other condition involves a family of certain measures called the Aleksandrov (or Clark) measures and supported on the boundary of the disc. The article explains the connection between these two approaches from a function-theoretic point of view. It is shown that the Aleksandrov measures can be interpreted as kinds of boundary limits of the Nevanlinna counting function as one approaches the boundary from within the disc. The other two articles investigate the compactness properties of the difference of two composition operators, which is beneficial for understanding the structure of the set of all composition operators. The second article considers this question on the Hardy and related spaces of the disc, and employs Aleksandrov measures as its main tool. The results obtained generalize those existing for the case of a single composition operator. However, there are some peculiarities which do not occur in the theory of a single operator. The third article studies the compactness of the difference operator on the Bloch and Lipschitz spaces, improving and extending results given in the previous literature. Moreover, in this connection one obtains a general result which characterizes the compactness and weak compactness of the difference of two weighted composition operators on certain weighted Hardy-type spaces.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Interactions and turnover of the muscular dystrophy protein myotilin

The striated muscle sarcomere is a force generating and transducing unit as well as an important sensor of extracellular cues and a coordinator of cellular signals. The borders of individual sarcomeres are formed by the Z-disks. The Z-disk component myotilin interacts with Z-disk core structural proteins and with regulators of signaling cascades. Missense mutations in the gene encoding myotilin cause dominantly inherited muscle disorders, myotilinopathies, by an unknown mechanism. In this thesis the functions of myotilin were further characterized to clarify the molecular biological basis and the pathogenetic mechanisms of inherited muscle disorders, mainly caused by mutated myotilin. Myotilin has an important function in the assembly and maintenance of the Z-disks probably through its actin-organizing properties. Our results show that the Ig-domains of myotilin are needed for both binding and bundling actin and define the Ig domains as actin-binding modules. The disease-causing mutations appear not to change the interplay between actin and myotilin. Interactions between Z-disk proteins regulate muscle functions and disruption of these interactions results in muscle disorders. Mutations in Z-disk components myotilin, ZASP/Cypher and FATZ-2 (calsarcin-1/myozenin-2) are associated with myopathies. We showed that proteins from the myotilin and FATZ families interact via a novel and unique type of class III PDZ binding motif with the PDZ domains of ZASP and other Enigma family members and that the interactions can be modulated by phosphorylation. The morphological findings typical of myotilinopathies include Z-disk alterations and aggregation of dense filamentous material. The causes and mechanisms of protein aggregation in myotilinopathy patients are unknown, but impaired degradation might explain in part the abnormal protein accumulation. We showed that myotilin is degraded by the calcium-dependent, non-lysosomal cysteine protease calpain and by the proteasome pathway, and that wild type and mutant myotilin differ in their sensitivity to degradation. These studies identify the first functional difference between mutated and wild type myotilin. Furthermore, if degradation of myotilin is disturbed, it accumulates in cells in a manner resembling that seen in myotilinopathy patients. Based on the results, we propose a model where mutant myotilin escapes proteolytic breakdown and forms protein aggregates, leading to disruption of myofibrils and muscular dystrophy. In conclusion, the main results of this study demonstrate that myotilin is a Z-disk structural protein interacting with several Z-disk components. The turnover of myotilin is regulated by calpain and the ubiquitin proteasome system and mutations in myotilin seem to affect the degradation of myotilin, leading to protein accumulations in cells. These findings are important for understanding myotilin-linked muscle diseases and designing treatments for these disorders.

New approaches to improve the cord blood unit hematopoietic progenitor cell content

Cord blood is a well-established alternative to bone marrow and peripheral blood stem cell transplantation. To this day, over 400 000 unrelated donor cord blood units have been stored in cord blood banks worldwide. To enable successful cord blood transplantation, recent efforts have been focused on finding ways to increase the hematopoietic progenitor cell content of cord blood units. In this study, factors that may improve the selection and quality of cord blood collections for banking were identified. In 167 consecutive cord blood units collected from healthy full-term neonates and processed at a national cord blood bank, mean platelet volume (MPV) correlated with the numbers of cord blood unit hematopoietic progenitors (CD34+ cells and colony-forming units); this is a novel finding. Mean platelet volume can be thought to represent general hematopoietic activity, as newly formed platelets have been reported to be large. Stress during delivery is hypothesized to lead to the mobilization of hematopoietic progenitor cells through cytokine stimulation. Accordingly, low-normal umbilical arterial pH, thought to be associated with perinatal stress, correlated with high cord blood unit CD34+ cell and colony-forming unit numbers. The associations were closer in vaginal deliveries than in Cesarean sections. Vaginal delivery entails specific physiological changes, which may also affect the hematopoietic system. Thus, different factors may predict cord blood hematopoietic progenitor cell numbers in the two modes of delivery. Theoretical models were created to enable the use of platelet characteristics (mean platelet volume) and perinatal factors (umbilical arterial pH and placental weight) in the selection of cord blood collections with high hematopoietic progenitor cell counts. These observations could thus be implemented as a part of the evaluation of cord blood collections for banking. The quality of cord blood units has been the focus of several recent studies. However, hemostasis activation during cord blood collection is scarcely evaluated in cord blood banks. In this study, hemostasis activation was assessed with prothrombin activation fragment 1+2 (F1+2), a direct indicator of thrombin generation, and platelet factor 4 (PF4), indicating platelet activation. Altogether three sample series were collected during the set-up of the cord blood bank as well as after changes in personnel and collection equipment. The activation decreased from the first to the subsequent series, which were collected with the bank fully in operation and following international standards, and was at a level similar to that previously reported for healthy neonates. As hemostasis activation may have unwanted effects on cord blood cell contents, it should be minimized. The assessment of hemostasis activation could be implemented as a part of process control in cord blood banks. Culture assays provide information about the hematopoietic potential of the cord blood unit. In processed cord blood units prior to freezing, megakaryocytic colony growth was evaluated in semisolid cultures with a novel scoring system. Three investigators analyzed the colony assays, and the scores were highly concordant. With such scoring systems, the growth potential of various cord blood cell lineages can be assessed. In addition, erythroid cells were observed in liquid cultures of cryostored and thawed, unseparated cord blood units without exogenous erythropoietin. This was hypothesized to be due to the erythropoietic effect of thrombopoietin, endogenous erythropoietin production, and diverse cell-cell interactions in the culture. This observation underscores the complex interactions of cytokines and supporting cells in the heterogeneous cell population of the thawed cord blood unit.

United We Stand - Divided We Fall : A Standard Model of Unit Cohesion

Research on unit cohesion has shown positive correlations between cohesion and valued outcomes such as strong performance, reduced stress, less indiscipline, and high re-enlistment intentions. However, the correlations have varied in strength and significance. The purpose of this study is to show that taking into consideration the multi-component nature of cohesion and relating the most applicable components to specific outcomes could resolve much of the inconsistency. Unit cohesion is understood as a process of social integration among members of a primary group with its leaders, and with the larger secondary groups of which they are a part. Correspondingly, included in the framework are four bonding components: horizontal (peer) and vertical (subordinate and leader) and organizational and institutional, respectively. The data were collected as part of a larger research project on cohesion, leadership, and personal adjustment to the military. In all, 1,534 conscripts responded to four questionnaires during their service in 2001-2002. In addition, sociometric questionnaires were given to 537 group members in 47 squads toward the end of their service. The results showed that platoons with strong primary-group cohesion differed from other platoons in terms of performance, training quality, secondary-group experiences, and attitudes toward refresher training. On the sociometric level it was found that soldiers who were chosen as friends by others were more likely to have higher expected performance, better performance ratings, more positive attitudes toward military service, higher levels of well-being during conscript service, and fewer exemptions from duty during it. On the group level, the selection of the respondents own group leader rather than naming a leader from outside (i.e., leader bonding) had a bearing not only on cohesion and performance, but also on the social, attitudinal, and behavioral criteria. Overall, the aim of the study was to contribute to the research on cohesion by introducing a model that takes into account the primary foci of bonding and their impact. The results imply that primary-group and secondary-group bonding processes are equally influential in explaining individual and group performance, whereas the secondary-group bonding components are far superior in explaining career intentions, personal growth, avoidance of duty, and attitudes toward refresher training and national defense. This should be considered in the planning and conducting of training. The main conclusion is that the different types of cohesion components have a unique, positive, significant, but varying impact on a wide range of criteria, confirming the need to match the components with the specific criteria.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.