• Title/Summary/Keyword: interval-based events

Search Result 76, Processing Time 0.034 seconds

A Method for Predicting Effect based on the Causal relations of Interval Events (인터벌이벤트의 인과관계에 기초한 영향력 예측 기법)

  • Song, Myung-Jin;Kim, Dae-In;Hwang, Bu-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.793-794
    • /
    • 2009
  • 이벤트 사이에 존재하는 연관 정보를 탐사함으로서 발생 가능한 이벤트를 예측할 수 있다. 그러나 기존의 시간 데이터마이닝 기법은 어느 정도 영향을 주고받았는지에 대한 영향력은 예측할 수 없다. 본 논문에서는 인터벌이벤트 사이에 존재하는 연관 정보를 탐사하고 탐사된 규칙에 대한 영향력을 측정할 수 있는 방법을 제안한다. 제안 방법은 이벤트 지속성을 고려하여 인터벌이벤트를 구성하고 빈발 이벤트 사이에 존재하는 연관 정보에 대한 영향력 정도를 측정한다. 그리고 이벤트 발생에 대한 주요한 원인이벤트를 탐사함으로서 이벤트 인과관계에 대한 다양한 정보를 제공할 수 있다.

A Method for Predicting Event Occurrence based on the Relations of Frequent Interval Events (빈발 인터벌 이벤트 관계에 기반한 이벤트 발생 예측 방법)

  • Song, Myung-Jin;Kim, Dae-In;Hwang, Bu-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.298-301
    • /
    • 2009
  • 시간 속성을 갖는 이벤트들의 집합에서 이벤트들 사이의 인과관계를 보다 정확히 파악할 수 있는 방법의 개발은 의료 분야 등의 응용에서 미리 발생할 이벤트에 발생 시점 예측을 위하여 필요하다. 본 논문은 이벤트들의 시퀀스를 독립적인 서브 시퀀스로 나누고 각 서브 시퀀스를 인터벌을 갖는 이벤트로 요약하여 인터벌 이벤트들 사이의 관계를 표현한다. 그리고 인터벌 이벤트 관계에서 원인 인터벌 이벤트가 결과 이벤트에 미친 영향 정도의 측정 방법을 개발하고 실험을 통하여 사용한 척도의 의미와 정확성을 파악한다. 실험 결과는 제안 방법이 지지도 기반의 평가보다 보다 우수함을 입증한다.

A study on training DenseNet-Recurrent Neural Network for sound event detection (음향 이벤트 검출을 위한 DenseNet-Recurrent Neural Network 학습 방법에 관한 연구)

  • Hyeonjin Cha;Sangwook Park
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.5
    • /
    • pp.395-401
    • /
    • 2023
  • Sound Event Detection (SED) aims to identify not only sound category but also time interval for target sounds in an audio waveform. It is a critical technique in field of acoustic surveillance system and monitoring system. Recently, various models have introduced through Detection and Classification of Acoustic Scenes and Events (DCASE) Task 4. This paper explored how to design optimal parameters of DenseNet based model, which has led to outstanding performance in other recognition system. In experiment, DenseRNN as an SED model consists of DensNet-BC and bi-directional Gated Recurrent Units (GRU). This model is trained with Mean teacher model. With an event-based f-score, evaluation is performed depending on parameters, related to model architecture as well as model training, under the assessment protocol of DCASE task4. Experimental result shows that the performance goes up and has been saturated to near the best. Also, DenseRNN would be trained more effectively without dropout technique.

