69,057 Hits in 4.5 sec

Optimizing event selection with the random grid search

Pushpalatha C. Bhat, Harrison B. Prosper, Sezen Sekmen, Chip Stewart
2018 Computer Physics Communications  
The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s.  ...  One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables  ...  Optimizing SUSY razor boost with RGS The random grid search is particularly useful for efficiently optimizing searches for new physics.  ... 
doi:10.1016/j.cpc.2018.02.018 fatcat:tosebhxbnbhmtjluv5it3uh77e

A Self-Deployment Algorithm for Maintaining Maximum Coverage and Connectivity in Underwater Acoustic Sensor Networks Based on an Ant Colony Optimization

Hui Wang, Youming Li, Liliang Zhang, Yexian Fan, Zhiliang Li
2019 Applied Sciences  
The main characteristic of the MCC-ACO algorithm is that it fully considers the effects of the changes in the event quantities and the random distribution of the nodes on the deployment effect of the nodes  ...  We carry out the greedy strategy, improve the path selection probability and pheromone update system, and propose a self-deployment algorithm based on the foundation of standard ant colony optimization  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app9071479 fatcat:sc43orxlvzfnxl5jdhbstw7nxi

Virtual Cluster Model in Clustered Wireless Sensor Network Using Cuckoo Inspired Metaheuristic Algorithm

May Kamil Al-Azzawi, Juan Luo, Renfa Li
2015 International Journal of Hybrid Information Technology  
The motivation for this virtual cluster is to create a virtual cluster environment with heterogeneous resources from clusters with homogeneous nodes when a critical event take place and need a service  ...  Cuckoo Search Optimization (CSO) algorithm is necessary as inspired nature technique to improve the availability of sensor nodes by electing the optimum sensor node from each cluster according to precise  ...  When the critical event is detected by a sensor, in one of the network clusters (C j ), (Vir_Clu_Gen) search optimization algorithm is triggered to select the optimum sensor from each cluster (C i ) that  ... 
doi:10.14257/ijhit.2015.8.4.16 fatcat:abdmjnt43vhubm5s7mrxuahpzu

Enhancing Divergent Search through Extinction Events

Joel Lehman, Risto Miikkulainen
2015 Proceedings of the 2015 on Genetic and Evolutionary Computation Conference - GECCO '15  
The results show that combining extinction events with divergent search increases evolvability, while combining them with convergent search offers no similar benefit.  ...  The conclusion is that extinction events may provide a simple and effective mechanism to enhance performance of divergent search algorithms.  ...  Extinction Events The approach in this paper is to augment EAs with extinction events. The idea is that mass extinctions may indirectly select for the ability to diversify quickly.  ... 
doi:10.1145/2739480.2754668 dblp:conf/gecco/LehmanM15 fatcat:7g335vpxnff4bcf5idspxmf5yq

Deep Neural Network based Wide-Area Event Classification in Power Systems [article]

Iman Niazazari, Amir Ghasemkhani, Yunchuan Liu, Shuchismita Biswas, Hanif Livani, Lei Yang, Virgilio Centeno
2020 arXiv   pre-print
The proposed DNN is trained using Bayesian optimization to search for the best hyperparameters.  ...  The effectiveness of the proposed event classification is validated through the real-world dataset of the U.S. transmission grids.  ...  One other way is to apply a random search to find the most optimal model.  ... 
arXiv:2008.10151v1 fatcat:24rmq5cxwrehjk4woyemrx3vxe

FastBit: an efficient indexing technology for accelerating data-intensive science

Kesheng Wu
2005 Journal of Physics, Conference Series  
In this paper, we first describe the searching capability of FastBit, then briefly highlight two applications that make extensive use of FastBit, namely Grid Collector and DEX.  ...  Compared with other optimal indexing methods, bitmap indices are superior because they can be efficiently combined to answer multi-dimensional queries whereas other optimal methods can not.  ...  Grid Collector provides the end user with a convenient way to specify events to be analyzed and at the same time avoids reading the unwanted events.  ... 
doi:10.1088/1742-6596/16/1/077 fatcat:sdkkr2ay2vgfdhxw2744xqrqmu

Optimization of Configuration Parameter Set in Video Analysis

Jakub Król, AGH University of Science and Technology, Kraków, Poland, Michał Grega
2019 Journal of Image and Graphics  
We apply those algorithms in order to select the best configuration parameters and compare them in the context of our system aiming at automated detection of dangerous tools.  ...  In this paper we describe and compare several automated optimization algorithms used for selection of these parameters.  ...  The first of the optimization approaches was to use random search as it has been shown to be more efficient than grid or manual search [17] .  ... 
doi:10.18178/joig.7.4.130-133 fatcat:ma6634xq3nhipbdusakturkrl4

A Tabu Search WSN Deployment Method for Monitoring Geographically Irregular Distributed Events

