Interactions between harmful algae and calanoid copepods in the Baltic Sea

The aim of the studies reported in this thesis was to examine the feeding interactions between calanoid copepods and toxic algae in the Baltic Sea. The central questions in this research concerned the feeding, survival and egg production of copepods exposed to toxic algae. Furthermore, the importance of copepods as vectors in toxin transfer was examined. The haptophyte Prymnesium parvum, which produces extracellular toxins, was the only studied species that directly harmed copepods. Beside this, it had allelopathic effects (cell lysis) on non-toxic Rhodomonas salina. Copepods that were exposed to P. parvum filtrates died or became severely impaired, although filtrates were not haemolytic (indicative of toxicity in this study). Monospecific Prymnesium cell suspensions, in turn, were haemolytic and copepods in these treatments became inactive, although no clear effect on mortality was detected. These results suggest that haemolytic activity may not be a good proxy of the harmful effects of P. parvum. In addition, P. parvum deterred feeding, and low egestion and suppressed egg production were consequently observed in monospecific suspensions of Prymnesium. Similarly, ingestion and faecal pellet production rates were suppressed in high concentration P. parvum filtrates and in mixtures of P. parvum and R. salina. These results indicate that the allelopathic effects of P. parvum on other algal species together with lowered viability as well as suppressed production of copepods may contribute to bloom formation and persistence. Furthermore, the availability of food for planktivorous animals may be affected due to reduced copepod productivity. Nodularin produced by Nodularia spumigena was transferred to Eurytemora affinis via grazing on filaments of small N. spumigena and by direct uptake from the dissolved pool. Copepods also acquired nodularin in fractions where N. spumigena filaments were absent. Thus, the importance of microbial food webs in nodularin transfer should be considered. Copepods were able to remove particulate nodularin from the system, but at the same time a large proportion of the nodularin disappeared. This indicates that copepods may possess effective mechanisms to remove toxins from their tissues. The importance of microorganisms, such as bacteria, in the degradation of cyanobacterial toxins could also be substantial. Our results were the first reports of the accumulation of diarrhetic shellfish toxins (DSTs) produced by Dinophysis spp. in copepods. The PTX2 content in copepods after feeding experiments corresponded to the ingestion of <100 Dinophysis spp. cells. However, no DSTs were recorded from field-collected copepods. Dinophysis spp. was not selected by the copepods and consumption remained low. It seems thus likely that copepods are an unimportant link in the transfer of DSTs in the northern Baltic Sea.

HDAC inhibitor valproic acid enhances tumor cell kill in adenovirus-HSVtk mediated suicide gene therapy in HNSCC xenograft mouse model

Safety, efficacy and enhanced transgene expression are the primary concerns while using any vector for gene therapy. One of the widely used vectors in clinical. trials is adenovirus which provides a safe way to deliver the therapeutic gene. However, adenovirus has poor transduction efficiency in vivo since most tumor cells express low coxsackie and adenovirus receptors. Similarly transgene expression remains low, possibly because of the chromatization of adenoviral genome upon infection in eukaryotic cells, an effect mediated by histone deacetylases (HDACs). Using a recombinant adenovirus (Ad-HSVtk) carrying the herpes simplex thymidine kinase (HSVtk) and GFP genes we demonstrate that HDAC inhibitor valproic acid can bring about an increase in CAR expression on host cells and thereby enhanced Ad-HSVtk infectivity. It also resulted in an increase in transgene (HSVtk and GFP) expression. This, in turn, resulted in increased cell kill of HNSCC cells, following ganciclovir treatment in vitro as well as in vivo in a xenograft nude mouse model.

Preoperative visual acuity of cataract patients. Repeatability of visual acuity and refractive error measurements in clinical settings

