Search

Maximal Extractable Value (MEV) has garnered significant attention in the cryptocurrency community. Such attention is a consequence of the revenue that can be generated from MEV, as well as the risks MEV poses to the fundamental value proposition of the underlying blockchain technology. In this work, we provide an information-theoretic formulation of MEV. With this formulation, we make common statements about MEV mathematically rigorous. For example, we show that i) all non-trivial blockchains and decentralised applications must generate MEV; ii) how MEV can be reduced at the expense of user expressibility; and iii) how MEV can be good or bad from an information theoretic standpoint., Comment: 8 pages

Quantum information science and technology (QIST) has progressed significantly in the last decade, such that it is no longer solely in the domain of research labs, but is now beginning to be developed for, and applied in, industrial applications and products. With the emergence of this new quantum industry, a new workforce trained in QIST skills and knowledge is needed. To help support education and training of this workforce, universities and colleges require knowledge of the type of jobs available for their students and what skills and degrees are most relevant for those new jobs. Additionally, students need to know how to tailor their degrees to best align with the current needs of the quantum industry. We report on the results from a survey of 57 companies in the quantum industry, with the goal of elucidating the jobs, skills, and degrees that are relevant for this new workforce. We find a range of job opportunities from highly specific jobs, such as quantum algorithm developer and error correction scientist, to broader jobs categories within the business, software, and hardware sectors. These broader jobs require a range of skills, most of which are not quantum related. Further, except for the highly specific jobs, companies that responded to the survey are looking for a range of degree levels to fill these new positions, from bachelors to masters to PhDs. With this knowledge, students, instructors, and university administrators can make informed decisions about how to address the challenge of increasing the future quantum workforce.

Vision-based driver assistance systems is one of the rapidly growing research areas of ITS, due to various factors such as the increased level of safety requirements in automotive, computational power in embedded systems, and desire to get closer to autonomous driving. It is a cross disciplinary area encompassing specialised fields like computer vision, machine learning, robotic navigation, embedded systems, automotive electronics and safety critical software. In this paper, we survey the list of vision based advanced driver assistance systems with a consistent terminology and propose a taxonomy. We also propose an abstract model in an attempt to formalize a top-down view of application development to scale towards autonomous driving system.

Automated driving is an active area of research in both industry and academia. Automated Parking, which is automated driving in a restricted scenario of parking with low speed manoeuvring, is a key enabling product for fully autonomous driving systems. It is also an important milestone from the perspective of a higher end system built from the previous generation driver assistance systems comprising of collision warning, pedestrian detection, etc. In this paper, we discuss the design and implementation of an automated parking system from the perspective of computer vision algorithms. Designing a low-cost system with functional safety is challenging and leads to a large gap between the prototype and the end product, in order to handle all the corner cases. We demonstrate how camera systems are crucial for addressing a range of automated parking use cases and also, to add robustness to systems based on active distance measuring sensors, such as ultrasonics and radar. The key vision modules which realize the parking use cases are 3D reconstruction, parking slot marking recognition, freespace and vehicle/pedestrian detection. We detail the important parking use cases and demonstrate how to combine the vision modules to form a robust parking system. To the best of the authors' knowledge, this is the first detailed discussion of a systemic view of a commercial automated parking system.

This proceeding broadly overviews the current landscape of heavy exotic spectroscopy. Such work includes the composition of certain X, Y , and Z states, and proceeds to discuss tetraquarks made exclusively of four quarks., Comment: Proceedings For Review Talk at Beauty 2020, 8 pages

This work continues our program of lattice-QCD baryon physics using staggered fermions for both the sea and valence quarks. We present a proof-of-concept study that demonstrates, for the first time, how to calculate baryon matrix elements using staggered quarks for the valence sector. We show how to relate the representations of the continuum staggered flavor-taste group $\text{SU}(8)_{FT}$ to those of the discrete lattice symmetry group. The resulting calculations yield the normalization factors relating staggered baryon matrix elements to their physical counterparts. We verify this methodology by calculating the isovector vector and axial-vector charges $g_V$ and $g_A$. We use a single ensemble from the MILC Collaboration with 2+1+1 flavors of sea quark, lattice spacing $a\approx 0.12$ fm, and a pion mass $M_\pi\approx305$ MeV. On this ensemble, we find results consistent with expectations from current conservation and neutron beta decay. Thus, this work demonstrates how highly-improved staggered quarks can be used for precision calculations of baryon properties, and, in particular, the isovector nucleon charges., Comment: 19 pages, 9 figures

Quantum computing is a growing field at the intersection of physics and computer science. The goal of this article is to highlight a successfully trialled quantum computing course for high school students between the ages of 15 and 18 years old. This course bridges the gap between popular science articles and advanced undergraduate textbooks. Conceptual ideas in the text are reinforced with active learning techniques, such as interactive problem sets and simulation-based labs at various levels. The course is freely available for use and download under the Creative Commons "Attribution- NonCommercial-ShareAlike 4.0 International" license., Comment: 4 pages, 5 figures

