• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.575-580
• /
• 2018

This paper discusses system for real-time monitoring of patient waiting time in hospitals based on open-source platform. It is necessary to make use of open-source projects to develop a high-performance stream processing system, which analyzes and processes stream data in real time, with less cost. The Hadoop ecosystem is a well-known big data processing platform consisting of numerous open-source subprojects. This paper first defines several requirements for the monitoring system, and selects a few projects from the Hadoop ecosystem that are suited to meet the requirements. Then, the paper proposes system architecture and a detailed module design using Apache Spark, Apache Kafka, and so on. The proposed system can reduce development costs by using open-source projects and by acquiring data from legacy hospital information system. High-performance and fault-tolerance of the system can also be achieved through distributed processing.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.451-458
• /
• 2005

The transcoding is a solution which is able to adapt to heterogeneous clients of requesting a different playback rate of multimedia data. Thus, The transcoding needs decoding and encoding. In general, previous studies to reduce complexity have a problem, the degradation of visual quality On the contrary, previous studies to reduce the degradation of visual quality lead to heavy computation. Thus, many researchers have studied a solution between the complexity and the degradation of visual quality. But until now, most researches of this region have dealt with the transcoder itself, such researches about a server's assistance to improve the performance of transcoder is rarely studied. In case of servicing multimedia data to heterogeneous clients which have low capabilities, the assistance of server side is able to reduce frames with processing in the transcoder and improve the performance of the transcoder. Thus in this paper, we propose the frame-skipping transcoder system architecture that takes into consideration transcoder and server side to reduce the complexity of the transcoder.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.121-132
• /
• 2000

Most of video indexing applications depend on fast and efficient archiving, browsing, retrieval techniques. A number of techniques have been approached about only pixel domain analysis until now. Those approaches brought about the costly overhead of decompressing because the most of multimedia data is typically stored in compressed format. But with a compressed video data, if we can analyze the compressed data directly. then we avoid the costly overhead such as in pixel domain. In this paper, we analyze the information of compressed video stream directly, and then extract the available features for video indexing. We have derived the technique for cut detection using these features, and the stream is divided into shots. Also we propose a new brief key frame selection technique and an efficient video indexing method using the spatial informations(DT coefficients) and also the temporal informations(motion vectors).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.290-293
• /
• 2015

개개인의 데이터가 비즈니스적으로 중요하지 않을 수 있지만, 대량으로 모으면 그 안에 숨겨진 새로운 정보를 발견할 가능성이 있는 데이터의 집합체로 빅데이터 분석 활용 사례는 점차 늘어나는 추세이다. 빅데이터 분석 기술 중 전통적인 데이터 분석방법인 하둡(Hadoop)은 예전부터 현재에 이르기까지 정형 비정형 빅데이터 분석에 널리 사용되고 있는 기술이다. 하지만 하둡은 배치성 처리 시스템으로 데이터가 많아질수록 응답 지연이 발생할 가능성이 높아, 현재 기업 경영환경과 시장환경에 대한 엄청난 양의 고속 이벤트 데이터에 대한 실시간 분석이 어려운 상황이다. 본 논문에서는 급변하는 비즈니스 환경에 대한 대안으로 오픈소스 CEP(Complex Event Processing)기반 기술을 사용하여 초당 수백에서 수십만건 이상의 이벤트 스트림을 실시간으로 지연 없이 분석가능하게 하는 실시간 분석 시스템을 개발하여 병원 ERP시스템에 적용하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.94-100
• /
• 2010

Data Mining is mainly used for pattern extracting and information discovery from collected data. However previous methods is difficult to reflect changing patterns with time. In this paper, we introduce Streaming Decision Tree(SDT) analyzing data with continuity, large scale, and changed patterns. SDT defines continuity data as blocks and extracts rules using a Decision Tree's learning method. The extracted rules are combined considering time of occurrence, frequency, and contradiction. In experiment, we applied time series data and confirmed resonable result.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.131-134
• /
• 2024

본 논문에서는 기존 철도 운영 및 관리시에 철도 주변환경으로 부터 발생하는 소음, 진동, 미세먼지 센서에서 다양한 실시간 스트림 데이터를 감지하고 정형화된된 데이터 패턴을 인식하고 분석할 수 있도록 데이터를 구성 및 저장하고 분석된 데이터를 표현할 수 있도록 시각화 지원을 위한 모니터링 시스템 플랫폼을 구현하였다. 데이터 전송을 위해 시리얼 통신 기법을 주로 적용하였으나, 센서와 디바이스의 증가로 인해 시리얼 통신의 한계가 나타났다. 따라서, 본 연구에서는 기존의 아두이노와 서버 간의 직접 통신 방식 대신 라즈베리파이를 도입하여 MQTT Broker(브로커)를 설치하고 통신을 진행하였다. 철도 데이터 모니터링 시스템 플랫폼은 NoSQL 데이터베이스인 MonGoDB와 데이터 시각화할 수 있는 Grafana를 이용하여 구축하였다.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.208-215
• /
• 2003

