• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.859-870
• /
• 2009

Despite the surge in the research for keyword search method over relational database, only little attention has been devoted to studying on relational data stream.The research for keyword search over relational data stream is intense interest because streaming data is recently a major research topic of growing interest in the data management. In this regard we first analyze the researches related to keyword search methodover relational data stream, and then this paper focuses on the method of minimizing the join cost occurred while processing keyword search queries. As a result, we propose an advanced keyword search method that can yield more meaningful results for users on relational data streams. We also propose a query optimization method using layered-clustering for efficient query processing.

• Korean Journal of Environment and Ecology
• /
• v.23 no.5
• /
• pp.381-391
• /
• 2009

This is the study of the effects and changes on the ichthyofauna and fish community in Jeonju-cheon stream (located in Jeonju Cit, Jeollabuk-do, South Korea) after the implementation of the Natural Stream Restoration Project. The restoration of the stream was carried out between April 2000 and December 2002, and it covered the mid-section of the stream starting from the upstream of Hanbyeok Bridge down to Samcheon where branches of water join. It is 7.2 km long and passes through the downtown area. In this study, comparisons were made before and after the restoration. Before the restoration (1975 to 1999), the number of fish species collected from the Jeonju-cheon stream turned out to be 12 to 18 species, whereas after the restoration (2003 to 2008), it increased up to 34 species in total. Especially in the case of the middle and downstream sections running across the central regions of the city (Daga Bridge to Seosin Bridge), the number of fish species significantly increased from 5 species to 22 species. Such a dramatic increase of fish species appears to be directly related to the restoration of the stream which was designed to improve the quality of water by preventing polluted sewage water from running into the stream. Besides, the structure of stream bed which became more diversified into various components such as marshes and shallows, as well as rocks, Pebbles, sand and clay, also contributed to the increase of fish species.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.226-229
• /
• 2007

스트리밍 환경에서 조인 연산은 기존의 기법과는 다른 처리 방법을 요구한다. 이런 문제를 해결 하기 위해 기존에 여러 가지의 다양한 기법들이 제안되었다. 하지만 지금까지 제안된 방법들은 두 개의 입력 스트림에 대한 조인만 고려하거나 단일 속성 멀티 스트림 조인에 대해서만 고려해왔다. 하지만 조인 속성이 여러개인 경우에는 한단계로 조인을 수행하는 것은 불가능하다. 이 눈문에서는 이러한 문제를 해결하기 위해서 지금까지 고려되어 왔던 환경에서 더 일반화 된 다중속성을 가지는 조인을 고려한다. 이러한 경우에는 조인이 다단계로 일어나게 되는데 이러한 환경에서는 이전 단계의 조인이 다음 단계의 조인에 영향을 미치게 된다. 그러므로 최종 조인 결과를 빠르게 만들어 내기 위해서는 여러 입력 스트림 중에서 어떤 조인을 먼저 수행하느냐에 따라 전체적인 조인결과를 만들어내는 속도가 달라지게 된다. 그러므로 전체 조인결과를 빠르게 만들어 내기 위해서 조인이 수행되는 과정에서 여러 입력 스트림중에 어떤 스트림을 먼저 수행할지를 결정함으로써 최종 조인 결과를 빠르게 만들어낼 수 있게 하는 방법을 제안한다.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.137-145
• /
• 2006

In this paper, we propose a multicast P2Patching technique in the application layer. The P2Patching technique serves VOD stream effectively with Patching in P2P environment. The P2Patching provides multicast tree construction technique that reduces the server load and minimizes the start delay with extended multicast technique. And we provide a fast recovery technique by tree failure and dynamic buffering scheme that guarantees the continuous streaming by frequent tree disconnections. Comparing the method with that of $P2Cast^{[12]}$, we obtained the better performance by our scheme in terms of average join count, service rejection probability, tree recovery failure and buffer starvation. The average about 16$\%$ of the improvement is shown by the simulation. Most of all, the performance of buffer starvation and average join count shows a significant improvement than that of P2Cast.