Visual acuities at the time of referral and on the day before surgery were compared in 124 patients operated on for cataract in Vaasa Central Hospital, Finland. Preoperative visual acuity and the occurrence of ocular and general disease were compared in samples of consecutive cataract extractions performed in 1982, 1985, 1990, 1995 and 2000 in two hospitals in the Vaasa region in Finland. The repeatability and standard deviation of random measurement error in visual acuity and refractive error determination in a clinical environment in cataractous, pseudophakic and healthy eyes were estimated by re-examining visual acuity and refractive error of patients referred to cataract surgery or consultation by ophthalmic professionals. Altogether 99 eyes of 99 persons (41 cataractous, 36 pseudophakic and 22 healthy eyes) with a visual acuity range of Snellen 0.3 to 1.3 (0.52 to -0.11 logMAR) were examined. During an average waiting time of 13 months, visual acuity in the study eye decreased from 0.68 logMAR to 0.96 logMAR (from 0.2 to 0.1 in Snellen decimal values). The average decrease in vision was 0.27 logMAR per year. In the fastest quartile, visual acuity change per year was 0.75 logMAR, and in the second fastest 0.29 logMAR, the third and fourth quartiles were virtually unaffected. From 1982 to 2000, the incidence of cataract surgery increased from 1.0 to 7.2 operations per 1000 inhabitants per year in the Vaasa region. The average preoperative visual acuity in the operated eye increased by 0.85 logMAR (in decimal values from 0.03to 0.2) and in the better eye 0.27 logMAR (in decimal values from 0.23 to 0.43) over this period. The proportion of patients profoundly visually handicapped (VA in the better eye <0.1) before the operation fell from 15% to 4%, and that of patients less profoundly visually handicapped (VA in the better eye 0.1 to <0.3) from 47% to 15%. The repeatability visual acuity measurement estimated as a coefficient of repeatability for all 99 eyes was ±0.18 logMAR, and the standard deviation of measurement error was 0.06 logMAR. Eyes with the lowest visual acuity (0.3-0.45) had the largest variability, the coefficient of repeatability values being ±0.24 logMAR and eyes with a visual acuity of 0.7 or better had the smallest, ±0.12 logMAR. The repeatability of refractive error measurement was studied in the same patient material as the repeatability of visual acuity. Differences between measurements 1 and 2 were calculated as three-dimensional vector values and spherical equivalents and expressed by coefficients of repeatability. Coefficients of repeatability for all eyes for vertical, torsional and horisontal vectors were ±0.74D, ±0.34D and ±0.93D, respectively, and for spherical equivalent for all eyes ±0.74D. Eyes with lower visual acuity (0.3-0.45) had larger variability in vector and spherical equivalent values (±1.14), but the difference between visual acuity groups was not statistically significant. The difference in the mean defocus equivalent between measurements 1 and 2 was, however, significantly greater in the lower visual acuity group. If a change of ±0.5D (measured in defocus equivalents) is accepted as a basis for change of spectacles for eyes with good vision, the basis for eyes in the visual acuity range of 0.3 - 0.65 would be ±1D. Differences in repeated visual acuity measurements are partly explained by errors in refractive error measurements.

A complete characterization of pre-Mueller and Mueller matrices in polarization optics

The Mueller-Stokes formalism that governs conventional polarization optics is formulated for plane waves, and thus the only qualification one could require of a 4 x 4 real matrix M in order that it qualify to be the Mueller matrix of some physical system would be that M map Omega((pol)), the positive solid light cone of Stokes vectors, into itself. In view of growing current interest in the characterization of partially coherent partially polarized electromagnetic beams, there is a need to extend this formalism to such beams wherein the polarization and spatial dependence are generically inseparably intertwined. This inseparability brings in additional constraints that a pre-Mueller matrix M mapping Omega((pol)) into itself needs to meet in order to be an acceptable physical Mueller matrix. These additional constraints are motivated and fully characterized. (C) 2010 Optical Society of America

A feedback-based algorithm forMotion analysis with application to object tracking

We present a motion detection algorithm which detects direction of motion at sufficient number of points and thus segregates the edge image into clusters of coherently moving points. Unlike most algorithms for motion analysis, we do not estimate magnitude of velocity vectors or obtain dense motion maps. The motivation is that motion direction information at a number of points seems to be sufficient to evoke perception of motion and hence should be useful in many image processing tasks requiring motion analysis. The algorithm essentially updates the motion at previous time using the current image frame as input in a dynamic fashion. One of the novel features of the algorithm is the use of some feedback mechanism for evidence segregation. This kind of motion analysis can identify regions in the image that are moving together coherently, and such information could be sufficient for many applications that utilize motion such as segmentation, compression, and tracking. We present an algorithm for tracking objects using our motion information to demonstrate the potential of this motion detection algorithm.

