• Title/Summary/Keyword: stream data

Search Result 2,518, Processing Time 0.03 seconds

The Design and Implementation of the Real-time Data Stream Server for Continuity of Care Record (실시간 헬스케어 시스템을 위한 데이터 스트림 서버의 설계 및 구현)

  • Wu, Zejun;Li, Yan;Bae, Hae-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.12
    • /
    • pp.71-81
    • /
    • 2011
  • The EMR management services can monitoring the patients' record with any doctors in any hospital by using the internet and smartphones online. To handle the real time, multidimensional, continuous data, database management systems (DBMS) must cope with high insert rates for updates, however the traditional DBMS suffers from processing these kinds of data due to its serious design bottlenecks. So the researchers put forward to Data Stream Management System (DSMS). In this paper we describe the real-time Data Stream Server for Continuity of Care Record (CCR) that including continuos query processor. This system is compiled with DSMS and DBMS in EMR system for processing and monitoring the coming CCR data stream, and also storing the processed result with high-efficiency. The system enables users not only to query stored CCR information from DBMS, but also to execute continue query on real-time CCR Data Stream, and health information can be transferred between different healthcare providers that would reduce medical error. At last, we develop a IPhone mobile application to test the proposed real-time data stream server.

Estimation of Stream Geomorphological Characteristics Based on the Informational Entropy (정보엔트로피 개념에 의한 하천 지형특성인자의 산정)

  • Jeon, Min-Woo;Lee, Dae-Gyu
    • Journal of Wetlands Research
    • /
    • v.11 no.2
    • /
    • pp.89-98
    • /
    • 2009
  • This study determines the stream mean slope, stream slope and longitudinal stream profile based on the concept of informational entropy. Maximizing the entropy will make the probability distribution of longitudinal stream profile as uniform as possible while satisfying the constraints. Using this relationships the mean stream slope, stream slope and longitudinal stream profile formulas were derived. The parameters of the applied streams were estimated by the least square method using the geomorphological factors of Dalchon stream basin obtained from Chungcheong Buk-Do local stream consolidation scheme drawings. The comparative investigation was performed between the observed and simulated mean stream slope and longitudinal stream profile, and are in good agreement with the measured data. It is noted that this results can be used in the estimation of stream mean slope and longitudinal stream profile.

  • PDF

Mining of Frequent Structures over Streaming XML Data (스트리밍 XML 데이터의 빈발 구조 마이닝)

  • Hwang, Jeong-Hee
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.23-30
    • /
    • 2008
  • The basic research of context aware in ubiquitous environment is an internet technique and XML. The XML data of continuous stream type are popular in network application through the internet. And also there are researches related to query processing for streaming XML data. As a basic research to efficiently query, we propose not only a labeled ordered tree model representing the XML but also a mining method to extract frequent structures from streaming XML data. That is, XML data to continuously be input are modeled by a stream tree which is called by XFP_tree and we exactly extract the frequent structures from the XFP_tree of current window to mine recent data. The proposed method can be applied to the basis of the query processing and index method for XML stream data.

Stream flow estimation in small to large size streams using Sentinel-1 Synthetic Aperture Radar (SAR) data in Han River Basin, Korea

  • Ahmad, Waqas;Kim, Dongkyun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.152-152
    • /
    • 2019
  • This study demonstrates a novel approach of remotely sensed estimates of stream flow at fifteen hydrological station in the Han River Basin, Korea. Multi-temporal data of the European Space Agency's Sentinel-1 SAR satellite from 19 January, 2015 to 25 August, 2018 is used to develop and validate the flow estimation model for each station. The flow estimation model is based on a power law relationship established between the remotely sensed surface area of water at a selected reach of the stream and the observed discharge. The satellite images were pre-processed for thermal noise, radiometric, speckle and terrain correction. The difference in SAR image brightness caused by the differences in SAR satellite look angle and atmospheric condition are corrected using the histogram matching technique. Selective area filtering is applied to identify the extent of the selected stream reach where the change in water surface area is highly sensitive to the change in stream discharge. Following this, an iterative procedure called the Optimum Threshold Classification Algorithm (OTC) is applied to the multi-temporal selective areas to extract a series of water surface areas. It is observed that the extracted water surface area and the stream discharge are related by the power law equation. A strong correlation coefficient ranging from 0.68 to 0.98 (mean=0.89) was observed for thirteen hydrological stations, while at two stations the relationship was highly affected by the hydraulic structures such as dam. It is further identified that the availability of remotely sensed data for a range of discharge conditions and the geometric properties of the selected stream reach such as the stream width and side slope influence the accuracy of the flow estimation model.

  • PDF

