• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.97-106
• /
• 2020

The factory information provided by the Industrial Location Information System (ILIS) is provided as raw data by the Korea Industrial Complex Corporation and registered after a filtering process, so the new factory information update is slow. In this study, to solve the problem of updating factory information of industrial location information system, using building data of road name address with relatively fast renewal cycle and building data of real estate, we compared the factory information of existing ILIS and extracted new factory information. In the process of comparison, a method was proposed to compare spatial objects of different types with point data and polygon data. Attribute information matching and object matching were performed, and attribute values of new factory information were extracted. The accuracy evaluation of the proposed spatial analysis method showed 79% accuracy, and the above matching technique was used to confirm the possibility of convergence of road name address data, real estate data and factory information of ILIS.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.245-254
• /
• 2008

If the broadcast message is sent, first of all, the privileged users will decode the session key by using his or her personal key, which the user got previously. The user willget the digital information through this session key. As shown above, the user will obtain messages or session keys using the keys transmitted from a broadcaster, which process requires effective ways for the broadcaster to generate and distribute keys. In addition, when a user wants to withdraw or sign up, an effective process to renew a key is required. It is also necessary to chase and check users' malicious activities or attacking others. This paper presents a method called Traitor Tracing to solve all these problems. Traitor tracing can check attackers and trace them. It also utilizes a proactive way for each user to have effective renewal cycle to generate keys.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.99-108
• /
• 2010

The traffic classification is a preliminary but essentialstep for stable network service provision and efficient network resource management. While various classification methods have been introduced in literature, the payload signature-based classification is accepted to give the highest performance in terms of accuracy, completeness, and practicality. However, the collection and maintenance of up-to-date signatures is very difficult and time consuming process to cope with the dynamics of Internet traffic over time. In this paper, We propose an automatic payload signature generation mechanism which reduces the time for signature generation and increases the granularity of signatures. Furthermore, We describe a signature update system to keep the latest signatures over time. By experiments with our campus network traffic we proved the feasibility of our mechanism.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.2
• /
• pp.112-119
• /
• 2009

This paper describes a robust visual surveillance algorithm under outdoor environment. One of the difficult problems for outdoor is to obtain effective updating process of background images. Because background images generally contain the shadows of buildings, trees, moving clouds and other objects, they are changed by lapse of time and variation of illumination. They provide the lowering of performance for surveillance system under outdoor. In this paper, a robust algorithm for visual surveillance system under outdoor is proposed, which apply the mixture Gaussian filter and color invariant property on pixel level to update background images. In results, it was showed that the moving objects can be detected on various shadows under outdoor.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.117-124
• /
• 2002

In software development process, appropriate design can exist more than one. And software architectures can be restructured by modification and update during design processes. Therefore, the method that specify efficiently the modification elements of architectures, and manage different versions of architecture designed through various aspects is required. In this study, we propose software architecture restructuring mechanism that can restructure legacy architecture and a new software architecture designed with reuse of it in integrated form, and define specification elements and structure of the proposed restructured architecture specification. It provides the method that can reference and reuse architectures designed with various aspects of developers in architecture design processes. In addition, it supports flexible specification method for specification of modification elements such as revision, substitution, update of legacy software architecture.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.341-350
• /
• 2002

Software architectures can be restructured by modification and update during design processes, and appropriate software architectures for developments can be designed more than one. Therefore, it is required to specify efficiently the modification elements of architectures and restructuring method of designed architecture through various aspects. In this paper, we proposed software architecture restructuring mechanism that can restructure legacy architecture and a new software architecture designed with reuse of it in integrated form. And, we define specification elements and structure of the proposed restructured architecture specification. It provides the method that can reference and reuse architectures designed with various aspects of developers in architecture design processes. In addition, it supports flexible specification method for specification of modification elements such as revision, substitution, update of legacy software architecture.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.91-99
• /
• 2014