In this paper, we introduce a moving object detection algorithm for fisheye cameras used in autonomous driving. We reformulate the three commonly used constraints in rectilinear images (epipolar, positive depth and positive height constraints) to spherical coordinates which is invariant to specific camera configuration once the calibration is known. One of the main challenging use case in autonomous driving is to detect parallel moving objects which suffer from motion-parallax ambiguity. To alleviate this, we formulate an additional fourth constraint, called the anti-parallel constraint, which aids the detection of objects with motion that mirrors the ego-vehicle possible. We analyze the proposed algorithm in different scenarios and demonstrate that it works effectively operating directly on fisheye images., Comment: 8 pages, 9 figures, 2 tables Conference ITSC 2019

Automated Parking is a low speed manoeuvring scenario which is quite unstructured and complex, requiring full 360{\deg} near-field sensing around the vehicle. In this paper, we discuss the design and implementation of an automated parking system from the perspective of camera based deep learning algorithms. We provide a holistic overview of an industrial system covering the embedded system, use cases and the deep learning architecture. We demonstrate a real-time multi-task deep learning network called FisheyeMultiNet, which detects all the necessary objects for parking on a low-power embedded system. FisheyeMultiNet runs at 15 fps for 4 cameras and it has three tasks namely object detection, semantic segmentation and soiling detection. To encourage further research, we release a partial dataset of 5,000 images containing semantic segmentation and bounding box detection ground truth via WoodScape project \cite{yogamani2019woodscape}., Comment: Accepted for publication at Irish Machine Vision and Image Processing (IMVIP) 2019

We present the results of the nucleon and $\Omega$ baryon masses using staggered action for both valence and sea quarks. Three ensembles with the physical pion mass at approximate lattice spacings of $0.15$, $0.12$, and $0.088$fm are employed to extrapolate the masses to continuum and we obtain $M_N = 964(16)$ MeV and $M_\Omega = 1678(9)$. Both statistical and systematic uncertainties are included in the nucleon mass, whereas only the statistical uncertainty is accounted for in the $\Omega$ baryon mass., Comment: 7 pages, 4 figures, proceedings of the 37th International Symposium on Lattice Field Theory, 16-22 June 2019, Wuhan, China

We present the first computation in a program of lattice-QCD baryon physics using staggered fermions for sea and valence quarks. For this initial study, we present a calculation of the nucleon mass, obtaining $964\pm16$ MeV with all sources of statistical and systematic errors controlled and accounted for. This result is the most precise determination to date of the nucleon mass from first principles. We use the highly-improved staggered quark action, which is computationally efficient. Three gluon ensembles are employed, which have approximate lattice spacings $a=0.09$ fm, $0.12$ fm, and $0.15$ fm, each with equal-mass $u$/$d$, $s$, and $c$ quarks in the sea. Further, all ensembles have the light valence and sea $u$/$d$ quarks tuned to reproduce the physical pion mass, avoiding complications from chiral extrapolations or nonunitarity. Our work opens a new avenue for precise calculations of baryon properties, which are both feasible and relevant to experiments in particle and nuclear physics., Comment: 33 pages, 19 figures; published in Physical Review D

QCD exhibits complex dynamics near S-wave two-body thresholds. For light mesons, we see this in the failure of quark models to explain the $f_0(500)$ and $K_0^*(700)$ masses. For charmonium, an unexpected $X(3872)$ state appears at the open charm threshold. In heavy-light systems, analogous threshold effects appear for the lowest $J^P = 0^+$ and $1^+$ states in the $D_s$ and $B_s$ systems. Here we describe how lattice QCD can be used to understand these threshold dynamics by smoothly varying the strange-quark mass when studying the heavy-light systems. Small perturbations around the physical strange quark mass are used so to always remain near the physical QCD dynamics. This calculation is a straightforward extension of those already in the literature and can be undertaken by multiple lattice QCD collaborations with minimal computational cost., Comment: 10 pages, 4 figures

Fisheye cameras are commonly employed for obtaining a large field of view in surveillance, augmented reality and in particular automotive applications. In spite of their prevalence, there are few public datasets for detailed evaluation of computer vision algorithms on fisheye images. We release the first extensive fisheye automotive dataset, WoodScape, named after Robert Wood who invented the fisheye camera in 1906. WoodScape comprises of four surround view cameras and nine tasks including segmentation, depth estimation, 3D bounding box detection and soiling detection. Semantic annotation of 40 classes at the instance level is provided for over 10,000 images and annotation for other tasks are provided for over 100,000 images. With WoodScape, we would like to encourage the community to adapt computer vision models for fisheye camera instead of using naive rectification., Comment: Accepted for Oral Presentation at IEEE International Conference on Computer Vision (ICCV) 2019. Please refer to our website https://woodscape.valeo.com and https://github.com/valeoai/woodscape for release status and updates

