• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.161-170
• /
• 2001

Mobility management technology is one among the most important issues in future mobile communication systems. The mobility management technology includes location management and handoff technologies. In this paper, we present a hierarchical distributed dynamic location management scheme that is compatible with the IMT-2000 environment. The proposed scheme composes a cluster with location registers, then makes up a hierarchical structures consisting of clusters. Each layer in the hierarchical structure uses different location management strategies cooperating another layers with each other. Also, the proposed scheme uses location update algorithm considering the frequency of location queries from nodes outside the local cells. We evaluate the performance of the proposed scheme through an analytical model.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.807-814
• /
• 2004

This paper researches and evaluates a bandwidth reallocation mechanism for efficient DiffServ QoS support in MPLS networks by monitoring the network traffic status and reallocating unused bandwidth. While the Differentiated Services in MPLS Networks architecture provides QoS management through the RSVP resource reservation, this mechanism is based on a static provisioning of resource. But this approach can lead to waste bandwidth in some service classes or, leave some service classes' resource starved. This paper presents the bandwidth reallocation dynamically based on network traffic status for bandwidth usage maximization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.11-20
• /
• 2002

In this paper, we propose an efficient quality providing scheme to satisfy a diversify combination of delay bound and loss ratio requirements from users by a predictive dynamic resource allocation method for real-time video applications. For utilizing the network resources more efficiently while meeting the service requirements, we adjust the resources based on the predicted traffic and the currently provided quality level. We developed a simple delayed-packet counter updating scheme for real time QoS monitoring. Simulation results show that our proposed method can provide an accurate and flexible quality control.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.15 no.2
• /
• pp.263-268
• /
• 1997

Software structure must be dynamic to support new geospatial information sources and their object-oriented implementation on the Web. JAVA is interactive, platform idependent and object-oriented language and meets all needs on Internet GSIS. This paper introduce JAVA based GIS program to manipulates various geographic data on Internet, communicating interactively and transfer real-time data between server and client. This and this program analysis roof detector in all part of Pusan area and indicates the traffic states, road surface conditions, weather information, shortest cut, and road names in JAVA client windows. Also this study shows various techniques in expression real time traffic informations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.373-378
• /
• 2007

분산제어시스템은 지리적으로 분산되어 있는 제어장치들을 제어시스템과 HMI(Human Machine Interface) 소프트웨어를 통하여 감시제어 한다. 사용자는 HMI 소프트웨어를 사용해 전체 시스템을 제어한다. HMI 소프트웨어는 통신, 저장 화면 갱신, 데이터 분석 등 모든 작업을 수행한다. 분산제어시스템의 특성상 항상 동작 상태에 있어야 하기 때문에 HMI 소프트웨어의 부담은 고장 가능성을 증가시킨다. HMI 소프트웨어의 작업은 실시간 특성을 기준으로 나눌 수 있다. 작업은 실시간 데이터를 이용하는 감시와 레포트(report)와 데이터 분석을 위하여 저장된 데이터를 이용하는 작업으로 나눌 수 있다. 본 논문이 제안한 분산제어시스템에서는 제어시스템(PCS)과 제어감시 소프트웨어(HIIS)가 작업의 특성에 따라 동적(dynamic)으로 연결된다. HIIS는 동적연결을 통하여 디스크 쓰기 동작을 줄이고 제어시스템으로부터의 데이터 전송을 감소시킨다. 결과적으로 제어시스템과 HMI 소프트웨어의 작업량을 줄임으로서 분산제어시스템의 성능향상과 유효성을 증가시킨다. 본 논문에서는 HMI 소프트웨어의 작업(task) 특성을 고려한 분산 제어시스템 아키텍처를 제안하고 실험을 통하여 아키텍처 성능을 평가하였다.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.284-293
• /
• 2007

