scispace - formally typeset
Search or ask a question
Institution

University of Warsaw

EducationWarsaw, Poland
About: University of Warsaw is a education organization based out in Warsaw, Poland. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 20832 authors who have published 56617 publications receiving 1185084 citations. The organization is also known as: Uniwersytet Warszawski & Warsaw University.


Papers
More filters
Journal ArticleDOI
Fabio Acero1, Felix Aharonian2, Felix Aharonian3, A. G. Akhperjanian4  +172 moreInstitutions (27)
20 Nov 2009
TL;DR: In this paper, the authors reported the detection of gamma rays from the starburst galaxy NGC 253 using the H.E.S. array of imaging atmospheric Cherenkov telescopes.
Abstract: Starburst galaxies exhibit in their central regions a highly increased rate of supernovae, the remnants of which are thought to accelerate energetic cosmic rays up to energies of ~ 10^15 eV. We report the detection of gamma rays -- tracers of such cosmic rays -- from the starburst galaxy NGC 253 using the H.E.S.S. array of imaging atmospheric Cherenkov telescopes. The gamma-ray flux above 220 GeV is F = (5.5 +/- 1.0stat +/- 2.8sys) x 10^-13 ph. s-1 cm-2, implying a cosmic-ray density about three orders of magnitude larger than that in the center of the Milky Way. The fraction of cosmic-ray energy channeled into gamma rays in this starburst environment is 5 times larger than that in our Galaxy.

250 citations

Journal ArticleDOI
Bernardo Adeva1, Taylan Akdogan2, E. Arik2, A. Arvidson3  +196 moreInstitutions (43)
TL;DR: In this article, the spin asymmetries A1 and the spin structure functions g1 of the proton and the deuteron in the kinematic range 0.0008
Abstract: We present the final results of the spin asymmetries A1 and the spin structure functions g1 of the proton and the deuteron in the kinematic range 0.0008

250 citations

Journal ArticleDOI
Alain Abergel1, Peter A. R. Ade2, Nabila Aghanim1, Monique Arnaud3  +237 moreInstitutions (56)
TL;DR: In this article, the authors present an early analysis of the Taurus molecular complex, on line-of-sight-averaged data and without component separation, and derive maps of the dust temperature T, the dust spectral emissivity index β, and the dust optical depth at 250 μm τ250.
Abstract: Planck allows unbiased mapping of Galactic sub-millimetre and millimetre emission from the most diffuse regions to the densest parts of molecular clouds. We present an early analysis of the Taurus molecular complex, on line-of-sight-averaged data and without component separation. The emission spectrum measured by Planck and IRAS can be fitted pixel by pixel using a single modified blackbody. Some systematic residuals are detected at 353 GHz and 143 GHz, with amplitudes around −7% and +13%, respectively, indicating that the measured spectra are likely more complex than a simple modified blackbody. Significant positive residuals are also detected in the molecular regions and in the 217 GHz and 100 GHz bands, mainly caused by the contribution of the J = 2 → 1a ndJ = 1 → 0 12 CO and 13 CO emission lines. We derive maps of the dust temperature T , the dust spectral emissivity index β, and the dust optical depth at 250 μm τ250. The temperature map illustrates the cooling of the dust particles in thermal equilibrium with the incident radiation field, from 16−17 K in the diffuse regions to 13−14 K in the dense parts. The distribution of spectral indices is centred at 1.78, with a standard deviation of 0.08 and a systematic error of 0.07. We detect a significant T − β anti-correlation. The dust optical depth map reveals the spatial distribution of the column density of the molecular complex from the densest molecular regions to the faint diffuse regions. We use near-infrared extinction and H i data at 21-cm to perform a quantitative analysis of the spatial variations of the measured dust optical depth at 250 μm per hydrogen atom τ250/NH. We report an increase of τ250/NH by a factor of about 2 between the atomic phase and the molecular phase, which has a strong impact on the equilibrium temperature of the dust particles.

250 citations

Journal ArticleDOI
TL;DR: This critical review describes fascinating experimental and theoretical advances in 'noble gas' chemistry during the last twenty years, and has taken a somewhat unexpected course since 2000.
Abstract: In this critical review I describe fascinating experimental and theoretical advances in ‘noble gas’ chemistry during the last twenty years, and have taken a somewhat unexpected course since 2000. I also highlight perspectives for further development in this field, including the prospective synthesis of compounds containing as yet unknown Xe–element and element–Xe–element bridging bonds, peroxide species containing Xe, adducts of XeF2 with various metal fluorides, Xe–element alloys, and novel pressure-stabilized covalently bound and host–guest compounds of Xe. A substantial part of the essay is devoted to the—as yet experimentally unexplored—behaviour of the compounds of Xe under high pressure. The blend of science, history, and theoretical predictions, will be valued by inorganic and organic chemists, materials scientists, and the community of theoretical and experimental high-pressure physicists and chemists (151 references).

250 citations

Book ChapterDOI
08 Jul 2013
TL;DR: Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented.
Abstract: It is well known that many local graph problems, like Vertex Cover?and Dominating Set, can be solved in time 2 O ( tw ) | V | O ( 1 ) for graphs G = ( V , E ) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a long time we did not know how to do this faster than tw O ( tw ) | V | O ( 1 ) . Recently, Cygan et al.?(FOCS 2011) presented Monte Carlo algorithms for a wide range of connectivity problems running in time c tw | V | O ( 1 ) for a small constant c, e.g., for Hamiltonian Cycle?and Steiner Tree. Naturally, this raises the question whether randomization is necessary to achieve this runtime; furthermore, it is desirable to also solve counting and weighted versions (the latter without incurring a pseudo-polynomial cost in the runtime in terms of the weights).We present two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions. For example, in this time we can solve Traveling Salesman? or count the number of Hamiltonian cycles. The rank based ideas provide a rather general approach for speeding up even straightforward dynamic programming formulations by identifying "small" sets of representative partial solutions; we focus on the case of expressing connectivity via sets of partitions, but the essential ideas should have further applications. The determinant-based approach uses the Matrix Tree Theorem for deriving closed formulas for counting versions of connectivity problems; we show how to evaluate those formulas via dynamic programming.

250 citations


Authors

Showing all 21191 results

NameH-indexPapersCitations
Alexander Malakhov139148699556
Emmanuelle Perez138155099016
Piotr Zalewski135138889976
Krzysztof Doroba133144089029
Hector F. DeLuca133130369395
Krzysztof M. Gorski132380105912
Igor Golutvin131128288559
Jan Krolikowski131128983994
Michal Szleper130123882036
Anatoli Zarubin129120486435
Malgorzata Kazana129117581106
Artur Kalinowski129116281906
Predrag Milenovic129118581144
Marcin Konecki128117879392
Karol Bunkowski128119279455
Network Information
Related Institutions (5)
Centre national de la recherche scientifique
382.4K papers, 13.6M citations

90% related

University of Paris-Sud
52.7K papers, 2.1M citations

90% related

ETH Zurich
122.4K papers, 5.1M citations

90% related

École Normale Supérieure
99.4K papers, 3M citations

89% related

Max Planck Society
406.2K papers, 19.5M citations

89% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023176
2022619
20212,882
20203,208
20193,130
20183,164