Total Search Time Research Articles

Migrating Mobile Applications to the Web: Adult Crash Cart Training.

Nurses and clinicians require knowledge and training of their facilities' code blue response cart to manage emergency scenarios. However, the nurses who access the carts change frequently through turnover and role changes. An augmented reality training solution was built for mobile devices, but encountered distribution and access challenges. This study evaluated the conversion of the mobile application to a desktop-based version deployed via a learning management system. Eight hundred fifty clinicians were assigned the interactive learning product, which collected anonymous usage data and an optional feedback survey within the module. Of 850 assigned users, 468 completed the module, and 338 completed the feedback survey. Respondents indicated a positive difference of 25.3% in retrospective pre/post confidence and an appreciation for the features of the product. Performance measured by decreasing total item search time appeared to level off after three plays. The format transition was successful, allowing the same widespread distribution as the mobile versions of [X]. Feedback gathered will drive improvements in the module.

Three-Dimensional Path Planning Based on Six-Direction Search Scheme.

In order to solve the problem of how to perform path planning for AUVs with multiple obstacles in a 3D underwater environment, this paper proposes a six-direction search scheme based on neural networks. In known environments with stationary obstacles, the obstacle energy is constructed based on a neural network and the path energy is introduced to avoid a too-long path being generated. Based on the weighted total energy of obstacle energy and path energy, a six-direction search scheme is designed here for path planning. To improve the efficiency of the six-direction search algorithm, two optimization methods are employed to reduce the number of iterations and total path search time. The first method involves adjusting the search step length dynamically, which helps to decrease the number of iterations needed for path planning. The second method involves reducing the number of path nodes, which can not only decrease the search time but also avoid premature convergence. By implementing these optimization methods, the performance of the six-direction search algorithm is enhanced in favor of path planning with multiple underwater obstacles reasonably. The simulation results validate the effectiveness and efficiency of the six-direction search scheme.

Defense against smart invaders with swarms of sweeping agents

The goal of this research is to devise guaranteed defense policies that allow to protect a given region from the entrance of smart mobile invaders by detecting them using a team of defending agents equipped with identical line sensors. By designing cooperative defense strategies that ensure all invaders are detected, conditions on the defenders’ speed are derived. Successful accomplishment of the defense task implies invaders with a known limit on their speed cannot slip past the defenders and enter the guarded region undetected. The desired outcome of the defense protocols is to defend the area and additionally to expand it as much as possible. Expansion becomes possible if the defenders’ speed exceeds a critical speed that is necessary to only defend the initial region. We present results on the total search time, critical speeds and maximal expansion possible for two types of novel pincer-movement defense processes, circular and spiral, for any even number of defenders. The proposed spiral process allows to detect invaders at nearly the lowest theoretically optimal speed, and if this speed is exceeded, it also allows to expand the protected region almost to the maximal area.

Visual search in infantile nystagmus syndrome

ABSTRACT Clinical relevance Research on infantile nystagmus syndrome (INS) and visual search is limited. Conducting this research could assist practitioners in understanding how INS affects the real-life visual activities of patients and aid in developing new clinical visual function assessments for INS. Background The aim of this work is to investigate how subjects with INS perform visual search tasks, and, particularly, to assess how INS subjects perform when targets are located at their null position or away from it, and when under additional cognitive demands. Methods INS subjects (N = 15) and controls (N = 20) performed conjunction and feature search tasks, both with and without mental arithmetic. Search performance was assessed using log-transformed total search time, gaze-dependent search time, and accuracy. Cognitive demand was quantified by pupil size and the NASA task-load index score. Results INS subjects showed longer search times compared to controls in conjunction search (P < 0.01), but not in feature search. Within INS and control subjects, the total search times were significantly increased by the addition of mental arithmetic (P < 0.0001). There was no difference in gaze-dependent search times between null target position and 15° away from null target position of subjects in conjunction search (P > 0.05). Accuracies were 100% for both control and INS subjects in both conjunction and feature search. Conclusion Conjunction visual search was impaired in adult INS subjects, and further worsened under increased cognitive demand. The null position did not affect the visual search performance in INS

Optimal pure strategies for a discrete search game

