Estimating the effects of environmental exposures using a weighted mean of monitoring stations

The health effects of environmental hazards are often examined using time series of the association between a daily response variable (e.g., death) and a daily level of exposure (e.g., temperature). Exposures are usually the average from a network of stations. This gives each station equal importance, and negates the opportunity for some stations to be better measures of exposure. We used a Bayesian hierarchical model that weighted stations using random variables between zero and one. We compared the weighted estimates to the standard model using data on health outcomes (deaths and hospital admissions) and exposures (air pollution and temperature) in Brisbane, Australia. The improvements in model fit were relatively small, and the estimated health effects of pollution were similar using either the standard or weighted estimates. Spatial weighted exposures would be probably more worthwhile when there is either greater spatial detail in the health outcome, or a greater spatial variation in exposure.

Monitoring charged particle and ion emissions from a laser printer

While the emission rate of ultrafine particles has been measured and quantified, there is very little information on the emission rates of ions and charged particles from laser printers. This paper describes a methodology that can be adopted for measuring the surface charge density on printed paper and the ion and charged particle emissions during operation of a high-emitting laser printer and shows how emission rates of ultrafine particles, ions and charged particles may be quantified using a controlled experiment within a closed chamber.

A penalty-based grouping genetic algorithm for multiple composite SaaS components clustering in Cloud

Software as a Service (SaaS) in Cloud is getting more and more significant among software users and providers recently. A SaaS that is delivered as composite application has many benefits including reduced delivery costs, flexible offers of the SaaS functions and decreased subscription cost for users. However, this approach has introduced a new problem in managing the resources allocated to the composite SaaS. The resource allocation that has been done at the initial stage may be overloaded or wasted due to the dynamic environment of a Cloud. A typical data center resource management usually triggers a placement reconfiguration for the SaaS in order to maintain its performance as well as to minimize the resource used. Existing approaches for this problem often ignore the underlying dependencies between SaaS components. In addition, the reconfiguration also has to comply with SaaS constraints in terms of its resource requirements, placement requirement as well as its SLA. To tackle the problem, this paper proposes a penalty-based Grouping Genetic Algorithm for multiple composite SaaS components clustering in Cloud. The main objective is to minimize the resource used by the SaaS by clustering its component without violating any constraint. Experimental results demonstrate the feasibility and the scalability of the proposed algorithm.

Energy-efficient virtual machine placement in data centers by genetic algorithm

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches to the virtual machine placement problem consider the energy consumption by physical machines in a data center only, but do not consider the energy consumption in communication network in the data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement in order to make the data center more energy-efficient. In this paper, we propose a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both the servers and the communication network in the data center. Experimental results show that the genetic algorithm performs well when tackling test problems of different kinds, and scales up well when the problem size increases.

Australian lungfish (Neoceratodus forsteri: Dipnoi) have low genetic variation at allozyme and mitochondrial DNA loci : a conservation alert?

Genetic variation at allozyme and mitochondrial DNA loci was investigated in the Australian lungfish, Neoceratodus forsteri Krefft 1870. Tissue samples for genetic analysis were taken non-lethally from 278 individuals representing two spatially distinct endemic populations (Mary and Burnett rivers), as well as one population thought to be derived from an anthropogenic translocation in the 1890's (Brisbane river). Two of 24 allozyme loci resolved from muscle tissue were polymorphic. Mitochondrial DNA nucleotide sequence diversity estimated across 2,235 base pairs in each of 40 individuals ranged between 0.000423 and 0.001470 per river. Low genetic variation at allozyme and mitochondrial loci could be attributed to population bottlenecks, possibly induced by Pleistocene aridity. Limited genetic differentiation was detected among rivers using nuclear and mitochondrial markers suggesting that admixture may have occurred between the endemic Mary and Burnett populations during periods of low sea level when the drainages may have converged before reaching the ocean. Genetic data was consistent with the explanation that lungfish were introduced to the Brisbane river from the Mary river. Further research using more variable genetic loci is needed before the conservation status of populations can be determined, particularly as anthropogenic demands on lungfish habitat are increasing. In the interim we recommend a management strategy aimed at conserving existing genetic variation within and between rivers.

Monitoring charged particles in indoor air using a neutral cluster and air ion spectrometer

While there are sources of ions both outdoors and indoors, ventilation systems can introduce as well as remove ions from the air. As a result, indoor ion concentrations are not directly related to air exchange rates in buildings. In this study, we attempt to relate these quantities with the view of understanding how charged particles may be introduced into indoor spaces.

A practical signal processing approach for condition monitoring of low speed machinery using Peak-Hold-Down-Sample algorithm

A simple and effective down-sample algorithm, Peak-Hold-Down-Sample (PHDS) algorithm is developed in this paper to enable a rapid and efficient data transfer in remote condition monitoring applications. The algorithm is particularly useful for high frequency Condition Monitoring (CM) techniques, and for low speed machine applications since the combination of the high sampling frequency and low rotating speed will generally lead to large unwieldy data size. The effectiveness of the algorithm was evaluated and tested on four sets of data in the study. One set of the data was extracted from the condition monitoring signal of a practical industry application. Another set of data was acquired from a low speed machine test rig in the laboratory. The other two sets of data were computer simulated bearing defect signals having either a single or multiple bearing defects. The results disclose that the PHDS algorithm can substantially reduce the size of data while preserving the critical bearing defect information for all the data sets used in this work even when a large down-sample ratio was used (i.e., 500 times down-sampled). In contrast, the down-sample process using existing normal down-sample technique in signal processing eliminates the useful and critical information such as bearing defect frequencies in a signal when the same down-sample ratio was employed. Noise and artificial frequency components were also induced by the normal down-sample technique, thus limits its usefulness for machine condition monitoring applications.