Quantum computing is a growing field at the intersection of physics and computer science. This module introduces three of the key principles that govern how quantum computers work: superposition, quantum measurement, and entanglement. The goal of this module is to bridge the gap between popular science articles and advanced undergraduate texts by making some of the more technical aspects accessible to motivated high school students. Problem sets and simulation based labs of various levels are included to reinforce the conceptual ideas described in the text. This is intended as a one week course for high school students between the ages of 15-18 years. The course begins by introducing basic concepts in quantum mechanics which are needed to understand quantum computing., Comment: 123 pages. High School Course Material for Teachers. Version 2 has improvements after trial runs, e.g., typos removed, text explained, answers expanded, etc

Convolutional Neural Networks (CNNs) are successfully used for the important automotive visual perception tasks including object recognition, motion and depth estimation, visual SLAM, etc. However, these tasks are typically independently explored and modeled. In this paper, we propose a joint multi-task network design for learning several tasks simultaneously. Our main motivation is the computational efficiency achieved by sharing the expensive initial convolutional layers between all tasks. Indeed, the main bottleneck in automated driving systems is the limited processing power available on deployment hardware. There is also some evidence for other benefits in improving accuracy for some tasks and easing development effort. It also offers scalability to add more tasks leveraging existing features and achieving better generalization. We survey various CNN based solutions for visual perception tasks in automated driving. Then we propose a unified CNN model for the important tasks and discuss several advanced optimization and architecture design techniques to improve the baseline model. The paper is partly review and partly positional with demonstration of several preliminary results promising for future research. We first demonstrate results of multi-stream learning and auxiliary learning which are important ingredients to scale to a large multi-task model. Finally, we implement a two-stream three-task network which performs better in many cases compared to their corresponding single-task models, while maintaining network size., Comment: Accepted for Oral Presentation at IEEE Intelligent Transportation Systems Conference (ITSC) 2019

We improve the non-relativistic QCD (NRQCD) action by comparing the dispersion relation to that of the continuum through $\mathcal{O}(p^6)$ in perturbation theory. The one-loop matching coefficients of the $\mathcal{O}(p^4)$ kinetic operators are determined, as well as the scale at which to evaluate $\alpha_s$ in the $V$-scheme for each quantity. We utilise automated lattice perturbation theory using twisted boundary conditions as an infrared regulator. The one-loop radiative corrections to the mass renormalisation, zero-point energy and overall energy-shift of an NRQCD $b$-quark are also found. We also explore how a Fat$3$-smeared NRQCD action and changes of the stability parameter $n$ affect the coefficients. Finally, we use gluon field ensembles at multiple lattice spacing values, all of which include $u$, $d$, $s$ and $c$ quark vacuum polarisation, to test how the improvements affect the non-perturbatively determined $\Upsilon(1S)$ and $\eta_b(1S)$ kinetic masses, and the tuning of the $b$ quark mass., Comment: 19 pages, 14 figures, 9 tables

In the near-future noisy intermediate-scale quantum (NISQ) era of quantum computing technology, applications of quantum computing will be limited to calculations of very modest scales in terms of the number of qubits used. The need to represent numeric quantities using limited resources leads to digitization errors which must be taken into account. As a first step towards quantum simulations of realistic high-energy physics problems, we explore classically the effects of digitizing elements of the $\mathrm{SU}(2)$ gauge group to a finite set. We consider several methods for digitizing the group, finding the best performance from an action-preserving projection onto a mesh. Working in (3+1) dimensions, we find that using $\sim 7$ (qu)bits to represent each $\mathrm{SU}(2)$ gauge link induces a digitization error on the order of $10\%$ in short-distance observables and $2\%$ in long-distance observables. Promisingly, our results indicate that each $\mathrm{SU}(2)$ gauge link can be represented by $\mathcal{O}(10)$ (qu)bits, from which we estimate that a $16^3$ $\mathrm{SU}(2)$ lattice could be simulated with no more than $\mathcal{O}(10^5)$ (qu)bits. Our results on digitization are also of interest as a form of lossy compression that could be used in high-performance classical computing to alleviate communications bottlenecks., Comment: 16 pages; 11 figures; To be submitted to Physical Review A

