The mechanism of the regulation of energy distribution between photosystems 1 and 2 in the cyanobacterium Synechococcus sp. strain PCC 7002 /

Cyanobacteria are able to regulate the distribution of absorbed light energy between photo systems 1 and 2 in response to light conditions. The mechanism of this regulation (the state transition) was investigated in the marine cyanobacterium Synechococcus sp. strain PCC 7002. Three cell types were used: the wild type, psaL mutant (deletion of a photo system 1 subunit thought to be involved in photo system 1 trimerization) and the apcD mutant (a deletion of a phycobilisome subunit thought to be responsible for energy transfer to photo system 1). Evidence from 77K fluorescence emission spectroscopy, room temperature fluorescence and absorption cross-section measurements were used to determine a model of energy distribution from the phycobilisome and chlorophyll antennas in state 1 and state 2. The data confirm that in state 1 the phycobilisome is primarily attached to PS2. In state 2, a portion of the phycobilisome absorbed light energy is redistributed to photo system 1. This energy is directly transferred to photo system 1 by one of the phycobilisome terminal emitters, the product of the apcD gene, rather than via the photo system 2 chlorophyll antenna by spillover (energy transfer between the photo system 2 and photo system 1 chlorophyll antenna). The data also show that energy absorbed by the photo system 2 chlorophyll antenna is redistributed to photo system 1 in state 2. This could occur in one of two ways; by spillover or in a way analogous to higher plants where a segment of the chlorophyll antenna is dissociated from photo system 2 and becomes part of the photo system 1 antenna. The presence of energy transfer between neighbouring photo system 2 antennae was determined at both the phycobilisome and chlorophyll level, in states 1 and 2. Increases in antenna absorption cross-section with increasing reaction center closure showed that there is energy transfer (connectivity) between photosystem 2 antennas. No significant difference was shown in the amount of connectivity under these four conditions.

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.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Isoflavone exposure throughout suckling results in improved adult bone health in mice

Exposure to isoflavones (ISO), abundant in soy protein infant formula, for the first 5 days of life results in higher bone mineral density (BMD),greater trabecular connectivity and higher fracture load of lumbar vertebrae (LV) at adulthood. The effect of lengthening the duration of exposure to ISO on bone development has not been studied. This study determined if providing ISO for the first 21 days of life, which more closely mimics the duration that infants are fed soy protein formula, results in higher BMD, improved bone structure and greater strength in femurs and LV than a 5-day protocol. Female CD-1 mice were randomized to subcutaneous injections of ISO (7 Q1 mg kg/body weight/day) or corn oil from postnatal day 1 to 21. BMD, structure and strength were measured at the femur and LV at 4 months of age, representing young Q2 adulthood. At the LV, exposure to ISO resulted in higher (P,0.05) BMD, trabecular connectivity and fracture load compared with control (CON). Exposure to ISO also resulted in higher (P,0.05) whole femur BMD, higher (P,0.05) bone volume/total volume and Q3 lower (P,0.05) trabecular separation at the femur neck, as well as greater (P,0.05) fracture load at femur midpoint and femur neck compared with the CON group. Exposure to ISO throughout suckling has favorable effects on LV outcomes, and, unlike previous studies using 5-day exposure to ISO, femur outcomes are also improved. Duration of exposure should be considered when using the CD-1 mouse to model the effect of early life exposure of infants to ISO.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.