• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1039-1051
• /
• 1999

시공간 데이타베이스는 현실세계의 객체에 대하여 효율적인 공간 관리와 이력 관리를 지원한다. 이러한 시공간 데이타베이스는 시간차원과 공간차원이라는 이질적 데이타 공간을 관리하여야 하는 대단히 복잡한 시스템이다. 따라서 데이타에 대한 효율적 접근 방법에 대한 연구가 필수적이며, 이는 효율적 색인 기법의 개발을 통하여 이룰 수 있다. 그러나 시공간 데이타에 대한 접근방법 연구는 거의 이루어지지 않고 있으며 극소수의 사례들마저도 공간 객체의 이력 개념을 지원하는 것이 아니라 멀티미디어 객체의 상대적 시간만을 지원하고 있다. 따라서 이 논문에서는 공간 데이타의 이력을 표현하는 시공간 데이타에 대하여 효율적으로 색인하기 위한 방안으로서 시간과 공간을 단일화된 색인 영역으로 통합하는 단일화된 시공간 색인 모델을 제시하고, 이를 기존의 R-트리를 기반으로 확장한 색인을 설계 및 구현하였으며, 아울러 다양한 유형의 시공간 연산에 대한 색인의 성능을 평가하였다.Abstract Spatiotemporal databases are able to support an efficient spatial management as well as historical management for an object in the real world. It is very complex to manage these two dimensions why there exists on difference of inborn property of temporal and spatial dimensions. Therefore an efficient access method should be studied, and it can be done by means of development of efficient indexing technology.However, there is a few related work in the research of access methods of spatiotemporal data. Also the previous works do not support the concept of history for spatial object, and only support the relative time among multimedia objects. Therefore, in this paper, we propose a unified Spatiotemporal index model as an efficient index for Spatiotemporal data. And we not only design Spatiotemporal index that has been extended to historical management facility on the basis of conventional R-tree, but also implement it. Finally we have evaluated performance of index for the various kinds of Spatiotemporal operations.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.219-230
• /
• 2002

One of the most important functions digital libraries need to offer is to help users find necessary information in a distributed environment in the most efficient and effective manner. In order to meet the goal, it is desirable to link scattered pieces of information and present them as a logically coherent whole when the user wants it, so that he or she doesn't need to know their physical location. The virtual document is an integrated document that the total or part of the physical documents stored in a specific repository are linked dynamically. Our MIRAGE-III digital library system provides a content-based retrieval of physical documents and the virtual documents in XML. This system provides a retrieval of partial documents, attributes and hierarchical structures and linked-documents based in structured documents like XML or SGML. In this paper we describe a methodology of design and implementation of the query processor and retrieval server in the MIRAGE-III digital library system.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.104-112
• /
• 2010

Social bookmarking is one of the most interesting trends in the current web environment. In a social bookmarking system, users annotate a web page with tags, which describe the contents of the page. Numerous studies have been done using this information, mostly on enhancing the quality of web search. In this paper, we use this information to measure the semantic similarity between two web pages. Since web pages consist of various types of multimedia data, it is quite difficult to compare the semantics of two web pages by comparing the actual data contained in the pages. With the help of social bookmarks, this comparison can be performed very effectively. In this paper, we propose a new similarity measure between web pages, called Web Page Similarity Based on Entire Tags (WSET), based on social bookmarks. The experimental results show that the proposed measure yields more satisfactory results than the previous ones.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.24-31
• /
• 2009

Resource reservation scheme is an effective method to guarantee QoS for handoff calls in the next generation multimedia mobile communication systems, but it causes negative impacts on blocking probability of new calls. In this paper, to optimize the tradeoff between dropping probability of handoff calls and blocking probability of new calls, relay station based handoff prioritization control algorithm is proposed. In this algorithm, the relay station participates in handoff procedure and enables mobile stations to have guaranteed prompt service after handoff by providing highly efficient data transmission. In this paper, Markov chain models of the proposed handoff prioritization schemes are developed, and dropping probability of handoff packets and blocking probability of new packets are derived. By numerical analysis, the proposed algorithm has been proved to outperform conventional handoff prioritization schemes in terms of dropping probability of handoff packets and blocking Probability of new packets.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.64-71
• /
• 2014

Multiplier performs a complex arithmetic operation in various signal processing algorithms such as multimedia and communication system. The multiplier also suffers from its relatively large signal propagation delay, high power dissipation, and large area requirement. This paper presents memristor-CMOS based reconfigurable multiplier reducing area occupation of the multiplier circuitry and increasing compatibility using optimized bit-width for various applications. The performance of the memristor-CMOS based reconfigurable multiplier are estimated with memristor SPICE model and 180 nm CMOS process under 1.8 V supply voltage. The circuit shows performance improvement of 61% for area, 38% for delay and 28% for power consumption respectively compared with the conventional reconfigurable multipliers. It also has an advantage for area reduction of 22% against a twin-precision multiplier.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.191-200
• /
• 2007

