Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem. Steiner tree problems, being the underlining models of many applications, have received significant research attention within the meta-heuristics community. The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches. Many interesting research issues still remain to be investigated, for example, the inclusion of different constraints, such as delay bounds, when finding multicast trees with minimum cost. In this paper, we develop a novel PSO algorithm based on the jumping PSO (JPSO) algorithm recently developed by Moreno-Perez et al. (Proc. of the 7th Metaheuristics International Conference, 2007), and also propose two novel local search heuristics within our JPSO framework. A path replacement operator has been used in particle moves to improve the positions of the particle with regard to the structure of the tree. We test the performance of our JPSO algorithm, and the effect of the integrated local search heuristics by an extensive set of experiments on multicast routing benchmark problems and Steiner tree problems from the OR library. The experimental results show the superior performance of the proposed JPSO algorithm over a number of other state-of-the-art approaches

Search for leptophobic Z ' bosons decaying into four-lepton final states in proton-proton collisions at root s=8 TeV

Peer reviewe

Measurement of the mass difference between top quark and antiquark in pp collisions at root s=8 TeV

Peer reviewe

Search for high-mass diphoton resonances in proton-proton collisions at 13 TeV and combination with 8 TeV search

Peer reviewe

Search for neutral resonances decaying into a Z boson and a pair of b jets or τ leptons

A search is performed for a new resonance decaying into a lighter resonance and a Z boson. Two channels are studied, targeting the decay of the lighter resonance into either a pair of oppositely charged τ leptons or a bb‾ pair. The Z boson is identified via its decays to electrons or muons. The search exploits data collected by the CMS experiment at a centre-of-mass energy of 8 TeV, corresponding to an integrated luminosity of 19.8 fb −1 . No significant deviations are observed from the standard model expectation and limits are set on production cross sections and parameters of two-Higgs-doublet models

Search for single production of scalar leptoquarks in proton-proton collisions at root s=8 TeV

Correction DOI:10.1103/PhysRevD.95.039906Peer reviewe

Search for vectorlike charge 2/3 T quarks in proton-proton collisions at root(s)=8 TeV

Peer reviewe

Performance of reconstruction and identification of τ leptons decaying to hadrons and vτ in pp collisions at √s=13 TeV

The algorithm developed by the CMS Collaboration to reconstruct and identify τ leptons produced in proton-proton collisions at √s=7 and 8 TeV, via their decays to hadrons and a neutrino, has been significantly improved. The changes include a revised reconstruction of π⁰ candidates, and improvements in multivariate discriminants to separate τ leptons from jets and electrons. The algorithm is extended to reconstruct τ leptons in highly Lorentz-boosted pair production, and in the high-level trigger. The performance of the algorithm is studied using proton-proton collisions recorded during 2016 at √s=13 TeV, corresponding to an integrated luminosity of 35.9 fb¯¹. The performance is evaluated in terms of the efficiency for a genuine τ lepton to pass the identification criteria and of the probabilities for jets, electrons, and muons to be misidentified as τ leptons. The results are found to be very close to those expected from Monte Carlo simulation