An additive model for spatio-temporal smoothing of cancer mortality rates

In this paper, a Bayesian hierarchical model is used to anaylze the female breast cancer mortality rates for the State of Missouri from 1969 through 2001. The logit transformations of the mortality rates are assumed to be linear over the time with additive spatial and age effects as intercepts and slopes. Objective priors of the hierarchical model are explored. The Bayesian estimates are quite robustness in terms change of the hyperparamaters. The spatial correlations are appeared in both intercepts and slopes.

Simultaneous estimation of hunting pressure, harvest and hunter success rates using WinBUGS

The use of hierarchical Bayesian spatial models in the analysis of ecological data is increasingly prevalent. The implementation of these models has been heretofore limited to specifically written software that required extensive programming knowledge to create. The advent of WinBUGS provides access to Bayesian hierarchical models for those without the programming expertise to create their own models and allows for the more rapid implementation of new models and data analysis. This facility is demonstrated here using data collected by the Missouri Department of Conservation for the Missouri Turkey Hunting Survey of 1996. Three models are considered, the first uses the collected data to estimate the success rate for individual hunters at the county level and incorporates a conditional autoregressive (CAR) spatial effect. The second model builds upon the first by simultaneously estimating the success rate and harvest at the county level, while the third estimates the success rate and hunting pressure at the county level. These models are discussed in detail as well as their implementation in WinBUGS and the issues arising therein. Future areas of application for WinBUGS and the latest developments in WinBUGS are discussed as well.

Using a video camera to measure the radius of the Earth

A simple but accurate method for measuring the Earth’s radius using a video camera is described. A video camera was used to capture a shadow rising up the wall of a tall building at sunset. A free program called ImageJ was used to measure the time it took the shadow to rise a known distance up the building. The time, distance and length of the sidereal day were used to calculate the radius of the Earth. The radius was measured as 6394.3 +/- 118 km, which is within 1.8% of the accepted average value of 6371 km and well within the experimental error. The experiment is suitable as a high school or university project and should produce a value for Earth’s radius within a few per cent at latitudes towards the equator, where at some times of the year the ecliptic is approximately normal to the horizon.

Vertical dynamic interaction of trains and rail steel bridges

Rail steel bridges are vulnerable to high impact forces due to the passage of trains; unfortunately the determination of these transient impact forces is not straightforward as these are affected by a large number of parameters, including the wagon design, the wheel-rail contact and the design parameters of the bridge deck and track, as well as the operational parameters – wheel load and speed. To determine these impact forces, a detailed rail train-track/bridge dynamic interaction model has been developed, which includes a comprehensive train model using multi-body dynamics approach and a flexible track/bridge model using Euler– Bernoulli beam theory. Single and multi-span bridges have been modelled to examine their dynamic characteristics. From the single span bridge, the train critical speed is determined; the minimum distance of two peak loadings is found to affect the train critical speed. The impact factor and the dynamic characteristics are discussed.

A Satellite Selection Algorithm for Achieving High Reliability of Ambiguity Resolution with GPS and Beidou Constellations

Reliability of carrier phase ambiguity resolution (AR) of an integer least-squares (ILS) problem depends on ambiguity success rate (ASR), which in practice can be well approximated by the success probability of integer bootstrapping solutions. With the current GPS constellation, sufficiently high ASR of geometry-based model can only be achievable at certain percentage of time. As a result, high reliability of AR cannot be assured by the single constellation. In the event of dual constellations system (DCS), for example, GPS and Beidou, which provide more satellites in view, users can expect significant performance benefits such as AR reliability and high precision positioning solutions. Simply using all the satellites in view for AR and positioning is a straightforward solution, but does not necessarily lead to high reliability as it is hoped. The paper presents an alternative approach that selects a subset of the visible satellites to achieve a higher reliability performance of the AR solutions in a multi-GNSS environment, instead of using all the satellites. Traditionally, satellite selection algorithms are mostly based on the position dilution of precision (PDOP) in order to meet accuracy requirements. In this contribution, some reliability criteria are introduced for GNSS satellite selection, and a novel satellite selection algorithm for reliable ambiguity resolution (SARA) is developed. The SARA algorithm allows receivers to select a subset of satellites for achieving high ASR such as above 0.99. Numerical results from a simulated dual constellation cases show that with the SARA procedure, the percentages of ASR values in excess of 0.99 and the percentages of ratio-test values passing the threshold 3 are both higher than those directly using all satellites in view, particularly in the case of dual-constellation, the percentages of ASRs (>0.99) and ratio-test values (>3) could be as high as 98.0 and 98.5 % respectively, compared to 18.1 and 25.0 % without satellite selection process. It is also worth noting that the implementation of SARA is simple and the computation time is low, which can be applied in most real-time data processing applications.

Whole-genome sequencing reveals untapped genetic potential in Africa’s indigenous cereal crop sorghum

Sorghum is a food and feed cereal crop adapted to heat and drought and a staple for 500 million of the world’s poorest people. Its small diploid genome and phenotypic diversity make it an ideal C4 grass model as a complement to C3 rice. Here we present high coverage (16–45 × ) resequenced genomes of 44 sorghum lines representing the primary gene pool and spanning dimensions of geographic origin, end-use and taxonomic group. We also report the first resequenced genome of S. propinquum, identifying 8 M high-quality SNPs, 1.9 M indels and specific gene loss and gain events in S. bicolor. We observe strong racial structure and a complex domestication history involving at least two distinct domestication events. These assembled genomes enable the leveraging of existing cereal functional genomics data against the novel diversity available in sorghum, providing an unmatched resource for the genetic improvement of sorghum and other grass species.

Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Genome analysis reveals insights into physiology and longevity of the Brandt’s bat Myotis brandtii

Bats account for one-fifth of mammalian species, are the only mammals with powered flight, and are among the few animals that echolocate. The insect-eating Brandt’s bat (Myotis brandtii) is the longest-lived bat species known to date (lifespan exceeds 40 years) and, at 4–8 g adult body weight, is the most extreme mammal with regard to disparity between body mass and longevity. Here we report sequencing and analysis of the Brandt’s bat genome and transcriptome, which suggest adaptations consistent with echolocation and hibernation, as well as altered metabolism, reproduction and visual function. Unique sequence changes in growth hormone and insulin-like growth factor 1 receptors are also observed. The data suggest that an altered growth hormone/insulin-like growth factor 1 axis, which may be common to other long-lived bat species, together with adaptations such as hibernation and low reproductive rate, contribute to the exceptional lifespan of the Brandt’s bat.

It’s not only what I think but what they think! The moderating effect of social norms

The current research extends our knowledge of the main effects of attitude, subjective norm, and perceived control over the individual’s technology adoption. We propose a critical buffering role of social influence on the collectivistic culture in the relationship between attitude, perceived behavioral control, and Information Technology (IT) adoption. Adoption behavior was studied among 132 college students being introduced to a new virtual learning system. While past research mainly treated these three variables as being in parallel relationships, we found a moderating role for subjective norm on technology attitude and perceived control on adoption intent. Implications and limitations for understating the role of social influence in the collectivistic society are discussed.