Disease control and management

Globally, the main contributors to morbidity and mortality are chronic conditions, including cardiovascular disease and diabetes. Chronic disease is costly and partially avoidable, with around 60% of deaths and nearly 50% of the global disease burden attributable to these conditions. By 2020, chronic illnesses will likely be the leading cause of disability worldwide. Existing healthcare systems that focus on acute episodic health conditions, both national and international, cannot address the worldwide transition to chronic illness; nor are they appropriate for the ongoing care and management of those already dealing with chronic diseases. As such, chronic disease management requires integrated approaches that incorporate interventions targeted at both individuals and populations, and emphasise the shared risk factors of different conditions. International and Australian strategic planning documents articulate similar elements to manage chronic disease, including the need for aligning sectoral policies for health, forming partnerships, and engaging communities in decision-making. Infectious diseases are also a common and significant contributor to ill health throughout the world. In many countries, this impact has been minimised by the combined efforts of preventative health measures and improved treatment methods. However, in low-income countries, infectious diseases remain the dominant cause of death and disability. The World Health Organization (WHO) estimates that infectious diseases (including respiratory infections) still account for around 23% (or around 14 million) of all deaths each year, and result in over 4.6 billion episodes of diarrhoeal disease and 243 million cases of malaria each year (Lozano et al. 2012, WHO 2009). In addition to the high level of mortality, infectious diseases disable many hundreds of millions of people each year, mainly in developing countries, with the global burden of disease from infectious diseases estimated to be around 300 million DALYs (disability-adjusted life years) (WHO 2012). The aim of this chapter is to outline the impact that infectious diseases and chronic diseases have on the health of the community, describe the public health strategies used to reduce the burden of those diseases, and discuss the historic and emerging disease risks to public health. This chapter examines the comprehensive approaches implemented to prevent both chronic and infectious diseases, and to manage and care for communities with these conditions.

Grand challenges for public health

What is the future for public health in the twenty-first century? Can we glean an idea about the future of public health from its past? As Winston Churchill once said: ‘[T]he further backward you look, the further forward you can see.’ What can we see in the history of public health that gives us an idea of where public health might be headed in the future? (Gruszin et al. 2012). In the twentieth century there was substantial progress in public health in Australia. These improvements were brought about through a number of factors. In part, improvements were due to increasing knowledge about the natural history of disease and its treatment. Added to this knowledge was a shifting focus from legislative measures to protect health, to the emergence of improved promotion and prevention strategies, and a general improvement in social and economic conditions for people living in countries such as Australia. Gruszin et al. (2012) consider the range of social and economic reforms of the twentieth century as the most important determinants of the public’s health at the start of the twenty-first century (Gruszin et al. 2012 p 201). The same could not, however, be said for second or third world countries, many of whom have the most fundamental of sanitary and health protection issues still to deal with. For example, in sub-Saharan Africa and in Russia the decline in life expectancy can be said to be related to a range of interconnected factors. In Russia, issues such as alcoholism, violence, suicide, accidents and cardiovascular disease could be contributing to the falling life expectancy (McMichael & Butler 2007). In sub-Saharan Africa, a range of factors, such as HIV/AIDS, poverty, malaria, tuberculosis, undernutrition, totally inadequate infrastructure, gender inequality, conflict and violence, political taboos and a complete lack of political will, have all contributed to a dramatic drop in life expectancy (McMichael & Butler 2007).

Consistent quaternion interpolation for objective finite element approximation of geometrically exact beam

