An operational definition of quark and gluon jets

While "quark" and "gluon" jets are often treated as separate, well-defined objects in both theoretical and experimental contexts, no precise, practical, and hadron-level definition of jet flavor presently exists. To remedy this issue, we develop and advocate for a data-driven, operational definition of quark and gluon jets that is readily applicable at colliders. Rather than specifying a per-jet flavor label, we aggregately define quark and gluon jets at the distribution level in terms of measured hadronic cross sections. Intuitively, quark and gluon jets emerge as the two maximally separable categories within two jet samples in data. Benefiting from recent work on data-driven classifiers and topic modeling for jets, we show that the practical tools needed to implement our definition already exist for experimental applications. As an informative example, we demonstrate the power of our operational definition using Z+jet and dijet samples, illustrating that pure quark and gluon distributions and fractions can be successfully extracted in a fully well-defined manner.Comment: 38 pages, 10 figures, 1 table; v2: updated to match JHEP versio

A decentralized linear quadratic control design method for flexible structures

A decentralized suboptimal linear quadratic control design procedure which combines substructural synthesis, model reduction, decentralized control design, subcontroller synthesis, and controller reduction is proposed for the design of reduced-order controllers for flexible structures. The procedure starts with a definition of the continuum structure to be controlled. An evaluation model of finite dimension is obtained by the finite element method. Then, the finite element model is decomposed into several substructures by using a natural decomposition called substructuring decomposition. Each substructure, at this point, still has too large a dimension and must be reduced to a size that is Riccati-solvable. Model reduction of each substructure can be performed by using any existing model reduction method, e.g., modal truncation, balanced reduction, Krylov model reduction, or mixed-mode method. Then, based on the reduced substructure model, a subcontroller is designed by an LQ optimal control method for each substructure independently. After all subcontrollers are designed, a controller synthesis method called substructural controller synthesis is employed to synthesize all subcontrollers into a global controller. The assembling scheme used is the same as that employed for the structure matrices. Finally, a controller reduction scheme, called the equivalent impulse response energy controller (EIREC) reduction algorithm, is used to reduce the global controller to a reasonable size for implementation. The EIREC reduced controller preserves the impulse response energy of the full-order controller and has the property of matching low-frequency moments and low-frequency power moments. An advantage of the substructural controller synthesis method is that it relieves the computational burden associated with dimensionality. Besides that, the SCS design scheme is also a highly adaptable controller synthesis method for structures with varying configuration, or varying mass and stiffness properties

The impact of cluster mergers on arc statistics

We study the impact of merger events on the strong lensing properties of galaxy clusters. Previous lensing simulations were not able to resolve dynamical time scales of cluster lenses, which arise on time scales which are of order a Gyr. In this case study, we first describe qualitatively with an analytic model how some of the lensing properties of clusters are expected to change during merging events. We then analyse a numerically simulated lens model for the variation in its efficiency for producing both tangential and radial arcs while a massive substructure falls onto the main cluster body. We find that: (1) during the merger, the shape of the critical lines and caustics changes substantially; (2) the lensing cross sections for long and thin arcs can grow by one order of magnitude and reach their maxima when the extent of the critical curves is largest; (3) the cross section for radial arcs also grows, but the cluster can efficiently produce this kind of arcs only while the merging substructure crosses the main cluster centre; (4) while the arc cross sections pass through their maxima as the merger proceeds, the cluster's X-ray emission increases by a factor of $\sim5$. Thus, we conclude that accounting for these dynamical processes is very important for arc statistics studies. In particular, they may provide a possible explanation for the arc statistics problem.Comment: 16 pages, submitted to MNRAS, revised version after referee' Comments. Gzipped file including full resolution images can be downloaded at http://dipastro.pd.astro.it/~cosmo/massimo/high-res-images.tar.g

Application of Lanczos vectors to control design of flexible structures, part 2

This report covers the period of the grant from January 1991 until its expiration in June 1992. Together with an Interim Report (Ref. 9), it summarizes the research conducted under NASA Grant NAG9-357 on the topic 'Application of Lanczos Vectors to Control Design of Flexible Structures.' The research concerns various ways to obtain reduced-order mathematical models of complex structures for use in dynamics analysis and in the design of control systems for these structures. This report summarizes the research

Tagging Boosted Ws with Wavelets

We present a new technique for distinguishing the hadronic decays of boosted heavy particles from QCD backgrounds based on wavelet transforms. As an initial exploration, we illustrate the technique in the particular case of hadronic $W$ boson decays, comparing it to the ``mass drop'' cut currently used by the LHC experiments. We apply wavelet cuts, which make use of complementary information, and in combination with the mass drop cut results in an improvement of $\sim$7% in discovery reach of hadronic $W$ boson final states over a wide range of transverse momenta.Comment: 14 pages, 5 figure

Fault-tolerant additive weighted geometric spanners

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance between p and q. A graph G(S, E) is called a t-spanner for the additive weighted set S of points if for any two points p and q in S the distance between p and q in graph G is at most t.d_w(p, q) for a real number t > 1. Here, d_w(p,q) is the additive weighted distance between p and q. For some integer k \geq 1, a t-spanner G for the set S is a (k, t)-vertex fault-tolerant additive weighted spanner, denoted with (k, t)-VFTAWS, if for any set S' \subset S with cardinality at most k, the graph G \ S' is a t-spanner for the points in S \ S'. For any given real number \epsilon > 0, we obtain the following results: - When the points in S belong to Euclidean space R^d, an algorithm to compute a (k,(2 + \epsilon))-VFTAWS with O(kn) edges for the metric space (S, d_w). Here, for any two points p, q \in S, d(p, q) is the Euclidean distance between p and q in R^d. - When the points in S belong to a simple polygon P, for the metric space (S, d_w), one algorithm to compute a geodesic (k, (2 + \epsilon))-VFTAWS with O(\frac{k n}{\epsilon^{2}}\lg{n}) edges and another algorithm to compute a geodesic (k, (\sqrt{10} + \epsilon))-VFTAWS with O(kn(\lg{n})^2) edges. Here, for any two points p, q \in S, d(p, q) is the geodesic Euclidean distance along the shortest path between p and q in P. - When the points in $S$ lie on a terrain T, an algorithm to compute a geodesic (k, (2 + \epsilon))-VFTAWS with O(\frac{k n}{\epsilon^{2}}\lg{n}) edges.Comment: a few update