University of Cyprus

About: University of Cyprus is a education organization based out in Nicosia, Cyprus. It is known for research contribution in the topics: Large Hadron Collider & Context (language use). The organization has 3624 authors who have published 15157 publications receiving 412135 citations.

Performance of photon reconstruction and identification with the CMS detector in proton-proton collisions at √s = 8 TeV

Abstract: A description is provided of the performance of the CMS detector for photon reconstruction and identification in proton-proton collisions at a centre-of-mass energy of 8 TeV at the CERN LHC. Details are given on the reconstruction of photons from energy deposits in the electromagnetic calorimeter (ECAL) and the extraction of photon energy estimates. The reconstruction of electron tracks from photons that convert to electrons in the CMS tracker is also described, as is the optimization of the photon energy reconstruction and its accurate modelling in simulation, in the analysis of the Higgs boson decay into two photons. In the barrel section of the ECAL, an energy resolution of about 1% is achieved for unconverted or late-converting photons from H→γγ decays. Different photon identification methods are discussed and their corresponding selection efficiencies in data are compared with those found in simulated events.

Genome-wide association study of recurrent major depressive disorder in two European case–control cohorts

Abstract: Major depressive disorder (MDD) is a highly prevalent disorder with substantial heritability. Heritability has been shown to be substantial and higher in the variant of MDD characterized by recurrent episodes of depression. Genetic studies have thus far failed to identify clear and consistent evidence of genetic risk factors for MDD. We conducted a genome-wide association study (GWAS) in two independent datasets. The first GWAS was performed on 1022 recurrent MDD patients and 1000 controls genotyped on the Illumina 550 platform. The second was conducted on 492 recurrent MDD patients and 1052 controls selected from a population-based collection, genotyped on the Affymetrix 5.0 platform. Neither GWAS identified any SNP that achieved GWAS significance. We obtained imputed genotypes at the Illumina loci for the individuals genotyped on the Affymetrix platform, and performed a meta-analysis of the two GWASs for this common set of approximately half a million SNPs. The meta-analysis did not yield genome-wide significant results either. The results from our study suggest that SNPs with substantial odds ratio are unlikely to exist for MDD, at least in our datasets and among the relatively common SNPs genotyped or tagged by the half-million-loci arrays. Meta-analysis of larger datasets is warranted to identify SNPs with smaller effects or with rarer allele frequencies that contribute to the risk of MDD.

Detecting multiple breaks in financial market volatility dynamics

Abstract: The paper evaluates the performance of several recently proposed tests for structural breaks in the conditional variance dynamics of asset returns. The tests apply to the class of ARCH and SV type processes as well as data-driven volatility estimators using high-frequency data. In addition to testing for the presence of breaks, the statistics identify the number and location of multiple breaks. We study the size and power of the new tests for detecting breaks in the conditional variance under various realistic univariate heteroscedastic models, change-point hypotheses and sampling schemes. The paper concludes with an empirical analysis using data from the stock and FX markets for which we find multiple breaks associated with the Asian and Russian financial crises. These events resulted in changes in the dynamics of volatility of asset returns in the samples prior and post the breaks. Copyright © 2002 John Wiley & Sons, Ltd.

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

Abstract: In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection of n users, each employing a mixed strategy, which is a probability distribution over links, to control the routing of its own assigned traffic. In a Nash equilibrium, each user selfishly routes its traffic on those links that minimize its expected latency cost, given the network congestion caused by the other users. The social cost of a Nash equilibrium is the expectation, over all random choices of the users, of the maximum, over all links, latency through a link.We embark on a systematic study of several algorithmic problems related to the computation of Nash equilibria for the selfish routing game we consider. In a nutshell, these problems relate to deciding the existence of a Nash equilibrium, constructing a Nash equilibrium with given support characteristics, constructing the worst Nash equilibrium (the one with maximum social cost), constructing the best Nash equilibrium (the one with minimum social cost), or computing the social cost of a (given) Nash equilibrium. Our work provides a comprehensive collection of efficient algorithms, hardness results (both as NP-hardness and #P-completeness results), and structural results for these algorithmic problems. Our results span and contrast a wide range of assumptions on the syntax of the Nash equilibria and on the parameters of the system.