University of Texas at Arlington

About: University of Texas at Arlington is a education organization based out in Arlington, Texas, United States. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 11758 authors who have published 28598 publications receiving 801626 citations. The organization is also known as: UT Arlington & University of Texas-Arlington.

Observation of Associated Near-Side and Away-Side Long-Range Correlations in √sNN=5.02 TeV Proton-Lead Collisions with the ATLAS Detector

Abstract: Two-particle correlations in relative azimuthal angle (Delta phi) and pseudorapidity (Delta eta) are measured in root S-NN = 5.02 TeV p + Pb collisions using the ATLAS detector at the LHC. The measurements are performed using approximately 1 mu b(-1) of data as a function of transverse momentum (p(T)) and the transverse energy (Sigma E-T(Pb)) summed over 3.1 < eta < 4.9 in the direction of the Pb beam. The correlation function, constructed from charged particles, exhibits a long-range (2 < vertical bar Delta eta vertical bar < 5) "near-side" (Delta phi similar to 0) correlation that grows rapidly with increasing Sigma E-T(Pb). A long-range "away-side" (Delta phi similar to pi) correlation, obtained by subtracting the expected contributions from recoiling dijets and other sources estimated using events with small Sigma E-T(Pb), is found to match the near-side correlation in magnitude, shape (in Delta eta and Delta phi) and Sigma E-T(Pb) dependence. The resultant Delta phi correlation is approximately symmetric about pi/2, and is consistent with a dominant cos2 Delta phi modulation for all Sigma E-T(Pb) ranges and particle p(T).

Coupled fixed points of nonlinear operators with applications

Abstract: A partir de quasi-solutions couplees des problemes aux valeurs initiales pour des equations differentielles ordinaires, on introuit le concept de points fixes couples abstraits pour certains operateurs. On donne des theoremes d'existence

Mori dream spaces and GIT.

Abstract: The main goal of this paper is to study varieties with the best possible Mori theoretic properties (measured by the existence of a certain decomposition of the cone of effective divisors). We call such a variety a Mori Dream Space. There turn out to be many examples, including quasi-smooth projective toric (or more generally, spherical) varieties, many GIT quotients, and log Fano 3-folds. We characterize Mori dream spaces as GIT quotients of affine varieties by a torus in a manner generalizing Cox's construction of toric varieties as quotients of affine space. Via the quotient description, the chamber decomposition of the cone of divisors in Mori theory is naturally identified with the decomposition of the G-ample cone from geometric invariant theory. In particular every rational contraction of a Mori dream space comes from GIT, and all possible factorizations of a rational contraction can be read off from the chamber decomposition.

Model-free Q-learning designs for discrete-time zero-sum games with application to H-infinity control

Abstract: In this paper, the optimal strategies for discrete-time linear system quadratic zero-sum games related to the H-infinity optimal control problem are solved in forward time without knowing the system dynamical matrices. The idea is to solve for an action dependent value function Q(x,u,w) of the zero-sum game instead of solving for the state dependent value function V(x) which satisfies a corresponding game algebraic Riccati equation (GARE). Since the state and actions spaces are continuous, two action networks and one critic network are used that are adaptively tuned in forward time using adaptive critic methods. The result is a Q-learning approximate dynamic programming model-free approach that solves the zero-sum game forward in time. It is shown that the critic converges to the game value function and the action networks converge to the Nash equilibrium of the game. Proofs of convergence of the algorithm are shown. It is proven that the algorithm ends up to be a model-free iterative algorithm to solve the (GARE) of the linear quadratic discrete-time zero-sum game. The effectiveness of this method is shown by performing an H-infinity control autopilot design for an F-16 aircraft.