본 논문에서는 실시간 동정 환경에 효과적인 L-CAA 에이전트 구조를 제안한다. L-CAA 에이전트 구조는 변화하는 환경에 대한 적응성을 높이기 위해, 선행 연구를 통해 개발된 행위 기반 에이전트 구조인 CAA에 강화 학습 기능을 추가하여 확장한 것이다. 안정적인 성능을 위해 L-CAA에서 행위 선택 메커니즘은 크게 두 단계로 나뉜다. 첫 번째 단계에서는 사용자가 미리 정의한 각 행위의 수행 가능 조건과 효용성을 검사함으로써 행위 라이브러리로부터 실행할 행위들을 추출한다. 하지만 첫 번째 단계에서 다수의 행위가 추출되면, 두 번째 단계에서는 강화 학습의 도움을 받아 이들 중에서 실행할 하나의 행위를 선택한다. 즉, 강화 학습을 통해 갱신된 각 행위들의 Q 함수 값을 서로 비교함으로써, 가장 큰 기대 보상 값을 가진 행위를 선택하여 실행한다. 또한 L-CAA에서는 실행 중인 행위의 유지 가능 조건을 지속적으로 검사하여 환경의 동적 변화로 인해 일부 조건이 만족되지 않는 경우가 발생하면 현재 행위의 실행을 즉시 종료할 수 있다. 그 뿐 아니라, L-CAA는 행위 실행 중에도 효용성이 더 높은 다른 행위가 발생하면 현재의 행위를 일시 정지하였다가 복귀하는 기능도 제공한다. 본 논문에서는 L-CAA 구조의 효과를 분석하기 위해, 대표적인 동적 가상환경인 Unreal Tournament 게임에서 자율적을 동작하는 L-CAA기반의 UTBot 들을 구현하고, 이들을 이용하여 성능실험을 전개해본다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.455-470
• /
• 2001

This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.853-856
• /
• 2007

Users requirement to use comfortable web page increasing these days because of development of Internet. Therefore concept of Web 2.0 were issued recently. Basic concept of Web 2.0 is implementation of comfortable UI(User Interface) and implementation of more active web than previous web. RIA(Rich Internet Application) is group of various technology to implement Web 2.0. It is possible that implement active web pages by many kind of technology that intend to RIA(Rich Internet Application). In this paper I restruct the rent-a-car reservation service page by Flex that popular in these days because of fantastic Animation to compare. effect and comfortable development environment. Therefore It is possible that constructing efficient active page that faster real-time information update and without page-to-page reload.

• Journal of Internet Computing and Services
• /
• v.2 no.1
• /
• pp.23-30
• /
• 2001

ILP processors require an accurate branch prediction scheme to achieve higher performance. Two-Level branch predictor has been known to achieve high prediction accuracy. But, when a branch accesses a PHT entry that was, previously updated by other branch, Two-level predictor may cause interferences. Negative interferences among all interferences have a negative effect on performance, since they can cause branch mispredictions. Agree predictor achieve high prediction accuracy by converting negative interferences to positive interferences by adding bias bits to BTB, but negative interferences may occur when bias bit is set incorrectly. This paper presents a new dynamic branch predictor which reduces negative interferences. In the proposed predictor, we attach hit bits to entries in BTB to change bias bit dynamically during the execution time, h a result the proposed scheme improve the accuracy of prediction by reducing negative Interferences effectively, To illustrate the effect of the proposed scheme, we evaluate the performance of this scheme using SPEC92int benchmarks, The results show that the proposed scheme can outperform traditional branch predictors.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.70-77
• /
• 2017

Among available people counting methods, map-based approaches based on moving interest points have shown good performance. However, the stationary people counting is challenging in such methods since all static points of interest are considered as background. To include stationary people in counting, it is needed to discriminate between the static points of stationary people and the background region. In this paper, we propose a people counting method based on using both moving and static points. The proposed method separates the moving and static points by motion information. Then, the static points of the stationary people are classified using foreground mask processing and point pattern analysis. The experimental results reveal that the proposed method provides more accurate count estimation by including stationary people. Also, the background updating is enabled to solve the static point misclassification problem due to background changes.