The main game architectures for multiplayer online games are the traditional client-server architectures, multi-server architectures and P2P(peer-to-peer) architectures. P2P architectures, due to their distributed and collaborative nature, have low infrastructure costs and can achieve high scalability as well as fast response time by creating direct connections between players. However, P2P architectures face many challenges. Distributing a game among peers makes maintaining control over the game more complex. These architectures also tend to be vulnerable to churn and cheating. Providing consistency control in P2P systems is also more difficult since conflicting updates might be executed at different sites resulting in inconsistency. In order to avoid or correct inconsistencies, most multiplayer games use a primary-copy replication approach where any update to the object has to be first performed on the primary copy. This paper presents the primary-copy model with the update dissemination mechanism that provides consistency control over an object in P2P architectures for multiplayer online games. The performance for this model is evaluated through simulation experiments and analysis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.794-799
• /
• 2005

In this paper, We describe the XML-based Web content management system that supports the efficient dynamic content publishing environment. EasyCM is designed based on Cocoon2 that is the XML publishing framework. We propose the publishing mechanism to support the efficient dynamic content publishing environment to expand into the available dynamic content caching to Cocoon2. Publishing mechanism of EasyCM draws XML object from content repository, associates XML with XSLT, creates and caches content components preprocessing HTML transformation process, and publish web pages constructed into cached content component. For supporting more efficient caching, EasyCM supports also content component update, two update method that is immediately-update and delay-update for updated content component.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.293-298
• /
• 2005

LIDAR의 표고점 데이터는 건물, 수목 등의 개체를 구성하는 비지면점과 순수한 지표면을 나타내는 지면점들이 섞여있기 때문에 이들을 분리하는 과정이 필요하다. 지금까지 연구된 방법들은 몇 가지 입력 요소가 필요하여 완전 자동화를 이루지는 못하고 있으며, 다양한 크기의 개체를 동시에 자동으로 찾아내기 어렵고 경사진 지형에 대해서는 적용하기 어려운 문제점을 가지고 있다. 이에 본 논문에서는 원 데이터의 동일 스캔 라인 상에 존재하는 이웃 점들 간의 경사를 이용하여 입력 요소를 최소화하여 개체를 추출하고자 한다. 이웃하는 두 점플 간의 경사를 이용하여 비지면점을 탐지하여 이웃하는 지면점의 높이 값으로 대체하며 갱신된 값을 바로 다음 연산에 반영시킴으로써 윈도우를 사용하거나 그룹화 할 필요가 없다. 또한 갱신된 값을 전파시키기 때문에 복잡한 지붕을 가지는 건물도 추출할 수가 있다. 이와 같은 연산을 두 방향에 대하여 수행하여 경사진 지형에 대하여 적용할 수 있도록 하였으며 천안과 마산지역에 대하여 테스트를 수행하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.7
• /
• pp.57-60
• /
• 1998

본 논문에서는 MKM(Modified K-Means) 알고리듬의 성능을 개선하기 위해 새로운 학습알고리듬을 제안한다. MKM 알고리듬에서 새로운 코드워드는 이전 코드워드와 새로 얻 은 중심점을 이은 직선 상의 임의적으로 선택된다. 따라서 MKM 알고리듬은 통계적 이완 방법의 코드북 교란 알고리듬으로 이해될 수 있다. MKM 알고리듬을 통계적 이완 알고리듬 과 비교해보면 도입되는 교란의 양이 상대적으로 적고 그 교란 자체도 임의적이지 않다는 걸 알 수 있다. 따라서 MKM 알고리듬에 도입되는 교란의 양을 보다 크고 임의적이게 하면 MKM 알고리듬이 국소 최적화에 빠질 가능성이 줄어들 것이다. 따라서 본 논문에서는 MKM 알고리듬의 코드북 갱신과정을 변화시킨 새로운 알고리듬을 제안하였으며, 화상 데이 터와 음성 데이터를 이용하여 실험한 결과 제안된 알고리듬이 MKM 알고리듬보다 우수한 성능을 보인다는 걸 확인할 수 있다.