• 한국도서관정보학회지
• /
• 제40권4호
• /
• pp.199-225
• /
• 2009

본 연구의 목적은 XML 검색 추진체인 INEX의 실험트랙 중에서 Book Search 트랙의 실험을 소개하고 실험방법을 분석함으로 XML기반의 디지털화된 도서 검색에 대한 관심과 더 많은 연구를 이끌어내고자 함이다. 이를 위해 첫째, INEX 실험트랙, 실험트랙 참여방법, 절차 및 참여기관을 상세히 소개한다. 둘째, INEX의 다양한 실험트랙 중, 디지털화된 도서검색을 위한 Book Search 트랙을 소개하기 위해, 이 트랙의 테스트컬렉션과 실험태스크, 실험결과 제출방법 및 평가방법을 제공한다. 셋째, 2007년에 시작된 INEX Book Search 트랙의 연구 논문들을 분석해봄으로 향후 연구과제들을 밝혀본다. 본 연구가 INEX 실험트랙에 대한 관심과 디지털화된 도서검색에 대한 관심을 국내에서 불러일으키는 계기가 되기를 기대해 본다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권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.

• 산업경영시스템학회지
• /
• 제27권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.

• 감성과학
• /
• 제15권3호
• /
• pp.367-380
• /
• 2012

본 연구는 정보 검색 과제별 주요 적합성 판단 기준을 실제 정보 검색 시스템으로 구현해 보고 사용자 평가를 통해 그 효과를 검증해 보고자 하였다. 이를 위해, 사용자 적합성 판단 기준들을 정보 검색 시스템에서 적합성을 결정하는 검색 랭킹 모델의 랭킹 요소들로 적용하였다. 그리고 정보 검색 과제별 차이가 있는 동적 검색 랭킹 모델과 차이가 없는 정적 검색 랭킹 모델을 시스템으로 구현하였고, 이에 대한 사용자 평가를 진행하여 비교해 보았다. 총 45명의 참가자가 실험에 참여하였고, 정보 검색 과제별 차이가 있는 동적 검색 랭킹 모델과 차이가 없는 정적 검색 랭킹 모델이 적용된 각각의 검색 시스템에서 3개의 검색 과제를 수행하였다. 3개의 정보 검색 과제로는 사실 검색 과제, 문제 해결 검색 과제, 의사 결정 검색 과제가 사용되었다. 각 참가자는 검색 결과 첫 페이지 상위 5 개의 검색 결과에 대해 적합성 정도를 7 점 척도로 평가하였다. 그 결과, 사용자는 전반적으로 모든 검색어에 동일하게 반응하는 정적 검색 랭킹 모델을 적용한 시스템보다 정보 검색 과제별로 사용자 적합성 판단기준의 변화에 따라 랭킹 요소 가중치를 달리한 동적 검색 랭킹 모델을 더 높이 평가하는 것을 확인할 수 있었다. 본 연구는 이를 통해, 정보 검색 과제를 고려한 정보 검색 시스템 디자인의 필요성과 함께, 사용자 중심 적합성 판단 모형 연구 결과를 실제 정보 검색 시스템으로 구현하여 평가함으로써 사용자 중심 적합성 연구 결과의 타당성을 검증하였다는 점, 그리고 사용자 연구 접목을 통한 시스템 개선의 중요성을 강조하였다는 점에서 의의를 가진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 한국군사과학기술학회지
• /
• 제17권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.

• 인지과학
• /
• 제16권3호
• /
• pp.155-174
• /
• 2005

최근 연구들은 공간적 작업기억 과제를 수행하면서 시각 탐색 과제를 수행했을 때 시각 탐색의 효율성과 작업기억 과제의 정확률이 동시에 낮아지는 결과를 보고하였다(Oh & Kim, 2004; Woodman & Luck, 2004). 이러한 결과는 두 과제의 처리 과정이 동일한 인지적 자원을 요구하기 때문인 것으로 해석할 수 있는데, 동일한 인지적 자원은 공간적 주의(공간적 주의 부하 가설)나, 공간적 작업기억(공간적 작업기억 부하 가설), 혹은 이 둘과 모두 관련될 가능성이 있다. 시각 탐색과 공간적 작업기억 간 상호 간섭의 기제를 밝히기 위해 작업기억에 유지해야 하는 위치와 공간적 주의를 사용해야 하는 시각 탐색의 자극 위치를 변화시켜 2개의 실험을 수행하였다. 실험 1에서는 공간적 작업기억 과제의 자극을 탐색 자극이 제시될 수 있는 주변 영역에 제시하는 경우에도 두 과제간의 간섭이 나타남을 보임으로써 이전 연구 결과들을 재확인하였다. 실험 2에서는 기억 자극과 탐색 자극을 모두 동일한 사분면에 제시하는 경우와 그렇지 않은 경우에서 시각 탐색과 작업기억 과제 수행을 비교하였다. 실험 결과 시각 탐색의 효율은 시각 탐색 과제만을 수행한 조건과 동일 위치 조건에 비해 비동일 위치 조건에서 유의미하게 저하되었다. 공간적 작업기억 과제의 정확률역시 다른 조건보다 비동일 위치 조건에서 더 낮게 나타났다. 이러한 결과들은 선행 연구들에서 밝혀진 공간 기억과 시각 탐색간의 상호 간섭이 작업기억의 과부하보다는 공간적 주의의 과부하로 인한 것임을 시사한다.

• Journal of Information Science Theory and Practice
• /
• 제5권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.

• 한국멀티미디어학회논문지
• /
• 제8권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
• /
• 제8권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.