Multiobjective analysis for the design and control of an electromagnetic valve actuator

The electromagnetic valve actuator can deliver much improved fuel efficiency and reduced emissions in spark ignition (SI) engines owing to the potential for variable valve timing when compared with cam-operated, or conventional, variable valve strategies. The possibility exists to reduce pumping losses by throttle-free operation, along with closed-valve engine braking. However, further development is required to make the technology suitable for accept- ance into the mass production market. This paper investigates the application of multiobjective optimization techniques to the conflicting objective functions inherent in the operation of such a device. The techniques are utilized to derive the optimal force–displacement characteristic for the solenoid actuator, along with its controllability and dynamic/steady state performance

Energetics of ion competition in the DEKA selectivity filter of neuronal sodium channels

The energetics of ionic selectivity in the neuronal sodium channels is studied. A simple model constructed for the selectivity filter of the channel is used. The selectivity filter of this channel type contains aspartate (D), glutamate (E), lysine (K), and alanine (A) residues (the DEKA locus). We use Grand Canonical Monte Carlo simulations to compute equilibrium binding selectivity in the selectivity filter and to obtain various terms of the excess chemical potential from a particle insertion procedure based on Widom's method. We show that K$^{+}$ ions in competition with Na$^{+}$ are efficiently excluded from the selectivity filter due to entropic hard sphere exclusion. The dielectric constant of protein has no effect on this selectivity. Ca$^{2+}$ ions, on the other hand, are excluded from the filter due to a free energetic penalty which is enhanced by the low dielectric constant of protein.Comment: 14 pages, 7 figure

Cosmic Sculpture: A new way to visualise the Cosmic Microwave Background

3D printing presents an attractive alternative to visual representation of physical datasets such as astronomical images that can be used for research, outreach or teaching purposes, and is especially relevant to people with a visual disability. We here report the use of 3D printing technology to produce a representation of the all-sky Cosmic Microwave Background (CMB) intensity anisotropy maps produced by the Planck mission. The success of this work in representing key features of the CMB is discussed as is the potential of this approach for representing other astrophysical data sets. 3D printing such datasets represents a highly complementary approach to the usual 2D projections used in teaching and outreach work, and can also form the basis of undergraduate projects. The CAD files used to produce the models discussed in this paper are made available.Comment: Accepted for publication in the European Journal of Physic

Low-momentum interactions in three- and four-nucleon scattering

Low momentum two-nucleon interactions obtained with the renormalization group method and the similarity renormalization group method are used to study the cutoff dependence of low energy 3N and 4N scattering observables. The residual cutoff dependence arises from omitted short-ranged 3N (and higher) forces that are induced by the renormalization group transformations, and may help to estimate the sensitivity of various 3N and 4N scattering observables to short-ranged many-body forces.Comment: 5 pages, 8 figures, to be published in Phys. Rev.

On the Combinatorial Complexity of Approximating Polytopes

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from $K$ is at most $\varepsilon \cdot \mathrm{diam}(K)$. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. A well-known result by Dudley implies that $O(1/\varepsilon^{(d-1)/2})$ facets suffice, and a dual result by Bronshteyn and Ivanov similarly bounds the number of vertices, but neither result bounds the total combinatorial complexity. We show that there exists an approximating polytope whose total combinatorial complexity is $\tilde{O}(1/\varepsilon^{(d-1)/2})$, where $\tilde{O}$ conceals a polylogarithmic factor in $1/\varepsilon$. This is a significant improvement upon the best known bound, which is roughly $O(1/\varepsilon^{d-2})$. Our result is based on a novel combination of both old and new ideas. First, we employ Macbeath regions, a classical structure from the theory of convexity. The construction of our approximating polytope employs a new stratified placement of these regions. Second, in order to analyze the combinatorial complexity of the approximating polytope, we present a tight analysis of a width-based variant of B\'{a}r\'{a}ny and Larman's economical cap covering. Finally, we use a deterministic adaptation of the witness-collector technique (developed recently by Devillers et al.) in the context of our stratified construction.Comment: In Proceedings of the 32nd International Symposium Computational Geometry (SoCG 2016) and accepted to SoCG 2016 special issue of Discrete and Computational Geometr