A Study on HVDC Underwater Cable Monitoring Technology Based on Distributed Fiber Optic Acoustic Sensors (분포형 광섬유 음향 센서 기반 HVDC 해저케이블 모니터링 기술 연구)

  • Youngkuk Choi;Hyoyoung Jung;Huioon Kim;Myoung Jin Kim;Hee-Woon Kang;Young Ho Kim
    • Journal of Sensor Science and Technology
    • /
    • v.32 no.3
    • /
    • pp.199-206
    • /
    • 2023
  • This study presents a novel monitoring technique for underwater high-voltage direct current (HVDC) cables based on the Distributed Acoustic Sensor (DAS). The proposed technique utilizes vibration and acoustic signals generated on HVDC cables to monitor their condition and detect events such as earthquakes, shipments, tidal currents, and construction activities. To implement the monitoring system, a DAS based on phase-sensitive optical time-domain reflectometry (Φ-OTDR) system was designed, fabricated, and validated for performance. For the HVDC cable monitoring experiments, a testbed was constructed on land, mimicking the cable burial method and protective equipment used underwater. Defined various scenarios that could cause cable damage and conducted experiments accordingly. The developed DAS system achieved a maximum measurement distance of 50 km, a distance measurement interval of 2 m, and a measurement repetition rate of 1 kHz. Extensive experiments conducted on HVDC cables and protective facilities demonstrated the practical potential of the DAS system for monitoring underwater and underground areas.

Development of a shot noise process based rainfall-runoff model for urban flood warning system (도시홍수예경보를 위한 shot noise process 기반 강우-유출 모형 개발)

  • Kang, Minseok;Yoo, Chulsang
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.1
    • /
    • pp.19-33
    • /
    • 2018
  • This study proposed a rainfall-runoff model for the purpose of real-time flood warning in urban basins. The proposed model was based on the shot noise process, which is expressed as a sum of shot noises determined independently with the peak value, decay parameter and time delay of each sub-basin. The proposed model was different from other rainfall-runoff models from the point that the runoff from each sub-basin reaches the basin outlet independently. The model parameters can be easily determined by the empirical formulas for the concentration time and storage coefficient of a basin and those of the pipe flow. The proposed model was applied to the total of three rainfall events observed at the Jungdong, Guro 1 and Daerim 2 pumping stations to evaluate its applicability. Summarizing the results is as follows. (1) The unit response function of the proposed model, different from other rainfall-runoff models, has the same shape regardless of the rainfall duration. (2) The proposed model shows a convergent shape as the calculation time interval becomes smaller. As the proposed model was proposed to be applied to urban basins, one-minute of calculation time interval would be most appropriate. (3) Application of the one-minute unit response function to the observed rainfall events showed that the simulated runoff hydrographs were very similar to those observed. This result indicates that the proposed model has a good application potential for the rainfall-runoff analysis in urban basins.

Index-based Searching on Timestamped Event Sequences (타임스탬프를 갖는 이벤트 시퀀스의 인덱스 기반 검색)

  • 박상현;원정임;윤지희;김상욱
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.468-478
    • /
    • 2004
  • It is essential in various application areas of data mining and bioinformatics to effectively retrieve the occurrences of interesting patterns from sequence databases. For example, let's consider a network event management system that records the types and timestamp values of events occurred in a specific network component(ex. router). The typical query to find out the temporal casual relationships among the network events is as fellows: 'Find all occurrences of CiscoDCDLinkUp that are fellowed by MLMStatusUP that are subsequently followed by TCPConnectionClose, under the constraint that the interval between the first two events is not larger than 20 seconds, and the interval between the first and third events is not larger than 40 secondsTCPConnectionClose. This paper proposes an indexing method that enables to efficiently answer such a query. Unlike the previous methods that rely on inefficient sequential scan methods or data structures not easily supported by DBMSs, the proposed method uses a multi-dimensional spatial index, which is proven to be efficient both in storage and search, to find the answers quickly without false dismissals. Given a sliding window W, the input to a multi-dimensional spatial index is a n-dimensional vector whose i-th element is the interval between the first event of W and the first occurrence of the event type Ei in W. Here, n is the number of event types that can be occurred in the system of interest. The problem of‘dimensionality curse’may happen when n is large. Therefore, we use the dimension selection or event type grouping to avoid this problem. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than the sequential scan and ISO-Depth index methods.hods.