Motivated by multiple phenomenological considerations, we perform the first search for the existence of a $\bar{b}\bar{b}bb$ tetraquark bound state with a mass below the lowest non-interacting bottomonium-pair threshold using the first-principles lattice non-relativistic QCD methodology. We use a full $S$-wave colour/spin basis for the $\bar{b}\bar{b}bb$ operators in the three $0^{++}$, $1^{+-}$ and $2^{++}$ channels. We employ four gluon field ensembles at multiple lattice spacing values ranging from $a = 0.06 - 0.12$ fm, all of which include $u$, $d$, $s$ and $c$ quarks in the sea, and one ensemble which has physical light-quark masses. Additionally, we perform novel exploratory work with the objective of highlighting any signal of a near threshold tetraquark, if it existed, by adding an auxiliary potential into the QCD interactions. With our results we find no evidence of a QCD bound tetraquark below the lowest non-interacting thresholds in the channels studied., Comment: 24 Pages; 19 Figures; Accepted By PRD; Unaveraged Correlator Data Publicly Available in SQLite Database

We present a calculation of the hindered M$1$ $\Upsilon(2S) \to \eta_b(1S) \gamma$ decay rate using lattice non-relativistic QCD. The calculation includes spin-dependent relativistic corrections to the NRQCD action through $\mathcal{O}(v^6)$ in the quark's relative velocity, relativistic corrections to the leading order current which mediates the transition through the quark's magnetic moment, radiative corrections to the leading spin-magnetic coupling and for the first time a full error budget. We also use gluon field ensembles at multiple lattice spacing values, all of which include $u$, $d$, $s$ and $c$ quark vacuum polarisation. Our result for the branching fraction is $\mathcal{B}(\Upsilon(2S)\to\eta_b(1S)\gamma) = 5.4(1.8)\times 10^{-4} $, which agrees with the current experimental value., Comment: 26 pages, 11 figures. Updated to match version published in Phys.Rev.D

The application of numerical techniques to the study of energy landscapes of large systems relies on sufficient sampling of the stationary points. Since the number of stationary points is believed to grow exponentially with system size, we can only sample a small fraction. We investigate the interplay between this restricted sample size and the physical features of the potential energy landscape for the two-dimensional $XY$ model in the absence of disorder with up to $N=100$ spins. Using an eigenvector-following technique, we numerically compute stationary points with a given Hessian index $I$ for all possible values of $I$. We investigate the number of stationary points, their energy and index distributions, and other related quantities, with particular focus on the scaling with $N$. The results are used to test a number of conjectures and approximate analytic results for the general properties of energy landscapes., Comment: 8 pages, 10 figures. Published in Journal of Chemical Physics

Sampling the stationary points of a complicated potential energy landscape is a challenging problem. Here we introduce a sampling method based on relaxation from stationary points of the highest index of the Hessian matrix. We illustrate how this approach can find all the stationary points for potentials or Hamiltonians bounded from above, which includes a large class of important spin models, and we show that it is far more efficient than previous methods. For potentials unbounded from above, the relaxation part of the method is still efficient in finding minima and transition states, which are usually the primary focus of attention for atomistic systems., Comment: 6 pages, 2 tables. Published in Journal of Chemical Physics

We describe a numerical study of the potential energy landscape for the two-dimensional XY model (with no disorder), considering up to 100 spins and CPU and GPU implementations of local optimization, focusing on minima and saddles of index one (transition states). We examine both periodic and anti-periodic boundary conditions, and show that the number of stationary points located increases exponentially with increasing lattice size. The corresponding disconnectivity graphs exhibit funneled landscapes; the global minima are readily located because they exhibit relatively large basins of attraction compared to the higher energy minima as the lattice size increases., Comment: 16 pages, 6 figures

In the modern formulation of lattice gauge-fixing, the gauge fixing condition is written in terms of the minima or stationary points (collectively called solutions) of a gauge-fixing functional. Due to the non-linearity of this functional, it usually has many solutions called Gribov copies. The dependence of the number of Gribov copies, n[U] on the different gauge orbits plays an important role in constructing the Faddeev-Popov procedure and hence in realising the BRST symmetry on the lattice. Here, we initiate a study of counting n[U] for different orbits using three complimentary methods: 1. analytical results in lower dimensions, and some lower bounds on n[U] in higher dimensions, 2. the numerical polynomial homotopy continuation method, which numerically finds all Gribov copies for a given orbit for small lattices, and 3. numerical minimisation ("brute force"), which finds many distinct Gribov copies, but not necessarily all. Because n for the coset SU(N_c)/U(1) of an SU(N_c) theory is orbit-independent, we concentrate on the residual compact U(1) case in this article and establish that n is orbit-dependent for the minimal lattice Landau gauge and orbit-independent for the absolute lattice Landau gauge. We also observe that contrary to a previous claim, n is not exponentially suppressed for the recently proposed stereographic lattice Landau gauge compared to the naive gauge in more than one dimension., Comment: 39 pages, 15 eps figures. Published version: minor changes only