• Journal of Information Management
• /
• v.38 no.1
• /
• pp.75-98
• /
• 2007

Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2006.06a
• /
• pp.101-102
• /
• 2006

XML 기반의 Single Window은 국제 표준에 입각하여 해운 분야의 전자문서를 사용하여 국제해사기구와 전세계적으로 공통된 양식을 사용한다. 이는 동일한 양식의 전자문서를 사용하는 사용자들 간은 통용될 수 있다는 의미이며, 민원인 입장에서는 정보의 재사용성과 중복 입력의 불합리함을 줄일 수 있다. 이로써 민원인들은 입출항 수속 간소화 뿐만 아니라 해운 업무 자체에 많은 업무 개선 효과를 볼 수 있다. 본 고에서 제안한 XML 인프라스트럭처(XML infrastructure for Single Window)는 ebXML 기반의 Single Window에 적합하도록 설계 및 구현되었으며, 자원의 재사용성과 중복 투자를 방지할 수 있도록 하였다. 즉, 사용 환경에 유동적으로 적용가능 하도록 컴포넌트 방식으로 구성되었으며, 기존 시스템을 최대한 활용하도록 구성할 수 있도록 하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.588-600
• /
• 2000

본 논문에서는 워크스테이션 네트웍(Network of Workstation) 환경에서 태스크 스케줄링 문제를 해결하기 위하여 태스크 중복을 기반으로 하는 휴리스틱 스케줄링 알고리즘을 제안한다. 제안된 알고리즘에서는 NoW에서 통신할 때 발생되는 충돌을 방지하기 위하여 네트웍 통신 자원을 우선 할당하고, 스케줄링 길이를 단축하고 병렬처리 시간을 줄이기 위한 중복 테스크를 선택할 때 휴리스틱을 사용한다. 제안된 알고리즘은 태스크 그래프를 입력으로 받아 NoW 환경의 워크스테이션으로 스케줄링하며, 태스크 그래프에서 노드수가 V일 때 최악의 경우 알고리즘의 시간 복잡도는 O($V^2$)이다. 제안한 알고리즘을 실제 응용 프로그램의 태스크 그래프에 적용하였다. 시뮬레이션을 통하여 제안된 알고리즈이 스케줄링 길이와 알고리즘에서 요구하는 워크스테이션의 수 관점에서 성능이 향상되었음을 보여준다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3055-3063
• /
• 2000

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiporcessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conlhct, and the algorithm uses heuristies to select duplication tasks so as to recuce of a multiprocessors, and generates scheduling accorting to the available number of processors ina system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.

• Journal of the Korean Society for Library and Information Science
• /
• v.38 no.3
• /
• pp.119-139
• /
• 2004

This study intends to evaluate the quality of the Digital Library System DB and to suggest methods for its quality control. The evaluation criteria are hit rates, redundancy, completeness and accuracy. In spite of high hit rates excessive records representing one work resulted serious redundancy. The average completeness rate of records was $48.12\%$ due to low level of description. The Analysis of accuracy showed various errors in most of records corresponding to $92\%$. Emphasis on analysing the errors in detail detected the causing factors and suggested practical guidelines for school libraries' catalogers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.329-331
• /
• 2014

The analysis of the similarities and redundancies among R&D projects is important for the efficient investment of government budgets. When government R&D projects are planned, the redundancies of research tasks are examined by institutions specializing in research management, relevant offices and departments, and the government to prevent redundant funding. However, as existing similarity analyses depend on methods wherein new task proposals and existing R&D project proposals are compared and looked up based on keywords. This results in vulnerability wherein similarity cannot be accurately measured in the event of partial modifications of the task name or technical substitutions. This study aims to use patent information as characteristics by which R&D project documents can be identified. The patent data used is based on materials officially published by the government's R&D patent trend survey project (http://ipas.rndip.re.kr). The study aims to propose a method by which patent information can be used to analyze the similarity and redundancy among R&D projects when new projects are entered. For this purpose, a similarity measurement model based on set theory and probability theory is presented. The presented measurement model is implemented into an actual system to identify redundant documents, and calculate and show their similarity.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.11a
• /
• pp.51-53
• /
• 2022

MIV(MPEG Immersive Video)의 시험모델 TMIV 는 다시점의 비디오와 깊이(depth) 비디오를 입력 받아 시점 사이의 중복성을 제거한 후 남은 텍스처(texture)와 깊이로 텍스처 아틀라스(atlas)와 깊이 아틀라스를 각각 생성하고 이를 압축한다. 각 화소별 점유(occupancy) 정보는 깊이 아틀라스에 포함되어 압축되는데 압축 손실로 인한 점유맵 오류를 방지하기 위하여 임계값 T = 64 로 설정한 보호대역을 사용한다. 기존에 설정된 임계값을 낮추어 깊이 동적범위를 확대하면 보다 정확한 깊이값 표현으로 부호화 효율을 개선할 수 있지만 보호대역 축소로 점유맵 오류가 증가한다. 본 논문에서는 TMIV 의 부호화기와 보호화기에 비대칭 임계값을 사용하여 보호대역 축소로 인한 점유맵 오류를 보정하면서 보다 정확한 깊이 값 표현을 통하여 부호화 효율을 개선하는 기법을 제안한다. 제안기법은 깊이 동적범위 확대와 비대칭 임계값 기반의 점유맵 오류 보정을 통하여 CG 시퀀스에서 2.2% BD-rate 이득과 주관적 화질 개선을 보인다.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.4
• /
• pp.145-152
• /
• 2019

Unlike a single value from a sensor device, a massive data set has characteristics for various processing aspects; input data may be formed in a different format, the size of input data varies, and the processing time of analyzing input data is not predictable. Therefore, context aware systems may contain complex modules, and these modules can be implemented and used in different ways. In order to solve these problems, we propose a method to handle context information from the result of analyzing massive data. The proposed method considers analysis work as a different type of abstracting context and suggests the way of representing context information. In experiment, we demonstrate how the context processing engine works properly in a couple of steps with healthcare services.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1118-1130
• /
• 2006

Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.1
• /
• pp.1-5
• /
• 2013

The number of pedestrians is considered essential information which can be used to control a person who makes a entrance or a exit into a building. The number of pedestrians, also, can be used to help to manage pedestrian traffic and the volume of pedestrian flow within the building. Due to the fact there is incorrect detection by occluded, shadows, and illumination, however, difficulty can arise in existing system which is for detection and counts of a person who makes a entrance or a exit into a building. In this paper, it is minimized that the change of illumination and the effect of shadow through the transmitted image from camera which is created and processed with great adaptability. The accuracy of the calculations can be increase as well by using Kalman Filter and Mean-Shift Algorithm in order to avoid overlapped counts. As a result of the test, it is proved that the count method that shows the accuracy of 95.4% should be effective for detection and counts.