Optimal-stopping control for airborne collision avoidance and return-to-course flight

This paper considers an aircraft collision avoidance design problem that also incorporates design of the aircraft’s return-to-course flight. This control design problem is formulated as a non-linear optimal-stopping control problem; a formulation that does not require a prior knowledge of time taken to perform the avoidance and return-to-course manoeuvre. A dynamic programming solution to the avoidance and return-to-course problem is presented, before a Markov chain numerical approximation technique is described. Simulation results are presented that illustrate the proposed collision avoidance and return-to-course flight approach.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

The impact of nonlinear exposure risk relationships on seasonal time series data: modelling danish neonatal birth anthropometric data

Background Birth weight and length have seasonal fluctuations. Previous analyses of birth weight by latitude effects identified seemingly contradictory results, showing both 6 and 12 monthly periodicities in weight. The aims of this paper are twofold: (a) to explore seasonal patterns in a large, Danish Medical Birth Register, and (b) to explore models based on seasonal exposures and a non-linear exposure-risk relationship. Methods Birth weight and birth lengths on over 1.5 million Danish singleton, live births were examined for seasonality. We modelled seasonal patterns based on linear, U- and J-shaped exposure-risk relationships. We then added an extra layer of complexity by modelling weighted population-based exposure patterns. Results The Danish data showed clear seasonal fluctuations for both birth weight and birth length. A bimodal model best fits the data, however the amplitude of the 6 and 12 month peaks changed over time. In the modelling exercises, U- and J-shaped exposure-risk relationships generate time series with both 6 and 12 month periodicities. Changing the weightings of the population exposure risks result in unexpected properties. A J-shaped exposure-risk relationship with a diminishing population exposure over time fitted the observed seasonal pattern in the Danish birth weight data. Conclusion In keeping with many other studies, Danish birth anthropometric data show complex and shifting seasonal patterns. We speculate that annual periodicities with non-linear exposure-risk models may underlie these findings. Understanding the nature of seasonal fluctuations can help generate candidate exposures.

Optimistic linear programming gives logarithmic regret for irreducible MDPs

We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). OLP uses its experience so far to estimate the MDP. It chooses actions by optimistically maximizing estimated future rewards over a set of next-state transition probabilities that are close to the estimates, a computation that corresponds to solving linear programs. We show that the total expected reward obtained by OLP up to time T is within C(P) log T of the reward obtained by the optimal policy, where C(P) is an explicit, MDP-dependent constant. OLP is closely related to an algorithm proposed by Burnetas and Katehakis with four key differences: OLP is simpler, it does not require knowledge of the supports of transition probabilities, the proof of the regret bound is simpler, but our regret bound is a constant factor larger than the regret of their algorithm. OLP is also similar in flavor to an algorithm recently proposed by Auer and Ortner. But OLP is simpler and its regret bound has a better dependence on the size of the MDP.

Numerical analysis for a variable-order nonlinear cable equation

In this paper, a variable-order nonlinear cable equation is considered. A numerical method with first-order temporal accuracy and fourth-order spatial accuracy is proposed. The convergence and stability of the numerical method are analyzed by Fourier analysis. We also propose an improved numerical method with second-order temporal accuracy and fourth-order spatial accuracy. Finally, the results of a numerical example support the theoretical analysis.

The mixed anion mineral parnauite Cu9[(OH)10|SO4|(AsO4)2]•7H2O – a Raman spectroscopic study

The mixed anion mineral parnauite Cu9[(OH)10|SO4|(AsO4)2].7H2O from two localities namely Cap Garonne Mine, Le Pradet, France and Majuba Hill mine, Pershing County, Nevada, USA has been studied by Raman spectroscopy. The Raman spectrum of the French sample is dominated by an intense band at 975 cm-1 assigned to the ν1 (SO4)2- symmetric stretching mode and Raman bands at 1077 and 1097 cm-1 may be attributed to the ν3 (SO4)2- antisymmetric stretching mode. Two Raman bands 1107 and 1126 cm-1 are assigned to carbonate CO32- symmetric stretching bands and confirms the presence of carbonate in the structure of parnauite. The comparatively sharp band for the Pershing County mineral at 976 cm-1 is assigned to the ν1 (SO4)2- symmetric stretching mode and a broad spectral profile centered upon 1097 cm-1 is attributed to the ν3 (SO4)2- antisymmetric stretching mode. Two intense bands for the Pershing County mineral at 851 and 810 cm-1 are assigned to the ν1 (AsO4)3- symmetric stretching and ν3 (AsO4)3- antisymmetric stretching modes. Two Raman bands for the French mineral observed at 725 and 777 cm-1 are attributed to the ν3 (AsO4)3- antisymmetric stretching mode. For the French mineral, a low intensity Raman band is observed at 869 cm-1 and is assigned to the ν1 (AsO4)3- symmetric stretching vibration. Chemical composition of parnauite remains open and the question may be raised is parnauite a solid solution of two or more minerals such as a copper hydroxy-arsenate and a copper hydroxy sulphate.

Pedagogy of introductory computer programming : a people-first approach

Students struggle with learning to program. In recent years, not only has there been a dramatic drop in the number of students enrolling in IT and Computer Science courses, but attrition from these courses continues to be significant. Introductory programming subjects traditionally have high failure rates and as they tend to be core to IT and Computer Science courses can be a road block for many students to their university studies. Is programming really that difficult — or are there other barriers to learning that have a serious and detrimental effect on student progression? In-class experiments were conducted in introductory programming units to confirm our hypothesis that that pair-programming would benefit students' learning to program. We investigated the social and cultural barriers to learning programming by questioning students' perceptions of confidence, difficulty and enjoyment of programming. The results of paired and non-paired students were compared to determine the effect of pair-programming on learning outcomes. Both the empirical and anecdotal results of our experiments strongly supported our hypothesis.

Higher-order spectral analysis of nonlinear ocean surface gravity waves

Higher-order spectral analysis is used to detect the presence of secondary and tertiary forced waves associated with the nonlinearity of energetic swell observed in 8- and 13-m water depths. Higher-order spectral analysis techniques are first described and then applied to the field data, followed by a summary of the results.

Higher-Order spectra of nonlinear polynomial models for Chua's circuit

Polynomial models are shown to simulate accurately the quadratic and cubic nonlinear interactions (e.g. higher-order spectra) of time series of voltages measured in Chua's circuit. For circuit parameters resulting in a spiral attractor, bispectra and trispectra of the polynomial model are similar to those from the measured time series, suggesting that the individual interactions between triads and quartets of Fourier components that govern the process dynamics are modeled accurately. For parameters that produce the double-scroll attractor, both measured and modeled time series have small bispectra, but nonzero trispectra, consistent with higher-than-second order nonlinearities dominating the chaos.

An analytical solution for diffusion and nonlinear uptake of oxygen in a spherical cell

We develop a new analytical solution for a reactive transport model that describes the steady-state distribution of oxygen subject to diffusive transport and nonlinear uptake in a sphere. This model was originally reported by Lin (Journal of Theoretical Biology, 1976 v60, pp449–457) to represent the distribution of oxygen inside a cell and has since been studied extensively by both the numerical analysis and formal analysis communities. Here we extend these previous studies by deriving an analytical solution to a generalized reaction-diffusion equation that encompasses Lin’s model as a particular case. We evaluate the solution for the parameter combinations presented by Lin and show that the new solutions are identical to a grid-independent numerical approximation.