• Title/Summary/Keyword: Multiple Stream Data

Search Result 178, Processing Time 0.022 seconds

Development of a distributed hydrological model considering hydrological change

  • Kim, Deasik;An, Hyunuk;Jang, Minwon;Kim, Seongjoon
    • Korean Journal of Agricultural Science
    • /
    • v.45 no.3
    • /
    • pp.521-532
    • /
    • 2018
  • In recent decades, the dry stream phenomena of small and medium sized rivers have been attracting much attention as an important social problem. To prevent dry stream phenomena, it is necessary to build an infrastructure that manages rivers. To accurately determine the progress of dry stream phenomena, it is necessary to continuously measure the discharge and other hydrological factors for small and medium sized rivers. However, until now, the flow data for small and medium rivers in Korea has been insufficient. To overcome the lack of supporting data for supporting rational decision-making in policy and project implementation, a short- and long-term hydrological model was developed that takes into consideration hydrological changes such as the increase of the impervious area due to urban development and groundwater pumping, the construction of a large-scale sewage treatment plant, the maintenance of stream-oriented rivers, etc. In the developed model, the distributed grid is represented by three layers: Surface flow, interflow, and groundwater flow. The surface flow and intermediate flow flowed along the flow direction, and the groundwater flow was calculated by a two-dimensional groundwater analysis model such that the outflow occurred in all directions without a specific flow direction. The effects of land use and cover on evapotranspiration and infiltration and the effects of multiple landscapes can be simulated in the developed model.

Application of a Decision Support System for Total Maximum Daily Loads (오염총량관리를 위한 의사결정 지원시스템 적용)

  • Lee, Hye-Young;Park, Seok-Soon
    • Journal of Korean Society on Water Environment
    • /
    • v.20 no.2
    • /
    • pp.151-156
    • /
    • 2004
  • A decision support system, Watershed Analysis Risk Management Framework(WARMF), was applied to the Kyungan Stream watershed, a tributary of Lake Paldang, for calculation of total maximum daily loads(TMDL). The WARMF system was developed by Systech Engineering, USA, and has been successfully used in several watersheds, for TMDL studies. The study area was divided into 14 sub-basins, based on digital elevation model(DEM). The integrated watershed and stream model of WARMF was validated by flow and BOD data measured during the year of 1999. There were reasonable agreements between model results and field data, both in water flow and BOD. The validated Kyungan WARMF was extensively utilized to study the quantitative relationship between waste loads and receiving water quality. Based on TMDL guideline at Paldang Lake and Kyungan Stream, the water quality criterion were set to be 3.0mg/L, 3.5mg/L, and 4.0mg/L at the watershed outlet. The allowable waste loads of BOD, both from point and non-point sources, were determined at each water quality criterion. From this study, it was concluded that the WARMF provided several advantages over the conventional application of watershed and stream models for TMDL study, such as time variable simulations, multiple possible soutions, and reduction loads for goal water quality, etc.

Incremental Regression based on a Sliding Window for Stream Data Prediction (스트림 데이타 예측을 위한 슬라이딩 윈도우 기반 점진적 회귀분석)

  • Kim, Sung-Hyun;Jin, Long;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.34 no.6
    • /
    • pp.483-492
    • /
    • 2007
  • Time series of conventional prediction techniques uses the model which is generated from the training step. This model is applied to new input data without any change. If this model is applied directly to stream data, the rate of prediction accuracy will be decreased. This paper proposes an stream data prediction technique using sliding window and regression. This technique considers the characteristic of time series which may be changed over time. It is composed of two steps. The first step executes a fractional process for applying input data to the regression model. The second step updates the model by using its information as new data. Additionally, the model is maintained by only recent data in a queue. This approach has the following two advantages. It maintains the minimum information of the model by using a matrix, so space complexity is reduced. Moreover, it prevents the increment of error rate by updating the model over time. Accuracy rate of the proposed method is measured by RME(Relative Mean Error) and RMSE(Root Mean Square Error). The results of stream data prediction experiment are performed by the proposed technique IMQR(Incremental Multiple Quadratic Regression) is more efficient than those of MLR(Multiple Linear Regression) and SVR(Support Vector Regression).

Parallel Speedup of NTGST on SIMD type Multiprocessor (SIMD 구조의 다중 프로세서를 이용한 NTGST의 병렬고속화)

  • 김복만;서경석;김종화;최흥문
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.127-130
    • /
    • 2001
  • 본 논문에서는 SIMD (Single Instruction stream and Multiple Data stream)형 병렬 구조의 다중 프로세서를 이용하여 NTGST (noise-tolerant generalized symmetry transform)를 병렬 고속화하였다. 먼저 NTGST의 화소 및 영상 영역간의 계산 독립성을 이용하여 영상을 분할하여 P개의 프로세서에 할당하고, 이들 각각을 N개의 데이터를 한번에 처리하는 SIMD 구조로 병렬화하여 NP에 비례하는 속도 향상을 얻었다. 실험에서 MMX 기술의 펜티엄 Ⅲ 프로세서를 2개 사용하여 제안한 알고리즘이 기존의 NTGST 보다 8배 가까이 고속으로 처리됨을 확인하였다.

  • PDF

