• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• KIISE Transactions on Computing Practices
• /
• v.21 no.10
• /
• pp.651-657
• /
• 2015

The amount of web traffic has increased as a result of the rapid growth of the use of web-based applications. In order to obtain valuable information from web logs, we need to develop systems that can support interactive, flexible, and efficient ways to analyze and handle large amounts of data. In this paper, we present CERES, a log-based, interactive web analytics system for backbone networks. Since CERES focuses on analyzing web log records generated from backbone networks, it is possible to perform a web analysis from the perspective of a network. CERES is designed for deployment in a server cluster using the Hadoop Distributed File System (HDFS) as the underlying storage. We transform and store web log records from backbone networks into relations and then allow users to use a SQL-like language to analyze web log records in a flexible and interactive manner. In particular, we use the data cube technique to enable the efficient statistical analysis of web log. The system provides users a web-based, multi-modal user interface.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.311-320
• /
• 2008

In general, routing algorithms that were applied to ad-hoc networks are not suitable for the environment with many nodes over several thousands. To solve this problem, hierarchical management to these nodes and clustering-based protocols for the stable maintenance of topology are used. In this paper, we propose the clustering-based modified LEACH protocol that can applied to an environment which moves around metal containers within communication nodes. In proposed protocol, we implemented a module for detecting the movement of nodes on the clustering-based LEACH protocol and improved the defect of LEACH in an environment with movable nodes. And we showed the possibility of the effective communication by adjusting the configuration method of multi-hop. We also compared the proposed protocol with LEACH in four points of view, which are a gradual network composition time, a reconfiguration time of a topology, a success ratio of communication on an containers environment, and routing overheads. And to conclude, we verified that the proposed protocol is better than original LEACH protocol in the metal containers environment within communication of nodes.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.419-428
• /
• 2001

Advances in circuit and integration technology are continuously boosting the speed of processors. One of the main challenges presented by such developments is the effective use of powerful processors in shared memory multiprocessor system. We believe that the interconnection problem is not solved even for small scale shared memory multiprocessor, since the speed of shared buses is unlikely to keep up with the bandwidth requirements of new powerful processors. In the past few years, point-to-point unidirectional connection have emerged as a very promising interconnection technology. The single slotted ring is the simplest form point-to-point interconnection. The main limitation of the single slotted ring architecture is that latency of access increase linearly with the number of the processors in the ring. Because of this, we proposed the dual slotted ring as an alternative to single slotted ring for cache-based multiprocessor system. In this paper, we analyze the proposed dual slotted ring architecture using new snooping protocol and enforce simulation to compare it with single slotted ring.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.367-374
• /
• 2001

Recently, LINUX cluster file systems based on the storage area network (SAN) have been developed. In those systems, without using a central file server, multiple clients sharing the whole disk storage through Fibre Channel can freely access disk storage and act as file servers. Accordingly, they can offer advantages such as availability, load balancing, and scalability. In this paper, we describe metadata management schemes designed for a new SAN-based LINUX cluster file system. First, we present a new inode structure which is better than previous ones in disk block access time. Second, a new directory structure which uses extendible hashing is described. Third, we describe a novel scheme to manage free disk blocks, which is suitable for very large file systems. Finally, we present how we handle metadata journaling. Through performance evaluation, we show that our proposed schemes have better performance than previous ones.

• Journal of Korean Society of Transportation
• /
• v.31 no.1
• /
• pp.15-24
• /
• 2013

To accommodate urban concentration of population, multi-purpose super-tall buildings have been introduced, but they induce many travel demands causing regional traffic problems. While several travel demand management policies such as transit promotion or parking limits are presented to alleviate such problems, transportation infrastructure are still insufficient to meet high demands. In this study, super-tall buildings are categorized by scale and purpose, then mode-specific derived demand is estimated using modal share of each category. Optimal transportation infrastructure level is determined by condition-based average changing amount yielded by street network delay (in case of road) or the number of transit routes (in case of transit).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4002-4014
• /
• 2015

ITU-R M.1842-1, as a well-known specification dedicated to maritime mobile applications, has standardized wireless transmission protocols according to the particular characteristics of a maritime communications scenario. A time division multiple access (TDMA) frame structure, along with modulation schemes to achieve a high data rate, has been described clearly in ITU-R M.1842-1. However, several specification items are still under "to be decided" status, which brings ambiguity to research works. In addition, the current version of ITU-R M.1842-1 is focused mainly on maritime transmissions in open-sea areas, where the cyclic prefix (CP) is set to zero and only 16-QAM is used in the multi-carrier (MC) system. System performance might be dramatically degraded in coastline areas due to the inter-symbol interference (ISI) caused by selective fading. This is because there is a higher probability that the signal will be reflected by obstacles in coastline areas. In this paper, we introduce the transmission resource block (TRB) dedicated to ITU-R M.1842-1 for a ship ad-hoc network (SANET), where the pilot pattern of TRB is based on the terrestrial trunked radio (TETRA). After that, we evaluated SANET performance under the maritime channel model in a coastline area. In order to avoid noise amplification and to overcome the ISI caused by selective fading, several strategies are suggested and compared in the channel estimation and equalization procedures, where the link-level simulation results finally validate our proposals.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.199-206
• /
• 2011