Nadjib Aitsaadi, Nadjib Achir, Khaled Boussetta, Guy Pujolle
2009 Sensors  
To overcome the computational complexity of an exact resolution, we propose an original pseudo-random approach based on the Tabu Search heuristic.  ...  Our resulting WSN deployment problem is formulated as a Multi-Objectives Optimization problem, which seeks to reduce the gap between the generated events detection probabilities and the required thresholds  ...  . • Step 3: In L init , select the point p (x,y) with the highest Bernoulli parameter, and remove it from the list.  ... 
doi:10.3390/s90301625 pmid:22573977 pmcid:PMC3345852 fatcat:x426hrnarvewpj524kjr3jtcqy

Facies and Fracture Network Modeling by a Novel Image Processing Based Method

Peyman Mohammadmoradi
2013 Geomaterials  
The aim is then to reproduce these training patterns within the final image. This work presents a multiple grid filter based MPS algorithm to facies and fracture network images reconstruction.  ...  In this approach, the patterns of the final image (geological model) are obtained from a training image that defines a conceptual geological scenario for the reservoir by depicting relevant geological  ...  If some patterns have the same distance to the data event vector, the one with the most frequency is selected. Random selection of patterns is only allowed when they all have the same frequency.  ... 
doi:10.4236/gm.2013.34020 fatcat:a3z54sqf7baexnpasqhkpizfhy

Modified FILTERSIM Algorithm for Unconditional Simulation of Complex Spatial Geological Structures

Peyman Mohammadmoradi, Mohammadreza Rasaei
2012 Geomaterials  
It decreases the complexity of computation, accelerates search process and increases CPU performance compare to other MPS methods by transferring training image patterns to a lower dimensional space.  ...  The results quality is not however as satisfactory.  ...  If some patterns have the same distance to the data event vector, the one with the most frequency is selected. Random selection of patterns is only allowed when they all have the same frequency.  ... 
doi:10.4236/gm.2012.23008 fatcat:wmrmr363srgerfhslhq5qi3uvu

A New Method to Select Training Images in Multi-Point Geostatistics

Lixin Wang, Yanshu Yin, Wenjie Feng
2018 Open Journal of Yangtze Oil and Gas  
The selection of optimal training image was achieved by combining the probability of repeated events and the probability of overall repetition of single data events.  ...  Based on the understanding, a new method was presented in this paper to select the training image.  ...  Acknowledgements The work presented in the paper was financially supported by the National  ... 
doi:10.4236/ojogas.2018.32010 fatcat:mctpm44fybadvd5bex7raffi3y

Quickest Localization of Anomalies in Power Grids: A Stochastic Graphical Framework [article]

Javad Heydari, Ali Tajer
2017 arXiv   pre-print
Agile localization of anomalous events plays a pivotal role in enhancing the overall reliability of the grid and avoiding cascading failures.  ...  The process resumes until the location of the anomaly can be identified with desired reliability.  ...  Next, by leveraging the results of theorems 1 and 2 we provide an optimal bus selection rule for the general setting with arbitrary number of anomalous events, M , and number of measurements taken at-a-time  ... 
arXiv:1702.01576v1 fatcat:veahcbbr7ngizomi2xbwtqzxrm

Tuning Random Forest Parameters using Simulated Annealing for Intrusion Detection

Among these parameters the hyper parameters are selected based on three decision factors, randomness; split rule; tree complexity.  ...  It leads to poor accuracy and less efficiency in intrusion detection since enormous events have to be analyzed. So the parameters of RF have to be optimized by an efficient method.  ...  The approaches for tuning hyper parameters of any classifier are grid search and random search.  ... 
doi:10.35940/ijitee.h6799.079920 fatcat:pir5aaa3bvgorpjenoe4rqmdwu

Optimizing and validating the Gravitational Process Path model for regional debris-flow runout modelling

Jason Goetz, Robin Kohrs, Eric Parra Hormazábal, Manuel Bustos Morales, María Belén Araneda Riquelme, Cristián Henríquez, Alexander Brenning
2021 Natural Hazards and Earth System Sciences  
We propose a two-stage optimization approach for automatically selecting parameters for estimating runout path and distance. This approach optimizes the random-walk and Perla et al.'  ...  Our research in this paper focuses on developing a novel approach for optimizing runout models for regional susceptibility modelling, with a case study in the upper Maipo River basin in the Andes of Santiago  ...  Model component Model parameter Grid search Grid search Optimal value Spatial CV value range steps performance Runout path Slope threshold 20-40 • 2 • 40 • AUROC (random walk) Exponent of  ... 
doi:10.5194/nhess-21-2543-2021 fatcat:3lyqkx3dj5covekn5l22rrejje

Trade-offs between selection complexity and performance when searching the plane without communication

Christoph Lenzen, Nancy Lynch, Calvin Newport, Tsvetomira Radeva
2014 Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14  
We consider n agents searching for a target in the plane, within an (unknown) distance D from the origin. We identify log log D as a crucial threshold for our selection complexity metric.  ...  In this spirit, we propose a selection complexity metric χ for the ANTS problem [Feinerman et al.].  ...  There have been works on graph exploration with multiple agents [3, 9, 15] ; while [3] and [15] do not include any memory bounds, [9] presents an optimal algorithm for searching in a grid with constant  ... 
doi:10.1145/2611462.2611463 dblp:conf/podc/LenzenLNR14 fatcat:3fxp3z7hfbg6bcfihbrqeohdee
« Previous Showing results 1 — 15 out of 69,057 results