For playing a multimedia presentation in a Internet, the case that the presentation QoS(Quality of Services) at a destination nay be different from the QoS of multimedia data at the source occurs frequently. In this case, the process of trancoding the multimedia data at the source Into the multimedia data satisfying the QoS at the destination should be requited. In addition, even the presentation description having the homogeneous QoS at both sides may have different transcoding paths due to the limitation of display terminals or network bandwidth. That is, for a multimedia description, it is required to regenerate a proper transcoding path whenever the displaying terminals or the network environment gets decided. And the delay time required to go through the transcoding path may affect the playability of the give presentation. Therefore it should be checked whether the presentation requiring a transcoding process is able to be played in a real time. In this paper, the algorithm for generating all the possible transcoding paths for a given multimedia description under a fixed set of transcoders and the network environment is proposed. The algorithm adopts the concept of QoS transition diagram to Prevent from a trancoding Path being cycled by the repetition of a cyclic Path which generates the same QoS of multimedia data as its input QoS. By eliminating all the cyclic Paths, the algorithm can guarantee the termination of the process. And for the playability check, a method of computing the transcoding time and the delay lime between logical data units are proposed.Finally all the proposed methods were implemented in the stream engine, called TransCore and the presentation-authoring tool, called VIP, we had developed. And the test results with sample scenarios were presented at the last.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3651-3667
• /
• 2000

Recently, in the distributed multimedia environments based on internet, as radical growing technologies, the most of researchers focus on both streaming technology and distributed object thchnology, Specially, the studies which are tried to integrate the streaming services on the distributed object technology have been progressing. These technologies are applied to various stream service mamgements and protocols. However, the stream service management mexlels which are being proposed by the existing researches are insufficient for suporting the QoS of stream services. Besides, the existing models have the problems that cannot support the extensibility and the reusability, when the QoS-reiatedfunctions are being developed as a sub-module which is suited on the specific-purpose application services. For solving these problems, in this paper. we suggested a QoS Integrated platform which can extend and reuse using the distributed object technologies, and guarantee the QoS of the stream services. A structure of platform we suggested consists of three components such as User Control Module(UCM), QoS Management Module(QoSM) and Stream Object. Stream Object has Send/Receive operations for transmitting the RTP packets over TCP/IP. User Control ModuleI(UCM) controls Stream Objects via the COREA service objects. QoS Management Modulel(QoSM) has the functions which maintain the QoS of stream service between the UCMs in client and server. As QoS control methexlologies, procedures of resource monitoring, negotiation, and resource adaptation are executed via the interactions among these comiXments mentioned above. For constmcting this QoS integrated platform, we first implemented the modules mentioned above independently, and then, used IDL for defining interfaces among these mexlules so that can support platform independence, interoperability and portability base on COREA. This platform is constructed using OrbixWeb 3.1c following CORBA specification on Solaris 2.5/2.7, Java language, Java, Java Media Framework API 2.0, Mini-SQL1.0.16 and multimedia equipments. As results for verifying this platform functionally, we showed executing results of each module we mentioned above, and a numerical data obtained from QoS control procedures on client and server's GUI, while stream service is executing on our platform.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.343-356
• /
• 2007

Due to advances in position monitoring technologies such as global positioning systems and sensor networks, recent position information of moving objects has the form of streaming data which are updated continuously and rapidly. In this paper we propose an efficient trajectory maintenance method that stores the streaming position data of moving objects in the limited size of storage space and estimates past positions based on the stored data. For this, we first propose a new concept of incremental extraction of position information. The incremental extraction means that, whenever a new position is added into the system, we incrementally re-compute the new version of past position data maintained in the system using the current version of past position data and the newly added position. Next, based on the incremental extraction, we present an overall framework that stores position information and estimates past positions in the stream environment. We then propose two polynomial-based methods, line-based and curve-based methods, as the method of estimating the past positions on the framework. We also propose three incremental extraction methods: equi-width, slope-based, and recent-emphasis extraction methods. Experimental results show that the proposed incremental extraction provides the relatively high accuracy (error rate is less than 3%) even though we maintain only a little portion (only 0.1%) of past position information. In particular, the curve-based incremental extraction provides very low error rate of 1.5% even storing 0.1% of total position data. These results indicate that our incremental extraction methods provide an efficient framework for storing the position information of moving objects and estimating the past positions in the stream environment.