Removable Storage provides the excellent portability with light weight and small size which fits in one's hand, many users have recently turned attention to the high-capacity products. However, due to the easy of portability for Removable Storage, Removable Storage are frequently lost and stolen and then many problems have been occurred such as the leaking of private information to the public. The advent of remote storage services where data is stored throughout the network, has allowed an increasing number of users to access data. The main data of many users is stored together on remote storage, but this has the problem of disclosure by an unethical administrator or attacker. To solve this problem, the encryption of data stored on the server has become necessary, and a searchable encryption system is needed for efficient retrieval of encrypted data. However, the existing searchable encryption system has the problem of low efficiency of document insert/delete operations and multi-keyword search. In this paper, an efficient searchable encryption system is proposed.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.497-506
• /
• 2009

The method of effectively merging XML documents becomes necessary, as the use of XML is popular and the collaborative editing is required in the areas such as office documents and scientific documents editing works. As a solution to this problem, in this paper we present a theoretical framework for merging individual editing works by muli-users to a same source document. Different from existing approaches which merge documents themselves when they are merged, we represent editing works with a series of edit operations applied to a source document, which is called a edit script, merge those edit scripts by multi-users, and apply the merged one to the source document so that we can achieve the same effect of merging documents. In order to do this, assuming edit scripts based on insertion and deletion edit operations, we define notions such as static edit scripts, the intervention between edit scripts and the conflict between the ones, then propose the conflict conditions between edit scripts and the method of adjusting edit scripts when merged. This approach is effective in reducing network overhead in distributed environments and also in version management systems because of preserving the semantics of individual editing works.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.195-195
• /
• 2011

국가하천의 주변지역을 체계적이고 계획적으로 조성 이용하여 난개발을 방지하고 지속가능한 발전을 도모하며, 그에 따른 이익을 하천의 정비 및 관리 등에 활용함으로써 공공복리의 증진에 기여함을 목적으로 하는 친수구역활용에 관한 특별법이 곧 시행될 예정이다. 친수는 단순히 하천 보전과 상대되는 수변이용의 측면이 아니라 하천의 경관, 생태계, 물 등 전체적인 하천공간에서 이루어지는 인간의 활동과 심리적 만족감으로 해석할 수 있다. 이러한 친수활동 유형을 정립하기 위하여 전문가 및 실무자들의 도움으로 설문지를 작성하고, 조사하였다. 또한 평가 항목간의 중요도를 합리적으로 부여하고자 전문가 집단 활용을 통한 다기준의사결정 기법 중 계층분석과정 AHP(Analytic Hierarchy Process)와 이의 일반적인 형태인 ANP(Analytic Network Process) 기법을 이용하여 비교 분석하여 보았다. AHP는 의사결정의 목표 또는 평가기준이 다수이며 복합적인 경우, 다수의 속성들을 계층적으로 분류하여 각 속성의 중요도를 파악함으로써 최적 대안을 선정하는 기법으로 다수의 목표, 다수의 평가기준, 다수의 의사결정주체가 포함되어 있는 의사결정 문제를 계층화하여 해결한다. 그러나 의사결정 문제는 대부분 요소들 간의 수평적 상호작용과 수직종속성이 존재하기 때문에 단순히 계층적 구조만으로는 설명할 수 없는 경우가 있다. ANP는 AHP 분석을 확장한 개념으로 평가 요소가 계층구조를 가지고 있으면서 각 평가 요소간 네트워크 구조를 가지는 경우에 해당한다. 즉, 시스템 분석, 통합 및 조정을 위한 방법으로 요소들 간의 비선형 관계를 모델화하는 복잡한 의사결정에 적용이 가능하다. ANP는 AHP의 기본 공리인 독립성이 유지되지 않을 때도 적용할 수 있는 의사결정 방법이기 때문이다. AHP와 ANP 분석을 위해 평가기준은 하천특성, 생태환경특성, 인문환경특성, 경관, 유지관리 등으로 분류하였으며, 세부평가항목은 하천의 물리 생태학적 특성, 개발여건과 관련된 특성, 경관의 이용가치, 유지관리 용이성 등 20여 개로 나누었다. AHP와 ANP를 이용하여 친수공간 이용지수 가중치를 산정한 결과, 두 기법은 큰 차이를 보이지 않았다. 그러나 ANP를 이용하여 가중치를 결정하는 방법은 최종 결정의 공정성이나 신뢰성을 확보하는데 기여를 하는 것으로 나타났다.