Analysis of Hydrodynamic Characteristics Apply to Nature-Friendly Stream Protection Method (자연형 호안공법을 적용한 소하천의 수리특성 분석)

  • Lee, Gang-Seuk;Park, Jong-Hwa;Yeon, Kyu-Bang
    • KCID journal
    • /
    • v.17 no.2
    • /
    • pp.71-81
    • /
    • 2010
  • Stream Pilot Project, which began in May 2003 and finished in December 2003, was selected to develop effective methods applicable to nature-like streams. Stream restoration projects aim to maintain or increase ecosystem goods and services while protecting downstream and coastal ecosystems. Fields environmental monitoring such as flow discharge and precipitation were conducted along the Idong stream for amount of channel zone change in 2007. This study selected three monitoring positions to measure the water level and discharge of flowing water. A stage-discharge relation is obtained from direct discharge measurements for three stations by fitting an empirical relationship to the data set. Since discharge measures are made only for low flow conditions, a curve of discharge against stage can then be built by fitting these data with a power curve. And this study used data obtained from floodmark checkup as well as HEC-RAS model to analyze the hydrodynamic characteristics of monitoring sites. Reach-averaged hydraulic parameters for the supply reach were calculated from the small area's HEC-RAS model for Idong stream, and a HEC-RAS model used to analyze hydraulics for a period in 2007, after the stream was considered bank stabilization.

  • PDF

An Adaptive Grid-based Clustering Algorithm over Multi-dimensional Data Streams (적응적 격자기반 다차원 데이터 스트림 클러스터링 방법)

  • Park, Nam-Hun;Lee, Won-Suk
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.733-742
    • /
    • 2007
  • A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Due to this reason, memory usage for data stream analysis should be confined finitely although new data elements are continuously generated in a data stream. To satisfy this requirement, data stream processing sacrifices the correctness of its analysis result by allowing some errors. The old distribution statistics are diminished by a predefined decay rate as time goes by, so that the effect of the obsolete information on the current result of clustering can be eliminated without maintaining any data element physically. This paper proposes a grid based clustering algorithm for a data stream. Given a set of initial grid cells, the dense range of a grid cell is recursively partitioned into a smaller cell based on the distribution statistics of data elements by a top down manner until the smallest cell, called a unit cell, is identified. Since only the distribution statistics of data elements are maintained by dynamically partitioned grid cells, the clusters of a data stream can be effectively found without maintaining the data elements physically. Furthermore, the memory usage of the proposed algorithm is adjusted adaptively to the size of confined memory space by flexibly resizing the size of a unit cell. As a result, the confined memory space can be fully utilized to generate the result of clustering as accurately as possible. The proposed algorithm is analyzed by a series of experiments to identify its various characteristics

Dynamic Load Shedding Scheme based on Input Rate of Spatial Data Stream and Data Density (공간 데이터스트림의 입력 빈도와 데이터 밀집도 기반의 동적 부하제한 기법)

  • Jeong, Weonil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.2158-2164
    • /
    • 2015
  • In u-GIS environments, various load shedding techniques have been researched in order to balance loads caused by input spatial data streams. However, typical load shedding methods on aspatial data lack regard for characteristics of spatial data, also previous load shedding approaches on spatial, which still lack regard for spatial data density or dynamic input data stream, give rise to troubles on spatial query processing performance and accuracy. Therefore, dynamic load shedding scheme over spatial data stream is proposed through stored spatial data deviation and load ratio of input data stream in order to improve spatial continuous query accuracy and performance in u-GIS environment. In proposed scheme, input data which are a big probability related to spatial continuous query may be a strong chance to be dropped relatively.