We explore an isoparametric interpolation of total quaternion for geometrically consistent, strain-objective and path-independent finite element solutions of the geometrically exact beam. This interpolation is a variant of the broader class known as slerp. The equivalence between the proposed interpolation and that of relative rotation is shown without any recourse to local bijection between quaternions and rotations. We show that, for a two-noded beam element, the use of relative rotation is not mandatory for attaining consistency cum objectivity and an appropriate interpolation of total rotation variables is sufficient. The interpolation of total quaternion, which is computationally more efficient than the one based on local rotations, converts nodal rotation vectors to quaternions and interpolates them in a manner consistent with the character of the rotation manifold. This interpolation, unlike the additive interpolation of total rotation, corresponds to a geodesic on the rotation manifold. For beam elements with more than two nodes, however, a consistent extension of the proposed quaternion interpolation is difficult. Alternatively, a quaternion-based procedure involving interpolation of relative rotations is proposed for such higher order elements. We also briefly discuss a strategy for the removal of possible singularity in the interpolation of quaternions, proposed in [I. Romero, The interpolation of rotations and its application to finite element models of geometrically exact rods, Comput. Mech. 34 (2004) 121–133]. The strain-objectivity and path-independence of solutions are justified theoretically and then demonstrated through numerical experiments. This study, being focused only on the interpolation of rotations, uses a standard finite element discretization, as adopted by Simo and Vu-Quoc [J.C. Simo, L. Vu-Quoc, A three-dimensional finite rod model part II: computational aspects, Comput. Methods Appl. Mech. Engrg. 58 (1986) 79–116]. The rotation update is achieved via quaternion multiplication followed by the extraction of the rotation vector. Nodal rotations are stored in terms of rotation vectors and no secondary storages are required.

On a Special Co-cycle Basis of Graphs

In this paper we consider the problems of computing a minimum co-cycle basis and a minimum weakly fundamental co-cycle basis of a directed graph G. A co-cycle in G corresponds to a vertex partition (S,V ∖ S) and a { − 1,0,1} edge incidence vector is associated with each co-cycle. The vector space over ℚ generated by these vectors is the co-cycle space of G. Alternately, the co-cycle space is the orthogonal complement of the cycle space of G. The minimum co-cycle basis problem asks for a set of co-cycles that span the co-cycle space of G and whose sum of weights is minimum. Weakly fundamental co-cycle bases are a special class of co-cycle bases, these form a natural superclass of strictly fundamental co-cycle bases and it is known that computing a minimum weight strictly fundamental co-cycle basis is NP-hard. We show that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co-cycle basis of G and it is also weakly fundamental.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Lightcurve inversion for asteroid spins and shapes

Knowledge of the physical properties of asteroids is crucial in many branches of solar-system research. Knowledge of the spin states and shapes is needed, e.g., for accurate orbit determination and to study the history and evolution of the asteroids. In my thesis, I present new methods for using photometric lightcurves of asteroids in the determination of their spin states and shapes. The convex inversion method makes use of a general polyhedron shape model and provides us at best with an unambiguous spin solution and a convex shape solution that reproduces the main features of the original shape. Deriving information about the non-convex shape features is, in principle, also possible, but usually requires a priori information about the object. Alternatively, a distribution of non-convex solutions, describing the scale of the non-convexities, is also possible to be obtained. Due to insufficient number of absolute observations and inaccurately defined asteroid phase curves, the $c/b$-ratio, i.e., the flatness of the shape model is often somewhat ill-defined. However, especially in the case of elongated objects, the flatness seems to be quite well constrained, even in the case when only relative lightcurves are available. The results prove that it is, contrary to the earlier misbelief, possible to derive shape information from the lightcurve data if a sufficiently wide range of observing geometries is covered by the observations. Along with the more accurate shape models, also the rotational states, i.e., spin vectors and rotation periods, are defined with improved accuracy. The shape solutions obtained so far reveal a population of irregular objects whose most descriptive shape characteristics, however, can be expressed with only a few parameters. Preliminary statistical analyses for the shapes suggests that there are correlations between shape and other physical properties, such as the size, rotation period and taxonomic type of the asteroids. More shape data of, especially, the smallest and largest asteroids, as well as the fast and slow rotators is called for in order to be able to study the statistics more thoroughly.

BER analysis of space-time block codes from generalized complex orthogonal designs for M-PSK

