• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.863-866
• /
• 2000

본 논문에서는 비디오 코딩을 위한 적응적 블록 정합 알고리즘을 제안한다. 제안 알고리즘에서는 블록내의 움직임 정도에 따라 다단계의 블록 레벨을 설정하고, 그 블록 레벨에 따른 각기 다른 다단계의 움직임 예측을 수행한다. 이는 움직임이 적은 영역에서의 불필요한 탐색과정을 제거하여 계산적 효율성을 증대하고, 움직임 정도가 큰 부분으로 갈수록 움직임 예측 과정을 심화 시켜 예측의 정확성을 증가시킨다 본 제안된 방식을 가지고 실험한 결과 한 프레임 당 적은 수의 블록으로 고정된 크기의 블록을 가진 전역 탐색 블록 정합 알고리즘보다 적은 예측 에러를 발생시켜 1dB 정도의 PSNR 개선을 가져왔고 98% 정도의 연산량 절감 효과가 있는 것으로 나타났다.

• Journal of the Korean Society for information Management
• /
• v.18 no.2
• /
• pp.7-30
• /
• 2001

The characteristics of the short document representatives and short queries of OPAC systems need the different ranking algorithms from IR systems. This study tested and analyzed the effectiveness of four sorting schemes and four ranking algorithms and the six effectiveness measurements for the ranked Boolean OPAC systems. The sorting by publication year was better but without significant difference. The cover density ranking was significantly better than the frequency-based ranking of the Fuzzy or DNF models. The simple effectiveness measurement based on the average rank of relevant documents retrieved was as good as the others and better than the precision P.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.185-195
• /
• 2015

During hospital peak times of outpatients, an effective mechanism that informs the newly receipted patient information to corresponding medical departments is lacking in current hospital reception systems. Since every department repeatedly searches entire patient reception database in sequential manner to acquire its reception information, this is a significant performance degradation factor in hospital information system. To improve hospital reception system efficiency, we developed two web socket based systems, a primary key transmitting batch system and a reception information transmitting real time system. The former reduced database access time compared to sequential search system as well as kept search time low regardless of receipted patient number. The latter effectively reduced waiting list updating time in request/response patient reception system by eliminating database access.

• Journal of the Korea Convergence Society
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2020

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1777-1787
• /
• 2017

Federated authentication (FA) is a multi-domain authentication and authorization infrastructure that enables users to access nationwide R&D resources with their home-organizational accounts. An FA-enabled user is redirected to his/her home organization, after selecting the home from an identity-provider (IdP) discovery service, to log in. The discovery service allows a user to search his/her home from all FA-enabled organizations. Users get troubles to find their home as federation size increases. Therefore, a discovery service has to provide an intuitive way to make a fast IdP selection. In this paper, we propose a discovery system which leverages geographical information. The proposed system calculates geographical proximity and text similarity between a user and organizations, which determines the order of organizations shown on the system. We also introduce a server redundancy and a status monitoring method for non-stop service provision and improved federation management. Finally, we deployed the proposed system in a real service environment and verified the feasibility of the system.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.405-410
• /
• 2009

This paper proposes an efficient path finding scheme capable of searching the paths to k static objects from a given query point, aiming at both improving the legacy k-nearest neighbor search and making it easily applicable to the road network environment. To the end of improving the speed of finding one-to-many paths, the modified A* obviates the duplicated part of node scans involved in the multiple executions of a one-to-one path finding algorithm. Additionally, the cost to the each object found in this step makes it possible to finalize the k objects according to the network distance from the candidate set as well as to order them by the path cost. Experiment results show that the proposed scheme has the accuracy of around 100% and improves the search speed by $1.3{\sim}3.0$ times of k-nearest neighbor searches, compared with INE, post-Dijkstra, and $na{\ddot{i}}ve$ method.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.521-528
• /
• 2008

Such conventional maritime communication technologies as radio have short some comings in their transmission quality. It can be overcome by wireless channels provided by satellites such as INMARSAT, which nevertheless suffer from the high costs. In this paper, we propose a novel technology resolving the above problems, featuring in the establishment of maritime communication networks with multi-hop structures. The inter vessel and ship-to- shore networks previously modeled after MANET are remodeled by SANET (Ship Ad Hoc Networks) in the present work. Fan-shaped Search Zone Routing (FSR) protocol also is presented, which utilizes not only static geographical information including the locations of ports and the navigations of courses but also the unique characteristics of ships in terms of mobile nodes. The FSR finds the fan-shaped search zone on which the shortest path is located. The performance of LAR protocol is compared with that of FSR in several ways. First, FSR does not make use of a type of control packets as beaconing data, resulting in a full utilization of the bandwidth of the wireless channels. Second, the delivery rate by the FSR is 100% for the fan-shaped search zone includes at least one route between source and destination nodes on its border line, where as that of LAR has been turned out to be 64%. Third, the optimality of routes searched by the FSR is on a 97% level. Of all, the FSR shows a better performance than LAR by about 50%.

• Korean Journal of Cognitive Science
• /
• v.25 no.1
• /
• pp.1-24
• /
• 2014

Growing boy of studies focus on the letter transposition effect since it gives the information on how letters are coded and what variables are involved in the processes of word recognition. This review investigated various models on letter transposition effect. While most proposed models rely mainly on the bottom-up processes, evidences from various studies suggested the necessity of the top-down variables based on the cognitive processing mechanism. Especially, empirical evidences suggested that Hangul model should include a position specific processing mechanism based on onset, vowel, and coda of the Korean character.

• Journal of the Korean Society for Library and Information Science
• /
• v.39 no.2
• /
• pp.185-209
• /
• 2005

The description of resources at collection-level is being recognised as an important component of information services that seek to provide integrated access to distributed resources. This research investigated the concept, necessities, and standards of collection level description which manages heterogeneous and distributed resources effectively. Also this research reviewed collection level description projects in other countries to show a new direction of subject access in digital libraries.

• Journal of The Korean Association of Information Education
• /
• v.22 no.2
• /
• pp.275-284
• /
• 2018

The purpose of this study is to improve career awareness of students by using visual thinking and SNS. In addition, parents' interest about their children 's career was increased, and career guidance suitable for the development stage of elementary school students' education was searched to find out the course appropriate for their aptitude and ability. The results of the comparative study showed that the experimental group had a significant effect on the opinions and attitudes toward career, information search and rational decision making, and knowledge on occupation. Research shows that career-based education using visual thinking and SNS has a positive effect of encouraging students' career awareness and positive attitude toward career search.