Distributed Indexing Methods for Moving Objects based on Spark Stream

  • Lee, Yunsou;Song, Seokil
    • International Journal of Contents
    • /
    • v.11 no.1
    • /
    • pp.69-72
    • /
    • 2015
  • Generally, existing parallel main-memory spatial index structures to avoid the trade-off between query freshness and CPU cost uses light-weight locking techniques. However, still, the lock based methods have some limits such as thrashing which is a well-known problem in lock based methods. In this paper, we propose a distributed index structure for moving objects exploiting the parallelism in multiple machines. The proposed index is a lock free multi-version concurrency technique based on the D-Stream model of Spark Stream. The proposed method exploits the multiversion nature of D-Stream of Spark Streaming.

Customized Digital TV System for Individuals/Communities based on Data Stream Mining (데이터 스트림 마이닝 기법을 적용한 개인/커뮤니티 맞춤형 Digital TV 시스템)

  • Shin, Se-Jung;Lee, Won-Suk
    • The KIPS Transactions:PartD
    • /
    • v.17D no.6
    • /
    • pp.453-462
    • /
    • 2010
  • The switch from analog to digital broadcast television is extended rapidly. The DTV can offer multiple programming choices, interactive capabilities and so on. Moreover, with the spread of Internet, the information exchange between the communities is increasing, too. These facts lead to the new TV service environment which can offer customized TV programs to personal/community users. This paper proposes a 'Customized Digital TV System for Individuals/Communities based on Data Stream Mining' which can analyze user's pattern of TV watching behavior. Due to the characteristics of TV program data stream and EPG(electronic program guide), the data stream mining methods are employed in the proposed system. When a user is watching DTV, the proposed system can control the surrounding circumstances as using the user behavior profiles. Furthermore, the channel recommendation system on the smart phone environment is proposed to utilize the profiles widely.

The XP-table: Runtime-efficient Region-based Structure for Collective Evaluation of Multiple Continuous XPath Queries (The XP-table: 다중 연속 XPath 질의의 집단 처리를 위한 실행시간 효율적인 영역 기반 구조체)

  • Lee, Hyun-Ho;Lee, Won-Suk
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.307-318
    • /
    • 2008
  • One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML seams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new region-based data structure, called an XP-table, by sharing their common constraints. An XP-table is matched with a stream relation (SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the runtime workload of continuous query processing. Also, system performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear- scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.

A Simulation-Based Study of FAST TCP Compared to SCTP: Towards Multihoming Implementation Using FAST TCP

  • Arshad, Mohammad Junaid;Saleem, Mohammad
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.275-284
    • /
    • 2010
  • The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

Effects of blade configuration and solidity on starting torque of Darrieus wind turbine

  • Roh, Sung-Cheoul;Kang, Seung-Hee
    • Wind and Structures
    • /
    • v.32 no.2
    • /
    • pp.169-177
    • /
    • 2021
  • This study investigates the effects of blade configuration and solidity of Darrieus wind turbine on the starting torque characteristics. Generally, the configuration of Darrieus wind turbine is divided into Troposkien, parabola, Catenary, Sandia, modified-parabola and straight types. A numerical analysis has been carried out using Multiple Stream Tube (MST) method to investigate the effect of blade configuration and solidity of Darrieus wind turbine on the starting torque under the initial low range of rotational speed. The simulation results show that the starting torque of Darrieus wind turbine varies considerably depending on the blade configuration. The initial starting torque was larger with Troposkien, Parabola, Catenary, and Sandia configurations than with modified parabola or straight types. The increase in solidity with increasing number of blades raised the starting torque and improved the dynamic stability during the initial operational speed of Darrieus wind turbine. Additionally, these torque results represent basic data for fluid-structure interaction (FSI) simulation of the steady-dynamic operation of the turbine.

Efficient Processing of an Aggregate Query Stream in MapReduce (맵리듀스에서 집계 질의 스트림의 효율적인 처리 기법)

  • Choi, Hyunjean;Lee, Ki Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.2
    • /
    • pp.73-80
    • /
    • 2014
  • MapReduce is a widely used programming model for analyzing and processing Big data. Aggregate queries are one of the most common types of queries used for analyzing Big data. In this paper, we propose an efficient method for processing an aggregate query stream, where many concurrent users continuously issue different aggregate queries on the same data. Instead of processing each aggregate query separately, the proposed method processes multiple aggregate queries together in a batch by a single, optimized MapReduce job. As a result, the number of queries processed per unit time increases significantly. Through various experiments, we show that the proposed method improves the performance significantly compared to a naive method.