Multinucleon ejection model for Meson Exchange Current neutrino interactions

A model is proposed to describe pairs or triples of nucleons ejected from nucleus as a result of Meson Exchange Current neutrino interaction. The model can be easily implemented in Monte Carlo neutrino event generators. It can provide a help in identifying true charge current quasielastic events and allow for better determination of the systematic error of neutrino energy reconstruction in neutrino oscillation experimentsComment: A version published in PRC, with several improvements wrt the original submissio

Adaptive control strategies for flexible robotic arm

The motivation of this research came about when a neural network direct adaptive control scheme was applied to control the tip position of a flexible robotic arm. Satisfactory control performance was not attainable due to the inherent non-minimum phase characteristics of the flexible robotic arm tip. Most of the existing neural network control algorithms are based on the direct method and exhibit very high sensitivity if not unstable closed-loop behavior. Therefore a neural self-tuning control (NSTC) algorithm is developed and applied to this problem and showed promising results. Simulation results of the NSTC scheme and the conventional self-tuning (STR) control scheme are used to examine performance factors such as control tracking mean square error, estimation mean square error, transient response, and steady state response

On almost hypohamiltonian graphs

A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J. Graph Theory 79 (2015) 63--81] for all orders for which a.h. graphs exist. Here we solve this problem. To this end, we present a specialised algorithm which generates complete sets of a.h. graphs for various orders. Furthermore, we show that the smallest cubic a.h. graphs have order 26. We provide a lower bound for the order of the smallest planar a.h. graph and improve the upper bound for the order of the smallest planar a.h. graph containing a cubic vertex. We also determine the smallest planar a.h. graphs of girth 5, both in the general and cubic case. Finally, we extend a result of Steffen on snarks and improve two bounds on longest paths and longest cycles in polyhedral graphs due to Jooyandeh, McKay, {\"O}sterg{\aa}rd, Pettersson, and the second author.Comment: 18 pages. arXiv admin note: text overlap with arXiv:1602.0717

Operator Formalism for Bosonic Beta-Gamma Fields on General Algebraic Curves

An operator formalism for bosonic $\beta-\gamma$ systems on arbitrary algebraic curves is introduced. The classical degrees of freedom are identified and their commutation relations are postulated. The explicit realization of the algebra formed by the fields is given in a Hilbert space equipped with a bilinear form. The construction is based on the "gaussian" representation for $\beta-\gamma$ systems on the complex sphere [Alvarez-Gaum\' e et al, Nucl. Phys. B 311 (1988) 333]. Detailed computations are provided for the two and four points correlation functions.Comment: 26 pages, plain TeX + harvma

Mean field variational Bayesian inference for support vector machine classification

A mean field variational Bayes approach to support vector machines (SVMs) using the latent variable representation on Polson & Scott (2012) is presented. This representation allows circumvention of many of the shortcomings associated with classical SVMs including automatic penalty parameter selection, the ability to handle dependent samples, missing data and variable selection. We demonstrate on simulated and real datasets that our approach is easily extendable to non-standard situations and outperforms the classical SVM approach whilst remaining computationally efficient.Comment: 18 pages, 4 figure