As the IEEE 802.11 WLAN has widely installed as a high-speed wireless network information infrastructure, there has been growing interest in both security and mobility of mobile terminals. However, for the case of mobile terminal employing IEEE 802.11i security standard, it is known that the user authentication procedure of IEEE 802.1x for stronger security enforcement may, due to its large delay, not be suitable for real-time multimedia communication. In this paper, we have proposed fast authentication method to resolve the above authentication delay problem, and verifies its performance via simulation analysis. Mobile terminals can get AP information reliably, and selectively execute authentication in advance during handover, which results in fast user authentication. In addition, by effectively managing the authentication information in mobile terminal, which are distributed in advance for pre-authentication, the problem of long-time revelation of authentication information has been solved.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.101-115
• /
• 2011

PECOLE (Peer-to-Peer Collaborative Environment) is a P2P-based multimedia distributed collaborative environment supporting a collaborative workspace which is composed of a variety of collaborative applications such as multi-chat, video conferencing, screen sharing and etc. Unfortunately, due to the PECOLE's simple group management, it is impossible to perform collaboration activities while joining multiple groups. In this paper, we present the design and implementation of PECOLE+ which is an extension of PECOLE. PECOLE+ resolves the drawback of PECOLE by providing the Group Management Service and the Workspace Management Service. The Group Management Service provides functionalities such as creating groups, joining multiple groups, and searching groups, and etc. The Workspace Management Service provides each group with an associated workspace, supporting the execution of collaborative applications over the workspace. In addition, any collaborative applications with the provided plug-in interfaces can be executed over the workspace as a PECOLE+ collaborative application.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1126-1134
• /
• 1999

최근 다양한 멀티미디어 서비스를 지원하기 위한 통신망 관리와 서비스 관리가 통합된 개방형 정보 통신망의 구조가 요구되고 있다. 이러한 구조를 기반으로, TINA-C(Tele-communications Information Networking Architecture-Consortium)에서는 분산 환경에서 분산 어플리케이션 객체들에 대한 복잡한 서비스 및 관리 인터페이스들을 간결하도록 객체그룹의 개념을 정의하고 있다. 이러한 환경 속에서 트레이딩 서비스는 통신 서비스를 제공하는 객체그룹간의 상호작용을 지원하는데 매우 중요하다.따라서, 본 논문에서는 객체그룹간의 상호접속을 지원할 수 있는 트레이딩 기능과 이들 트레이더들간의 연동을 위한 트레이더 연합 모델을 제시하고자 한다. 이를 위해 우리는 트레이더의 중개자로서 Cooperator를 설계하여 기존의 트레이더와 연동시켰다. 이러한 결과로서 우리의 새로운 트레이더 연합 모델에서 Cooperator는 객체그룹간의 상호접속에서 객체들의 접속 권한의 체크 기능과 기존의 트레이더 연합모델의 문제점인 트레이더들간의 단 방향 연결문제를 보완하여 양방향 연결 기능을 갖도록 하였다. 끝으로, 이러한 해결 과정을 보이기 위해 트레이더와 Cooperator들로 이루어진 본 연합모델에서 분산 객체그룹간의 상호접속 절차과정과 사건 추적 다이어그램을 보였다.Abstract Recently, the open networking architecture is required to support various multimedia services as integrated functions of network management and service management. Based on this architecture, TINA-C defines an object group concept for simplifying complex management and service interfaces, when distributed application is executed in distributed environments. Within the support environment the trading service is an important of the interacting object groups which provide a telecommunication service.Hence, we suggest the trader federation model for supporting interconnections between object groups and among existing traders by using the cooperator we designed, as an intermediator among traders. Our cooperator has functions for checking access rights of objects in object groups, and for providing bidirectional linkage among traders. Up to now, the existing trader federation models have a single directional linkage for interactions among traders. Finally, we showed the interface procedure and the event trace diagram of distributed object groups using our model consisted of traders and the cooperators.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.401-407
• /
• 2000

Modern microprocessors exploit instruction-level parallel processing to increase the performance. Especially VLIW processors supported by the parallelizing compiler are used more and more in specific applications such as high-end DSP and graphic processing. Bus-based VLIW architecture was proposed for these specific applications and it was designed to reduce the overhead of forwarding unit and the instruction width. In this paper, a optimizing scheduling compiler developed for the proposed bus-based VLIW processor is introduced. First, the method to model interconnections between buses and resource usage patterns is described. Then, on the basis of the modeling, machine-dependent optimization techniques such as bus-to-register promotion, copy coalescing and operand substitution were implemented. Optimization techniques for general-purpose VLIW microprocessors such as selective scheduling and enhanced pipelining scheduling(EPS) were also implemented. The experiment result shows about 20% performance gain for multimedia application benchmarks.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.1
• /
• pp.42-49
• /
• 2000

A major technical issue related to supporting multiple classes of service in IMT-2000 is the efficient management of limited channel. The selection of channel access control technique has a significant impact on user QOS, system capacity, and is therefore an important design parameter. In this paper, to achieve the service at resonable QOS level, while utilizing channel resource effectively, some improved methods are proposed by analyzing of the recently released methods.