Health-related quality of life among patients attending cardiovascular rehabilitation

Purpose: f i rst , an investigation of baseline differences in Health-Related Quality of l i fe (HRQOl) among adhere and non-adhere patients of Phase III cardiac rehabilitation (CR) was examined. Second, among patients who adhered to the program, effectiveness of t reatment based on HRQOl was evaluated. Methods: Data was collected by the Brock University Heart Institute. Participants completed a questionnaire battery at baseline and again at six months i f they were still a client. Results: The physical dimension of HRQOl differed at baseline between the adhere and non-adhere groups. for everyone point increase in physical HRQOl scores there was an associated 1.06 times greater likelihood that an individual would adhere to the program. Second, in those who adhered to the program for six months, physical HRQOl scores improved 3.18 points. Conclusions: Phase III CR significant improves HRQOl in patients suffering f rom cardiovascular disease.

A possible role for chemokine signalling through CXCR4 as a downstream effector of retinoic acid signalling in the regenerating tail and spinal cord of Notophthalmus viridescens

The newt, Notopthalmus viridescens is one of the few tet rapod vertebrates capable of extensive regeneration of the central nervous system, however, the factors involved in this process are still unknown. Chemokine signalling through the receptor CXCR4, has been found to be involved in the development of the central nervous system of mammals and more recently in epimorphic fin regeneration in zebrafish. We have hypothesized that the CXCR4 signalling pathway is involved in spinal cord and tail regeneration in the adul t newt , possibly as a downstream target of retinoic acid signalling. We found that CXCR4 mRNA expression was observed in the brain, spinal cord, heart, gut, liver and regenerating tail blastemas. CXCR4 expression increased over the f i rst 12 days of tail regeneration and returned to basal expression levels at day 21 of regeneration. Inhibition of CXCR4 wi th AMD3100, a specific receptor antagonist, led to a decrease in CXCR4 mRNA in the regenerating tail 14 days post amputation. Histological analysis suggests a delay in the early stages of tail and spinal cord regeneration. Spinal cord explants t reated wi th CXCL12, the ligand to CXCR4, displayed enhanced neurite outgrowth in vitro. Explants t reated wi th AMD3100 abolished any retinoic acid enhanced neurite outgrowth effects suggesting a link between these signalling pathways.

Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem

Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub location problem, and proposes a genetic algorithm (GA) approach for it. The effectiveness of using a single-objective criterion measure for the problem is first explored. Next, a multi-objective GA employing various fitness evaluation strategies such as Pareto ranking, sum of ranks, and weighted sum strategies is presented. The effectiveness of the multi-objective GA is shown by comparison with an Integer Programming strategy, the only other multi-objective approach found in the literature for this problem. Lastly, two new crossover operators are proposed and an empirical study is done using small to large problem instances of the Civil Aeronautics Board (CAB) and Australian Post (AP) data sets.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.