| 1. |
- Abelev, Betty, et al.
(författare)
-
Long-range angular correlations on the near and away side in p-Pb collisions at root S-NN=5.02 TeV
- 2013
-
Ingår i: Physics Letters. Section B: Nuclear, Elementary Particle and High-Energy Physics. - : Elsevier BV. - 0370-2693. ; 719:1-3, s. 29-41
-
Tidskriftsartikel (refereegranskat)abstract
- Angular correlations between charged trigger and associated particles are measured by the ALICE detector in p-Pb collisions at a nucleon-nucleon centre-of-mass energy of 5.02 TeV for transverse momentum ranges within 0.5 < P-T,P-assoc < P-T,P-trig < 4 GeV/c. The correlations are measured over two units of pseudorapidity and full azimuthal angle in different intervals of event multiplicity, and expressed as associated yield per trigger particle. Two long-range ridge-like structures, one on the near side and one on the away side, are observed when the per-trigger yield obtained in low-multiplicity events is subtracted from the one in high-multiplicity events. The excess on the near-side is qualitatively similar to that recently reported by the CMS Collaboration, while the excess on the away-side is reported for the first time. The two-ridge structure projected onto azimuthal angle is quantified with the second and third Fourier coefficients as well as by near-side and away-side yields and widths. The yields on the near side and on the away side are equal within the uncertainties for all studied event multiplicity and p(T) bins, and the widths show no significant evolution with event multiplicity or p(T). These findings suggest that the near-side ridge is accompanied by an essentially identical away-side ridge. (c) 2013 CERN. Published by Elsevier B.V. All rights reserved.
|
|
| 2. |
|
|
| 3. |
- Kumar, T. K. Satish, et al.
(författare)
-
On the Traveling Salesman Problem with Simple Temporal Constraints
- 2013
-
Ingår i: Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation (SARA). - : AAAI Press. - 9781577356301
-
Konferensbidrag (refereegranskat)abstract
- Many real-world applications require the successful combination of spatial and temporal reasoning. In this paper, we study the general framework of the Traveling Salesman Problem with Simple Temporal Constraints. Representationally, this framework subsumes the Traveling Salesman Problem, Simple Temporal Problems, as well as many of the frameworks described in the literature. We analyze the theoretical properties of the combined problem providing strong inapproximability results for the general problem, and positive results for some special cases.
|
|
| 4. |
- Kumar, T. K. Satish, et al.
(författare)
-
Simple Temporal Problems with Taboo Regions
- 2013
-
Ingår i: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI). - : AAAI Press.
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we define and study the general framework of Simple Temporal Problems with Taboo regions (STPTs) and show how these problems capture metric temporal reasoning aspects which are common to many real-world applications. STPTs encode simple temporal constraints between events and user-defined taboo regions on the timeline, during which no event is allowed to take place. We discuss two different variants of STPTs. The first one deals with (instantaneous) events, while the second one allows for (durative) processes. We also provide polynomial-time algorithms for solving them. If all events or processes cannot be scheduled outside of the taboo regions, one needs to define and reason about "soft" STPTs. We show that even "soft" STPTs can be solved in polynomial time, using reductions to max-flow problems. The resulting algorithms allow for incremental computations, which is important for the successful application of our approach in real-time domains.
|
|