Automatic Event Clustering Method for Personal Photo Collection on Mobile Phone (휴대폰 상에서 개인용 사진 컬렉션에 대한 자동 이벤트 군집화 방법)

  • Yu, Jeong-Soo;Nang, Jong-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1269-1273
    • /
    • 2010
  • Typically users prefer to manage and access personal photo collections taken from a cell phone based on events. In this paper we propose an event clustering algorithm that requires low computation cost with high accuracy supporting incremental operation. The proposed method is based on the statistical analysis of the elapsed interval of intra-event photos on the real sample data for the decision of an event boundary. We then incorporate both location and visual information for the ambiguous range to split with only temporal cue. According to test results, we show higher performance compared to existing general clustering approaches.

Finding Pseudo Periods over Data Streams based on Multiple Hash Functions (다중 해시함수 기반 데이터 스트림에서의 아이템 의사 주기 탐사 기법)

  • Lee, Hak-Joo;Kim, Jae-Wan;Lee, Won-Suk
    • Journal of Information Technology Services
    • /
    • v.16 no.1
    • /
    • pp.73-82
    • /
    • 2017
  • Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

An Effective Method to Reduce IPTV Channel Zapping Times using Pushed Number Key Information and Interval Time of the Events (IPTV에서 채널 번호 키 입력 이벤트가 발생 시 해당 숫자 정보와 이벤트간의 시간차를 활용하여 채널 변경 시간을 단축하는 방법)

  • Ryu, Joon-Hyuk;Youn, Hee-Yong
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.444-452
    • /
    • 2010
  • To avoid a channel zapping delay, the device needs to predict a next channel and must download it. Previous researches suggest algorithms based on assumption by utilizing many data. How to select and download future channels is a main issue in IPTV system. Most proposal based on assumption do not guarantees complete performance of channel zapping. In this paper, we suggest an effective method to avoid a channel zapping time with a constant performance by using a number remote controller key information.

Meta-analysis of Intravitreal Injection of Anti-vascular Endothelial Growth Factors for Diabetic Macular Edema (당뇨황반부종에서 항혈관성장인자의 유효성과 안전성: 네트워크 메타분석)

  • Tchoe, Hajin;Shin, Sang Jin;Suh, Jae Kyung;Cho, Songhee;Yang, Jangmi;Kang, Min Joo;Jee, Donghyun
    • Journal of The Korean Ophthalmological Society
    • /
    • v.60 no.2
    • /
    • pp.144-151
    • /
    • 2019
  • Purpose: Intravitreal aflibercept, ranibizumab, bevacizumab, and dexamethasone are the most widely used drugs in the treatment of diabetic macular edema (DME). The aim of this study was to compare the efficacy and safety of anti-vascular endothelial growth factors and dexamethasone for the treatment of DME. Methods: There were nine previous systematic reviews on this topic; we updated these high-quality reviews. Seven studies were added to two studies following a literature search. Efficacy outcomes were 1) average improvement in visual acuity, 2) proportion of patients who experienced an improvement in vision (an increase in best-corrected visual acuity (BCVA) of ${\geq}15$ in the Early Treatment Diabetic Retinopathy Study [ETDRS]), and 3) proportion of patients who experienced worsening vision (a decrease in BCVA of ${\geq}15$ in the ETDRS). Safety outcomes included systemic adverse events and ocular-related adverse events. Results: The mean difference in the BCVA for ranibizumab versus bevacizumab treatment was 0.16 (95% confidence interval [CI]: -0.02, 0.34), and that for ranibizumab versus aflibercept was -0.08 (95% CI: -0.26, 0.10). The mean difference in the change of BCVA for aflibercept versus ranibizumab was -0.20 (95% CI: -0.40, -0.01), and that for aflibercept versus bevacizumab was -0.34 (95% CI: -0.53, -0.14). Other efficacy outcomes showed similar trends, and there was no significant difference between treatments. There was also no significant difference in both systemic and ocular adverse events rates between the treatments. Conclusions: In DME patients, the efficacy of aflibercept was found to be higher with respect to BCVA changes compared with ranibizumab or bevacizumab. However, there were no significant difference in terms of visual acuity improvement or visual acuity of more than 15 letters, nor in terms of anti-vascular endothelial growth factors (as a safety outcome).