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

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

• 감성과학
• /
• 제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.

• 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.

• 로봇학회논문지
• /
• 제19권2호
• /
• pp.196-202
• /
• 2024

The ability to understand given environments and plan a sequence of actions leading to goal state is crucial for personal service robots. With recent advancements in deep learning, numerous studies have proposed methods for state representation in planning. However, previous works lack explicit information about relationships between objects when the state observation is converted to a single visual embedding containing all state information. In this paper, we introduce graph-based state representation that incorporates both object and relationship features. To leverage these advantages in addressing the task planning problem, we propose a Graph Neural Network (GNN)-based subgoal prediction model. This model can extract rich information about object and their interconnected relationships from given state graph. Moreover, a search-based algorithm is integrated with pre-trained subgoal prediction model and state transition module to explore diverse states and find proper sequence of subgoals. The proposed method is trained with synthetic task dataset collected in simulation environment, demonstrating a higher success rate with fewer additional searches compared to baseline methods.

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

• 대한인간공학회지
• /
• 제19권1호
• /
• pp.1-9
• /
• 2000

This study was performed to investigate some characteristics on human error proneness in the computerized work environment. Our concerning theme was on human error likelihood according to personal temperament. Two experiments were performed. The first experiment was to study the effect of field- independence/dependence on error likelihood. The second experiment was on error proneness. These experiments were performed in information search task. which was most frequent task in computerized work environment such as the control room of nuclear power plant. Ten subjects were participated in this study. Analyzed results are as follows. Field-independence/dependence had a significant effect in both information search time and error frequency. Error proneness had a significant effect in both factors, too. And, a positive correlation was found between error frequency and information search time. These results will be utilized as a basis to study operator's error proneness in the computerized control room of nuclear power plant. later on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권9호
• /
• pp.2436-2457
• /
• 2023

The elderly population is rapidly increasing worldwide, but many face challenges in using digital tools like the Internet due to health and incapacity issues. Existing online search user interfaces (UIs) often overlook the specific usability needs of the elderly. This study proposes an adaptable web search UI model for the elderly, based on their perspectives, to enhance search performance and usability. The proposed UI model is evaluated through comparative usability testing with 20 participants, comparing it to the Google search UI. Effectiveness, efficiency, and satisfaction are measured using task completion time, error rate, and subjective preferences. The results show significant differences (p > 0.05) between the proposed web search UI model and the Google search UI. The proposed UI model achieves higher subjective satisfaction levels, indicating better alignment with the needs and preferences of elderly users. It also reduces task completion time, indicating improved efficiency, and decreases the error rate, suggesting enhanced effectiveness. These findings emphasize the importance of considering the unique usability needs of the elderly when designing search UIs. The proposed adaptable web search UI model offers a promising approach to enhance the digital experiences of elderly users. This study lays the groundwork for further development and refinement of adaptable web search UI models that cater to the specific needs of elderly users, enabling designers to create more inclusive and user-friendly search interfaces for the growing elderly population.

• 감성과학
• /
• 제12권4호
• /
• pp.489-500
• /
• 2009

본 연구는 정보검색의 핵심 개념인 적합성을 사용자 중심 관점에서 접근한 연구이다. 적합성에 관한 기존 연구들은 적합성 판단에 영향을 주는 다양한 기준들을 정의해 왔다. 본 연구는 적합성 유형별로 사용자가 적합성을 판단하는 기준과 적합성 유형 간의 관계를 정보 검색 과제별로 연구함으로써 사용자 중심 적합성 판단 모형을 알아보았다. 본 연구는 7개의 사용자 적합성 판단 기준-주제성, 신선성, 신뢰성, 이해가능성, 특수 성, 구체성, 흥미성-과 3가지의 사용자 적합성 유형-인지 적합성, 상황 적합성, 정서 적합성-을 고려하였다. 이를 대학생 사용자들을 대상으로 검색 과제 수행 후 설문에 답하는 반 제어(semi-controlled) 설문 방법을 이용하여 자료를 수집하였고, 구조방정식 모형으로 분석하였다. 연구 결과 주제성, 신뢰성은 모든 검색 과제에 중요한 적합성 판단 기준이었고, 과제 유형별로 볼 때 사실 검색 과제에서는 주제성, 신뢰성, 신선성, 구체성, 흥미성이, 문제 해결 검색 과제에서는 주제성, 신뢰성, 이해가능성, 특수성이, 의사 결정 검색 과제에서는 주제성, 신뢰성, 신선성, 이해가능성, 구체성, 특수성, 흥미성이 적합성을 판단하는 주요 기준들이라는 것을 확인할 수 있었다. 또한 적합성 유형들 간의 관계도 실증적으로 밝힐 수 있었다. 본 연구는 적합성 판단 기준과 적합성 유형 간의 관계를 정보 검색 과제별로 확인함으로써 보다 구체적인 사용자 중심의 적합성 판단 모형을 확립하였다는 점에서 의의를 가진다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.