Random search for a dark resonance
نویسندگان
چکیده
منابع مشابه
PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملSearch for Dark Matter
We know a lot about dark matter (DM). First of all we know it exists: modified gravity models cannot explain the spatial segregation between the regions where most of the mass is and where most of the visible matter is in the “bullet cluster” [1] (a cluster formed by two colliding galaxies). In this cluster, the regions where most of the gravitational potential is (as mapped though gravitationa...
متن کاملSearch for a dark photon at BABAR
We present the results of a search for a dark photon decaying to e + e − or µ + µ − in the BABAR detector [1]. We find no evidence for such a dark pho-ton and set upper limits on the dark mixing as a function mass, tightening the constraints on the parameter space of several dark sector theories. The notion of dark matter was introduced over 80 years ago by Zwicky [2]. In the intervening years,...
متن کاملIndirect Search for Dark Matter
Possible dark matter candidates are reviewed as well as indirect search methods based on annihilation or decay channels of these particles. Neutralino is presently the best particle candidate and its annihilation produces high energy neutrinos, antiprotons, positrons and γ -rays. To date, only upper limits on neutrino fluxes from the center of the Earth or the Sun, were established by different...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.022110