Institution
University of Warsaw
Education•Warsaw, 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 published on a yearly basis
Papers
More filters
••
TL;DR: It is shown how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm), based on factor graphs for the reverse of the pattern.
Abstract: We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF algorithm is based on factor graphs for the reverse of the pattern. The main feature of both algorithms is that they scan the text right-to-left from the supposed right position of the pattern. The BM algorithm goes as far as the scanned segment (factor) is a suffix of the pattern. The RF algorithm scans while the segment is a factor of the pattern. Both algorithms make a shift of the pattern, forget the history, and start again. The RF algorithm usually makes bigger shifts than BM, but is quadratic in the worst case. We show that it is enough to remember the last matched segment (represented by two pointers to the text) to speed up the RF algorithm considerably (to make a linear number of inspections of text symbols, with small coefficient), and to speed up the BM algorithm (to make at most 2 ·n comparisons). Only a constant additional memory is needed for the search phase. We give alternative versions of an accelerated RF algorithm: the first one is based on combinatorial properties of primitive words, and the other two use the power of suffix trees extensively. The paper demonstrates the techniques to transform algorithms, and also shows interesting new applications of data structures representing all subwords of the pattern in compact form.
190 citations
••
TL;DR: Some anti-biofilm approaches employing AgNPs are described and the challenges and problems that need to be addressed in order to make silver nanoparticles a part of an effective anti- biofilm strategy are considered.
Abstract: Biofilms are complex bacterial communities that resist the action of antibiotics and the human immune system. Bacteria within biofilms are the cause of numerous, almost impossible to eradicate, persistent infections. Biofilms can form on many medical devices and implants, and so have an enormous impact on medicine. Due to the lack of effective anti-biofilm antibiotics, novel alternative compounds or strategies are urgently required. This review describes some of the latest approaches in the field of biofilm treatment. New anti-biofilm technologies target different stages in the biofilm formation process. Some act to modify the colonized biomaterials to make them resistant to biofilm formation. One potentially important candidate treatment uses silver nanoparticles that show anti-bacterial and anti-biofilm activity. The biological action of nano-silver is complex and seems to involve a number of pathways. However, there have been few reports on the anti-biofilm activity of silver nanoparticles and the precise mechanism underlying their action remains unresolved. Here, we describe some anti-biofilm approaches employing AgNPs and consider the challenges and problems that need to be addressed in order to make silver nanoparticles a part of an effective anti-biofilm strategy.
190 citations
••
TL;DR: In this article, the authors considered the problem of robust stabilization of a linear time-invariant system subject to variations of a real parameter vector and proposed a design procedure to robustify a given stabilizing controller.
Abstract: This paper considers the problem of robust stabilization of a linear time-invariant system subject to variations of a real parameter vector. For a given controller the radius of the largest stability hypersphere in this parameter space is calculated. This radius is a measure of the stability margin of the closed-loop system. The results developed are applicable to all systems where the closed-loop characteristic polynomial coefficients are linear functions of the parameters of interest. In particular, this always occurs for single-input (multioutput) or single-output (multiinput) systems where the transfer function coefficients are linear or affine functions of the parameters. Many problems with transfer function coefficients which are nonlinear functions of physical parameters can be cast into this mathematical framework by suitable weighting and redefinition of functions of physical parameters as new parameters. The largest stability hyperellipsoid for the case of weighted perturbations and a stability polytope in parameter space are also determined. Based on these calculations a design procedure is proposed to robustify a given stabilizing controller. This algorithm iteratively enlarges the stability hypersphere or hyperellipsoid in parameter space and can be used to design a controller Io stabilize a plant subject to given ranges of parameter excursions. These results are illustrated by an example.
190 citations
••
TL;DR: In this article, the LHC proton-proton collisions at √s=7'TeV, corresponding to 5.0'fb-1 of integrated luminosity, have been collected with the CMS detector.
Abstract: Measurements of inclusive jet and dijet production cross sections are presented. Data from LHC proton-proton collisions at √s=7 TeV, corresponding to 5.0 fb-1 of integrated luminosity, have been collected with the CMS detector. Jets are reconstructed up to rapidity 2.5, transverse momentum 2 TeV, and dijet invariant mass 5 TeV, using the anti-kT clustering algorithm with distance parameter R=0.7. The measured cross sections are corrected for detector effects and compared to perturbative QCD predictions at next-to-leading order, using five sets of parton distribution functions.
189 citations
••
TL;DR: In this paper, the authors search for high-energy neutrinos from the binary neutron star merger in the GeV-EeV energy range using the Antares, IceCube, and Pierre Auger Observatories.
Abstract: The Advanced LIGO and Advanced Virgo observatories recently discovered gravitational waves from a binary neutron star inspiral. A short gamma-ray burst (GRB) that followed the merger of this binary was also recorded by the Fermi Gamma-ray Burst Monitor (Fermi-GBM), and the Anti-Coincidence Shield for the Spectrometer for the International Gamma-Ray Astrophysics Laboratory (INTEGRAL), indicating particle acceleration by the source. The precise location of the event was determined by optical detections of emission following the merger. We searched for high-energy neutrinos from the merger in the GeV–EeV energy range using the Antares, IceCube, and Pierre Auger Observatories. No neutrinos directionally coincident with the source were detected within ±500 s around the merger time. Additionally, no MeV neutrino burst signal was detected coincident with the merger. We further carried out an extended search in the direction of the source for high-energy neutrinos within the 14 day period following the merger, but found no evidence of emission. We used these results to probe dissipation mechanisms in relativistic outflows driven by the binary neutron star merger. The non-detection is consistent with model predictions of short GRBs observed at a large off-axis angle.
189 citations
Authors
Showing all 21191 results
Name | H-index | Papers | Citations |
---|---|---|---|
Alexander Malakhov | 139 | 1486 | 99556 |
Emmanuelle Perez | 138 | 1550 | 99016 |
Piotr Zalewski | 135 | 1388 | 89976 |
Krzysztof Doroba | 133 | 1440 | 89029 |
Hector F. DeLuca | 133 | 1303 | 69395 |
Krzysztof M. Gorski | 132 | 380 | 105912 |
Igor Golutvin | 131 | 1282 | 88559 |
Jan Krolikowski | 131 | 1289 | 83994 |
Michal Szleper | 130 | 1238 | 82036 |
Anatoli Zarubin | 129 | 1204 | 86435 |
Malgorzata Kazana | 129 | 1175 | 81106 |
Artur Kalinowski | 129 | 1162 | 81906 |
Predrag Milenovic | 129 | 1185 | 81144 |
Marcin Konecki | 128 | 1178 | 79392 |
Karol Bunkowski | 128 | 1192 | 79455 |