Impact of temperature dependence of the energy loss on jet quenching observables

The quenching of jets (particles with $p_T>>T, \Lambda_{QCD}$) in ultra-relativistic heavy-ion collisions has been one of the main prediction and discovery at RHIC. We have studied, by a simple jet quenching modeling, the correlation between different observables like the nuclear modification factor \Rapt, the elliptic flow $v_2$ and the ratio of quark to gluon suppression $R_{AA}(quark)/R_{AA}(gluon)$. We show that the relation among these observables is strongly affected by the temperature dependence of the energy loss. In particular the large $v_2$ and and the nearly equal \Rapt of quarks and gluons can be accounted for only if the energy loss occurs mainly around the temperature $T_c$ and the flavour conversion is significant.Finally we point out that the efficency in the conversion of the space eccentricity into the momentum one ($v_2$) results to be quite smaller respect to the one coming from elastic scatterings in a fluid with a viscosity to entropy density ratio $4\pi\eta/s=1$.Comment: 7 pages, 8 figures, Workshop WISH 201

Asymptotic robustness of Kelly's GLRT and Adaptive Matched Filter detector under model misspecification

A fundamental assumption underling any Hypothesis Testing (HT) problem is that the available data follow the parametric model assumed to derive the test statistic. Nevertheless, a perfect match between the true and the assumed data models cannot be achieved in many practical applications. In all these cases, it is advisable to use a robust decision test, i.e. a test whose statistic preserves (at least asymptotically) the same probability density function (pdf) for a suitable set of possible input data models under the null hypothesis. Building upon the seminal work of Kent (1982), in this paper we investigate the impact of the model mismatch in a recurring HT problem in radar signal processing applications: testing the mean of a set of Complex Elliptically Symmetric (CES) distributed random vectors under a possible misspecified, Gaussian data model. In particular, by using this general misspecified framework, a new look to two popular detectors, the Kelly's Generalized Likelihood Ration Test (GLRT) and the Adaptive Matched Filter (AMF), is provided and their robustness properties investigated.Comment: ISI World Statistics Congress 2017 (ISI2017), Marrakech, Morocco, 16-21 July 201

A novel stepwise micro-TESE approach in non obstructive azoospermia

Background: The purpose of the study was to investigate whether micro-TESE can improve sperm retrieval rate (SRR) compared to conventional single TESE biopsy on the same testicle or to contralateral multiple TESE, by employing a novel stepwise micro-TESE approach in a population of poor prognosis patients with non-obstructive azoospermia (NOA). Methods: Sixty-four poor prognosis NOA men undergoing surgical testicular sperm retrieval for ICSI, from March 2007 to April 2013, were included in this study. Patients inclusion criteria were a) previous unsuccessful TESE, b) unfavorable histology (SCOS, MA, sclerahyalinosis), c) Klinefelter syndrome. We employed a stepwise micro-TESE consisting three-steps: 1) single conventional TESE biopsy; 2) micro-TESE on the same testis; 3) contralateral multiple TESE. Results: SRR was 28.1 % (18/64). Sperm was obtained in both the initial single conventional TESE and in the following micro-TESE. The positive or negative sperm retrieval was further confirmed by a contralateral multiple TESE, when performed. No significant pre-operative predictors of sperm retrieval, including patients’ age, previous negative TESE or serological markers (LH, FSH, inhibin B), were observed at univariate or multivariate analysis. Micro-TESE (step 2) did not improve sperm retrieval as compared to single TESE biopsy on the same testicle (step 1) or multiple contralateral TESE (step 3). Conclusions: Stepwise micro-TESE could represent an optimal approach for sperm retrieval in NOA men. In our view, it should be offered to NOA patients in order to gradually increase surgical invasiveness, when necessary. Stepwise micro-TESE might also reduce the costs, time and efforts involved in surgery

Damage identification on spatial Timoshenko arches by means of genetic algorithms

In this paper a procedure for the dynamic identification of damage in spatial Timoshenko arches is presented. The proposed approach is based on the calculation of an arbitrary number of exact eigen-properties of a damaged spatial arch by means of the Wittrick and Williams algorithm. The proposed damage model considers a reduction of the volume in a part of the arch, and is therefore suitable, differently than what is commonly proposed in the main part of the dedicated literature, not only for concentrated cracks but also for diffused damaged zones which may involve a loss of mass. Different damage scenarios can be taken into account with variable location, intensity and extension of the damage as well as number of damaged segments. An optimization procedure, aiming at identifying which damage configuration minimizes the difference between its eigen-properties and a set of measured modal quantities for the structure, is implemented making use of genetic algorithms. In this context, an initial random population of chromosomes, representing different damage distributions along the arch, is forced to evolve towards the fittest solution. Several applications with different, single or multiple, damaged zones and boundary conditions confirm the validity and the applicability of the proposed procedure even in presence of instrumental errors on the measured data.Comment: 34 pages, 19 figure

Pure Nash Equilibria: Hard and Easy Games

We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is SigmaP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each players payoff depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players. The dependency structure of a game G can be expressed by a graph DG(G) or by a hypergraph H(G). By relating Nash equilibrium problems to constraint satisfaction problems (CSPs), we show that if G has small neighborhood and if H(G) has bounded hypertree width (or if DG(G) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems

Momentum anisotropies in the quark coalescence model

Based on the quark coalescence model, we derive relations among the momentum anisotropies of mesons and baryons in relativistic heavy ion collisions from a given, but arbitrary azimuthal distribution for the partons. Besides the familiar even Fourier coefficients such as the elliptic flow, we also pay attention to odd Fourier coefficients such as the directed flow, which has been observed at finite rapidity even at RHIC energies.Comment: 5 page