Consider a two-person zero-sum search game between a Hider and a Searcher. The Hider chooses to hide in one of n discrete locations (or “boxes”) and the Searcher chooses a search sequence specifying which order to look in these boxes until finding the Hider. A search at box i takes ti time units and finds the Hider—if hidden there—independently with probability qi, for i=1,…,n. The Searcher wants to minimize the expected total time needed to find the Hider, while the Hider wants to maximize it. It is shown in the literature that the Searcher has an optimal search strategy that mixes up to n distinct search sequences with appropriate probabilities. This paper investigates the existence of optimal pure strategies for the Searcher—a single deterministic search sequence that achieves the optimal expected total search time regardless of where the Hider hides. We identify several cases in which the Searcher has an optimal pure strategy, and several cases in which such optimal pure strategy does not exist. An optimal pure search strategy has significant practical value because the Searcher does not need to randomize their actions and will avoid second guessing themselves if the chosen search sequence from an optimal mixed strategy does not turn out well.

Application of the boyer moore method in the application dictionary of web-based information technology terms (case study: pt. erefka tiga pilar utama)

The emergence of many new terms in information technology because of the rapid development of technology makes people, especially those who pursue the IT field, must know and learn terms related to information technology. Therefore we need the availability of an information technology dictionary. Dictionary of the term information technology that circulates a lot in the form of printed media / books. However, dictionaries in the form of print media have a weakness in the form of a search process that takes a long time and cannot be updated at any time, therefore a digital / electronic dictionary exists to overcome this weakness. The dictionary application of the term information technology by applying the Boyer Moore algorithm in the search for the term word can help it. The Boyer Moore algorithm applies the good suffix principle where the character being searched for is parallel to the like character, as well as the principle of a bad character where if the character does not have similarities, it is immediately eliminated. The field used in this search is the word term, by entering the term search term as input in the search column, then we can find out the meaning of the term word. The results of this application display the entire pattern that matches the text, with a total search time below 300 milliseconds.

Optimal Resetting Brownian Bridges via Enhanced Fluctuations.

We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time t_{f} is finite and the searcher returns to its starting point at t_{f}. This is simply a Brownian motion with a Poissonian resetting rate r to the origin which is constrained to start and end at the origin at time t_{f}. We unveil a surprising general mechanism that enhances fluctuations of a Brownian bridge, by introducing a small amount of resetting. This is verified for different observables, such as the mean-square displacement, the hitting probability of a fixed target and the expected maximum. This mechanism, valid for a Brownian bridge in arbitrary dimensions, leads to a finite optimal resetting rate that minimizes the time to search a fixed target. The physical reason behind an optimal resetting rate in this case is entirely different from that of resetting Brownian motions without the bridge constraint. We also derive an exact effective Langevin equation that generates numerically the trajectories of a resetting Brownian bridge in all dimensions via a completely rejection-free algorithm.

Search for Smart Evaders With Swarms of Sweeping Agents

Suppose in a given planar region, there are smart mobile evaders and we want to detect them using sweeping agents. We assume that the agents have line sensors of equal length. We propose procedures for designing cooperative sweeping processes that ensure successful completion of the task, thereby deriving conditions on the sweeping velocity of the agents and their paths. Successful completion of the task means that evaders with a known limit on their velocity cannot escape detection by the sweeping agents. A simpler task for the sweeping swarm is the confinement of the evaders to their initial domain. The feasibility of completing these tasks depends on geometric and dynamic constraints that impose a lower bound on the velocity the sweeping agent must have. This critical velocity is derived to ensure the achievement of the confinement task. Increasing the velocity above the lower bound enables the agents to complete the search task as well. We present results on the total search time for two types of novel pincer-movement search processes, circular and spiral, for any even number of sweeping agents. The proposed spiral process allows detection of all evaders while sweeping at velocities that approach the theoretical lower bound.

Pyrene Excimer Formation (PEF) and Its Application to the Study of Polypeptide Dynamics.

