7,380 research outputs found
Techniques for high-multiplicity scattering amplitudes and applications to precision collider physics
In this thesis, we present state-of-the-art techniques for the computation of scattering amplitudes in Quantum Field Theories. Following an introduction to the topic, we describe a robust framework that enables the calculation of multi-scale two-loop amplitudes directly relevant to modern particle physics phenomenology at the Large Hadron Collider and beyond. We discuss in detail the use of finite fields to bypass the algebraic complexity of such computations, as well as the method of integration-by-parts relations and differential equations. We apply our framework to calculate the two-loop amplitudes contributing to three process: Higgs boson production in association with a bottom-quark pair, W boson production with a photon and a jet, as well as lepton-pair scattering with an off-shell and an on-shell photon. Finally, we draw our conclusions and discuss directions for future progress of amplitude computations
UMSL Bulletin 2023-2024
The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp
Current Challenges and Advances in Cataract Surgery
This reprint focuses on new trials related to cataract surgery, intraocular lens power calculations for cataracts after refractive surgery, problems related to high myopia, toric IOL power calculations, etc. Intraoperative use of the 3D Viewing System and OCT, studies on the spectacle dependence of EDOF, IOL fixation status and visual function, and dry eye after FLAC are also discussed. Proteomic analysis of aqueous humor proteins is also discussed
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
UMSL Bulletin 2022-2023
The 2022-2023 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1087/thumbnail.jp
Non-perturbative renormalization group analysis of nonlinear spiking networks
The critical brain hypothesis posits that neural circuits may operate close
to critical points of a phase transition, which has been argued to have
functional benefits for neural computation. Theoretical and computational
studies arguing for or against criticality in neural dynamics largely rely on
establishing power laws or scaling functions of statistical quantities, while a
proper understanding of critical phenomena requires a renormalization group
(RG) analysis. However, neural activity is typically non-Gaussian, nonlinear,
and non-local, rendering models that capture all of these features difficult to
study using standard statistical physics techniques. Here, we overcome these
issues by adapting the non-perturbative renormalization group (NPRG) to work on
(symmetric) network models of stochastic spiking neurons. By deriving a pair of
Ward-Takahashi identities and making a ``local potential approximation,'' we
are able to calculate non-universal quantities such as the effective firing
rate nonlinearity of the network, allowing improved quantitative estimates of
network statistics. We also derive the dimensionless flow equation that admits
universal critical points in the renormalization group flow of the model, and
identify two important types of critical points: in networks with an absorbing
state there is Directed Percolation (DP) fixed point corresponding to a
non-equilibrium phase transition between sustained activity and extinction of
activity, and in spontaneously active networks there is a \emph{complex valued}
critical point, corresponding to a spinodal transition observed, e.g., in the
Lee-Yang model of Ising magnets with explicitly broken symmetry. Our
Ward-Takahashi identities imply trivial dynamical exponents in
both cases, rendering it unclear whether these critical points fall into the
known DP or Ising universality classes
Machine learning applications in search algorithms for gravitational waves from compact binary mergers
Gravitational waves from compact binary mergers are now routinely observed by Earth-bound detectors. These observations enable exciting new science, as they have opened a new window to the Universe.
However, extracting gravitational-wave signals from the noisy detector data is a challenging problem. The most sensitive search algorithms for compact binary mergers use matched filtering, an algorithm that compares the data with a set of expected template signals. As detectors are upgraded and more sophisticated signal models become available, the number of required templates will increase, which can make some sources computationally prohibitive to search for. The computational cost is of particular concern when low-latency alerts should be issued to maximize the time for electromagnetic follow-up observations. One potential solution to reduce computational requirements that has started to be explored in the last decade is machine learning. However, different proposed deep learning searches target varying parameter spaces and use metrics that are not always comparable to existing literature. Consequently, a clear picture of the capabilities of machine learning searches has been sorely missing.
In this thesis, we closely examine the sensitivity of various deep learning gravitational-wave search algorithms and introduce new methods to detect signals from binary black hole and binary neutron star mergers at previously untested statistical confidence levels. By using the sensitive distance as our core metric, we allow for a direct comparison of our algorithms to state-of-the-art search pipelines. As part of this thesis, we organized a global mock data challenge to create a benchmark for machine learning search algorithms targeting compact binaries. This way, the tools developed in this thesis are made available to the greater community by publishing them as open source software.
Our studies show that, depending on the parameter space, deep learning gravitational-wave search algorithms are already competitive with current production search pipelines. We also find that strategies developed for traditional searches can be effectively adapted to their machine learning counterparts. In regions where matched filtering becomes computationally expensive, available deep learning algorithms are also limited in their capability. We find reduced sensitivity to long duration signals compared to the excellent results for short-duration binary black hole signals
Gaussian Control Barrier Functions : A Gaussian Process based Approach to Safety for Robots
In recent years, the need for safety of autonomous and intelligent robots has increased. Today, as robots are being increasingly deployed in closer proximity to humans, there is an exigency for safety since human lives may be at risk, e.g., self-driving vehicles or surgical robots. The objective of this thesis is to present a safety framework for dynamical systems that leverages tools from control theory and machine learning. More formally, the thesis presents a data-driven framework for designing safety function candidates which ensure properties of forward invariance. The potential benefits of the results presented in this thesis are expected to help applications such as safe exploration, collision avoidance problems, manipulation tasks, and planning, to name some.
We utilize Gaussian processes (GP) to place a prior on the desired safety function candidate, which is to be utilized as a control barrier function (CBF). The resultant formulation is called Gaussian CBFs and they reside in a reproducing kernel Hilbert space. A key concept behind Gaussian CBFs is the incorporation of both safety belief as well as safety uncertainty, which former barrier function formulations did not consider. This is achieved by using robust posterior estimates from a GP where the posterior mean and variance serve as surrogates for the safety belief and uncertainty respectively. We synthesize safe controllers by framing a convex optimization problem where the kernel-based representation of GPs allows computing the derivatives in closed-form analytically.
Finally, in addition to the theoretical and algorithmic frameworks in this thesis, we rigorously test our methods in hardware on a quadrotor platform. The platform used is a Crazyflie 2.1 which is a versatile palm-sized quadrotor. We provide our insights and detailed discussions on the hardware implementations which will be useful for large-scale deployment of the techniques presented in this dissertation.Ph.D
Soundscape in Urban Forests
This Special Issue of Forests explores the role of soundscapes in urban forested areas. It is comprised of 11 papers involving soundscape studies conducted in urban forests from Asia and Africa. This collection contains six research fields: (1) the ecological patterns and processes of forest soundscapes; (2) the boundary effects and perceptual topology; (3) natural soundscapes and human health; (4) the experience of multi-sensory interactions; (5) environmental behavior and cognitive disposition; and (6) soundscape resource management in forests
- …