Statistics at play

Three core components in developing children’s understanding and appreciation of data — establish a context, pose and answer statistical questions, represent and interpret data — lay the foundation for the fourth component: use data to enhance existing context.

Psychological determinants of motorcycle helmet use among young adults in Cambodia

Cambodian accident statistics show that motivating motorcyclists to make proper use of a safety helmet is a top priority for road safety policy makers. Yet, currently there is no insight whatsoever in the psychological precursors of helmet use in Cambodia. As such, it remains unclear which variables to target by interventions aimed at promoting the use of safety helmets. Therefore, this study adopted a socio-cognitive perspective towards the examination of helmet use in a sample of Cambodian young adults (N = 344). Two theoretical models, i.e., Health Belief Model and Theory of Planned Behaviour were combined and further complemented with two norm-related variables, i.e., descriptive- and personal norm. Based on the results, two important conclusions can be drawn. Firstly, the sample investigated in this study is clearly favourably disposed towards the use of helmets while riding. Secondly, in decreasing order, helmet use behaviour was found to be determined by the following five key-determinants: perceived behavioural control over a specific set of inhibiting situational factors (i.e., mostly when driving short distances, at night, or when dressed up to go out), perceived behavioural control in general, perceived susceptibility, personal norm, and behavioural intentions. Policy makers are recommended to reevaluate their current behavioural change methods for young adults being favourably disposed towards the use of safety helmets. Rather than focussing on motivation-oriented methods, there is a need for strategies that (1) stimulate the translation of good intentions into the desirable behaviour and (2) encourage young adults not to relapse in case they are exposed to risk facilitating circumstances. These implications will be discussed more in detail.

Compensation for higher order mode coupling between inclined coupling slots and radiating slots in planar slotted waveguide arrays

Summary form only given. Geometric simplicity, efficiency and polarization purity make slot antenna arrays ideal solutions for many radar, communications and navigation applications, especially when high power, light weight and limited scan volume are priorities. Resonant arrays of longitudinal slots have a slot spacing of one-half guide wavelength at the design frequency, so that the slots are located at the standing wave peaks. Planar arrays are implemented using a number of rectangular waveguides (branch line guides), arranged side-by-side, while waveguides main lines located behind and at right angles to the branch lines excite the radiating waveguides via centered-inclined coupling slots. Planar slotted waveguide arrays radiate broadside beams and all radiators are designed to be in phase.

Straightforward biodegradable nanoparticle generation through megahertz-order ultrasonic atomization

Simple and reliable formation of biodegradable nanoparticles formed from poly-ε-caprolactone was achieved using 1.645 MHz piston atomization of a source fluid of 0.5% w/v of the polymer dissolved in acetone; the particles were allowed to descend under gravity in air 8 cm into a 1 mM solution of sodium dodecyl sulfate. After centrifugation to remove surface agglomerations, a symmetric monodisperse distribution of particles φ 186 nm (SD=5.7, n=6) was obtained with a yield of 65.2%. © 2006 American Institute of Physics.

A Fixed Order Model Matching Approach for the Design of Robust Power System Oscillation Damper

This book focuses on how evolutionary computing techniques benefit engineering research and development tasks by converting practical problems of growing complexities into simple formulations, thus largely reducing development efforts. This book begins with an overview of the optimization theory and modern evolutionary computing techniques, and goes on to cover specific applications of evolutionary computing to power system optimization and control problems.

Inferring phylogenies of evolving sequences without multiple sequence alignment

Alignment-free methods, in which shared properties of sub-sequences (e.g. identity or match length) are extracted and used to compute a distance matrix, have recently been explored for phylogenetic inference. However, the scalability and robustness of these methods to key evolutionary processes remain to be investigated. Here, using simulated sequence sets of various sizes in both nucleotides and amino acids, we systematically assess the accuracy of phylogenetic inference using an alignment-free approach, based on D2 statistics, under different evolutionary scenarios. We find that compared to a multiple sequence alignment approach, D2 methods are more robust against among-site rate heterogeneity, compositional biases, genetic rearrangements and insertions/deletions, but are more sensitive to recent sequence divergence and sequence truncation. Across diverse empirical datasets, the alignment-free methods perform well for sequences sharing low divergence, at greater computation speed. Our findings provide strong evidence for the scalability and the potential use of alignment-free methods in large-scale phylogenomics.

Second-order quantile methods for experts and combinatorial games

We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want our algorithms to perform significantly better on easy data. Two popular ways to formalize such adaptivity are second-order regret bounds and quantile bounds. The underlying notions of 'easy data', which may be paraphrased as "the learning problem has small variance" and "multiple decisions are useful", are synergetic. But even though there are sophisticated algorithms that exploit one of the two, no existing algorithm is able to adapt to both. In this paper we outline a new method for obtaining such adaptive algorithms, based on a potential function that aggregates a range of learning rates (which are essential tuning parameters). By choosing the right prior we construct efficient algorithms and show that they reap both benefits by proving the first bounds that are both second-order and incorporate quantiles.

Summarising and reporting sugarcane locomotive run statistics from TOTools and GPS data