In this paper, we present an analysis for the bit error rate (BER) performance of space-time block codes (STBC) from generalized complex orthogonal designs for M-PSK modulation. In STBCs from complex orthogonal designs (COD), the norms of the column vectors are the same (e.g., Alamouti code). However, in generalized COD (GCOD), the norms of the column vectors may not necessarily be the same (e.g., the rate-3/5 and rate-7/11 codes by Su and Xia in [1]). STBCs from GCOD are of interest because of the high rates that they can achieve (in [2], it has been shown that the maximum achievable rate for STBCs from GCOD is bounded by 4/5). While the BER performance of STBCs: from COD (e.g., Alamouti code) can be simply obtained from existing analytical expressions for receive diversity with the same diversity order by appropriately scaling the SNR, this can not be done for STBCs from GCOD (because of the unequal norms of the column vectors). Our contribution in this paper is that we derive analytical expressions for the BER performance of any STBC from GCOD. Our BER analysis for the GCOD captures the performance of STBCs from COD as special cases. We validate our results with two STBCs from GCOD reported by Su and Xia in [1], for 5 and 6 transmit antennas (G(5) and G(6) in [1]) with rates 7/11 and 3/5, respectively.

Conformational characteristics of asparaginyl residues in proteins

Backbone conformations at 1064 asparaginyl residues in 123 non-homologous, high-resolution X-ray structures of proteins were analysed. Asn adopts conformations in left-handed x-helical region and other partially allowed regions in the Ramachandran map more readily than any other non-glycyl residue. Asn conformational clusters in the (phi,psi) regions of left-handed alpha-helix, right-handed alpha-helix and extended (beta) strands were investigated in detail for their occurrence in various secondary structures, especially in beta-turn regions. Preferences were observed for Asn conformations in different positions in various beta-turn types, including the first and fourth positions of the turn. Asparaginyl residues with extended conformations are found to occur frequently in irregular regions, although they are expected to occur predominantly in extended strands or in the third position of type II beta-turns. Asn conformations at the N-cap positions of helices strongly prefer extended conformation than alpha(L), which seems to be characteristic of non-glycyl residues at that position. In the linkers connecting two extended strands and those connecting an alpha-helix and an extended strand, Asn with alpha(L) or alpha(R) conformation is more favoured than Asn with the beta-conformation. Analysis of Asn-Asn doublets and Asn-X-Asn triplets permitted identification of conformational families in such sequences. Results of this investigation provide useful hints in modelling Asn-rich regions in proteins such as malaria parasite coat protein. (C) Munksgaard 1994.

Sequential split vector quantization of LSF parameters using conditional PDF

A better performing product code vector quantization (VQ) method is proposed for coding the line spectrum frequency (LSF) parameters; the method is referred to as sequential split vector quantization (SeSVQ). The split sub-vectors of the full LSF vector are quantized in sequence and thus uses conditional distribution derived from the previous quantized sub-vectors. Unlike the traditional split vector quantization (SVQ) method, SeSVQ exploits the inter sub-vector correlation and thus provides improved rate-distortion performance, but at the expense of higher memory. We investigate the quantization performance of SeSVQ over traditional SVQ and transform domain split VQ (TrSVQ) methods. Compared to SVQ, SeSVQ saves 1 bit and nearly 3 bits, for telephone-band and wide-band speech coding applications respectively.

Triosephosphate isomerase from Plasmodium falciparum:. the crystal structure provides insights into antimalarial drug design

Background: Malaria caused by the parasite Plasmodium falciparum is a major public health concern. The parasite lacks a functional tricarboxylic acid cycle, making glycolysis its sole energy source. Although parasite enzymes have been considered as potential antimalarial drug targets, little is known about their structural biology. Here we report the crystal structure of triosephosphate isomerase (TIM) from P. falciparum at 2.2 Angstrom resolution. Results: The crystal structure of P. falciparum TIM (PfTIM), expressed in Escherichia coli, was determined by the molecular replacement method using the structure of trypanosomal TIM as the starting model. Comparison of the PfTIM structure with other TIM structures, particularly human TIM, revealed several differences, In most TIMs the residue at position 183 is a glutamate but in PtTIM it is a leucine, This leucine residue is completely exposed and together with the surrounding positively charged patch, may be responsible for binding TIM to the erythrocyte membrane. Another interesting feature is the occurrence of a cysteine residue at the dimer interface of PfTIM (Cys13), in contrast to human TIM where this residue is a methionine. Finally, residue 96 of human TIM (Ser96), which occurs near the active site, has been replaced by phenylalanine in PfTIM.