The goal of this study is to understand whether providing a search intermediary familiar with a problem domain and its topical structure would support a user " s Web searching tasks, especially complicated tasks with multifaceted topics, and whether the order of searching tasks or system usage influences their successful completion. This study investigates the effect of two factors, the interac...

Multimedia Web searching is a significant information activity for many people. Major Web search engines are critical resources in people’s efforts to locate relevant online multimedia information. It is therefore important that we understand how searchers are utilizing these Web information systems in their quest to retrieve multimedia information to design effective Web systems in support of ...

Searching algorithms are closely related to the concept of dictionaries. String searching algorithms are too complex in all sorts of applications. To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is stated...

As a novel optimization technique, chaos has gained much attention and some applications during the past decade. For a given energy or cost function, by following chaotic ergodic orbits, a chaotic dynamic system may eventually reach the global optimum or its good approximation with high probability. To enhance the performance of the local search method (LS), which is based on the generalized re...

To address the issue of unpractical and inefficient terrain page searching in terrain scheduling of flight simulations, we studied the scheduling problem for further optimization. Firstly the page format organization using the holding-boundary idea was introduced, which well disposed of the rendering sub-problem in scheduling. Then based on the organized pages, we proposed the branch-and-bound ...

In this paper we propose a fast algorithm for the bivariate interpolation of large scattered data sets. It is based on the Partition of Unity Method (PUM) [3] and involves radial basis functions as local approximants. The PUM algorithm is efficiently implemented and optimized by connecting the method itself with an effective cell-based searching procedure. More precisely, we construct a cell st...

Fig. 9. The searching tree after inputting the same task command for the second time (with the initial state the same as in the first time). The desired node picked up by the explanation-based learning engine is node 28 and the generated searching template is supe-rior_order([next_to(_, _), on(_, _)]). When the same task command was inputted for the second time (with the initial state the same ...

How should the efficiency of searching for real objects in real scenes be measured? Traditionally, when searching for artificial targets, e.g., letters or rectangles, among distractors, efficiency is measured by a reaction time (RT) × Set Size function. However, it is not clear whether the set size of real scenes is as effective a parameter for measuring search efficiency as the set size of art...