The majority of sugar mill locomotives are equipped with GPS devices from which locomotive position data is stored. Locomotive run information (e.g. start times, run destinations and activities) is electronically stored in software called TOTools. The latest software development allows TOTools to interpret historical GPS information by combining this data with run information recorded in TOTools and geographic information from a GIS application called MapInfo. As a result, TOTools is capable of summarising run activity details such as run start and finish times and shunt activities with great accuracy. This paper presents 15 reports developed to summarise run activities and speed information. The reports will be of use pre-season to assist in developing the next year's schedule and for determining priorities for investment in the track infrastructure. They will also be of benefit during the season to closely monitor locomotive run performance against the existing schedule.

Numerical algorithms for time-fractional subdiffusion equation with second-order accuracy

This article aims to fill in the gap of the second-order accurate schemes for the time-fractional subdiffusion equation with unconditional stability. Two fully discrete schemes are first proposed for the time-fractional subdiffusion equation with space discretized by finite element and time discretized by the fractional linear multistep methods. These two methods are unconditionally stable with maximum global convergence order of $O(\tau+h^{r+1})$ in the $L^2$ norm, where $\tau$ and $h$ are the step sizes in time and space, respectively, and $r$ is the degree of the piecewise polynomial space. The average convergence rates for the two methods in time are also investigated, which shows that the average convergence rates of the two methods are $O(\tau^{1.5}+h^{r+1})$. Furthermore, two improved algorithms are constrcted, they are also unconditionally stable and convergent of order $O(\tau^2+h^{r+1})$. Numerical examples are provided to verify the theoretical analysis. The comparisons between the present algorithms and the existing ones are included, which show that our numerical algorithms exhibit better performances than the known ones.

High order unconditionally stable difference schemes for the Riesz space-fractional telegraph equation

In this paper, a class of unconditionally stable difference schemes based on the Pad´e approximation is presented for the Riesz space-fractional telegraph equation. Firstly, we introduce a new variable to transform the original dfferential equation to an equivalent differential equation system. Then, we apply a second order fractional central difference scheme to discretise the Riesz space-fractional operator. Finally, we use (1, 1), (2, 2) and (3, 3) Pad´e approximations to give a fully discrete difference scheme for the resulting linear system of ordinary differential equations. Matrix analysis is used to show the unconditional stability of the proposed algorithms. Two examples with known exact solutions are chosen to assess the proposed difference schemes. Numerical results demonstrate that these schemes provide accurate and efficient methods for solving a space-fractional hyperbolic equation.

Numerical analysis for the time distributed-order and Riesz space fractional diffusions on bounded domains

Subdiffusion equations with distributed-order fractional derivatives describe some important physical phenomena. In this paper, we consider the time distributed-order and Riesz space fractional diffusions on bounded domains with Dirichlet boundary conditions. Here, the time derivative is defined as the distributed-order fractional derivative in the Caputo sense, and the space derivative is defined as the Riesz fractional derivative. First, we discretize the integral term in the time distributed-order and Riesz space fractional diffusions using numerical approximation. Then the given equation can be written as a multi-term time–space fractional diffusion. Secondly, we propose an implicit difference method for the multi-term time–space fractional diffusion. Thirdly, using mathematical induction, we prove the implicit difference method is unconditionally stable and convergent. Also, the solvability for our method is discussed. Finally, two numerical examples are given to show that the numerical results are in good agreement with our theoretical analysis.

A Novel High Order Space-Time Spectral Method for the Time Fractional Fokker--Planck Equation

The fractional Fokker-Planck equation is an important physical model for simulating anomalous diffusions with external forces. Because of the non-local property of the fractional derivative an interesting problem is to explore high accuracy numerical methods for fractional differential equations. In this paper, a space-time spectral method is presented for the numerical solution of the time fractional Fokker-Planck initial-boundary value problem. The proposed method employs the Jacobi polynomials for the temporal discretization and Fourier-like basis functions for the spatial discretization. Due to the diagonalizable trait of the Fourier-like basis functions, this leads to a reduced representation of the inner product in the Galerkin analysis. We prove that the time fractional Fokker-Planck equation attains the same approximation order as the time fractional diffusion equation developed in [23] by using the present method. That indicates an exponential decay may be achieved if the exact solution is sufficiently smooth. Finally, some numerical results are given to demonstrate the high order accuracy and efficiency of the new numerical scheme. The results show that the errors of the numerical solutions obtained by the space-time spectral method decay exponentially.

Generalized element load method for first- and second-order element solutions with element load effect

The finite element method in principle adaptively divides the continuous domain with complex geometry into discrete simple subdomain by using an approximate element function, and the continuous element loads are also converted into the nodal load by means of the traditional lumping and consistent load methods, which can standardise a plethora of element loads into a typical numerical procedure, but element load effect is restricted to the nodal solution. It in turn means the accurate continuous element solutions with the element load effects are merely restricted to element nodes discretely, and further limited to either displacement or force field depending on which type of approximate function is derived. On the other hand, the analytical stability functions can give the accurate continuous element solutions due to element loads. Unfortunately, the expressions of stability functions are very diverse and distinct when subjected to different element loads that deter the numerical routine for practical applications. To this end, this paper presents a displacement-based finite element function (generalised element load method) with a plethora of element load effects in the similar fashion that never be achieved by the stability function, as well as it can generate the continuous first- and second-order elastic displacement and force solutions along an element without loss of accuracy considerably as the analytical approach that never be achieved by neither the lumping nor consistent load methods. Hence, the salient and unique features of this paper (generalised element load method) embody its robustness, versatility and accuracy in continuous element solutions when subjected to the great diversity of transverse element loads.