Optimal Multiplicative Generalized Linear Search Plan for a Discrete Randomly Located Target

2021 ◽  
Vol 10 (1) ◽  
pp. 153-158
Keyword(s):  
Linear Search ◽  
Search Plan

scholarly journals Parabolic Spiral Search Plan for a Randomly Located Target in the Plane

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Mohamed Beltagy ◽  
Mohamed Abd Allah El-Hadidy
Keyword(s):  
Target Position ◽  
Expected Value ◽  
Dimensional Case ◽  
Linear Search ◽  
Search Technique ◽  
One Dimensional ◽  
Search Plan ◽  
Starting Point ◽  
Complete Revolution ◽  
The One

This paper addresses the problem of searching for a located target in the plane by using one searcher starting its motion from the point . The searcher moves along parabolic spiral curve. The position of the target has a known distribution. We show that the distance between the target position and the searcher starting point depends on the number of revolutions, where the complete revolution is done when . Furthermore, we study this technique in the one-dimensional case (i.e., when the searcher moves with linear search technique). It is desired to get the expected value of the time for detecting the target. Illustrative examples are given to demonstrate the applicability of this technique assuming circular normal distributed estimates of the target position.

scholarly journals Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Abd-Elmoneim Anwar Mohamed ◽  
Mohamed Abd Allah El-Hadidy
Keyword(s):  
Linear Search ◽  
Random Walker ◽  
Search Plan

Searching for the Random Walking microorganism cells

2019 ◽  
Vol 12 (06) ◽  
pp. 1950064 ◽  
Author(s):  
Mohamed Abd Allah El-Hadidy ◽  
Hamdy M. Abou-Gabal
Keyword(s):  
Expected Value ◽  
Random Walking ◽  
Search Technique ◽  
Cooperative Search ◽  
Search Plan ◽  
Unit Speed ◽  
Text Unit

In this paper, we present a complex cooperative search technique for finding the Random Walking microorganism cells on one of [Formula: see text]-intersect real lines at the origin. We have 2[Formula: see text] unit speed searchers starting together from the origin. Furthermore, proving the existence of a finite search plan, we are discussing the existence of optimality for this search plan which minimizes the expected value of the first meeting time between one of the searchers and the microorganism cells.

How it's done: search tools and techniques for major bibliographic databases

2021 ◽  
Vol 13 (5) ◽  
pp. 210-213
Author(s):  
Matt Holland ◽  
Michelle Dutton ◽  
Steve Glover
Keyword(s):  
Boolean Logic ◽  
Bibliographic Databases ◽  
Search Plan ◽  
Tools And Techniques

This article explains how to write an effective search plan using simple steps. The article takes you through the tools and techniques that are widely used in major bibliographic databases such as MEDLINE and CINAHL to conduct searches. These include Boolean logic, truncation and wildcards, in-field searching, proximity operators, limits and subject thesauri. Each process is illustrated with an example to help you apply them to your own searches. The process of using these tools and techniques to either narrow (find fewer results) or broaden (find more results) is described and summarised in an easy-to-use table.

Study on the existence of the transportation particle tracking model in the interactive medium

2021 ◽  
pp. 2150256
Author(s):  
Mohamed Abd Allah El-Hadidy ◽  
Alaa A. Alzulaibani
Keyword(s):  
Waiting Time ◽  
Particle Tracking ◽  
Necessary Conditions ◽  
Particle Detection ◽  
Particle Tracking Model ◽  
Search Plan ◽  
Tracking Process ◽  
Unit Speed ◽  
Tracking Model ◽  
Interactive Medium

This paper assumes that the particle jumps randomly (Guassian jumps) from one point to another along one of the imaginary lines inside the interactive medium. Since this study was done in the space, we consider that the position of the particle at any time [Formula: see text] has a multivariate distribution. The random waiting time of the particle for each Gaussian jump depends on its length. An identical set of programed nanosensors (with unit speed) were used to track this particle. Each line has a sensor that starts the tracking process from the origin. The existence of the necessary conditions which give the optimal search plan and the minimum expected value of the particle detection has been proven. This study is supported by a numerical example.

Sign in / Sign up

Export Citation Format

Share Document