• Journal of the Korean association of regional geographers
• /
• v.12 no.1
• /
• pp.1-15
• /
• 2006

This study is to review the site of Seoul and its urbanized area expansion in relation with a geomorphic environments. Surveying on the urbanized area of Seoul by period and related geomorphic conditions found the following conclusions. Seoul urbanized area had been expanded from the cheonggyecheon drainage basin to its surrounding hills and marshland. The marshland development began during the Japanese period from around the tributaries of the Hangang river and expanded to the areas by the main stream of the river. The extensive marshland at the point where the main stream and its tributaries of the river join has been developed relatively new. The marshland development, which took advanced engineering skills and a huge investment, is comparatively later and also involves large additional expenses to keep the areas from food damages. Judging from the above findings, this study concluded that the urbanized area expansions in a big metropolitan city such as Seoul, are greatly influenced by geomorphic environments and the importance of geomorphic conditions still hold true even today when scientific and technological developments have reached unprecedented heights.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• Economic and Environmental Geology
• /
• v.57 no.2
• /
• pp.143-159
• /
• 2024

Natural aggregate is an essential resource for human activities, closely related to construction. The aggregate demand has been increasing annually, and due to the nature of the resource, it is difficult to procure from distant locations. This study identifies the distribution and characteristics of aggregate-bearing areas as part of a municipal-level aggregate resource survey conducted in Nonsan City, Korea, in 2023. Nonsan City is located approximately 35 km straight distance from the Geum River estuary and lies at the passageway of the main stream of the Geum River. The topography of Nonsan City features eastern mountainous areas and western plains, creating an east-high-west-low geomorphic setting, with 33 streams distributed across the city, including tributaries of the Geum River like Nonsan Stream, Noseong Stream, and Ganggyeong Stream. All streams originate from the highlands in the north and east, converge with Nonsan Stream, and then join the west bank of the main stream of the Geum River at the western boundary of Nonsan City. Drilling core results show shallow depths in the highlands to the north and east, deepening towards the west, reaching a maximum depth of 25 m near the main stream of the Geum River. The total reserve of land aggregates is calculated to be 246,789,000 m³, with a developable amount of 172,750,000 m³. The total reserve of river aggregates is 5,236,000 m³, with a developable amount of 3,765,000 m³. The distribution of aggregates varies according to the geomorphic, geologic, and development pattern of the river system. Reserves are scarce in mountainous areas but are abundant in regions with rivers and wide alluvial plains, although reserves appear at depths greater than 4m. The distribution of aggregate resources in Nonsan City is influenced by stream activities and sea level changes, with the tidal range of the Yellow Sea acting as an unfavorable condition for the preservation of aggregate resources.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.10
• /
• pp.2595-2606
• /
• 1995

Buoyancy-assisted melting of an unconstrained ice in an isothermally heated horizontal enclosure was numerically analyzed in a range of wall temperatures encompassing the density inversion point. The problem as posed here involves two physically distinct domains each of which has its own scales and respective heat transfer mode. These two domains join at the junction where the liquid squeezed out of the film region flushes into the lower melt pool. Both of these domains have been treated separately in the literature by a patching technique which invokes several, otherwise unnecessary, assumptions. The present study eliminates successfully such a superfluous procedure by treating the film and lower melt pool regions as a single domain. As a result of this efficient solution procedure, the interaction of the water stream ejected at the junction and the natural convection in the melt pool could be clarified for different wall temperatures. Though limited by two-dimensionality, the present results conformed indirectly the earlier reported transition of the flow pattern, as the wall temperature was increased over the density inversion point. The transient evolution of the melting surface, the time rate of change in melt volume fraction, the local and temporal variation of the heat transfer coefficients are analyzed and presented.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.79-88
• /
• 2008

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.