This Perspective describes how the fluorescence blob model (FBM) has been developed and applied over the past 30 years to characterize the long-range backbone dynamics (LRBD) of polymers in solution. In these experiments, the polymers are randomly labeled with the dye pyrene, which forms an excimer upon the encounter between an excited and a ground-state pyrenyl label inside a finite subvolume of the polymer coil referred to as a blob representing the volume probed by the excited pyrene. By compartmentalizing the polymer coil into a cluster of identical blobs, FBM analysis of the fluorescence decays acquired with the polymers yields the number Nblob of structural units inside a blob. Since a flexible or rigid backbone will result in an Nblob that is either large or small, Nblob can be used as a measure of the flexibility of a given polymer. After having established that these experiments based on pyrene excimer formation (PEF) yielded quantitative information about the LRBD of a variety of polymers in solution, control experiments were carried out to characterize the effects that different molecular variables, such as the side-chain size (SCS) of a structural unit or the length of the linker connecting pyrene to the polymeric backbone, had on the parameters retrieved with the FBM. At this point, the FBM was applied to study the LRBD of polypeptides prepared from racemic mixtures of amino acids (aa's). These studies led to the establishment of simple rules that could be developed into mathematical equations to describe the LRBD of polypeptides. The Nblob values retrieved from the FBM analysis of the fluorescence decays acquired with the pyrene-labeled polypeptides could then be employed to predict the total conformational search time (τtcs) of any polypeptide based on their sequence. Strong correlations were found between the predicted τtcs and the experimental folding times of 145 proteins. The good quality of these correlations suggests that the blob-based approach described in this report might represent an interesting mathematical means for studying protein folding.

ETO

Recently, deep neural networks (DNNs) have achieved great success in various applications, where low inference latency is important. Existing solutions either manually tune the kernel library or utilize search-based compilation to reduce the operator latency. However, manual tuning requires significant engineering effort, and the huge search space makes the search cost of the search-based compilation unaffordable in some situations. In this work, we propose ETO, a framework for speeding up DNN operator optimization based on reusing the information of performant tensor programs. Specifically, ETO defines conditions for the information reuse between two operators. For operators satisfying the conditions, based on the performant tensor program information of one operator, ETO uses a reuse-based tuner to significantly prune the search space of the other one, and keeps optimization effectiveness at the same time. In this way, for a set of operators, ETO first determines the information reuse relationships among them to reduce the total search time needed, and then tunes the operators either by the backend compiler or by the reuse-based tuner accordingly. ETO further increases the reuse opportunities among the operators by injecting extra operators as bridges between two operators which do not satisfy the reuse conditions. Compared with various existing methods, the experiments show that ETO is effective and efficient in optimizing DNN operators.

Finding Substitutable Binary Code By Synthesizing Adapters

Independently developed codebases typically contain many segments of code that perform same or closely related operations (semantic clones). Finding functionally equivalent segments enables applications like replacing a segment by a more efficient or more secure alternative. Such related segments often have different interfaces, so some glue code (an adapter) is needed to replace one with the other. In previous work, we presented an algorithm that searches for replaceable code segments by attempting to synthesize an adapter between them from some finite family of adapters; it terminates if it finds no possible adapter. In this work, we compare binary symbolic execution-based adapter search with concrete adapter enumeration based on Intel’s Pin framework, and explore the relation between size of adapter search space and total search time. We present examples of applying adapter synthesis for improving security of binary functions and switching between binary implementations of RC4. We present two large-scale evaluations: (1) we run adapter synthesis on more than 13,000 function pairs from the Linux C library, and (2) we reverse engineer fragments of ARM binary code by running more than a million adapter synthesis tasks. Our results confirm that several instances of adaptably equivalent binary functions exist in real-world code, and suggest that adapter synthesis can be applied for automatically replacing binary code with its adaptably equivalent variants.

Validation of virtual reality system based on eye-tracking technologies to support clinical assessment of glaucoma.

The aim was to develop and implement a virtual reality tool based on eye-tracking technologies that allow to evaluate the characteristics of the gaze patterns of glaucoma patients in order to have a better understanding of the limitations that these patients experience in their daily life. This study took place on the Ophthalmology department of Hospital Clínico San Carlos, Madrid, Spain. In total, 56 participants collaborated in the study. They were divided in two groups, a group composed of 33 glaucoma patients selected by the Ophthalmology department and a control group composed of 23 healthy individuals. Both groups completed two virtual tasks while their gaze was being monitored. The first task, defined as "static" consisted in two exercises based on the observation of images. The second task, defined as "dynamic," consisted in a virtual driving simulator. Number of fixations, fixations duration, saccades amplitude and velocity, fixations/saccades ratio, total execution time, and other specific metrics were measured. These are the total search time for the second exercise of the first task and the number of collisions for the dynamic task. In addition, the dispersion of fixations was also discussed. For the two exercises of the static task, patients exhibited significative differences in terms of number of fixations (p = 0.012 in free observation exercise), mean saccadic velocity (p = 0.023 and 0.017), fixations/saccades ratio (p = 0.035 and 0.04), and also the search and total execution times of the visual search exercise (p = 0.004 and 0.027, respectively). For the dynamic task, significative differences were found on average saccades amplitude (p = 0.02), average saccades velocity (p = 0.03), and the number of collisions (p = 0.02). The results show that eye-tracking technologies can be used as a tool for evaluating the gaze patterns of glaucoma patients and differentiate them of healthy individuals. However, further studies with a larger cohort of participants and additional tasks are needed.

Context-Aware Decision Support for Anti-Submarine Warfare Mission Planning Within a Dynamic Environment

Anti-submarine warfare (ASW) missions are the linchpin of maritime operations involving effective allocation and path planning of scarce assets to search for, detect, classify, track, and prosecute hostile submarines within a dynamic and uncertain mission environment. Motivated by the need to assist ASW commanders to make better decisions within an evolving mission context, we investigate a moving target search problem with multiple searchers and develop a context-driven decision support tool for the ASW mission planning problem. Given the spatial probability distribution of a target submarine, sensor detection probability surfaces from meteorological and oceanographic products, and the risk to the fleet as a function of distance of the target from the fleet, we model and formulate the ASW asset allocation and search path planning problem using a hidden Markov modeling framework. We propose a two phase approach to solve this NP-hard problem. In phase I, we partition the geographic area, satisfying contiguity constraints, into search regions using an evolutionary algorithm (EA) coupled with a Voronoi tessellation approach, and allocate the assets to partitioned search areas using the auction algorithm. In phase II, we construct a dynamic search plan for each asset over the search interval using EA. We evaluate our approach via a hypothetical ASW scenario to monitor an enemy submarine in a geographic region via multiple assets. We compare our results to various search path planning strategies that, using the context-driven decision support tool developed here, revise the search regions at periodic intervals given a fixed total search time.

Active object search in an unknown large-scale environment using commonsense knowledge and spatial relations

In this study, the goal is to efficiently and actively search for a target object in a previously unknown large-scale environment. To this end, we develop a probabilistic environment model that can utilize spatial commonsense knowledge and environment-specific spatial relations. The model evaluates the merit of exploring each possible viewpoint in the environment to find the target object. Then, the path planning method incorporates the estimated value of these viewpoints and the time cost between them to generate an efficient search path that minimizes the total search time. We also describe a search space reduction method that improves the feasibility of the proposed approach in large-scale environments. To validate the approach, we compare the search times of the proposed method to those of human participants, a coverage-based search and a random search in simulation experiments. The results show that the proposed method can generate search paths with similar search times to those of human participants, while clearly outperforming the coverage-based and random search methods. We also demonstrate the applicability of the approach in real-world experiments in which the robot could find the target object without a single failure case in 70 trials.

The Relationship Between Cognitive Abilities and the Decision-Making Process: The Moderating Role of Self-Relevance.

This study investigated the relationship between cognitive abilities and age differences in information search and the moderating role of task self-relevance by measuring the decision-making processes of participants in both high and low self-relevance decision-making tasks. The sample included 57 young and 65 older adults. They viewed five-alternative × five-attribute decision matrices that required them to open, with a mouse click, the information cells that interested them. Processing speed, verbal fluency, working memory, and vocabulary were measured as cognitive abilities. The dependent variables were search engagement (including time-related engagement and frequency-related engagement) and search pattern (calculated based on alternative-based or attribute-based search). The results from structured equation modeling showed that age negatively predicted these cognitive abilities (processing speed, verbal fluency, working memory, and vocabulary) and positively predicted information search engagement. Processing speed mediated the effect of age on study time per cell under tasks with both high and low self-relevance. Verbal fluency, meanwhile, mediated the total search time and checking time per cell when the task was highly self-related but not when the task had low self-relevance. These results suggest that self-relevance can moderate the mediation effect of verbal fluency on the relationship between age and information search time; this means that older adults whose verbal fluency was limited require relatively more time to search information to make an informed decision. However, this effect is only sufficient when the decision-making task is highly self-related and provokes more engagement motivation toward it.

An Evolutionary Algorithm for Optimal Multi-Direction Search Route in Search and Rescue Operation

Enhancing the effectiveness of search and rescue operation at sea is the utmost importance. Once the search area has been identified, the success of search and rescue operations depends on search and rescue vessel swept the probability area of the distress object with the minimum search time, this is an important element to the success of search and rescue operation as it minimizes the risk and the cost for search and rescue team. However, determining the optimal search route to find the distress object is extremely complex because weather conditions, winds, waves, and currents always change constantly, whereas the condition of the search and rescue vessel also changes. The present article proposes the use of a bacterial foraging optimization algorithm and applies it to finding the optimal multi-direction search route for search and rescue vessel. The cost function takes into the consideration of the total search time as well as the probability of quick find of the object in distress. In this paper, the Monte Carlo simulation method is used to predict the most probable drift area of the distress object, and then a swarm of 10 bacteria is deployed for searching the optimal SAR route. It can be seen from the calculation result that the bacteria swarm has concentrated rather well after just several generations. The optimal search path is reasonable for the dominant weather conditions and is accordance with the popular code of practice.

Diurnal feeding strategies of the Ferruginous Duck (Aythya nyroca) in Lake Tonga (Northeastern Algeria)

Abstract Although the Ferruginous Duck (Aythya nyroca) has thoroughly been studied, the foraging behaviour of this species is still not completely known. In the present paper we studied the diurnal feeding behaviour of ducks. We monitored the annual cycle of birds through two fieldtrips per month. The instantaneous behaviour of birds was recorded in regular 30-minute intervals from 7 a.m. to 4:30 p.m., amounting a total of 456 observation hours. Food searching activity corresponds to a quarter of the total diurnal time budget of the Ferruginous Duck. Foraging behaviour was classified into five categories dominated by the “diving”, which is almost 45.61% of the total search time. Foraging activities at the water surface considered to be secondary activities, including feeding by “bill”, “neck and head”, and “beak and head” in a rate of 19.86%, 14.53%, and 13.98%, respectively. The “toggle” remains a minor activity and represents only 5.99% of foraging time. The feeding behaviour of this species correlated to several environmental parameters (rainfall, temperature and wind velocity), and linked to the group size of ducks visiting the lake. Regarding the food intensity, our results show the highest values for “bill and head” behaviour. “Diving” has the longest feeding interval (16.16±14.1 minutes), while foraging by “bill” has the shortest (0.69 ± 0.48 minutes).

Parking policy as an instrument for reducing passenger cars’ harmful emissions

Passenger car related harmful gas emissions have become one of the most significant problems that cities worldwide are facing during the last thirty years. One of the approaches to harmful emissions reduction is certainly preventing or reducing traffic congestion in central urban areas and high trip-attraction zones. One of the congestion influence factors, i.e. (already low) traffic flow speed further reduction, is parking, that is search for a vacant on-street parking space. Since parking search is primarily due to the high occupancy of parking spaces, (better) parking management can affect its reduction. The paper presents the impact of parking time limit and parking price on the passenger cars’ total parking search (cruising for parking) time, as well as their related harmful gases emissions. A survey presented in this paper was carried out in the central urban area of Belgrade, the so-called red parking zone, in order to examine the passenger car users’ preference regarding the parking time limit and parking price variations. The potential benefits in the field of air pollution and fighting climate change due to the implementation of a balanced parking policy and on-street parking price were analysed in this paper.

Head Position of Patients with Right Hemisphere Damage during a Visual Search Task in a Large Field

Spatial neglect syndrome with cerebral lesions is characterized by the ina-bility to orient, report, or respond to relevant visual stimuli contralateral to the lesions. In this study, we investigated the pattern of horizontal visual search in a large space; this search was performed by patients with right hemisphere damage caused by cerebrovascular disease. The neck rotation angle and search time in each increment were continuously recorded during the task, and quantitative data of the measurements were collected. Head position during the visual search task in a large space (%) was then calculated. We set angular bands in increments of 5 degrees from the midline on the left and right sides, and calculated the total search time in each angular band. In patients with unilateral spatial neglect (USN), the search time in the angular band of 5 - 9 on the right side was significantly longer (with USN 16.7%, without USN 4.5%, t = 2.52, df = 16, p < 0.05). Furthermore, in patients with neglect in the leftmost end area in a large space, the search time was significantly shorter in the angular band of 1 - 4 degrees to the left (with neglect 13.1%, without neglect 23.7%, t = 2.13, df = 16, p < 0.05), and tended to be long in the angular band of 5 - 9 to the right. The neck rotation angle and pattern during the search task in a large field deviated slightly to the right, and the search time slightly to the left was short. We believe that these results support the rightward deviation of the search pattern and frame of USN patients.

When two heads are better than one

Purpose The purpose of this paper is to explore the differences between collaborative and individual search techniques in a scenario-based task focussed on query behavior, cognitive load, search time, and task type about the search. Design/methodology/approach To help understand the influences on searching for relevant information in pairs or individual contexts, the authors conducted an exploratory user study with 30 participants, using two search tasks completed in a controlled laboratory setting. Findings On the basis of the analysis, the authors found that collaborative search teams resulted in more queries, more diverse query terms, and more varied query results compared to those working individually. The study results indicated that the cognitive load imposed on the participants did not differ between a collaborative search and an individual search except for the component of performance on the NASA Task Load Index. The results further showed that the total search time was a significant difference on average between the two conditions (i.e. individual information search and collaborative information search) for the second task. And there were significant differences of the mean of total search time between the two tasks for the both conditions. The authors also found that there was no significant relationship between query behavior and the total cognitive load. Originality/value The findings from this study have implications for a better understanding of collaborative search interface design, searchers’ cognitive load, query behavior, and general collaborative information search.