• International Journal of Knowledge Content Development & Technology
• /
• v.9 no.1
• /
• pp.19-42
• /
• 2019

This study examined activities involving the finding, organizing, managing, and re-finding of information by knowledge workers in Kuwait. This research also conducted a review of the tools needed for effective personal information management (PIM) and assessed perceptions about improving PIM through Internet use. Data were collected through semi-structured interviews conducted among 26 graduates of the Department of Information Studies at Kuwait University. These participants are currently employed in different sectors engaged in a variety of information-related activities. This study's findings indicated that participants gathered different types of information from a variety of sources. This information was stored using several devices and services, including desktop computers, shared drives, clouds, bookmarked websites, e-mail correspondence, and favorites lists. Participants organized information in personal folders according to categories such as subject/topic, time, project, document type, and geographical region. Preferred methods for information re-finding included searching by keyword and browsing through folders. Interviewees reported problems of information overload, fragmentation, and anxiety. Most were active in social media via mobile device, while some of them used Siri or Ask Google to retrieve information. Tools used for PIM included calendars, tasks, schedules, e-mail management tools, clouds, and social networking tools. Participants reported that the Internet helped with personal information management practices, but that some privacy issues arose in this context.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.49-62
• /
• 2000

This paper suggests the developing scheme of trade-finding site after observing the customer-finding methods, which is the most basic in trade, among all kinds of customer-finding methods by using the internet and discussing the present condition and problems of trade-finding site which is used most frequently.

• Journal of Korean Society of Transportation
• /
• v.19 no.6
• /
• pp.183-194
• /
• 2001

The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.

• Journal of the Korean Society for information Management
• /
• v.25 no.4
• /
• pp.25-42
• /
• 2008

The research was conducted to investigate factors that facilitate users' finding books by analyzing classifications in public library and bookstore. This research was based on the assumption that the users' needs and information behaviors are similar in both public library and bookstore. The main purpose of this study is not to recommend classifying public library collections the way a bookstore does, but to figure out what makes the users' book finding more convenient by analyzing the classifications. To carry out the research, users' book finding in public library and classifications of public library and bookstore are analyzed. Then, a survey was conducted to investigate users' book finding behaviors, degree of convenience in finding books according to different classifications and the causes of the convenience. The results of the research showed that bookstore's classification was more convenient for the users in finding books.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.711-714
• /
• 1989

Autonomous mobile robot Yamabico and his newly developed ultrasonic range finding module(URF) are described. Yamabico is a self-contained autonomous robot for in-door environment. It has a modularized architecture, which consists of master module, ultrasonic range finding module, locomotion module, voice synthesizer module and console. Newly developed ultrasonic range finding module has a 68000 processor and Dual-port memory for communication. It controls the ultrasonic transmitters and receivers and calculate the range distances for 12-direction, simultaneously within every 60 milliseconds.

• Architectural research
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2015

A simple force-finding process based on an optimization technique is proposed for tensegrity structures. For this purpose, the inverse problem of form-finding process is formulated. Therefore, the position vector of nodes and element connectivity information are provided as priori. Several benchmark tests are carried out to demonstrate the performance of the present force-finding process. In particular, the force density distributions of simplex tensegrity are thoroughly investigated with the important parameters such as the radius, height and twisting angle of simplex tensegrity. Finally, the force density distribution of arch tensegrity is produced by using the present force-finding process for a future reference solution.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.696-698
• /
• 2022

게임에서는 장애물이 가로 막고 있을 때 길 찾기 알고리즘이 요구된다. Path Finding Method 는 길과 장애물을 고려하여 목적지까지의 경로를 찾는 방법을 말한다. A^* 알고리즘은 이런 복잡한 미로 찾기에 최적화된 Path Finding 알고리즘이다. 하지만, 모바일 같은 저비용 기기에서 A^* 알고리즘을 사용하기엔 단순한 지형에서도 연산 부하가 발생할 수 있다. 본 논문에서는 가상의 공간에서 Grid를 구축하여, 통행이 가능한 곳과 불가능한 곳을 나누어 최종 지점에 도달할 수 있도록 하는 방식을 제안한다. 본 논문에서 제시한 Path Finding Method 는 최종 지점이 막다른 길인 경우 가장 가까운 이동 가능한 경로로 길을 안내하도록 설계하여 예외 상황에 대처했다. 대표적인 길 찾기 알고리즘인 Dijkstra 알고리즘은 최소 비용을 고려해서 최단으로 가는 거리를 비교하여 길을 나타낼 수 있다. 하지만, Dijkstra 알고리즘 경우 비용이 양수가 아닌 음수의 경우 무한 루프에 빠지는 등 결과 값이 제대로 나오지 않을 수 있다. 본 논문에서 제안한 Path Finding Method 는 최소 비용을 노드별로 비교하는 방식이 아닌 초기 비용을 알 수 없는 분야에 쉽게 사용할 수 있다. 본 논문에서는 제안한 Path Finding Method 를 적용하여 Web 게임을 제작하는 것에 성공하였다. 향후, Path Finding Method 결과에 위치 정렬 알고리즘을 적용하여, 중복된 지역을 가는 확률을 최소화하면서 정리된 Path 가 돌출되도록 연구할 예정이다. 본 논문의 Path Finding Method 은 게임 개발 분야에 적극 기여되길 바란다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• The Korean Journal of Archival Studies
• /
• no.8
• /
• pp.181-211
• /
• 2003

The purpose of this study is to reveal the context within which EAD was developed, to review the elements and the structure of EAD 1.0 version and to introduce EAD as new standard for encoded archival finding aids in Korea. Encoded Archival Description(EAD) has been developed in 1993 in order to facilitate exchange of ISAD(G) descriptive information. EAD is currently administered and maintained jointly by the Society of American Archivists and the United States Library of Congress. While development was initiated in the United Stares, international interest and contribution are increasing. EAD is a encoding standard designed specifically for marking up information contained in archival finding aids. From its inception, EAD was based on SGML, and, with the release of EAD version 1.0 in 1998, it is also compliant with XML in order to facilitate easier internet access to SGML-encoded finding aids. EAD is the first tool to preserve the multilevel and hierarchical description manifest in finding aids by providing structures in which to describe entire record collections and increasingly smaller subcomponents thereof such as series, subseries, folders, and even items. Archival institutions can form a EAD consortium and also create a union database of EAD finding aids for the geographically dispersed collections. The EAD DTD provides a flexible way for archives to convert finding aids that exist in paper form into electronic documents or to create new finding aids in electronic form.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.425-430
• /
• 2005

Many problems can be formulated in terms nf graphs and thus solved by graph-theoretic algorithms. This paper is concerned with finding paths between nodes over the distributed and overlapped graphs. The proposed method allows multiple agents to cooperate to find paths without merging the distributed graphs. For each graph there is a designated agent which is charged of providing path-finding service for hot graph and initiating the path-finding tasks of which path starts from the graph. The proposed method earlier on constructs an abstract graph so-called viewgraph for the distributed overlapped graphs and thus enables to extract the information about how to guide the path finding over the graphs. The viewgraph is shared by all agents which determine how to coordinate other agents for the purpose of finding paths. Each agent maintains the shortest path information among the nodes which are placed in different overlapped subgraphs of her graph. Once an agent is asked to get a path from a node on her graph to another node on another's graph, she directs other agents to provide the necessary information for finding paths.