• Journal of the military operations research society of Korea
• /
• v.34 no.3
• /
• pp.67-77
• /
• 2008

In the 21st century, it is highly required to develop a better security management system to prevent many severe accidents occurred in the sea because it has been growing both size and importance for industries and global business which are heavily related to the sea. In this paper, we proposed a new theoretical criteria for three core decisions to make for SAR(search and rescue). These are three decisions for search scope, search assets, and search duration. We first brought up several issues and problems of current SAR system, and then studies all related factors of these three decisions for SAR operations. This paper provides a theoretical foundation of SAR operations by applying a theoretical approach and reasonable standards.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.4
• /
• pp.5-11
• /
• 1995

In this paper, we design the new high-speed seek algorithm which can access the data of disk (in 3.5-inch optical disk drive). When seek the target track on optical disk in high-speed using the ref-T. E(Reference Tracking Error) and sample pulse signal, it's always possible high-speed seek without re-check and compensation for error by the ref_T. E and sample pulse signal. The performance test result is represented as follow ; it is satify the average seek time of 28mses.

• Journal of Korea Game Society
• /
• v.15 no.4
• /
• pp.157-168
• /
• 2015

The difficulty of the game is closely related to the fun of the game. However, it is not easy to determine the appropriate level of difficulty of the game. In most cases, human playtesting is required. But even so, it is still hard to quantitatively evaluate difficulty of the game. Thus, if we perform quantitative evaluation of the difficulty automatically it will be very helpful in game developments. In this paper, we use a path finding algorithm to evaluate difficulty of exploration in a game level. Exploration is a basic attribute in common video games and it represents the overall difficulty of the game level. We also optimize the proposed evaluation algorithm by using previous exploration histories when available area in an game level is dynamically expanded and the new search is required.

• Journal of the Korean Society for Library and Information Science
• /
• v.30 no.4
• /
• pp.39-60
• /
• 1996

A variety of searcher traits, characteristics, subject background and behaviors have been the subject of investigations exploring various hypotheses relating to searching performances. Previous studies have focused on searchers personal characteristics such as training, experience, subject knowledge, intelligence, cognitive style, attitude and searching style, Each of these factors is examined in this paper in order to find out searcher's personal characteristics affecting searching performance. Surprisingly, searching training and experience have not been found to influence searching performance. The hypothesis that intellectual ability correlates with the ability to online search seems to have little effect Various cognitive styles of searchers were tested to find out whether they relate to search results. Only FD/Fl cognitive style were found to be significant in relation to search results. Searchers showed a variety of attitudes about online searching. They revealed sensitivity toward searching charges. The attitude toward charges was reflected on the searching behavior. The sensitive searchers tend to conduct cost-effective searches, Searching styles of intermediaries were characterized as interactive and fast batch. It was found that experienced searchers prefer simple searches which do not explore the interactive capabilities of online system. In summary, previous studies have confirmed that there are apparently great individual differences among online searchers in searching behaviors as well as attitudes. But relationships between these individual differences and search performance were too weak to be significant.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.30-44
• /
• 2009

In this paper, we propose the mobile P2P structure supporting content searches for mobile peers efficiently. The proposed mobile P2P structure is a 3-tier structure which consists of a mobile peer, a mobile super peer, and a stationary super peer to reduce the content search cost of mobile P2P service. For content searches, mobile peer searches content in the communication range and performs hierarchical content searches which is using mobile super peer, stationary super peer for expansion of query region. In order to support hierarchial content searches and the continuity of services according to peer mobilities, peer's join/leave processes are explicitly stored by supporting message structures to the upper layer It is shown through experimental evaluation that the proposed structure improves about 32% contents search performance over the existing 2-tier structure. Since it also reduces the messages transferred to the stationary super peers, it reduced about 25% search loads of them.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.78-89
• /
• 2017

This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.255-259
• /
• 2005

To search a pattern P in a text, such index data structures as suffix trees and suffix arrays are widely used in diverse applications of string processing and computational biology. It is well known that searching in suffix trees is faster than suffix ways in the aspect of time complexity, i.e., it takes O(${\mid}P{\mid}$) time to search P on a constant-size alphabet in a suffix tree while it takes O(${\mid}P{\mid}+logn$) time in a suffix way where n is the length of the text. In this paper we present a linear-tim8 search algorithm in suffix arrays for constant-size alphabets. For a gene.al alphabet $\Sigma$, it takes O(${\mid}P{\mid}log{\mid}{\Sigma}{\mid}$) time.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• Knowledge Management Research
• /
• v.21 no.4
• /
• pp.287-300
• /
• 2020

We investigate empirically the impact of IT exploration & exploitation capability and operational capability upon organizational agility, especially small and medium sized firms in the logistics industry in South Korea. Based on literature on the bilateral relationship between organizational agility and IT capability, we follow the established research model and propose hypotheses. This work takes an empirical methodology to test the hypotheses: design survey questionnaires, collect data, test reliability and validity of data, and finally test the hypotheses. Our results based on the data collected in 2018 present that IT exploration & exploitation capability significantly increases operational capability, and operational capability increases organizational agility. We find our contribution in updating previous research findings with recent data and in expanding the domain of research more specifically into small and medium sized firms in logistics industry in South Korea. Practically our work suggests that managers and policy makers should consider both fostering newly emerging IT exploration and existing IT resource exploitation capability in order to enhance organizational agility of those small and medium sized firms in logistics industry.

• Korean Journal of Cognitive Science
• /
• v.16 no.1
• /
• pp.1-15
• /
• 2005

Since human visual system has limited capacity for visual information processing, it should select goal-relevant information for further processing. There have been several studies that emphasized the possible involvement of memory in spatial shift of selective attention (Chun & Jiang, 1998, 1999; Klein, 1988; Klein & MacInnes, 1999). However, other studies suggested the inferiority of human visual memory in change detection(Rensink, O'Regan, & Clark, 1997; Simons & Levin, 1997) and in visual search(Hotowitz & Wolfe, 1998). The present study examined the involvement of memory in visual search; whether memory for the previously searched items guides selective attentional shift or not. We investigated how search works by comparing visual search performances in three different conditions; full exposure condition, partial exposure condition, and partial-to-full exposure condition. Revisiting searched items was allowed only in full exposure condition and not in either partial or partial-to-full exposure condition. The results showed that the efficiencies of attentional shift were nearly identical for all conditions. This finding implies that even in full exposure condition the participants scarcely re-examined the previously searched items. The results suggest that instant memory can be formed and used in visual search process. These results disagree with the earlier studies claiming thar visual search has no memory. We discussed the problems of the previous research paradigms and suggested some alternative accounts.