Kallikrein 14 is down-regulated by androgen receptor signalling and harbours genetic variation that is associated with prostate tumour aggressiveness

Kallikrein 14 (KLK14) has been proposed as a useful prognostic marker in prostate cancer, with expression reported to be associated with tumour characteristics such as higher stage and Gleason score. KLK14 tumour expression has also shown the potential to predict prostate cancer patients at risk of disease recurrence after radical prostatectomy. The KLKs are a remarkably hormone-responsive family of genes, although detailed studies of androgen regulation of KLK14 in prostate cancer have not been undertaken to date. Using in vitro studies, we have demonstrated that unlike many other prostatic KLK genes that are strictly androgen responsive, KLK14 is more broadly expressed and inversely androgen regulated in prostate cancer cells. Given these results and evidence that KLK14 may play a role in prostate cancer prognosis, we also investigated whether common genetic variants in the KLK14 locus are associated with risk and/or aggressiveness of prostate cancer in approximately 1200 prostate cancer cases and 1300 male controls. Of 41 single nucleotide polymorphisms assessed, three were associated with higher Gleason score (≥7): rs17728459 and rs4802765, both located upstream of KLK14, and rs35287116, which encodes a p.Gln33Arg substitution in the KLK14 signal peptide region. Our findings provide further support for KLK14 as a marker of prognosis in prostate cancer.

Genetic analysis of maize streak virus isolates from Uganda reveals widespread distribution of a recombinant variant

Maize streak virus (MSV) contributes significantly to the problem of extremely low African maize yields. Whilst a diverse range of MSV and MSV-like viruses are endemic in sub-Saharan Africa and neighbouring islands, only a single group of maize-adapted variants - MSV subtypes A1 -A6 - causes severe enough disease in maize to influence yields substantially. In order to assist in designing effective strategies to control MSV in maize, a large survey covering 155 locations was conducted to assess the diversity, distribution and genetic characteristics of the Ugandan MSV-A population. PCR-restriction fragment-length polymorphism analyses of 391 virus isolates identified 49 genetic variants. Sixty-two full-genome sequences were determined, 52 of which were detectably recombinant. All but two recombinants contained predominantly MSV-A1-like sequences. Of the ten distinct recombination events observed, seven involved inter-MSV-A subtype recombination and three involved intra-MSV-A1 recombination. One of the intra-MSV-A1 recombinants, designated MSV-A1 UgIII, accounted for >60% of all MSV infections sampled throughout Uganda. Although recombination may be an important factor in the emergence of novel geminivirus variants, it is demonstrated that its characteristics in MSV are quite different from those observed in related African cassava-infecting geminivirus species. © 2007 SGM.

Global genetic diversity and geographical and host-species distribution of beak and feather disease virus isolates

Psittacine beak and feather disease (PBFD) has a broad host range and is widespread in wild and captive psittacine populations in Asia, Africa, the Americas, Europe and Australasia. Beak and feather disease circovirus (BFDV) is the causative agent. BFDV has an ~2 kb single stranded circular DNA genome encoding just two proteins (Rep and CP). In this study we provide support for demarcation of BFDV strains by phylogenetic analysis of 65 complete genomes from databases and 22 new BFDV sequences isolated from infected psittacines in South Africa. We propose 94% genome-wide sequence identity as a strain demarcation threshold, with isolates sharing > 94% identity belonging to the same strain, and strain subtypes sharing> 98% identity. Currently, BFDV diversity falls within 14 strains, with five highly divergent isolates from budgerigars probably representing a new species of circovirus with three strains (budgerigar circovirus; BCV-A, -B and -C). The geographical distribution of BFDV and BCV strains is strongly linked to the international trade in exotic birds; strains with more than one host are generally located in the same geographical area. Lastly, we examined BFDV and BCV sequences for evidence of recombination, and determined that recombination had occurred in most BFDV and BCV strains. We established that there were two globally significant recombination hotspots in the viral genome: the first is along the entire intergenic region and the second is in the C-terminal portion of the CP ORF. The implications of our results for the taxonomy and classification of circoviruses are discussed. © 2011 SGM.

Adaptive sizing of populations and number of islands in distributed genetic algorithms

Deciding the appropriate population size and number of is- lands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines a method that automatically searches for good combinations of island population sizes and the number of islands. The method is based on a race between competing parameter sets, and collaborative seeding of new parameter sets. This method is applicable to any problem, and makes distributed genetic algorithms easier to use by reducing the number of user-set parameters. The experimental results show that the proposed method robustly and reliably finds population and islands settings that are comparable to those found with traditional trial-and-error approaches.

Dynamic optimization of migration topology in internet-based distributed genetic algorithms

Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a major impact on DGA performance. This paper describes and evaluates an adaptive migration topology optimizer that keeps the communication load low while maintaining high solution quality. Experiments on benchmark problems show that the optimized topology outperforms static or random topologies of the same degree of connectivity. The applicability of the method on real-world problems is demonstrated on a hard optimization problem in VLSI design.