• Journal of Korean Library and Information Science Society
• /
• v.40 no.4
• /
• pp.199-225
• /
• 2009

The purpose of this paper is to grow more interest and to forster research in full-texts retrieval of digitized books area through the review of Book Search Track and the analysis of research methods. First, this paper introduces the INEX tracks, the registration of INEX, the task process and the participating organizations. Second, to introduce the Book Search Track of all INEX tracks, this paper provides an overview of the test collection, the tasks, the task and submission guidelines and evaluation results of the Book Search Track's. Third, through paper review of the Book Search track that was lunched in 2007 as part of the INEX initiative, this paper presents the future research subject. This study expects that the readers are attracted by INEX tracks and full-texts retrieval of digitized books in korea.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.102-108
• /
• 2020

One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.42-48
• /
• 2004

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously. Meta-heuristic generally finds a good solution if it starts from a good solution. In this paper, a tabu search is presented to find a schedule of minimal time to complete all tasks. A modified tabu search is also presented which uses a new initial solution based on the best solution during the previous run as the new starting solution for the next iteration. Numerical results show that a tabu search and a modified tabu search yield a better performance than the previous studies.

• Science of Emotion and Sensibility
• /
• v.15 no.3
• /
• pp.367-380
• /
• 2012

The purpose of this research was to implement and verify an information retrieval(IR) system based on users' relevance criteria for information search tasks. For this purpose, we implemented an IR system with a dynamic ranking model using users' relevance criteria varying with the types of information search task and evaluated this system through user experiment. 45 participants performed three information search tasks on both IR systems with a static and a dynamic ranking model. Three Information search tasks are fact finding search task, problem solving search task and decision making search task. Participants evaluated top five search results on 7 likert scales of relevance. We observed that the IR system with a dynamic ranking model provided more relevant search results compared to the system with a static ranking model. This research has significance in designing IR system for information search tasks, in testing the validity of user-oriented relevance judgement model by implementing an IR system for actual information search tasks and in relating user research to the improvement of an IR system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• Korean Journal of Cognitive Science
• /
• v.16 no.3
• /
• pp.155-174
• /
• 2005

Oh and Kim (2004) and Woodman and Lurk (2004) demonstrated that spatial working memory (SWM) load Interfered concurrent visual search and that search process also impaired the maintenance of spatial information implying that visual search and SWM task both require access to the same limited-capacity mechanism. Two obvious possibilities have been suggested about what this shared limited-capacity mechanism is: common demand for attention to the locations where the items f9r the two tasks were presented (spatial attention load hypothesis), and common use of working memory to maintain a record of locations have been processed(SWM load hypothesis). To test these two hypothetical explanations, Experiment 1 replicated the mutual interference between visual search and SWM task in spite of difference of procedure with preceding researches; possible areas where the items for two tasks were presented were not separated. In Experiment 2, we presented the items for visual search either in the same quadrants where the items for SWM task had appeared (same-location rendition) or in the different quadrants (different-location condition). As a result, search efficiency was more impaired in the different-location condition than in the same-location condition. The memory accuracy was worse in the different-location rendition than in the same-location rendition. Overall results of study indicate that the mutual interference between SWM and visual search might be related to the overload of spatial attention, but not to that of SWM.

• Journal of Information Science Theory and Practice
• /
• v.5 no.4
• /
• pp.6-25
• /
• 2017

In this paper, a large-scale study on users' understanding of search-based advertising is presented. It is based on (1) a survey, (2) a task-based user study, and (3) an online experiment. Data were collected from 1,000 users representative of the German online population. Findings show that users generally lack an understanding of Google's business model and the workings of search-based advertising. 42% of users self-report that they either do not know that it is possible to pay Google for preferred listings for one's company on the SERPs or do not know how to distinguish between organic results and ads. In the task-based user study, we found that only 1.3 percent of participants were able to mark all areas correctly. 9.6 percent had all their identifications correct but did not mark all results they were required to mark. For none of the screenshots given were more than 35% of users able to mark all areas correctly. In the experiment, we found that users who are not able to distinguish between the two results types choose ads around twice as often as users who can recognize the ads. The implications are that models of search engine advertising and of information seeking need to be amended, and that there is a severe need for regulating search-based advertising.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1589-1596
• /
• 2005

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

• Annals of Clinical Neurophysiology
• /
• v.8 no.1
• /
• pp.44-47
• /
• 2006

Background: The present study used magnetoencephalography (MEG) to investigate the neural substrates for modified version of Treisman's visual search task. Methods: Two volunteers who gave informed consent participated MEG experiment. One was 27- year old male and another was 24-year-old female. All were right handed. Experiment were performed using a 306-channel biomagnetometer (Neuromag LTD). There were three task conditions in this experiment. The first was searching an open circle among seven closed circles (open condition). The second was searching a closed circle among seven uni-directionally open circles (closed condition). And the third was searching a closed circle among seven eight-directionally open circles (random (closed) condition). In one run, participants performed one task condition so there were three runs in one session of experiment. During one session, 128 trials were performed during every three runs. One participant underwent one session of experiment. The participant pressed button when they found targets. Magnetic source localization images were generated using software programs that allowed for interactive identification of a common set of fiduciary points in the MRI and MEG coordinate frames. Results: In each participant we can found activations of anterior cingulate, primary visual and association cortices, posterior parietal cortex and brain areas in the vicinity of thalamus. Conclusions: we could find activations corresponding to anterior and posterior visual attention systems.