An Efficient Cache Mechanism for Improving Response Times in Integrated RFID Middleware (통합 RFID 미들웨어의 응답시간 개선을 위한 효과적인 캐쉬 구조 설계)

  • Kim, Cheong-Ghil;Lee, Jun-Hwan;Park, Kyung-Lang;Kim, Shin-Dug
    • The KIPS Transactions:PartA
    • /
    • v.15A no.1
    • /
    • pp.17-26
    • /
    • 2008
  • This paper proposes an efficient caching mechanism appropriate for the integrated RFID middleware which can integrate wireless sensor networks (WSNs) and RFID (radio frequency identification) systems. The operating environment of the integrated RFID middleware is expected to face the situations of a significant amount of data reading from RFID readers, constant stream data input from large numbers of autonomous sensor nodes, and queries from various applications to history data sensed before and stored in distributed storages. Consequently, an efficient middleware layer equipping with caching mechanism is inevitably necessary for low latency of request-response while processing both data stream from sensor networks and history data from distributed database. For this purpose, the proposed caching mechanism includes two optimization methods to reduce the overhead of data processing in RFID middleware based on the classical cache implementation polices. One is data stream cache (DSC) and the other is history data cache (HDC), according to the structure of data request. We conduct a number of simulation experiments under different parameters and the results show that the proposed caching mechanism contributes considerably to fast request-response times.

A Fuzzy Window Mechanism for Information Differentiation in Mining Data Streams (데이터 스트림 마이닝에서 정보 중요성 차별화를 위한 퍼지 윈도우 기법)

  • Chang, Joong-Hyuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.9
    • /
    • pp.4183-4191
    • /
    • 2011
  • Considering the characteristics of a data stream whose data elements are continuously generated and may change over time, there have been many techniques to differentiate the importance of data elements in a data stream by their generation time. The conventional techniques are efficient to get an analysis result focusing on the recent information in a data stream, but they have a limitation to differentiate the importance of information in various ways more flexible. An information differentiation technique based on the term of a fuzzy set can be an alternative way to compensate the limitation. A term of a fuzzy set has been widely used in various data mining fields, which can overcome the sharp boundary problem and give an analysis result reflecting the requirements in real world applications more. In this paper, a fuzzy window mechanism is proposed, which is adapting a term of a fuzzy set and is efficiently used to differentiate the importance of information in mining data streams. Basic concepts including fuzzy calendars are described first, and subsequently details on data stream mining of weighted patterns using a fuzzy window technique are described.

A Human Movement Stream Processing System for Estimating Worker Locations in Shipyards

  • Duong, Dat Van Anh;Yoon, Seokhoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.135-142
    • /
    • 2021
  • Estimating the locations of workers in a shipyard is beneficial for a variety of applications such as selecting potential forwarders for transferring data in IoT services and quickly rescuing workers in the event of industrial disasters or accidents. In this work, we propose a human movement stream processing system for estimating worker locations in shipyards based on Apache Spark and TensorFlow serving. First, we use Apache Spark to process location data streams. Then, we design a worker location prediction model to estimate the locations of workers. TensorFlow serving manages and executes the worker location prediction model. When there are requirements from clients, Apache Spark extracts input data from the processed data for the prediction model and then sends it to TensorFlow serving for estimating workers' locations. The worker movement data is needed to evaluate the proposed system but there are no available worker movement traces in shipyards. Therefore, we also develop a mobility model for generating the workers' movements in shipyards. Based on synthetic data, the proposed system is evaluated. It obtains a high performance and could be used for a variety of tasksin shipyards.